Impact of mobility and topology on information diffusion in MANETs

In some delay-tolerant communication systems such as vehicular ad-hoc networks, information flow can be represented as an infectious process, where each entity having already received the information will try to share it with its neighbours. The random walk and random waypoint models are popular analysis tools for these epidemic broadcasts, and represent two types of random mobility. In this paper, we introduce a simulation framework investigating the impact of a gradual increase of bias in path selection (i.e. reduction of randomness), when moving from the former to the latter. Randomness in path selection can significantly alter the system performances, in both regular and irregular network structures. The implications of these results for real systems are discussed in details.

Genetic variants underlying risk of endometriosis: Insights from meta-analysis of eight genome-wide association and replication datasets

BACKGROUND Endometriosis is a heritable common gynaecological condition influenced by multiple genetic and environmental factors. Genome-wide association studies (GWASs) have proved successful in identifying common genetic variants of moderate effects for various complex diseases. To date, eight GWAS and replication studies from multiple populations have been published on endometriosis. In this review, we investigate the consistency and heterogeneity of the results across all the studies and their implications for an improved understanding of the aetiology of the condition. METHODS Meta-analyses were conducted on four GWASs and four replication studies including a total of 11 506 cases and 32 678 controls, and on the subset of studies that investigated associations for revised American Fertility Society (rAFS) Stage III/IV including 2859 cases. The datasets included 9039 cases and 27 343 controls of European (Australia, Belgium, Italy, UK, USA) and 2467 cases and 5335 controls of Japanese ancestry. Fixed and Han and Elkin random-effects models, and heterogeneity statistics (Cochran's Q test), were used to investigate the evidence of the nine reported genome-wide significant loci across datasets and populations. RESULTS Meta-analysis showed that seven out of nine loci had consistent directions of effect across studies and populations, and six out of nine remained genome-wide significant (P < 5 × 10(-8)), including rs12700667 on 7p15.2 (P = 1.6 × 10(-9)), rs7521902 near WNT4 (P = 1.8 × 10(-15)), rs10859871 near VEZT (P = 4.7 × 10(-15)), rs1537377 near CDKN2B-AS1 (P = 1.5 × 10(-8)), rs7739264 near ID4 (P = 6.2 × 10(-10)) and rs13394619 in GREB1 (P = 4.5 × 10(-8)). In addition to the six loci, two showed borderline genome-wide significant associations with Stage III/IV endometriosis, including rs1250248 in FN1 (P = 8 × 10(-8)) and rs4141819 on 2p14 (P = 9.2 × 10(-8)). Two independent inter-genic loci, rs4141819 and rs6734792 on chromosome 2, showed significant evidence of heterogeneity across datasets (P < 0.005). Eight of the nine loci had stronger effect sizes among Stage III/IV cases, implying that they are likely to be implicated in the development of moderate to severe, or ovarian, disease. While three out of nine loci were inter-genic, the remaining were in or near genes with known functions of biological relevance to endometriosis, varying from roles in developmental pathways to cellular growth/carcinogenesis. CONCLUSIONS Our meta-analysis shows remarkable consistency in endometriosis GWAS results across studies, with little evidence of population-based heterogeneity. They also show that the phenotypic classifications used in GWAS to date have been limited. Stronger associations with Stage III/IV disease observed for most loci emphasize the importance for future studies to include detailed sub-phenotype information. Functional studies in relevant tissues are needed to understand the effect of the variants on downstream biological pathways.

Association of IL23R and ERAP1 genes with ankylosing spondylitis in a Portuguese population

Objective: Association between ankylosing spondylitis (AS) and two genes, ERAP1 and IL23R, has recently been reported in North American and British populations. The population attributable risk fraction for ERAP1 in this study was 25%, and for IL23R, 9%. Confirmation of these findings to ERAP1 in other ethnic groups has not yet been demonstrated. We sought to test the association between single nucleotide polymorphisms (SNPs) in these genes and susceptibility to AS among a Portuguese population. We also investigated the role of these genes in clinical manifestations of AS, including age of symptom onset, the Bath Ankylosing Spondylitis Disease Activity, Metrology and Functional Indices, and the modified Stoke Ankylosing Spondylitis Spinal Score. Methods: The study was conducted on 358 AS cases and 285 ethnically matched Portuguese healthy controls. AS was defined according to the modified New York Criteria. Genotyping of IL23R and ERAP1 allelic variants was carried out with TaqMan allelic discrimination assays. Association analysis was performed using the Cochrane-Armitage and linear regression tests of genotypes as implemented in PLINK for dichotomous and quantitative variables respectively. A meta-analysis for Portuguese and previously published Spanish IL23R data was performed using the StatsDirect® Statistical tools, by fixed and random effects models. Results: A total of 14 nsSNPs markers (8 for IL23R, 5 for ERAPl, 1 for LN-PEP) were analysed. Three markers (2 for IL23R and 1 for ERAP1) showed significant single-locus disease associations, confirming that the association of these genes with AS in the Portuguese population. The strongest associated SNP in IL23R was rs1004819 (OR=1.4, p=0.0049), and in ERAP1 was rs30187 (OR=1.26, p=0.035). The population attributable risk fractions in the Portuguese population for these SNPs are 11% and 9.7% respectively. No association was seen with any SNP in LN-PEP, which flanks ERAP1 and was associated with AS in the British population. No association was seen with clinical manifestations of AS. Conclusions: These results show that IL23R and ERAP1 genes are also associated with susceptibility to AS in the Portuguese population, and that they contribute a significant proportion of the population risk for this disease.

Understanding Protein Structure from a Percolation Perspective

Underlying the unique structures and diverse functions of proteins area vast range of amino-acid sequences and a highly limited number of folds taken up by the polypeptide backbone. By investigating the role of noncovalent connections at the backbone level and at the detailed side-chain level, we show that these unique structures emerge from interplay between random and selected features. Primarily, the protein structure network formed by these connections shows simple (bond) and higher order (clique) percolation behavior distinctly reminiscent of random network models. However, the clique percolation specific to the side-chain interaction network bears signatures unique to proteins characterized by a larger degree of connectivity than in random networks. These studies reflect some salient features of the manner in which amino acid sequences select the unique structure of proteins from the pool of a limited number of available folds.

Prevalence of foot disease and risk factors in general inpatient populations: A systematic review and meta-analysis

Objective: To systematically review studies reporting the prevalence in general adult inpatient populations of foot disease disorders (foot wounds, foot infections, collective ‘foot disease’) and risk factors (peripheral arterial disease (PAD), peripheral neuropathy (PN), foot deformity). Methods: A systematic review of studies published between 1980 and 2013 was undertaken using electronic databases (MEDLINE, EMBASE and CINAHL). Keywords and synonyms relating to prevalence, inpatients, foot disease disorders and risk factors were used. Studies reporting foot disease or risk factor prevalence data in general inpatient populations were included. Included study's reference lists and citations were searched and experts consulted to identify additional relevant studies. 2 authors, blinded to each other, assessed the methodological quality of included studies. Applicable data were extracted by 1 author and checked by a second author. Prevalence proportions and SEs were calculated for all included studies. Pooled prevalence estimates were calculated using random-effects models where 3 eligible studies were available. Results: Of the 4972 studies initially identified, 78 studies reporting 84 different cohorts (total 60 231 517 participants) were included. Foot disease prevalence included: foot wounds 0.01–13.5% (70 cohorts), foot infections 0.05–6.4% (7 cohorts), collective foot disease 0.2–11.9% (12 cohorts). Risk factor prevalence included: PAD 0.01–36.0% (10 cohorts), PN 0.003–2.8% (6 cohorts), foot deformity was not reported. Pooled prevalence estimates were only able to be calculated for pressure ulcer-related foot wounds 4.6% (95% CI 3.7% to 5.4%)), diabetes-related foot wounds 2.4% (1.5% to 3.4%), diabetes-related foot infections 3.4% (0.2% to 6.5%), diabetes-related foot disease 4.7% (0.3% to 9.2%). Heterogeneity was high in all pooled estimates (I2=94.2–97.8%, p<0.001). Conclusions: This review found high heterogeneity, yet suggests foot disease was present in 1 in every 20 inpatients and a major risk factor in 1 in 3 inpatients. These findings are likely an underestimate and more robust studies are required to provide more precise estimates.

The influence of OLR1 and PCSK9 gene polymorphisms on ischemic stroke: Evidence from a meta-analysis

It has been reported that both OLR1 and PCSK9 genes are related to various vascular diseases such as atherosclerosis, cardiovascular disease, peripheral artery disease and stroke, in particular ischemic stroke. The prevalence of PCSK9 rs505151 and OLR1 rs11053646 variants in ischemic stroke were 0.005 and 0.116, respectively. However, to date, association between OLR1 rs11053646 and PCSK9 rs505151 polymorphisms and the risk of ischemic stroke remains unclear and inconclusive. Therefore, this first meta-analysis was carried out to clarify the presumed influence of genetic polymorphisms on ischemic stroke, by analyzing the complete coverage of all relevant studies. All eligible case-control and cohort studies that met the search term were retrieved in multiple scientific databases. Data of interest such as demographic data and genotyping methods were extracted from each study, and the meta-analysis was performed using RevMan 5.3 and Metafor R 3.2.1. The pooled odd ratios (ORs) and 95% confidence intervals (CIs) were calculated using both fixed- and random-effect models. A total of seven case-control studies encompassing 1897 ischemic stroke cases and 2119 healthy controls were critically evaluated. Pooled results from the genetic models indicated that OLR1 rs11053646 dominant (OR=1.33. 95%CI:1.11-1.58) and co-dominant models (OR=1.24, 95%CI:1.02-1.51) were significantly associated with ischemic stroke. For PCSK9 rs505151 polymorphism, the OR of co-dominant model (OR=1.36, 95%CI:1.01-1.58) was found to be higher among ischemic stroke patients. In conclusion, the current meta-analysis highlighted that variant allele of OLR1 rs11053646 G>C and PCSK9 rs505151 A>G may contribute to the susceptibility risk of ischemic stroke.

Modeling transport through an environment crowded by a mixture of obstacles of different shapes and sizes

Many biological environments are crowded by macromolecules, organelles and cells which can impede the transport of other cells and molecules. Previous studies have sought to describe these effects using either random walk models or fractional order diffusion equations. Here we examine the transport of both a single agent and a population of agents through an environment containing obstacles of varying size and shape, whose relative densities are drawn from a specified distribution. Our simulation results for a single agent indicate that smaller obstacles are more effective at retarding transport than larger obstacles; these findings are consistent with our simulations of the collective motion of populations of agents. In an attempt to explore whether these kinds of stochastic random walk simulations can be described using a fractional order diffusion equation framework, we calibrate the solution of such a differential equation to our averaged agent density information. Our approach suggests that these kinds of commonly used differential equation models ought to be used with care since we are unable to match the solution of a fractional order diffusion equation to our data in a consistent fashion over a finite time period.

The profile of psychiatric symptoms exacerbated by methamphetamine use

Background Methamphetamine use can produce symptoms almost indistinguishable from schizophrenia. Distinguishing between the two conditions has been hampered by the lack of a validated symptom profile for methamphetamine-induced psychiatric symptoms. We use data from a longitudinal cohort study to examine the profile of psychiatric symptoms that are acutely exacerbated by methamphetamine use. Methods 164 methamphetamine users, who did not meet DSM-IV criteria for a lifetime primary psychotic disorder, were followed monthly for one year to assess the relationship between days of methamphetamine use and symptom severity on the 24-item Brief Psychiatric Rating Scale. Exacerbation of psychiatric symptoms with methamphetamine use was quantified using random coefficient models. The dimensions of symptom exacerbation were examined using principal axis factoring and a latent profile analysis. Results Symptoms exacerbated by methamphetamine loaded on three factors: positive psychotic symptoms (suspiciousness, unusual thought content, hallucinations, bizarre behavior); affective symptoms (depression, suicidality, guilt, hostility, somatic concern, self-neglect); and psychomotor symptoms (tension, excitement, distractibility, motor hyperactivity). Methamphetamine use did not significantly increase negative symptoms. Vulnerability to positive psychotic and affective symptom exacerbation was shared by 28% of participants, and this vulnerability aligned with a past year DSM-IV diagnosis of substance-induced psychosis (38% vs. 22%, _2 (df1) = 3.66, p = 0.056). Conclusion Methamphetamine use produced a symptom profile comprised of positive psychotic and affective symptoms, which aligned with a diagnosis of substance-induced psychosis, with no evidence of a negative syndrome.

Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks

We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a function of the measurements and communicating it to an operator station. We restrict ourselves to the class of type-threshold functions (as defined in the work of Giridhar and Kumar, 2005), of which max, min, and indicator functions are important examples: our discussions are couched in terms of the max function. We view the problem as one of message-passing distributed computation over a geometric random graph. The network is assumed to be synchronous, and the sensors synchronously measure values and then collaborate to compute and deliver the function computed with these values to the operator station. Computation algorithms differ in (1) the communication topology assumed and (2) the messages that the nodes need to exchange in order to carry out the computation. The focus of our paper is to establish (in probability) scaling laws for the time and energy complexity of the distributed function computation over random wireless networks, under the assumption of centralized contention-free scheduling of packet transmissions. First, without any constraint on the computation algorithm, we establish scaling laws for the computation time and energy expenditure for one-time maximum computation. We show that for an optimal algorithm, the computation time and energy expenditure scale, respectively, as Theta(radicn/log n) and Theta(n) asymptotically as the number of sensors n rarr infin. Second, we analyze the performance of three specific computation algorithms that may be used in specific practical situations, namely, the tree algorithm, multihop transmission, and the Ripple algorithm (a type of gossip algorithm), and obtain scaling laws for the computation time and energy expenditure as n rarr infin. In particular, we show that the computation time for these algorithms scales as Theta(radicn/lo- g n), Theta(n), and Theta(radicn log n), respectively, whereas the energy expended scales as , Theta(n), Theta(radicn/log n), and Theta(radicn log n), respectively. Finally, simulation results are provided to show that our analysis indeed captures the correct scaling. The simulations also yield estimates of the constant multipliers in the scaling laws. Our analyses throughout assume a centralized optimal scheduler, and hence, our results can be viewed as providing bounds for the performance with practical distributed schedulers.

The Lovasz θ function, SVMs and finding large dense subgraphs

The Lovasz θ function of a graph, is a fundamental tool in combinatorial optimization and approximation algorithms. Computing θ involves solving a SDP and is extremely expensive even for moderately sized graphs. In this paper we establish that the Lovasz θ function is equivalent to a kernel learning problem related to one class SVM. This interesting connection opens up many opportunities bridging graph theoretic algorithms and machine learning. We show that there exist graphs, which we call SVM−θ graphs, on which the Lovasz θ function can be approximated well by a one-class SVM. This leads to a novel use of SVM techniques to solve algorithmic problems in large graphs e.g. identifying a planted clique of size Θ(n√) in a random graph G(n,12). A classic approach for this problem involves computing the θ function, however it is not scalable due to SDP computation. We show that the random graph with a planted clique is an example of SVM−θ graph, and as a consequence a SVM based approach easily identifies the clique in large graphs and is competitive with the state-of-the-art. Further, we introduce the notion of a ''common orthogonal labeling'' which extends the notion of a ''orthogonal labelling of a single graph (used in defining the θ function) to multiple graphs. The problem of finding the optimal common orthogonal labelling is cast as a Multiple Kernel Learning problem and is used to identify a large common dense region in multiple graphs. The proposed algorithm achieves an order of magnitude scalability compared to the state of the art.

Faster computation of the Karhunen-Loeve expansion using its domain independence property

The goal of this work is to reduce the cost of computing the coefficients in the Karhunen-Loeve (KL) expansion. The KL expansion serves as a useful and efficient tool for discretizing second-order stochastic processes with known covariance function. Its applications in engineering mechanics include discretizing random field models for elastic moduli, fluid properties, and structural response. The main computational cost of finding the coefficients of this expansion arises from numerically solving an integral eigenvalue problem with the covariance function as the integration kernel. Mathematically this is a homogeneous Fredholm equation of second type. One widely used method for solving this integral eigenvalue problem is to use finite element (FE) bases for discretizing the eigenfunctions, followed by a Galerkin projection. This method is computationally expensive. In the current work it is first shown that the shape of the physical domain in a random field does not affect the realizations of the field estimated using KL expansion, although the individual KL terms are affected. Based on this domain independence property, a numerical integration based scheme accompanied by a modification of the domain, is proposed. In addition to presenting mathematical arguments to establish the domain independence, numerical studies are also conducted to demonstrate and test the proposed method. Numerically it is demonstrated that compared to the Galerkin method the computational speed gain in the proposed method is of three to four orders of magnitude for a two dimensional example, and of one to two orders of magnitude for a three dimensional example, while retaining the same level of accuracy. It is also shown that for separable covariance kernels a further cost reduction of three to four orders of magnitude can be achieved. Both normal and lognormal fields are considered in the numerical studies. (c) 2014 Elsevier B.V. All rights reserved.

Global response sensitivity analysis using probability distance measures and generalization of Sobol's analysis

The study introduces two new alternatives for global response sensitivity analysis based on the application of the L-2-norm and Hellinger's metric for measuring distance between two probabilistic models. Both the procedures are shown to be capable of treating dependent non-Gaussian random variable models for the input variables. The sensitivity indices obtained based on the L2-norm involve second order moments of the response, and, when applied for the case of independent and identically distributed sequence of input random variables, it is shown to be related to the classical Sobol's response sensitivity indices. The analysis based on Hellinger's metric addresses variability across entire range or segments of the response probability density function. The measure is shown to be conceptually a more satisfying alternative to the Kullback-Leibler divergence based analysis which has been reported in the existing literature. Other issues addressed in the study cover Monte Carlo simulation based methods for computing the sensitivity indices and sensitivity analysis with respect to grouped variables. Illustrative examples consist of studies on global sensitivity analysis of natural frequencies of a random multi-degree of freedom system, response of a nonlinear frame, and safety margin associated with a nonlinear performance function. (C) 2015 Elsevier Ltd. All rights reserved.

Analysis of Spanish text-thesaurus as a complex network

[EN]Based on the theoretical tools of Complex Networks, this work provides a basic descriptive study of a synonyms dictionary, the Spanish Open Thesaurus represented as a graph. We study the main structural measures of the network compared with those of a random graph. Numerical results show that Open-Thesaurus is a graph whose topological properties approximate a scale-free network, but seems not to present the small-world property because of its sparse structure. We also found that the words of highest betweenness centrality are terms that suggest the vocabulary of psychoanalysis: placer (pleasure), ayudante (in the sense of assistant or worker), and regular (to regulate).

Modeling smart grids as complex systems through the implementation of intelligent hubs

ICINCO 2010