10,584 research outputs found

    Propensity score analysis in the Genetic Analysis Workshop 17 simulated data set on independent individuals

    Get PDF
    Genetic Analysis Workshop 17 provided simulated phenotypes and exome sequence data for 697 independent individuals (209 case subjects and 488 control subjects). The disease liability in these data was influenced by multiple quantitative traits. We addressed the lack of statistical power in this small data set by limiting the genomic variants included in the study to those with potential disease-causing effect, thereby reducing the problem of multiple testing. After this adjustment, we could readily detect two common variants that were strongly associated with the quantitative trait Q1 (C13S523 and C13S522). However, we found no significant associations with the affected status or with any of the other quantitative traits, and the relationship between disease status and genomic variants remained obscure. To address the challenge of the multivariate phenotype, we used propensity scores to combine covariates with genetic risk factors into a single risk factor and created a new phenotype variable, the probability of being affected given the covariates. Using the propensity score as a quantitative trait in the case-control analysis, we again could identify the two common single-nucleotide polymorphisms (C13S523 and C13S522). In addition, this analysis captured the correlation between Q1 and the affected status and reduced the problem of multiple testing. Although the propensity score was useful for capturing and clarifying the genetic contributions of common variants to the disease phenotype and the mediating role of the quantitative trait Q1, the analysis did not increase power to detect rare variants

    Most vital segment barriers

    Get PDF
    We study continuous analogues of "vitality" for discrete network flows/paths, and consider problems related to placing segment barriers that have highest impact on a flow/path in a polygonal domain. This extends the graph-theoretic notion of "most vital arcs" for flows/paths to geometric environments. We give hardness results and efficient algorithms for various versions of the problem, (almost) completely separating hard and polynomially-solvable cases

    Effect of correlations on network controllability

    Get PDF
    A dynamical system is controllable if by imposing appropriate external signals on a subset of its nodes, it can be driven from any initial state to any desired state in finite time. Here we study the impact of various network characteristics on the minimal number of driver nodes required to control a network. We find that clustering and modularity have no discernible impact, but the symmetries of the underlying matching problem can produce linear, quadratic or no dependence on degree correlation coefficients, depending on the nature of the underlying correlations. The results are supported by numerical simulations and help narrow the observed gap between the predicted and the observed number of driver nodes in real networks

    HRM and innovation: the mediating role of market-sensing capability and the moderating role of national power distance

    Get PDF
    This paper examines the mechanism through which human resource management (HRM) practices promote firms’ innovation and how this relationship differs across cultures. Based on a dataset of 3,755 firms from 13 countries, this study finds that in most countries employee-oriented HRM practices that dedicate attention to employee needs and interests are positively related to firms’ market-sensing capability, which is the capability to continuously learn about their markets. Market-sensing capability is in turn significantly related to firms’ product and process innovation. Cross-country examination further reveals that in high power distance countries employee- oriented HRM practices have a stronger positive effect than in low power distance countries. This study highlights the importance of HRM in supporting the use organizations make of external knowledge, which is critical for organizational innovation. Bringing an external perspective, we complement existing literature that emphasizes the role of HRM in integrating internal knowledge. Our cross-cultural findings contribute to the understanding of cultural contingency in HRM theories

    Uncertainty quantification in DIC with Kriging regression

    Get PDF
    © 2015 Elsevier Ltd. All rights reserved. A Kriging regression model is developed as a post-processing technique for the treatment of measurement uncertainty in classical subset-based Digital Image Correlation (DIC). Regression is achieved by regularising the sample-point correlation matrix using a local, subset-based, assessment of the measurement error with assumed statistical normality and based on the Sum of Squared Differences (SSD) criterion. This leads to a Kriging-regression model in the form of a Gaussian process representing uncertainty on the Kriging estimate of the measured displacement field. The method is demonstrated using numerical and experimental examples. Kriging estimates of displacement fields are shown to be in excellent agreement with 'true' values for the numerical cases and in the experimental example uncertainty quantification is carried out using the Gaussian random process that forms part of the Kriging model. The root mean square error (RMSE) on the estimated displacements is produced and standard deviations on local strain estimates are determined

    The effect of ultrasound pretreatment on some selected physicochemical properties of black cumin (Nigella Sativa)

    Get PDF
    Background In the present study, the effects of ultrasound pretreatment parameters including irradiation time and power on the quantity of the extracted phenolic compounds quantity as well as on some selected physicochemical properties of the extracted oils including oil extraction efficiency, acidity and peroxide values, color, and refractive index of the extracted oil of black cumin seeds with the use of cold press have been studied. Methods For each parameter, three different levels (30, 60, and 90 W) for the ultrasound power and (30, 45, and 60 min) and for the ultrasound irradiation time were studied. Each experiment was performed in three replications. Results The achieved results revealed that, with enhancements in the applied ultrasound power, the oil extraction efficiency, acidity value, total phenolic content, peroxide value, and color parameters increased significantly (P 0.05). Conclusions In summary, it could be mentioned that the application of ultrasound pretreatment in the oil extraction might improve the oil extraction efficiency, the extracted oil’s quality, and the extracted phenolic compounds content.info:eu-repo/semantics/publishedVersio

    From BIM towards digital twin: Strategy and future development for smart asset management

    Get PDF
    With the rising adoption of Building Information Model (BIM) for as-set management within architecture, engineering, construction and owner-operated (AECO) sector, BIM-enabled asset management has been increasingly attracting more attentions in both research and practice. This study provides a comprehensive review and analysis of the state-of-the-art latest research and industry standards development that impact upon BIM and asset management within the operations and maintenance (O&M) phase. However, BIM is not always enough in whole-life cycle asset management, especially in the O&M phase. Therefore, a framework for future development of smart asset management are proposed, integrating the concept of Digital Twin (DT). DT integrates artificial intelligence, machine learning and data analytics to create dynamic digital models that are able to learn and update the status of the physical counterpart from multiple sources. The findings will contribute to inspiring novel research ideas and promote wide-spread adoption of smart DT-enabled asset management within the O&M phaseCentre for Digital Built Britain, Innovate U

    SimRank*: effective and scalable pairwise similarity search based on graph topology

    Get PDF
    Given a graph, how can we quantify similarity between two nodes in an effective and scalable way? SimRank is an attractive measure of pairwise similarity based on graph topologies. Its underpinning philosophy that “two nodes are similar if they are pointed to (have incoming edges) from similar nodes” can be regarded as an aggregation of similarities based on incoming paths. Despite its popularity in various applications (e.g., web search and social networks), SimRank has an undesirable trait, i.e., “zero-similarity”: it accommodates only the paths of equal length from a common “center” node, whereas a large portion of other paths are fully ignored. In this paper, we propose an effective and scalable similarity model, SimRank*, to remedy this problem. (1) We first provide a sufficient and necessary condition of the “zero-similarity” problem that exists in Jeh and Widom’s SimRank model, Li et al. ’s SimRank model, Random Walk with Restart (RWR), and ASCOS++. (2) We next present our treatment, SimRank*, which can resolve this issue while inheriting the merit of the simple SimRank philosophy. (3) We reduce the series form of SimRank* to a closed form, which looks simpler than SimRank but which enriches semantics without suffering from increased computational overhead. This leads to an iterative form of SimRank*, which requires O(Knm) time and O(n2) memory for computing all (n2) pairs of similarities on a graph of n nodes and m edges for K iterations. (4) To improve the computational time of SimRank* further, we leverage a novel clustering strategy via edge concentration. Due to its NP-hardness, we devise an efficient heuristic to speed up all-pairs SimRank* computation to O(Knm~) time, where m~ is generally much smaller than m. (5) To scale SimRank* on billion-edge graphs, we propose two memory-efficient single-source algorithms, i.e., ss-gSR* for geometric SimRank*, and ss-eSR* for exponential SimRank*, which can retrieve similarities between all n nodes and a given query on an as-needed basis. This significantly reduces the O(n2) memory of all-pairs search to either O(Kn+m~) for geometric SimRank*, or O(n+m~) for exponential SimRank*, without any loss of accuracy, where m~≪n2 . (6) We also compare SimRank* with another remedy of SimRank that adds self-loops on each node and demonstrate that SimRank* is more effective. (7) Using real and synthetic datasets, we empirically verify the richer semantics of SimRank*, and validate its high computational efficiency and scalability on large graphs with billions of edges

    In silico prioritisation of candidate genes for prokaryotic gene function discovery: an application of phylogenetic profiles

    Get PDF
    Background: In silico candidate gene prioritisation (CGP) aids the discovery of gene functions by ranking genes according to an objective relevance score. While several CGP methods have been described for identifying human disease genes, corresponding methods for prokaryotic gene function discovery are lacking. Here we present two prokaryotic CGP methods, based on phylogenetic profiles, to assist with this task. Results: Using gene occurrence patterns in sample genomes, we developed two CGP methods (statistical and inductive CGP) to assist with the discovery of bacterial gene functions. Statistical CGP exploits the differences in gene frequency against phenotypic groups, while inductive CGP applies supervised machine learning to identify gene occurrence pattern across genomes. Three rediscovery experiments were designed to evaluate the CGP frameworks. The first experiment attempted to rediscover peptidoglycan genes with 417 published genome sequences. Both CGP methods achieved best areas under receiver operating characteristic curve (AUC) of 0.911 in Escherichia coli K-12 (EC-K12) and 0.978 Streptococcus agalactiae 2603 (SA-2603) genomes, with an average improvement in precision of >3.2-fold and a maximum of >27-fold using statistical CGP. A median AUC of >0.95 could still be achieved with as few as 10 genome examples in each group of genome examples in the rediscovery of the peptidoglycan metabolism genes. In the second experiment, a maximum of 109-fold improvement in precision was achieved in the rediscovery of anaerobic fermentation genes in EC-K12. The last experiment attempted to rediscover genes from 31 metabolic pathways in SA-2603, where 14 pathways achieved AUC >0.9 and 28 pathways achieved AUC >0.8 with the best inductive CGP algorithms. Conclusion: Our results demonstrate that the two CGP methods can assist with the study of functionally uncategorised genomic regions and discovery of bacterial gene-function relationships. Our rediscovery experiments also provide a set of standard tasks against which future methods may be compared.12 page(s
    corecore