Narrow Results

In many fields, including science, technology, engineering, and communication networks, the idea of domination is used. Double domination is a widely recognized idea of domination concept in graph theory. A prominent crucial factor in network architecture is integrity. A subset $S$ of $V(G)$ is called a double dominating set of $G$ if each vertex of $G$ is dominated at least twice by $S$. In this paper, an algorithm to compute the double domination integrity of graphs is given. Also, an application of double domination integrity in the optimal phasor measurement unit placement problem in a power system is given.

In a communication network, the vulnerability measures are essential to guide the designer in choosing an appropriate topology. They measure the stability of the network to disruption of operation after the failure of certain stations or communication links. If a station or operative is captured in a spy network, then the adjacent stations will be betrayed and are therefore useless in the whole network. In this sense, Margaret B. Cozzens and Shu-Shih Y. Wu modeled a spy network as a graph and then defined the neighbor integrity of a graph to obtain the vulnerability of a spy network [10]. The neighbor integrity of a graph G, is defined to be , where S is any vertex subversion strategy of G and c(G/S) is the maximum order of the components of G/S. In this paper, we investigate the transformation graphs G^-+-, G^+--, G^++-, G^---, G^+-+, G^-++, G^--+ and G⁺⁺⁺ of a graph G, and determine their neighbor integrity.

The concept of vulnerability in a communication network plays an important role when there is a disruption in the network. There exist several graph parameters that measure the vulnerability of a communication network. Domination integrity is one of the vulnerability parameters that measure the performance of a communication network. In this paper, we introduce the concept of paired domination integrity of a graph as a new measure of graph vulnerability. Let $G=(V,E)$ be a simple, connected graph. A set of vertices in a graph $G$, say $S$, is a paired dominating set if the following two conditions are satisfied: (i) every vertex of $G$ has a neighbor in $S$ and (ii) the subgraph induced by $S$ contains a perfect matching. The paired domination integrity of $G$, denoted by $PDI(G)$, is defined as $PDI(G)=min\{|S|+m(G-S):S\text{ is a paired dominating set of G}\}$, where $m(G-S)$ is the order of the largest component in the induced subgraph of $G-S$. In this paper, we determine few bounds relating paired domination integrity with other graph parameters and the paired domination integrity of some classes of graphs.

Storage of data security has emerged as a basic necessity for both large- and small-scale industries. Cloud computing is internet-based computing technology in which people can work with their application with a high level of security in Internet of Things (IoT) enhanced devices. Cloud computing also provides privilege to store data that are collected from the devices in server side. Confidentiality and integrity of data play a major issue in cloud computing while preserving the IoT data. In this paper, the security of data is achieved by performing clustering and further applying cryptographic technique to the clustered data gathered from the devices that connected to the internet. Security of data can be improved by using a prominent cryptographic technique Attribute Based Encryption (ABE). Initially, the documents are clustered using the EM algorithm and clustered results are stored in various parts of the cloud. These documents are secured and can be accessed by the user who satisfies the attributes. In some cases, if the users’ attributes are not satisfied with the documents, it cannot be accessed by the corresponding user. Thus, the data from various devices are encrypted and maintained by the owner securely.

In embedded multicore shared memory systems, processing elements (PEs) are mutually untrusted since they carry different computing tasks independently. Therefore, the sharing of secret constants (SCs) between PEs, which is applied in the existing confidentiality protection schemes, will lead to the leakage of nonshared data. Besides, for integrity protection, tree construction checking over the whole counter space leads to the increase of both memory occupation and the average delay of verification. In this paper, we propose a ciphertext sharing confidentiality protection scheme based on certificateless proxy re-encryption and an integrity protection scheme based on a multigranularity scalable hash tree for secure data sharing between untrusted processing elements (SDSUP). With our schemes, the SC does not need to be shared and the scale of the checking tree is reduced, thus solving the leakage of nonshared data and reducing the high cost in integrity check. The results from the Rice Simulator for ILP Multiprocessors (RSIM) multicore simulator show that compared with the unprotected system, the performance degradation from applying the confidentiality protection scheme is 17.3% on average. Moreover, the performance degradation of the integrity protection scheme is 12.89%, which is superior to 35.36% for the bonsai Merkle tree (BMT), 29.49% for the multigrained hash tree (MGT) and 21.82% for the multigranularity incremental hash tree (MIT).

