An algorithm for fragment-aware virtual network reconfiguration.
Ontology highlight
ABSTRACT:
SUBMITTER: Liu X
PROVIDER: S-EPMC6248979 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:Network virtualization can offer more flexibility and better manageability for next generation Internet. With the increasing deployments of virtual networks in military and commercial networks, a major challenge is to ensure virtual network survivability against hybrid multiple failures. In this paper, we study the problem of recovering virtual networks affected by hybrid multiple failures in substrate networks and provide an integer linear programming formulation to solve it. We propose a heuristic algorithm to tackle the complexity of the integer linear programming formulation, which includes a faulty virtual network reconfiguration ranking method based on weighted relative entropy, a hybrid multiple failures ranking algorithm, and a virtual node migration method based on weighted relative entropy. In the faulty virtual network reconfiguration ranking method based on weighted relative entropy and virtual node migration method based on weighted relative entropy, multiple ranking indicators are combined in a suitable way based on weighted relative entropy. In the hybrid multiple failures ranking algorithm, the virtual node and its connective virtual links are re-embedded, firstly. Evaluation results show that our heuristic method not only has the best acceptance ratio and normal operation ratio, but also achieves the highest long-term average revenue to cost ratio compared with other virtual network reconfiguration methods.
| S-EPMC7513238 | biostudies-literature
Project description:With an increasing number of human-computer interaction application scenarios, researchers are looking for computers to recognize human emotions more accurately and efficiently. Such applications are desperately needed at universities, where people want to understand the students' psychology in real time to avoid catastrophes. This research proposed a self-aware face emotion accelerated recognition algorithm (SFEARA) that improves the efficiency of convolutional neural networks (CNNs) in the recognition of facial emotions. SFEARA will recognize that critical and non-critical regions of input data perform high-precision computation and convolutive low-precision computation during the inference process, and finally combine the results, which can help us get the emotional recognition model for international students. Based on a comparison of experimental data, the SFEARA algorithm has 1.3× to 1.6× higher computational efficiency and 30% to 40% lower energy consumption than conventional CNNs in emotion recognition applications, is better suited to the real-time scenario with more background information.
| S-EPMC10557955 | biostudies-literature
Project description:Human behavior is supported by flexible neurophysiological processes that enable the fine-scale manipulation of information across distributed neural circuits. Yet, approaches for understanding the dynamics of these circuit interactions have been limited. One promising avenue for quantifying and describing these dynamics lies in multilayer network models. Here, networks are composed of nodes (which represent brain regions) and time-dependent edges (which represent statistical similarities in activity time series). We use this approach to examine functional connectivity measured by non-invasive neuroimaging techniques. These multilayer network models facilitate the examination of changes in the pattern of statistical interactions between large-scale brain regions that might facilitate behavior. In this study, we define and exercise two novel measures of network reconfiguration, and demonstrate their utility in neuroimaging data acquired as healthy adult human subjects learn a new motor skill. In particular, we identify putative functional modules in multilayer networks and characterize the degree to which nodes switch between modules. Next, we define cohesive switches, in which a set of nodes moves between modules together as a group, and we define disjoint switches, in which a single node moves between modules independently from other nodes. Together, these two concepts offer complementary yet distinct insights into the changes in functional connectivity that accompany motor learning. More generally, our work offers statistical tools that other researchers can use to better understand the reconfiguration patterns of functional connectivity over time. Hum Brain Mapp 38:4744-4759, 2017. © 2017 The Authors Human Brain Mapping Published by Wiley Periodicals, Inc.
| S-EPMC5554863 | biostudies-literature
Project description:Our brain constructs reality through narrative and argumentative thought. Some hypotheses argue that these two modes of cognitive functioning are irreducible, reflecting distinct mental operations underlain by separate neural bases; Others ascribe both to a unitary neural system dedicated to long-timescale information. We addressed this question by employing inter-subject measures to investigate the stimulus-induced neural responses when participants were listening to narrative and argumentative texts during fMRI. We found that following both kinds of texts enhanced functional couplings within the frontoparietal control system. However, while a narrative specifically implicated the default mode system, an argument specifically induced synchronization between the intraparietal sulcus in the frontoparietal control system and multiple perisylvian areas in the language system. Our findings reconcile the two hypotheses by revealing commonalities and differences between the narrative and the argumentative brain networks, showing how diverse mental activities arise from the segregation and integration of the existing brain systems.
| S-EPMC8208997 | biostudies-literature
Project description:Healthy aging is associated with changes in cognitive performance and functional brain organization. In fact, cross-sectional studies imply lower modularity and significant heterogeneity in modular architecture across older subjects. Here, we used a longitudinal dataset consisting of four occasions of resting-state-fMRI and cognitive testing (spanning 4 years) in 150 healthy older adults. We applied a graph-theoretic analysis to investigate the time-evolving modular structure of the whole-brain network, by maximizing the multilayer modularity across four time points. Global flexibility, which reflects the tendency of brain nodes to switch between modules across time, was significantly higher in healthy elderly than in a temporal null model. Further, global flexibility, as well as network-specific flexibility of the default mode, frontoparietal control, and somatomotor networks, were significantly associated with age at baseline. These results indicate that older age is related to higher variability in modular organization. The temporal metrics were not associated with simultaneous changes in processing speed or learning performance in the context of memory encoding. Finally, this approach provides global indices for longitudinal change across a given time span and it may contribute to uncovering patterns of modular variability in healthy and clinical aging populations.
| S-EPMC7643380 | biostudies-literature
Project description:In direct lineage conversion, transcription factor (TF) overexpression reconfigures gene regulatory networks (GRNs) to reprogram cell identity. We previously developed CellOracle, a computational method to infer GRNs from single-cell transcriptome and epigenome data. Using inferred GRNs, CellOracle simulates gene expression changes in response to TF perturbation, enabling in silico interrogation of network reconfiguration. Here, we combine CellOracle analysis with lineage tracing of fibroblast to induced endoderm progenitor (iEP) conversion, a prototypical direct reprogramming paradigm. By linking early network state to reprogramming outcome, we reveal distinct network configurations underlying successful and failed fate conversion. Via in silico simulation of TF perturbation, we identify new factors to coax cells into successfully converting their identity, uncovering a central role for the AP-1 subunit Fos with the Hippo signaling effector, Yap1. Together, these results demonstrate the efficacy of CellOracle to infer and interpret cell-type-specific GRN configurations, providing new mechanistic insights into lineage reprogramming.
| S-EPMC9860067 | biostudies-literature
Project description:Gene sequencing technology has been playing an important role in many aspects, such as life science, disease medicine and health medicine, particularly in the extremely tough process of fighting against 2019-novel coronavirus. Drawing DNA restriction map is a particularly important technology in genetic biology. The simplified partial digestion method (SPDP), a biological method, has been widely used to cut DNA molecules into DNA fragments and obtain the biological information of each fragment. In this work, we propose an algorithm based on 0-1 planning for the location of restriction sites on a DNA molecule, which is able to solve the problem of DNA fragment reconstruction just based on data of fragments' length. Two specific examples are presented in detail. Furthermore, based on 1000 groups of original DNA sequences randomly generated, we define the coincidence rate and unique coincidence rate between the reconstructed DNA sequence and the original DNA sequence, and then analyze separately the effect of the number of fragments and the maximum length of DNA fragments on the coincidence rate and unique coincidence rate as defined. The effectiveness of the algorithm is proved. Besides, based on the existing optimization solution obtained, we simulate and discuss the influence of the error by computation method. It turns out that the error of position of one restriction site does not affect other restriction sites and errors of most restriction sites may lead to the failure of sequence reconstruction. Matlab 7.1 program is used to solve feasible solutions of the location of restriction sites, derive DNA fragment sequence and carry out the statistical analysis and error analysis. This paper focuses on basic computer algorithm implementation of rearrangement and sequencing rather than biochemical technology. The innovative application of the mathematical idea of 0-1 planning to DNA sequence mapping construction, to a certain extent, greatly simplifies the difficulty and complexity of calculation and accelerates the process of 'jigsaw' of DNA fragments.
| S-EPMC7896547 | biostudies-literature
Project description:BackgroundHomology inference is pivotal to evolutionary biology and is primarily based on significant sequence similarity, which, in general, is a good indicator of homology. Algorithms have also been designed to utilize conservation in gene order as an indication of homologous regions. We have developed GenFamClust, a method based on quantification of both gene order conservation and sequence similarity.ResultsIn this study, we validate GenFamClust by comparing it to well known homology inference algorithms on a synthetic dataset. We applied several popular clustering algorithms on homologs inferred by GenFamClust and other algorithms on a metazoan dataset and studied the outcomes. Accuracy, similarity, dependence, and other characteristics were investigated for gene families yielded by the clustering algorithms. GenFamClust was also applied to genes from a set of complete fungal genomes and gene families were inferred using clustering. The resulting gene families were compared with a manually curated gold standard of pillars from the Yeast Gene Order Browser. We found that the gene-order component of GenFamClust is simple, yet biologically realistic, and captures local synteny information for homologs.ConclusionsThe study shows that GenFamClust is a more accurate, informed, and comprehensive pipeline to infer homologs and gene families than other commonly used homology and gene-family inference methods.
| S-EPMC4893229 | biostudies-literature
Project description:tRNA fragments (tRFs) are a novel class of small RNAs comparable to the size and function of miRNAs. We and others have shown that tRFs are generally Dicer independent, can be found in abundance in the miRNA effector protein Ago, and can repress expression of specific genes that have complementarity to their 5’ seed-sequences. Given that this greatly expands the repertoire of small RNAs capable of post-transcriptional gene expression, it is important to predict tRF targets with confidence. Some attempts have been made to predict tRF targets, but are limited in the scope of tRF classes used in prediction or limited in feature selection. We hypothesized that established miRNA target prediction features applied to tRFs through a random forest machine learning algorithm will immensely improve tRF target prediction. Using this approach, we show significant improvements in tRF target prediction for all classes of tRFs and validate our predictions in two independent cell lines. Finally, using Gene Ontology analysis, we provide evidence that tRF-3009a targets may be involved in neural development. These improvements to tRF target prediction further our understanding of tRF function broadly across species and tRF types, and provide avenues for testing novel roles for tRFs in biology.
2022-05-16 | GSE189510 | GEO
Project description:Brain imaging genetics is an emergent research field where the association between genetic variations such as single nucleotide polymorphisms (SNPs) and neuroimaging quantitative traits (QTs) is evaluated. Sparse canonical correlation analysis (SCCA) is a bi-multivariate analysis method that has the potential to reveal complex multi-SNP-multi-QT associations. Most existing SCCA algorithms are designed using the soft threshold strategy, which assumes that the features in the data are independent from each other. This independence assumption usually does not hold in imaging genetic data, and thus inevitably limits the capability of yielding optimal solutions. We propose a novel structure-aware SCCA (denoted as S2CCA) algorithm to not only eliminate the independence assumption for the input data, but also incorporate group-like structure in the model. Empirical comparison with a widely used SCCA implementation, on both simulated and real imaging genetic data, demonstrated that S2CCA could yield improved prediction performance and biologically meaningful findings.
| S-EPMC4203420 | biostudies-literature