Resistance and Security Index of Networks: Structural Information Perspective of Network Security.
Ontology highlight
ABSTRACT:
SUBMITTER: Li A
PROVIDER: S-EPMC4891726 | biostudies-other | 2016
REPOSITORIES: biostudies-other
Similar Datasets
Project description:With the advent of cloud computing and wireless sensor networks, the number of cyberattacks has rapidly increased. Therefore, the proportionate security of networks has become a challenge for organizations. Information security advisors of organizations face difficult and complex decisions in the evaluation and selection of information security controls that permit the defense of their resources and assets. Information security controls must be selected based on an appropriate level of security. However, their selection needs intensive investigation regarding vulnerabilities, risks, and threats prevailing in the organization as well as consideration of the implementation, mitigation, and budgetary constraints of the organization. The goal of this paper was to improve the information security control analysis method by proposing a formalized approach, i.e., fuzzy Analytical Hierarchy Process (AHP). This approach was used to prioritize and select the most relevant set of information security controls to satisfy the information security requirements of an organization. We argue that the prioritization of the information security controls using fuzzy AHP leads to an efficient and cost-effective assessment and evaluation of information security controls for an organization in order to select the most appropriate ones. The proposed formalized approach and prioritization processes are based on International Organization for Standardization and the International Electrotechnical Commission (ISO/IEC) 27001:2013. But in practice, organizations may apply this approach to any information security baseline manual.
| S-EPMC7085684 | biostudies-literature
Project description:Today's technology development in the field of computer along with internet of things made huge difference in the transformation of our lives. Basic computer framework and web client need to make significant login signify getting to mail, long range interpersonal communication, internet keeping money, booking tickets, perusing online daily papers, and so forth. The login user name and secret key mapping validate if the logging user is the intended client. Secret key is assumed an indispensable part in security. The objective of MFA is to make a layered safeguard and make it more troublesome for an unauthenticated entity to get to an objective, for example, a physical area, processing gadget, system, or database. In the event that one element is bargained or broken, the assailant still has two more boundaries to rupture before effectively breaking into the objective. An endeavor has been made by utilizing three variable types of authentication. In this way managing additional secret key includes an additional layer of security.
| S-EPMC4783557 | biostudies-other
Project description:Protein-protein interaction networks provide a global picture of cellular function and biological processes. Some proteins act as hub proteins, highly connected to others, whereas some others have few interactions. The dysfunction of some interactions causes many diseases, including cancer. Proteins interact through their interfaces. Therefore, studying the interface properties of cancer-related proteins will help explain their role in the interaction networks. Similar or overlapping binding sites should be used repeatedly in single interface hub proteins, making them promiscuous. Alternatively, multi-interface hub proteins make use of several distinct binding sites to bind to different partners. We propose a methodology to integrate protein interfaces into cancer interaction networks (ciSPIN, cancer structural protein interface network). The interactions in the human protein interaction network are replaced by interfaces, coming from either known or predicted complexes. We provide a detailed analysis of cancer related human protein-protein interfaces and the topological properties of the cancer network. The results reveal that cancer-related proteins have smaller, more planar, more charged and less hydrophobic binding sites than non-cancer proteins, which may indicate low affinity and high specificity of the cancer-related interactions. We also classified the genes in ciSPIN according to phenotypes. Within phenotypes, for breast cancer, colorectal cancer and leukemia, interface properties were found to be discriminating from non-cancer interfaces with an accuracy of 71%, 67%, 61%, respectively. In addition, cancer-related proteins tend to interact with their partners through distinct interfaces, corresponding mostly to multi-interface hubs, which comprise 56% of cancer-related proteins, and constituting the nodes with higher essentiality in the network (76%). We illustrate the interface related affinity properties of two cancer-related hub proteins: Erbb3, a multi interface, and Raf1, a single interface hub. The results reveal that affinity of interactions of the multi-interface hub tends to be higher than that of the single-interface hub. These findings might be important in obtaining new targets in cancer as well as finding the details of specific binding regions of putative cancer drug candidates.
| S-EPMC2785480 | biostudies-literature
Project description:Many real-world systems can be described by scale-free networks with power-law degree distributions. Scale-free networks show a "robust yet fragile" feature due to their heterogeneous degree distributions. We propose to enhance the structural robustness of scale-free networks against intentional attacks by changing the displayed network structure information rather than modifying the network structure itself. We first introduce a simple mathematical model for attack information and investigate the impact of attack information on the structural robustness of scale-free networks. Both analytical and numerical results show that decreasing slightly the attack information perfection by information disturbance can dramatically enhance the structural robustness of scale-free networks. Then we propose an optimization model of disturbance strategies in which the cost constraint is considered. We analyze the optimal disturbance strategies and show an interesting but counterintuitive finding that disturbing "poor nodes" with low degrees preferentially is more effective than disturbing "rich nodes" with high degrees preferentially. We demonstrate the efficiency of our method by comparison with edge addition method and validate the feasibility of our method in two real-world critical infrastructure networks.
| S-EPMC5548747 | biostudies-other
Project description:Network neuroscience employs graph theory to investigate the human brain as a complex network, and derive generalizable insights about the brain's network properties. However, graph-theoretical results obtained from network construction pipelines that produce idiosyncratic networks may not generalize when alternative pipelines are employed. This issue is especially pressing because a wide variety of network construction pipelines have been employed in the human network neuroscience literature, making comparisons between studies problematic. Here, we investigate how to produce networks that are maximally representative of the broader set of brain networks obtained from the same neuroimaging data. We do so by minimizing an information-theoretic measure of divergence between network topologies, known as the portrait divergence. Based on functional and diffusion MRI data from the Human Connectome Project, we consider anatomical, functional, and multimodal parcellations at three different scales, and 48 distinct ways of defining network edges. We show that the highest representativeness can be obtained by using parcellations in the order of 200 regions and filtering functional networks based on efficiency-cost optimization-though suitable alternatives are also highlighted. Overall, we identify specific node definition and thresholding procedures that neuroscientists can follow in order to derive representative networks from their human neuroimaging data.
| S-EPMC7935031 | biostudies-literature
Project description:Networks, such as the human society network, social and professional networks, and biological system networks, contain vast amounts of information. Information signals in networks are distributed over nodes and transmitted through intricately wired links, making the transfer and transformation of such information difficult to follow. Here we introduce a novel method for describing network information and its transfer using a model network, the Gene-matched network (GMN), in which nodes (neurons) possess attributes (genes). In the GMN, nodes are connected according to their expression of common genes. Because neurons have multiple genes, the GMN is cluster-rich. We show that, in the GMN, information transfer and transformation were controlled systematically, according to the activity level of the network. Furthermore, information transfer and transformation could be traced numerically with a vector using genes expressed in the activated neurons, the active-gene array, which was used to assess the relative activity among overlapping neuronal groups. Interestingly, this coding style closely resembles the cell-assembly neural coding theory. The method introduced here could be applied to many real-world networks, since many systems, including human society and various biological systems, can be represented as a network of this type.
| S-EPMC4598864 | biostudies-other
Project description:The past decade has seen a significant rise in research on high-consequence human and animal pathogens, many now known as "select agents." While physical security around these agents is tightly regulated, information security standards are still lagging. The understanding of the threats unique to the academic and research environment is still evolving, in part due to poor communication between the various stakeholders. Perhaps as a result, information security guidelines published by select agent regulators lack the critical details and directives needed to achieve even the lowest security level of the Federal Information Security Management Act (FISMA). While only government agencies are currently required to abide by the provisions of FISMA (unless specified as preconditions for obtaining government grants or contracts--still a relatively rare or narrowly scoped occurrence), the same strategies were recently recommended by executive order for others. We propose that information security guidelines for select agent research be updated to promulgate and detail FISMA standards and processes and that the latter be ultimately incorporated into select agent regulations. We also suggest that information security in academic and research institutions would greatly benefit from active efforts to improve communication among the biosecurity, security, and information technology communities, and from a secure venue for exchange of timely information on emerging threats and solutions in the research environment.
| S-EPMC4486445 | biostudies-literature
Project description:Systematic analysis of a parasite interactome is a key approach to understand different biological processes. It makes possible to elucidate disease mechanisms, to predict protein functions and to select promising targets for drug development. Currently, several approaches for protein interaction prediction for non-model species incorporate only small fractions of the entire proteomes and their interactions. Based on this perspective, this study presents an integration of computational methodologies, protein network predictions and comparative analysis of the protozoan species Leishmania braziliensis and Leishmania infantum. These parasites cause Leishmaniasis, a worldwide distributed and neglected disease, with limited treatment options using currently available drugs.The predicted interactions were obtained from a meta-approach, applying rigid body docking tests and template-based docking on protein structures predicted by different comparative modeling techniques. In addition, we trained a machine-learning algorithm (Gradient Boosting) using docking information performed on a curated set of positive and negative protein interaction data. Our final model obtained an AUC?=?0.88, with recall?= 0.69, specificity?= 0.88 and precision?= 0.83. Using this approach, it was possible to confidently predict 681 protein structures and 6198 protein interactions for L. braziliensis, and 708 protein structures and 7391 protein interactions for L. infantum. The predicted networks were integrated to protein interaction data already available, analyzed using several topological features and used to classify proteins as essential for network stability.The present study allowed to demonstrate the importance of integrating different methodologies of interaction prediction to increase the coverage of the protein interaction of the studied protocols, besides it made available protein structures and interactions not previously reported.
| S-EPMC5840830 | biostudies-other
Project description:Analysis of developmental brain networks is fundamentally important for basic developmental neuroscience. In this paper, we focus on the temporally-covarying connection patterns, called meta-networks, and develop a new mathematical model for meta-network decomposition. With the proposed model, we decompose the developmental structural correlation networks of cortical thickness into five meta-networks. Each meta-network exhibits a distinctive spatial connection pattern, and its covarying trajectory highlights the temporal contribution of the meta-network along development. Systematic analysis of the meta-networks and covarying trajectories provides insights into three important aspects of brain network development.
| S-EPMC6444117 | biostudies-literature
Project description:In recent times, security and privacy at the physical (PHY) layer has been a major issue of several communication technologies which comprise the internet of things (IoT) and mostly, the emerging fifth-generation (5G) cellular network. The most real-world PHY security challenge stems from the fact that the passive eavesdropper's information is unavailable to the genuine source and destination (transmitter/receiver) nodes in the network. Without this information, it is difficult to optimize the broadcasting parameters. Therefore, in this research, we propose an efficient sequential convex estimation optimization (SCEO) algorithm to mitigate this challenge and improve the security of physical layer (PHY) in a three-node wireless communication network. The results of our experiments indicate that by using the SCEO algorithm, an optimal performance and enhanced convergence is achieved in the transmission. However, considering possible security challenges envisaged when a multiple eavesdropper is active in a network, we expanded our research to develop a swift privacy rate optimization algorithm for a multiple-input, multiple-output, multiple-eavesdropper (MIMOME) scenario as it is applicable to security in IoT and 5G technologies. The result of the investigation show that the algorithm executes significantly with minimal complexity when compared with nonoptimal parameters. We further employed the use of rate constraint together with self-interference of the full-duplex transmission at the receiving node, which makes the performance of our technique outstanding when compared with previous studies.
| S-EPMC7249050 | biostudies-literature