Since different regions of an image have different importance, therefore only the important information of the image regions, which the users are really interested in, needs to be encrypted and protected emphatically in some special multimedia applications. However, the regions of interest (ROI) are always some irregular parts, such as the face and the eyes. Assuming the bulk data in transmission without being damaged, we propose a chaotic image encryption algorithm for ROI. ROI with irregular shapes are chosen and detected arbitrarily. Then the chaos-based image encryption algorithm with scrambling, S-box and diffusion parts is used to encrypt the ROI. Further, the whole image is compressed with Huffman coding. At last, a message authentication code (MAC) of the compressed image is generated based on chaotic maps. The simulation results show that the encryption algorithm has a good security level and can resist various attacks. Moreover, the compression method improves the storage and transmission efficiency to some extent, and the MAC ensures the integrity of the transmission data.

SINGAPORE – Letting Go.

SINGAPORE & JAPAN – ASLAN Pharmaceuticals Announces First Patient Enrolled in Phase 1 Study of Varlitinib in Japan.

JAPAN & UNITED STATES – Santen and twoXAR Announce Strategic Research Collaboration to Discover New Glaucoma Treatments.

UNITED STATES – New Study Finds Extensive Use of Fluorinated Chemicals in Fast Food Wrappers.

UNITED STATES – What Doesn’t Kill You Makes You Stronger.

UNITED STATES – Non-Invasive Test Offers Quick Skin Cancer Diagnosis.

UNITED STATES – Life Under Pressure.

AUSTRALIA & THAILAND – Commencement of BIT225 Phase 2 HIV-1 Clinical Trial.

CANADA – Understanding the Genetics of Human Height.

TAIWAN – TLC Announces Collaboration with CMUH in Exploring Solutions for Unmet Medical Needs in Oncology and Osteoarthritis.

For a given graph G = (V, E), its integrity is defined as I(G) = min_X⊂V {|X|+m(G−X)}, where m(G−X) denote the order of the largest component of G−X. In [9], authors discuss the minimum integrity of tree with given order and the maximum degree. In this paper, we point that the result in [9] is flawed and by elementary method characterize the structure of the minimum integrity tree and thus correct Theorem 4.1 in [9]. Finally, we give the construction method of this kind of extremal graph.

The integrity of a graph $G$ is defined as the minimum value of $\left|S\right|+m(G-S)$ taken over all $S\subseteq V(G)$, where $m(H)$ denotes the maximum cardinality of a component of graph $H$. In this paper, we investigate bounds on the maximum and minimum values of the weighted version of this parameter. We also consider the same question for the related parameter vertex-neighbor-integrity.

This paper proposes a new approach of multiple and hybrid watermarks using two linked fields of insertion. This approach associates two different series of marks: one is sturdy guaranteeing the supervision of diffused media through the network and testifying to the identity of the owner of the medical image; the other series of marks, which is frail, insuring the integrity, the trace, and the archives of the medical diagnoses. In fact, this approach allows us to be benefited from the advantages of different insertion spaces (spatial and frequency field) and kind of two different fields of watermark. In the spatial field, the diagnosis of the doctor (frail marks) is inserted guaranteeing its records and its trace. In the frequency, the sturdy mark is inserted allowing to ensure the automatic control of the media through the network and testifying to the proprietor of the medical image.

Corrosion is a common phenomenon and critical aspects of steel structural application. It affects the daily design, inspection, and maintenance in structural engineering, especially for the heavy and complex industrial applications, where the steel structures are subjected to hash corrosive environments in combination of high working stress condition and often in open field and/or under high temperature production environments. In the paper, it presents the actual engineering application of advanced finite element methods in the predication of the structural integrity and robustness at a designed service life for the furnaces of alumina production, which was operated in the high temperature, corrosive environments, and rotating with high working stress condition.

While B2C via cloud computing has grown rapidly, information security and trustworthy computation are still major issues in today’s industrial realm. As a result, the routine workflow process varies dynamically over the course of data transactions, resulting in uncertainty. Consumers’ private information becomes easily vulnerable due to such data uncertainty. Intruders/fake marketers may permeate deeply into their current profiles due to the Internet, which leads to the creation of fictitious online markets that, in turn, drive more demand. This evolving business interaction leverages new interlopes to target customers’ data more precisely. However, it is still lacking in terms of complete techniques for dealing with such issues. These days, uncertain B2C workflows are greatly aided by Blockchain technology, especially to most of its security-enhancing characteristics. Despite numerous existing studies that have recommended employing Blockchain to handle B2C records, it is necessary to employ the technology in such business sectors to offer secured record management, workflow and keep data with high confidentiality and integrity intact. In this study, we suggest a Distributed Decentralized Security Scheme (DDSS) that manages and secures uncertain datasets through Blockchain technology in the B2C sector. To improve the safety of data workflows, the proposed approach enables the user to verify the authenticity of the records they require. A smart contract or special chain-code is used to dictate the parameters of the suggested system, ensuring security. The findings and discussions explain that the suggested scheme is far more effective than the previous strategies and has a greater level of confidentiality and integrity strength.

Spanness of fuzzy graph is introduced. By spanness, a new vulnerability parameter, span integrity is defined in fuzzy graph. The span integrity values are found for path, cycle, complete fuzzy graph, complete bipartite fuzzy graphs. Path and cycle with node strength sequence are discussed. Brain network is modeled as a fuzzy graph and Span integrity is applied to the brain network. Span integrity of fuzzy brain network is calculated for before and after meditation models. The results are compared and the improvement in the stability of the brain network is shown.

Security has become a major concern of software systems, especially distributed systems. The existence of various attacks should be considered in designing and developing those systems such that appropriate countermeasures could be applied. This chapter provides an overview of different types of possible attacks and countermeasures in the software security area. In addition, it discusses the security problems in mobile agent systems and introduces several related research works. This chapter also presents our research works on mobile agent system security based on Extended Elementary Object System (EEOS).

Healthcare is usually the first that comes to our minds when dealing with the consequence of major hazards to deal with the large numbers of casualties; however, this was not available due to the ineffective preparedness. Literature illustrates a significant number of publications covering the resilience of healthcare to major hazards; however these tend to be fragmented due to the complexity of this service which often gives an incomplete picture of the health service and thus leads to inadequate level of preparedness. This chapter addresses some of this fragmentation by shedding light on disaster-resilience in the healthcare sector with the view to enhance the understanding of this service and thus builds its capacity and ultimately mitigates disaster risks. The chapter covers the performance of healthcare post disasters; hospitals’ structural, non-structural and functional integrity; regulations and safety codes; and the integration of resilience and the sustainability agendas through an illustration of international case studies. This chapter also presents new dimensions for enhancing disaster-resilience in a healthcare setting. These dimensions are based on a new concept known as sustainable healthcare.

The nature of mathematics has been the subject of heated debate among mathematicians and philosophers throughout the ages. The realist and anti-realist positions have had longstanding debate over this problem, but some of the most important recent development has focused on the interpretations; each of the above positions has its own interpretation of the nature of mathematics. I argue in this paper a contextualist interpretation of mathematics, it elucidates the essential features of mathematical context. That is, being integral and having concrete structure, mathematical context is a recontextualizational process with determinate boundary.