Research on Some Bus Transport Networks with Random Overlapping Clique Structure
NASA Astrophysics Data System (ADS)
Yang, Xu-Hua; Wang, Bo; Wang, Wan-Liang; Sun, You-Xian
2008-11-01
On the basis of investigating the statistical data of bus transport networks of three big cities in China, we propose that each bus route is a clique (maximal complete subgraph) and a bus transport network (BTN) consists of a lot of cliques, which intensively connect and overlap with each other. We study the network properties, which include the degree distribution, multiple edges' overlapping time distribution, distribution of the overlap size between any two overlapping cliques, distribution of the number of cliques that a node belongs to. Naturally, the cliques also constitute a network, with the overlapping nodes being their multiple links. We also research its network properties such as degree distribution, clustering, average path length, and so on. We propose that a BTN has the properties of random clique increment and random overlapping clique, at the same time, a BTN is a small-world network with highly clique-clustered and highly clique-overlapped. Finally, we introduce a BTN evolution model, whose simulation results agree well with the statistical laws that emerge in real BTNs.
Uncovering the overlapping community structure of complex networks by maximal cliques
NASA Astrophysics Data System (ADS)
Li, Junqiu; Wang, Xingyuan; Cui, Yaozu
2014-12-01
In this paper, a unique algorithm is proposed to detect overlapping communities in the un-weighted and weighted networks with considerable accuracy. The maximal cliques, overlapping vertex, bridge vertex and isolated vertex are introduced. First, all the maximal cliques are extracted by the algorithm based on the deep and bread searching. Then two maximal cliques can be merged into a larger sub-graph by some given rules. In addition, the proposed algorithm successfully finds overlapping vertices and bridge vertices between communities. Experimental results using some real-world networks data show that the performance of the proposed algorithm is satisfactory.
Finite-size scaling of clique percolation on two-dimensional Moore lattices
NASA Astrophysics Data System (ADS)
Dong, Jia-Qi; Shen, Zhou; Zhang, Yongwen; Huang, Zi-Gang; Huang, Liang; Chen, Xiaosong
2018-05-01
Clique percolation has attracted much attention due to its significance in understanding topological overlap among communities and dynamical instability of structured systems. Rich critical behavior has been observed in clique percolation on Erdős-Rényi (ER) random graphs, but few works have discussed clique percolation on finite dimensional systems. In this paper, we have defined a series of characteristic events, i.e., the historically largest size jumps of the clusters, in the percolating process of adding bonds and developed a new finite-size scaling scheme based on the interval of the characteristic events. Through the finite-size scaling analysis, we have found, interestingly, that, in contrast to the clique percolation on an ER graph where the critical exponents are parameter dependent, the two-dimensional (2D) clique percolation simply shares the same critical exponents with traditional site or bond percolation, independent of the clique percolation parameters. This has been corroborated by bridging two special types of clique percolation to site percolation on 2D lattices. Mechanisms for the difference of the critical behaviors between clique percolation on ER graphs and on 2D lattices are also discussed.
Detecting independent and recurrent copy number aberrations using interval graphs.
Wu, Hsin-Ta; Hajirasouliha, Iman; Raphael, Benjamin J
2014-06-15
Somatic copy number aberrations SCNAS: are frequent in cancer genomes, but many of these are random, passenger events. A common strategy to distinguish functional aberrations from passengers is to identify those aberrations that are recurrent across multiple samples. However, the extensive variability in the length and position of SCNA: s makes the problem of identifying recurrent aberrations notoriously difficult. We introduce a combinatorial approach to the problem of identifying independent and recurrent SCNA: s, focusing on the key challenging of separating the overlaps in aberrations across individuals into independent events. We derive independent and recurrent SCNA: s as maximal cliques in an interval graph constructed from overlaps between aberrations. We efficiently enumerate all such cliques, and derive a dynamic programming algorithm to find an optimal selection of non-overlapping cliques, resulting in a very fast algorithm, which we call RAIG (Recurrent Aberrations from Interval Graphs). We show that RAIG outperforms other methods on simulated data and also performs well on data from three cancer types from The Cancer Genome Atlas (TCGA). In contrast to existing approaches that employ various heuristics to select independent aberrations, RAIG optimizes a well-defined objective function. We show that this allows RAIG to identify rare aberrations that are likely functional, but are obscured by overlaps with larger passenger aberrations. http://compbio.cs.brown.edu/software. © The Author 2014. Published by Oxford University Press.
Overlapping Modularity at the Critical Point of k-Clique Percolation
NASA Astrophysics Data System (ADS)
Tóth, Bálint; Vicsek, Tamás; Palla, Gergely
2013-05-01
One of the most remarkable social phenomena is the formation of communities in social networks corresponding to families, friendship circles, work teams, etc. Since people usually belong to several different communities at the same time, the induced overlaps result in an extremely complicated web of the communities themselves. Thus, uncovering the intricate community structure of social networks is a non-trivial task with great potential for practical applications, gaining a notable interest in the recent years. The Clique Percolation Method (CPM) is one of the earliest overlapping community finding methods, which was already used in the analysis of several different social networks. In this approach the communities correspond to k-clique percolation clusters, and the general heuristic for setting the parameters of the method is to tune the system just below the critical point of k-clique percolation. However, this rule is based on simple physical principles and its validity was never subject to quantitative analysis. Here we examine the quality of the partitioning in the vicinity of the critical point using recently introduced overlapping modularity measures. According to our results on real social and other networks, the overlapping modularities show a maximum close to the critical point, justifying the original criteria for the optimal parameter settings.
Li, Bo; Li, Shuang; Wu, Junfeng; Qi, Hongsheng
2018-02-09
This paper establishes a framework of quantum clique gossiping by introducing local clique operations to networks of interconnected qubits. Cliques are local structures in complex networks being complete subgraphs, which can be used to accelerate classical gossip algorithms. Based on cyclic permutations, clique gossiping leads to collective multi-party qubit interactions. We show that at reduced states, these cliques have the same acceleration effects as their roles in accelerating classical gossip algorithms. For randomized selection of cliques, such improved rate of convergence is precisely characterized. On the other hand, the rate of convergence at the coherent states of the overall quantum network is proven to be decided by the spectrum of a mean-square error evolution matrix. Remarkably, the use of larger quantum cliques does not necessarily increase the speed of the network density aggregation, suggesting quantum network dynamics is not entirely decided by its classical topology.
Impacts of clustering on interacting epidemics.
Wang, Bing; Cao, Lang; Suzuki, Hideyuki; Aihara, Kazuyuki
2012-07-07
Since community structures in real networks play a major role for the epidemic spread, we therefore explore two interacting diseases spreading in networks with community structures. As a network model with community structures, we propose a random clique network model composed of different orders of cliques. We further assume that each disease spreads only through one type of cliques; this assumption corresponds to the issue that two diseases spread inside communities and outside them. Considering the relationship between the susceptible-infected-recovered (SIR) model and the bond percolation theory, we apply this theory to clique random networks under the assumption that the occupation probability is clique-type dependent, which is consistent with the observation that infection rates inside a community and outside it are different, and obtain a number of statistical properties for this model. Two interacting diseases that compete the same hosts are also investigated, which leads to a natural generalization of analyzing an arbitrary number of infectious diseases. For two-disease dynamics, the clustering effect is hypersensitive to the cohesiveness and concentration of cliques; this illustrates the impacts of clustering and the composition of subgraphs in networks on epidemic behavior. The analysis of coexistence/bistability regions provides significant insight into the relationship between the network structure and the potential epidemic prevalence. Copyright © 2012 Elsevier Ltd. All rights reserved.
Understanding the Scalability of Bayesian Network Inference Using Clique Tree Growth Curves
NASA Technical Reports Server (NTRS)
Mengshoel, Ole J.
2010-01-01
One of the main approaches to performing computation in Bayesian networks (BNs) is clique tree clustering and propagation. The clique tree approach consists of propagation in a clique tree compiled from a Bayesian network, and while it was introduced in the 1980s, there is still a lack of understanding of how clique tree computation time depends on variations in BN size and structure. In this article, we improve this understanding by developing an approach to characterizing clique tree growth as a function of parameters that can be computed in polynomial time from BNs, specifically: (i) the ratio of the number of a BN s non-root nodes to the number of root nodes, and (ii) the expected number of moral edges in their moral graphs. Analytically, we partition the set of cliques in a clique tree into different sets, and introduce a growth curve for the total size of each set. For the special case of bipartite BNs, there are two sets and two growth curves, a mixed clique growth curve and a root clique growth curve. In experiments, where random bipartite BNs generated using the BPART algorithm are studied, we systematically increase the out-degree of the root nodes in bipartite Bayesian networks, by increasing the number of leaf nodes. Surprisingly, root clique growth is well-approximated by Gompertz growth curves, an S-shaped family of curves that has previously been used to describe growth processes in biology, medicine, and neuroscience. We believe that this research improves the understanding of the scaling behavior of clique tree clustering for a certain class of Bayesian networks; presents an aid for trade-off studies of clique tree clustering using growth curves; and ultimately provides a foundation for benchmarking and developing improved BN inference and machine learning algorithms.
Finding Hierarchical and Overlapping Dense Subgraphs using Nucleus Decompositions
DOE Office of Scientific and Technical Information (OSTI.GOV)
Seshadhri, Comandur; Pinar, Ali; Sariyuce, Ahmet Erdem
Finding dense substructures in a graph is a fundamental graph mining operation, with applications in bioinformatics, social networks, and visualization to name a few. Yet most standard formulations of this problem (like clique, quasiclique, k-densest subgraph) are NP-hard. Furthermore, the goal is rarely to nd the \\true optimum", but to identify many (if not all) dense substructures, understand their distribution in the graph, and ideally determine a hierarchical structure among them. Current dense subgraph nding algorithms usually optimize some objective, and only nd a few such subgraphs without providing any hierarchy. It is also not clear how to account formore » overlaps in dense substructures. We de ne the nucleus decomposition of a graph, which represents the graph as a forest of nuclei. Each nucleus is a subgraph where smaller cliques are present in many larger cliques. The forest of nuclei is a hierarchy by containment, where the edge density increases as we proceed towards leaf nuclei. Sibling nuclei can have limited intersections, which allows for discovery of overlapping dense subgraphs. With the right parameters, the nuclear decomposition generalizes the classic notions of k-cores and k-trusses. We give provable e cient algorithms for nuclear decompositions, and empirically evaluate their behavior in a variety of real graphs. The tree of nuclei consistently gives a global, hierarchical snapshot of dense substructures, and outputs dense subgraphs of higher quality than other state-of-theart solutions. Our algorithm can process graphs with tens of millions of edges in less than an hour.« less
NASA Astrophysics Data System (ADS)
Albert, Lena; Rottensteiner, Franz; Heipke, Christian
2017-08-01
We propose a new approach for the simultaneous classification of land cover and land use considering spatial as well as semantic context. We apply a Conditional Random Fields (CRF) consisting of a land cover and a land use layer. In the land cover layer of the CRF, the nodes represent super-pixels; in the land use layer, the nodes correspond to objects from a geospatial database. Intra-layer edges of the CRF model spatial dependencies between neighbouring image sites. All spatially overlapping sites in both layers are connected by inter-layer edges, which leads to higher order cliques modelling the semantic relation between all land cover and land use sites in the clique. A generic formulation of the higher order potential is proposed. In order to enable efficient inference in the two-layer higher order CRF, we propose an iterative inference procedure in which the two classification tasks mutually influence each other. We integrate contextual relations between land cover and land use in the classification process by using contextual features describing the complex dependencies of all nodes in a higher order clique. These features are incorporated in a discriminative classifier, which approximates the higher order potentials during the inference procedure. The approach is designed for input data based on aerial images. Experiments are carried out on two test sites to evaluate the performance of the proposed method. The experiments show that the classification results are improved compared to the results of a non-contextual classifier. For land cover classification, the result is much more homogeneous and the delineation of land cover segments is improved. For the land use classification, an improvement is mainly achieved for land use objects showing non-typical characteristics or similarities to other land use classes. Furthermore, we have shown that the size of the super-pixels has an influence on the level of detail of the classification result, but also on the degree of smoothing induced by the segmentation method, which is especially beneficial for land cover classes covering large, homogeneous areas.
Seeding for pervasively overlapping communities
NASA Astrophysics Data System (ADS)
Lee, Conrad; Reid, Fergal; McDaid, Aaron; Hurley, Neil
2011-06-01
In some social and biological networks, the majority of nodes belong to multiple communities. It has recently been shown that a number of the algorithms specifically designed to detect overlapping communities do not perform well in such highly overlapping settings. Here, we consider one class of these algorithms, those which optimize a local fitness measure, typically by using a greedy heuristic to expand a seed into a community. We perform synthetic benchmarks which indicate that an appropriate seeding strategy becomes more important as the extent of community overlap increases. We find that distinct cliques provide the best seeds. We find further support for this seeding strategy with benchmarks on a Facebook network and the yeast interactome.
Tricriticality in the q-neighbor Ising model on a partially duplex clique.
Chmiel, Anna; Sienkiewicz, Julian; Sznajd-Weron, Katarzyna
2017-12-01
We analyze a modified kinetic Ising model, a so-called q-neighbor Ising model, with Metropolis dynamics [Phys. Rev. E 92, 052105 (2015)PLEEE81539-375510.1103/PhysRevE.92.052105] on a duplex clique and a partially duplex clique. In the q-neighbor Ising model each spin interacts only with q spins randomly chosen from its whole neighborhood. In the case of a duplex clique the change of a spin is allowed only if both levels simultaneously induce this change. Due to the mean-field-like nature of the model we are able to derive the analytic form of transition probabilities and solve the corresponding master equation. The existence of the second level changes dramatically the character of the phase transition. In the case of the monoplex clique, the q-neighbor Ising model exhibits a continuous phase transition for q=3, discontinuous phase transition for q≥4, and for q=1 and q=2 the phase transition is not observed. On the other hand, in the case of the duplex clique continuous phase transitions are observed for all values of q, even for q=1 and q=2. Subsequently we introduce a partially duplex clique, parametrized by r∈[0,1], which allows us to tune the network from monoplex (r=0) to duplex (r=1). Such a generalized topology, in which a fraction r of all nodes appear on both levels, allows us to obtain the critical value of r=r^{*}(q) at which a tricriticality (switch from continuous to discontinuous phase transition) appears.
World scientific collaboration in coronary heart disease research.
Yu, Qi; Shao, Hongfang; He, Peifeng; Duan, Zhiguang
2013-08-10
Coronary heart disease (CHD) will continue to exert a heavy burden for countries all over the world. Scientific collaboration has become the only choice for progress in biomedicine. Unfortunately, there is a scarcity of scientific publications about scientific collaboration in CHD research. This study examines collaboration behaviors across multiple collaboration types in the CHD research. 294,756 records about CHD were retrieved from Web of Science. Methods such as co-authorship, social network analysis, connected component, cliques, and betweenness centrality were used in this study. Collaborations have increased at the author, institution and country/region levels in CHD research over the past three decades. 3000 most collaborative authors, 572 most collaborative institutions and 52 countries/regions are extracted from their corresponding collaboration network. 766 cliques are found in the most collaborative authors. 308 cliques are found in the most collaborative institutions. Western countries/regions represent the core of the world's collaboration. The United States ranks first in terms of number of multi-national publications, while Hungary leads in the ranking measured by their proportion of collaborative output. The rate of economic development in the countries/regions also affects the multi-national collaboration behavior. Collaborations among countries/regions need to be encouraged in the CHD research. The visualization of overlapping cliques in the most collaborative authors and institutions are considered "skeleton" of the collaboration network. Eastern countries/regions should strengthen cooperation with western countries/regions in the CHD research. Copyright © 2012 Elsevier Ireland Ltd. All rights reserved.
Phase transitions in the q -voter model with noise on a duplex clique
NASA Astrophysics Data System (ADS)
Chmiel, Anna; Sznajd-Weron, Katarzyna
2015-11-01
We study a nonlinear q -voter model with stochastic noise, interpreted in the social context as independence, on a duplex network. To study the role of the multilevelness in this model we propose three methods of transferring the model from a mono- to a multiplex network. They take into account two criteria: one related to the status of independence (LOCAL vs GLOBAL) and one related to peer pressure (AND vs OR). In order to examine the influence of the presence of more than one level in the social network, we perform simulations on a particularly simple multiplex: a duplex clique, which consists of two fully overlapped complete graphs (cliques). Solving numerically the rate equation and simultaneously conducting Monte Carlo simulations, we provide evidence that even a simple rearrangement into a duplex topology may lead to significant changes in the observed behavior. However, qualitative changes in the phase transitions can be observed for only one of the considered rules: LOCAL&AND. For this rule the phase transition becomes discontinuous for q =5 , whereas for a monoplex such behavior is observed for q =6 . Interestingly, only this rule admits construction of realistic variants of the model, in line with recent social experiments.
Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time
2011-01-01
523 10 Arabisopsis thaliana 1745 3098 71 12 Drosophila melanogaster 7282 24894 176 12 Homo Sapiens 9527 31182 308 12 Schizosaccharomyces pombe 2031...clusters of actors [6,14,28,40] and may be used as features in exponential random graph models for statistical analysis of social networks [17,19,20,44,49...29. R. Horaud and T. Skordas. Stereo correspondence through feature grouping and maximal cliques. IEEE Trans. Patt. An. Mach. Int. 11(11):1168–1180
cWINNOWER algorithm for finding fuzzy dna motifs
NASA Technical Reports Server (NTRS)
Liang, S.; Samanta, M. P.; Biegel, B. A.
2004-01-01
The cWINNOWER algorithm detects fuzzy motifs in DNA sequences rich in protein-binding signals. A signal is defined as any short nucleotide pattern having up to d mutations differing from a motif of length l. The algorithm finds such motifs if a clique consisting of a sufficiently large number of mutated copies of the motif (i.e., the signals) is present in the DNA sequence. The cWINNOWER algorithm substantially improves the sensitivity of the winnower method of Pevzner and Sze by imposing a consensus constraint, enabling it to detect much weaker signals. We studied the minimum detectable clique size qc as a function of sequence length N for random sequences. We found that qc increases linearly with N for a fast version of the algorithm based on counting three-member sub-cliques. Imposing consensus constraints reduces qc by a factor of three in this case, which makes the algorithm dramatically more sensitive. Our most sensitive algorithm, which counts four-member sub-cliques, needs a minimum of only 13 signals to detect motifs in a sequence of length N = 12,000 for (l, d) = (15, 4). Copyright Imperial College Press.
Schaub, Michael T.; Delvenne, Jean-Charles; Yaliraki, Sophia N.; Barahona, Mauricio
2012-01-01
In recent years, there has been a surge of interest in community detection algorithms for complex networks. A variety of computational heuristics, some with a long history, have been proposed for the identification of communities or, alternatively, of good graph partitions. In most cases, the algorithms maximize a particular objective function, thereby finding the ‘right’ split into communities. Although a thorough comparison of algorithms is still lacking, there has been an effort to design benchmarks, i.e., random graph models with known community structure against which algorithms can be evaluated. However, popular community detection methods and benchmarks normally assume an implicit notion of community based on clique-like subgraphs, a form of community structure that is not always characteristic of real networks. Specifically, networks that emerge from geometric constraints can have natural non clique-like substructures with large effective diameters, which can be interpreted as long-range communities. In this work, we show that long-range communities escape detection by popular methods, which are blinded by a restricted ‘field-of-view’ limit, an intrinsic upper scale on the communities they can detect. The field-of-view limit means that long-range communities tend to be overpartitioned. We show how by adopting a dynamical perspective towards community detection [1], [2], in which the evolution of a Markov process on the graph is used as a zooming lens over the structure of the network at all scales, one can detect both clique- or non clique-like communities without imposing an upper scale to the detection. Consequently, the performance of algorithms on inherently low-diameter, clique-like benchmarks may not always be indicative of equally good results in real networks with local, sparser connectivity. We illustrate our ideas with constructive examples and through the analysis of real-world networks from imaging, protein structures and the power grid, where a multiscale structure of non clique-like communities is revealed. PMID:22384178
Pattiselanno, Kim; Dijkstra, Jan Kornelis; Steglich, Christian; Vollebergh, Wilma; Veenstra, René
2015-12-01
Peer cliques form an important context for the social development of adolescents. Although clique members are often similar in social status, also within cliques, status differences exist. How differences in social status between clique members are related to behaviors of its individual members is rather unknown. This study examined to what extent the relationship of individual social status (i.e., perceived popularity) with aggression and prosocial behavior depends on the level of internal clique hierarchy. The sample consists of 2674 adolescents (49.8% boys), with a mean age of 14.02. We focused specifically on physical and relational aggression, and practical and emotional support, because these behaviors have shown to be of great importance for social relationships and social standing among adolescents. The internal status hierarchy of cliques was based on the variation in individual social status between clique members (i.e., clique hierarchization) and the structure of status scores within a clique (pyramid shape, inverted pyramid, or equal distribution of social status scores) (i.e., clique status structure). The results showed that differences in aggressive and prosocial behaviors were particularly moderated by clique status structure: aggression was stronger related to individual social status in (girls') cliques where the clique status structure reflected an inverted pyramid with relatively more high status adolescents within the clique than low status peers, and prosocial behavior showed a significant relationship with individual social status, again predominantly in inverted pyramid structured (boys' and girls') cliques. Furthermore, these effects differed by types of gender cliques: the associations were found in same gender but not mixed-gender cliques. The findings stress the importance of taking into account internal clique characteristics when studying adolescent social status in relationship to aggression and prosociality.
Clique Relaxations in Biological and Social Network Analysis Foundations and Algorithms
2015-10-26
study of clique relaxation models arising in biological and social networks. This project examines the elementary clique-defining properties... elementary clique-defining properties inherently exploited in the available clique relaxation models and pro- poses a taxonomic framework that not...analyzes the elementary clique-defining properties implicitly exploited in the available clique relaxation models and proposes a taxonomic framework that
Finding Maximum Cliques on the D-Wave Quantum Annealer
Chapuis, Guillaume; Djidjev, Hristo; Hahn, Georg; ...
2018-05-03
This work assesses the performance of the D-Wave 2X (DW) quantum annealer for finding a maximum clique in a graph, one of the most fundamental and important NP-hard problems. Because the size of the largest graphs DW can directly solve is quite small (usually around 45 vertices), we also consider decomposition algorithms intended for larger graphs and analyze their performance. For smaller graphs that fit DW, we provide formulations of the maximum clique problem as a quadratic unconstrained binary optimization (QUBO) problem, which is one of the two input types (together with the Ising model) acceptable by the machine, andmore » compare several quantum implementations to current classical algorithms such as simulated annealing, Gurobi, and third-party clique finding heuristics. We further estimate the contributions of the quantum phase of the quantum annealer and the classical post-processing phase typically used to enhance each solution returned by DW. We demonstrate that on random graphs that fit DW, no quantum speedup can be observed compared with the classical algorithms. On the other hand, for instances specifically designed to fit well the DW qubit interconnection network, we observe substantial speed-ups in computing time over classical approaches.« less
Finding Maximum Cliques on the D-Wave Quantum Annealer
DOE Office of Scientific and Technical Information (OSTI.GOV)
Chapuis, Guillaume; Djidjev, Hristo; Hahn, Georg
This work assesses the performance of the D-Wave 2X (DW) quantum annealer for finding a maximum clique in a graph, one of the most fundamental and important NP-hard problems. Because the size of the largest graphs DW can directly solve is quite small (usually around 45 vertices), we also consider decomposition algorithms intended for larger graphs and analyze their performance. For smaller graphs that fit DW, we provide formulations of the maximum clique problem as a quadratic unconstrained binary optimization (QUBO) problem, which is one of the two input types (together with the Ising model) acceptable by the machine, andmore » compare several quantum implementations to current classical algorithms such as simulated annealing, Gurobi, and third-party clique finding heuristics. We further estimate the contributions of the quantum phase of the quantum annealer and the classical post-processing phase typically used to enhance each solution returned by DW. We demonstrate that on random graphs that fit DW, no quantum speedup can be observed compared with the classical algorithms. On the other hand, for instances specifically designed to fit well the DW qubit interconnection network, we observe substantial speed-ups in computing time over classical approaches.« less
NASA Astrophysics Data System (ADS)
Palla, Gergely; Farkas, Illés J.; Pollner, Péter; Derényi, Imre; Vicsek, Tamás
2007-06-01
A search technique locating network modules, i.e. internally densely connected groups of nodes in directed networks is introduced by extending the clique percolation method originally proposed for undirected networks. After giving a suitable definition for directed modules we investigate their percolation transition in the Erdos-Rényi graph both analytically and numerically. We also analyse four real-world directed networks, including Google's own web-pages, an email network, a word association graph and the transcriptional regulatory network of the yeast Saccharomyces cerevisiae. The obtained directed modules are validated by additional information available for the nodes. We find that directed modules of real-world graphs inherently overlap and the investigated networks can be classified into two major groups in terms of the overlaps between the modules. Accordingly, in the word-association network and Google's web-pages, overlaps are likely to contain in-hubs, whereas the modules in the email and transcriptional regulatory network tend to overlap via out-hubs.
Flow motifs reveal limitations of the static framework to represent human interactions
NASA Astrophysics Data System (ADS)
Rocha, Luis E. C.; Blondel, Vincent D.
2013-04-01
Networks are commonly used to define underlying interaction structures where infections, information, or other quantities may spread. Although the standard approach has been to aggregate all links into a static structure, some studies have shown that the time order in which the links are established may alter the dynamics of spreading. In this paper, we study the impact of the time ordering in the limits of flow on various empirical temporal networks. By using a random walk dynamics, we estimate the flow on links and convert the original undirected network (temporal and static) into a directed flow network. We then introduce the concept of flow motifs and quantify the divergence in the representativity of motifs when using the temporal and static frameworks. We find that the regularity of contacts and persistence of vertices (common in email communication and face-to-face interactions) result on little differences in the limits of flow for both frameworks. On the other hand, in the case of communication within a dating site and of a sexual network, the flow between vertices changes significantly in the temporal framework such that the static approximation poorly represents the structure of contacts. We have also observed that cliques with 3 and 4 vertices containing only low-flow links are more represented than the same cliques with all high-flow links. The representativity of these low-flow cliques is higher in the temporal framework. Our results suggest that the flow between vertices connected in cliques depend on the topological context in which they are placed and in the time sequence in which the links are established. The structure of the clique alone does not completely characterize the potential of flow between the vertices.
Predicting disease-related proteins based on clique backbone in protein-protein interaction network.
Yang, Lei; Zhao, Xudong; Tang, Xianglong
2014-01-01
Network biology integrates different kinds of data, including physical or functional networks and disease gene sets, to interpret human disease. A clique (maximal complete subgraph) in a protein-protein interaction network is a topological module and possesses inherently biological significance. A disease-related clique possibly associates with complex diseases. Fully identifying disease components in a clique is conductive to uncovering disease mechanisms. This paper proposes an approach of predicting disease proteins based on cliques in a protein-protein interaction network. To tolerate false positive and negative interactions in protein networks, extending cliques and scoring predicted disease proteins with gene ontology terms are introduced to the clique-based method. Precisions of predicted disease proteins are verified by disease phenotypes and steadily keep to more than 95%. The predicted disease proteins associated with cliques can partly complement mapping between genotype and phenotype, and provide clues for understanding the pathogenesis of serious diseases.
Understanding the Scalability of Bayesian Network Inference using Clique Tree Growth Curves
NASA Technical Reports Server (NTRS)
Mengshoel, Ole Jakob
2009-01-01
Bayesian networks (BNs) are used to represent and efficiently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to perform computation in BNs is clique tree clustering and propagation. In this approach, BN computation consists of propagation in a clique tree compiled from a Bayesian network. There is a lack of understanding of how clique tree computation time, and BN computation time in more general, depends on variations in BN size and structure. On the one hand, complexity results tell us that many interesting BN queries are NP-hard or worse to answer, and it is not hard to find application BNs where the clique tree approach in practice cannot be used. On the other hand, it is well-known that tree-structured BNs can be used to answer probabilistic queries in polynomial time. In this article, we develop an approach to characterizing clique tree growth as a function of parameters that can be computed in polynomial time from BNs, specifically: (i) the ratio of the number of a BN's non-root nodes to the number of root nodes, or (ii) the expected number of moral edges in their moral graphs. Our approach is based on combining analytical and experimental results. Analytically, we partition the set of cliques in a clique tree into different sets, and introduce a growth curve for each set. For the special case of bipartite BNs, we consequently have two growth curves, a mixed clique growth curve and a root clique growth curve. In experiments, we systematically increase the degree of the root nodes in bipartite Bayesian networks, and find that root clique growth is well-approximated by Gompertz growth curves. It is believed that this research improves the understanding of the scaling behavior of clique tree clustering, provides a foundation for benchmarking and developing improved BN inference and machine learning algorithms, and presents an aid for analytical trade-off studies of clique tree clustering using growth curves.
Varoquaux, G; Gramfort, A; Poline, J B; Thirion, B
2012-01-01
Correlations in the signal observed via functional Magnetic Resonance Imaging (fMRI), are expected to reveal the interactions in the underlying neural populations through hemodynamic response. In particular, they highlight distributed set of mutually correlated regions that correspond to brain networks related to different cognitive functions. Yet graph-theoretical studies of neural connections give a different picture: that of a highly integrated system with small-world properties: local clustering but with short pathways across the complete structure. We examine the conditional independence properties of the fMRI signal, i.e. its Markov structure, to find realistic assumptions on the connectivity structure that are required to explain the observed functional connectivity. In particular we seek a decomposition of the Markov structure into segregated functional networks using decomposable graphs: a set of strongly-connected and partially overlapping cliques. We introduce a new method to efficiently extract such cliques on a large, strongly-connected graph. We compare methods learning different graph structures from functional connectivity by testing the goodness of fit of the model they learn on new data. We find that summarizing the structure as strongly-connected networks can give a good description only for very large and overlapping networks. These results highlight that Markov models are good tools to identify the structure of brain connectivity from fMRI signals, but for this purpose they must reflect the small-world properties of the underlying neural systems. Copyright © 2012 Elsevier Ltd. All rights reserved.
Fixation probability on clique-based graphs
NASA Astrophysics Data System (ADS)
Choi, Jeong-Ok; Yu, Unjong
2018-02-01
The fixation probability of a mutant in the evolutionary dynamics of Moran process is calculated by the Monte-Carlo method on a few families of clique-based graphs. It is shown that the complete suppression of fixation can be realized with the generalized clique-wheel graph in the limit of small wheel-clique ratio and infinite size. The family of clique-star is an amplifier, and clique-arms graph changes from amplifier to suppressor as the fitness of the mutant increases. We demonstrate that the overall structure of a graph can be more important to determine the fixation probability than the degree or the heat heterogeneity. The dependence of the fixation probability on the position of the first mutant is discussed.
ERIC Educational Resources Information Center
Zarbatany, Lynne; Tremblay, Paul F.; Ellis, Wendy E.; Chen, Xinyin; Kinal, Megan; Boyko, Lisa
2017-01-01
This study examined aspects of peer clique participation that mitigated victimization by peers over a school year. Participants were 1,033 children age 8-14 years (M[subscript age] = 11.81; 444 boys and 589 girls), including 128 (66 boys) victimized children. Cliques (N = 162) and clique participation were assessed by using the Social Cognitive…
Witvliet, Miranda; Brendgen, Mara; van Lier, Pol A. C.; Vitaro, Frank
2010-01-01
This study examined whether clique isolation predicted an increase in depressive symptoms and whether this association was mediated by loneliness and perceived social acceptance in 310 children followed from age 11–14 years. Clique isolation was identified through social network analysis, whereas depressive symptoms, loneliness, and perceived social acceptance were assessed using self ratings. While accounting for initial levels of depressive symptoms, peer rejection, and friendlessness at age 11 years, a high probability of being isolated from cliques from age 11 to 13 years predicted depressive symptoms at age 14 years. The link between clique isolation and depressive symptoms was mediated by loneliness, but not by perceived social acceptance. No sex differences were found in the associations between clique isolation and depressive symptoms. These results suggest that clique isolation is a social risk factor for the escalation of depressive symptoms in early adolescence. Implications for research and prevention are discussed. PMID:20499155
NASA Astrophysics Data System (ADS)
Palla, Gergely; Derenyi, Imre; Farkas, Illes J.; Vicsek, Tamas
2006-03-01
Most tasks in a cell are performed not by individual proteins, but by functional groups of proteins (either physically interacting with each other or associated in other ways). In gene (protein) association networks these groups show up as sets of densely connected nodes. In the yeast, Saccharomyces cerevisiae, known physically interacting groups of proteins (called protein complexes) strongly overlap: the total number of proteins contained by these complexes by far underestimates the sum of their sizes (2750 vs. 8932). Thus, most functional groups of proteins, both physically interacting and other, are likely to share many of their members with other groups. However, current algorithms searching for dense groups of nodes in networks usually exclude overlaps. With the aim to discover both novel functions of individual proteins and novel protein functional groups we combine in protein association networks (i) a search for overlapping dense subgraphs based on the Clique Percolation Method (CPM) (Palla, G., et.al. Nature 435, 814-818 (2005), http://angel.elte.hu/clustering), which explicitly allows for overlaps among the groups, and (ii) a verification and characterization of the identified groups of nodes (proteins) with the help of standard annotation databases listing known functions.
Empirical Study of User Preferences Based on Rating Data of Movies
Zhao, YingSi; Shen, Bo
2016-01-01
User preference plays a prominent role in many fields, including electronic commerce, social opinion, and Internet search engines. Particularly in recommender systems, it directly influences the accuracy of the recommendation. Though many methods have been presented, most of these have only focused on how to improve the recommendation results. In this paper, we introduce an empirical study of user preferences based on a set of rating data about movies. We develop a simple statistical method to investigate the characteristics of user preferences. We find that the movies have potential characteristics of closure, which results in the formation of numerous cliques with a power-law size distribution. We also find that a user related to a small clique always has similar opinions on the movies in this clique. Then, we suggest a user preference model, which can eliminate the predictions that are considered to be impracticable. Numerical results show that the model can reflect user preference with remarkable accuracy when data elimination is allowed, and random factors in the rating data make prediction error inevitable. In further research, we will investigate many other rating data sets to examine the universality of our findings. PMID:26735847
Road networks as collections of minimum cost paths
NASA Astrophysics Data System (ADS)
Wegner, Jan Dirk; Montoya-Zegarra, Javier Alexander; Schindler, Konrad
2015-10-01
We present a probabilistic representation of network structures in images. Our target application is the extraction of urban roads from aerial images. Roads appear as thin, elongated, partially curved structures forming a loopy graph, and this complex layout requires a prior that goes beyond standard smoothness and co-occurrence assumptions. In the proposed model the network is represented as a union of 1D paths connecting distant (super-)pixels. A large set of putative candidate paths is constructed in such a way that they include the true network as much as possible, by searching for minimum cost paths in the foreground (road) likelihood. Selecting the optimal subset of candidate paths is posed as MAP inference in a higher-order conditional random field. Each path forms a higher-order clique with a type of clique potential, which attracts the member nodes of cliques with high cumulative road evidence to the foreground label. That formulation induces a robust PN -Potts model, for which a global MAP solution can be found efficiently with graph cuts. Experiments with two road data sets show that the proposed model significantly improves per-pixel accuracies as well as the overall topological network quality with respect to several baselines.
Empirical Study of User Preferences Based on Rating Data of Movies.
Zhao, YingSi; Shen, Bo
2016-01-01
User preference plays a prominent role in many fields, including electronic commerce, social opinion, and Internet search engines. Particularly in recommender systems, it directly influences the accuracy of the recommendation. Though many methods have been presented, most of these have only focused on how to improve the recommendation results. In this paper, we introduce an empirical study of user preferences based on a set of rating data about movies. We develop a simple statistical method to investigate the characteristics of user preferences. We find that the movies have potential characteristics of closure, which results in the formation of numerous cliques with a power-law size distribution. We also find that a user related to a small clique always has similar opinions on the movies in this clique. Then, we suggest a user preference model, which can eliminate the predictions that are considered to be impracticable. Numerical results show that the model can reflect user preference with remarkable accuracy when data elimination is allowed, and random factors in the rating data make prediction error inevitable. In further research, we will investigate many other rating data sets to examine the universality of our findings.
Coloring geographical threshold graphs
DOE Office of Scientific and Technical Information (OSTI.GOV)
Bradonjic, Milan; Percus, Allon; Muller, Tobias
We propose a coloring algorithm for sparse random graphs generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a Euclidean space, and edges are assigned according to a threshold function involving the distance between nodes as well as randomly chosen node weights. The motivation for analyzing this model is that many real networks (e.g., wireless networks, the Internet, etc.) need to be studied by using a 'richer' stochastic model (which in this case includes both a distance between nodes and weights on the nodes). Here, we analyzemore » the GTG coloring algorithm together with the graph's clique number, showing formally that in spite of the differences in structure between GTG and RGG, the asymptotic behavior of the chromatic number is identical: {chi}1n 1n n / 1n n (1 + {omicron}(1)). Finally, we consider the leading corrections to this expression, again using the coloring algorithm and clique number to provide bounds on the chromatic number. We show that the gap between the lower and upper bound is within C 1n n / (1n 1n n){sup 2}, and specify the constant C.« less
Sim, Jaehyun; Sim, Jun; Park, Eunsung; Lee, Julian
2015-06-01
Many proteins undergo large-scale motions where relatively rigid domains move against each other. The identification of rigid domains, as well as the hinge residues important for their relative movements, is important for various applications including flexible docking simulations. In this work, we develop a method for protein rigid domain identification based on an exhaustive enumeration of maximal rigid domains, the rigid domains not fully contained within other domains. The computation is performed by mapping the problem to that of finding maximal cliques in a graph. A minimal set of rigid domains are then selected, which cover most of the protein with minimal overlap. In contrast to the results of existing methods that partition a protein into non-overlapping domains using approximate algorithms, the rigid domains obtained from exact enumeration naturally contain overlapping regions, which correspond to the hinges of the inter-domain bending motion. The performance of the algorithm is demonstrated on several proteins. © 2015 Wiley Periodicals, Inc.
Maximal clique enumeration with data-parallel primitives
DOE Office of Scientific and Technical Information (OSTI.GOV)
Lessley, Brenton; Perciano, Talita; Mathai, Manish
The enumeration of all maximal cliques in an undirected graph is a fundamental problem arising in several research areas. We consider maximal clique enumeration on shared-memory, multi-core architectures and introduce an approach consisting entirely of data-parallel operations, in an effort to achieve efficient and portable performance across different architectures. We study the performance of the algorithm via experiments varying over benchmark graphs and architectures. Overall, we observe that our algorithm achieves up to a 33-time speedup and 9-time speedup over state-of-the-art distributed and serial algorithms, respectively, for graphs with higher ratios of maximal cliques to total cliques. Further, we attainmore » additional speedups on a GPU architecture, demonstrating the portable performance of our data-parallel design.« less
Bully Victimization: Selection and Influence Within Adolescent Friendship Networks and Cliques.
Lodder, Gerine M A; Scholte, Ron H J; Cillessen, Antonius H N; Giletta, Matteo
2016-01-01
Adolescents tend to form friendships with similar peers and, in turn, their friends further influence adolescents' behaviors and attitudes. Emerging work has shown that these selection and influence processes also might extend to bully victimization. However, no prior work has examined selection and influence effects involved in bully victimization within cliques, despite theoretical account emphasizing the importance of cliques in this regard. This study examined selection and influence processes in adolescence regarding bully victimization both at the level of the entire friendship network and the level of cliques. We used a two-wave design (5-month interval). Participants were 543 adolescents (50.1% male, Mage = 15.8) in secondary education. Stochastic actor-based models indicated that at the level of the larger friendship network, adolescents tended to select friends with similar levels of bully victimization as they themselves. In addition, adolescent friends influenced each other in terms of bully victimization over time. Actor Parter Interdependence models showed that similarities in bully victimization between clique members were not due to selection of clique members. For boys, average clique bully victimization predicted individual bully victimization over time (influence), but not vice versa. No influence was found for girls, indicating that different mechanisms may underlie friend influence on bully victimization for girls and boys. The differences in results at the level of the larger friendship network versus the clique emphasize the importance of taking the type of friendship ties into account in research on selection and influence processes involved in bully victimization.
An Examination of Adolescent Clique Language in a Suburban Secondary School.
ERIC Educational Resources Information Center
Leona, Matteo H.
1978-01-01
Through a survey and in-depth interviews, three major cliques were identified at a middle income suburban high school near Boston. "Jocks,""motorheads," and "fleabags" were groupings based, respectively, on common interests in sports, cars, and drugs. Each clique is described in terms of appearance, general…
Popularity in the Peer Group and Victimization within Friendship Cliques during Early Adolescence
ERIC Educational Resources Information Center
Closson, Leanna M.; Watanabe, Lori
2018-01-01
Victimization has been primarily studied within the broader peer group, leaving other potentially important contexts, such as friendship cliques, unexplored. This study examined the role of popularity in identifying protective factors that buffer against victimization within early adolescents' (N = 387) friendship cliques. Previously identified…
Quantum speedup in solving the maximal-clique problem
NASA Astrophysics Data System (ADS)
Chang, Weng-Long; Yu, Qi; Li, Zhaokai; Chen, Jiahui; Peng, Xinhua; Feng, Mang
2018-03-01
The maximal-clique problem, to find the maximally sized clique in a given graph, is classically an NP-complete computational problem, which has potential applications ranging from electrical engineering, computational chemistry, and bioinformatics to social networks. Here we develop a quantum algorithm to solve the maximal-clique problem for any graph G with n vertices with quadratic speedup over its classical counterparts, where the time and spatial complexities are reduced to, respectively, O (√{2n}) and O (n2) . With respect to oracle-related quantum algorithms for the NP-complete problems, we identify our algorithm as optimal. To justify the feasibility of the proposed quantum algorithm, we successfully solve a typical clique problem for a graph G with two vertices and one edge by carrying out a nuclear magnetic resonance experiment involving four qubits.
ERIC Educational Resources Information Center
Witvliet, Miranda; Brendgen, Mara; van Lier, Pol A. C.; Koot, Hans M.; Vitaro, Frank
2010-01-01
This study examined whether clique isolation predicted an increase in depressive symptoms and whether this association was mediated by loneliness and perceived social acceptance in 310 children followed from age 11-14 years. Clique isolation was identified through social network analysis, whereas depressive symptoms, loneliness, and perceived…
Structural Transitions in Densifying Networks
NASA Astrophysics Data System (ADS)
Lambiotte, R.; Krapivsky, P. L.; Bhat, U.; Redner, S.
2016-11-01
We introduce a minimal generative model for densifying networks in which a new node attaches to a randomly selected target node and also to each of its neighbors with probability p . The networks that emerge from this copying mechanism are sparse for p <1/2 and dense (average degree increasing with number of nodes N ) for p ≥1/2 . The behavior in the dense regime is especially rich; for example, individual network realizations that are built by copying are disparate and not self-averaging. Further, there is an infinite sequence of structural anomalies at p =2/3 , 3/4 , 4/5 , etc., where the N dependences of the number of triangles (3-cliques), 4-cliques, undergo phase transitions. When linking to second neighbors of the target can occur, the probability that the resulting graph is complete—all nodes are connected—is nonzero as N →∞ .
Higher-order clustering in networks
NASA Astrophysics Data System (ADS)
Yin, Hao; Benson, Austin R.; Leskovec, Jure
2018-05-01
A fundamental property of complex networks is the tendency for edges to cluster. The extent of the clustering is typically quantified by the clustering coefficient, which is the probability that a length-2 path is closed, i.e., induces a triangle in the network. However, higher-order cliques beyond triangles are crucial to understanding complex networks, and the clustering behavior with respect to such higher-order network structures is not well understood. Here we introduce higher-order clustering coefficients that measure the closure probability of higher-order network cliques and provide a more comprehensive view of how the edges of complex networks cluster. Our higher-order clustering coefficients are a natural generalization of the traditional clustering coefficient. We derive several properties about higher-order clustering coefficients and analyze them under common random graph models. Finally, we use higher-order clustering coefficients to gain new insights into the structure of real-world networks from several domains.
Revealing the ISO/IEC 9126-1 Clique Tree for COTS Software Evaluation
NASA Technical Reports Server (NTRS)
Morris, A. Terry
2007-01-01
Previous research has shown that acyclic dependency models, if they exist, can be extracted from software quality standards and that these models can be used to assess software safety and product quality. In the case of commercial off-the-shelf (COTS) software, the extracted dependency model can be used in a probabilistic Bayesian network context for COTS software evaluation. Furthermore, while experts typically employ Bayesian networks to encode domain knowledge, secondary structures (clique trees) from Bayesian network graphs can be used to determine the probabilistic distribution of any software variable (attribute) using any clique that contains that variable. Secondary structures, therefore, provide insight into the fundamental nature of graphical networks. This paper will apply secondary structure calculations to reveal the clique tree of the acyclic dependency model extracted from the ISO/IEC 9126-1 software quality standard. Suggestions will be provided to describe how the clique tree may be exploited to aid efficient transformation of an evaluation model.
Brain Computation Is Organized via Power-of-Two-Based Permutation Logic.
Xie, Kun; Fox, Grace E; Liu, Jun; Lyu, Cheng; Lee, Jason C; Kuang, Hui; Jacobs, Stephanie; Li, Meng; Liu, Tianming; Song, Sen; Tsien, Joe Z
2016-01-01
There is considerable scientific interest in understanding how cell assemblies-the long-presumed computational motif-are organized so that the brain can generate intelligent cognition and flexible behavior. The Theory of Connectivity proposes that the origin of intelligence is rooted in a power-of-two-based permutation logic ( N = 2 i -1), producing specific-to-general cell-assembly architecture capable of generating specific perceptions and memories, as well as generalized knowledge and flexible actions. We show that this power-of-two-based permutation logic is widely used in cortical and subcortical circuits across animal species and is conserved for the processing of a variety of cognitive modalities including appetitive, emotional and social information. However, modulatory neurons, such as dopaminergic (DA) neurons, use a simpler logic despite their distinct subtypes. Interestingly, this specific-to-general permutation logic remained largely intact although NMDA receptors-the synaptic switch for learning and memory-were deleted throughout adulthood, suggesting that the logic is developmentally pre-configured. Moreover, this computational logic is implemented in the cortex via combining a random-connectivity strategy in superficial layers 2/3 with nonrandom organizations in deep layers 5/6. This randomness of layers 2/3 cliques-which preferentially encode specific and low-combinatorial features and project inter-cortically-is ideal for maximizing cross-modality novel pattern-extraction, pattern-discrimination and pattern-categorization using sparse code, consequently explaining why it requires hippocampal offline-consolidation. In contrast, the nonrandomness in layers 5/6-which consists of few specific cliques but a higher portion of more general cliques projecting mostly to subcortical systems-is ideal for feedback-control of motivation, emotion, consciousness and behaviors. These observations suggest that the brain's basic computational algorithm is indeed organized by the power-of-two-based permutation logic. This simple mathematical logic can account for brain computation across the entire evolutionary spectrum, ranging from the simplest neural networks to the most complex.
Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets
NASA Astrophysics Data System (ADS)
Hamilton, Kathleen E.; Humble, Travis S.
2017-04-01
Using quantum annealing to solve an optimization problem requires minor embedding a logic graph into a known hardware graph. In an effort to reduce the complexity of the minor embedding problem, we introduce the minor set cover (MSC) of a known graph G: a subset of graph minors which contain any remaining minor of the graph as a subgraph. Any graph that can be embedded into G will be embeddable into a member of the MSC. Focusing on embedding into the hardware graph of commercially available quantum annealers, we establish the MSC for a particular known virtual hardware, which is a complete bipartite graph. We show that the complete bipartite graph K_{N,N} has a MSC of N minors, from which K_{N+1} is identified as the largest clique minor of K_{N,N}. The case of determining the largest clique minor of hardware with faults is briefly discussed but remains an open question.
Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets
Hamilton, Kathleen E.; Humble, Travis S.
2017-02-23
Using quantum annealing to solve an optimization problem requires minor embedding a logic graph into a known hardware graph. We introduce the minor set cover (MSC) of a known graph GG : a subset of graph minors which contain any remaining minor of the graph as a subgraph, in an effort to reduce the complexity of the minor embedding problem. Any graph that can be embedded into GG will be embeddable into a member of the MSC. Focusing on embedding into the hardware graph of commercially available quantum annealers, we establish the MSC for a particular known virtual hardware, whichmore » is a complete bipartite graph. Furthermore, we show that the complete bipartite graph K N,N has a MSC of N minors, from which K N+1 is identified as the largest clique minor of K N,N. In the case of determining the largest clique minor of hardware with faults we briefly discussed this open question.« less
Pearce, Eiluned; Launay, Jacques; van Duijn, Max; Rotkirch, Anna; David-Barrett, Tamas; Dunbar, Robin I M
2016-01-01
Singing together seems to facilitate social bonding, but it is unclear whether this is true in all contexts. Here we examine the social bonding outcomes of naturalistic singing behaviour in a European university Fraternity composed of exclusive ‘Cliques’: recognised sub-groups of 5-20 friends who adopt a special name and identity. Singing occurs frequently in this Fraternity, both ‘competitively’ (contests between Cliques) and ‘cooperatively’ (multiple Cliques singing together). Both situations were re-created experimentally in order to explore how competitive and cooperative singing affects feelings of closeness towards others. Participants were assigned to teams of four and were asked to sing together with another team either from the same Clique or from a different Clique. Participants (N = 88) felt significantly closer to teams from different Cliques after singing with them compared to before, regardless of whether they cooperated with (singing loudly together) or competed against (trying to singing louder than) the other team. In contrast, participants reported reduced closeness with other teams from their own Clique after competing with them. These results indicate that group singing can increase closeness to less familiar individuals regardless of whether they share a common motivation, but that singing competitively may reduce closeness within a very tight-knit group. PMID:27777494
... the outside and know that a clique is bullying or intimidating others, let teachers or counselors know ... Teens What Stresses You Out About School? Shyness Cyberbullying Sexual Harassment and Sexual Bullying Dealing With Bullying ...
Social Network Centrality and Leadership Status
Lansford, Jennifer E.; Costanzo, Philip R.; Grimes, Christina; Putallaz, Martha; Miller, Shari; Malone, Patrick S.
2009-01-01
Seventh-grade students (N = 324) completed social cognitive maps to identify peer groups and peer group leaders, sociometric nominations to describe their peers’ behaviors, and questionnaires to assess their own behaviors. Peer group members resembled one another in levels of direct and indirect aggression and substance use; girls’ cliques were more behaviorally homogenous than were boys’ cliques. On average, leaders (especially if they were boys) were perceived as engaging in more problem behaviors than were nonleaders. In girls’ cliques, peripheral group members were more similar to their group leader on indirect aggression than were girls who were more central to the clique. Peer leaders perceived themselves as being more able to influence peers but did not differ from nonleaders in their perceived susceptibility to peer influence. The findings contribute to our understanding of processes through which influence may occur in adolescent peer groups. PMID:19763241
The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian
NASA Technical Reports Server (NTRS)
Guattery, Stephen; Leighton, Tom; Miller, Gary L.
1997-01-01
We introduce the path resistance method for lower bounds on the smallest nontrivial eigenvalue of the Laplacian matrix of a graph. The method is based on viewing the graph in terms of electrical circuits; it uses clique embeddings to produce lower bounds on lambda(sub 2) and star embeddings to produce lower bounds on the smallest Rayleigh quotient when there is a zero Dirichlet boundary condition. The method assigns priorities to the paths in the embedding; we show that, for an unweighted tree T, using uniform priorities for a clique embedding produces a lower bound on lambda(sub 2) that is off by at most an 0(log diameter(T)) factor. We show that the best bounds this method can produce for clique embeddings are the same as for a related method that uses clique embeddings and edge lengths to produce bounds.
A tool for filtering information in complex systems
NASA Astrophysics Data System (ADS)
Tumminello, M.; Aste, T.; Di Matteo, T.; Mantegna, R. N.
2005-07-01
We introduce a technique to filter out complex data sets by extracting a subgraph of representative links. Such a filtering can be tuned up to any desired level by controlling the genus of the resulting graph. We show that this technique is especially suitable for correlation-based graphs, giving filtered graphs that preserve the hierarchical organization of the minimum spanning tree but containing a larger amount of information in their internal structure. In particular in the case of planar filtered graphs (genus equal to 0), triangular loops and four-element cliques are formed. The application of this filtering procedure to 100 stocks in the U.S. equity markets shows that such loops and cliques have important and significant relationships with the market structure and properties. This paper was submitted directly (Track II) to the PNAS office.Abbreviations: MST, minimum spanning tree; PMFG, Planar Maximally Filtered Graph; r-clique, clique of r elements.
Cliques of Neurons Bound into Cavities Provide a Missing Link between Structure and Function.
Reimann, Michael W; Nolte, Max; Scolamiero, Martina; Turner, Katharine; Perin, Rodrigo; Chindemi, Giuseppe; Dłotko, Paweł; Levi, Ran; Hess, Kathryn; Markram, Henry
2017-01-01
The lack of a formal link between neural network structure and its emergent function has hampered our understanding of how the brain processes information. We have now come closer to describing such a link by taking the direction of synaptic transmission into account, constructing graphs of a network that reflect the direction of information flow, and analyzing these directed graphs using algebraic topology. Applying this approach to a local network of neurons in the neocortex revealed a remarkably intricate and previously unseen topology of synaptic connectivity. The synaptic network contains an abundance of cliques of neurons bound into cavities that guide the emergence of correlated activity. In response to stimuli, correlated activity binds synaptically connected neurons into functional cliques and cavities that evolve in a stereotypical sequence toward peak complexity. We propose that the brain processes stimuli by forming increasingly complex functional cliques and cavities.
Multiple Semantic Matching on Augmented N-partite Graph for Object Co-segmentation.
Wang, Chuan; Zhang, Hua; Yang, Liang; Cao, Xiaochun; Xiong, Hongkai
2017-09-08
Recent methods for object co-segmentation focus on discovering single co-occurring relation of candidate regions representing the foreground of multiple images. However, region extraction based only on low and middle level information often occupies a large area of background without the help of semantic context. In addition, seeking single matching solution very likely leads to discover local parts of common objects. To cope with these deficiencies, we present a new object cosegmentation framework, which takes advantages of semantic information and globally explores multiple co-occurring matching cliques based on an N-partite graph structure. To this end, we first propose to incorporate candidate generation with semantic context. Based on the regions extracted from semantic segmentation of each image, we design a merging mechanism to hierarchically generate candidates with high semantic responses. Secondly, all candidates are taken into consideration to globally formulate multiple maximum weighted matching cliques, which complements the discovery of part of the common objects induced by a single clique. To facilitate the discovery of multiple matching cliques, an N-partite graph, which inherently excludes intralinks between candidates from the same image, is constructed to separate multiple cliques without additional constraints. Further, we augment the graph with an additional virtual node in each part to handle irrelevant matches when the similarity between two candidates is too small. Finally, with the explored multiple cliques, we statistically compute pixel-wise co-occurrence map for each image. Experimental results on two benchmark datasets, i.e., iCoseg and MSRC datasets, achieve desirable performance and demonstrate the effectiveness of our proposed framework.
Ming, Dengming; Chen, Rui; Huang, He
2018-05-10
Optimizing amino-acid mutations in enzyme design has been a very challenging task in modern bio-industrial applications. It is well known that many successful designs often hinge on extensive correlations among mutations at different sites within the enzyme, however, the underpinning mechanism for these correlations is far from clear. Here, we present a topology-based model to quantitively characterize non-additive effects between mutations. The method is based on the molecular dynamic simulations and the amino-acid network clique analysis. It examines if the two mutation sites of a double-site mutation fall into to a 3-clique structure, and associates such topological property of mutational site spatial distribution with mutation additivity features. We analyzed 13 dual mutations of T4 phage lysozyme and found that the clique-based model successfully distinguishes highly correlated or non-additive double-site mutations from those additive ones whose component mutations have less correlation. We also applied the model to protein Eglin c whose structural topology is significantly different from that of T4 phage lysozyme, and found that the model can, to some extension, still identify non-additive mutations from additive ones. Our calculations showed that mutation non-additive effects may heavily depend on a structural topology relationship between mutation sites, which can be quantitatively determined using amino-acid network k -cliques. We also showed that double-site mutation correlations can be significantly altered by exerting a third mutation, indicating that more detailed physicochemical interactions should be considered along with the network clique-based model for better understanding of this elusive mutation-correlation principle.
cWINNOWER Algorithm for Finding Fuzzy DNA Motifs
NASA Technical Reports Server (NTRS)
Liang, Shoudan
2003-01-01
The cWINNOWER algorithm detects fuzzy motifs in DNA sequences rich in protein-binding signals. A signal is defined as any short nucleotide pattern having up to d mutations differing from a motif of length l. The algorithm finds such motifs if multiple mutated copies of the motif (i.e., the signals) are present in the DNA sequence in sufficient abundance. The cWINNOWER algorithm substantially improves the sensitivity of the winnower method of Pevzner and Sze by imposing a consensus constraint, enabling it to detect much weaker signals. We studied the minimum number of detectable motifs qc as a function of sequence length N for random sequences. We found that qc increases linearly with N for a fast version of the algorithm based on counting three-member sub-cliques. Imposing consensus constraints reduces qc, by a factor of three in this case, which makes the algorithm dramatically more sensitive. Our most sensitive algorithm, which counts four-member sub-cliques, needs a minimum of only 13 signals to detect motifs in a sequence of length N = 12000 for (l,d) = (15,4).
Cooperation, Competition, and the Structure of Student Cliques.
ERIC Educational Resources Information Center
Hansell, Stephen; And Others
Research indicates substantial evidence that, compared with competition, cooperation increases mutual friendliness and contact between individuals. The effects of cooperative and competitive experiences on the structure of student cliques in the classroom were examined. Seven classrooms of fourth-, fifth-, and sixth-grade students (N=117) were…
Influence of Adolescent Social Cliques on Vocational Identity.
ERIC Educational Resources Information Center
Johnson, John A.; Cheek, Jonathan M.
While Holland's (1973) theory of personality types and vocational identity is widely used, the theory does not specify the developmental antecedents of the six personality types. To examine the relationship between membership in adolescent social cliques and vocational identity in early adulthood, four groups of college students (N=192)…
Cooperation and Contagion in Web-Based, Networked Public Goods Experiments
Suri, Siddharth; Watts, Duncan J.
2011-01-01
A longstanding idea in the literature on human cooperation is that cooperation should be reinforced when conditional cooperators are more likely to interact. In the context of social networks, this idea implies that cooperation should fare better in highly clustered networks such as cliques than in networks with low clustering such as random networks. To test this hypothesis, we conducted a series of web-based experiments, in which 24 individuals played a local public goods game arranged on one of five network topologies that varied between disconnected cliques and a random regular graph. In contrast with previous theoretical work, we found that network topology had no significant effect on average contributions. This result implies either that individuals are not conditional cooperators, or else that cooperation does not benefit from positive reinforcement between connected neighbors. We then tested both of these possibilities in two subsequent series of experiments in which artificial seed players were introduced, making either full or zero contributions. First, we found that although players did generally behave like conditional cooperators, they were as likely to decrease their contributions in response to low contributing neighbors as they were to increase their contributions in response to high contributing neighbors. Second, we found that positive effects of cooperation were contagious only to direct neighbors in the network. In total we report on 113 human subjects experiments, highlighting the speed, flexibility, and cost-effectiveness of web-based experiments over those conducted in physical labs. PMID:21412431
Cooperation and contagion in web-based, networked public goods experiments.
Suri, Siddharth; Watts, Duncan J
2011-03-11
A longstanding idea in the literature on human cooperation is that cooperation should be reinforced when conditional cooperators are more likely to interact. In the context of social networks, this idea implies that cooperation should fare better in highly clustered networks such as cliques than in networks with low clustering such as random networks. To test this hypothesis, we conducted a series of web-based experiments, in which 24 individuals played a local public goods game arranged on one of five network topologies that varied between disconnected cliques and a random regular graph. In contrast with previous theoretical work, we found that network topology had no significant effect on average contributions. This result implies either that individuals are not conditional cooperators, or else that cooperation does not benefit from positive reinforcement between connected neighbors. We then tested both of these possibilities in two subsequent series of experiments in which artificial seed players were introduced, making either full or zero contributions. First, we found that although players did generally behave like conditional cooperators, they were as likely to decrease their contributions in response to low contributing neighbors as they were to increase their contributions in response to high contributing neighbors. Second, we found that positive effects of cooperation were contagious only to direct neighbors in the network. In total we report on 113 human subjects experiments, highlighting the speed, flexibility, and cost-effectiveness of web-based experiments over those conducted in physical labs.
The Evolution of Children's Friendship Cliques.
ERIC Educational Resources Information Center
Hallinan, Maureen T.
This paper investigates the formation and evolution of friendship cliques among preadolescent youth in elementary and junior high grades 4 through 8. Two sets of data were collected: the first set consisted of cross sectional data from 51 classes (grades 5 through 8); the second set contained sociometric data collected from 11 classes (grades 4…
Changing Neighborhood and Clique Structure in Two Missouri Communities, 1955-66.
ERIC Educational Resources Information Center
Lionberger, Herbert F.; Yeh, Chii-jeng
A study was conducted of two Missouri communities to investigate neighborhood change between 1956 and 1966 and social cliques as possible emerging replacements for neighborhoods. Ozark, in an economically disadvantaged southern part of the State, has experienced drastic farm changes, from general to dairy farming and later to enterprises more…
Project Trust: Breaking down Barriers between Middle School Children
ERIC Educational Resources Information Center
Batiuk, Mary Ellen; Boland, James A.; Wilcox, Norma
2004-01-01
This paper analyzes the success of a camp retreat weekend called Project Trust involving middle school students and teachers. The goal of the camp is to break down barriers between cliques identified as active in the school. The camp focuses on building team relationships across clique membership and incorporates elements of peace education and…
Sparse cliques trump scale-free networks in coordination and competition
Gianetto, David A.; Heydari, Babak
2016-01-01
Cooperative behavior, a natural, pervasive and yet puzzling phenomenon, can be significantly enhanced by networks. Many studies have shown how global network characteristics affect cooperation; however, it is difficult to understand how this occurs based on global factors alone, low-level network building blocks, or motifs are necessary. In this work, we systematically alter the structure of scale-free and clique networks and show, through a stochastic evolutionary game theory model, that cooperation on cliques increases linearly with community motif count. We further show that, for reactive stochastic strategies, network modularity improves cooperation in the anti-coordination Snowdrift game and the Prisoner’s Dilemma game but not in the Stag Hunt coordination game. We also confirm the negative effect of the scale-free graph on cooperation when effective payoffs are used. On the flip side, clique graphs are highly cooperative across social environments. Adding cycles to the acyclic scale-free graph increases cooperation when multiple games are considered; however, cycles have the opposite effect on how forgiving agents are when playing the Prisoner’s Dilemma game. PMID:26899456
Sparse cliques trump scale-free networks in coordination and competition
NASA Astrophysics Data System (ADS)
Gianetto, David A.; Heydari, Babak
2016-02-01
Cooperative behavior, a natural, pervasive and yet puzzling phenomenon, can be significantly enhanced by networks. Many studies have shown how global network characteristics affect cooperation; however, it is difficult to understand how this occurs based on global factors alone, low-level network building blocks, or motifs are necessary. In this work, we systematically alter the structure of scale-free and clique networks and show, through a stochastic evolutionary game theory model, that cooperation on cliques increases linearly with community motif count. We further show that, for reactive stochastic strategies, network modularity improves cooperation in the anti-coordination Snowdrift game and the Prisoner’s Dilemma game but not in the Stag Hunt coordination game. We also confirm the negative effect of the scale-free graph on cooperation when effective payoffs are used. On the flip side, clique graphs are highly cooperative across social environments. Adding cycles to the acyclic scale-free graph increases cooperation when multiple games are considered; however, cycles have the opposite effect on how forgiving agents are when playing the Prisoner’s Dilemma game.
Robust Dehaze Algorithm for Degraded Image of CMOS Image Sensors.
Qu, Chen; Bi, Du-Yan; Sui, Ping; Chao, Ai-Nong; Wang, Yun-Fei
2017-09-22
The CMOS (Complementary Metal-Oxide-Semiconductor) is a new type of solid image sensor device widely used in object tracking, object recognition, intelligent navigation fields, and so on. However, images captured by outdoor CMOS sensor devices are usually affected by suspended atmospheric particles (such as haze), causing a reduction in image contrast, color distortion problems, and so on. In view of this, we propose a novel dehazing approach based on a local consistent Markov random field (MRF) framework. The neighboring clique in traditional MRF is extended to the non-neighboring clique, which is defined on local consistent blocks based on two clues, where both the atmospheric light and transmission map satisfy the character of local consistency. In this framework, our model can strengthen the restriction of the whole image while incorporating more sophisticated statistical priors, resulting in more expressive power of modeling, thus, solving inadequate detail recovery effectively and alleviating color distortion. Moreover, the local consistent MRF framework can obtain details while maintaining better results for dehazing, which effectively improves the image quality captured by the CMOS image sensor. Experimental results verified that the method proposed has the combined advantages of detail recovery and color preservation.
Young Children's Cliques: A Study on Processes of Peer Acceptance and Cliques Aggregation
ERIC Educational Resources Information Center
Brighi, Antonella; Mazzanti, Chiara; Guarini, Annalisa; Sansavini, Alessandra
2015-01-01
A considerable amount of research has examined the link between children's peer acceptance, which refers to the degree of likability within the peer group, social functioning and emotional wellbeing, at a same age and in a long term perspective, pointing out to the contribution of peer acceptance for mental wellbeing. Our study proposes a…
ERIC Educational Resources Information Center
Brusco, Michael J.; Kohn, Hans-Friedrich
2009-01-01
The clique partitioning problem (CPP) requires the establishment of an equivalence relation for the vertices of a graph such that the sum of the edge costs associated with the relation is minimized. The CPP has important applications for the social sciences because it provides a framework for clustering objects measured on a collection of nominal…
ERIC Educational Resources Information Center
Pattee, Amy
2008-01-01
The Clique, a contemporary popular series for girls, has been criticized in the popular and professional media but includes thematic content similar to some of the more lauded mid-nineteenth-century domestic fiction for girls. By making a formal comparison of this popular series with domestic fiction for girls (much of which is now considered…
ERIC Educational Resources Information Center
Hazlett, Lisa A.
2009-01-01
Power and status are captivating, especially the desire for social status and its commensurate authority and security. Cliques, smaller clusters within larger peer groups sharing similar views, behaviors, and attitudes, are a means of attaining societal power. Because cliques are typically composed of the disenfranchised holding views different…
ERIC Educational Resources Information Center
Yan, Xiaoyan; And Others
1993-01-01
This study explains the methodology of clique analysis and presents a study in which the use of clique analysis demonstrated that an employee with severe disabilities was perceived by co-workers as socially involved in the work setting at levels comparable to others in such areas as greetings and small talk, work-related conversation, and personal…
Estimating landscape carrying capacity through maximum clique analysis
Donovan, Therese; Warrington, Greg; Schwenk, W. Scott; Dinitz, Jeffrey H.
2012-01-01
Habitat suitability (HS) maps are widely used tools in wildlife science and establish a link between wildlife populations and landscape pattern. Although HS maps spatially depict the distribution of optimal resources for a species, they do not reveal the population size a landscape is capable of supporting--information that is often crucial for decision makers and managers. We used a new approach, "maximum clique analysis," to demonstrate how HS maps for territorial species can be used to estimate the carrying capacity, N(k), of a given landscape. We estimated the N(k) of Ovenbirds (Seiurus aurocapillus) and bobcats (Lynx rufus) in an 1153-km2 study area in Vermont, USA. These two species were selected to highlight different approaches in building an HS map as well as computational challenges that can arise in a maximum clique analysis. We derived 30-m2 HS maps for each species via occupancy modeling (Ovenbird) and by resource utilization modeling (bobcats). For each species, we then identified all pixel locations on the map (points) that had sufficient resources in the surrounding area to maintain a home range (termed a "pseudo-home range"). These locations were converted to a mathematical graph, where any two points were linked if two pseudo-home ranges could exist on the landscape without violating territory boundaries. We used the program Cliquer to find the maximum clique of each graph. The resulting estimates of N(k) = 236 Ovenbirds and N(k) = 42 female bobcats were sensitive to different assumptions and model inputs. Estimates of N(k) via alternative, ad hoc methods were 1.4 to > 30 times greater than the maximum clique estimate, suggesting that the alternative results may be upwardly biased. The maximum clique analysis was computationally intensive but could handle problems with < 1500 total pseudo-home ranges (points). Given present computational constraints, it is best suited for species that occur in clustered distributions (where the problem can be broken into several, smaller problems), or for species with large home ranges relative to grid scale where resampling the points to a coarser resolution can reduce the problem to manageable proportions.
Clique-based data mining for related genes in a biomedical database.
Matsunaga, Tsutomu; Yonemori, Chikara; Tomita, Etsuji; Muramatsu, Masaaki
2009-07-01
Progress in the life sciences cannot be made without integrating biomedical knowledge on numerous genes in order to help formulate hypotheses on the genetic mechanisms behind various biological phenomena, including diseases. There is thus a strong need for a way to automatically and comprehensively search from biomedical databases for related genes, such as genes in the same families and genes encoding components of the same pathways. Here we address the extraction of related genes by searching for densely-connected subgraphs, which are modeled as cliques, in a biomedical relational graph. We constructed a graph whose nodes were gene or disease pages, and edges were the hyperlink connections between those pages in the Online Mendelian Inheritance in Man (OMIM) database. We obtained over 20,000 sets of related genes (called 'gene modules') by enumerating cliques computationally. The modules included genes in the same family, genes for proteins that form a complex, and genes for components of the same signaling pathway. The results of experiments using 'metabolic syndrome'-related gene modules show that the gene modules can be used to get a coherent holistic picture helpful for interpreting relations among genes. We presented a data mining approach extracting related genes by enumerating cliques. The extracted gene sets provide a holistic picture useful for comprehending complex disease mechanisms.
Generalized epidemic process on modular networks.
Chung, Kihong; Baek, Yongjoo; Kim, Daniel; Ha, Meesoon; Jeong, Hawoong
2014-05-01
Social reinforcement and modular structure are two salient features observed in the spreading of behavior through social contacts. In order to investigate the interplay between these two features, we study the generalized epidemic process on modular networks with equal-sized finite communities and adjustable modularity. Using the analytical approach originally applied to clique-based random networks, we show that the system exhibits a bond-percolation type continuous phase transition for weak social reinforcement, whereas a discontinuous phase transition occurs for sufficiently strong social reinforcement. Our findings are numerically verified using the finite-size scaling analysis and the crossings of the bimodality coefficient.
2011-01-01
Background Mapping protein primary sequences to their three dimensional folds referred to as the 'second genetic code' remains an unsolved scientific problem. A crucial part of the problem concerns the geometrical specificity in side chain association leading to densely packed protein cores, a hallmark of correctly folded native structures. Thus, any model of packing within proteins should constitute an indispensable component of protein folding and design. Results In this study an attempt has been made to find, characterize and classify recurring patterns in the packing of side chain atoms within a protein which sustains its native fold. The interaction of side chain atoms within the protein core has been represented as a contact network based on the surface complementarity and overlap between associating side chain surfaces. Some network topologies definitely appear to be preferred and they have been termed 'packing motifs', analogous to super secondary structures in proteins. Study of the distribution of these motifs reveals the ubiquitous presence of typical smaller graphs, which appear to get linked or coalesce to give larger graphs, reminiscent of the nucleation-condensation model in protein folding. One such frequently occurring motif, also envisaged as the unit of clustering, the three residue clique was invariably found in regions of dense packing. Finally, topological measures based on surface contact networks appeared to be effective in discriminating sequences native to a specific fold amongst a set of decoys. Conclusions Out of innumerable topological possibilities, only a finite number of specific packing motifs are actually realized in proteins. This small number of motifs could serve as a basis set in the construction of larger networks. Of these, the triplet clique exhibits distinct preference both in terms of composition and geometry. PMID:21605466
Replicator equations, maximal cliques, and graph isomorphism.
Pelillo, M
1999-11-15
We present a new energy-minimization framework for the graph isomorphism problem that is based on an equivalent maximum clique formulation. The approach is centered around a fundamental result proved by Motzkin and Straus in the mid-1960s, and recently expanded in various ways, which allows us to formulate the maximum clique problem in terms of a standard quadratic program. The attractive feature of this formulation is that a clear one-to-one correspondence exists between the solutions of the quadratic program and those in the original, combinatorial problem. To solve the program we use the so-called replicator equations--a class of straightforward continuous- and discrete-time dynamical systems developed in various branches of theoretical biology. We show how, despite their inherent inability to escape from local solutions, they nevertheless provide experimental results that are competitive with those obtained using more elaborate mean-field annealing heuristics.
Modeling the Webgraph: How Far We Are
NASA Astrophysics Data System (ADS)
Donato, Debora; Laura, Luigi; Leonardi, Stefano; Millozzi, Stefano
The following sections are included: * Introduction * Preliminaries * WebBase * In-degree and out-degree * PageRank * Bipartite cliques * Strongly connected components * Stochastic models of the webgraph * Models of the webgraph * A multi-layer model * Large scale simulation * Algorithmic techniques for generating and measuring webgraphs * Data representation and multifiles * Generating webgraphs * Traversal with two bits for each node * Semi-external breadth first search * Semi-external depth first search * Computation of the SCCs * Computation of the bow-tie regions * Disjoint bipartite cliques * PageRank * Summary and outlook
Diaconis, Persi; Holmes, Susan; Janson, Svante
2015-01-01
We work out a graph limit theory for dense interval graphs. The theory developed departs from the usual description of a graph limit as a symmetric function W (x, y) on the unit square, with x and y uniform on the interval (0, 1). Instead, we fix a W and change the underlying distribution of the coordinates x and y. We find choices such that our limits are continuous. Connections to random interval graphs are given, including some examples. We also show a continuity result for the chromatic number and clique number of interval graphs. Some results on uniqueness of the limit description are given for general graph limits. PMID:26405368
Rclick: a web server for comparison of RNA 3D structures.
Nguyen, Minh N; Verma, Chandra
2015-03-15
RNA molecules play important roles in key biological processes in the cell and are becoming attractive for developing therapeutic applications. Since the function of RNA depends on its structure and dynamics, comparing and classifying the RNA 3D structures is of crucial importance to molecular biology. In this study, we have developed Rclick, a web server that is capable of superimposing RNA 3D structures by using clique matching and 3D least-squares fitting. Our server Rclick has been benchmarked and compared with other popular servers and methods for RNA structural alignments. In most cases, Rclick alignments were better in terms of structure overlap. Our server also recognizes conformational changes between structures. For this purpose, the server produces complementary alignments to maximize the extent of detectable similarity. Various examples showcase the utility of our web server for comparison of RNA, RNA-protein complexes and RNA-ligand structures. © The Author 2014. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com.
An Economical Analytical Equation for the Integrated Vertical Overlap of Cumulus and Stratus
NASA Astrophysics Data System (ADS)
Park, Sungsu
2018-03-01
By extending the previously proposed heuristic parameterization, the author derived an analytical equation computing the overlap areas between the precipitation (or radiation) areas and the cloud areas in a cloud system consisting of cumulus and stratus. The new analytical equation is accurate and much more efficient than the previous heuristic equation, which suffers from the truncation error in association with the digitalization of the overlap areas. Global test simulations with the new analytical formula in an offline mode showed that the maximum cumulus overlap simulates more surface precipitation flux than the random cumulus overlap. On the other hand, the maximum stratus overlap simulates less surface precipitation flux than random stratus overlap, which is due to the increase in the evaporation rate of convective precipitation from the random to maximum stratus overlap. The independent precipitation approximation (IPA) marginally decreases the surface precipitation flux, implying that IPA works well with other parameterizations. In contrast to the net production rate of precipitation and surface precipitation flux that increase when the cumulus and stratus are maximally and randomly overlapped, respectively, the global mean net radiative cooling and longwave cloud radiative forcing (LWCF) increase when the cumulus and stratus are randomly overlapped. On the global average, the vertical cloud overlap exerts larger impacts on the precipitation flux than on the radiation flux. The radiation scheme taking the subgrid variability of water vapor between the cloud and clear portions into account substantially increases the global mean LWCF in tropical deep convection and midlatitude storm track regions.
Brain Computation Is Organized via Power-of-Two-Based Permutation Logic
Xie, Kun; Fox, Grace E.; Liu, Jun; Lyu, Cheng; Lee, Jason C.; Kuang, Hui; Jacobs, Stephanie; Li, Meng; Liu, Tianming; Song, Sen; Tsien, Joe Z.
2016-01-01
There is considerable scientific interest in understanding how cell assemblies—the long-presumed computational motif—are organized so that the brain can generate intelligent cognition and flexible behavior. The Theory of Connectivity proposes that the origin of intelligence is rooted in a power-of-two-based permutation logic (N = 2i–1), producing specific-to-general cell-assembly architecture capable of generating specific perceptions and memories, as well as generalized knowledge and flexible actions. We show that this power-of-two-based permutation logic is widely used in cortical and subcortical circuits across animal species and is conserved for the processing of a variety of cognitive modalities including appetitive, emotional and social information. However, modulatory neurons, such as dopaminergic (DA) neurons, use a simpler logic despite their distinct subtypes. Interestingly, this specific-to-general permutation logic remained largely intact although NMDA receptors—the synaptic switch for learning and memory—were deleted throughout adulthood, suggesting that the logic is developmentally pre-configured. Moreover, this computational logic is implemented in the cortex via combining a random-connectivity strategy in superficial layers 2/3 with nonrandom organizations in deep layers 5/6. This randomness of layers 2/3 cliques—which preferentially encode specific and low-combinatorial features and project inter-cortically—is ideal for maximizing cross-modality novel pattern-extraction, pattern-discrimination and pattern-categorization using sparse code, consequently explaining why it requires hippocampal offline-consolidation. In contrast, the nonrandomness in layers 5/6—which consists of few specific cliques but a higher portion of more general cliques projecting mostly to subcortical systems—is ideal for feedback-control of motivation, emotion, consciousness and behaviors. These observations suggest that the brain’s basic computational algorithm is indeed organized by the power-of-two-based permutation logic. This simple mathematical logic can account for brain computation across the entire evolutionary spectrum, ranging from the simplest neural networks to the most complex. PMID:27895562
Ozierański, Piotr; King, Lawrence
2016-06-01
This article explores a key question in political sociology: Can post-communist policy-making be described with classical theories of the Western state or do we need a theory of the specificity of the post-communist state? In so doing, we consider Janine Wedel's clique theory, concerned with informal social actors and processes in post-communist transition. We conducted a case study of drug reimbursement policy in Poland, using 109 stakeholder interviews, official documents and media coverage. Drawing on 'sensitizing concepts' from Wedel's theory, especially the notion of 'deniability', we developed an explanation of why Poland's reimbursement policy combined suboptimal outcomes, procedural irregularities with limited accountability of key stakeholders. We argue that deniability was created through four main mechanisms: (1) blurred boundaries between different types of state authority allowing for the dispersion of blame for controversial policy decisions; (2) bridging different sectors by 'institutional nomads', who often escaped existing conflicts of interest regulations; (3) institutional nomads' 'flexible' methods of influence premised on managing roles and representations; and (4) coordination of resources and influence by elite cliques monopolizing exclusive policy expertise. Overall, the greatest power over drug reimbursement was often associated with lowest accountability. We suggest, therefore, that the clique theory can be generalized from its home domain of explanation in foreign aid and privatizations to more technologically advanced policies in Poland and other post-communist countries. This conclusion is not identical, however, with arguing the uniqueness of the post-communist state. Rather, we show potential for using Wedel's account to analyse policy-making in Western democracies and indicate scope for its possible integration with the classical theories of the state. © London School of Economics and Political Science 2016.
Computational social network modeling of terrorist recruitment.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Berry, Nina M.; Turnley, Jessica Glicken; Smrcka, Julianne D.
2004-10-01
The Seldon terrorist model represents a multi-disciplinary approach to developing organization software for the study of terrorist recruitment and group formation. The need to incorporate aspects of social science added a significant contribution to the vision of the resulting Seldon toolkit. The unique addition of and abstract agent category provided a means for capturing social concepts like cliques, mosque, etc. in a manner that represents their social conceptualization and not simply as a physical or economical institution. This paper provides an overview of the Seldon terrorist model developed to study the formation of cliques, which are used as the majormore » recruitment entity for terrorist organizations.« less
Extracting Communities from Complex Networks by the k-Dense Method
NASA Astrophysics Data System (ADS)
Saito, Kazumi; Yamada, Takeshi; Kazama, Kazuhiro
To understand the structural and functional properties of large-scale complex networks, it is crucial to efficiently extract a set of cohesive subnetworks as communities. There have been proposed several such community extraction methods in the literature, including the classical k-core decomposition method and, more recently, the k-clique based community extraction method. The k-core method, although computationally efficient, is often not powerful enough for uncovering a detailed community structure and it produces only coarse-grained and loosely connected communities. The k-clique method, on the other hand, can extract fine-grained and tightly connected communities but requires a substantial amount of computational load for large-scale complex networks. In this paper, we present a new notion of a subnetwork called k-dense, and propose an efficient algorithm for extracting k-dense communities. We applied our method to the three different types of networks assembled from real data, namely, from blog trackbacks, word associations and Wikipedia references, and demonstrated that the k-dense method could extract communities almost as efficiently as the k-core method, while the qualities of the extracted communities are comparable to those obtained by the k-clique method.
Competition in a Social Structure
NASA Astrophysics Data System (ADS)
Legara, Erika Fille; Longjas, Anthony; Batac, Rene
Complex adaptive agents develop strategies in the presence of competition. In modern human societies, there is an inherent sense of locality when describing inter-agent dynamics because of its network structure. One then wonders whether the traditional advertising schemes that are globally publicized and target random individuals are as effective in attracting a larger portion of the population as those that take advantage of local neighborhoods, such as "word-of-mouth" marketing schemes. Here, we demonstrate using a differential equation model that schemes targeting local cliques within the network are more successful at gaining a larger share of the population than those that target users randomly at a global scale (e.g., television commercials, print ads, etc.). This suggests that success in the competition is dependent not only on the number of individuals in the population but also on how they are connected in the network. We further show that the model is general in nature by considering examples of competition dynamics, particularly those of business competition and language death.
Community Detection in Complex Networks via Clique Conductance.
Lu, Zhenqi; Wahlström, Johan; Nehorai, Arye
2018-04-13
Network science plays a central role in understanding and modeling complex systems in many areas including physics, sociology, biology, computer science, economics, politics, and neuroscience. One of the most important features of networks is community structure, i.e., clustering of nodes that are locally densely interconnected. Communities reveal the hierarchical organization of nodes, and detecting communities is of great importance in the study of complex systems. Most existing community-detection methods consider low-order connection patterns at the level of individual links. But high-order connection patterns, at the level of small subnetworks, are generally not considered. In this paper, we develop a novel community-detection method based on cliques, i.e., local complete subnetworks. The proposed method overcomes the deficiencies of previous similar community-detection methods by considering the mathematical properties of cliques. We apply the proposed method to computer-generated graphs and real-world network datasets. When applied to networks with known community structure, the proposed method detects the structure with high fidelity and sensitivity. When applied to networks with no a priori information regarding community structure, the proposed method yields insightful results revealing the organization of these complex networks. We also show that the proposed method is guaranteed to detect near-optimal clusters in the bipartition case.
Guturu, Parthasarathy; Dantu, Ram
2008-06-01
Many graph- and set-theoretic problems, because of their tremendous application potential and theoretical appeal, have been well investigated by the researchers in complexity theory and were found to be NP-hard. Since the combinatorial complexity of these problems does not permit exhaustive searches for optimal solutions, only near-optimal solutions can be explored using either various problem-specific heuristic strategies or metaheuristic global-optimization methods, such as simulated annealing, genetic algorithms, etc. In this paper, we propose a unified evolutionary algorithm (EA) to the problems of maximum clique finding, maximum independent set, minimum vertex cover, subgraph and double subgraph isomorphism, set packing, set partitioning, and set cover. In the proposed approach, we first map these problems onto the maximum clique-finding problem (MCP), which is later solved using an evolutionary strategy. The proposed impatient EA with probabilistic tabu search (IEA-PTS) for the MCP integrates the best features of earlier successful approaches with a number of new heuristics that we developed to yield a performance that advances the state of the art in EAs for the exploration of the maximum cliques in a graph. Results of experimentation with the 37 DIMACS benchmark graphs and comparative analyses with six state-of-the-art algorithms, including two from the smaller EA community and four from the larger metaheuristics community, indicate that the IEA-PTS outperforms the EAs with respect to a Pareto-lexicographic ranking criterion and offers competitive performance on some graph instances when individually compared to the other heuristic algorithms. It has also successfully set a new benchmark on one graph instance. On another benchmark suite called Benchmarks with Hidden Optimal Solutions, IEA-PTS ranks second, after a very recent algorithm called COVER, among its peers that have experimented with this suite.
Modeling of chromosome intermingling by partially overlapping uniform random polygons.
Blackstone, T; Scharein, R; Borgo, B; Varela, R; Diao, Y; Arsuaga, J
2011-03-01
During the early phase of the cell cycle the eukaryotic genome is organized into chromosome territories. The geometry of the interface between any two chromosomes remains a matter of debate and may have important functional consequences. The Interchromosomal Network model (introduced by Branco and Pombo) proposes that territories intermingle along their periphery. In order to partially quantify this concept we here investigate the probability that two chromosomes form an unsplittable link. We use the uniform random polygon as a crude model for chromosome territories and we model the interchromosomal network as the common spatial region of two overlapping uniform random polygons. This simple model allows us to derive some rigorous mathematical results as well as to perform computer simulations easily. We find that the probability that one uniform random polygon of length n that partially overlaps a fixed polygon is bounded below by 1 − O(1/√n). We use numerical simulations to estimate the dependence of the linking probability of two uniform random polygons (of lengths n and m, respectively) on the amount of overlapping. The degree of overlapping is parametrized by a parameter [Formula: see text] such that [Formula: see text] indicates no overlapping and [Formula: see text] indicates total overlapping. We propose that this dependence relation may be modeled as f (ε, m, n) = [Formula: see text]. Numerical evidence shows that this model works well when [Formula: see text] is relatively large (ε ≥ 0.5). We then use these results to model the data published by Branco and Pombo and observe that for the amount of overlapping observed experimentally the URPs have a non-zero probability of forming an unsplittable link.
A Heuristic Parameterization for the Integrated Vertical Overlap of Cumulus and Stratus
NASA Astrophysics Data System (ADS)
Park, Sungsu
2017-10-01
The author developed a heuristic parameterization to handle the contrasting vertical overlap structures of cumulus and stratus in an integrated way. The parameterization assumes that cumulus is maximum-randomly overlapped with adjacent cumulus; stratus is maximum-randomly overlapped with adjacent stratus; and radiation and precipitation areas at each model interface are grouped into four categories, that is, convective, stratiform, mixed, and clear areas. For simplicity, thermodynamic scalars within individual portions of cloud, radiation, and precipitation areas are assumed to be internally homogeneous. The parameterization was implemented into the Seoul National University Atmosphere Model version 0 (SAM0) in an offline mode and tested over the globe. The offline control simulation reasonably reproduces the online surface precipitation flux and longwave cloud radiative forcing (LWCF). Although the cumulus fraction is much smaller than the stratus fraction, cumulus dominantly contributes to precipitation production in the tropics. For radiation, however, stratus is dominant. Compared with the maximum overlap, the random overlap of stratus produces stronger LWCF and, surprisingly, more precipitation flux due to less evaporation of convective precipitation. Compared with the maximum overlap, the random overlap of cumulus simulates stronger LWCF and weaker precipitation flux. Compared with the control simulation with separate cumulus and stratus, the simulation with a single-merged cloud substantially enhances the LWCF in the tropical deep convection and midlatitude storm track regions. The process-splitting treatment of convective and stratiform precipitation with an independent precipitation approximation (IPA) simulates weaker surface precipitation flux than the control simulation in the tropical region.
A tool for filtering information in complex systems
Tumminello, M.; Aste, T.; Di Matteo, T.; Mantegna, R. N.
2005-01-01
We introduce a technique to filter out complex data sets by extracting a subgraph of representative links. Such a filtering can be tuned up to any desired level by controlling the genus of the resulting graph. We show that this technique is especially suitable for correlation-based graphs, giving filtered graphs that preserve the hierarchical organization of the minimum spanning tree but containing a larger amount of information in their internal structure. In particular in the case of planar filtered graphs (genus equal to 0), triangular loops and four-element cliques are formed. The application of this filtering procedure to 100 stocks in the U.S. equity markets shows that such loops and cliques have important and significant relationships with the market structure and properties. PMID:16027373
A tool for filtering information in complex systems.
Tumminello, M; Aste, T; Di Matteo, T; Mantegna, R N
2005-07-26
We introduce a technique to filter out complex data sets by extracting a subgraph of representative links. Such a filtering can be tuned up to any desired level by controlling the genus of the resulting graph. We show that this technique is especially suitable for correlation-based graphs, giving filtered graphs that preserve the hierarchical organization of the minimum spanning tree but containing a larger amount of information in their internal structure. In particular in the case of planar filtered graphs (genus equal to 0), triangular loops and four-element cliques are formed. The application of this filtering procedure to 100 stocks in the U.S. equity markets shows that such loops and cliques have important and significant relationships with the market structure and properties.
Kinreich, Sivan; Intrator, Nathan; Hendler, Talma
2011-01-01
One of the greatest challenges involved in studying the brain mechanisms of fear is capturing the individual's unique instantaneous experience. Brain imaging studies to date commonly sacrifice valuable information regarding the individual real-time conscious experience, especially when focusing on elucidating the amygdala's activity. Here, we assumed that by using a minimally intrusive cue along with applying a robust clustering approach to probe the amygdala, it would be possible to rate fear in real time and to derive the related network of activation. During functional magnetic resonance imaging scanning, healthy volunteers viewed two excerpts from horror movies and were periodically auditory cued to rate their instantaneous experience of "I'm scared." Using graph theory and community mathematical concepts, data-driven clustering of the fear-related functional cliques in the amygdala was performed guided by the individually marked periods of heightened fear. Individually tailored functions derived from these amygdala activation cliques were subsequently applied as general linear model predictors to a whole-brain analysis to reveal the correlated networks. Our results suggest that by using a localized robust clustering approach, it is possible to probe activation in the right dorsal amygdala that is directly related to individual real-time emotional experience. Moreover, this fear-evoked amygdala revealed two opposing networks of co-activation and co-deactivation, which correspond to vigilance and rest-related circuits, respectively.
... about them. They're afraid they'll face bullying, harassment, discrimination, or even violence. Their families don' ... Use Anti-Gay Language? Sexual Harassment and Sexual Bullying Dealing With Bullying Coping With Cliques Transgender People ...
Bipartite entangled stabilizer mutually unbiased bases as maximum cliques of Cayley graphs
DOE Office of Scientific and Technical Information (OSTI.GOV)
Dam, Wim van; Howard, Mark; Department of Physics, University of California, Santa Barbara, California 93106
2011-07-15
We examine the existence and structure of particular sets of mutually unbiased bases (MUBs) in bipartite qudit systems. In contrast to well-known power-of-prime MUB constructions, we restrict ourselves to using maximally entangled stabilizer states as MUB vectors. Consequently, these bipartite entangled stabilizer MUBs (BES MUBs) provide no local information, but are sufficient and minimal for decomposing a wide variety of interesting operators including (mixtures of) Jamiolkowski states, entanglement witnesses, and more. The problem of finding such BES MUBs can be mapped, in a natural way, to that of finding maximum cliques in a family of Cayley graphs. Some relationships withmore » known power-of-prime MUB constructions are discussed, and observables for BES MUBs are given explicitly in terms of Pauli operators.« less
Bipartite entangled stabilizer mutually unbiased bases as maximum cliques of Cayley graphs
NASA Astrophysics Data System (ADS)
van Dam, Wim; Howard, Mark
2011-07-01
We examine the existence and structure of particular sets of mutually unbiased bases (MUBs) in bipartite qudit systems. In contrast to well-known power-of-prime MUB constructions, we restrict ourselves to using maximally entangled stabilizer states as MUB vectors. Consequently, these bipartite entangled stabilizer MUBs (BES MUBs) provide no local information, but are sufficient and minimal for decomposing a wide variety of interesting operators including (mixtures of) Jamiołkowski states, entanglement witnesses, and more. The problem of finding such BES MUBs can be mapped, in a natural way, to that of finding maximum cliques in a family of Cayley graphs. Some relationships with known power-of-prime MUB constructions are discussed, and observables for BES MUBs are given explicitly in terms of Pauli operators.
A heuristic for efficient data distribution management in distributed simulation
NASA Astrophysics Data System (ADS)
Gupta, Pankaj; Guha, Ratan K.
2005-05-01
In this paper, we propose an algorithm for reducing the complexity of region matching and efficient multicasting in data distribution management component of High Level Architecture (HLA) Run Time Infrastructure (RTI). The current data distribution management (DDM) techniques rely on computing the intersection between the subscription and update regions. When a subscription region and an update region of different federates overlap, RTI establishes communication between the publisher and the subscriber. It subsequently routes the updates from the publisher to the subscriber. The proposed algorithm computes the update/subscription regions matching for dynamic allocation of multicast group. It provides new multicast routines that exploit the connectivity of federation by communicating updates regarding interactions and routes information only to those federates that require them. The region-matching problem in DDM reduces to clique-covering problem using the connections graph abstraction where the federations represent the vertices and the update/subscribe relations represent the edges. We develop an abstract model based on connection graph for data distribution management. Using this abstract model, we propose a heuristic for solving the region-matching problem of DDM. We also provide complexity analysis of the proposed heuristics.
Overlapping meta-analyses on the same topic: survey of published studies.
Siontis, Konstantinos C; Hernandez-Boussard, Tina; Ioannidis, John P A
2013-07-19
To assess how common it is to have multiple overlapping meta-analyses of randomized trials published on the same topic. Survey of published meta-analyses. PubMed. Meta-analyses published in 2010 were identified, and 5% of them were randomly selected. We further selected those that included randomized trials and examined effectiveness of any medical intervention. For eligible meta-analyses, we searched for other meta-analyses on the same topic (covering the same comparisons, indications/settings, and outcomes or overlapping subsets of them) published until February 2013. Of 73 eligible meta-analyses published in 2010, 49 (67%) had at least one other overlapping meta-analysis (median two meta-analyses per topic, interquartile range 1-4, maximum 13). In 17 topics at least one author was involved in at least two of the overlapping meta-analyses. No characteristics of the index meta-analyses were associated with the potential for overlapping meta-analyses. Among pairs of overlapping meta-analyses in 20 randomly selected topics, 13 of the more recent meta-analyses did not include any additional outcomes. In three of the four topics with eight or more published meta-analyses, many meta-analyses examined only a subset of the eligible interventions or indications/settings covered by the index meta-analysis. Conversely, for statins in the prevention of atrial fibrillation after cardiac surgery, 11 meta-analyses were published with similar eligibility criteria for interventions and setting: there was still variability on which studies were included, but the results were always similar or even identical across meta-analyses. While some independent replication of meta-analyses by different teams is possibly useful, the overall picture suggests that there is a waste of efforts with many topics covered by multiple overlapping meta-analyses.
Specific surface area of overlapping spheres in the presence of obstructions
NASA Astrophysics Data System (ADS)
Jenkins, D. R.
2013-02-01
This study considers the random placement of uniform sized spheres, which may overlap, in the presence of another set of randomly placed (hard) spheres, which do not overlap. The overlapping spheres do not intersect the hard spheres. It is shown that the specific surface area of the collection of overlapping spheres is affected by the hard spheres, such that there is a minimum in the specific surface area as a function of the relative size of the two sets of spheres. The occurrence of the minimum is explained in terms of the break-up of pore connectivity. The configuration can be considered to be a simple model of the structure of a porous composite material. In particular, the overlapping particles represent voids while the hard particles represent fillers. Example materials are pervious concrete, metallurgical coke, ice cream, and polymer composites. We also show how the material properties of such composites are affected by the void structure.
Specific surface area of overlapping spheres in the presence of obstructions.
Jenkins, D R
2013-02-21
This study considers the random placement of uniform sized spheres, which may overlap, in the presence of another set of randomly placed (hard) spheres, which do not overlap. The overlapping spheres do not intersect the hard spheres. It is shown that the specific surface area of the collection of overlapping spheres is affected by the hard spheres, such that there is a minimum in the specific surface area as a function of the relative size of the two sets of spheres. The occurrence of the minimum is explained in terms of the break-up of pore connectivity. The configuration can be considered to be a simple model of the structure of a porous composite material. In particular, the overlapping particles represent voids while the hard particles represent fillers. Example materials are pervious concrete, metallurgical coke, ice cream, and polymer composites. We also show how the material properties of such composites are affected by the void structure.
Jiang, Xiaoye; Yao, Yuan; Liu, Han; Guibas, Leonidas
2014-01-01
Modern data acquisition routinely produces massive amounts of network data. Though many methods and models have been proposed to analyze such data, the research of network data is largely disconnected with the classical theory of statistical learning and signal processing. In this paper, we present a new framework for modeling network data, which connects two seemingly different areas: network data analysis and compressed sensing. From a nonparametric perspective, we model an observed network using a large dictionary. In particular, we consider the network clique detection problem and show connections between our formulation with a new algebraic tool, namely Randon basis pursuit in homogeneous spaces. Such a connection allows us to identify rigorous recovery conditions for clique detection problems. Though this paper is mainly conceptual, we also develop practical approximation algorithms for solving empirical problems and demonstrate their usefulness on real-world datasets. PMID:25620806
On the genealogy of branching random walks and of directed polymers
NASA Astrophysics Data System (ADS)
Derrida, Bernard; Mottishaw, Peter
2016-08-01
It is well known that the mean-field theory of directed polymers in a random medium exhibits replica symmetry breaking with a distribution of overlaps which consists of two delta functions. Here we show that the leading finite-size correction to this distribution of overlaps has a universal character which can be computed explicitly. Our results can also be interpreted as genealogical properties of branching Brownian motion or of branching random walks.
Alternative steady states in ecological networks
NASA Astrophysics Data System (ADS)
Fried, Yael; Shnerb, Nadav M.; Kessler, David A.
2017-07-01
In many natural situations, one observes a local system with many competing species that is coupled by weak immigration to a regional species pool. The dynamics of such a system is dominated by its stable and uninvadable (SU) states. When the competition matrix is random, the number of SUs depends on the average value and variance of its entries. Here we consider the problem in the limit of weak competition and large variance. Using a yes-no interaction model, we show that the number of SUs corresponds to the number of maximum cliques in an Erdös-Rényi network. The number of SUs grows exponentially with the number of species in this limit, unless the network is completely asymmetric. In the asymmetric limit, the number of SUs is O (1 ) . Numerical simulations suggest that these results are valid for models with a continuous distribution of competition terms.
Correlation filtering in financial time series (Invited Paper)
NASA Astrophysics Data System (ADS)
Aste, T.; Di Matteo, Tiziana; Tumminello, M.; Mantegna, R. N.
2005-05-01
We apply a method to filter relevant information from the correlation coefficient matrix by extracting a network of relevant interactions. This method succeeds to generate networks with the same hierarchical structure of the Minimum Spanning Tree but containing a larger amount of links resulting in a richer network topology allowing loops and cliques. In Tumminello et al.,1 we have shown that this method, applied to a financial portfolio of 100 stocks in the USA equity markets, is pretty efficient in filtering relevant information about the clustering of the system and its hierarchical structure both on the whole system and within each cluster. In particular, we have found that triangular loops and 4 element cliques have important and significant relations with the market structure and properties. Here we apply this filtering procedure to the analysis of correlation in two different kind of interest rate time series (16 Eurodollars and 34 US interest rates).
NASA Astrophysics Data System (ADS)
Bass, Gideon; Tomlin, Casey; Kumar, Vaibhaw; Rihaczek, Pete; Dulny, Joseph, III
2018-04-01
NP-hard optimization problems scale very rapidly with problem size, becoming unsolvable with brute force methods, even with supercomputing resources. Typically, such problems have been approximated with heuristics. However, these methods still take a long time and are not guaranteed to find an optimal solution. Quantum computing offers the possibility of producing significant speed-up and improved solution quality. Current quantum annealing (QA) devices are designed to solve difficult optimization problems, but they are limited by hardware size and qubit connectivity restrictions. We present a novel heterogeneous computing stack that combines QA and classical machine learning, allowing the use of QA on problems larger than the hardware limits of the quantum device. These results represent experiments on a real-world problem represented by the weighted k-clique problem. Through this experiment, we provide insight into the state of quantum machine learning.
MSClique: Multiple Structure Discovery through the Maximum Weighted Clique Problem.
Sanroma, Gerard; Penate-Sanchez, Adrian; Alquézar, René; Serratosa, Francesc; Moreno-Noguer, Francesc; Andrade-Cetto, Juan; González Ballester, Miguel Ángel
2016-01-01
We present a novel approach for feature correspondence and multiple structure discovery in computer vision. In contrast to existing methods, we exploit the fact that point-sets on the same structure usually lie close to each other, thus forming clusters in the image. Given a pair of input images, we initially extract points of interest and extract hierarchical representations by agglomerative clustering. We use the maximum weighted clique problem to find the set of corresponding clusters with maximum number of inliers representing the multiple structures at the correct scales. Our method is parameter-free and only needs two sets of points along with their tentative correspondences, thus being extremely easy to use. We demonstrate the effectiveness of our method in multiple-structure fitting experiments in both publicly available and in-house datasets. As shown in the experiments, our approach finds a higher number of structures containing fewer outliers compared to state-of-the-art methods.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Hamilton, Kathleen E.; Humble, Travis S.
Using quantum annealing to solve an optimization problem requires minor embedding a logic graph into a known hardware graph. We introduce the minor set cover (MSC) of a known graph GG : a subset of graph minors which contain any remaining minor of the graph as a subgraph, in an effort to reduce the complexity of the minor embedding problem. Any graph that can be embedded into GG will be embeddable into a member of the MSC. Focusing on embedding into the hardware graph of commercially available quantum annealers, we establish the MSC for a particular known virtual hardware, whichmore » is a complete bipartite graph. Furthermore, we show that the complete bipartite graph K N,N has a MSC of N minors, from which K N+1 is identified as the largest clique minor of K N,N. In the case of determining the largest clique minor of hardware with faults we briefly discussed this open question.« less
Visual attention: low-level and high-level viewpoints
NASA Astrophysics Data System (ADS)
Stentiford, Fred W. M.
2012-06-01
This paper provides a brief outline of the approaches to modeling human visual attention. Bottom-up and top-down mechanisms are described together with some of the problems that they face. It has been suggested in brain science that memory functions by trading measurement precision for associative power; sensory inputs from the environment are never identical on separate occasions, but the associations with memory compensate for the differences. A graphical representation for image similarity is described that relies on the size of maximally associative structures (cliques) that are found to reflect between pairs of images. This is applied to the recognition of movie posters, the location and recognition of characters, and the recognition of faces. The similarity mechanism is shown to model popout effects when constraints are placed on the physical separation of pixels that correspond to nodes in the maximal cliques. The effect extends to modeling human visual behaviour on the Poggendorff illusion.
An Amino Acid Code for β-sheet Packing Structure
Joo, Hyun; Tsai, Jerry
2014-01-01
To understand the relationship between protein sequence and structure, this work extends the knob-socket model in an investigation of β-sheet packing. Over a comprehensive set of β-sheet folds, the contacts between residues were used to identify packing cliques: sets of residues that all contact each other. These packing cliques were then classified based on size and contact order. From this analysis, the 2 types of 4 residue packing cliques necessary to describe β-sheet packing were characterized. Both occur between 2 adjacent hydrogen bonded β-strands. First, defining the secondary structure packing within β-sheets, the combined socket or XY:HG pocket consists of 4 residues i,i+2 on one strand and j,j+2 on the other. Second, characterizing the tertiary packing between β-sheets, the knob-socket XY:H+B consists of a 3 residue XY:H socket (i,i+2 on one strand and j on the other) packed against a knob B residue (residue k distant in sequence). Depending on the packing depth of the knob B residue, 2 types of knob-sockets are found: side-chain and main-chain sockets. The amino acid composition of the pockets and knob-sockets reveal the sequence specificity of β-sheet packing. For β-sheet formation, the XY:HG pocket clearly shows sequence specificity of amino acids. For tertiary packing, the XY:H+B side-chain and main-chain sockets exhibit distinct amino acid preferences at each position. These relationships define an amino acid code for β-sheet structure and provide an intuitive topological mapping of β-sheet packing. PMID:24668690
A graph theoretic approach to scene matching
NASA Technical Reports Server (NTRS)
Ranganath, Heggere S.; Chipman, Laure J.
1991-01-01
The ability to match two scenes is a fundamental requirement in a variety of computer vision tasks. A graph theoretic approach to inexact scene matching is presented which is useful in dealing with problems due to imperfect image segmentation. A scene is described by a set of graphs, with nodes representing objects and arcs representing relationships between objects. Each node has a set of values representing the relations between pairs of objects, such as angle, adjacency, or distance. With this method of scene representation, the task in scene matching is to match two sets of graphs. Because of segmentation errors, variations in camera angle, illumination, and other conditions, an exact match between the sets of observed and stored graphs is usually not possible. In the developed approach, the problem is represented as an association graph, in which each node represents a possible mapping of an observed region to a stored object, and each arc represents the compatibility of two mappings. Nodes and arcs have weights indicating the merit or a region-object mapping and the degree of compatibility between two mappings. A match between the two graphs corresponds to a clique, or fully connected subgraph, in the association graph. The task is to find the clique that represents the best match. Fuzzy relaxation is used to update the node weights using the contextual information contained in the arcs and neighboring nodes. This simplifies the evaluation of cliques. A method of handling oversegmentation and undersegmentation problems is also presented. The approach is tested with a set of realistic images which exhibit many types of sementation errors.
Overlap Properties of Clouds Generated by a Cloud Resolving Model
NASA Technical Reports Server (NTRS)
Oreopoulos, L.; Khairoutdinov, M.
2002-01-01
In order for General Circulation Models (GCMs), one of our most important tools to predict future climate, to correctly describe the propagation of solar and thermal radiation through the cloudy atmosphere a realistic description of the vertical distribution of cloud amount is needed. Actually, one needs not only the cloud amounts at different levels of the atmosphere, but also how these cloud amounts are related, in other words, how they overlap. Currently GCMs make some idealized assumptions about cloud overlap, for example that contiguous cloud layers overlap maximally and non-contiguous cloud layers overlap in a random fashion. Since there are difficulties in obtaining the vertical profile of cloud amount from observations, the realism of the overlap assumptions made in GCMs has not been yet rigorously investigated. Recently however, cloud observations from a relatively new type of ground radar have been used to examine the vertical distribution of cloudiness. These observations suggest that the GCM overlap assumptions are dubious. Our study uses cloud fields from sophisticated models dedicated to simulate cloud formation, maintenance, and dissipation called Cloud Resolving Models . These models are generally considered capable of producing realistic three-dimensional representation of cloudiness. Using numerous cloud fields produced by such a CRM we show that the degree of overlap between cloud layers is a function of their separation distance, and is in general described by a combination of the maximum and random overlap assumption, with random overlap dominating as separation distances increase. We show that it is possible to parameterize this behavior in a way that can eventually be incorporated in GCMs. Our results seem to have a significant resemblance to the results from the radar observations despite the completely different nature of the datasets. This consistency is encouraging and will promote development of new radiative transfer codes that will estimate the radiation effects of multi-layer cloud fields more accurately.
Corrected Mean-Field Model for Random Sequential Adsorption on Random Geometric Graphs
NASA Astrophysics Data System (ADS)
Dhara, Souvik; van Leeuwaarden, Johan S. H.; Mukherjee, Debankur
2018-03-01
A notorious problem in mathematics and physics is to create a solvable model for random sequential adsorption of non-overlapping congruent spheres in the d-dimensional Euclidean space with d≥ 2 . Spheres arrive sequentially at uniformly chosen locations in space and are accepted only when there is no overlap with previously deposited spheres. Due to spatial correlations, characterizing the fraction of accepted spheres remains largely intractable. We study this fraction by taking a novel approach that compares random sequential adsorption in Euclidean space to the nearest-neighbor blocking on a sequence of clustered random graphs. This random network model can be thought of as a corrected mean-field model for the interaction graph between the attempted spheres. Using functional limit theorems, we characterize the fraction of accepted spheres and its fluctuations.
ERIC Educational Resources Information Center
Storm, Paula; Kelly, Robert; deVries, Susann
2008-01-01
People and organizations are inherently political. Library workplace environments have zones of tension and dynamics just like any corporation, often leading to the formation of political camps. These different cliques influence productivity and work-related issues and, at worst, give meetings the feel of the Camp David negotiations. Politics are…
3D Markov Process for Traffic Flow Prediction in Real-Time.
Ko, Eunjeong; Ahn, Jinyoung; Kim, Eun Yi
2016-01-25
Recently, the correct estimation of traffic flow has begun to be considered an essential component in intelligent transportation systems. In this paper, a new statistical method to predict traffic flows using time series analyses and geometric correlations is proposed. The novelty of the proposed method is two-fold: (1) a 3D heat map is designed to describe the traffic conditions between roads, which can effectively represent the correlations between spatially- and temporally-adjacent traffic states; and (2) the relationship between the adjacent roads on the spatiotemporal domain is represented by cliques in MRF and the clique parameters are obtained by example-based learning. In order to assess the validity of the proposed method, it is tested using data from expressway traffic that are provided by the Korean Expressway Corporation, and the performance of the proposed method is compared with existing approaches. The results demonstrate that the proposed method can predict traffic conditions with an accuracy of 85%, and this accuracy can be improved further.
3D Markov Process for Traffic Flow Prediction in Real-Time
Ko, Eunjeong; Ahn, Jinyoung; Kim, Eun Yi
2016-01-01
Recently, the correct estimation of traffic flow has begun to be considered an essential component in intelligent transportation systems. In this paper, a new statistical method to predict traffic flows using time series analyses and geometric correlations is proposed. The novelty of the proposed method is two-fold: (1) a 3D heat map is designed to describe the traffic conditions between roads, which can effectively represent the correlations between spatially- and temporally-adjacent traffic states; and (2) the relationship between the adjacent roads on the spatiotemporal domain is represented by cliques in MRF and the clique parameters are obtained by example-based learning. In order to assess the validity of the proposed method, it is tested using data from expressway traffic that are provided by the Korean Expressway Corporation, and the performance of the proposed method is compared with existing approaches. The results demonstrate that the proposed method can predict traffic conditions with an accuracy of 85%, and this accuracy can be improved further. PMID:26821025
Luccioli, Stefano; Ben-Jacob, Eshel; Barzilai, Ari; Bonifazi, Paolo; Torcini, Alessandro
2014-01-01
It has recently been discovered that single neuron stimulation can impact network dynamics in immature and adult neuronal circuits. Here we report a novel mechanism which can explain in neuronal circuits, at an early stage of development, the peculiar role played by a few specific neurons in promoting/arresting the population activity. For this purpose, we consider a standard neuronal network model, with short-term synaptic plasticity, whose population activity is characterized by bursting behavior. The addition of developmentally inspired constraints and correlations in the distribution of the neuronal connectivities and excitabilities leads to the emergence of functional hub neurons, whose stimulation/deletion is critical for the network activity. Functional hubs form a clique, where a precise sequential activation of the neurons is essential to ignite collective events without any need for a specific topological architecture. Unsupervised time-lagged firings of supra-threshold cells, in connection with coordinated entrainments of near-threshold neurons, are the key ingredients to orchestrate population activity. PMID:25255443
Fried, Yael; Kessler, David A.; Shnerb, Nadav M.
2016-01-01
High-diversity species assemblages are very common in nature, and yet the factors allowing for the maintenance of biodiversity remain obscure. The competitive exclusion principle and May’s complexity-diversity puzzle both suggest that a community can support only a small number of species, turning the spotlight on the dynamics of local patches or islands, where stable and uninvadable (SU) subsets of species play a crucial role. Here we map the question of the number of different possible SUs a community can support to the geometric problem of finding maximal cliques of the corresponding graph. This enables us to solve for the number of SUs as a function of the species richness in the regional pool, N, showing that the growth of this number is subexponential in N, contrary to long-standing wisdom. To understand the dynamics under noise we examine the relaxation time to an SU. Symmetric systems relax rapidly, whereas in asymmetric systems the relaxation time grows much faster with N, suggesting an excitable dynamics under noise. PMID:27759102
Transformation of general binary MRF minimization to the first-order case.
Ishikawa, Hiroshi
2011-06-01
We introduce a transformation of general higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, we formalize a framework for approximately minimizing higher-order multi-label MRF energies that combines the new reduction with the fusion-move and QPBO algorithms. While many computer vision problems today are formulated as energy minimization problems, they have mostly been limited to using first-order energies, which consist of unary and pairwise clique potentials, with a few exceptions that consider triples. This is because of the lack of efficient algorithms to optimize energies with higher-order interactions. Our algorithm challenges this restriction that limits the representational power of the models so that higher-order energies can be used to capture the rich statistics of natural scenes. We also show that some minimization methods can be considered special cases of the present framework, as well as comparing the new method experimentally with other such techniques.
Rolls, David A.; Wang, Peng; McBryde, Emma; Pattison, Philippa; Robins, Garry
2015-01-01
We compare two broad types of empirically grounded random network models in terms of their abilities to capture both network features and simulated Susceptible-Infected-Recovered (SIR) epidemic dynamics. The types of network models are exponential random graph models (ERGMs) and extensions of the configuration model. We use three kinds of empirical contact networks, chosen to provide both variety and realistic patterns of human contact: a highly clustered network, a bipartite network and a snowball sampled network of a “hidden population”. In the case of the snowball sampled network we present a novel method for fitting an edge-triangle model. In our results, ERGMs consistently capture clustering as well or better than configuration-type models, but the latter models better capture the node degree distribution. Despite the additional computational requirements to fit ERGMs to empirical networks, the use of ERGMs provides only a slight improvement in the ability of the models to recreate epidemic features of the empirical network in simulated SIR epidemics. Generally, SIR epidemic results from using configuration-type models fall between those from a random network model (i.e., an Erdős-Rényi model) and an ERGM. The addition of subgraphs of size four to edge-triangle type models does improve agreement with the empirical network for smaller densities in clustered networks. Additional subgraphs do not make a noticeable difference in our example, although we would expect the ability to model cliques to be helpful for contact networks exhibiting household structure. PMID:26555701
The glassy random laser: replica symmetry breaking in the intensity fluctuations of emission spectra
Antenucci, Fabrizio; Crisanti, Andrea; Leuzzi, Luca
2015-01-01
The behavior of a newly introduced overlap parameter, measuring the correlation between intensity fluctuations of waves in random media, is analyzed in different physical regimes, with varying amount of disorder and non-linearity. This order parameter allows to identify the laser transition in random media and describes its possible glassy nature in terms of emission spectra data, the only data so far accessible in random laser measurements. The theoretical analysis is performed in terms of the complex spherical spin-glass model, a statistical mechanical model describing the onset and the behavior of random lasers in open cavities. Replica Symmetry Breaking theory allows to discern different kinds of randomness in the high pumping regime, including the most complex and intriguing glassy randomness. The outcome of the theoretical study is, eventually, compared to recent intensity fluctuation overlap measurements demonstrating the validity of the theory and providing a straightforward interpretation of qualitatively different spectral behaviors in different random lasers. PMID:26616194
Paradoxical Inequalities: Adolescent Peer Relations in Indian Secondary Schools
ERIC Educational Resources Information Center
Milner, Murray, Jr.
2013-01-01
Peer relationships in secondary schools in two different cultural areas of India are compared. A general theory of status relations and a specification of the distinctive cultural features of each area are used to explain the observed differences in peer inequality, clique formation, petty deviance, putdowns, fashion consciousness, romantic…
Incorporating Covariates into Stochastic Blockmodels
ERIC Educational Resources Information Center
Sweet, Tracy M.
2015-01-01
Social networks in education commonly involve some form of grouping, such as friendship cliques or teacher departments, and blockmodels are a type of statistical social network model that accommodate these grouping or blocks by assuming different within-group tie probabilities than between-group tie probabilities. We describe a class of models,…
Teenage Social Relationships: Effect on Social Adjustment
ERIC Educational Resources Information Center
Wyche, Yolandria; McGahey, James Todd; Jenkins, Marvin
2017-01-01
High school female students often have challenges transitioning to high school. There are many possible obstacles that exist but some female students may experience difficulties with maintaining interpersonal relationship with their female peers. It is very common for high school settings to have various types of social cliques that exist. In some…
NEEDED RESEARCH ON DIFFUSION WITHIN EDUCATIONAL ORGANIZATIONS.
ERIC Educational Resources Information Center
JAIN, NEMI C.; ROGERS, EVERETT M.
IN SPITE OF THE VOLUME OF RESEARCH ATTENTION DEVOTED TO THE DIFFUSION OF INNOVATIONS, RELATIVELY LITTLE EMPHASIS HAS BEEN PLACED UPON DIFFUSION WITHIN ORGANIZATIONAL STRUCTURES. METHODOLOGICALLY, RELATIONAL ANALYSIS IN WHICH THE UNIT OF ANALYSIS IS A TWO-PERSON INTERACTING PAIR, A MULTIPLE PERSON COMMUNICATION CHAIN, OR CLIQUES OR SUBSYSTEMS IS…
ERIC Educational Resources Information Center
Langeheine, Rolf
1978-01-01
A three-way multidimensional scaling model is presented as a method for identifying classroom cliques, by simultaneous analysis of three variables (for example, chooser/choosen/criteria). Two scaling models--Carroll and Chang's INDSCAL and Lingoes' PINDIS--are presented and applied to two sets of empirical data. (CP)
Peer Bonds in Urban School Communities: An Exploratory Study
ERIC Educational Resources Information Center
Leach, Nicole
2018-01-01
The literature identifies three main types of peer associations: cliques, crowds, and dyadic friendships. When schools create learning communities, an additional type of peer association may emerge that is not based on interactions but instead is based on membership in a shared community. The aim of this study is to qualitatively explore the…
ERIC Educational Resources Information Center
Bastedo, Michael N.
2009-01-01
The ability of trustees to make independent judgments in the best interests of the university is a fundamental characteristic of an effective governing board. Trustee independence is increasingly threatened, however, as the university becomes more deeply embedded in government, industry, networks, and the professions. This topic is investigated…
The Structure of Positive Interpersonal Relations in Small Groups.
ERIC Educational Resources Information Center
Davis, James A.; Leinhardt, Samuel
The authors sought to test Homans' proposition that small groups inevitably generate a social structure which combines subgroups (cliques) and a ranking system. We present a graph theoretical model of such a structure and prove that a necessary and sufficient condition for its existence is the absence of seven particular triad types. Expected…
Efficient Deployment of Key Nodes for Optimal Coverage of Industrial Mobile Wireless Networks
Li, Xiaomin; Li, Di; Dong, Zhijie; Hu, Yage; Liu, Chengliang
2018-01-01
In recent years, industrial wireless networks (IWNs) have been transformed by the introduction of mobile nodes, and they now offer increased extensibility, mobility, and flexibility. Nevertheless, mobile nodes pose efficiency and reliability challenges. Efficient node deployment and management of channel interference directly affect network system performance, particularly for key node placement in clustered wireless networks. This study analyzes this system model, considering both industrial properties of wireless networks and their mobility. Then, static and mobile node coverage problems are unified and simplified to target coverage problems. We propose a novel strategy for the deployment of clustered heads in grouped industrial mobile wireless networks (IMWNs) based on the improved maximal clique model and the iterative computation of new candidate cluster head positions. The maximal cliques are obtained via a double-layer Tabu search. Each cluster head updates its new position via an improved virtual force while moving with full coverage to find the minimal inter-cluster interference. Finally, we develop a simulation environment. The simulation results, based on a performance comparison, show the efficacy of the proposed strategies and their superiority over current approaches. PMID:29439439
Clique-Based Neural Associative Memories with Local Coding and Precoding.
Mofrad, Asieh Abolpour; Parker, Matthew G; Ferdosi, Zahra; Tadayon, Mohammad H
2016-08-01
Techniques from coding theory are able to improve the efficiency of neuroinspired and neural associative memories by forcing some construction and constraints on the network. In this letter, the approach is to embed coding techniques into neural associative memory in order to increase their performance in the presence of partial erasures. The motivation comes from recent work by Gripon, Berrou, and coauthors, which revisited Willshaw networks and presented a neural network with interacting neurons that partitioned into clusters. The model introduced stores patterns as small-size cliques that can be retrieved in spite of partial error. We focus on improving the success of retrieval by applying two techniques: doing a local coding in each cluster and then applying a precoding step. We use a slightly different decoding scheme, which is appropriate for partial erasures and converges faster. Although the ideas of local coding and precoding are not new, the way we apply them is different. Simulations show an increase in the pattern retrieval capacity for both techniques. Moreover, we use self-dual additive codes over field [Formula: see text], which have very interesting properties and a simple-graph representation.
Diffusion amid random overlapping obstacles: Similarities, invariants, approximations
Novak, Igor L.; Gao, Fei; Kraikivski, Pavel; Slepchenko, Boris M.
2011-01-01
Efficient and accurate numerical techniques are used to examine similarities of effective diffusion in a void between random overlapping obstacles: essential invariance of effective diffusion coefficients (Deff) with respect to obstacle shapes and applicability of a two-parameter power law over nearly entire range of excluded volume fractions (ϕ), except for a small vicinity of a percolation threshold. It is shown that while neither of the properties is exact, deviations from them are remarkably small. This allows for quick estimation of void percolation thresholds and approximate reconstruction of Deff (ϕ) for obstacles of any given shape. In 3D, the similarities of effective diffusion yield a simple multiplication “rule” that provides a fast means of estimating Deff for a mixture of overlapping obstacles of different shapes with comparable sizes. PMID:21513372
Yazdizadeh, Bahareh; Majdzadeh, Reza; Alami, Ali; Amrolalaei, Sima
2014-10-29
Formal knowledge networks are considered among the solutions for strengthening knowledge translation and one of the elements of innovative systems in developing and developed countries. In the year 2000, knowledge networks were established in Iran's health system to organize, lead, empower, and coordinate efforts made by health-related research centers in the country. Since the assessment of a knowledge network is one of the main requirements for its success, the current study was designed in two qualitative and quantitative sections to identify the strengths and weaknesses of the established knowledge networks and to assess their efficiency. In the qualitative section, semi-structured, in-depth interviews were held with network directors and secretaries. The interviews were analyzed through the framework approach. To analyze effectiveness, social network analysis approach was used. That is, by considering the networks' research council members as 'nodes', and the numbers of their joint articles--before and after the network establishments--as 'relations or ties', indices of density, clique, and centrality were calculated for each network. In the qualitative section, non-transparency of management, lack of goals, administrative problems were among the most prevalent issues observed. Currently, the most important challenges are the policies related to them and their management. In the quantitative section, we observed that density and clique indices had risen for some networks; however, the centrality index for the same networks was not as high. Consequently the attribution of density and clique indices to these networks was not possible. Therefore, consolidating and revising policies relevant to the networks and preparing a guide for establishing managing networks could prove helpful. To develop knowledge and technology in a country, networks need to solve the problems they face in management and governance. That is, the first step towards the realization of true knowledge networks in health system.
Click or Clique? Using Educational Technology to Address Students' Anxieties about Peer Evaluation
ERIC Educational Resources Information Center
Walker, Ruth; Barwell, Graham
2009-01-01
Peer bias is recognised as a primary factor in negative student perceptions of peer assessment strategies. This study trialled the use of classroom response systems, widely known as clickers, in small seminar classes in order to actively engage students in their subject's assessment process while providing the anonymity that would lessen the…
ERIC Educational Resources Information Center
Storey, Keith
This final report briefly describes activities of a project which developed and evaluated specific natural support intervention procedures to increase the social integration of employees with severe disabilities using single-subject, clique analysis, and social validation methodologies. The project resulted in the publication of 6 journal articles…
Sociometric Clique Identification. Final Report.
ERIC Educational Resources Information Center
Kadushin, Charles
This report consists of four parts. The first part is a non-technical summary of the basic problem and an attempted solution. The second part is a technical review of the literature and a description of the basic algorithm used in the solution. The third part describes the use of the Sociogram System. The fourth part describes the use of CHAIN, a…
ERIC Educational Resources Information Center
Martin, Sonya N.; Milne, Catherine; Scantlebury, Kathryn
2006-01-01
In classrooms from kindergarten to graduate school, researchers have identified target students as students who monopolize material and human resources. Classroom structures that privilege the voice and actions of target students can cause divisive social dynamics that may generate cliques. This study focuses on the emergence of target students,…
Translations on Red Flag No. 12, 5 December 1977
1978-01-25
counterrevolutionary nature, the "gang of four," who were but Jackals in the same lair as the Lin Piao antiparty clique, panicked. The gang did...said that I was an ambitious man daring to think and act. But the class enemies accused me of "wanting to become a golden phoenix and an official
ERIC Educational Resources Information Center
Kunze, Kimberley Annette
2013-01-01
To date, no published research has utilized social network analysis (SNA) to analyze graduate cohorts in clinical psychology. The purpose of this research is to determine how issues of likability among students correlate with other measures, such as disclosure, health, spiritual maturity, help in projects, familiarity, and ease of providing…
The Cool vs. The Uncool. Your Middle School Classroom
ERIC Educational Resources Information Center
Barnes, Peter
2005-01-01
Social cliques start around fourth or fifth grade and get worse through middle school and beyond. The cool vs. the uncool. Nerds, jocks, popular kids and outsiders--students are categorized by their peers and excluded by those different from them. Students who are not part of the "cool" crowd feel isolated and lonely and are often subjected to…
Teenage Behavior: It's Not Biology, Psychology, or Family Values
ERIC Educational Resources Information Center
Milner, Murray, Jr.
2006-01-01
This article examines the explanations behind these questions: (1) Why do American teenagers behave the way they do?; (2) Why are many obsessed with the brands of clothes they wear, their lunchtime seatmates, the parties they are invited to, the latest popular music, the intrigues of school cliques, and who is hooking up with whom?; (3) Why do…
Liaison Roles in the Communication Structure of a Formal Organization: A Pilot Study.
ERIC Educational Resources Information Center
Schwartz, Donald F.
The purpose of this study was first to map the functional communication structure of a 142-member formal organization, then to analyze that structure to identify work groups (Cliques) and interlinking liaison role persons, and finally to describe certain differences between liaison persons and nonliaison members of the work groups as perceived by…
A network analysis of the Chinese stock market
NASA Astrophysics Data System (ADS)
Huang, Wei-Qiang; Zhuang, Xin-Tian; Yao, Shuang
2009-07-01
In many practical important cases, a massive dataset can be represented as a very large network with certain attributes associated with its vertices and edges. Stock markets generate huge amounts of data, which can be use for constructing the network reflecting the market’s behavior. In this paper, we use a threshold method to construct China’s stock correlation network and then study the network’s structural properties and topological stability. We conduct a statistical analysis of this network and show that it follows a power-law model. We also detect components, cliques and independent sets in this network. These analyses allows one to apply a new data mining technique of classifying financial instruments based on stock price data, which provides a deeper insight into the internal structure of the stock market. Moreover, we test the topological stability of this network and find that it displays a topological robustness against random vertex failures, but it is also fragile to intentional attacks. Such a network stability property would be also useful for portfolio investment and risk management.
Life as an emergent phenomenon: studies from a large-scale boid simulation and web data.
Ikegami, Takashi; Mototake, Yoh-Ichi; Kobori, Shintaro; Oka, Mizuki; Hashimoto, Yasuhiro
2017-12-28
A large group with a special structure can become the mother of emergence. We discuss this hypothesis in relation to large-scale boid simulations and web data. In the boid swarm simulations, the nucleation, organization and collapse dynamics were found to be more diverse in larger flocks than in smaller flocks. In the second analysis, large web data, consisting of shared photos with descriptive tags, tended to group together users with similar tendencies, allowing the network to develop a core-periphery structure. We show that the generation rate of novel tags and their usage frequencies are high in the higher-order cliques. In this case, novelty is not considered to arise randomly; rather, it is generated as a result of a large and structured network. We contextualize these results in terms of adjacent possible theory and as a new way to understand collective intelligence. We argue that excessive information and material flow can become a source of innovation.This article is part of the themed issue 'Reconceptualizing the origins of life'. © 2017 The Author(s).
Life as an emergent phenomenon: studies from a large-scale boid simulation and web data
NASA Astrophysics Data System (ADS)
Ikegami, Takashi; Mototake, Yoh-ichi; Kobori, Shintaro; Oka, Mizuki; Hashimoto, Yasuhiro
2017-11-01
A large group with a special structure can become the mother of emergence. We discuss this hypothesis in relation to large-scale boid simulations and web data. In the boid swarm simulations, the nucleation, organization and collapse dynamics were found to be more diverse in larger flocks than in smaller flocks. In the second analysis, large web data, consisting of shared photos with descriptive tags, tended to group together users with similar tendencies, allowing the network to develop a core-periphery structure. We show that the generation rate of novel tags and their usage frequencies are high in the higher-order cliques. In this case, novelty is not considered to arise randomly; rather, it is generated as a result of a large and structured network. We contextualize these results in terms of adjacent possible theory and as a new way to understand collective intelligence. We argue that excessive information and material flow can become a source of innovation. This article is part of the themed issue 'Reconceptualizing the origins of life'.
NASA Technical Reports Server (NTRS)
Kato, Seiji; Sun-Mack, Sunny; Miller, Walter F.; Rose, Fred G.; Chen, Yan; Minnis, Patrick; Wielicki, Bruce A.
2009-01-01
A cloud frequency of occurrence matrix is generated using merged cloud vertical profile derived from Cloud-Aerosol Lidar with Orthogonal Polarization (CALIOP) and Cloud Profiling Radar (CPR). The matrix contains vertical profiles of cloud occurrence frequency as a function of the uppermost cloud top. It is shown that the cloud fraction and uppermost cloud top vertical pro les can be related by a set of equations when the correlation distance of cloud occurrence, which is interpreted as an effective cloud thickness, is introduced. The underlying assumption in establishing the above relation is that cloud overlap approaches the random overlap with increasing distance separating cloud layers and that the probability of deviating from the random overlap decreases exponentially with distance. One month of CALIPSO and CloudSat data support these assumptions. However, the correlation distance sometimes becomes large, which might be an indication of precipitation. The cloud correlation distance is equivalent to the de-correlation distance introduced by Hogan and Illingworth [2000] when cloud fractions of both layers in a two-cloud layer system are the same.
Knott, V; Rees, D J; Cheng, Z; Brownlee, G G
1988-01-01
Sets of overlapping cosmid clones generated by random sampling and fingerprinting methods complement data at pyrB (96.5') and oriC (84') in the published physical map of E. coli. A new cloning strategy using sheared DNA, and a low copy, inducible cosmid vector were used in order to reduce bias in libraries, in conjunction with micro-methods for preparing cosmid DNA from a large number of clones. Our results are relevant to the design of the best approach to the physical mapping of large genomes. PMID:2834694
Lattice Boltzmann simulations for wall-flow dynamics in porous ceramic diesel particulate filters
NASA Astrophysics Data System (ADS)
Lee, Da Young; Lee, Gi Wook; Yoon, Kyu; Chun, Byoungjin; Jung, Hyun Wook
2018-01-01
Flows through porous filter walls of wall-flow diesel particulate filter are investigated using the lattice Boltzmann method (LBM). The microscopic model of the realistic filter wall is represented by randomly overlapped arrays of solid spheres. The LB simulation results are first validated by comparison to those from previous hydrodynamic theories and constitutive models for flows in porous media with simple regular and random solid-wall configurations. We demonstrate that the newly designed randomly overlapped array structures of porous walls allow reliable and accurate simulations for the porous wall-flow dynamics in a wide range of solid volume fractions from 0.01 to about 0.8, which is beyond the maximum random packing limit of 0.625. The permeable performance of porous media is scrutinized by changing the solid volume fraction and particle Reynolds number using Darcy's law and Forchheimer's extension in the laminar flow region.
ERIC Educational Resources Information Center
Frank, Kenneth
2014-01-01
This study concerns how intra-organizational networks affect the implementation of policies and practices in organizations. In particular, we attend to the role of the informal subgroup or clique in cultivating and distributing locally adapted and integrated knowledge, or know-how. We develop two hypotheses based on the importance of…
Team knowledge representation: a network perspective.
Espinosa, J Alberto; Clark, Mark A
2014-03-01
We propose a network perspective of team knowledge that offers both conceptual and methodological advantages, expanding explanatory value through representation and measurement of component structure and content. Team knowledge has typically been conceptualized and measured with relatively simple aggregates, without fully accounting for differing knowledge configurations among team members. Teams with similar aggregate values of team knowledge may have very different team dynamics depending on how knowledge isolates, cliques, and densities are distributed across the team; which members are the most knowledgeable; who shares knowledge with whom; and how knowledge clusters are distributed. We illustrate our proposed network approach through a sample of 57 teams, including how to compute, analyze, and visually represent team knowledge. Team knowledge network structures (isolation, centrality) are associated with outcomes of, respectively, task coordination, strategy coordination, and the proportion of team knowledge cliques, all after controlling for shared team knowledge. Network analysis helps to represent, measure, and understand the relationship of team knowledge to outcomes of interest to team researchers, members, and managers. Our approach complements existing team knowledge measures. Researchers and managers can apply network concepts and measures to help understand where team knowledge is held within a team and how this relational structure may influence team coordination, cohesion, and performance.
Molecular Sticker Model Stimulation on Silicon for a Maximum Clique Problem
Ning, Jianguo; Li, Yanmei; Yu, Wen
2015-01-01
Molecular computers (also called DNA computers), as an alternative to traditional electronic computers, are smaller in size but more energy efficient, and have massive parallel processing capacity. However, DNA computers may not outperform electronic computers owing to their higher error rates and some limitations of the biological laboratory. The stickers model, as a typical DNA-based computer, is computationally complete and universal, and can be viewed as a bit-vertically operating machine. This makes it attractive for silicon implementation. Inspired by the information processing method on the stickers computer, we propose a novel parallel computing model called DEM (DNA Electronic Computing Model) on System-on-a-Programmable-Chip (SOPC) architecture. Except for the significant difference in the computing medium—transistor chips rather than bio-molecules—the DEM works similarly to DNA computers in immense parallel information processing. Additionally, a plasma display panel (PDP) is used to show the change of solutions, and helps us directly see the distribution of assignments. The feasibility of the DEM is tested by applying it to compute a maximum clique problem (MCP) with eight vertices. Owing to the limited computing sources on SOPC architecture, the DEM could solve moderate-size problems in polynomial time. PMID:26075867
Hansen, Adam G.; Beauchamp, David A.
2014-01-01
Most predators eat only a subset of possible prey. However, studies evaluating diet selection rarely measure prey availability in a manner that accounts for temporal–spatial overlap with predators, the sensory mechanisms employed to detect prey, and constraints on prey capture.We evaluated the diet selection of cutthroat trout (Oncorhynchus clarkii) feeding on a diverse planktivore assemblage in Lake Washington to test the hypothesis that the diet selection of piscivores would reflect random (opportunistic) as opposed to non-random (targeted) feeding, after accounting for predator–prey overlap, visual detection and capture constraints.Diets of cutthroat trout were sampled in autumn 2005, when the abundance of transparent, age-0 longfin smelt (Spirinchus thaleichthys) was low, and 2006, when the abundance of smelt was nearly seven times higher. Diet selection was evaluated separately using depth-integrated and depth-specific (accounted for predator–prey overlap) prey abundance. The abundance of different prey was then adjusted for differences in detectability and vulnerability to predation to see whether these factors could explain diet selection.In 2005, cutthroat trout fed non-randomly by selecting against the smaller, transparent age-0 longfin smelt, but for the larger age-1 longfin smelt. After adjusting prey abundance for visual detection and capture, cutthroat trout fed randomly. In 2006, depth-integrated and depth-specific abundance explained the diets of cutthroat trout well, indicating random feeding. Feeding became non-random after adjusting for visual detection and capture. Cutthroat trout selected strongly for age-0 longfin smelt, but against similar sized threespine stickleback (Gasterosteus aculeatus) and larger age-1 longfin smelt in 2006. Overlap with juvenile sockeye salmon (O. nerka) was minimal in both years, and sockeye salmon were rare in the diets of cutthroat trout.The direction of the shift between random and non-random selection depended on the presence of a weak versus a strong year class of age-0 longfin smelt. These fish were easy to catch, but hard to see. When their density was low, poor detection could explain their rarity in the diet. When their density was high, poor detection was compensated by higher encounter rates with cutthroat trout, sufficient to elicit a targeted feeding response. The nature of the feeding selectivity of a predator can be highly dependent on fluctuations in the abundance and suitability of key prey.
1985-06-20
Public Circle Support 47 SADR Support 48 Saint Lucia Support 49 Swedish Communists Solidarity to Kim Il-song (KCNA, 29 May 85) 50 Briefs ’ War ...and war rackets and respond to our peace proposal for holding North-South parliamentary talks and announcing a joint declaration of nonaggression...counter the new war provocation maneuvers of the U.S. imperialists and the puppet clique, and more powerfully implement the three revolutions—ideological
Social Circles Detection from Ego Network and Profile Information
2014-12-19
response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing... algorithm used to infer k-clique communities is expo- nential, which makes this technique unfeasible when treating egonets with a large number of users...atic when considering RBMs. This inconvenient was positively solved implementing a sparsity treatment with the RBM algorithm . (ii) The ground truth was
Life in an Unjust Community: A Hollywood View of High School Moral Life
ERIC Educational Resources Information Center
Resnick, David
2008-01-01
This article analyses the film "Mean girls" (2004) as a window on popular notions of the moral life of American high schools, which straddles Kohlberg's Stage 2 and 3. The film presents loyalty to peer group cliques as a key value, even as it offers an individualist, relativist critique of that loyalty. Gossip is the main transgression in this…
Habitat use and habitat overlap of riparian birds in three elevational zones
Deborah M. Finch
1989-01-01
I examined patterns of variance in habitat use and habitat overlap in 20 breeding bird species found along a riparian vegetational gradient in southeastern Wyoming to test whether habitat use in species differed (1) from availability of random habitat resources, (2) among elevational zones, and (3) between species that inhabited only one zone and species that occupied...
An Efficient Method to Detect Mutual Overlap of a Large Set of Unordered Images for Structure-From
NASA Astrophysics Data System (ADS)
Wang, X.; Zhan, Z. Q.; Heipke, C.
2017-05-01
Recently, low-cost 3D reconstruction based on images has become a popular focus of photogrammetry and computer vision research. Methods which can handle an arbitrary geometric setup of a large number of unordered and convergent images are of particular interest. However, determining the mutual overlap poses a considerable challenge. We propose a new method which was inspired by and improves upon methods employing random k-d forests for this task. Specifically, we first derive features from the images and then a random k-d forest is used to find the nearest neighbours in feature space. Subsequently, the degree of similarity between individual images, the image overlaps and thus images belonging to a common block are calculated as input to a structure-from-motion (sfm) pipeline. In our experiments we show the general applicability of the new method and compare it with other methods by analyzing the time efficiency. Orientations and 3D reconstructions were successfully conducted with our overlap graphs by sfm. The results show a speed-up of a factor of 80 compared to conventional pairwise matching, and of 8 and 2 compared to the VocMatch approach using 1 and 4 CPU, respectively.
NASA Astrophysics Data System (ADS)
Wels, Michael; Zheng, Yefeng; Huber, Martin; Hornegger, Joachim; Comaniciu, Dorin
2011-06-01
We describe a fully automated method for tissue classification, which is the segmentation into cerebral gray matter (GM), cerebral white matter (WM), and cerebral spinal fluid (CSF), and intensity non-uniformity (INU) correction in brain magnetic resonance imaging (MRI) volumes. It combines supervised MRI modality-specific discriminative modeling and unsupervised statistical expectation maximization (EM) segmentation into an integrated Bayesian framework. While both the parametric observation models and the non-parametrically modeled INUs are estimated via EM during segmentation itself, a Markov random field (MRF) prior model regularizes segmentation and parameter estimation. Firstly, the regularization takes into account knowledge about spatial and appearance-related homogeneity of segments in terms of pairwise clique potentials of adjacent voxels. Secondly and more importantly, patient-specific knowledge about the global spatial distribution of brain tissue is incorporated into the segmentation process via unary clique potentials. They are based on a strong discriminative model provided by a probabilistic boosting tree (PBT) for classifying image voxels. It relies on the surrounding context and alignment-based features derived from a probabilistic anatomical atlas. The context considered is encoded by 3D Haar-like features of reduced INU sensitivity. Alignment is carried out fully automatically by means of an affine registration algorithm minimizing cross-correlation. Both types of features do not immediately use the observed intensities provided by the MRI modality but instead rely on specifically transformed features, which are less sensitive to MRI artifacts. Detailed quantitative evaluations on standard phantom scans and standard real-world data show the accuracy and robustness of the proposed method. They also demonstrate relative superiority in comparison to other state-of-the-art approaches to this kind of computational task: our method achieves average Dice coefficients of 0.93 ± 0.03 (WM) and 0.90 ± 0.05 (GM) on simulated mono-spectral and 0.94 ± 0.02 (WM) and 0.92 ± 0.04 (GM) on simulated multi-spectral data from the BrainWeb repository. The scores are 0.81 ± 0.09 (WM) and 0.82 ± 0.06 (GM) and 0.87 ± 0.05 (WM) and 0.83 ± 0.12 (GM) for the two collections of real-world data sets—consisting of 20 and 18 volumes, respectively—provided by the Internet Brain Segmentation Repository.
Wels, Michael; Zheng, Yefeng; Huber, Martin; Hornegger, Joachim; Comaniciu, Dorin
2011-06-07
We describe a fully automated method for tissue classification, which is the segmentation into cerebral gray matter (GM), cerebral white matter (WM), and cerebral spinal fluid (CSF), and intensity non-uniformity (INU) correction in brain magnetic resonance imaging (MRI) volumes. It combines supervised MRI modality-specific discriminative modeling and unsupervised statistical expectation maximization (EM) segmentation into an integrated Bayesian framework. While both the parametric observation models and the non-parametrically modeled INUs are estimated via EM during segmentation itself, a Markov random field (MRF) prior model regularizes segmentation and parameter estimation. Firstly, the regularization takes into account knowledge about spatial and appearance-related homogeneity of segments in terms of pairwise clique potentials of adjacent voxels. Secondly and more importantly, patient-specific knowledge about the global spatial distribution of brain tissue is incorporated into the segmentation process via unary clique potentials. They are based on a strong discriminative model provided by a probabilistic boosting tree (PBT) for classifying image voxels. It relies on the surrounding context and alignment-based features derived from a probabilistic anatomical atlas. The context considered is encoded by 3D Haar-like features of reduced INU sensitivity. Alignment is carried out fully automatically by means of an affine registration algorithm minimizing cross-correlation. Both types of features do not immediately use the observed intensities provided by the MRI modality but instead rely on specifically transformed features, which are less sensitive to MRI artifacts. Detailed quantitative evaluations on standard phantom scans and standard real-world data show the accuracy and robustness of the proposed method. They also demonstrate relative superiority in comparison to other state-of-the-art approaches to this kind of computational task: our method achieves average Dice coefficients of 0.93 ± 0.03 (WM) and 0.90 ± 0.05 (GM) on simulated mono-spectral and 0.94 ± 0.02 (WM) and 0.92 ± 0.04 (GM) on simulated multi-spectral data from the BrainWeb repository. The scores are 0.81 ± 0.09 (WM) and 0.82 ± 0.06 (GM) and 0.87 ± 0.05 (WM) and 0.83 ± 0.12 (GM) for the two collections of real-world data sets-consisting of 20 and 18 volumes, respectively-provided by the Internet Brain Segmentation Repository.
Determination of mango fruit from binary image using randomized Hough transform
NASA Astrophysics Data System (ADS)
Rizon, Mohamed; Najihah Yusri, Nurul Ain; Abdul Kadir, Mohd Fadzil; bin Mamat, Abd. Rasid; Abd Aziz, Azim Zaliha; Nanaa, Kutiba
2015-12-01
A method of detecting mango fruit from RGB input image is proposed in this research. From the input image, the image is processed to obtain the binary image using the texture analysis and morphological operations (dilation and erosion). Later, the Randomized Hough Transform (RHT) method is used to find the best ellipse fits to each binary region. By using the texture analysis, the system can detect the mango fruit that is partially overlapped with each other and mango fruit that is partially occluded by the leaves. The combination of texture analysis and morphological operator can isolate the partially overlapped fruit and fruit that are partially occluded by leaves. The parameters derived from RHT method was used to calculate the center of the ellipse. The center of the ellipse acts as the gripping point for the fruit picking robot. As the results, the rate of detection was up to 95% for fruit that is partially overlapped and partially covered by leaves.
Korean Affairs Report, Number 320.
1983-11-03
search of the Academy of Social Sciences, speaks: [Begin recording] Now, the traitorous puppet clique of Chon Tu-hwan, who was greeted with a bomb...the desperate position of a trouble-maker becoming more delinquent after being foresaken by family and neighbors. For this reason, it is a childish ...business of the current house sitting, unless the ruling party "changes its mind." There appears to be consensus among political observers that
Acceleration of Binding Site Comparisons by Graph Partitioning.
Krotzky, Timo; Klebe, Gerhard
2015-08-01
The comparison of protein binding sites is a prominent task in computational chemistry and has been studied in many different ways. For the automatic detection and comparison of putative binding cavities the Cavbase system has been developed which uses a coarse-grained set of pseudocenters to represent the physicochemical properties of a binding site and employs a graph-based procedure to calculate similarities between two binding sites. However, the comparison of two graphs is computationally quite demanding which makes large-scale studies such as the rapid screening of entire databases hardly feasible. In a recent work, we proposed the method Local Cliques (LC) for the efficient comparison of Cavbase binding sites. It employs a clique heuristic to detect the maximum common subgraph of two binding sites and an extended graph model to additionally compare the shape of individual surface patches. In this study, we present an alternative to further accelerate the LC method by partitioning the binding-site graphs into disjoint components prior to their comparisons. The pseudocenter sets are split with regard to their assigned phyiscochemical type, which leads to seven much smaller graphs than the original one. Applying this approach on the same test scenarios as in the former comprehensive way results in a significant speed-up without sacrificing accuracy. © 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
The Private Lives of Minerals: Social Network Analysis Applied to Mineralogy and Petrology
NASA Astrophysics Data System (ADS)
Hazen, R. M.; Morrison, S. M.; Fox, P. A.; Golden, J. J.; Downs, R. T.; Eleish, A.; Prabhu, A.; Li, C.; Liu, C.
2016-12-01
Comprehensive databases of mineral species (rruff.info/ima) and their geographic localities and co-existing mineral assemblages (mindat.org) reveal patterns of mineral association and distribution that mimic social networks, as commonly applied to such varied topics as social media interactions, the spread of disease, terrorism networks, and research collaborations. Applying social network analysis (SNA) to common assemblages of rock-forming igneous and regional metamorphic mineral species, we find patterns of cohesion, segregation, density, and cliques that are similar to those of human social networks. These patterns highlight classic trends in lithologic evolution and are illustrated with sociograms, in which mineral species are the "nodes" and co-existing species form "links." Filters based on chemistry, age, structural group, and other parameters highlight visually both familiar and new aspects of mineralogy and petrology. We quantify sociograms with SNA metrics, including connectivity (based on the frequency of co-occurrence of mineral pairs), homophily (the extent to which co-existing mineral species share compositional and other characteristics), network closure (based on the degree of network interconnectivity), and segmentation (as revealed by isolated "cliques" of mineral species). Exploitation of large and growing mineral data resources with SNA offers promising avenues for discovering previously hidden trends in mineral diversity-distribution systematics, as well as providing new pedagogical approaches to teaching mineralogy and petrology.
The discovery of structural form
Kemp, Charles; Tenenbaum, Joshua B.
2008-01-01
Algorithms for finding structure in data have become increasingly important both as tools for scientific data analysis and as models of human learning, yet they suffer from a critical limitation. Scientists discover qualitatively new forms of structure in observed data: For instance, Linnaeus recognized the hierarchical organization of biological species, and Mendeleev recognized the periodic structure of the chemical elements. Analogous insights play a pivotal role in cognitive development: Children discover that object category labels can be organized into hierarchies, friendship networks are organized into cliques, and comparative relations (e.g., “bigger than” or “better than”) respect a transitive order. Standard algorithms, however, can only learn structures of a single form that must be specified in advance: For instance, algorithms for hierarchical clustering create tree structures, whereas algorithms for dimensionality-reduction create low-dimensional spaces. Here, we present a computational model that learns structures of many different forms and that discovers which form is best for a given dataset. The model makes probabilistic inferences over a space of graph grammars representing trees, linear orders, multidimensional spaces, rings, dominance hierarchies, cliques, and other forms and successfully discovers the underlying structure of a variety of physical, biological, and social domains. Our approach brings structure learning methods closer to human abilities and may lead to a deeper computational understanding of cognitive development. PMID:18669663
The Erdős-Rothschild problem on edge-colourings with forbidden monochromatic cliques
NASA Astrophysics Data System (ADS)
Pikhurko, Oleg; Staden, Katherine; Yilma, Zelealem B.
2017-09-01
Let $\\mathbf{k} := (k_1,\\dots,k_s)$ be a sequence of natural numbers. For a graph $G$, let $F(G;\\mathbf{k})$ denote the number of colourings of the edges of $G$ with colours $1,\\dots,s$ such that, for every $c \\in \\{1,\\dots,s\\}$, the edges of colour $c$ contain no clique of order $k_c$. Write $F(n;\\mathbf{k})$ to denote the maximum of $F(G;\\mathbf{k})$ over all graphs $G$ on $n$ vertices. This problem was first considered by Erd\\H{o}s and Rothschild in 1974, but it has been solved only for a very small number of non-trivial cases. We prove that, for every $\\mathbf{k}$ and $n$, there is a complete multipartite graph $G$ on $n$ vertices with $F(G;\\mathbf{k}) = F(n;\\mathbf{k})$. Also, for every $\\mathbf{k}$ we construct a finite optimisation problem whose maximum is equal to the limit of $\\log_2 F(n;\\mathbf{k})/{n\\choose 2}$ as $n$ tends to infinity. Our final result is a stability theorem for complete multipartite graphs $G$, describing the asymptotic structure of such $G$ with $F(G;\\mathbf{k}) = F(n;\\mathbf{k}) \\cdot 2^{o(n^2)}$ in terms of solutions to the optimisation problem.
NASA Astrophysics Data System (ADS)
Kato, Seiji; Sun-Mack, Sunny; Miller, Walter F.; Rose, Fred G.; Chen, Yan; Minnis, Patrick; Wielicki, Bruce A.
2010-01-01
A cloud frequency of occurrence matrix is generated using merged cloud vertical profiles derived from the satellite-borne Cloud-Aerosol Lidar with Orthogonal Polarization (CALIOP) and cloud profiling radar. The matrix contains vertical profiles of cloud occurrence frequency as a function of the uppermost cloud top. It is shown that the cloud fraction and uppermost cloud top vertical profiles can be related by a cloud overlap matrix when the correlation length of cloud occurrence, which is interpreted as an effective cloud thickness, is introduced. The underlying assumption in establishing the above relation is that cloud overlap approaches random overlap with increasing distance separating cloud layers and that the probability of deviating from random overlap decreases exponentially with distance. One month of Cloud-Aerosol Lidar and Infrared Pathfinder Satellite Observation (CALIPSO) and CloudSat data (July 2006) support these assumptions, although the correlation length sometimes increases with separation distance when the cloud top height is large. The data also show that the correlation length depends on cloud top hight and the maximum occurs when the cloud top height is 8 to 10 km. The cloud correlation length is equivalent to the decorrelation distance introduced by Hogan and Illingworth (2000) when cloud fractions of both layers in a two-cloud layer system are the same. The simple relationships derived in this study can be used to estimate the top-of-atmosphere irradiance difference caused by cloud fraction, uppermost cloud top, and cloud thickness vertical profile differences.
NASA Technical Reports Server (NTRS)
Mengshoel, Ole Jakob; Poll, Scott; Kurtoglu, Tolga
2009-01-01
In this paper, we investigate the use of Bayesian networks to construct large-scale diagnostic systems. In particular, we consider the development of large-scale Bayesian networks by composition. This compositional approach reflects how (often redundant) subsystems are architected to form systems such as electrical power systems. We develop high-level specifications, Bayesian networks, clique trees, and arithmetic circuits representing 24 different electrical power systems. The largest among these 24 Bayesian networks contains over 1,000 random variables. Another BN represents the real-world electrical power system ADAPT, which is representative of electrical power systems deployed in aerospace vehicles. In addition to demonstrating the scalability of the compositional approach, we briefly report on experimental results from the diagnostic competition DXC, where the ProADAPT team, using techniques discussed here, obtained the highest scores in both Tier 1 (among 9 international competitors) and Tier 2 (among 6 international competitors) of the industrial track. While we consider diagnosis of power systems specifically, we believe this work is relevant to other system health management problems, in particular in dependable systems such as aircraft and spacecraft. (See CASI ID 20100021910 for supplemental data disk.)
Hierarchical Higher Order Crf for the Classification of Airborne LIDAR Point Clouds in Urban Areas
NASA Astrophysics Data System (ADS)
Niemeyer, J.; Rottensteiner, F.; Soergel, U.; Heipke, C.
2016-06-01
We propose a novel hierarchical approach for the classification of airborne 3D lidar points. Spatial and semantic context is incorporated via a two-layer Conditional Random Field (CRF). The first layer operates on a point level and utilises higher order cliques. Segments are generated from the labelling obtained in this way. They are the entities of the second layer, which incorporates larger scale context. The classification result of the segments is introduced as an energy term for the next iteration of the point-based layer. This framework iterates and mutually propagates context to improve the classification results. Potentially wrong decisions can be revised at later stages. The output is a labelled point cloud as well as segments roughly corresponding to object instances. Moreover, we present two new contextual features for the segment classification: the distance and the orientation of a segment with respect to the closest road. It is shown that the classification benefits from these features. In our experiments the hierarchical framework improve the overall accuracies by 2.3% on a point-based level and by 3.0% on a segment-based level, respectively, compared to a purely point-based classification.
JPRS Report, East Asia, Korea: Kulloja, No. 2, February 1988.
1989-03-02
war to make cadres and party members cherish their loyalty to the party and the leader as a firm faith, by intensifying and developing the work of...South Korean puppet clique are ceaselessly continuing their new war provocation maneuvers. The revolutionary duty confronting us and the prevailing...revolutionary cause led by the leader. During the fatherland liberation war , our people who, having inherited that spirit, acted as human bombs to defend
On the Maximum-Weight Clique Problem.
1985-06-01
hypergeometric distribution", Discrete Math . 25, 285-287 .* CHVATAL, V. (1983), Linear Programming, W.H. Freeman, New York/San Francisco. COOK, S.A. (1971...Annals Discrete Math . 21, 325-356 GROTSCHEL, M., L. LOVASZ, and A. SCHRIJVER ((1984b), "Relaxations of Vertex Packing", Preprint No. 35...de Grenoble. See also N. Sbihi, "Algorithme de recherche d’un stable de cardinalite maximum dans un graphe sans etoile", Discrete Math . 19 (1980), 53
Spatial interactions of yarded White-tailed Deer, Odocoileus virginianus
Nelson, M.E.; Sargeant, G.A.
2008-01-01
We examined the spatial interactions of nine female White-tailed Deer (Odocoileus virginianus) in two deeryards (winter aggregations) in northeastern Minnesota during February-April 1999. Global positioning system (GPS) collars yielded seven pair-wise comparisons of deer that were located at the same time (???1 minute apart) and mat used overlapping areas. Deer traveled separately and did not associate with one another. Within overlapping areas, comparisons of distances between deer and distances between random locations indicated deer moved without regard to each other. Similarly, comparisons of observed and expected probabilities of deer using areas overlapping those of other deer also evinced that deer moved independently.
Window and Overlap Processing Effects on Power Estimates from Spectra
NASA Astrophysics Data System (ADS)
Trethewey, M. W.
2000-03-01
Fast Fourier transform (FFT) spectral processing is based on the assumption of stationary ergodic data. In engineering practice, the assumption is often violated and non-stationary data processed. Data windows are commonly used to reduce leakage by decreasing the signal amplitudes near the boundaries of the discrete samples. With certain combinations of non-stationary signals and windows, the temporal weighting may attenuate important signal characteristics to adversely affect any subsequent processing. In other words, the window artificially reduces a significant section of the time signal. Consequently, spectra and overall power estimated from the affected samples are unreliable. FFT processing can be particularly problematic when the signal consists of randomly occurring transients superimposed on a more continuous signal. Overlap processing is commonly used in this situation to improve the estimates. However, the results again depend on the temporal character of the signal in relation to the window weighting. A worst-case scenario, a short-duration half sine pulse, is used to illustrate the relationship between overlap percentage and resulting power estimates. The power estimates are shown to depend on the temporal behaviour of the square of overlapped window segments. An analysis shows that power estimates may be obtained to within 0.27 dB for the following windows and overlap combinations: rectangular (0% overlap), Hanning (62.5% overlap), Hamming (60.35% overlap) and flat-top (82.25% overlap).
Social Network Analysis in Frontier Capital Markets
2012-06-01
developed by Watts and Strogatz measures the extent to which clusters or cliques exist in a network [WS98]. The clustering coefficent of each individual...Coefficient Watts- Strogatz 0.8039 0.8222 0.7227 Total Degree Centralization 0.0618 0.0940 0.0612 Betweenness Centralization 0.0909 0.1256 0.0646 Closeness...Fragmentation 0.6099 0.5304 0.5308 Clustering Coefficient Watts- Strogatz 0.5281 0.6607 0.6360 Total Degree Centralization 0.0153 0.0360 0.0171
Beyond the Golden Rule: A Parent's Guide to Preventing and Responding to Prejudice
ERIC Educational Resources Information Center
Williams, Dana
2013-01-01
Whether one is a parent of a 3-year-old who is curious about why a friend's skin is brown, the parent of a 9-year-old who has been called a slur because of his religion, or the parent of a 15-year-old who snubs those outside of her social clique at school, this book is designed to help teach children to honor the differences in themselves and in…
Systematic review of social network analysis in adolescent cigarette smoking behavior.
Seo, Dong-Chul; Huang, Yan
2012-01-01
Social networks are important in adolescent smoking behavior. Previous research indicates that peer context is a major causal factor of adolescent smoking behavior. To date, however, little is known about the influence of peer group structure on adolescent smoking behavior. Studies that examined adolescent social networks with regard to their cigarette smoking behavior were identified through online and manual literature searches. Ten social network analysis studies involving a total of 28,263 adolescents were included in the final review. Of the 10 reviewed studies, 6 identify clique members, liaisons, and isolates as contributing factors to adolescent cigarette smoking. Significantly higher rates of smoking are noted among isolates than clique members or liaisons in terms of peer network structure. Eight of the reviewed studies indicate that peer selection or influence precedes adolescents' smoking behavior and intent to smoke. Such peer selection or influence accounts for a large portion of similarities among smoking adolescents. Adolescents who are identified as isolates are more likely to smoke and engage in risk-taking behaviors than others in the peer network structure. Given that the vast majority of current adult smokers started their smoking habits during adolescence, adolescent smoking prevention efforts will likely benefit from incorporating social network analytic approaches and focusing the efforts on isolates and other vulnerable adolescents from a peer selection and influence perspective. © 2011, American School Health Association.
Automated lung sound analysis for detecting pulmonary abnormalities.
Datta, Shreyasi; Dutta Choudhury, Anirban; Deshpande, Parijat; Bhattacharya, Sakyajit; Pal, Arpan
2017-07-01
Identification of pulmonary diseases comprises of accurate auscultation as well as elaborate and expensive pulmonary function tests. Prior arts have shown that pulmonary diseases lead to abnormal lung sounds such as wheezes and crackles. This paper introduces novel spectral and spectrogram features, which are further refined by Maximal Information Coefficient, leading to the classification of healthy and abnormal lung sounds. A balanced lung sound dataset, consisting of publicly available data and data collected with a low-cost in-house digital stethoscope are used. The performance of the classifier is validated over several randomly selected non-overlapping training and validation samples and tested on separate subjects for two separate test cases: (a) overlapping and (b) non-overlapping data sources in training and testing. The results reveal that the proposed method sustains an accuracy of 80% even for non-overlapping data sources in training and testing.
Non-overlap subaperture interferometric testing for large optics
NASA Astrophysics Data System (ADS)
Wu, Xin; Yu, Yingjie; Zeng, Wenhan; Qi, Te; Chen, Mingyi; Jiang, Xiangqian
2017-08-01
It has been shown that the number of subapertures and the amount of overlap has a significant influence on the stitching accuracy. In this paper, a non-overlap subaperture interferometric testing method (NOSAI) is proposed to inspect large optical components. This method would greatly reduce the number of subapertures and the influence of environmental interference while maintaining the accuracy of reconstruction. A general subaperture distribution pattern of NOSAI is also proposed for the large rectangle surface. The square Zernike polynomial is employed to fit such wavefront. The effect of the minimum fitting terms on the accuracy of NOSAI and the sensitivities of NOSAI to subaperture's alignment error, power systematic error, and random noise are discussed. Experimental results validate the feasibility and accuracy of the proposed NOSAI in comparison with wavefront obtained by a large aperture interferometer and stitching surface by multi-aperture overlap-scanning technique (MAOST).
Radiative Impacts of Cloud Heterogeneity and Overlap in an Atmospheric General Circulation Model
NASA Technical Reports Server (NTRS)
Oreopoulos, L.; Lee, D.; Sud, Y. C.; Suarez, M. J.
2012-01-01
The radiative impacts of introducing horizontal heterogeneity of layer cloud condensate, and vertical overlap of condensate and cloud fraction are examined with the aid of a new radiation package operating in the GEOS-5 Atmospheric General Circulation Model. The impacts are examined in terms of diagnostic top-of-the-atmosphere shortwave (SW) and longwave (LW) cloud radiative effect (CRE) calculations for a range of assumptions and parameter specifications about the overlap. The investigation is conducted for two distinct cloud schemes, the one that comes with the standard GEOS-5 distribution, and another which has been recently used experimentally for its enhanced GEOS-5 distribution, and another which has been recently used experimentally for its enhanced cloud microphysical capabilities; both are coupled to a cloud generator allowing arbitrary cloud overlap specification. We find that cloud overlap radiative impacts are significantly stronger for the operational cloud scheme for which a change of cloud fraction overlap from maximum-random to generalized results to global changes of SW and LW CRE of approximately 4 Watts per square meter, and zonal changes of up to approximately 10 Watts per square meter. This is because of fewer occurrences compared to the other scheme of large layer cloud fractions and of multi-layer situations with large numbers of atmospheric being simultaneously cloudy, conditions that make overlap details more important. The impact on CRE of the details of condensate distribution overlap is much weaker. Once generalized overlap is adopted, both cloud schemes are only modestly sensitive to the exact values of the overlap parameters. We also find that if one of the CRE components is overestimated and the other underestimated, both cannot be driven towards observed values by adjustments to cloud condensate heterogeneity and overlap alone.
NASA Astrophysics Data System (ADS)
Juher, David; Saldaña, Joan
2018-03-01
We study the properties of the potential overlap between two networks A ,B sharing the same set of N nodes (a two-layer network) whose respective degree distributions pA(k ) ,pB(k ) are given. Defining the overlap coefficient α as the Jaccard index, we prove that α is very close to 0 when A and B are random and independently generated. We derive an upper bound αM for the maximum overlap coefficient permitted in terms of pA(k ) , pB(k ) , and N . Then we present an algorithm based on cross rewiring of links to obtain a two-layer network with any prescribed α inside the range (0 ,αM) . A refined version of the algorithm allows us to minimize the cross-layer correlations that unavoidably appear for values of α beyond a critical overlap αc<αM . Finally, we present a very simple example of a susceptible-infectious-recovered epidemic model with information dissemination and use the algorithms to determine the impact of the overlap on the final outbreak size predicted by the model.
Enhanced hyperuniformity from random reorganization.
Hexner, Daniel; Chaikin, Paul M; Levine, Dov
2017-04-25
Diffusion relaxes density fluctuations toward a uniform random state whose variance in regions of volume [Formula: see text] scales as [Formula: see text] Systems whose fluctuations decay faster, [Formula: see text] with [Formula: see text], are called hyperuniform. The larger [Formula: see text], the more uniform, with systems like crystals achieving the maximum value: [Formula: see text] Although finite temperature equilibrium dynamics will not yield hyperuniform states, driven, nonequilibrium dynamics may. Such is the case, for example, in a simple model where overlapping particles are each given a small random displacement. Above a critical particle density [Formula: see text], the system evolves forever, never finding a configuration where no particles overlap. Below [Formula: see text], however, it eventually finds such a state, and stops evolving. This "absorbing state" is hyperuniform up to a length scale [Formula: see text], which diverges at [Formula: see text] An important question is whether hyperuniformity survives noise and thermal fluctuations. We find that hyperuniformity of the absorbing state is not only robust against noise, diffusion, or activity, but that such perturbations reduce fluctuations toward their limiting behavior, [Formula: see text], a uniformity similar to random close packing and early universe fluctuations, but with arbitrary controllable density.
Translations on North Korea No. 601
1978-07-13
Boosting War Fever"] [Text] On 21 June, with the anniversary of the outbreak of the 24 June war just a few days away, the South Korean puppet clique...conducted the puppet farce of shooting matches between ministerial posts of the puppet adminis- tration, thus boosting war fever. At the war racket site...the puppet "prime minister" led the way in openly inciting war , raving about the "threat of southward aggression," the "nation’s stability" and the
Combinatorial Problems of Applied Discrete Mathematics.
1979-12-01
204 .I (30) 3. Steiner, Combinatorische Aufgabe, Z. Reine Angew. Math. 45 (1853) 18 1—182. (31) IC. Takeuchi, A table of difference sets generating...Assoc. Fr. Ay. Sd . 1 (1900) 122— 123; 2 (1901) 170—203. • (33) R.M. Wilson, Cyclotomy and difference fam ilies in elementary Abelian groups , 3. Number...the differe nt cliques containing either A or B. Let us first introduce the following notations. If A is a vertex in G, then 1(A) denotes the set of
Matching and Vertex Packing: How Hard Are They?
1991-01-01
Theory, 29, Ann. Discrete Math ., North-Holland, Amsterdam, 1986. [2] M.D. Plummer, Matching theory - a sampler: from D~nes K~nig to the present...Ser. B, 28, 1980, 284-304. [20i N. Sbihi, Algorithme de recherche d’un stable de cardinalit6 maximum dans un graphe sans 6toile, Discrete Math ., 29...cliques and by finite families of graphs, Discrete Math ., 49, 1984, 45-59. [92] G. Cornu~jols, D. Hartvigsen and W.R. Pulleyblank, Packing subgraphs in
Kølvraa, Mathias; Müller, Felix C; Jahnsen, Henrik; Rekling, Jens C
2014-01-01
Abstract The inferior olivary nucleus (IO) in in vitro slices from postnatal mice (P5.5–P15.5) spontaneously generates clusters of neurons with synchronous calcium transients, and intracellular recordings from IO neurons suggest that electrical coupling between neighbouring IO neurons may serve as a synchronizing mechanism. Here, we studied the cluster-forming mechanism and find that clusters overlap extensively with an overlap distribution that resembles the distribution for a random overlap model. The average somatodendritic field size of single curly IO neurons was ∼6400 μm2, which is slightly smaller than the average IO cluster size. Eighty-seven neurons with overlapping dendrites were estimated to be contained in the principal olive mean cluster size, and about six non-overlapping curly IO neurons could be contained within the largest clusters. Clusters could also be induced by iontophoresis with glutamate. Induced clusters were inhibited by tetrodotoxin, carbenoxelone and 18β-glycyrrhetinic acid, suggesting that sodium action potentials and electrical coupling are involved in glutamate-induced cluster formation, which could also be induced by activation of N-methyl-d-aspartate and α-amino-3-hydroxy-5-methyl-4-isoxazolepropionic acid receptors. Spikelets and a small transient depolarizing response were observed during glutamate-induced cluster formation. Calcium transients spread with decreasing velocity during cluster formation, and somatic action potentials and cluster formation are accompanied by large dendritic calcium transients. In conclusion, cluster formation depends on gap junctions, sodium action potentials and spontaneous clusters occur randomly throughout the IO. The relative slow signal spread during cluster formation, combined with a strong dendritic influx of calcium, may signify that active dendritic properties contribute to cluster formation. PMID:24042500
NASA Technical Reports Server (NTRS)
Oreopoulos, Lazaros; Lee, Dongmin; Norris, Peter; Yuan, Tianle
2011-01-01
It has been shown that the details of how cloud fraction overlap is treated in GCMs has substantial impact on shortwave and longwave fluxes. Because cloud condensate is also horizontally heterogeneous at GCM grid scales, another aspect of cloud overlap should in principle also be assessed, namely the vertical overlap of hydrometeor distributions. This type of overlap is usually examined in terms of rank correlations, i.e., linear correlations between hydrometeor amount ranks of the overlapping parts of cloud layers at specific separation distances. The cloud fraction overlap parameter and the rank correlation of hydrometeor amounts can be both expressed as inverse exponential functions of separation distance characterized by their respective decorrelation lengths (e-folding distances). Larger decorrelation lengths mean that hydrometeor fractions and probability distribution functions have high levels of vertical alignment. An analysis of CloudSat and CALIPSO data reveals that the two aspects of cloud overlap are related and their respective decorrelation lengths have a distinct dependence on latitude that can be parameterized and included in a GCM. In our presentation we will contrast the Cloud Radiative Effect (CRE) of the GEOS-5 atmospheric GCM (AGCM) when the observationally-based parameterization of decorrelation lengths is used to represent overlap versus the simpler cases of maximum-random overlap and globally constant decorrelation lengths. The effects of specific overlap representations will be examined for both diagnostic and interactive radiation runs in GEOS-5 and comparisons will be made with observed CREs from CERES and CloudSat (2B-FLXHR product). Since the radiative effects of overlap depend on the cloud property distributions of the AGCM, the availability of two different cloud schemes in GEOS-5 will give us the opportunity to assess a wide range of potential cloud overlap consequences on the model's climate.
Do online social media cut through the constraints that limit the size of offline social networks?
Dunbar, R. I. M.
2016-01-01
The social brain hypothesis has suggested that natural social network sizes may have a characteristic size in humans. This is determined in part by cognitive constraints and in part by the time costs of servicing relationships. Online social networking offers the potential to break through the glass ceiling imposed by at least the second of these, potentially enabling us to maintain much larger social networks. This is tested using two separate UK surveys, each randomly stratified by age, gender and regional population size. The data show that the size and range of online egocentric social networks, indexed as the number of Facebook friends, is similar to that of offline face-to-face networks. For one sample, respondents also specified the number of individuals in the inner layers of their network (formally identified as support clique and sympathy group), and these were also similar in size to those observed in offline networks. This suggests that, as originally proposed by the social brain hypothesis, there is a cognitive constraint on the size of social networks that even the communication advantages of online media are unable to overcome. In practical terms, it may reflect the fact that real (as opposed to casual) relationships require at least occasional face-to-face interaction to maintain them. PMID:26909163
NeAT: a toolbox for the analysis of biological networks, clusters, classes and pathways.
Brohée, Sylvain; Faust, Karoline; Lima-Mendez, Gipsi; Sand, Olivier; Janky, Rekin's; Vanderstocken, Gilles; Deville, Yves; van Helden, Jacques
2008-07-01
The network analysis tools (NeAT) (http://rsat.ulb.ac.be/neat/) provide a user-friendly web access to a collection of modular tools for the analysis of networks (graphs) and clusters (e.g. microarray clusters, functional classes, etc.). A first set of tools supports basic operations on graphs (comparison between two graphs, neighborhood of a set of input nodes, path finding and graph randomization). Another set of programs makes the connection between networks and clusters (graph-based clustering, cliques discovery and mapping of clusters onto a network). The toolbox also includes programs for detecting significant intersections between clusters/classes (e.g. clusters of co-expression versus functional classes of genes). NeAT are designed to cope with large datasets and provide a flexible toolbox for analyzing biological networks stored in various databases (protein interactions, regulation and metabolism) or obtained from high-throughput experiments (two-hybrid, mass-spectrometry and microarrays). The web interface interconnects the programs in predefined analysis flows, enabling to address a series of questions about networks of interest. Each tool can also be used separately by entering custom data for a specific analysis. NeAT can also be used as web services (SOAP/WSDL interface), in order to design programmatic workflows and integrate them with other available resources.
Densification and structural transitions in networks that grow by node copying
NASA Astrophysics Data System (ADS)
Bhat, U.; Krapivsky, P. L.; Lambiotte, R.; Redner, S.
2016-12-01
We introduce a growing network model, the copying model, in which a new node attaches to a randomly selected target node and, in addition, independently to each of the neighbors of the target with copying probability p . When p <1/2 , this algorithm generates sparse networks, in which the average node degree is finite. A power-law degree distribution also arises, with a nonuniversal exponent whose value is determined by a transcendental equation in p . In the sparse regime, the network is "normal," e.g., the relative fluctuations in the number of links are asymptotically negligible. For p ≥1/2 , the emergent networks are dense (the average degree increases with the number of nodes N ), and they exhibit intriguing structural behaviors. In particular, the N dependence of the number of m cliques (complete subgraphs of m nodes) undergoes m -1 transitions from normal to progressively more anomalous behavior at an m -dependent critical values of p . Different realizations of the network, which start from the same initial state, exhibit macroscopic fluctuations in the thermodynamic limit: absence of self-averaging. When linking to second neighbors of the target node can occur, the number of links asymptotically grows as N2 as N →∞ , so that the network is effectively complete as N →∞ .
NASA Technical Reports Server (NTRS)
Mengshoel, Ole J.; Wilkins, David C.; Roth, Dan
2010-01-01
For hard computational problems, stochastic local search has proven to be a competitive approach to finding optimal or approximately optimal problem solutions. Two key research questions for stochastic local search algorithms are: Which algorithms are effective for initialization? When should the search process be restarted? In the present work we investigate these research questions in the context of approximate computation of most probable explanations (MPEs) in Bayesian networks (BNs). We introduce a novel approach, based on the Viterbi algorithm, to explanation initialization in BNs. While the Viterbi algorithm works on sequences and trees, our approach works on BNs with arbitrary topologies. We also give a novel formalization of stochastic local search, with focus on initialization and restart, using probability theory and mixture models. Experimentally, we apply our methods to the problem of MPE computation, using a stochastic local search algorithm known as Stochastic Greedy Search. By carefully optimizing both initialization and restart, we reduce the MPE search time for application BNs by several orders of magnitude compared to using uniform at random initialization without restart. On several BNs from applications, the performance of Stochastic Greedy Search is competitive with clique tree clustering, a state-of-the-art exact algorithm used for MPE computation in BNs.
Do online social media cut through the constraints that limit the size of offline social networks?
Dunbar, R I M
2016-01-01
The social brain hypothesis has suggested that natural social network sizes may have a characteristic size in humans. This is determined in part by cognitive constraints and in part by the time costs of servicing relationships. Online social networking offers the potential to break through the glass ceiling imposed by at least the second of these, potentially enabling us to maintain much larger social networks. This is tested using two separate UK surveys, each randomly stratified by age, gender and regional population size. The data show that the size and range of online egocentric social networks, indexed as the number of Facebook friends, is similar to that of offline face-to-face networks. For one sample, respondents also specified the number of individuals in the inner layers of their network (formally identified as support clique and sympathy group), and these were also similar in size to those observed in offline networks. This suggests that, as originally proposed by the social brain hypothesis, there is a cognitive constraint on the size of social networks that even the communication advantages of online media are unable to overcome. In practical terms, it may reflect the fact that real (as opposed to casual) relationships require at least occasional face-to-face interaction to maintain them.
Luenser, Arne; Schurkus, Henry F; Ochsenfeld, Christian
2017-04-11
A reformulation of the random phase approximation within the resolution-of-the-identity (RI) scheme is presented, that is competitive to canonical molecular orbital RI-RPA already for small- to medium-sized molecules. For electronically sparse systems drastic speedups due to the reduced scaling behavior compared to the molecular orbital formulation are demonstrated. Our reformulation is based on two ideas, which are independently useful: First, a Cholesky decomposition of density matrices that reduces the scaling with basis set size for a fixed-size molecule by one order, leading to massive performance improvements. Second, replacement of the overlap RI metric used in the original AO-RPA by an attenuated Coulomb metric. Accuracy is significantly improved compared to the overlap metric, while locality and sparsity of the integrals are retained, as is the effective linear scaling behavior.
A common mode of origin of power laws in models of market and earthquake
NASA Astrophysics Data System (ADS)
Bhattacharyya, Pratip; Chatterjee, Arnab; Chakrabarti, Bikas K.
2007-07-01
We show that there is a common mode of origin for the power laws observed in two different models: (i) the Pareto law for the distribution of money among the agents with random-saving propensities in an ideal gas-like market model and (ii) the Gutenberg-Richter law for the distribution of overlaps in a fractal-overlap model for earthquakes. We find that the power laws appear as the asymptotic forms of ever-widening log-normal distributions for the agents’ money and the overlap magnitude, respectively. The identification of the generic origin of the power laws helps in better understanding and in developing generalized views of phenomena in such diverse areas as economics and geophysics.
Finite Size Corrections to the Parisi Overlap Function in the GREM
NASA Astrophysics Data System (ADS)
Derrida, Bernard; Mottishaw, Peter
2018-01-01
We investigate the effects of finite size corrections on the overlap probabilities in the Generalized Random Energy Model in two situations where replica symmetry is broken in the thermodynamic limit. Our calculations do not use replicas, but shed some light on what the replica method should give for finite size corrections. In the gradual freezing situation, which is known to exhibit full replica symmetry breaking, we show that the finite size corrections lead to a modification of the simple relations between the sample averages of the overlaps Y_k between k configurations predicted by replica theory. This can be interpreted as fluctuations in the replica block size with a negative variance. The mechanism is similar to the one we found recently in the random energy model in Derrida and Mottishaw (J Stat Mech 2015(1): P01021, 2015). We also consider a simultaneous freezing situation, which is known to exhibit one step replica symmetry breaking. We show that finite size corrections lead to full replica symmetry breaking and give a more complete derivation of the results presented in Derrida and Mottishaw (Europhys Lett 115(4): 40005, 2016) for the directed polymer on a tree.
NASA Astrophysics Data System (ADS)
Hillman, B. R.; Marchand, R.; Ackerman, T. P.
2016-12-01
Satellite instrument simulators have emerged as a means to reduce errors in model evaluation by producing simulated or psuedo-retrievals from model fields, which account for limitations in the satellite retrieval process. Because of the mismatch in resolved scales between satellite retrievals and large-scale models, model cloud fields must first be downscaled to scales consistent with satellite retrievals. This downscaling is analogous to that required for model radiative transfer calculations. The assumption is often made in both model radiative transfer codes and satellite simulators that the unresolved clouds follow maximum-random overlap with horizontally homogeneous cloud condensate amounts. We examine errors in simulated MISR and CloudSat retrievals that arise due to these assumptions by applying the MISR and CloudSat simulators to cloud resolving model (CRM) output generated by the Super-parameterized Community Atmosphere Model (SP-CAM). Errors are quantified by comparing simulated retrievals performed directly on the CRM fields with those simulated by first averaging the CRM fields to approximately 2-degree resolution, applying a "subcolumn generator" to regenerate psuedo-resolved cloud and precipitation condensate fields, and then applying the MISR and CloudSat simulators on the regenerated condensate fields. We show that errors due to both assumptions of maximum-random overlap and homogeneous condensate are significant (relative to uncertainties in the observations and other simulator limitations). The treatment of precipitation is particularly problematic for CloudSat-simulated radar reflectivity. We introduce an improved subcolumn generator for use with the simulators, and show that these errors can be greatly reduced by replacing the maximum-random overlap assumption with the more realistic generalized overlap and incorporating a simple parameterization of subgrid-scale cloud and precipitation condensate heterogeneity. Sandia National Laboratories is a multi-program laboratory managed and operated by Sandia Corporation, a wholly owned subsidiary of Lockheed Martin Corporation, for the U.S. Department of Energy's National Nuclear Security Administration under contract DE-AC04-94AL85000. SAND NO. SAND2016-7485 A
Genome-wide screen identifies a novel prognostic signature for breast cancer survival
Mao, Xuan Y.; Lee, Matthew J.; Zhu, Jeffrey; ...
2017-01-21
Large genomic datasets in combination with clinical data can be used as an unbiased tool to identify genes important in patient survival and discover potential therapeutic targets. We used a genome-wide screen to identify 587 genes significantly and robustly deregulated across four independent breast cancer (BC) datasets compared to normal breast tissue. Gene expression of 381 genes was significantly associated with relapse-free survival (RFS) in BC patients. We used a gene co-expression network approach to visualize the genetic architecture in normal breast and BCs. In normal breast tissue, co-expression cliques were identified enriched for cell cycle, gene transcription, cell adhesion,more » cytoskeletal organization and metabolism. In contrast, in BC, only two major co-expression cliques were identified enriched for cell cycle-related processes or blood vessel development, cell adhesion and mammary gland development processes. Interestingly, gene expression levels of 7 genes were found to be negatively correlated with many cell cycle related genes, highlighting these genes as potential tumor suppressors and novel therapeutic targets. A forward-conditional Cox regression analysis was used to identify a 12-gene signature associated with RFS. A prognostic scoring system was created based on the 12-gene signature. This scoring system robustly predicted BC patient RFS in 60 sampling test sets and was further validated in TCGA and METABRIC BC data. Our integrated study identified a 12-gene prognostic signature that could guide adjuvant therapy for BC patients and includes novel potential molecular targets for therapy.« less
Visual Odometry Based on Structural Matching of Local Invariant Features Using Stereo Camera Sensor
Núñez, Pedro; Vázquez-Martín, Ricardo; Bandera, Antonio
2011-01-01
This paper describes a novel sensor system to estimate the motion of a stereo camera. Local invariant image features are matched between pairs of frames and linked into image trajectories at video rate, providing the so-called visual odometry, i.e., motion estimates from visual input alone. Our proposal conducts two matching sessions: the first one between sets of features associated to the images of the stereo pairs and the second one between sets of features associated to consecutive frames. With respect to previously proposed approaches, the main novelty of this proposal is that both matching algorithms are conducted by means of a fast matching algorithm which combines absolute and relative feature constraints. Finding the largest-valued set of mutually consistent matches is equivalent to finding the maximum-weighted clique on a graph. The stereo matching allows to represent the scene view as a graph which emerge from the features of the accepted clique. On the other hand, the frame-to-frame matching defines a graph whose vertices are features in 3D space. The efficiency of the approach is increased by minimizing the geometric and algebraic errors to estimate the final displacement of the stereo camera between consecutive acquired frames. The proposed approach has been tested for mobile robotics navigation purposes in real environments and using different features. Experimental results demonstrate the performance of the proposal, which could be applied in both industrial and service robot fields. PMID:22164016
Genome-wide screen identifies a novel prognostic signature for breast cancer survival
DOE Office of Scientific and Technical Information (OSTI.GOV)
Mao, Xuan Y.; Lee, Matthew J.; Zhu, Jeffrey
Large genomic datasets in combination with clinical data can be used as an unbiased tool to identify genes important in patient survival and discover potential therapeutic targets. We used a genome-wide screen to identify 587 genes significantly and robustly deregulated across four independent breast cancer (BC) datasets compared to normal breast tissue. Gene expression of 381 genes was significantly associated with relapse-free survival (RFS) in BC patients. We used a gene co-expression network approach to visualize the genetic architecture in normal breast and BCs. In normal breast tissue, co-expression cliques were identified enriched for cell cycle, gene transcription, cell adhesion,more » cytoskeletal organization and metabolism. In contrast, in BC, only two major co-expression cliques were identified enriched for cell cycle-related processes or blood vessel development, cell adhesion and mammary gland development processes. Interestingly, gene expression levels of 7 genes were found to be negatively correlated with many cell cycle related genes, highlighting these genes as potential tumor suppressors and novel therapeutic targets. A forward-conditional Cox regression analysis was used to identify a 12-gene signature associated with RFS. A prognostic scoring system was created based on the 12-gene signature. This scoring system robustly predicted BC patient RFS in 60 sampling test sets and was further validated in TCGA and METABRIC BC data. Our integrated study identified a 12-gene prognostic signature that could guide adjuvant therapy for BC patients and includes novel potential molecular targets for therapy.« less
Yu, Bin; Xu, Jia-Meng; Li, Shan; Chen, Cheng; Chen, Rui-Xin; Wang, Lei; Zhang, Yan; Wang, Ming-Hui
2017-01-01
Gene regulatory networks (GRNs) research reveals complex life phenomena from the perspective of gene interaction, which is an important research field in systems biology. Traditional Bayesian networks have a high computational complexity, and the network structure scoring model has a single feature. Information-based approaches cannot identify the direction of regulation. In order to make up for the shortcomings of the above methods, this paper presents a novel hybrid learning method (DBNCS) based on dynamic Bayesian network (DBN) to construct the multiple time-delayed GRNs for the first time, combining the comprehensive score (CS) with the DBN model. DBNCS algorithm first uses CMI2NI (conditional mutual inclusive information-based network inference) algorithm for network structure profiles learning, namely the construction of search space. Then the redundant regulations are removed by using the recursive optimization algorithm (RO), thereby reduce the false positive rate. Secondly, the network structure profiles are decomposed into a set of cliques without loss, which can significantly reduce the computational complexity. Finally, DBN model is used to identify the direction of gene regulation within the cliques and search for the optimal network structure. The performance of DBNCS algorithm is evaluated by the benchmark GRN datasets from DREAM challenge as well as the SOS DNA repair network in Escherichia coli, and compared with other state-of-the-art methods. The experimental results show the rationality of the algorithm design and the outstanding performance of the GRNs. PMID:29113310
Yu, Bin; Xu, Jia-Meng; Li, Shan; Chen, Cheng; Chen, Rui-Xin; Wang, Lei; Zhang, Yan; Wang, Ming-Hui
2017-10-06
Gene regulatory networks (GRNs) research reveals complex life phenomena from the perspective of gene interaction, which is an important research field in systems biology. Traditional Bayesian networks have a high computational complexity, and the network structure scoring model has a single feature. Information-based approaches cannot identify the direction of regulation. In order to make up for the shortcomings of the above methods, this paper presents a novel hybrid learning method (DBNCS) based on dynamic Bayesian network (DBN) to construct the multiple time-delayed GRNs for the first time, combining the comprehensive score (CS) with the DBN model. DBNCS algorithm first uses CMI2NI (conditional mutual inclusive information-based network inference) algorithm for network structure profiles learning, namely the construction of search space. Then the redundant regulations are removed by using the recursive optimization algorithm (RO), thereby reduce the false positive rate. Secondly, the network structure profiles are decomposed into a set of cliques without loss, which can significantly reduce the computational complexity. Finally, DBN model is used to identify the direction of gene regulation within the cliques and search for the optimal network structure. The performance of DBNCS algorithm is evaluated by the benchmark GRN datasets from DREAM challenge as well as the SOS DNA repair network in Escherichia coli , and compared with other state-of-the-art methods. The experimental results show the rationality of the algorithm design and the outstanding performance of the GRNs.
NASA Technical Reports Server (NTRS)
Mengshoel, Ole J.; Roth, Dan; Wilkins, David C.
2001-01-01
Portfolio methods support the combination of different algorithms and heuristics, including stochastic local search (SLS) heuristics, and have been identified as a promising approach to solve computationally hard problems. While successful in experiments, theoretical foundations and analytical results for portfolio-based SLS heuristics are less developed. This article aims to improve the understanding of the role of portfolios of heuristics in SLS. We emphasize the problem of computing most probable explanations (MPEs) in Bayesian networks (BNs). Algorithmically, we discuss a portfolio-based SLS algorithm for MPE computation, Stochastic Greedy Search (SGS). SGS supports the integration of different initialization operators (or initialization heuristics) and different search operators (greedy and noisy heuristics), thereby enabling new analytical and experimental results. Analytically, we introduce a novel Markov chain model tailored to portfolio-based SLS algorithms including SGS, thereby enabling us to analytically form expected hitting time results that explain empirical run time results. For a specific BN, we show the benefit of using a homogenous initialization portfolio. To further illustrate the portfolio approach, we consider novel additive search heuristics for handling determinism in the form of zero entries in conditional probability tables in BNs. Our additive approach adds rather than multiplies probabilities when computing the utility of an explanation. We motivate the additive measure by studying the dramatic impact of zero entries in conditional probability tables on the number of zero-probability explanations, which again complicates the search process. We consider the relationship between MAXSAT and MPE, and show that additive utility (or gain) is a generalization, to the probabilistic setting, of MAXSAT utility (or gain) used in the celebrated GSAT and WalkSAT algorithms and their descendants. Utilizing our Markov chain framework, we show that expected hitting time is a rational function - i.e. a ratio of two polynomials - of the probability of applying an additive search operator. Experimentally, we report on synthetically generated BNs as well as BNs from applications, and compare SGSs performance to that of Hugin, which performs BN inference by compilation to and propagation in clique trees. On synthetic networks, SGS speeds up computation by approximately two orders of magnitude compared to Hugin. In application networks, our approach is highly competitive in Bayesian networks with a high degree of determinism. In addition to showing that stochastic local search can be competitive with clique tree clustering, our empirical results provide an improved understanding of the circumstances under which portfolio-based SLS outperforms clique tree clustering and vice versa.
Efficiency-enhanced photon sieve using Gaussian/overlapping distribution of pinholes
DOE Office of Scientific and Technical Information (OSTI.GOV)
Sabatyan, A.; Mirzaie, S.
2011-04-10
A class of photon sieve is introduced whose structure is based on the overlapping pinholes in the innermost zones. This kind of distribution is produced by, for example, a particular form of Gaussian function. The focusing property of the proposed model was examined theoretically and experimentally. It is shown that under He-Ne laser and white light illumination, the focal spot size of this novel structure has considerably smaller FWHM than a photon sieve with randomly distributed pinholes and a Fresnel zone plate. In addition, secondary maxima have been suppressed effectively.
A game theoretic algorithm to detect overlapping community structure in networks
NASA Astrophysics Data System (ADS)
Zhou, Xu; Zhao, Xiaohui; Liu, Yanheng; Sun, Geng
2018-04-01
Community detection can be used as an important technique for product and personalized service recommendation. A game theory based approach to detect overlapping community structure is introduced in this paper. The process of the community formation is converted into a game, when all agents (nodes) cannot improve their own utility, the game process will be terminated. The utility function is composed of a gain and a loss function and we present a new gain function in this paper. In addition, different from choosing action randomly among join, quit and switch for each agent to get new label, two new strategies for each agent to update its label are designed during the game, and the strategies are also evaluated and compared for each agent in order to find its best result. The overlapping community structure is naturally presented when the stop criterion is satisfied. The experimental results demonstrate that the proposed algorithm outperforms other similar algorithms for detecting overlapping communities in networks.
Tunable random lasing behavior in plasmonic nanostructures
NASA Astrophysics Data System (ADS)
Yadav, Ashish; Zhong, Liubiao; Sun, Jun; Jiang, Lin; Cheng, Gary J.; Chi, Lifeng
2017-01-01
Random lasing is desired in plasmonics nanostructures through surface plasmon amplification. In this study, tunable random lasing behavior was observed in dye molecules attached with Au nanorods (NRs), Au nanoparticles (NPs) and Au@Ag nanorods (NRs) respectively. Our experimental investigations showed that all nanostructures i.e., Au@AgNRs, AuNRs & AuNPs have intensive tunable spectral effects. The random lasing has been observed at excitation wavelength 532 nm and varying pump powers. The best random lasing properties were noticed in Au@AgNRs structure, which exhibits broad absorption spectrum, sufficiently overlapping with that of dye Rhodamine B (RhB). Au@AgNRs significantly enhance the tunable spectral behavior through localized electromagnetic field and scattering. The random lasing in Au@AgNRs provides an efficient coherent feedback for random lasers.
NASA Technical Reports Server (NTRS)
Mengshoel, Ole Jakob; Poll, Scott; Kurtoglu, Tolga
2009-01-01
This CD contains files that support the talk (see CASI ID 20100021404). There are 24 models that relate to the ADAPT system and 1 Excel worksheet. In the paper an investigation into the use of Bayesian networks to construct large-scale diagnostic systems is described. The high-level specifications, Bayesian networks, clique trees, and arithmetic circuits representing 24 different electrical power systems are described in the talk. The data in the CD are the models of the 24 different power systems.
Gold nanoparticle-based plasmonic random fiber laser
NASA Astrophysics Data System (ADS)
Hu, Zhijia; Liang, Yunyun; Xie, Kang; Gao, Pengfei; Zhang, Douguo; Jiang, Haiming; Shi, Fan; Yin, Leicheng; Gao, Jiangang; Ming, Hai; Zhang, Qijin
2015-03-01
We have reported the realization of a plasmonic random fiber laser based on the localized surface plasmonic resonance of gold nanoparticles (NPs) in the liquid core optical fiber. The liquid core material contains a dispersive solution of gold NPs and laser dye pyrromethene 597 in toluene. It was experimentally proved that the fluorescence quenching of the dye is restrained in the optical fiber, which is considered one of the main sources of loss in the traditional laser system. Meanwhile, the random lasing can be more easily obtained in the random laser system with more overlap between the plasmonic resonance of the gold NPs and the photoluminescence spectrum of the dye molecules.
Analysis of self-overlap reveals trade-offs in plankton swimming trajectories
Bianco, Giuseppe; Mariani, Patrizio; Visser, Andre W.; Mazzocchi, Maria Grazia; Pigolotti, Simone
2014-01-01
Movement is a fundamental behaviour of organisms that not only brings about beneficial encounters with resources and mates, but also at the same time exposes the organism to dangerous encounters with predators. The movement patterns adopted by organisms should reflect a balance between these contrasting processes. This trade-off can be hypothesized as being evident in the behaviour of plankton, which inhabit a dilute three-dimensional environment with few refuges or orienting landmarks. We present an analysis of the swimming path geometries based on a volumetric Monte Carlo sampling approach, which is particularly adept at revealing such trade-offs by measuring the self-overlap of the trajectories. Application of this method to experimentally measured trajectories reveals that swimming patterns in copepods are shaped to efficiently explore volumes at small scales, while achieving a large overlap at larger scales. Regularities in the observed trajectories make the transition between these two regimes always sharper than in randomized trajectories or as predicted by random walk theory. Thus, real trajectories present a stronger separation between exploration for food and exposure to predators. The specific scale and features of this transition depend on species, gender and local environmental conditions, pointing at adaptation to state and stage-dependent evolutionary trade-offs. PMID:24789560
Detector Design Considerations in High-Dimensional Artificial Immune Systems
2012-03-22
a method known as randomized RNS [15]. In this approach, Monte Carlo integration is used to determine the size of self and non-self within the given...feature space, then a number of randomly placed detectors are chosen according to Monte Carlo integration calculations. Simulated annealing is then...detector is only counted once). This value is termed ‘actual content’ because it does not including overlapping content, but only that content that is
A BASIC Program for Use in Teaching Population Dynamics.
ERIC Educational Resources Information Center
Kidd, N. A. C.
1984-01-01
Describes an interactive simulation model which can be used to demonstrate population growth with discrete or overlapping populations and the effects of random, constant, or density-dependent mortality. The program listing (for Commodore PET 4032 microcomputer) is included. (Author/DH)
Network analysis of the COSMOS galaxy field
NASA Astrophysics Data System (ADS)
de Regt, R.; Apunevych, S.; von Ferber, C.; Holovatch, Yu; Novosyadlyj, B.
2018-07-01
The galaxy data provided by COSMOS survey for 1°×1° field of sky are analysed by methods of complex networks. Three galaxy samples (slices) with redshifts ranging within intervals 0.88÷0.91, 0.91÷0.94, and 0.94÷0.97 are studied as two-dimensional projections for the spatial distributions of galaxies. We construct networks and calculate network measures for each sample, in order to analyse the network similarity of different samples, distinguish various topological environments, and find associations between galaxy properties (colour index and stellar mass) and their topological environments. Results indicate a high level of similarity between geometry and topology for different galaxy samples and no clear evidence of evolutionary trends in network measures. The distribution of local clustering coefficient C manifests three modes which allow for discrimination between stand-alone singlets and dumbbells (0 ≤ C ≤ 0.1), intermediately packed (0.1 < C < 0.9) and clique (0.9 ≤ C ≤ 1) like galaxies. Analysing astrophysical properties of galaxies (colour index and stellar masses), we show that distributions are similar in all slices, however weak evolutionary trends can also be seen across redshift slices. To specify different topological environments, we have extracted selections of galaxies from each sample according to different modes of C distribution. We have found statistically significant associations between evolutionary parameters of galaxies and selections of C: the distribution of stellar mass for galaxies with interim C differs from the corresponding distributions for stand-alone and clique galaxies, and this difference holds for all redshift slices. The colour index realizes somewhat different behaviour.
NASA Astrophysics Data System (ADS)
Zhu, Yueying; Alexandre Wang, Qiuping; Li, Wei; Cai, Xu
2017-09-01
The formation of continuous opinion dynamics is investigated based on a virtual gambling mechanism where agents fight for a limited resource. We propose a model with agents holding opinions between -1 and 1. Agents are segregated into two cliques according to the sign of their opinions. Local communication happens only when the opinion distance between corresponding agents is no larger than a pre-defined confidence threshold. Theoretical analysis regarding special cases provides a deep understanding of the roles of both the resource allocation parameter and confidence threshold in the formation of opinion dynamics. For a sparse network, the evolution of opinion dynamics is negligible in the region of low confidence threshold when the mindless agents are absent. Numerical results also imply that, in the presence of economic agents, high confidence threshold is required for apparent clustering of agents in opinion. Moreover, a consensus state is generated only when the following three conditions are satisfied simultaneously: mindless agents are absent, the resource is concentrated in one clique, and confidence threshold tends to a critical value(=1.25+2/ka ; k_a>8/3 , the average number of friends of individual agents). For fixed a confidence threshold and resource allocation parameter, the most chaotic steady state of the dynamics happens when the fraction of mindless agents is about 0.7. It is also demonstrated that economic agents are more likely to win at gambling, compared to mindless ones. Finally, the importance of three involved parameters in establishing the uncertainty of model response is quantified in terms of Latin hypercube sampling-based sensitivity analysis.
Soulakis, Nicholas D; Carson, Matthew B; Lee, Young Ji; Schneider, Daniel H; Skeehan, Connor T; Scholtens, Denise M
2015-03-01
To visualize and describe collaborative electronic health record (EHR) usage for hospitalized patients with heart failure. We identified records of patients with heart failure and all associated healthcare provider record usage through queries of the Northwestern Medicine Enterprise Data Warehouse. We constructed a network by equating access and updates of a patient's EHR to a provider-patient interaction. We then considered shared patient record access as the basis for a second network that we termed the provider collaboration network. We calculated network statistics, the modularity of provider interactions, and provider cliques. We identified 548 patient records accessed by 5113 healthcare providers in 2012. The provider collaboration network had 1504 nodes and 83 998 edges. We identified 7 major provider collaboration modules. Average clique size was 87.9 providers. We used a graph database to demonstrate an ad hoc query of our provider-patient network. Our analysis suggests a large number of healthcare providers across a wide variety of professions access records of patients with heart failure during their hospital stay. This shared record access tends to take place not only in a pairwise manner but also among large groups of providers. EHRs encode valuable interactions, implicitly or explicitly, between patients and providers. Network analysis provided strong evidence of multidisciplinary record access of patients with heart failure across teams of 100+ providers. Further investigation may lead to clearer understanding of how record access information can be used to strategically guide care coordination for patients hospitalized for heart failure. © The Author 2015. Published by Oxford University Press on behalf of the American Medical Informatics Association.
Modeling Temporal Variation in Social Network: An Evolutionary Web Graph Approach
NASA Astrophysics Data System (ADS)
Mitra, Susanta; Bagchi, Aditya
A social network is a social structure between actors (individuals, organization or other social entities) and indicates the ways in which they are connected through various social relationships like friendships, kinships, professional, academic etc. Usually, a social network represents a social community, like a club and its members or a city and its citizens etc. or a research group communicating over Internet. In seventies Leinhardt [1] first proposed the idea of representing a social community by a digraph. Later, this idea became popular among other research workers like, network designers, web-service application developers and e-learning modelers. It gave rise to a rapid proliferation of research work in the area of social network analysis. Some of the notable structural properties of a social network are connectedness between actors, reachability between a source and a target actor, reciprocity or pair-wise connection between actors with bi-directional links, centrality of actors or the important actors having high degree or more connections and finally the division of actors into sub-structures or cliques or strongly-connected components. The cycles present in a social network may even be nested [2, 3]. The formal definition of these structural properties will be provided in Sect. 8.2.1. The division of actors into cliques or sub-groups can be a very important factor for understanding a social structure, particularly the degree of cohesiveness in a community. The number, size, and connections among the sub-groups in a network are useful in understanding how the network, as a whole, is likely to behave.
Network analysis of the COSMOS galaxy field
NASA Astrophysics Data System (ADS)
de Regt, R.; Apunevych, S.; Ferber, C. von; Holovatch, Yu; Novosyadlyj, B.
2018-03-01
The galaxy data provided by COSMOS survey for 1° × 1° field of sky are analysed by methods of complex networks. Three galaxy samples (slices) with redshifts ranging within intervals 0.88÷0.91, 0.91÷0.94 and 0.94÷0.97 are studied as two-dimensional projections for the spatial distributions of galaxies. We construct networks and calculate network measures for each sample, in order to analyse the network similarity of different samples, distinguish various topological environments, and find associations between galaxy properties (colour index and stellar mass) and their topological environments. Results indicate a high level of similarity between geometry and topology for different galaxy samples and no clear evidence of evolutionary trends in network measures. The distribution of local clustering coefficient C manifests three modes which allow for discrimination between stand-alone singlets and dumbbells (0 ≤ C ≤ 0.1), intermediately packed (0.1 < C < 0.9) and clique (0.9 ≤ C ≤ 1) like galaxies. Analysing astrophysical properties of galaxies (colour index and stellar masses), we show that distributions are similar in all slices, however weak evolutionary trends can also be seen across redshift slices. To specify different topological environments we have extracted selections of galaxies from each sample according to different modes of C distribution. We have found statistically significant associations between evolutionary parameters of galaxies and selections of C: the distribution of stellar mass for galaxies with interim C differ from the corresponding distributions for stand-alone and clique galaxies, and this difference holds for all redshift slices. The colour index realises somewhat different behaviour.
NASA Astrophysics Data System (ADS)
Forgan, Duncan H.
2017-10-01
The Zoo solution to Fermi's Paradox proposes that extraterrestrial intelligences (ETIs) have agreed to not contact the Earth. The strength of this solution depends on the ability for ETIs to come to agreement, and establish/police treaties as part of a so-called `Galactic Club'. These activities are principally limited by the causal connectivity of a civilization to its neighbours at its inception, i.e. whether it comes to prominence being aware of other ETIs and any treaties or agreements in place. If even one civilization is not causally connected to the other members of a treaty, then they are free to operate beyond it and contact the Earth if wished, which makes the Zoo solution `soft'. We should therefore consider how likely this scenario is, as this will give us a sense of the Zoo solution's softness, or general validity. We implement a simple toy model of ETIs arising in a Galactic Habitable Zone, and calculate the properties of the groups of culturally connected civilizations established therein. We show that for most choices of civilization parameters, the number of culturally connected groups is >1, meaning that the Galaxy is composed of multiple Galactic Cliques rather than a single Galactic Club. We find in our models for a single Galactic Club to establish interstellar hegemony, the number of civilizations must be relatively large, the mean civilization lifetime must be several millions of years, and the inter-arrival time between civilizations must be a few million years or less.
Convergence to equilibrium under a random Hamiltonian.
Brandão, Fernando G S L; Ćwikliński, Piotr; Horodecki, Michał; Horodecki, Paweł; Korbicz, Jarosław K; Mozrzymas, Marek
2012-09-01
We analyze equilibration times of subsystems of a larger system under a random total Hamiltonian, in which the basis of the Hamiltonian is drawn from the Haar measure. We obtain that the time of equilibration is of the order of the inverse of the arithmetic average of the Bohr frequencies. To compute the average over a random basis, we compute the inverse of a matrix of overlaps of operators which permute four systems. We first obtain results on such a matrix for a representation of an arbitrary finite group and then apply it to the particular representation of the permutation group under consideration.
Convergence to equilibrium under a random Hamiltonian
NASA Astrophysics Data System (ADS)
Brandão, Fernando G. S. L.; Ćwikliński, Piotr; Horodecki, Michał; Horodecki, Paweł; Korbicz, Jarosław K.; Mozrzymas, Marek
2012-09-01
We analyze equilibration times of subsystems of a larger system under a random total Hamiltonian, in which the basis of the Hamiltonian is drawn from the Haar measure. We obtain that the time of equilibration is of the order of the inverse of the arithmetic average of the Bohr frequencies. To compute the average over a random basis, we compute the inverse of a matrix of overlaps of operators which permute four systems. We first obtain results on such a matrix for a representation of an arbitrary finite group and then apply it to the particular representation of the permutation group under consideration.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Berry, Nina; Ko, Teresa; Shneider, Max
Seldon is an agent-based social simulation framework that uniquely integrates concepts from a variety of different research areas including psychology, social science, and agent-based modeling. Development has been taking place for a number of years, previously focusing on gang and terrorist recruitment. The toolkit consists of simple agents (individuals) and abstract agents (groups of individuals representing social/institutional concepts) that interact according to exchangeable rule sets (i.e. linear attraction, linear reinforcement). Each agent has a set of customizable attributes that get modified during the interactions. Interactions create relationships between agents, and each agent has a maximum amount of relationship energy thatmore » it can expend. As relationships evolve, they form multiple levels of social networks (i.e. acquaintances, friends, cliques) that in turn drive future interactions. Agents can also interact randomly if they are not connected through a network, mimicking the chance interactions that real people have in everyday life. We are currently integrating Seldon with the cognitive framework (also developed at Sandia). Each individual agent has a lightweight cognitive model that is created automatically from textual sources. Cognitive information is exchanged during interactions, and can also be injected into a running simulation. The entire framework has been parallelized to allow for larger simulations in an HPC environment. We have also added more detail to the agents themselves (a"Big Five" personality model) and their interactions (an enhanced relationship model) for a more realistic representation.« less
2012-01-01
Background The three-dimensional structure of a protein can be described as a graph where nodes represent residues and the strength of non-covalent interactions between them are edges. These protein contact networks can be separated into long and short-range interactions networks depending on the positions of amino acids in primary structure. Long-range interactions play a distinct role in determining the tertiary structure of a protein while short-range interactions could largely contribute to the secondary structure formations. In addition, physico chemical properties and the linear arrangement of amino acids of the primary structure of a protein determines its three dimensional structure. Here, we present an extensive analysis of protein contact subnetworks based on the London van der Waals interactions of amino acids at different length scales. We further subdivided those networks in hydrophobic, hydrophilic and charged residues networks and have tried to correlate their influence in the overall topology and organization of a protein. Results The largest connected component (LCC) of long (LRN)-, short (SRN)- and all-range (ARN) networks within proteins exhibit a transition behaviour when plotted against different interaction strengths of edges among amino acid nodes. While short-range networks having chain like structures exhibit highly cooperative transition; long- and all-range networks, which are more similar to each other, have non-chain like structures and show less cooperativity. Further, the hydrophobic residues subnetworks in long- and all-range networks have similar transition behaviours with all residues all-range networks, but the hydrophilic and charged residues networks don’t. While the nature of transitions of LCC’s sizes is same in SRNs for thermophiles and mesophiles, there exists a clear difference in LRNs. The presence of larger size of interconnected long-range interactions in thermophiles than mesophiles, even at higher interaction strength between amino acids, give extra stability to the tertiary structure of the thermophiles. All the subnetworks at different length scales (ARNs, LRNs and SRNs) show assortativity mixing property of their participating amino acids. While there exists a significant higher percentage of hydrophobic subclusters over others in ARNs and LRNs; we do not find the assortative mixing behaviour of any the subclusters in SRNs. The clustering coefficient of hydrophobic subclusters in long-range network is the highest among types of subnetworks. There exist highly cliquish hydrophobic nodes followed by charged nodes in LRNs and ARNs; on the other hand, we observe the highest dominance of charged residues cliques in short-range networks. Studies on the perimeter of the cliques also show higher occurrences of hydrophobic and charged residues’ cliques. Conclusions The simple framework of protein contact networks and their subnetworks based on London van der Waals force is able to capture several known properties of protein structure as well as can unravel several new features. The thermophiles do not only have the higher number of long-range interactions; they also have larger cluster of connected residues at higher interaction strengths among amino acids, than their mesophilic counterparts. It can reestablish the significant role of long-range hydrophobic clusters in protein folding and stabilization; at the same time, it shed light on the higher communication ability of hydrophobic subnetworks over the others. The results give an indication of the controlling role of hydrophobic subclusters in determining protein’s folding rate. The occurrences of higher perimeters of hydrophobic and charged cliques imply the role of charged residues as well as hydrophobic residues in stabilizing the distant part of primary structure of a protein through London van der Waals interaction. PMID:22720789
Correcting Evaluation Bias of Relational Classifiers with Network Cross Validation
2010-01-01
classi- fication algorithms: simple random resampling (RRS), equal-instance random resampling (ERS), and network cross-validation ( NCV ). The first two... NCV procedure that eliminates overlap between test sets altogether. The procedure samples for k disjoint test sets that will be used for evaluation...propLabeled ∗ S) nodes from train Pool in f erenceSet =network − trainSet F = F ∪ < trainSet, test Set, in f erenceSet > end for output: F NCV addresses
Elhanan, Gai; Ochs, Christopher; Mejino, Jose L V; Liu, Hao; Mungall, Christopher J; Perl, Yehoshua
2017-06-01
To examine whether disjoint partial-area taxonomy, a semantically-based evaluation methodology that has been successfully tested in SNOMED CT, will perform with similar effectiveness on Uberon, an anatomical ontology that belongs to a structurally similar family of ontologies as SNOMED CT. A disjoint partial-area taxonomy was generated for Uberon. One hundred randomly selected test concepts that overlap between partial-areas were matched to a same size control sample of non-overlapping concepts. The samples were blindly inspected for non-critical issues and presumptive errors first by a general domain expert whose results were then confirmed or rejected by a highly experienced anatomical ontology domain expert. Reported issues were subsequently reviewed by Uberon's curators. Overlapping concepts in Uberon's disjoint partial-area taxonomy exhibited a significantly higher rate of all issues. Clear-cut presumptive errors trended similarly but did not reach statistical significance. A sub-analysis of overlapping concepts with three or more relationship types indicated a much higher rate of issues. Overlapping concepts from Uberon's disjoint abstraction network are quite likely (up to 28.9%) to exhibit issues. The results suggest that the methodology can transfer well between same family ontologies. Although Uberon exhibited relatively few overlapping concepts, the methodology can be combined with other semantic indicators to expand the process to other concepts within the ontology that will generate high yields of discovered issues. Copyright © 2017 Elsevier B.V. All rights reserved.
Automatic liver segmentation on Computed Tomography using random walkers for treatment planning
Moghbel, Mehrdad; Mashohor, Syamsiah; Mahmud, Rozi; Saripan, M. Iqbal Bin
2016-01-01
Segmentation of the liver from Computed Tomography (CT) volumes plays an important role during the choice of treatment strategies for liver diseases. Despite lots of attention, liver segmentation remains a challenging task due to the lack of visible edges on most boundaries of the liver coupled with high variability of both intensity patterns and anatomical appearances with all these difficulties becoming more prominent in pathological livers. To achieve a more accurate segmentation, a random walker based framework is proposed that can segment contrast-enhanced livers CT images with great accuracy and speed. Based on the location of the right lung lobe, the liver dome is automatically detected thus eliminating the need for manual initialization. The computational requirements are further minimized utilizing rib-caged area segmentation, the liver is then extracted by utilizing random walker method. The proposed method was able to achieve one of the highest accuracies reported in the literature against a mixed healthy and pathological liver dataset compared to other segmentation methods with an overlap error of 4.47 % and dice similarity coefficient of 0.94 while it showed exceptional accuracy on segmenting the pathological livers with an overlap error of 5.95 % and dice similarity coefficient of 0.91. PMID:28096782
Standard, Random, and Optimum Array conversions from Two-Pole resistance data
Rucker, D. F.; Glaser, Danney R.
2014-09-01
We present an array evaluation of standard and nonstandard arrays over a hydrogeological target. We develop the arrays by linearly combining data from the pole-pole (or 2-pole) array. The first test shows that reconstructed resistances for the standard Schlumberger and dipoledipole arrays are equivalent or superior to the measured arrays in terms of noise, especially at large geometric factors. The inverse models for the standard arrays also confirm what others have presented in terms of target resolvability, namely the dipole-dipole array has the highest resolution. In the second test, we reconstruct random electrode combinations from the 2-pole data segregated intomore » inner, outer, and overlapping dipoles. The resistance data and inverse models from these randomized arrays show those with inner dipoles to be superior in terms of noise and resolution and that overlapping dipoles can cause model instability and low resolution. Finally, we use the 2-pole data to create an optimized array that maximizes the model resolution matrix for a given electrode geometry. The optimized array produces the highest resolution and target detail. Thus, the tests demonstrate that high quality data and high model resolution can be achieved by acquiring field data from the pole-pole array.« less
Inferring gene ontologies from pairwise similarity data
Kramer, Michael; Dutkowski, Janusz; Yu, Michael; Bafna, Vineet; Ideker, Trey
2014-01-01
Motivation: While the manually curated Gene Ontology (GO) is widely used, inferring a GO directly from -omics data is a compelling new problem. Recognizing that ontologies are a directed acyclic graph (DAG) of terms and hierarchical relations, algorithms are needed that: analyze a full matrix of gene–gene pairwise similarities from -omics data;infer true hierarchical structure in these data rather than enforcing hierarchy as a computational artifact; andrespect biological pleiotropy, by which a term in the hierarchy can relate to multiple higher level terms. Methods addressing these requirements are just beginning to emerge—none has been evaluated for GO inference. Methods: We consider two algorithms [Clique Extracted Ontology (CliXO), LocalFitness] that uniquely satisfy these requirements, compared with methods including standard clustering. CliXO is a new approach that finds maximal cliques in a network induced by progressive thresholding of a similarity matrix. We evaluate each method’s ability to reconstruct the GO biological process ontology from a similarity matrix based on (a) semantic similarities for GO itself or (b) three -omics datasets for yeast. Results: For task (a) using semantic similarity, CliXO accurately reconstructs GO (>99% precision, recall) and outperforms other approaches (<20% precision, <20% recall). For task (b) using -omics data, CliXO outperforms other methods using two -omics datasets and achieves ∼30% precision and recall using YeastNet v3, similar to an earlier approach (Network Extracted Ontology) and better than LocalFitness or standard clustering (20–25% precision, recall). Conclusion: This study provides algorithmic foundation for building gene ontologies by capturing hierarchical and pleiotropic structure embedded in biomolecular data. Contact: tideker@ucsd.edu PMID:24932003
Urbanoski, Karen; van Mierlo, Trevor; Cunningham, John
2017-10-01
This study contributes to emerging literature on online health networks by modeling communication patterns between members of a moderated online support group for problem drinking. Using social network analysis, we described members' patterns of joint participation in threads, parsing out the role of site moderators, and explored differences in member characteristics by network position. Posts made to the online support group of Alcohol Help Centre during 2013 were structured as a two-mode network of members (n = 205) connected via threads (n = 506). Metrics included degree centrality, clique membership, and tie strength. The network consisted of one component and no cliques of members, although most made few posts and a small number communicated only with the site's moderators. Highly active members were older and tended to have started posting prior to 2013. The distribution of members across threads varied from threads containing posts by one member to others that connected multiple members. Moderators accounted for sizable proportions of the connectivity between both members and threads. After 5 years of operation, the AHC online support group appears to be fairly cohesive and stable, in the sense that there were no isolated subnetworks comprised of specific types of members or devoted to specific topics. Participation and connectedness at the member-level was varied, however, and tended to be low on average. The moderators were among the most central in the network, although there were also members who emerged as central and dedicated contributors to the online discussions across topics. Study findings highlight a number of areas for consideration by online support group developers and managers.
Abraham, Joanna; Kannampallil, Thomas G; Srinivasan, Vignesh; Galanter, William L; Tagney, Gail; Cohen, Trevor
2017-01-01
We develop and evaluate a methodological approach to measure the degree and nature of overlap in handoff communication content within and across clinical professions. This extensible, exploratory approach relies on combining techniques from conversational analysis and distributional semantics. We audio-recorded handoff communication of residents and nurses on the General Medicine floor of a large academic hospital (n=120 resident and n=120 nurse handoffs). We measured semantic similarity, a proxy for content overlap, between resident-resident and nurse-nurse communication using multiple steps: a qualitative conversational content analysis; an automated semantic similarity analysis using Reflective Random Indexing (RRI); and comparing semantic similarity generated by RRI analysis with human ratings of semantic similarity. There was significant association between the semantic similarity as computed by the RRI method and human rating (ρ=0.88). Based on the semantic similarity scores, content overlap was relatively higher for content related to patient active problems, assessment of active problems, patient-identifying information, past medical history, and medications/treatments. In contrast, content overlap was limited on content related to allergies, family-related information, code status, and anticipatory guidance. Our approach using RRI analysis provides new opportunities for characterizing the nature and degree of overlap in handoff communication. Although exploratory, this method provides a basis for identifying content that can be used for determining shared understanding across clinical professions. Additionally, this approach can inform the development of flexibly standardized handoff tools that reflect clinical content that are most appropriate for fostering shared understanding during transitions of care. Copyright © 2016 Elsevier Inc. All rights reserved.
Cascade debris overlap mechanism of 〈100〉 dislocation loop formation in Fe and FeCr
NASA Astrophysics Data System (ADS)
Granberg, F.; Byggmästar, J.; Sand, A. E.; Nordlund, K.
2017-09-01
Two types of dislocation loops are observed in irradiated α-Fe, the 1/2〈111〉 loop and the 〈100〉 loop. Atomistic simulations consistently predict that only the energetically more favourable 1/2〈111〉 loops are formed directly in cascades, leaving the formation mechanism of 〈100〉 loops an unsolved question. We show how 〈100〉 loops can be formed when cascades overlap with random pre-existing primary radiation damage in Fe and FeCr. This indicates that there are no specific constraints involved in the formation of 〈100〉 loops, and can explain their common occurrence.
NASA Astrophysics Data System (ADS)
Kim, Hannah; Scantlebury, Kathryn
2013-09-01
This forum discusses the issue of `othering' and how intersectionality is a useful analytical framework for understanding the students' immigrant experiences in, and out of, the science classroom. We use a feminist perspective to discuss Minjung's study because gender is a key aspect of one's identity other aspects such as race, religion, socio-economic status, and age have assumed a significant status in gender studies. Lastly we examine the supports and barriers that cliques can produce and propose the importance of building a learning community in the science classroom to engage all students.
An Evidence-Based Approach to an Adolescent with Emotional and Behavioral Dysregulation
ERIC Educational Resources Information Center
McClellan, Jon M.; Hamilton, John D.
2006-01-01
Children and adolescents in community mental health settings often present with multiple overlapping syndromes, as well as confounding issues such as family turmoil, abuse and neglect, and involvement with social welfare and juvenile justice systems. Most interventions proven to have efficacy in randomized, controlled trials have nevertheless not…
NASA Astrophysics Data System (ADS)
Li, Jiming; Lv, Qiaoyi; Jian, Bida; Zhang, Min; Zhao, Chuanfeng; Fu, Qiang; Kawamoto, Kazuaki; Zhang, Hua
2018-05-01
Studies have shown that changes in cloud cover are responsible for the rapid climate warming over the Tibetan Plateau (TP) in the past 3 decades. To simulate the total cloud cover, atmospheric models have to reasonably represent the characteristics of vertical overlap between cloud layers. Until now, however, this subject has received little attention due to the limited availability of observations, especially over the TP. Based on the above information, the main aim of this study is to examine the properties of cloud overlaps over the TP region and to build an empirical relationship between cloud overlap properties and large-scale atmospheric dynamics using 4 years (2007-2010) of data from the CloudSat cloud product and collocated ERA-Interim reanalysis data. To do this, the cloud overlap parameter α, which is an inverse exponential function of the cloud layer separation D and decorrelation length scale L, is calculated using CloudSat and is discussed. The parameters α and L are both widely used to characterize the transition from the maximum to random overlap assumption with increasing layer separations. For those non-adjacent layers without clear sky between them (that is, contiguous cloud layers), it is found that the overlap parameter α is sensitive to the unique thermodynamic and dynamic environment over the TP, i.e., the unstable atmospheric stratification and corresponding weak wind shear, which leads to maximum overlap (that is, greater α values). This finding agrees well with the previous studies. Finally, we parameterize the decorrelation length scale L as a function of the wind shear and atmospheric stability based on a multiple linear regression. Compared with previous parameterizations, this new scheme can improve the simulation of total cloud cover over the TP when the separations between cloud layers are greater than 1 km. This study thus suggests that the effects of both wind shear and atmospheric stability on cloud overlap should be taken into account in the parameterization of decorrelation length scale L in order to further improve the calculation of the radiative budget and the prediction of climate change over the TP in the atmospheric models.
NASA Astrophysics Data System (ADS)
Tavabi, E.; Koutchmy, S.; Ajabshirizadeh, A.
2012-06-01
In order to clear up the origin and possibly explain some solar limb and disc spicule quasi-periodic recurrences produced by overlapping effects, we present a simulation model assuming quasi- random positions of spicules. We also allow a set number of spicules with different physical properties (such as: height, lifetime and tilt angle as shown by an individual spicule) occurring randomly. Results of simulations made with three different spatial resolutions of the corresponding frames and also for different number density of spicules, are analyzed. The wavelet time/frequency method is used to obtain the exact period of spicule visibility. Results are compared with observations of the chromosphere from i/ the Transition Region and Coronal Explorer (TRACE) filtergrams taken at 1600 angstrom, ii/ the Solar Optical Telescope (SOT) of Hinode taken in the Ca II H-line and iii/ the Sac-Peak Dunn's VTT taken in H? line. Our results suggest the need to be cautious when interpreting apparent oscillations seen in spicule image sequences when overlapping is present, i.e.; when the spatial resolution is not enough to resolve individual components of spicules.
Transparency in stereopsis: parallel encoding of overlapping depth planes.
Reeves, Adam; Lynch, David
2017-08-01
We report that after extensive training, expert adults can accurately report the number, up to six, of transparent overlapping depth planes portrayed by brief (400 ms or 200 ms) random-element stereoscopic displays, and can well discriminate six from seven planes. Naïve subjects did poorly above three planes. Displays contained seven rows of 12 randomly located ×'s or +'s; jittering the disparities and number in each row to remove spurious cues had little effect on accuracy. Removing the central 3° of the 10° display to eliminate foveal vision hardly reduced the number of reportable planes. Experts could report how many of six planes contained +'s when the remainder contained ×'s, and most learned to report up to six planes in reverse contrast (left eye white +'s; right eye black +'s). Long-term training allowed some experts to reach eight depth planes. Results suggest that adult stereoscopic vision can learn to distinguish the outputs of six or more statistically independent, contrast-insensitive, narrowly tuned, asymmetric disparity channels in parallel.
Overlap between treatment and control distributions as an effect size measure in experiments.
Hedges, Larry V; Olkin, Ingram
2016-03-01
The proportion π of treatment group observations that exceed the control group mean has been proposed as an effect size measure for experiments that randomly assign independent units into 2 groups. We give the exact distribution of a simple estimator of π based on the standardized mean difference and use it to study the small sample bias of this estimator. We also give the minimum variance unbiased estimator of π under 2 models, one in which the variance of the mean difference is known and one in which the variance is unknown. We show how to use the relation between the standardized mean difference and the overlap measure to compute confidence intervals for π and show that these results can be used to obtain unbiased estimators, large sample variances, and confidence intervals for 3 related effect size measures based on the overlap. Finally, we show how the effect size π can be used in a meta-analysis. (c) 2016 APA, all rights reserved).
NASA Astrophysics Data System (ADS)
Kamaliya, Bhaveshkumar; Mote, Rakesh G.; Aslam, Mohammed; Fu, Jing
2018-03-01
In this paper, we demonstrate enhanced light trapping by self-organized nanoripples on the germanium surface. The enhanced light trapping leading to high absorption of light is confirmed by the experimental studies as well as the numerical simulations using the finite-difference time-domain method. We used gallium ion (Ga+) focused ion beam to enable the formation of the self-organized nanoripples on the germanium (100) surface. During the fabrication, the overlap of the scanning beam is varied from zero to negative value and found to influence the orientation of the nanoripples. Evolution of nanostructures with the variation of beam overlap is investigated. Parallel, perpendicular, and randomly aligned nanoripples with respect to the scanning direction are obtained via manipulation of the scanning beam overlap. 95% broadband absorptance is measured in the visible electromagnetic region for the nanorippled germanium surface. The reported light absorption enhancement can significantly improve the efficiency of germanium-silicon based photovoltaic systems.
Chen, Ming-Huang; Yang, Wu-Lung R; Lin, Kuan-Ting; Liu, Chia-Hung; Liu, Yu-Wen; Huang, Kai-Wen; Chang, Peter Mu-Hsin; Lai, Jin-Mei; Hsu, Chun-Nan; Chao, Kun-Mao; Kao, Cheng-Yan; Huang, Chi-Ying F
2011-01-01
Hepatocellular carcinoma (HCC) is an aggressive tumor with a poor prognosis. Currently, only sorafenib is approved by the FDA for advanced HCC treatment; therefore, there is an urgent need to discover candidate therapeutic drugs for HCC. We hypothesized that if a drug signature could reverse, at least in part, the gene expression signature of HCC, it might have the potential to inhibit HCC-related pathways and thereby treat HCC. To test this hypothesis, we first built an integrative platform, the "Encyclopedia of Hepatocellular Carcinoma genes Online 2", dubbed EHCO2, to systematically collect, organize and compare the publicly available data from HCC studies. The resulting collection includes a total of 4,020 genes. To systematically query the Connectivity Map (CMap), which includes 6,100 drug-mediated expression profiles, we further designed various gene signature selection and enrichment methods, including a randomization technique, majority vote, and clique analysis. Subsequently, 28 out of 50 prioritized drugs, including tanespimycin, trichostatin A, thioguanosine, and several anti-psychotic drugs with anti-tumor activities, were validated via MTT cell viability assays and clonogenic assays in HCC cell lines. To accelerate their future clinical use, possibly through drug-repurposing, we selected two well-established drugs to test in mice, chlorpromazine and trifluoperazine. Both drugs inhibited orthotopic liver tumor growth. In conclusion, we successfully discovered and validated existing drugs for potential HCC therapeutic use with the pipeline of Connectivity Map analysis and lab verification, thereby suggesting the usefulness of this procedure to accelerate drug repurposing for HCC treatment.
Wilson, Dawn K; Griffin, Sarah; Saunders, Ruth P; Evans, Alexandra; Mixon, Gary; Wright, Marcie; Beasley, Amelia; Umstattd, M Renee; Lattimore, Diana; Watts, Ashley; Freelove, Julie
2006-08-01
The present study was designed to develop an innovative motivational intervention (based on Self-Determination Theory and Social Cognitive Theory) to increase physical activity (PA) in underserved adolescents. Sixty-four adolescents (35 females, 29 males; 50% minority; 65% on reduced lunch program; ages 11-13 yr) participated in either an 8-week motivational intervention after-school (n = 32) or a typical after-school program (n = 32). The conceptual framework for the intervention targeted the social environment (perceived autonomy, perceived social support, participation, fun), cognitive mediators (perceived choice, self-efficacy, and relatedness/belongingness), and motivational orientation (intrinsic motivation, commitment, positive self-concept). Formative evaluation data was collected by staff through daily forms throughout the 8-week program and through observational data completed by independent objective observers during 2 weeks of the program. The major themes that were identified addressed theoretical concepts regarding the intervention and logistical issues in delivering the intervention. The data revealed information regarding the importance of the cognitive appropriateness of the PA and motivational activities, the environmental climate for promoting nurturing relationships, developing specific strategies for increasing intrinsic rather than extrinsic reinforcement, and developing methods for preventing social "cliques" and gender conflicts to maintain an appropriate level of support in the social climate. Themes for training staff included focusing on team building, leadership, and nurturing. This formative evaluation is being used to formalize a randomized trial to test the effects of a student-centered motivational intervention on increasing PA in underserved 6th graders.
Zhang, Qi; Wang, Xiao Long; Liao, Min Lei; Hu, Jian; Yang, Zhen Kun; Ding, Feng Hua; Zhang, Jian Sheng; Du, Run; Zhu, Tian Qi; Shen, Wei Feng; Zhang, Rui Yan
2015-03-01
Patients are at risk of developing periprocedural myonecrosis after percutaneous coronary intervention (PCI). We investigated whether the use of the platelet glycoprotein (GP) IIb/IIIa receptor inhibitor tirofiban could reduce periprocedural myocardial infarction (PMI) in patients with stable coronary artery disease undergoing elective PCI with overlapping stent implantation for long lesions. A total of 748 stable angina patients with long lesions (≥ 40 mm in length) treated with overlapping stent implantation were randomly assigned to receive tirofiban (tirofiban group; n = 373) or conventional therapy (control group; n = 375). Intravenous tirofiban was initiated before PCI and maintained for 12 hr after the procedure. The primary endpoint was PMI, defined as an elevation in CK-MB > 3 times the upper limit of normal 12 hr after the index procedure. The secondary endpoint was major adverse cardiac events (MACE), including cardiac death, target vessel revascularization, and recurrent MI (re-MI), at one-year of clinical follow-up. The safety end-points included Thrombolysis in Myocardial Infarction (TIMI) major bleeding and stent thrombosis. Despite comparable angiographic and procedural characteristics, in the intention-to-treatment analysis, the primary endpoint was significantly reduced in the tirofiban group (4.0% vs. 11.5%, P < 0.001). Multivariate analysis revealed that the adjunctive use of tirofiban was the only negative predictor of PMI (OR 0.41, 95% CI 0.28-0.81, P < 0.01). At one-year of clinical follow-up, the overall occurrence of MACE was significantly lower in the tirofiban group (13.4% vs. 22.7%, P = 0.001). The rate of TIMI major bleeding and stent thrombosis did not differ significantly between the two groups. Our results show that the adjunctive use of tirofiban reduces the occurrence of PMI and MACE at one year in stable coronary artery disease patients undergoing elective PCI for long lesions with overlapping stent implantation. © 2015 Wiley Periodicals, Inc.
NASA Astrophysics Data System (ADS)
Kim, Heesang; Oh, Byoungchan; Kim, Kyungdo; Cha, Seon-Yong; Jeong, Jae-Goan; Hong, Sung-Joo; Lee, Jong-Ho; Park, Byung-Gook; Shin, Hyungcheol
2010-09-01
We generated traps inside gate oxide in gate-drain overlap region of recess channel type dynamic random access memory (DRAM) cell transistor through Fowler-Nordheim (FN) stress, and observed gate induced drain leakage (GIDL) current both in time domain and in frequency domain. It was found that the trap inside gate oxide could generate random telegraph signal (RTS)-like fluctuation in GIDL current. The characteristics of that fluctuation were similar to those of RTS-like fluctuation in GIDL current observed in the non-stressed device. This result shows the possibility that the trap causing variable retention time (VRT) in DRAM data retention time can be located inside gate oxide like channel RTS of metal-oxide-semiconductor field-effect transistors (MOSFETs).
Seinen, Erwin; Burgerhof, Johannes G. M.; Jansen, Ritsert C.; Sibon, Ody C. M.
2010-01-01
Background RNAi technology is widely used to downregulate specific gene products. Investigating the phenotype induced by downregulation of gene products provides essential information about the function of the specific gene of interest. When RNAi is applied in Drosophila melanogaster or Caenorhabditis elegans, often large dsRNAs are used. One of the drawbacks of RNAi technology is that unwanted gene products with sequence similarity to the gene of interest can be down regulated too. To verify the outcome of an RNAi experiment and to avoid these unwanted off-target effects, an additional non-overlapping dsRNA can be used to down-regulate the same gene. However it has never been tested whether this approach is sufficient to reduce the risk of off-targets. Methodology We created a novel tool to analyse the occurance of off-target effects in Drosophila and we analyzed 99 randomly chosen genes. Principal Findings Here we show that nearly all genes contain non-overlapping internal sequences that do show overlap in a common off-target gene. Conclusion Based on our in silico findings, off-target effects should not be ignored and our presented on-line tool enables the identification of two RNA interference constructs, free of overlapping off-targets, from any gene of interest. PMID:20957038
Kawano, Yasuhiro; Neeley, Shane; Adachi, Kei; Nakai, Hiroyuki
2013-01-01
Overlapping open reading frames (ORFs) in viral genomes undergo co-evolution; however, how individual amino acids coded by overlapping ORFs are structurally, functionally, and co-evolutionarily constrained remains difficult to address by conventional homologous sequence alignment approaches. We report here a new experimental and computational evolution-based methodology to address this question and report its preliminary application to elucidating a mode of co-evolution of the frame-shifted overlapping ORFs in the adeno-associated virus (AAV) serotype 2 viral genome. These ORFs encode both capsid VP protein and non-structural assembly-activating protein (AAP). To show proof of principle of the new method, we focused on the evolutionarily conserved QVKEVTQ and KSKRSRR motifs, a pair of overlapping heptapeptides in VP and AAP, respectively. In the new method, we first identified a large number of capsid-forming VP3 mutants and functionally competent AAP mutants of these motifs from mutant libraries by experimental directed evolution under no co-evolutionary constraints. We used Illumina sequencing to obtain a large dataset and then statistically assessed the viability of VP and AAP heptapeptide mutants. The obtained heptapeptide information was then integrated into an evolutionary algorithm, with which VP and AAP were co-evolved from random or native nucleotide sequences in silico. As a result, we demonstrate that these two heptapeptide motifs could exhibit high degeneracy if coded by separate nucleotide sequences, and elucidate how overlap-evoked co-evolutionary constraints play a role in making the VP and AAP heptapeptide sequences into the present shape. Specifically, we demonstrate that two valine (V) residues and β-strand propensity in QVKEVTQ are structurally important, the strongly negative and hydrophilic nature of KSKRSRR is functionally important, and overlap-evoked co-evolution imposes strong constraints on serine (S) residues in KSKRSRR, despite high degeneracy of the motifs in the absence of co-evolutionary constraints.
Super-resolving random-Gaussian apodized photon sieve.
Sabatyan, Arash; Roshaninejad, Parisa
2012-09-10
A novel apodized photon sieve is presented in which random dense Gaussian distribution is implemented to modulate the pinhole density in each zone. The random distribution in dense Gaussian distribution causes intrazone discontinuities. Also, the dense Gaussian distribution generates a substantial number of pinholes in order to form a large degree of overlap between the holes in a few innermost zones of the photon sieve; thereby, clear zones are formed. The role of the discontinuities on the focusing properties of the photon sieve is examined as well. Analysis shows that secondary maxima have evidently been suppressed, transmission has increased enormously, and the central maxima width is approximately unchanged in comparison to the dense Gaussian distribution. Theoretical results have been completely verified by experiment.
Phase diagrams for an evolutionary prisoner's dilemma game on two-dimensional lattices
NASA Astrophysics Data System (ADS)
Szabó, György; Vukov, Jeromos; Szolnoki, Attila
2005-10-01
The effects of payoffs and noise on the maintenance of cooperative behavior are studied in an evolutionary prisoner’s dilemma game with players located on the sites of different two-dimensional lattices. This system exhibits a phase transition from a mixed state of cooperators and defectors to a homogeneous one where only the defectors remain alive. Using Monte Carlo simulations and the generalized mean-field approximations we have determined the phase boundaries (critical points) separating the two phases on the plane of the temperature (noise) and temptation to choose defection. In the zero temperature limit the cooperation can be sustained only for those connectivity structures where three-site clique percolation occurs.
Nonlocal atlas-guided multi-channel forest learning for human brain labeling
DOE Office of Scientific and Technical Information (OSTI.GOV)
Ma, Guangkai; Gao, Yaozong; Wu, Guorong
Purpose: It is important for many quantitative brain studies to label meaningful anatomical regions in MR brain images. However, due to high complexity of brain structures and ambiguous boundaries between different anatomical regions, the anatomical labeling of MR brain images is still quite a challenging task. In many existing label fusion methods, appearance information is widely used. However, since local anatomy in the human brain is often complex, the appearance information alone is limited in characterizing each image point, especially for identifying the same anatomical structure across different subjects. Recent progress in computer vision suggests that the context features canmore » be very useful in identifying an object from a complex scene. In light of this, the authors propose a novel learning-based label fusion method by using both low-level appearance features (computed from the target image) and high-level context features (computed from warped atlases or tentative labeling maps of the target image). Methods: In particular, the authors employ a multi-channel random forest to learn the nonlinear relationship between these hybrid features and target labels (i.e., corresponding to certain anatomical structures). Specifically, at each of the iterations, the random forest will output tentative labeling maps of the target image, from which the authors compute spatial label context features and then use in combination with original appearance features of the target image to refine the labeling. Moreover, to accommodate the high inter-subject variations, the authors further extend their learning-based label fusion to a multi-atlas scenario, i.e., they train a random forest for each atlas and then obtain the final labeling result according to the consensus of results from all atlases. Results: The authors have comprehensively evaluated their method on both public LONI-LBPA40 and IXI datasets. To quantitatively evaluate the labeling accuracy, the authors use the dice similarity coefficient to measure the overlap degree. Their method achieves average overlaps of 82.56% on 54 regions of interest (ROIs) and 79.78% on 80 ROIs, respectively, which significantly outperform the baseline method (random forests), with the average overlaps of 72.48% on 54 ROIs and 72.09% on 80 ROIs, respectively. Conclusions: The proposed methods have achieved the highest labeling accuracy, compared to several state-of-the-art methods in the literature.« less
Nonlocal atlas-guided multi-channel forest learning for human brain labeling
Ma, Guangkai; Gao, Yaozong; Wu, Guorong; Wu, Ligang; Shen, Dinggang
2016-01-01
Purpose: It is important for many quantitative brain studies to label meaningful anatomical regions in MR brain images. However, due to high complexity of brain structures and ambiguous boundaries between different anatomical regions, the anatomical labeling of MR brain images is still quite a challenging task. In many existing label fusion methods, appearance information is widely used. However, since local anatomy in the human brain is often complex, the appearance information alone is limited in characterizing each image point, especially for identifying the same anatomical structure across different subjects. Recent progress in computer vision suggests that the context features can be very useful in identifying an object from a complex scene. In light of this, the authors propose a novel learning-based label fusion method by using both low-level appearance features (computed from the target image) and high-level context features (computed from warped atlases or tentative labeling maps of the target image). Methods: In particular, the authors employ a multi-channel random forest to learn the nonlinear relationship between these hybrid features and target labels (i.e., corresponding to certain anatomical structures). Specifically, at each of the iterations, the random forest will output tentative labeling maps of the target image, from which the authors compute spatial label context features and then use in combination with original appearance features of the target image to refine the labeling. Moreover, to accommodate the high inter-subject variations, the authors further extend their learning-based label fusion to a multi-atlas scenario, i.e., they train a random forest for each atlas and then obtain the final labeling result according to the consensus of results from all atlases. Results: The authors have comprehensively evaluated their method on both public LONI_LBPA40 and IXI datasets. To quantitatively evaluate the labeling accuracy, the authors use the dice similarity coefficient to measure the overlap degree. Their method achieves average overlaps of 82.56% on 54 regions of interest (ROIs) and 79.78% on 80 ROIs, respectively, which significantly outperform the baseline method (random forests), with the average overlaps of 72.48% on 54 ROIs and 72.09% on 80 ROIs, respectively. Conclusions: The proposed methods have achieved the highest labeling accuracy, compared to several state-of-the-art methods in the literature. PMID:26843260
Contribution to the modeling of solar spicules
NASA Astrophysics Data System (ADS)
Tavabi, E.; Koutchmy, S.; Ajabshirizadeh, A.
2011-06-01
Solar limb and disk spicule quasi-periodic motions have been reported for a long time, strongly suggesting that they are oscillating. In order to clear up the origin and possibly explain some solar limb and disk spicule quasi-periodic recurrences produced by overlapping effects, we present a simulation model assuming quasi-random positions of spicules. We also allow a set number of spicules with different physical properties (such as: height, lifetime and tilt angle as shown by an individual spicule) occurring randomly. Results of simulations made with three different spatial resolutions of the corresponding frames and also for different number density of spicules, are analyzed. The wavelet time/frequency method is used to obtain the exact period of spicule visibility. Results are compared with observations of the chromosphere from (i) the Transition Region and Coronal Explorer (TRACE) filtergrams taken at 1600 Å, (ii) the Solar Optical Telescope (SOT) of Hinode taken in the Ca II H-line and (iii) the Sac-Peak Dunn's VTT taken in Hα line. Our results suggest the need to be cautious when interpreting apparent oscillations seen in spicule image sequences when overlapping is present, i.e., when the spatial resolution is not enough to resolve individual components of spicules.
Spatial location influences vocal interactions in bullfrog choruses
Bates, Mary E.; Cropp, Brett F.; Gonchar, Marina; Knowles, Jeffrey; Simmons, James A.; Simmons, Andrea Megela
2010-01-01
A multiple sensor array was employed to identify the spatial locations of all vocalizing male bullfrogs (Rana catesbeiana) in five natural choruses. Patterns of vocal activity collected with this array were compared with computer simulations of chorus activity. Bullfrogs were not randomly spaced within choruses, but tended to cluster into closely spaced groups of two to five vocalizing males. There were nonrandom, differing patterns of vocal interactions within clusters of closely spaced males and between different clusters. Bullfrogs located within the same cluster tended to overlap or alternate call notes with two or more other males in that cluster. These near-simultaneous calling bouts produced advertisement calls with more pronounced amplitude modulation than occurred in nonoverlapping notes or calls. Bullfrogs located in different clusters more often alternated entire calls or overlapped only small segments of their calls. They also tended to respond sequentially to calls of their farther neighbors compared to their nearer neighbors. Results of computational analyses showed that the observed patterns of vocal interactions were significantly different than expected based on random activity. The use of a multiple sensor array provides a richer view of the dynamics of choruses than available based on single microphone techniques. PMID:20370047
NASA Astrophysics Data System (ADS)
Chang, Wen-Li
2010-01-01
We investigate the influence of blurred ways on pattern recognition of a Barabási-Albert scale-free Hopfield neural network (SFHN) with a small amount of errors. Pattern recognition is an important function of information processing in brain. Due to heterogeneous degree of scale-free network, different blurred ways have different influences on pattern recognition with same errors. Simulation shows that among partial recognition, the larger loading ratio (the number of patterns to average degree P/langlekrangle) is, the smaller the overlap of SFHN is. The influence of directed (large) way is largest and the directed (small) way is smallest while random way is intermediate between them. Under the ratio of the numbers of stored patterns to the size of the network P/N is less than 0. 1 conditions, there are three families curves of the overlap corresponding to directed (small), random and directed (large) blurred ways of patterns and these curves are not associated with the size of network and the number of patterns. This phenomenon only occurs in the SFHN. These conclusions are benefit for understanding the relation between neural network structure and brain function.
Klinger, Robert C.; Few, Alexandra P.; Knox, Kathleen A.; Hatfield, Brian E.; Clark, Jonathan; German, David W.; Stephenson, Thomas R.
2015-01-01
The association analyses indicated the potential for overlap between pack stock and SNBS was minimal; only 1 percent of the potential meadow area in the SNBS herd home ranges overlapped that of pack stock meadows. There were no systematic differences in overall vegetation structure or composition, or in diversity, cover, or composition of forage species, that indicated pack stock were altering SNBS habitat or affecting their nutrition. Variation in plant species composition was influenced primarily by random differences among meadows and environmental gradients, and there was little evidence that pack stock use contributed in meaningful ways to this variation. The few differences among meadows with different levels of use by bighorn sheep and pack stock either were minor or were not in a direction consistent with negative effects of pack stock on SNBS. We conclude that the current plan for managing pack stock grazing has been successful in minimizing significant negative effects on Sierra Nevada bighorn sheep at Sequoia and Kings Canyon National Parks.
Cui, Lele; Chen, Sisi; Zhou, Weihe; Sheng, Kaixuan; Zhang, Lei; Shen, Meixiao; Li, Ming
2018-01-01
To determine conjunctival overlap over the edge of soft contact lens and to visualize the peripheral postlens tear film (PoLTF) underneath soft contact lenses using ultrahigh-resolution optical coherence tomography (UHR-OCT). Twenty participants (4 males and 16 females, 23.0 ± 3.7 years) were fitted with two different types of soft contact lenses randomly. The limbus with lens was imaged with the UHR-OCT at the horizontal meridian every two hours up to 6 hours during lens wear. The conjunctival overlap was ranked as the percentage of the edge covered by the conjunctiva. The frequency of occurrence for visualized peripheral PoLTF was determined. The average conjunctival overlaps at insertion were 49% and 73% for galyfilcon A and balafilcon A lenses and increased significantly to 84% and 90% by 6 hours of lens wear ( P < 0.001). Lenses with rounded edges had more conjunctival overlap than the lenses with angled edges ( P =0.014). There were significant decreases for PoLTF on the conjunctiva ( P =0.014) and peripheral cornea ( P =0.004) over the study period compared to insertion. The percentage of subjects with PoLTF on the conjunctiva (32.5%) and peripheral cornea (36%) were greater in subjects wearing balafilcon A lenses ( P =0.017). Increased conjunctival overlap over the lens edges and reduced PoLTF underneath the peripheral region of soft contact lenses were shown during lens daily wear. The lens edge configuration may play a role in conjunctival response and peripheral PoLTF.
NASA Astrophysics Data System (ADS)
Barker, H. W.; Stephens, G. L.; Partain, P. T.; Bergman, J. W.; Bonnel, B.; Campana, K.; Clothiaux, E. E.; Clough, S.; Cusack, S.; Delamere, J.; Edwards, J.; Evans, K. F.; Fouquart, Y.; Freidenreich, S.; Galin, V.; Hou, Y.; Kato, S.; Li, J.; Mlawer, E.; Morcrette, J.-J.; O'Hirok, W.; Räisänen, P.; Ramaswamy, V.; Ritter, B.; Rozanov, E.; Schlesinger, M.; Shibata, K.; Sporyshev, P.; Sun, Z.; Wendisch, M.; Wood, N.; Yang, F.
2003-08-01
The primary purpose of this study is to assess the performance of 1D solar radiative transfer codes that are used currently both for research and in weather and climate models. Emphasis is on interpretation and handling of unresolved clouds. Answers are sought to the following questions: (i) How well do 1D solar codes interpret and handle columns of information pertaining to partly cloudy atmospheres? (ii) Regardless of the adequacy of their assumptions about unresolved clouds, do 1D solar codes perform as intended?One clear-sky and two plane-parallel, homogeneous (PPH) overcast cloud cases serve to elucidate 1D model differences due to varying treatments of gaseous transmittances, cloud optical properties, and basic radiative transfer. The remaining four cases involve 3D distributions of cloud water and water vapor as simulated by cloud-resolving models. Results for 25 1D codes, which included two line-by-line (LBL) models (clear and overcast only) and four 3D Monte Carlo (MC) photon transport algorithms, were submitted by 22 groups. Benchmark, domain-averaged irradiance profiles were computed by the MC codes. For the clear and overcast cases, all MC estimates of top-of-atmosphere albedo, atmospheric absorptance, and surface absorptance agree with one of the LBL codes to within ±2%. Most 1D codes underestimate atmospheric absorptance by typically 15-25 W m-2 at overhead sun for the standard tropical atmosphere regardless of clouds.Depending on assumptions about unresolved clouds, the 1D codes were partitioned into four genres: (i) horizontal variability, (ii) exact overlap of PPH clouds, (iii) maximum/random overlap of PPH clouds, and (iv) random overlap of PPH clouds. A single MC code was used to establish conditional benchmarks applicable to each genre, and all MC codes were used to establish the full 3D benchmarks. There is a tendency for 1D codes to cluster near their respective conditional benchmarks, though intragenre variances typically exceed those for the clear and overcast cases. The majority of 1D codes fall into the extreme category of maximum/random overlap of PPH clouds and thus generally disagree with full 3D benchmark values. Given the fairly limited scope of these tests and the inability of any one code to perform extremely well for all cases begs the question that a paradigm shift is due for modeling 1D solar fluxes for cloudy atmospheres.
Analysis of stock prices of mining business
NASA Astrophysics Data System (ADS)
Ahn, Sanghyun; Lim, G. C.; Kim, S. H.; Kim, Soo Yong; Yoon, Kwon Youb; Stanfield, Joseph Lee; Kim, Kyungsik
2011-06-01
Stock exchanges have a diversity of so-called business groups and much evidence has been presented by covariance matrix analysis (Laloux et al. (1999) [6], Plerou et al. (2002) [7], Plerou et al. (1999) [8], Mantegna (1999) [9], Utsugi et al. (2004) [21] and Lim et al. (2009) [26]). A market-wide effect plays a crucial role in shifting the correlation structure from random to non-random. In this work, we study the structural properties of stocks related to the mining industry, especially rare earth minerals, listed on two exchanges, namely the TSX (Toronto stock exchange) and the TSX-V (Toronto stock exchange-ventures). In general, raw-material businesses are sensitively affected by the global economy while each firm has its own cycle. We prove that the global crisis during 2006-2009 affected the mineral market considerably. These two aspects compete to control price fluctuations. We show that the internal cycle overwhelms the global economic environment in terms of random matrix theory and overlapping matrices. However, during the period of 2006-2009, the effect of the global economic environment emerges. This result is well explained by the recent global financial/economic crisis. For comparison, we analyze the time stability of business clusters of the KOSPI, that is, the electric/electronic business, using an overlapping matrix. A clear difference in behavior is confirmed. Consequently, rare earth minerals in the raw-material business should be classified not by standard business classifications but by the internal cycle of business.
A simple spatiotemporal rabies model for skunk and bat interaction in northeast Texas.
Borchering, Rebecca K; Liu, Hao; Steinhaus, Mara C; Gardner, Carl L; Kuang, Yang
2012-12-07
We formulate a simple partial differential equation model in an effort to qualitatively reproduce the spread dynamics and spatial pattern of rabies in northeast Texas with overlapping reservoir species (skunks and bats). Most existing models ignore reservoir species or model them with patchy models by ordinary differential equations. In our model, we incorporate interspecies rabies infection in addition to rabid population random movement. We apply this model to the confirmed case data from northeast Texas with most parameter values obtained or computed from the literature. Results of simulations using both our skunk-only model and our skunk and bat model demonstrate that the model with overlapping reservoir species more accurately reproduces the progression of rabies spread in northeast Texas. Copyright © 2012 Elsevier Ltd. All rights reserved.
Pletnev, Sergei; Subach, Fedor V; Verkhusha, Vladislav V; Dauter, Zbigniew
2014-01-01
The rotational order-disorder (OD) structure of the reversibly photoswitchable fluorescent protein rsTagRFP is discussed in detail. The structure is composed of tetramers of 222 symmetry incorporated into the lattice in two different orientations rotated 90° with respect to each other around the crystal c axis and with tetramer axes coinciding with the crystallographic twofold axes. The random distribution of alternatively oriented tetramers in the crystal creates the rotational OD structure with statistically averaged I422 symmetry. Despite order-disorder pathology, the structure of rsTagRFP has electron-density maps of good quality for both non-overlapping and overlapping parts of the model. The crystal contacts, crystal internal architecture and a possible mechanism of rotational OD crystal formation are discussed.
Double Scaling in the Relaxation Time in the β -Fermi-Pasta-Ulam-Tsingou Model
NASA Astrophysics Data System (ADS)
Lvov, Yuri V.; Onorato, Miguel
2018-04-01
We consider the original β -Fermi-Pasta-Ulam-Tsingou system; numerical simulations and theoretical arguments suggest that, for a finite number of masses, a statistical equilibrium state is reached independently of the initial energy of the system. Using ensemble averages over initial conditions characterized by different Fourier random phases, we numerically estimate the time scale of equipartition and we find that for very small nonlinearity it matches the prediction based on exact wave-wave resonant interaction theory. We derive a simple formula for the nonlinear frequency broadening and show that when the phenomenon of overlap of frequencies takes place, a different scaling for the thermalization time scale is observed. Our result supports the idea that the Chirikov overlap criterion identifies a transition region between two different relaxation time scalings.
Parallel-aware, dedicated job co-scheduling within/across symmetric multiprocessing nodes
Jones, Terry R.; Watson, Pythagoras C.; Tuel, William; Brenner, Larry; ,Caffrey, Patrick; Fier, Jeffrey
2010-10-05
In a parallel computing environment comprising a network of SMP nodes each having at least one processor, a parallel-aware co-scheduling method and system for improving the performance and scalability of a dedicated parallel job having synchronizing collective operations. The method and system uses a global co-scheduler and an operating system kernel dispatcher adapted to coordinate interfering system and daemon activities on a node and across nodes to promote intra-node and inter-node overlap of said interfering system and daemon activities as well as intra-node and inter-node overlap of said synchronizing collective operations. In this manner, the impact of random short-lived interruptions, such as timer-decrement processing and periodic daemon activity, on synchronizing collective operations is minimized on large processor-count SPMD bulk-synchronous programming styles.
Discovering protein complexes in protein interaction networks via exploring the weak ties effect
2012-01-01
Background Studying protein complexes is very important in biological processes since it helps reveal the structure-functionality relationships in biological networks and much attention has been paid to accurately predict protein complexes from the increasing amount of protein-protein interaction (PPI) data. Most of the available algorithms are based on the assumption that dense subgraphs correspond to complexes, failing to take into account the inherence organization within protein complex and the roles of edges. Thus, there is a critical need to investigate the possibility of discovering protein complexes using the topological information hidden in edges. Results To provide an investigation of the roles of edges in PPI networks, we show that the edges connecting less similar vertices in topology are more significant in maintaining the global connectivity, indicating the weak ties phenomenon in PPI networks. We further demonstrate that there is a negative relation between the weak tie strength and the topological similarity. By using the bridges, a reliable virtual network is constructed, in which each maximal clique corresponds to the core of a complex. By this notion, the detection of the protein complexes is transformed into a classic all-clique problem. A novel core-attachment based method is developed, which detects the cores and attachments, respectively. A comprehensive comparison among the existing algorithms and our algorithm has been made by comparing the predicted complexes against benchmark complexes. Conclusions We proved that the weak tie effect exists in the PPI network and demonstrated that the density is insufficient to characterize the topological structure of protein complexes. Furthermore, the experimental results on the yeast PPI network show that the proposed method outperforms the state-of-the-art algorithms. The analysis of detected modules by the present algorithm suggests that most of these modules have well biological significance in context of complexes, suggesting that the roles of edges are critical in discovering protein complexes. PMID:23046740
Ragunath, Pk; Abhinand, Pa
2013-01-01
Systems Biology involves the study of the interactions of biological systems and ultimately their functions. Down's syndrome (DS) is one of the most common genetic disorders which are caused by complete, or occasionally partial, triplication of chromosome 21, characterized by cognitive and language dysfunction coupled with sensory and neuromotor deficits. Neural Tube Disorders (NTDs) are a group of congenital malformations of the central nervous system and neighboring structures related to defective neural tube closure during the first trimester of pregnancy usually occurring between days 18-29 of gestation. Several studies in the past have provided considerable evidence that abnormal folate and methyl metabolism are associated with onset of DS & NTDs. There is a possible common etiological pathway for both NTDs and Down's syndrome. But, various research studies over the years have indicated very little evidence for familial link between the two disorders. Our research aimed at the gene expression profiling of microarray datasets pertaining to the two disorders to identify genes whose expression levels are significantly altered in these conditions. The genes which were 1.5 fold unregulated and having a p-value <0.05 were filtered out and gene interaction network were constructed for both NTDs and DS. The top ranked dense clique for both the disorders were recognized and over representation analysis was carried out for each of the constituent genes. The comprehensive manual analysis of these genes yields a hypothetical understanding of the lack of familial link between DS and NTDs. There were no genes involved with folic acid present in the dense cliques. Only - CBL, EGFR genes were commonly present, which makes the allelic variants of these genes - good candidates for future studies regarding the familial link between DS and NTDs. NTD - Neural Tube Disorders, DS - Down's Syndrome, MTHFR - Methylenetetrahydrofolate reductase, MTRR- 5 - methyltetrahydrofolate-homocysteine methyltransferase reductase.
Efficient sampling of complex network with modified random walk strategies
NASA Astrophysics Data System (ADS)
Xie, Yunya; Chang, Shuhua; Zhang, Zhipeng; Zhang, Mi; Yang, Lei
2018-02-01
We present two novel random walk strategies, choosing seed node (CSN) random walk and no-retracing (NR) random walk. Different from the classical random walk sampling, the CSN and NR strategies focus on the influences of the seed node choice and path overlap, respectively. Three random walk samplings are applied in the Erdös-Rényi (ER), Barabási-Albert (BA), Watts-Strogatz (WS), and the weighted USAir networks, respectively. Then, the major properties of sampled subnets, such as sampling efficiency, degree distributions, average degree and average clustering coefficient, are studied. The similar conclusions can be reached with these three random walk strategies. Firstly, the networks with small scales and simple structures are conducive to the sampling. Secondly, the average degree and the average clustering coefficient of the sampled subnet tend to the corresponding values of original networks with limited steps. And thirdly, all the degree distributions of the subnets are slightly biased to the high degree side. However, the NR strategy performs better for the average clustering coefficient of the subnet. In the real weighted USAir networks, some obvious characters like the larger clustering coefficient and the fluctuation of degree distribution are reproduced well by these random walk strategies.
Precise algorithm to generate random sequential adsorption of hard polygons at saturation
NASA Astrophysics Data System (ADS)
Zhang, G.
2018-04-01
Random sequential adsorption (RSA) is a time-dependent packing process, in which particles of certain shapes are randomly and sequentially placed into an empty space without overlap. In the infinite-time limit, the density approaches a "saturation" limit. Although this limit has attracted particular research interest, the majority of past studies could only probe this limit by extrapolation. We have previously found an algorithm to reach this limit using finite computational time for spherical particles and could thus determine the saturation density of spheres with high accuracy. In this paper, we generalize this algorithm to generate saturated RSA packings of two-dimensional polygons. We also calculate the saturation density for regular polygons of three to ten sides and obtain results that are consistent with previous, extrapolation-based studies.
Precise algorithm to generate random sequential adsorption of hard polygons at saturation.
Zhang, G
2018-04-01
Random sequential adsorption (RSA) is a time-dependent packing process, in which particles of certain shapes are randomly and sequentially placed into an empty space without overlap. In the infinite-time limit, the density approaches a "saturation" limit. Although this limit has attracted particular research interest, the majority of past studies could only probe this limit by extrapolation. We have previously found an algorithm to reach this limit using finite computational time for spherical particles and could thus determine the saturation density of spheres with high accuracy. In this paper, we generalize this algorithm to generate saturated RSA packings of two-dimensional polygons. We also calculate the saturation density for regular polygons of three to ten sides and obtain results that are consistent with previous, extrapolation-based studies.
Analysing Local Sparseness in the Macaque Brain Network
Singh, Raghavendra; Nagar, Seema; Nanavati, Amit A.
2015-01-01
Understanding the network structure of long distance pathways in the brain is a necessary step towards developing an insight into the brain’s function, organization and evolution. Dense global subnetworks of these pathways have often been studied, primarily due to their functional implications. Instead we study sparse local subnetworks of the pathways to establish the role of a brain area in enabling shortest path communication between its non-adjacent topological neighbours. We propose a novel metric to measure the topological communication load on a vertex due to its immediate neighbourhood, and show that in terms of distribution of this local communication load, a network of Macaque long distance pathways is substantially different from other real world networks and random graph models. Macaque network contains the entire range of local subnetworks, from star-like networks to clique-like networks, while other networks tend to contain a relatively small range of subnetworks. Further, sparse local subnetworks in the Macaque network are not only found across topographical super-areas, e.g., lobes, but also within a super-area, arguing that there is conservation of even relatively short-distance pathways. To establish the communication role of a vertex we borrow the concept of brokerage from social science, and present the different types of brokerage roles that brain areas play, highlighting that not only the thalamus, but also cingulate gyrus and insula often act as “relays” for areas in the neocortex. These and other analysis of communication load and roles of the sparse subnetworks of the Macaque brain provide new insights into the organisation of its pathways. PMID:26437077
Genetically determined schizophrenia is not associated with impaired glucose homeostasis.
Polimanti, Renato; Gelernter, Joel; Stein, Dan J
2018-05-01
Here, we used data from large genome-wide association studies to test the presence of causal relationships, conducting a Mendelian randomization analysis; and shared molecular mechanisms, calculating the genetic correlation, among schizophrenia, type 2 diabetes (T2D), and impaired glucose homeostasis. Although our Mendelian randomization analysis was well-powered, no causal relationship was observed between schizophrenia and T2D, or traits related to glucose impaired homeostasis. Similarly, we did not observe any global genetic overlap among these traits. These findings indicate that there is no causal relationships or shared mechanisms between schizophrenia and impaired glucose homeostasis. Copyright © 2017 Elsevier B.V. All rights reserved.
Permeability of model porous medium formed by random discs
NASA Astrophysics Data System (ADS)
Gubaidullin, A. A.; Gubkin, A. S.; Igoshin, D. E.; Ignatev, P. A.
2018-03-01
Two-dimension model of the porous medium with skeleton of randomly located overlapping discs is proposed. The geometry and computational grid are built in open package Salome. Flow of Newtonian liquid in longitudinal and transverse directions is calculated and its flow rate is defined. The numerical solution of the Navier-Stokes equations for a given pressure drop at the boundaries of the area is realized in the open package OpenFOAM. Calculated value of flow rate is used for defining of permeability coefficient on the base of Darcy law. For evaluating of representativeness of computational domain the permeability coefficients in longitudinal and transverse directions are compered.
Allowing for Horizontally Heterogeneous Clouds and Generalized Overlap in an Atmospheric GCM
NASA Technical Reports Server (NTRS)
Lee, D.; Oreopoulos, L.; Suarez, M.
2011-01-01
While fully accounting for 3D effects in Global Climate Models (GCMs) appears not realistic at the present time for a variety of reasons such as computational cost and unavailability of 3D cloud structure in the models, incorporation in radiation schemes of subgrid cloud variability described by one-point statistics is now considered feasible and is being actively pursued. This development has gained momentum once it was demonstrated that CPU-intensive spectrally explicit Independent Column Approximation (lCA) can be substituted by stochastic Monte Carlo ICA (McICA) calculations where spectral integration is accomplished in a manner that produces relatively benign random noise. The McICA approach has been implemented in Goddard's GEOS-5 atmospheric GCM as part of the implementation of the RRTMG radiation package. GEOS-5 with McICA and RRTMG can handle horizontally variable clouds which can be set via a cloud generator to arbitrarily overlap within the full spectrum of maximum and random both in terms of cloud fraction and layer condensate distributions. In our presentation we will show radiative and other impacts of the combined horizontal and vertical cloud variability on multi-year simulations of an otherwise untuned GEOS-5 with fixed SSTs. Introducing cloud horizontal heterogeneity without changing the mean amounts of condensate reduces reflected solar and increases thermal radiation to space, but disproportionate changes may increase the radiative imbalance at TOA. The net radiation at TOA can be modulated by allowing the parameters of the generalized overlap and heterogeneity scheme to vary, a dependence whose behavior we will discuss. The sensitivity of the cloud radiative forcing to the parameters of cloud horizontal heterogeneity and comparisons of CERES-derived forcing will be shown.
Biological sex affects the neurobiology of autism
Lombardo, Michael V.; Suckling, John; Ruigrok, Amber N. V.; Chakrabarti, Bhismadev; Ecker, Christine; Deoni, Sean C. L.; Craig, Michael C.; Murphy, Declan G. M.; Bullmore, Edward T.; Baron-Cohen, Simon
2013-01-01
In autism, heterogeneity is the rule rather than the exception. One obvious source of heterogeneity is biological sex. Since autism was first recognized, males with autism have disproportionately skewed research. Females with autism have thus been relatively overlooked, and have generally been assumed to have the same underlying neurobiology as males with autism. Growing evidence, however, suggests that this is an oversimplification that risks obscuring the biological base of autism. This study seeks to answer two questions about how autism is modulated by biological sex at the level of the brain: (i) is the neuroanatomy of autism different in males and females? and (ii) does the neuroanatomy of autism fit predictions from the ‘extreme male brain’ theory of autism, in males and/or in females? Neuroanatomical features derived from voxel-based morphometry were compared in a sample of equal-sized high-functioning male and female adults with and without autism (n = 120, n = 30/group). The first question was investigated using a 2 × 2 factorial design, and by spatial overlap analyses of the neuroanatomy of autism in males and females. The second question was tested through spatial overlap analyses of specific patterns predicted by the extreme male brain theory. We found that the neuroanatomy of autism differed between adult males and females, evidenced by minimal spatial overlap (not different from that occurred under random condition) in both grey and white matter, and substantially large white matter regions showing significant sex × diagnosis interactions in the 2 × 2 factorial design. These suggest that autism manifests differently by biological sex. Furthermore, atypical brain areas in females with autism substantially and non-randomly (P < 0.001) overlapped with areas that were sexually dimorphic in neurotypical controls, in both grey and white matter, suggesting neural ‘masculinization’. This was not seen in males with autism. How differences in neuroanatomy relate to the similarities in cognition between males and females with autism remains to be understood. Future research should stratify by biological sex to reduce heterogeneity and to provide greater insight into the neurobiology of autism. PMID:23935125
Biological sex affects the neurobiology of autism.
Lai, Meng-Chuan; Lombardo, Michael V; Suckling, John; Ruigrok, Amber N V; Chakrabarti, Bhismadev; Ecker, Christine; Deoni, Sean C L; Craig, Michael C; Murphy, Declan G M; Bullmore, Edward T; Baron-Cohen, Simon
2013-09-01
In autism, heterogeneity is the rule rather than the exception. One obvious source of heterogeneity is biological sex. Since autism was first recognized, males with autism have disproportionately skewed research. Females with autism have thus been relatively overlooked, and have generally been assumed to have the same underlying neurobiology as males with autism. Growing evidence, however, suggests that this is an oversimplification that risks obscuring the biological base of autism. This study seeks to answer two questions about how autism is modulated by biological sex at the level of the brain: (i) is the neuroanatomy of autism different in males and females? and (ii) does the neuroanatomy of autism fit predictions from the 'extreme male brain' theory of autism, in males and/or in females? Neuroanatomical features derived from voxel-based morphometry were compared in a sample of equal-sized high-functioning male and female adults with and without autism (n = 120, n = 30/group). The first question was investigated using a 2 × 2 factorial design, and by spatial overlap analyses of the neuroanatomy of autism in males and females. The second question was tested through spatial overlap analyses of specific patterns predicted by the extreme male brain theory. We found that the neuroanatomy of autism differed between adult males and females, evidenced by minimal spatial overlap (not different from that occurred under random condition) in both grey and white matter, and substantially large white matter regions showing significant sex × diagnosis interactions in the 2 × 2 factorial design. These suggest that autism manifests differently by biological sex. Furthermore, atypical brain areas in females with autism substantially and non-randomly (P < 0.001) overlapped with areas that were sexually dimorphic in neurotypical controls, in both grey and white matter, suggesting neural 'masculinization'. This was not seen in males with autism. How differences in neuroanatomy relate to the similarities in cognition between males and females with autism remains to be understood. Future research should stratify by biological sex to reduce heterogeneity and to provide greater insight into the neurobiology of autism.
Baldwin, Nicole E.; Chesler, Elissa J.; Kirov, Stefan; ...
2005-01-01
Gene expression microarray data can be used for the assembly of genetic coexpression network graphs. Using mRNA samples obtained from recombinant inbred Mus musculus strains, it is possible to integrate allelic variation with molecular and higher-order phenotypes. The depth of quantitative genetic analysis of microarray data can be vastly enhanced utilizing this mouse resource in combination with powerful computational algorithms, platforms, and data repositories. The resulting network graphs transect many levels of biological scale. This approach is illustrated with the extraction of cliques of putatively co-regulated genes and their annotation using gene ontology analysis and cis -regulatory element discovery. Themore » causal basis for co-regulation is detected through the use of quantitative trait locus mapping.« less
Keller, Daniel; Babai, Norbert; Kochubey, Olexiy; Han, Yunyun; Markram, Henry; Schürmann, Felix; Schneggenburger, Ralf
2015-01-01
The spatial arrangement of Ca2+ channels and vesicles remains unknown for most CNS synapses, despite of the crucial importance of this geometrical parameter for the Ca2+ control of transmitter release. At a large model synapse, the calyx of Held, transmitter release is controlled by several Ca2+ channels in a "domain overlap" mode, at least in young animals. To study the geometrical constraints of Ca2+ channel placement in domain overlap control of release, we used stochastic MCell modelling, at active zones for which the position of docked vesicles was derived from electron microscopy (EM). We found that random placement of Ca2+ channels was unable to produce high slope values between release and presynaptic Ca2+ entry, a hallmark of domain overlap, and yielded excessively large release probabilities. The simple assumption that Ca2+ channels can be located anywhere at active zones, except below a critical distance of ~ 30 nm away from docked vesicles ("exclusion zone"), rescued high slope values and low release probabilities. Alternatively, high slope values can also be obtained by placing all Ca2+ channels into a single supercluster, which however results in significantly higher heterogeneity of release probabilities. We also show experimentally that high slope values, and the sensitivity to the slow Ca2+ chelator EGTA-AM, are maintained with developmental maturation of the calyx synapse. Taken together, domain overlap control of release represents a highly organized active zone architecture in which Ca2+ channels must obey a certain distance to docked vesicles. Furthermore, domain overlap can be employed by near-mature, fast-releasing synapses. PMID:25951120
Niche segregation among sympatric Amazonian teiid lizards.
Vitt, L J; Sartorius, S S; Avila-Pires, T C S; Espósito, M C; Miles, D B
2000-02-01
We examined standard niche axes (time, place, and food) for three sympatric teiid lizards in the Amazon rain forest. Activity times during the day were similar among species. Ameiva ameiva were in more open microhabitats and had higher body temperatures compared with the two species of Kentropyx. Microhabitat overlaps were low and not significantly different from simulations based on Monte Carlo analysis. Grasshoppers, crickets, and spiders were important in the diets of all three species and many relatively abundant prey were infrequently eaten (e.g., ants). Dietary overlaps were most similar between the two species of Kentropyx even though microhabitat overlaps were relatively low. A Monte Carlo analysis on prey types revealed that dietary overlaps were higher at all ranks than simulated overlaps indicating that use of prey is not random. Although prey size was correlated with lizard body size, there were no species differences in adjusted prey size. A. ameiva ate more prey items at a given body size than either species of Kentropyx. Body size varies among species, with A. ameiva being the largest and K. altamazonica the smallest. The two species of Kentropyx are most distant morphologically, with A. ameiva intermediate. The most distant species morphologically are the most similar in terms of prey types. A morphological analysis including 15 species from four genera revealed patterns of covariation that reflected phylogenetic affinities (i.e., taxonomic patterns are evident). A cluster analysis revealed that A. ameiva, K. pelviceps, and K. altamazonica were in the same morphological group and that within that group, A. ameiva differed from the rest of the species. In addition, K. pelviceps and K. altamazonica were distinguishable from other species of Kentropyx based on morphology.
Jow, Uei-Ming; Ghovanloo, Maysam
2012-12-21
We present a design methodology for an overlapping hexagonal planar spiral coil (hex-PSC) array, optimized for creation of a homogenous magnetic field for wireless power transmission to randomly moving objects. The modular hex-PSC array has been implemented in the form of three parallel conductive layers, for which an iterative optimization procedure defines the PSC geometries. Since the overlapping hex-PSCs in different layers have different characteristics, the worst case coil-coupling condition should be designed to provide the maximum power transfer efficiency (PTE) in order to minimize the spatial received power fluctuations. In the worst case, the transmitter (Tx) hex-PSC is overlapped by six PSCs and surrounded by six other adjacent PSCs. Using a receiver (Rx) coil, 20 mm in radius, at the coupling distance of 78 mm and maximum lateral misalignment of 49.1 mm (1/√3 of the PSC radius) we can receive power at a PTE of 19.6% from the worst case PSC. Furthermore, we have studied the effects of Rx coil tilting and concluded that the PTE degrades significantly when θ > 60°. Solutions are: 1) activating two adjacent overlapping hex-PSCs simultaneously with out-of-phase excitations to create horizontal magnetic flux and 2) inclusion of a small energy storage element in the Rx module to maintain power in the worst case scenarios. In order to verify the proposed design methodology, we have developed the EnerCage system, which aims to power up biological instruments attached to or implanted in freely behaving small animal subjects' bodies in long-term electrophysiology experiments within large experimental arenas.
Nature versus nurture: Predictability in low-temperature Ising dynamics
NASA Astrophysics Data System (ADS)
Ye, J.; Machta, J.; Newman, C. M.; Stein, D. L.
2013-10-01
Consider a dynamical many-body system with a random initial state subsequently evolving through stochastic dynamics. What is the relative importance of the initial state (“nature”) versus the realization of the stochastic dynamics (“nurture”) in predicting the final state? We examined this question for the two-dimensional Ising ferromagnet following an initial deep quench from T=∞ to T=0. We performed Monte Carlo studies on the overlap between “identical twins” raised in independent dynamical environments, up to size L=500. Our results suggest an overlap decaying with time as t-θh with θh=0.22±0.02; the same exponent holds for a quench to low but nonzero temperature. This “heritability exponent” may equal the persistence exponent for the two-dimensional Ising ferromagnet, but the two differ more generally.
Precise algorithm to generate random sequential adsorption of hard polygons at saturation
DOE Office of Scientific and Technical Information (OSTI.GOV)
Zhang, G.
Random sequential adsorption (RSA) is a time-dependent packing process, in which particles of certain shapes are randomly and sequentially placed into an empty space without overlap. In the infinite-time limit, the density approaches a "saturation'' limit. Although this limit has attracted particular research interest, the majority of past studies could only probe this limit by extrapolation. We have previously found an algorithm to reach this limit using finite computational time for spherical particles, and could thus determine the saturation density of spheres with high accuracy. Here in this paper, we generalize this algorithm to generate saturated RSA packings of two-dimensionalmore » polygons. We also calculate the saturation density for regular polygons of three to ten sides, and obtain results that are consistent with previous, extrapolation-based studies.« less
Precise algorithm to generate random sequential adsorption of hard polygons at saturation
Zhang, G.
2018-04-30
Random sequential adsorption (RSA) is a time-dependent packing process, in which particles of certain shapes are randomly and sequentially placed into an empty space without overlap. In the infinite-time limit, the density approaches a "saturation'' limit. Although this limit has attracted particular research interest, the majority of past studies could only probe this limit by extrapolation. We have previously found an algorithm to reach this limit using finite computational time for spherical particles, and could thus determine the saturation density of spheres with high accuracy. Here in this paper, we generalize this algorithm to generate saturated RSA packings of two-dimensionalmore » polygons. We also calculate the saturation density for regular polygons of three to ten sides, and obtain results that are consistent with previous, extrapolation-based studies.« less
NASA Astrophysics Data System (ADS)
Ni, Yong; Song, Zhaoqiang; Jiang, Hongyuan; Yu, Shu-Hong; He, Linghui
2015-08-01
How nacreous nanocomposites with optimal combinations of stiffness, strength and toughness depend on constituent property and microstructure parameters is studied using a nonlinear shear-lag model. We show that the interfacial elasto-plasticity and the overlapping length between bricks dependent on the brick size and brick staggering mode significantly affect the nonuniformity of the shear stress, the stress-transfer efficiency and thus the failure path. There are two characteristic lengths at which the strength and toughness are optimized respectively. Simultaneous optimization of the strength and toughness is achieved by matching these lengths as close as possible in the nacreous nanocomposite with regularly staggered brick-and-mortar (BM) structure where simultaneous uniform failures of the brick and interface occur. In the randomly staggered BM structure, as the overlapping length is distributed, the nacreous nanocomposite turns the simultaneous uniform failure into progressive interface or brick failure with moderate decrease of the strength and toughness. Specifically there is a parametric range at which the strength and toughness are insensitive to the brick staggering randomness. The obtained results propose a parametric selection guideline based on the length matching for rational design of nacreous nanocomposites. Such guideline explains why nacre is strong and tough while most artificial nacreous nanocomposites aere not.
A local immunization strategy for networks with overlapping community structure
NASA Astrophysics Data System (ADS)
Taghavian, Fatemeh; Salehi, Mostafa; Teimouri, Mehdi
2017-02-01
Since full coverage treatment is not feasible due to limited resources, we need to utilize an immunization strategy to effectively distribute the available vaccines. On the other hand, the structure of contact network among people has a significant impact on epidemics of infectious diseases (such as SARS and influenza) in a population. Therefore, network-based immunization strategies aim to reduce the spreading rate by removing the vaccinated nodes from contact network. Such strategies try to identify more important nodes in epidemics spreading over a network. In this paper, we address the effect of overlapping nodes among communities on epidemics spreading. The proposed strategy is an optimized random-walk based selection of these nodes. The whole process is local, i.e. it requires contact network information in the level of nodes. Thus, it is applicable to large-scale and unknown networks in which the global methods usually are unrealizable. Our simulation results on different synthetic and real networks show that the proposed method outperforms the existing local methods in most cases. In particular, for networks with strong community structures, high overlapping membership of nodes or small size communities, the proposed method shows better performance.
Random covering of the circle: the configuration-space of the free deposition process
NASA Astrophysics Data System (ADS)
Huillet, Thierry
2003-12-01
Consider a circle of circumference 1. Throw at random n points, sequentially, on this circle and append clockwise an arc (or rod) of length s to each such point. The resulting random set (the free gas of rods) is a collection of a random number of clusters with random sizes. It models a free deposition process on a 1D substrate. For such processes, we shall consider the occurrence times (number of rods) and probabilities, as n grows, of the following configurations: those avoiding rod overlap (the hard-rod gas), those for which the largest gap is smaller than rod length s (the packing gas), those (parking configurations) for which hard rod and packing constraints are both fulfilled and covering configurations. Special attention is paid to the statistical properties of each such (rare) configuration in the asymptotic density domain when ns = rgr, for some finite density rgr of points. Using results from spacings in the random division of the circle, explicit large deviation rate functions can be computed in each case from state equations. Lastly, a process consisting in selecting at random one of these specific equilibrium configurations (called the observable) can be modelled. When particularized to the parking model, this system produces parking configurations differently from Rényi's random sequential adsorption model.
Song, Youyi; He, Liang; Zhou, Feng; Chen, Siping; Ni, Dong; Lei, Baiying; Wang, Tianfu
2017-07-01
Quantitative analysis of bacterial morphotypes in the microscope images plays a vital role in diagnosis of bacterial vaginosis (BV) based on the Nugent score criterion. However, there are two main challenges for this task: 1) It is quite difficult to identify the bacterial regions due to various appearance, faint boundaries, heterogeneous shapes, low contrast with the background, and small bacteria sizes with regards to the image. 2) There are numerous bacteria overlapping each other, which hinder us to conduct accurate analysis on individual bacterium. To overcome these challenges, we propose an automatic method in this paper to diagnose BV by quantitative analysis of bacterial morphotypes, which consists of a three-step approach, i.e., bacteria regions segmentation, overlapping bacteria splitting, and bacterial morphotypes classification. Specifically, we first segment the bacteria regions via saliency cut, which simultaneously evaluates the global contrast and spatial weighted coherence. And then Markov random field model is applied for high-quality unsupervised segmentation of small object. We then decompose overlapping bacteria clumps into markers, and associate a pixel with markers to identify evidence for eventual individual bacterium splitting. Next, we extract morphotype features from each bacterium to learn the descriptors and to characterize the types of bacteria using an Adaptive Boosting machine learning framework. Finally, BV diagnosis is implemented based on the Nugent score criterion. Experiments demonstrate that our proposed method achieves high accuracy and efficiency in computation for BV diagnosis.
NASA Astrophysics Data System (ADS)
Tan, Zhi-Jie; Zou, Xian-Wu; Huang, Sheng-You; Zhang, Wei; Jin, Zhun-Zhi
2002-07-01
We investigate the pattern of particle distribution and its evolution with time in multiparticle systems using the model of random walks with memory enhancement and decay. This model describes some biological intelligent walks. With decrease in the memory decay exponent α, the distribution of particles changes from a random dispersive pattern to a locally dense one, and then returns to the random one. Correspondingly, the fractal dimension Df,p characterizing the distribution of particle positions increases from a low value to a maximum and then decreases to the low one again. This is determined by the degree of overlap of regions consisting of sites with remanent information. The second moment of the density ρ(2) was introduced to investigate the inhomogeneity of the particle distribution. The dependence of ρ(2) on α is similar to that of Df,p on α. ρ(2) increases with time as a power law in the process of adjusting the particle distribution, and then ρ(2) tends to a stable equilibrium value.
NASA Astrophysics Data System (ADS)
Liu, Sijia; Sa, Ruhan; Maguire, Orla; Minderman, Hans; Chaudhary, Vipin
2015-03-01
Cytogenetic abnormalities are important diagnostic and prognostic criteria for acute myeloid leukemia (AML). A flow cytometry-based imaging approach for FISH in suspension (FISH-IS) was established that enables the automated analysis of several log-magnitude higher number of cells compared to the microscopy-based approaches. The rotational positioning can occur leading to discordance between spot count. As a solution of counting error from overlapping spots, in this study, a Gaussian Mixture Model based classification method is proposed. The Akaike information criterion (AIC) and Bayesian information criterion (BIC) of GMM are used as global image features of this classification method. Via Random Forest classifier, the result shows that the proposed method is able to detect closely overlapping spots which cannot be separated by existing image segmentation based spot detection methods. The experiment results show that by the proposed method we can obtain a significant improvement in spot counting accuracy.
NASA Astrophysics Data System (ADS)
Liland, Kristian Hovde; Snipen, Lars
When a series of Bernoulli trials occur within a fixed time frame or limited space, it is often interesting to assess if the successful outcomes have occurred completely at random, or if they tend to group together. One example, in genetics, is detecting grouping of genes within a genome. Approximations of the distribution of successes are possible, but they become inaccurate for small sample sizes. In this article, we describe the exact distribution of time between random, non-overlapping successes in discrete time of fixed length. A complete description of the probability mass function, the cumulative distribution function, mean, variance and recurrence relation is included. We propose an associated test for the over-representation of short distances and illustrate the methodology through relevant examples. The theory is implemented in an R package including probability mass, cumulative distribution, quantile function, random number generator, simulation functions, and functions for testing.
Modeling species-abundance relationships in multi-species collections
Peng, S.; Yin, Z.; Ren, H.; Guo, Q.
2003-01-01
Species-abundance relationship is one of the most fundamental aspects of community ecology. Since Motomura first developed the geometric series model to describe the feature of community structure, ecologists have developed many other models to fit the species-abundance data in communities. These models can be classified into empirical and theoretical ones, including (1) statistical models, i.e., negative binomial distribution (and its extension), log-series distribution (and its extension), geometric distribution, lognormal distribution, Poisson-lognormal distribution, (2) niche models, i.e., geometric series, broken stick, overlapping niche, particulate niche, random assortment, dominance pre-emption, dominance decay, random fraction, weighted random fraction, composite niche, Zipf or Zipf-Mandelbrot model, and (3) dynamic models describing community dynamics and restrictive function of environment on community. These models have different characteristics and fit species-abundance data in various communities or collections. Among them, log-series distribution, lognormal distribution, geometric series, and broken stick model have been most widely used.
2014-02-01
were randomly assigned to treatment groups and examined using a pretest , posttest , and follow-up to evaluate the impact of patient interview and...results of the literature review to inform interview and focus group protocol development for follow on data collection. Literature Review The...similar content or overlapped considerably with one another. Accordingly, similar constructs were grouped under meta- construct headings. A total of
Centralities in simplicial complexes. Applications to protein interaction networks.
Estrada, Ernesto; Ross, Grant J
2018-02-07
Complex networks can be used to represent complex systems which originate in the real world. Here we study a transformation of these complex networks into simplicial complexes, where cliques represent the simplices of the complex. We extend the concept of node centrality to that of simplicial centrality and study several mathematical properties of degree, closeness, betweenness, eigenvector, Katz, and subgraph centrality for simplicial complexes. We study the degree distributions of these centralities at the different levels. We also compare and describe the differences between the centralities at the different levels. Using these centralities we study a method for detecting essential proteins in PPI networks of cells and explain the varying abilities of the centrality measures at the different levels in identifying these essential proteins. Copyright © 2017 Elsevier Ltd. All rights reserved.
Analytic Interatomic Forces in the Random Phase Approximation
NASA Astrophysics Data System (ADS)
Ramberger, Benjamin; Schäfer, Tobias; Kresse, Georg
2017-03-01
We discuss that in the random phase approximation (RPA) the first derivative of the energy with respect to the Green's function is the self-energy in the G W approximation. This relationship allows us to derive compact equations for the RPA interatomic forces. We also show that position dependent overlap operators are elegantly incorporated in the present framework. The RPA force equations have been implemented in the projector augmented wave formalism, and we present illustrative applications, including ab initio molecular dynamics simulations, the calculation of phonon dispersion relations for diamond and graphite, as well as structural relaxations for water on boron nitride. The present derivation establishes a concise framework for forces within perturbative approaches and is also applicable to more involved approximations for the correlation energy.
Across-cohort QC analyses of GWAS summary statistics from complex traits.
Chen, Guo-Bo; Lee, Sang Hong; Robinson, Matthew R; Trzaskowski, Maciej; Zhu, Zhi-Xiang; Winkler, Thomas W; Day, Felix R; Croteau-Chonka, Damien C; Wood, Andrew R; Locke, Adam E; Kutalik, Zoltán; Loos, Ruth J F; Frayling, Timothy M; Hirschhorn, Joel N; Yang, Jian; Wray, Naomi R; Visscher, Peter M
2016-01-01
Genome-wide association studies (GWASs) have been successful in discovering SNP trait associations for many quantitative traits and common diseases. Typically, the effect sizes of SNP alleles are very small and this requires large genome-wide association meta-analyses (GWAMAs) to maximize statistical power. A trend towards ever-larger GWAMA is likely to continue, yet dealing with summary statistics from hundreds of cohorts increases logistical and quality control problems, including unknown sample overlap, and these can lead to both false positive and false negative findings. In this study, we propose four metrics and visualization tools for GWAMA, using summary statistics from cohort-level GWASs. We propose methods to examine the concordance between demographic information, and summary statistics and methods to investigate sample overlap. (I) We use the population genetics F st statistic to verify the genetic origin of each cohort and their geographic location, and demonstrate using GWAMA data from the GIANT Consortium that geographic locations of cohorts can be recovered and outlier cohorts can be detected. (II) We conduct principal component analysis based on reported allele frequencies, and are able to recover the ancestral information for each cohort. (III) We propose a new statistic that uses the reported allelic effect sizes and their standard errors to identify significant sample overlap or heterogeneity between pairs of cohorts. (IV) To quantify unknown sample overlap across all pairs of cohorts, we propose a method that uses randomly generated genetic predictors that does not require the sharing of individual-level genotype data and does not breach individual privacy.
Karama, Sherif; Armony, Jorge; Beauregard, Mario
2011-01-01
While the limbic system theory continues to be part of common scientific parlance, its validity has been questioned on multiple grounds. Nonetheless, the issue of whether or not there exists a set of brain areas preferentially dedicated to emotional processing remains central within affective neuroscience. Recently, a widespread neural reference space for emotion which includes limbic as well as other regions was characterized in a large meta-analysis. As methodologically heterogeneous studies go into such meta-analyses, showing in an individual study in which all parameters are kept constant, the involvement of overlapping areas for various emotion conditions in keeping with the neural reference space for emotion, would serve as valuable confirmatory evidence. Here, using fMRI, 20 young adult men were scanned while viewing validated neutral and effective emotion-eliciting short film excerpts shown to quickly and specifically elicit disgust, amusement, or sexual arousal. Each emotion-specific run included, in random order, multiple neutral and emotion condition blocks. A stringent conjunction analysis revealed a large overlap across emotion conditions that fit remarkably well with the neural reference space for emotion. This overlap included symmetrical bilateral activation of the medial prefrontal cortex, the anterior cingulate, the temporo-occipital junction, the basal ganglia, the brainstem, the amygdala, the hippocampus, the thalamus, the subthalamic nucleus, the posterior hypothalamus, the cerebellum, as well as the frontal operculum extending towards the anterior insula. This study clearly confirms for the visual modality, that processing emotional stimuli leads to widespread increases in activation that cluster within relatively confined areas, regardless of valence.
Lee, Jin Seok; Arunkumar, P; Kim, Sunghoon; Lee, In Jae; Lee, Hyungeui; Im, Won Bin
2014-02-15
The white light-emitting diode (WLED) is a state-of-the-art solid state technology, which has replaced conventional lighting systems due to its reduced energy consumption, its reliability, and long life. However, the WLED presents acute challenges in device engineering, due to its lack of color purity, efficacy, and thermal stability of the lighting devices. The prime cause for inadequacies in color purity and luminous efficiency is the spectral overlapping of red components with yellow/green emissions when generating white light by pumping a blue InGaN chip with yellow YAG:Ce³⁺ phosphor, where red phosphor is included, to compensate for deficiencies in the red region. An innovative strategy was formulated to resolve this spectral overlapping by alternatively arranging phosphor-in-glass (PiG) through cutting and reassembling the commercial red CaAlSiN₃:Eu²⁺ and green Lu₃Al₅O₁₂:Ce³⁺ PiG. PiGs were fabricated using glass frits with a low softening temperature of 600°C, which exhibited excellent thermal stability and high transparency, improving life time even at an operating temperature of 200°C. This strategy overcomes the spectral overlapping issue more efficiently than the randomly mixed and patented stacking design of multiple phosphors for a remote-type WLED. The protocol for the current design of PiG possesses excellent thermal and chemical stability with high luminous efficiency and color purity is an attempt to make smarter solid state lighting for high-powered remote-type white light-emitting devices.
Across-cohort QC analyses of GWAS summary statistics from complex traits
Chen, Guo-Bo; Lee, Sang Hong; Robinson, Matthew R; Trzaskowski, Maciej; Zhu, Zhi-Xiang; Winkler, Thomas W; Day, Felix R; Croteau-Chonka, Damien C; Wood, Andrew R; Locke, Adam E; Kutalik, Zoltán; Loos, Ruth J F; Frayling, Timothy M; Hirschhorn, Joel N; Yang, Jian; Wray, Naomi R; Visscher, Peter M
2017-01-01
Genome-wide association studies (GWASs) have been successful in discovering SNP trait associations for many quantitative traits and common diseases. Typically, the effect sizes of SNP alleles are very small and this requires large genome-wide association meta-analyses (GWAMAs) to maximize statistical power. A trend towards ever-larger GWAMA is likely to continue, yet dealing with summary statistics from hundreds of cohorts increases logistical and quality control problems, including unknown sample overlap, and these can lead to both false positive and false negative findings. In this study, we propose four metrics and visualization tools for GWAMA, using summary statistics from cohort-level GWASs. We propose methods to examine the concordance between demographic information, and summary statistics and methods to investigate sample overlap. (I) We use the population genetics Fst statistic to verify the genetic origin of each cohort and their geographic location, and demonstrate using GWAMA data from the GIANT Consortium that geographic locations of cohorts can be recovered and outlier cohorts can be detected. (II) We conduct principal component analysis based on reported allele frequencies, and are able to recover the ancestral information for each cohort. (III) We propose a new statistic that uses the reported allelic effect sizes and their standard errors to identify significant sample overlap or heterogeneity between pairs of cohorts. (IV) To quantify unknown sample overlap across all pairs of cohorts, we propose a method that uses randomly generated genetic predictors that does not require the sharing of individual-level genotype data and does not breach individual privacy. PMID:27552965
Can specific transcriptional regulators assemble a universal cancer signature?
NASA Astrophysics Data System (ADS)
Roy, Janine; Isik, Zerrin; Pilarsky, Christian; Schroeder, Michael
2013-10-01
Recently, there is a lot of interest in using biomarker signatures derived from gene expression data to predict cancer progression. We assembled signatures of 25 published datasets covering 13 types of cancers. How do these signatures compare with each other? On one hand signatures answering the same biological question should overlap, whereas signatures predicting different cancer types should differ. On the other hand, there could also be a Universal Cancer Signature that is predictive independently of the cancer type. Initially, we generate signatures for all datasets using classical approaches such as t-test and fold change and then, we explore signatures resulting from a network-based method, that applies the random surfer model of Google's PageRank algorithm. We show that the signatures as published by the authors and the signatures generated with classical methods do not overlap - not even for the same cancer type - whereas the network-based signatures strongly overlap. Selecting 10 out of 37 universal cancer genes gives the optimal prediction for all cancers thus taking a first step towards a Universal Cancer Signature. We furthermore analyze and discuss the involved genes in terms of the Hallmarks of cancer and in particular single out SP1, JUN/FOS and NFKB1 and examine their specific role in cancer progression.
Lung Cancer: One Disease or Many.
O'Brien, Timothy D; Jia, Peilin; Aldrich, Melinda C; Zhao, Zhongming
2018-06-05
Lung cancer is classified as a single entity comprised of multiple histological subtypes. But how similar are these subtypes on a genetic level? This paper aims to address this question through a concise overview of germline and somatic differences between small cell lung cancer, lung adenocarcinoma, and lung squamous cell carcinoma. We reveal the weak overlap found between these 3 lung cancer subtypes using published data from one of the largest germline genetic studies on lung cancer to date and somatic mutation data from Catalogue of Somatic Mutations in Cancer (COSMIC). These data indicate that these 3 subtypes share very little with each other at the genetic level. At the germline SNP level, only 24 independent SNPs from 2 chromosomes were shared across all 3 subtypes. We also demonstrate that only 30 unique cancer-specific mutations overlap the 3 subtypes from COSMIC, and that this is fewer than overlapping mutations chosen at random. Finally, we show that only 3 somatic mutational signatures are shared between these 3 subtypes. This paper highlights that these 3 lung cancer subtypes may be distinct diseases at the genetic level. In the era of precision medicine, we feel that these genomic differences will be of utmost importance in the choice of lung cancer therapy in the future. © 2018 S. Karger AG, Basel.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Cirac, J. Ignacio; Sierra, German; Instituto de Fisica Teorica, UAM-CSIC, Madrid
We generalize the matrix product states method using the chiral vertex operators of conformal field theory and apply it to study the ground states of the XXZ spin chain, the J{sub 1}-J{sub 2} model and random Heisenberg models. We compute the overlap with the exact wave functions, spin-spin correlators, and the Renyi entropy, showing that critical systems can be described by this method. For rotational invariant ansatzs we construct an inhomogenous extension of the Haldane-Shastry model with long-range exchange interactions.
Evidence of community structure in biomedical research grant collaborations.
Nagarajan, Radhakrishnan; Kalinka, Alex T; Hogan, William R
2013-02-01
Recent studies have clearly demonstrated a shift towards collaborative research and team science approaches across a spectrum of disciplines. Such collaborative efforts have also been acknowledged and nurtured by popular extramurally funded programs including the Clinical Translational Science Award (CTSA) conferred by the National Institutes of Health. Since its inception, the number of CTSA awardees has steadily increased to 60 institutes across 30 states. One of the objectives of CTSA is to accelerate translation of research from bench to bedside to community and train a new genre of researchers under the translational research umbrella. Feasibility of such a translation implicitly demands multi-disciplinary collaboration and mentoring. Networks have proven to be convenient abstractions for studying research collaborations. The present study is a part of the CTSA baseline study and investigates existence of possible community-structure in Biomedical Research Grant Collaboration (BRGC) networks across data sets retrieved from the internally developed grants management system, the Automated Research Information Administrator (ARIA) at the University of Arkansas for Medical Sciences (UAMS). Fastgreedy and link-community community-structure detection algorithms were used to investigate the presence of non-overlapping and overlapping community-structure and their variation across years 2006 and 2009. A surrogate testing approach in conjunction with appropriate discriminant statistics, namely: the modularity index and the maximum partition density is proposed to investigate whether the community-structure of the BRGC networks were different from those generated by certain types of random graphs. Non-overlapping as well as overlapping community-structure detection algorithms indicated the presence of community-structure in the BRGC network. Subsequent, surrogate testing revealed that random graph models considered in the present study may not necessarily be appropriate generative mechanisms of the community-structure in the BRGC networks. The discrepancy in the community-structure between the BRGC networks and the random graph surrogates was especially pronounced at 2009 as opposed to 2006 indicating a possible shift towards team-science and formation of non-trivial modular patterns with time. The results also clearly demonstrate presence of inter-departmental and multi-disciplinary collaborations in BRGC networks. While the results are presented on BRGC networks as a part of the CTSA baseline study at UAMS, the proposed methodologies are as such generic with potential to be extended across other CTSA organizations. Understanding the presence of community-structure can supplement more traditional network analysis as they're useful in identifying research teams and their inter-connections as opposed to the role of individual nodes in the network. Such an understanding can be a critical step prior to devising meaningful interventions for promoting team-science, multi-disciplinary collaborations, cross-fertilization of ideas across research teams and identifying suitable mentors. Understanding the temporal evolution of these communities may also be useful in CTSA evaluation. Copyright © 2012. Published by Elsevier Inc.
Real-Time System Verification by Kappa-Induction
NASA Technical Reports Server (NTRS)
Pike, Lee S.
2005-01-01
We report the first formal verification of a reintegration protocol for a safety-critical, fault-tolerant, real-time distributed embedded system. A reintegration protocol increases system survivability by allowing a node that has suffered a fault to regain state consistent with the operational nodes. The protocol is verified in the Symbolic Analysis Laboratory (SAL), where bounded model checking and decision procedures are used to verify infinite-state systems by k-induction. The protocol and its environment are modeled as synchronizing timeout automata. Because k-induction is exponential with respect to k, we optimize the formal model to reduce the size of k. Also, the reintegrator's event-triggered behavior is conservatively modeled as time-triggered behavior to further reduce the size of k and to make it invariant to the number of nodes modeled. A corollary is that a clique avoidance property is satisfied.
Fast determination of structurally cohesive subgroups in large networks
Sinkovits, Robert S.; Moody, James; Oztan, B. Tolga; White, Douglas R.
2016-01-01
Structurally cohesive subgroups are a powerful and mathematically rigorous way to characterize network robustness. Their strength lies in the ability to detect strong connections among vertices that not only have no neighbors in common, but that may be distantly separated in the graph. Unfortunately, identifying cohesive subgroups is a computationally intensive problem, which has limited empirical assessments of cohesion to relatively small graphs of at most a few thousand vertices. We describe here an approach that exploits the properties of cliques, k-cores and vertex separators to iteratively reduce the complexity of the graph to the point where standard algorithms can be used to complete the analysis. As a proof of principle, we apply our method to the cohesion analysis of a 29,462-vertex biconnected component extracted from a 128,151-vertex co-authorship data set. PMID:28503215
Emergence of Leadership in Communication
Allahverdyan, Armen E.; Galstyan, Aram
2016-01-01
We study a neuro-inspired model that mimics a discussion (or information dissemination) process in a network of agents. During their interaction, agents redistribute activity and network weights, resulting in emergence of leader(s). The model is able to reproduce the basic scenarios of leadership known in nature and society: laissez-faire (irregular activity, weak leadership, sizable inter-follower interaction, autonomous sub-leaders); participative or democratic (strong leadership, but with feedback from followers); and autocratic (no feedback, one-way influence). Several pertinent aspects of these scenarios are found as well—e.g., hidden leadership (a hidden clique of agents driving the official autocratic leader), and successive leadership (two leaders influence followers by turns). We study how these scenarios emerge from inter-agent dynamics and how they depend on behavior rules of agents—in particular, on their inertia against state changes. PMID:27532484
Emergence of Leadership in Communication.
Allahverdyan, Armen E; Galstyan, Aram
2016-01-01
We study a neuro-inspired model that mimics a discussion (or information dissemination) process in a network of agents. During their interaction, agents redistribute activity and network weights, resulting in emergence of leader(s). The model is able to reproduce the basic scenarios of leadership known in nature and society: laissez-faire (irregular activity, weak leadership, sizable inter-follower interaction, autonomous sub-leaders); participative or democratic (strong leadership, but with feedback from followers); and autocratic (no feedback, one-way influence). Several pertinent aspects of these scenarios are found as well-e.g., hidden leadership (a hidden clique of agents driving the official autocratic leader), and successive leadership (two leaders influence followers by turns). We study how these scenarios emerge from inter-agent dynamics and how they depend on behavior rules of agents-in particular, on their inertia against state changes.
Applications of graph theory in protein structure identification
2011-01-01
There is a growing interest in the identification of proteins on the proteome wide scale. Among different kinds of protein structure identification methods, graph-theoretic methods are very sharp ones. Due to their lower costs, higher effectiveness and many other advantages, they have drawn more and more researchers’ attention nowadays. Specifically, graph-theoretic methods have been widely used in homology identification, side-chain cluster identification, peptide sequencing and so on. This paper reviews several methods in solving protein structure identification problems using graph theory. We mainly introduce classical methods and mathematical models including homology modeling based on clique finding, identification of side-chain clusters in protein structures upon graph spectrum, and de novo peptide sequencing via tandem mass spectrometry using the spectrum graph model. In addition, concluding remarks and future priorities of each method are given. PMID:22165974
Influences of adding negative couplings between cliques of Kuramoto-like oscillators
NASA Astrophysics Data System (ADS)
Yang, Li-xin; Lin, Xiao-lin; Jiang, Jun
2018-06-01
We study the dynamics in a clustered network of coupled oscillators by considering positive and negative coupling schemes. Second order oscillators can be interpreted as a model of consumers and generators working in a power network. Numerical results indicate that coupling strategies play an important role in the synchronizability of the clustered power network. It is found that the synchronizability can be enhanced as the positive intragroup connections increase. Meanwhile, when the intragroup interactions are positive and the probability p that two nodes belonging to different clusters are connected is increased, the synchronization has better performance. Besides, when the intragroup connections are negative, it is observed that the power network has poor synchronizability as the probability p increases. Our simulation results can help us understand the collective behavior of the power network with positive and negative couplings.
2008-12-01
1, /(2 ) T T VR A t A VR f t t F t VRt A t A VR t A VR ∈⎧ = ⎨ ⎩ <⎧ ⎪= ∈⎨ ⎪ >⎩ (2) The mean time to detection is given by...follows: Exhaustive Search (Black line): ( ) (2 ) /T sF t VRt A= . Random Search (Pink line): 2( ) 1 (1 / ) exp( 2 / )T s sF t R A RVt Aπ
Wilhelm, Jan; Seewald, Patrick; Del Ben, Mauro; Hutter, Jürg
2016-12-13
We present an algorithm for computing the correlation energy in the random phase approximation (RPA) in a Gaussian basis requiring [Formula: see text] operations and [Formula: see text] memory. The method is based on the resolution of the identity (RI) with the overlap metric, a reformulation of RI-RPA in the Gaussian basis, imaginary time, and imaginary frequency integration techniques, and the use of sparse linear algebra. Additional memory reduction without extra computations can be achieved by an iterative scheme that overcomes the memory bottleneck of canonical RPA implementations. We report a massively parallel implementation that is the key for the application to large systems. Finally, cubic-scaling RPA is applied to a thousand water molecules using a correlation-consistent triple-ζ quality basis.
Single-Molecule Electrical Random Resequencing of DNA and RNA
NASA Astrophysics Data System (ADS)
Ohshiro, Takahito; Matsubara, Kazuki; Tsutsui, Makusu; Furuhashi, Masayuki; Taniguchi, Masateru; Kawai, Tomoji
2012-07-01
Two paradigm shifts in DNA sequencing technologies--from bulk to single molecules and from optical to electrical detection--are expected to realize label-free, low-cost DNA sequencing that does not require PCR amplification. It will lead to development of high-throughput third-generation sequencing technologies for personalized medicine. Although nanopore devices have been proposed as third-generation DNA-sequencing devices, a significant milestone in these technologies has been attained by demonstrating a novel technique for resequencing DNA using electrical signals. Here we report single-molecule electrical resequencing of DNA and RNA using a hybrid method of identifying single-base molecules via tunneling currents and random sequencing. Our method reads sequences of nine types of DNA oligomers. The complete sequence of 5'-UGAGGUA-3' from the let-7 microRNA family was also identified by creating a composite of overlapping fragment sequences, which was randomly determined using tunneling current conducted by single-base molecules as they passed between a pair of nanoelectrodes.
Distribution law of the Dirac eigenmodes in QCD
NASA Astrophysics Data System (ADS)
Catillo, Marco; Glozman, Leonid Ya.
2018-04-01
The near-zero modes of the Dirac operator are connected to spontaneous breaking of chiral symmetry in QCD (SBCS) via the Banks-Casher relation. At the same time, the distribution of the near-zero modes is well described by the Random Matrix Theory (RMT) with the Gaussian Unitary Ensemble (GUE). Then, it has become a standard lore that a randomness, as observed through distributions of the near-zero modes of the Dirac operator, is a consequence of SBCS. The higher-lying modes of the Dirac operator are not affected by SBCS and are sensitive to confinement physics and related SU(2)CS and SU(2NF) symmetries. We study the distribution of the near-zero and higher-lying eigenmodes of the overlap Dirac operator within NF = 2 dynamical simulations. We find that both the distributions of the near-zero and higher-lying modes are perfectly described by GUE of RMT. This means that randomness, while consistent with SBCS, is not a consequence of SBCS and is linked to the confining chromo-electric field.
He, Mengyang; Qi, Changzhu; Lu, Yang; Song, Amanda; Hayat, Saba Z; Xu, Xia
2018-05-21
Extensive studies have shown that a sports expert is superior to a sports novice in visually perceptual-cognitive processes of sports scene information, however the attentional and neural basis of it has not been thoroughly explored. The present study examined whether a sport expert has the attentional superiority on scene information relevant to his/her sport skill, and explored what factor drives this superiority. To address this problem, EEGs were recorded as participants passively viewed sport scenes (tennis vs. non-tennis) and negative emotional faces in the context of a visual attention task, where the pictures of sport scenes or of negative emotional faces randomly followed the pictures with overlapping sport scenes and negative emotional faces. ERP results showed that for experts, the evoked potential of attentional competition elicited by the overlap of tennis scene was significantly larger than that evoked by the overlap of non-tennis scene, while this effect was absent for novices. The LORETA showed that the experts' left medial frontal gyrus (MFG) cortex was significantly more active as compared to the right MFG when processing the overlap of tennis scene, but the lateralization effect was not significant in novices. Those results indicate that experts have attentional superiority on skill-related scene information, despite intruding the scene through negative emotional faces that are prone to cause negativity bias toward their visual field as a strong distractor. This superiority is actuated by the activation of left MFG cortex and probably due to self-reference. Copyright © 2018 The Authors. Published by Elsevier Ltd.. All rights reserved.
Karama, Sherif; Armony, Jorge; Beauregard, Mario
2011-01-01
While the limbic system theory continues to be part of common scientific parlance, its validity has been questioned on multiple grounds. Nonetheless, the issue of whether or not there exists a set of brain areas preferentially dedicated to emotional processing remains central within affective neuroscience. Recently, a widespread neural reference space for emotion which includes limbic as well as other regions was characterized in a large meta-analysis. As methodologically heterogeneous studies go into such meta-analyses, showing in an individual study in which all parameters are kept constant, the involvement of overlapping areas for various emotion conditions in keeping with the neural reference space for emotion, would serve as valuable confirmatory evidence. Here, using fMRI, 20 young adult men were scanned while viewing validated neutral and effective emotion-eliciting short film excerpts shown to quickly and specifically elicit disgust, amusement, or sexual arousal. Each emotion-specific run included, in random order, multiple neutral and emotion condition blocks. A stringent conjunction analysis revealed a large overlap across emotion conditions that fit remarkably well with the neural reference space for emotion. This overlap included symmetrical bilateral activation of the medial prefrontal cortex, the anterior cingulate, the temporo-occipital junction, the basal ganglia, the brainstem, the amygdala, the hippocampus, the thalamus, the subthalamic nucleus, the posterior hypothalamus, the cerebellum, as well as the frontal operculum extending towards the anterior insula. This study clearly confirms for the visual modality, that processing emotional stimuli leads to widespread increases in activation that cluster within relatively confined areas, regardless of valence. PMID:21818311
A ribonucleotide Origin for Life - Fluctuation and Near-ideal Reactions
NASA Astrophysics Data System (ADS)
Yarus, Michael
2013-02-01
Oligoribonucleotides are potentially capable of Darwinian evolution - they may replicate and can express an independent chemical phenotype, as embodied in modern enzymatic cofactors. Using quantitative chemical kinetics on a sporadically fed ribonucleotide pool, unreliable supplies of unstable activated ribonucleotides A and B at low concentrations recurrently yield a replicating AB polymer with a potential chemical phenotype. Self-complementary replication in the pool occurs during a minority (here ≈ 35 %) of synthetic episodes that exploit coincidental overlaps between 4, 5 or 6 spikes of arbitrarily arriving substrates. Such uniquely productive synthetic episodes, in which near-ideal reaction sequences recur at random, account for most AB oligonucleotide synthesis, and therefore underlie the emergence of net replication under realistic primordial conditions. Because overlapping substrate spikes are unexpectedly frequent, and in addition, complex spike sequences appear disproportionately, a sporadically fed pool can host unexpectedly complex syntheses. Thus, primordial substrate fluctuations are not necessarily a barrier to Darwinism, but instead can facilitate early evolution.
Epidemic spreading and immunization strategy in multiplex networks
NASA Astrophysics Data System (ADS)
Alvarez Zuzek, Lucila G.; Buono, Camila; Braunstein, Lidia A.
2015-09-01
A more connected world has brought major consequences such as facilitate the spread of diseases all over the world to quickly become epidemics, reason why researchers are concentrated in modeling the propagation of epidemics and outbreaks in multilayer networks. In this networks all nodes interact in different layers with different type of links. However, in many scenarios such as in the society, a multiplex network framework is not completely suitable since not all individuals participate in all layers. In this paper, we use a partially overlapped, multiplex network where only a fraction of the individuals are shared by the layers. We develop a mitigation strategy for stopping a disease propagation, considering the Susceptible-Infected- Recover model, in a system consisted by two layers. We consider a random immunization in one of the layers and study the effect of the overlapping fraction in both, the propagation of the disease and the immunization strategy. Using branching theory, we study this scenario theoretically and via simulations and find a lower epidemic threshold than in the case without strategy.
A ribonucleotide Origin for Life--fluctuation and near-ideal reactions.
Yarus, Michael
2013-02-01
Oligoribonucleotides are potentially capable of Darwinian evolution - they may replicate and can express an independent chemical phenotype, as embodied in modern enzymatic cofactors. Using quantitative chemical kinetics on a sporadically fed ribonucleotide pool, unreliable supplies of unstable activated ribonucleotides A and B at low concentrations recurrently yield a replicating AB polymer with a potential chemical phenotype. Self-complementary replication in the pool occurs during a minority (here ≈ 35 %) of synthetic episodes that exploit coincidental overlaps between 4, 5 or 6 spikes of arbitrarily arriving substrates. Such uniquely productive synthetic episodes, in which near-ideal reaction sequences recur at random, account for most AB oligonucleotide synthesis, and therefore underlie the emergence of net replication under realistic primordial conditions. Because overlapping substrate spikes are unexpectedly frequent, and in addition, complex spike sequences appear disproportionately, a sporadically fed pool can host unexpectedly complex syntheses. Thus, primordial substrate fluctuations are not necessarily a barrier to Darwinism, but instead can facilitate early evolution.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Hillman, Benjamin R.; Marchand, Roger T.; Ackerman, Thomas P.
Satellite simulators are often used to account for limitations in satellite retrievals of cloud properties in comparisons between models and satellite observations. The purpose of the simulator framework is to enable more robust evaluation of model cloud properties, so that di erences between models and observations can more con dently be attributed to model errors. However, these simulators are subject to uncertainties themselves. A fundamental uncertainty exists in connecting the spatial scales at which cloud properties are retrieved with those at which clouds are simulated in global models. In this study, we create a series of sensitivity tests using 4more » km global model output from the Multiscale Modeling Framework to evaluate the sensitivity of simulated satellite retrievals when applied to climate models whose grid spacing is many tens to hundreds of kilometers. In particular, we examine the impact of cloud and precipitation overlap and of condensate spatial variability. We find the simulated retrievals are sensitive to these assumptions. Specifically, using maximum-random overlap with homogeneous cloud and precipitation condensate, which is often used in global climate models, leads to large errors in MISR and ISCCP-simulated cloud cover and in CloudSat-simulated radar reflectivity. To correct for these errors, an improved treatment of unresolved clouds and precipitation is implemented for use with the simulator framework and is shown to substantially reduce the identified errors.« less
Li, Wei; Cheng, Ji-Min; Yu, Kai-Liang; Epstein, Howard E.; Du, Guo-Zhen
2015-01-01
Fertilization via nutrient deposition and agricultural inputs is one of the most important factors driving decreases in plant diversity. However, we still do not fully understand which processes (niche process or neutral process) are more important in leading to decreases in plant diversity caused by fertilization. A hypothesis-based approach was used to test the relative importance of niche versus neutral processes along a fertilization gradient in an alpine meadow community on the eastern Tibetan plateau, China. Niche overlap values were calculated for species biomass, and the null model was used to generate the values of niche overlap expected at random. A linear regression modeling was used to evaluate the relationship between functional traits (specific leaf area, leaf dry matter content, and leaf total nitrogen concentration) and species relative abundance. Our results demonstrated that observed niche overlap for species biomass was significantly higher than expected at lower fertilization gradients. Moreover, we also found a significantly negative correlation between species relative abundance and specific leaf area and leaf dry matter content, but a significantly positive correlation between relative abundance and leaf nitrogen concentration at lower fertilization gradients. However, these relationships were not significant at higher fertilization gradients. We concluded that community assembly is dynamic progression along the environmental gradients, and niche and neutral processes may together determine species diversity loss in response to fertilization. PMID:26280919
Prieto, Carlos; Dahners, Hans W.
2009-01-01
Coexistence by a great number of species could reflect niche segregation at several resource axes. Differences in the use of a hilltop as mating site for a Eumaeini (Lycaenidae) community were measured to test whether niche segregation exists within this group. Specimens were collected throughout 21 samplings between July-October of 2004 and July-October of 2005. Two environmental variables and three temporal-spacial variables were analyzed utilizing null models with three randomization algorithms. Significant differences were found among the species with respect to utilization of vertical space, horizontal space, temporary distribution and environmental temperature. The species did not show significant differences with respect to light intensity. For all samplings, the niche overlap observed in the two environmental variables were higher or significantly higher than expected by chance, suggesting that niche segregation does not exist due to competition within these variables. Similar results were observed for temporal distribution. Some evidence of niche segregation was found in vertical space and horizontal space variables where some samples presented lower overlap than expected by chance. The results pointed out that community's assemblage could be mainly shaped in two ways. The first is that species with determined habitat requirements fit into unoccupied niche spaces. The second is by niche segregation in the vertical space distribution variable. PMID:19613456
Walker, Gary V; Awan, Musaddiq; Tao, Randa; Koay, Eugene J; Boehling, Nicholas S; Grant, Jonathan D; Sittig, Dean F; Gunn, Gary Brandon; Garden, Adam S; Phan, Jack; Morrison, William H; Rosenthal, David I; Mohamed, Abdallah Sherif Radwan; Fuller, Clifton David
2014-09-01
Target volumes and organs-at-risk (OARs) for radiotherapy (RT) planning are manually defined, which is a tedious and inaccurate process. We sought to assess the feasibility, time reduction, and acceptability of an atlas-based autosegmentation (AS) compared to manual segmentation (MS) of OARs. A commercial platform generated 16 OARs. Resident physicians were randomly assigned to modify AS OAR (AS+R) or to draw MS OAR followed by attending physician correction. Dice similarity coefficient (DSC) was used to measure overlap between groups compared with attending approved OARs (DSC=1 means perfect overlap). 40 cases were segmented. Mean ± SD segmentation time in the AS+R group was 19.7 ± 8.0 min, compared to 28.5 ± 8.0 min in the MS cohort, amounting to a 30.9% time reduction (Wilcoxon p<0.01). For each OAR, AS DSC was statistically different from both AS+R and MS ROIs (all Steel-Dwass p<0.01) except the spinal cord and the mandible, suggesting oversight of AS/MS processes is required; AS+R and MS DSCs were non-different. AS compared to attending approved OAR DSCs varied considerably, with a chiasm mean ± SD DSC of 0.37 ± 0.32 and brainstem of 0.97 ± 0.03. Autosegmentation provides a time savings in head and neck regions of interest generation. However, attending physician approval remains vital. Copyright © 2014 Elsevier Ireland Ltd. All rights reserved.
How Relations are Built within a SNS World -- Social Network Analysis on Mixi --
NASA Astrophysics Data System (ADS)
Matsuo, Yutaka; Yasud, Yuki
Our purpose here is to (1) investigate the structure of the personal networks developed on mixi, a Japanese social networking service (SNS), and (2) to consider the governing mechanism which guides participants of a SNS to form an aggregate network. Our findings are as follows:the clustering coefficient of the network is as high as 0.33 while the characteristic path lenght is as low as 5.5. A network among central users (over 300 edges) consist of two cliques, which seems to be very fragile. Community-affiliation network suggests there are several easy-entry communities which later lead users to more high-entry, unique-theme communities. The analysis on connectedness within a community reveals the importance of real-world interaction. Lastly, we depict a probable image of the entire ecology on {\\\\em mixi} among users and communities, which contributes broadly to social systems on the Web.
Mapping Engagement in Twitter-Based Support Networks for Adult Smoking Cessation
Pechmann, Cornelia; Wang, Cheng; Pan, Li; Delucchi, Kevin; Prochaska, Judith J.
2016-01-01
We examined engagement in novel quit-smoking private social support networks on Twitter, January 2012 to April 2014. We mapped communication patterns within 8 networks of adult smokers (n = 160) with network ties defined by participants’ tweets over 3 time intervals, and examined tie reciprocity, tie strength, in-degree centrality (popularity), 3-person triangles, 4-person cliques, network density, and abstinence status. On average, more than 50% of ties were reciprocated in most networks and most ties were between abstainers and nonabstainers. Tweets formed into more aggregated patterns especially early in the study. Across networks, 35.00% (7 days after the quit date), 49.38% (30 days), and 46.88% (60 days) abstained from smoking. We demonstrated that abstainers and nonabstainers engaged with one another in dyads and small groups. This study preliminarily suggests potential for Twitter as a platform for adult smoking-cessation interventions. PMID:27310342
Inner-City Youth Development Organizations: Strengthening Programs for Adolescent Girls
Hirsch, Barton J.; Roffman, Jennifer G.; Deutsch, Nancy L.; Flynn, Cathy A.; Loder, Tondra L.; Pagano, Maria E.
2012-01-01
The challenges of early adolescence are intensified for girls of color who live in disadvantaged urban communities. One response to the needs of these girls comes from the Boys & Girls Clubs of America (BGCA), a youth development organization that has a long-standing presence in inner-city neighborhoods. A gender equity initiative designed to strengthen programming for minority girls at a BGCA affiliate in a major urban center was examined. Drawing on initial qualitative findings, a conceptual framework is presented for understanding the ways in which the clubs can affect urban early adolescent girls’ self-esteem. Several strategic choices confronting this initiative then are considered. The authors emphasize the creation of a “home place” that enables the development of self via organizational responsiveness to girls’ voices, strong bonds between girls and staff, adaptive peer friendship cliques, and the development of programs that fuse the interests of girls and adult staff. PMID:23565020
The network of concepts in written texts
NASA Astrophysics Data System (ADS)
Caldeira, S. M. G.; Petit Lobão, T. C.; Andrade, R. F. S.; Neme, A.; Miranda, J. G. V.
2006-02-01
Complex network theory is used to investigate the structure of meaningful concepts in written texts of individual authors. Networks have been constructed after a two phase filtering, where words with less meaning contents are eliminated and all remaining words are set to their canonical form, without any number, gender or time flexion. Each sentence in the text is added to the network as a clique. A large number of written texts have been scrutinised, and it is found that texts have small-world as well as scale-free structures. The growth process of these networks has also been investigated, and a universal evolution of network quantifiers have been found among the set of texts written by distinct authors. Further analyses, based on shuffling procedures taken either on the texts or on the constructed networks, provide hints on the role played by the word frequency and sentence length distributions to the network structure.
Mapping Engagement in Twitter-Based Support Networks for Adult Smoking Cessation.
Lakon, Cynthia M; Pechmann, Cornelia; Wang, Cheng; Pan, Li; Delucchi, Kevin; Prochaska, Judith J
2016-08-01
We examined engagement in novel quit-smoking private social support networks on Twitter, January 2012 to April 2014. We mapped communication patterns within 8 networks of adult smokers (n = 160) with network ties defined by participants' tweets over 3 time intervals, and examined tie reciprocity, tie strength, in-degree centrality (popularity), 3-person triangles, 4-person cliques, network density, and abstinence status. On average, more than 50% of ties were reciprocated in most networks and most ties were between abstainers and nonabstainers. Tweets formed into more aggregated patterns especially early in the study. Across networks, 35.00% (7 days after the quit date), 49.38% (30 days), and 46.88% (60 days) abstained from smoking. We demonstrated that abstainers and nonabstainers engaged with one another in dyads and small groups. This study preliminarily suggests potential for Twitter as a platform for adult smoking-cessation interventions.
Population differentiation in Pacific salmon: local adaptation, genetic drift, or the environment?
Adkison, Milo D.
1995-01-01
Morphological, behavioral, and life-history differences between Pacific salmon (Oncorhynchus spp.) populations are commonly thought to reflect local adaptation, and it is likewise common to assume that salmon populations separated by small distances are locally adapted. Two alternatives to local adaptation exist: random genetic differentiation owing to genetic drift and founder events, and genetic homogeneity among populations, in which differences reflect differential trait expression in differing environments. Population genetics theory and simulations suggest that both alternatives are possible. With selectively neutral alleles, genetic drift can result in random differentiation despite many strays per generation. Even weak selection can prevent genetic drift in stable populations; however, founder effects can result in random differentiation despite selective pressures. Overlapping generations reduce the potential for random differentiation. Genetic homogeneity can occur despite differences in selective regimes when straying rates are high. In sum, localized differences in selection should not always result in local adaptation. Local adaptation is favored when population sizes are large and stable, selection is consistent over large areas, selective diffeentials are large, and straying rates are neither too high nor too low. Consideration of alternatives to local adaptation would improve both biological research and salmon conservation efforts.
Moore, M A; Katzgraber, Helmut G
2014-10-01
Starting from preferences on N proposed policies obtained via questionnaires from a sample of the electorate, an Ising spin-glass model in a field can be constructed from which a political party could find the subset of the proposed policies which would maximize its appeal, form a coherent choice in the eyes of the electorate, and have maximum overlap with the party's existing policies. We illustrate the application of the procedure by simulations of a spin glass in a random field on scale-free networks.
NASA Technical Reports Server (NTRS)
Liu, Hongyu; Crawford, James H.; Pierce, Robert B.; Norris, Peter; Platnick, Steven E.; Chen, Gao; Logan, Jennifer A.; Yantosca, Robert M.; Evans, Mat J.; Kittaka, Chieko;
2006-01-01
Clouds exert an important influence on tropospheric photochemistry through modification of solar radiation that determines photolysis frequencies (J-values). We assess the radiative effect of clouds on photolysis frequencies and key oxidants in the troposphere with a global three-dimensional (3-D) chemical transport model (GEOS-CHEM) driven by assimilated meteorological observations from the Goddard Earth Observing System data assimilation system (GEOS DAS) at the NASA Global Modeling and Assimilation Office (GMAO). We focus on the year of 2001 with the GEOS-3 meteorological observations. Photolysis frequencies are calculated using the Fast-J radiative transfer algorithm. The GEOS-3 global cloud optical depth and cloud fraction are evaluated and generally consistent with the satellite retrieval products from the Moderate Resolution Imaging Spectroradiometer (MODIS) and the International Satellite Cloud Climatology Project (ISCCP). Results using the linear assumption, which assumes linear scaling of cloud optical depth with cloud fraction in a grid box, show global mean OH concentrations generally increase by less than 6% because of the radiative effect of clouds. The OH distribution shows much larger changes (with maximum decrease of approx.20% near the surface), reflecting the opposite effects of enhanced (weakened) photochemistry above (below) clouds. The global mean photolysis frequencies for J[O1D] and J[NO2] in the troposphere change by less than 5% because of clouds; global mean O3 concentrations in the troposphere increase by less than 5%. This study shows tropical upper tropospheric O3 to be less sensitive to the radiative effect of clouds than previously reported (approx.5% versus approx.20-30%). These results emphasize that the dominant effect of clouds is to influence the vertical redistribution of the intensity of photochemical activity while global average effects remain modest, again contrasting with previous studies. Differing vertical distributions of clouds may explain part, but not the majority, of these discrepancies between models. Using an approximate random overlap or a maximum-random overlap scheme to take account of the effect of cloud overlap in the vertical reduces the impact of clouds on photochemistry but does not significantly change our results with respect to the modest global average effect.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Tai, An, E-mail: atai@mcw.edu; Liang, Zhiwen; Radiation Oncology Center, Wuhan Union Hospital, Huazhong University of Science and Technology, Wuhan
2013-08-01
Purpose: The purposes of this study were to quantify respiration-induced organ motions for pancreatic cancer patients and to explore strategies to account for these motions. Methods and Materials: Both 3-dimensional computed tomography (3DCT) and 4-dimensional computed tomography (4DCT) scans were acquired sequentially for 15 pancreatic cancer patients, including 10 randomly selected patients and 5 patients selected from a subgroup of patients with large tumor respiratory motions. 3DCTs were fused with 2 sets of 4DCT data at the end of exhale phase (50%) and the end of inhale phase (0%). The target was delineated on the 50% and 0% phase CTmore » sets, and the organs at risk were drawn on the 3DCT. These contours were populated to the CT sets at other respiratory phases based on deformable image registration. Internal target volumes (ITV) were generated by tracing the target contours of all phases (ITV{sub 10}), 3 phases of 0%, 20% and 50% (ITV{sub 3}), and 2 phases of 0% and 50% (ITV{sub 2}). ITVs generated from phase images were compared using percentage of volume overlap, Dice coefficient, geometric centers, and average surface distance. Results: Volume variations of pancreas, kidneys, and liver as a function of respiratory phases were small (<5%) during respiration. For the 10 randomly selected patients, peak-to-peak amplitudes of liver, left kidney, right kidney, and the target along the superior-inferior (SI) direction were 7.9 ± 3.2 mm, 7.1 ± 3.1 mm, 5.7 ± 3.2 mm, and 5.9 ± 2.8 mm, respectively. The percentage of volume overlap and Dice coefficient were 92% ± 1% and 96% ± 1% between ITV{sub 10} and ITV{sub 2} and 96% ± 1% and 98% ± 1% between ITV{sub 10} and ITV{sub 3}, respectively. The percentage of volume overlap between ITV{sub 10} and ITV{sub 3} was 93.6 ± 1.1 for patients with tumor motion >8 mm. Conclusions: Appropriate motion management strategies are proposed for radiation treatment planning of pancreatic tumors based on magnitudes of tumor respiratory motions.« less
Singh, Minerva; Friess, Daniel A; Vilela, Bruno; Alban, Jose Don T De; Monzon, Angelica Kristina V; Veridiano, Rizza Karen A; Tumaneng, Roven D
2017-01-01
This study maps distribution and spatial congruence between Above-Ground Biomass (AGB) and species richness of IUCN listed conservation-dependent and endemic avian fauna in Palawan, Philippines. Grey Level Co-Occurrence Texture Matrices (GLCMs) extracted from Landsat and ALOS-PALSAR were used in conjunction with local field data to model and map local-scale field AGB using the Random Forest algorithm (r = 0.92 and RMSE = 31.33 Mg·ha-1). A support vector regression (SVR) model was used to identify the factors influencing variation in avian species richness at a 1km scale. AGB is one of the most important determinants of avian species richness for the study area. Topographic factors and anthropogenic factors such as distance from the roads were also found to strongly influence avian species richness. Hotspots of high AGB and high species richness concentration were mapped using hotspot analysis and the overlaps between areas of high AGB and avian species richness was calculated. Results show that the overlaps between areas of high AGB with high IUCN red listed avian species richness and endemic avian species richness were fairly limited at 13% and 8% at the 1-km scale. The overlap between 1) low AGB and low IUCN richness, and 2) low AGB and low endemic avian species richness was higher at 36% and 12% respectively. The enhanced capacity to spatially map the correlation between AGB and avian species richness distribution will further assist the conservation and protection of forest areas and threatened avian species.
NASA Astrophysics Data System (ADS)
Fyodorov, Yan V.; Bouchaud, Jean-Philippe
2008-08-01
We construct an N-dimensional Gaussian landscape with multiscale, translation invariant, logarithmic correlations and investigate the statistical mechanics of a single particle in this environment. In the limit of high dimension N → ∞ the free energy of the system and overlap function are calculated exactly using the replica trick and Parisi's hierarchical ansatz. In the thermodynamic limit, we recover the most general version of the Derrida's generalized random energy model (GREM). The low-temperature behaviour depends essentially on the spectrum of length scales involved in the construction of the landscape. If the latter consists of K discrete values, the system is characterized by a K-step replica symmetry breaking solution. We argue that our construction is in fact valid in any finite spatial dimensions N >= 1. We discuss the implications of our results for the singularity spectrum describing multifractality of the associated Boltzmann-Gibbs measure. Finally we discuss several generalizations and open problems, such as the dynamics in such a landscape and the construction of a generalized multifractal random walk.
Stochastic interactions of two Brownian hard spheres in the presence of depletants
DOE Office of Scientific and Technical Information (OSTI.GOV)
Karzar-Jeddi, Mehdi; Fan, Tai-Hsi, E-mail: thfan@engr.uconn.edu; Tuinier, Remco
2014-06-07
A quantitative analysis is presented for the stochastic interactions of a pair of Brownian hard spheres in non-adsorbing polymer solutions. The hard spheres are hypothetically trapped by optical tweezers and allowed for random motion near the trapped positions. The investigation focuses on the long-time correlated Brownian motion. The mobility tensor altered by the polymer depletion effect is computed by the boundary integral method, and the corresponding random displacement is determined by the fluctuation-dissipation theorem. From our computations it follows that the presence of depletion layers around the hard spheres has a significant effect on the hydrodynamic interactions and particle dynamicsmore » as compared to pure solvent and uniform polymer solution cases. The probability distribution functions of random walks of the two interacting hard spheres that are trapped clearly shift due to the polymer depletion effect. The results show that the reduction of the viscosity in the depletion layers around the spheres and the entropic force due to the overlapping of depletion zones have a significant influence on the correlated Brownian interactions.« less
Lee, S J; Kim, W Y; Shim, S-H; Cho, S-H; Oh, I K; Hwang, T S; Kim, S-N; Kang, S-B
2015-02-01
This study was performed to evaluate the prognostic significance of human papillomavirus (HPV) viral load, expressed in relative light units (RLUs), in patients with atypical squamous cells of undetermined significance (ASC-US) cytology. A total of 349 ASC-US cases with HPV infection, detected using Hybrid Capture 2, were diagnosed histologically. A colposcopically directed punch biopsy was performed on acetowhite areas. Endocervical curettage biopsy and random cervical punch biopsy in four quadrants were performed in unsatisfactory colposcopy cases. In negative colposcopy cases, random cervical punch biopsy in four quadrants was performed. Case with no cervical intraepithelial neoplasia (CIN), CIN1 and CIN2+ (CIN2/CIN3) accounted for 162, 135 and 52 cases, respectively. The mean age showed no difference among the three groups (P = 0.510). There was a significant correlation between RLU values and the presence of CIN (P < 0.001), but less so with its severity: the median RLU values for negative, CIN1 and CIN2+ cases were 42.68, 146.45 and 156.43, respectively, with widely overlapping confidence intervals. The cut-off values of RLU to detect CIN1+ and CIN2+ were 6.73 and 45.64, respectively. The HPV viral load in ASC-US cases showed a significant correlation with the presence of CIN and less so with its severity, and showed large overlap of viral loads between grades of CIN. In ASC-US cases, RLU was not an accurate predictor of immediate high-grade CIN. © 2014 John Wiley & Sons Ltd.
Eigenvector dynamics: General theory and some applications
NASA Astrophysics Data System (ADS)
Allez, Romain; Bouchaud, Jean-Philippe
2012-10-01
We propose a general framework to study the stability of the subspace spanned by P consecutive eigenvectors of a generic symmetric matrix H0 when a small perturbation is added. This problem is relevant in various contexts, including quantum dissipation (H0 is then the Hamiltonian) and financial risk control (in which case H0 is the assets' return covariance matrix). We argue that the problem can be formulated in terms of the singular values of an overlap matrix, which allows one to define an overlap distance. We specialize our results for the case of a Gaussian orthogonal H0, for which the full spectrum of singular values can be explicitly computed. We also consider the case when H0 is a covariance matrix and illustrate the usefulness of our results using financial data. The special case where the top eigenvalue is much larger than all the other ones can be investigated in full detail. In particular, the dynamics of the angle made by the top eigenvector and its true direction defines an interesting class of random processes.
Moving from spatially segregated to transparent motion: a modelling approach
Durant, Szonya; Donoso-Barrera, Alejandra; Tan, Sovira; Johnston, Alan
2005-01-01
Motion transparency, in which patterns of moving elements group together to give the impression of lacy overlapping surfaces, provides an important challenge to models of motion perception. It has been suggested that we perceive transparent motion when the shape of the velocity histogram of the stimulus is bimodal. To investigate this further, random-dot kinematogram motion sequences were created to simulate segregated (perceptually spatially separated) and transparent (perceptually overlapping) motion. The motion sequences were analysed using the multi-channel gradient model (McGM) to obtain the speed and direction at every pixel of each frame of the motion sequences. The velocity histograms obtained were found to be quantitatively similar and all were bimodal. However, the spatial and temporal properties of the velocity field differed between segregated and transparent stimuli. Transparent stimuli produced patches of rightward and leftward motion that varied in location over time. This demonstrates that we can successfully differentiate between these two types of motion on the basis of the time varying local velocity field. However, the percept of motion transparency cannot be based simply on the presence of a bimodal velocity histogram. PMID:17148338
Coded aperture ptychography: uniqueness and reconstruction
NASA Astrophysics Data System (ADS)
Chen, Pengwen; Fannjiang, Albert
2018-02-01
Uniqueness of solution is proved for any ptychographic scheme with a random mask under a minimum overlap condition and local geometric convergence analysis is given for the alternating projection (AP) and Douglas-Rachford (DR) algorithms. DR is shown to possess a unique fixed point in the object domain and for AP a simple criterion for distinguishing the true solution among possibly many fixed points is given. A minimalist scheme, where the adjacent masks overlap 50% of the area and each pixel of the object is illuminated by exactly four illuminations, is conveniently parametrized by the number q of shifted masks in each direction. The lower bound 1 - C/q 2 is proved for the geometric convergence rate of the minimalist scheme, predicting a poor performance with large q which is confirmed by numerical experiments. The twin-image ambiguity is shown to arise for certain Fresnel masks and degrade the performance of reconstruction. Extensive numerical experiments are performed to explore the general features of a well-performing mask, the optimal value of q and the robustness with respect to measurement noise.
Krishtopenko, S S; Gavrilenko, V I; Goiran, M
2012-04-04
Using the 'screened' Hartree-Fock approximation based on the eight-band k·p Hamiltonian, we have extended our previous work (Krishtopenko et al 2011 J. Phys.: Condens. Matter 23 385601) on exchange enhancement of the g-factor in narrow-gap quantum well heterostructures by calculating the exchange renormalization of quasiparticle energies, the density of states at the Fermi level and the quasiparticle g-factor for different Landau levels overlapping. We demonstrate that exchange interaction yields more pronounced Zeeman splitting of the density of states at the Fermi level and leads to the appearance of peak-shaped features in the dependence of the Landau level energies on the magnetic field at integer filling factors. We also find that the quasiparticle g-factor does not reach the maximum value at odd filling factors in the presence of large overlapping of spin-split Landau levels. We advance an argument that the behavior of the quasiparticle g-factor in weak magnetic fields is defined by a random potential of impurities in narrow-gap heterostructures. © 2012 IOP Publishing Ltd
Holographic maps of quasiparticle interference
NASA Astrophysics Data System (ADS)
Dalla Torre, Emanuele G.; He, Yang; Demler, Eugene
2016-11-01
The analysis of Fourier-transformed scanning tunnelling microscopy images with subatomic resolution is a common tool for studying the properties of quasiparticle excitations in strongly correlated materials. Although Fourier amplitudes are generally complex valued, earlier analysis primarily focused on their absolute values. Their complex phases were often deemed random, and thus irrelevant, due to the unknown positions of the impurities in the sample. Here we show how to factor out these random phases by analysing overlaps between Fourier amplitudes that differ by reciprocal lattice vectors. The resulting holographic maps provide important and previously unknown information about the electronic structures. When applied to superconducting cuprates, our method solves a long-standing puzzle of the dichotomy between equivalent wavevectors. We show that d-wave Wannier functions of the conduction band provide a natural explanation for experimental results that were interpreted as evidence for competing unconventional charge modulations. Our work opens a new pathway to identify the nature of electronic states in scanning tunnelling microscopy.
NASA Astrophysics Data System (ADS)
Gros, J.-B.; Kuhl, U.; Legrand, O.; Mortessagne, F.
2016-03-01
The effective Hamiltonian formalism is extended to vectorial electromagnetic waves in order to describe statistical properties of the field in reverberation chambers. The latter are commonly used in electromagnetic compatibility tests. As a first step, the distribution of wave intensities in chaotic systems with varying opening in the weak coupling limit for scalar quantum waves is derived by means of random matrix theory. In this limit the only parameters are the modal overlap and the number of open channels. Using the extended effective Hamiltonian, we describe the intensity statistics of the vectorial electromagnetic eigenmodes of lossy reverberation chambers. Finally, the typical quantity of interest in such chambers, namely, the distribution of the electromagnetic response, is discussed. By determining the distribution of the phase rigidity, describing the coupling to the environment, using random matrix numerical data, we find good agreement between the theoretical prediction and numerical calculations of the response.
Hospital mergers and market overlap.
Brooks, G R; Jones, V G
1997-01-01
OBJECTIVE: To address two questions: What are the characteristics of hospitals that affect the likelihood of their being involved in a merger? What characteristics of particular pairs of hospitals affect the likelihood of the pair engaging in a merger? DATA SOURCES/STUDY SETTING: Hospitals in the 12 county region surrounding the San Francisco Bay during the period 1983 to 1992 were the focus of the study. Data were drawn from secondary sources, including the Lexis/Nexis database, the American Hospital Association, and the Office of Statewide Health Planning and Development of the State of California. STUDY DESIGN: Seventeen hospital mergers during the study period were identified. A random sample of pairs of hospitals that did not merge was drawn to establish a statistically efficient control set. Models constructed from hypotheses regarding hospital and market characteristics believed to be related to merger likelihood were tested using logistic regression analysis. DATA COLLECTION: See Data Sources/Study Setting. PRINCIPAL FINDINGS: The analysis shows that the likelihood of a merger between a particular pair of hospitals is positively related to the degree of market overlap that exists between them. Furthermore, market overlap and performance difference interact in their effect on merger likelihood. In an analysis of individual hospitals, conditions of rivalry, hospital market share, and hospital size were not found to influence the likelihood that a hospital will engage in a merger. CONCLUSIONS: Mergers between hospitals are not driven directly by considerations of market power or efficiency as much as by the existence of specific merger opportunities in the hospitals' local markets. Market overlap is a condition that enables a merger to occur, but other factors, such as the relative performance levels of the hospitals in question and their ownership and teaching status, also play a role in influencing the likelihood that a merger will in fact take place. PMID:9018212
Detection thresholds for gaps, overlaps, and no-gap-no-overlaps.
Heldner, Mattias
2011-07-01
Detection thresholds for gaps and overlaps, that is acoustic and perceived silences and stretches of overlapping speech in speaker changes, were determined. Subliminal gaps and overlaps were categorized as no-gap-no-overlaps. The established gap and overlap detection thresholds both corresponded to the duration of a long vowel, or about 120 ms. These detection thresholds are valuable for mapping the perceptual speaker change categories gaps, overlaps, and no-gap-no-overlaps into the acoustic domain. Furthermore, the detection thresholds allow generation and understanding of gaps, overlaps, and no-gap-no-overlaps in human-like spoken dialogue systems. © 2011 Acoustical Society of America
Singh, Minerva; Friess, Daniel A.; Vilela, Bruno; Alban, Jose Don T. De; Monzon, Angelica Kristina V.; Veridiano, Rizza Karen A.; Tumaneng, Roven D.
2017-01-01
This study maps distribution and spatial congruence between Above-Ground Biomass (AGB) and species richness of IUCN listed conservation-dependent and endemic avian fauna in Palawan, Philippines. Grey Level Co-Occurrence Texture Matrices (GLCMs) extracted from Landsat and ALOS-PALSAR were used in conjunction with local field data to model and map local-scale field AGB using the Random Forest algorithm (r = 0.92 and RMSE = 31.33 Mg·ha-1). A support vector regression (SVR) model was used to identify the factors influencing variation in avian species richness at a 1km scale. AGB is one of the most important determinants of avian species richness for the study area. Topographic factors and anthropogenic factors such as distance from the roads were also found to strongly influence avian species richness. Hotspots of high AGB and high species richness concentration were mapped using hotspot analysis and the overlaps between areas of high AGB and avian species richness was calculated. Results show that the overlaps between areas of high AGB with high IUCN red listed avian species richness and endemic avian species richness were fairly limited at 13% and 8% at the 1-km scale. The overlap between 1) low AGB and low IUCN richness, and 2) low AGB and low endemic avian species richness was higher at 36% and 12% respectively. The enhanced capacity to spatially map the correlation between AGB and avian species richness distribution will further assist the conservation and protection of forest areas and threatened avian species. PMID:29206228
Antimasking aspects of harp seal (Pagophilus groenlandicus) underwater vocalizations.
Serrano, Arturo; Terhune, John M
2002-12-01
Underwater sounds are very important in social communication of harp seals (Pagophilus groenlandicus) because they are the main means of long- and short-distance communication. Individual harp seals must try to avoid being masked and emit only those calls that will benefit them. Underwater vocalizations of harp seals were recorded during the breeding season. The physical characteristics associated with antimasking attributes of 16 call types were examined. Rising frequency or increasing amplitude within calls were not common. Most of the calls ended abruptly (range 145-966 dB/s), but call onset was more gradual. At high calling rates (95.1-135 calls/min) there were significantly more calls overlapping temporally than at medium (75.1-95 calls/min) or low (35-75 calls/min) calling rates, but even at the highest calling rates, 79.1% of the calls were not overlapped. When 2, 3, or 4 calls overlapped, there were significantly fewer frequency separations of less than 1/3 octave than would be expected by chance. This is important because sounds that are separated by less than 1/3 octave likely mask each other. When 2-4 calls are occurring simultaneously, only 4.5% to 14.2% are masked by virtue of being within 1/3 octave from their nearest neighbor. None of the overlappping calls was of the same type. This suggests that the seals are actively listening to each other's calls and are not randomly using the different call types. Harp seals use frequency and temporal separation in conjunction with a wide vocal repertoire to avoid masking each other.
Antimasking aspects of harp seal (Pagophilus groenlandicus) underwater vocalizations
NASA Astrophysics Data System (ADS)
Serrano, Arturo; Terhune, John M.
2002-12-01
Underwater sounds are very important in social communication of harp seals (Pagophilus groenlandicus) because they are the main means of long- and short-distance communication. Individual harp seals must try to avoid being masked and emit only those calls that will benefit them. Underwater vocalizations of harp seals were recorded during the breeding season. The physical characteristics associated with antimasking attributes of 16 call types were examined. Rising frequency or increasing amplitude within calls were not common. Most of the calls ended abruptly (range 145-966 dB/s), but call onset was more gradual. At high calling rates (95.1-135 calls/min) there were significantly more calls overlapping temporally than at medium (75.1-95 calls/min) or low (35-75 calls/min) calling rates, but even at the highest calling rates, 79.1% of the calls were not overlapped. When 2, 3, or 4 calls overlapped, there were significantly fewer frequency separations of less than 1/3 octave than would be expected by chance. This is important because sounds that are separated by less than 1/3 octave likely mask each other. When 2-4 calls are occurring simultaneously, only 4.5% to 14.2% are masked by virtue of being within 1/3 octave from their nearest neighbor. None of the overlappping calls was of the same type. This suggests that the seals are actively listening to each other's calls and are not randomly using the different call types. Harp seals use frequency and temporal separation in conjunction with a wide vocal repertoire to avoid masking each other.
Dufour, Claire M. S.; Meynard, Christine; Watson, Johan; Rioux, Camille; Benhamou, Simon; Perez, Julie; du Plessis, Jurie J.; Avenant, Nico; Pillay, Neville; Ganem, Guila
2015-01-01
Coexistence often involves niche differentiation either as the result of environmental divergence, or in response to competition. Disentangling the causes of such divergence requires that environmental variation across space is taken into account, which is rarely done in empirical studies. We address the role of environmental variation versus competition in coexistence between two rodent species: Rhabdomys bechuanae (bechuanae) and Rhabdomys dilectus dilectus (dilectus) comparing their habitat preference and home range (HR) size in areas with similar climates, where their distributions abut (allopatry) or overlap (sympatry). Using Outlying Mean Index analyses, we test whether habitat characteristics of the species deviate significantly from a random sample of available habitats. In allopatry, results suggest habitat selection: dilectus preferring grasslands with little bare soil while bechuanae occurring in open shrublands. In sympatry, shrubland type habitats dominate and differences are less marked, yet dilectus selects habitats with more cover than bechuanae. Interestingly, bechuanae shows larger HRs than dilectus, and both species display larger HRs in sympatry. Further, HR overlaps between species are lower than expected. We discuss our results in light of data on the phylogeography of the genus and propose that evolution in allopatry resulted in adaptation leading to different habitat preferences, even at their distribution margins, a divergence expected to facilitate coexistence. However, since sympatry occurs in sites where environmental characteristics do not allow complete species separation, competition may explain reduced inter-species overlap and character displacement in HR size. This study reveals that both environmental variation and competition may shape species coexistence. PMID:25693176
Silvanto, Juha; Cattaneo, Zaira
2010-05-01
Cortical areas involved in sensory analysis are also believed to be involved in short-term storage of that sensory information. Here we investigated whether transcranial magnetic stimulation (TMS) can reveal the content of visual short-term memory (VSTM) by bringing this information to visual awareness. Subjects were presented with two random-dot displays (moving either to the left or to the right) and they were required to maintain one of these in VSTM. In Experiment 1, TMS was applied over the motion-selective area V5/MT+ above phosphene threshold during the maintenance phase. The reported phosphene contained motion features of the memory item, when the phosphene spatially overlapped with memory item. Specifically, phosphene motion was enhanced when the memory item moved in the same direction as the subjects' V5/MT+ baseline phosphene, whereas it was reduced when the motion direction of the memory item was incongruent with that of the baseline V5/MT+ phosphene. There was no effect on phosphene reports when there was no spatial overlap between the phosphene and the memory item. In Experiment 2, VSTM maintenance did not influence the appearance of phosphenes induced from the lateral occipital region. These interactions between VSTM maintenance and phosphene appearance demonstrate that activity in V5/MT+ reflects the motion qualities of items maintained in VSTM. Furthermore, these results also demonstrate that information in VSTM can modulate the pattern of visual activation reaching awareness, providing evidence for the view that overlapping neuronal populations are involved in conscious visual perception and VSTM. 2010. Published by Elsevier Inc.
Network-based study reveals potential infection pathways of hepatitis-C leading to various diseases.
Mukhopadhyay, Anirban; Maulik, Ujjwal
2014-01-01
Protein-protein interaction network-based study of viral pathogenesis has been gaining popularity among computational biologists in recent days. In the present study we attempt to investigate the possible pathways of hepatitis-C virus (HCV) infection by integrating the HCV-human interaction network, human protein interactome and human genetic disease association network. We have proposed quasi-biclique and quasi-clique mining algorithms to integrate these three networks to identify infection gateway host proteins and possible pathways of HCV pathogenesis leading to various diseases. Integrated study of three networks, namely HCV-human interaction network, human protein interaction network, and human proteins-disease association network reveals potential pathways of infection by the HCV that lead to various diseases including cancers. The gateway proteins have been found to be biologically coherent and have high degrees in human interactome compared to the other virus-targeted proteins. The analyses done in this study provide possible targets for more effective anti-hepatitis-C therapeutic involvement.
On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs
NASA Astrophysics Data System (ADS)
Jiang, Minghui
We show that for any constant t ≥ 2, K -Independent Set and K-Dominating Set in t-track interval graphs are W[1]-hard. This settles an open question recently raised by Fellows, Hermelin, Rosamond, and Vialette. We also give an FPT algorithm for K-Clique in t-interval graphs, parameterized by both k and t, with running time max { t O(k), 2 O(klogk) } ·poly(n), where n is the number of vertices in the graph. This slightly improves the previous FPT algorithm by Fellows, Hermelin, Rosamond, and Vialette. Finally, we use the W[1]-hardness of K-Independent Set in t-track interval graphs to obtain the first parameterized intractability result for a recent bioinformatics problem called Maximal Strip Recovery (MSR). We show that MSR-d is W[1]-hard for any constant d ≥ 4 when the parameter is either the total length of the strips, or the total number of adjacencies in the strips, or the number of strips in the optimal solution.
Network-Based Study Reveals Potential Infection Pathways of Hepatitis-C Leading to Various Diseases
Mukhopadhyay, Anirban; Maulik, Ujjwal
2014-01-01
Protein-protein interaction network-based study of viral pathogenesis has been gaining popularity among computational biologists in recent days. In the present study we attempt to investigate the possible pathways of hepatitis-C virus (HCV) infection by integrating the HCV-human interaction network, human protein interactome and human genetic disease association network. We have proposed quasi-biclique and quasi-clique mining algorithms to integrate these three networks to identify infection gateway host proteins and possible pathways of HCV pathogenesis leading to various diseases. Integrated study of three networks, namely HCV-human interaction network, human protein interaction network, and human proteins-disease association network reveals potential pathways of infection by the HCV that lead to various diseases including cancers. The gateway proteins have been found to be biologically coherent and have high degrees in human interactome compared to the other virus-targeted proteins. The analyses done in this study provide possible targets for more effective anti-hepatitis-C therapeutic involvement. PMID:24743187
Waszkowycz, B; Clark, D E; Frenkel, D; Li, J; Murray, C W; Robson, B; Westhead, D R
1994-11-11
A computational approach for molecular design, PRO_LIGAND, has been developed within the PROMETHEUS molecular design and simulation system in order to provide a unified framework for the de novo generation of diverse molecules which are either similar or complementary to a specified target. In this instance, the target is a pharmacophore derived from a series of active structures either by a novel interpretation of molecular field analysis data or by a pharmacophore-mapping procedure based on clique detection. After a brief introduction to PRO_LIGAND, a detailed description is given of the two pharmacophore generation procedures and their abilities are demonstrated by the elucidation of pharmacophores for steroid binding and ACE inhibition, respectively. As a further indication of its efficacy in aiding the rational drug design process, PRO_LIGAND is then employed to build novel organic molecules to satisfy the physicochemical constraints implied by the pharmacophores.
Lee, Jee Young; Kwon, Yeji; Yang, Soeun; Park, Sora; Kim, Eun-Mee; Na, Eun-Yeong
2017-01-01
Cyberbullying is one of the negative consequences of online social interaction. The digital environment enables adolescents to engage in online social interaction beyond the traditional physical boundaries of families, neighborhoods, and schools. The authors examined connections to friendship networks in both online and offline settings are related to their experiences as victims, perpetrators, and bystanders of cyberbullying. A comparative face-to-face survey of adolescents (12-15-year-olds) was conducted in Korea (n = 520) and Australia (n = 401). The results reveal that online networks are partially related to cyberbullying in both countries, showing the size of social network sites was significantly correlated with experience cyberbullying among adolescents in both countries. However there were cultural differences in the impact of friendship networks on cyberbullying. The size of the online and offline networks has a stronger impact on the cyberbullying experiences in Korea than it does in Australia. In particular, the number of friends in cliques was positively related to both bullying and victimization in Korea.
Data-Driven Packet Loss Estimation for Node Healthy Sensing in Decentralized Cluster.
Fan, Hangyu; Wang, Huandong; Li, Yong
2018-01-23
Decentralized clustering of modern information technology is widely adopted in various fields these years. One of the main reason is the features of high availability and the failure-tolerance which can prevent the entire system form broking down by a failure of a single point. Recently, toolkits such as Akka are used by the public commonly to easily build such kind of cluster. However, clusters of such kind that use Gossip as their membership managing protocol and use link failure detecting mechanism to detect link failures cannot deal with the scenario that a node stochastically drops packets and corrupts the member status of the cluster. In this paper, we formulate the problem to be evaluating the link quality and finding a max clique (NP-Complete) in the connectivity graph. We then proposed an algorithm that consists of two models driven by data from application layer to respectively solving these two problems. Through simulations with statistical data and a real-world product, we demonstrate that our algorithm has a good performance.
Fractal multi-level organisation of human groups in a virtual world.
Fuchs, Benedikt; Sornette, Didier; Thurner, Stefan
2014-10-06
Humans are fundamentally social. They form societies which consist of hierarchically layered nested groups of various quality, size, and structure. The anthropologic literature has classified these groups as support cliques, sympathy groups, bands, cognitive groups, tribes, linguistic groups, and so on. Anthropologic data show that, on average, each group consists of approximately three subgroups. However, a general understanding of the structural dependence of groups at different layers is largely missing. We extend these early findings to a very large high-precision large-scale internet-based social network data. We analyse the organisational structure of a complete, multi-relational, large social multiplex network of a human society consisting of about 400,000 odd players of an open-ended massive multiplayer online game for which we know all about their various group memberships at different layers. Remarkably, the online players' society exhibits the same type of structured hierarchical layers as found in hunter-gatherer societies. Our findings suggest that the hierarchical organisation of human society is deeply nested in human psychology.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Kupavskii, A B; Raigorodskii, A M
2013-10-31
We investigate in detail some properties of distance graphs constructed on the integer lattice. Such graphs find wide applications in problems of combinatorial geometry, in particular, such graphs were employed to answer Borsuk's question in the negative and to obtain exponential estimates for the chromatic number of the space. This work is devoted to the study of the number of cliques and the chromatic number of such graphs under certain conditions. Constructions of sequences of distance graphs are given, in which the graphs have unit length edges and contain a large number of triangles that lie on a sphere of radius 1/√3more » (which is the minimum possible). At the same time, the chromatic numbers of the graphs depend exponentially on their dimension. The results of this work strengthen and generalize some of the results obtained in a series of papers devoted to related issues. Bibliography: 29 titles.« less
Fractal multi-level organisation of human groups in a virtual world
Fuchs, Benedikt; Sornette, Didier; Thurner, Stefan
2014-01-01
Humans are fundamentally social. They form societies which consist of hierarchically layered nested groups of various quality, size, and structure. The anthropologic literature has classified these groups as support cliques, sympathy groups, bands, cognitive groups, tribes, linguistic groups, and so on. Anthropologic data show that, on average, each group consists of approximately three subgroups. However, a general understanding of the structural dependence of groups at different layers is largely missing. We extend these early findings to a very large high-precision large-scale internet-based social network data. We analyse the organisational structure of a complete, multi-relational, large social multiplex network of a human society consisting of about 400,000 odd players of an open-ended massive multiplayer online game for which we know all about their various group memberships at different layers. Remarkably, the online players' society exhibits the same type of structured hierarchical layers as found in hunter-gatherer societies. Our findings suggest that the hierarchical organisation of human society is deeply nested in human psychology. PMID:25283998
Mathematical properties and bounds on haplotyping populations by pure parsimony.
Wang, I-Lin; Chang, Chia-Yuan
2011-06-01
Although the haplotype data can be used to analyze the function of DNA, due to the significant efforts required in collecting the haplotype data, usually the genotype data is collected and then the population haplotype inference (PHI) problem is solved to infer haplotype data from genotype data for a population. This paper investigates the PHI problem based on the pure parsimony criterion (HIPP), which seeks the minimum number of distinct haplotypes to infer a given genotype data. We analyze the mathematical structure and properties for the HIPP problem, propose techniques to reduce the given genotype data into an equivalent one of much smaller size, and analyze the relations of genotype data using a compatible graph. Based on the mathematical properties in the compatible graph, we propose a maximal clique heuristic to obtain an upper bound, and a new polynomial-sized integer linear programming formulation to obtain a lower bound for the HIPP problem. Copyright © 2011 Elsevier Inc. All rights reserved.
Moran, Meghan Bridgid; Murphy, Sheila T.; Sussman, Steve
2014-01-01
Identity-based strategies have been suggested as a way to promote healthy behaviors when traditional approaches fall short. The truth® campaign, designed to reduce smoking in adolescents, is an example of a campaign that uses such a strategy to reach youth described as being outside the mainstream. This article examines the effectiveness of this strategy in promoting antitobacco company beliefs among youth. Survey data from 224 adolescents between 14 and 15 years of age were used to examine whether the truth® campaign was more or less effective at reaching and promoting antitobacco company beliefs among youth who identify with nonmainstream crowds (deviants and counterculture) versus those who identify with mainstream crowds (elites and academics). Analyses revealed that adolescents who identified as deviants and counterculture were more likely to have been persuaded by the truth® campaign. Social identity theory is used as a theoretical framework to understand these effects and to make recommendations for future health campaigns. PMID:23066900
Moran, Meghan Bridgid; Murphy, Sheila T; Sussman, Steve
2012-01-01
Identity-based strategies have been suggested as a way to promote healthy behaviors when traditional approaches fall short. The truth® campaign, designed to reduce smoking in adolescents, is an example of a campaign that uses such a strategy to reach youth described as being outside the mainstream. This article examines the effectiveness of this strategy in promoting antitobacco company beliefs among youth. Survey data from 224 adolescents between 14 and 15 years of age were used to examine whether the truth® campaign was more or less effective at reaching and promoting antitobacco company beliefs among youth who identify with nonmainstream crowds (deviants and counterculture) versus those who identify with mainstream crowds (elites and academics). Analyses revealed that adolescents who identified as deviants and counterculture were more likely to have been persuaded by the truth® campaign. Social identity theory is used as a theoretical framework to understand these effects and to make recommendations for future health campaigns.
Fractal multi-level organisation of human groups in a virtual world
NASA Astrophysics Data System (ADS)
Fuchs, Benedikt; Sornette, Didier; Thurner, Stefan
2014-10-01
Humans are fundamentally social. They form societies which consist of hierarchically layered nested groups of various quality, size, and structure. The anthropologic literature has classified these groups as support cliques, sympathy groups, bands, cognitive groups, tribes, linguistic groups, and so on. Anthropologic data show that, on average, each group consists of approximately three subgroups. However, a general understanding of the structural dependence of groups at different layers is largely missing. We extend these early findings to a very large high-precision large-scale internet-based social network data. We analyse the organisational structure of a complete, multi-relational, large social multiplex network of a human society consisting of about 400,000 odd players of an open-ended massive multiplayer online game for which we know all about their various group memberships at different layers. Remarkably, the online players' society exhibits the same type of structured hierarchical layers as found in hunter-gatherer societies. Our findings suggest that the hierarchical organisation of human society is deeply nested in human psychology.
Cortical Sensitivity to Guitar Note Patterns: EEG Entrainment to Repetition and Key.
Bridwell, David A; Leslie, Emily; McCoy, Dakarai Q; Plis, Sergey M; Calhoun, Vince D
2017-01-01
Music is ubiquitous throughout recent human culture, and many individual's have an innate ability to appreciate and understand music. Our appreciation of music likely emerges from the brain's ability to process a series of repeated complex acoustic patterns. In order to understand these processes further, cortical responses were measured to a series of guitar notes presented with a musical pattern or without a pattern. ERP responses to individual notes were measured using a 24 electrode Bluetooth mobile EEG system (Smarting mBrainTrain) while 13 healthy non-musicians listened to structured (i.e., within musical keys and with repetition) or random sequences of guitar notes for 10 min each. We demonstrate an increased amplitude to the ERP that appears ~200 ms to notes presented within the musical sequence. This amplitude difference between random notes and patterned notes likely reflects individual's cortical sensitivity to guitar note patterns. These amplitudes were compared to ERP responses to a rare note embedded within a stream of frequent notes to determine whether the sensitivity to complex musical structure overlaps with the sensitivity to simple irregularities reflected in traditional auditory oddball experiments. Response amplitudes to the negative peak at ~175 ms are statistically correlated with the mismatch negativity (MMN) response measured to a rare note presented among a series of frequent notes (i.e., in a traditional oddball sequence), but responses to the subsequent positive peak at ~200 do not show a statistical relationship with the P300 response. Thus, the sensitivity to musical structure identified to 4 Hz note patterns appears somewhat distinct from the sensitivity to statistical regularities reflected in the traditional "auditory oddball" sequence. Overall, we suggest that this is a promising approach to examine individual's sensitivity to complex acoustic patterns, which may overlap with higher level cognitive processes, including language.
Isotopic diversity indices: how sensitive to food web structure?
Brind'Amour, Anik; Dubois, Stanislas F
2013-01-01
Recently revisited, the concept of niche ecology has lead to the formalisation of functional and trophic niches using stable isotope ratios. Isotopic diversity indices (IDI) derived from a set of measures assessing the dispersion/distribution of points in the δ-space were recently suggested and increasingly used in the literature. However, three main critics emerge from the use of these IDI: 1) they fail to account for the isotopic sources overlap, 2) some indices are highly sensitive to the number of species and/or the presence of rare species, and 3) the lack of standardization prevents any spatial and temporal comparisons. Using simulations we investigated the ability of six commonly used IDI to discriminate among different trophic food web structures, with a focus on the first two critics. We tested the sensitivity of the IDI to five food web structures along a gradient of sources overlap, varying from two distinct food chains with differentiated sources to two superimposed food chains sharing two sources. For each of the food web structure we varied the number of species (from 10 to 100 species) and the type of species feeding behaviour (i.e. random or selective feeding). Values of IDI were generally larger in food webs with distinct basal sources and tended to decrease as the superimposition of the food chains increased. This was more pronounced when species displayed food preferences in comparison to food webs where species fed randomly on any prey. The number of species composing the food web also had strong effects on the metrics, including those that were supposedly less sensitive to small sample size. In all cases, computing IDI on food webs with low numbers of species always increases the uncertainty of the metrics. A threshold of ~20 species was detected above which several metrics can be safely used.
Itzykson, Raphael; Gardin, Claude; Pautas, Cécile; Thomas, Xavier; Turlure, Pascal; Raffoux, Emmanuel; Terré, Christine; Fenaux, Pierre; Castaigne, Sylvie; Dombret, Hervé; Boissel, Nicolas
2011-01-01
Background There is no standard post-remission therapy in older patients with acute myeloid leukemia. Design and Methods From 1999 to 2006, the Acute Leukemia French Association group ran two concurrent randomized trials with overlapping inclusion criteria for patients aged 65 to 70 with acute myeloid leukemia, with different post-remission strategies: two intensive courses in the 9801 trial, one intensive course or six outpatient courses in the 9803 trial. We analyzed the outcome of these patients per protocol and per post-remission therapy. Results Two hundred and eleven patients aged 65 to 70 years with de novo acute myeloid leukemia were enrolled in trial 9801 (n=76) or 9803 (n=135). The patients in the two trials had comparable white blood cell counts (P=0.3), cytogenetics (P=0.49), and complete remission rates (70% and 57%, respectively; P=0.17). Overall survival was identical in both trials (32% and 34% at 2 years, respectively; P=0.71). Overall survival after complete remission was identical in the 103 of 130 patients who received the planned post-remission courses (n=44 with two intensive courses, n=28 with one intensive course, n=31 with six outpatient courses; 41%, 55%, and 58% at 2 years, respectively; P=0.34). Even in patients with favorable or normal karyotype (n=97), overall survival from complete remission was not improved by more intensive post-remission therapy. Conclusions In patients aged 65 to 70 years with de novo acute myeloid leukemia in complete remission after standard intensive induction chemotherapy, there is no apparent benefit from intensive post-remission therapy. (ClinicalTrials.gov Identifiers: NCT00931138 and NCT00363025) PMID:21459791
Itzykson, Raphael; Gardin, Claude; Pautas, Cécile; Thomas, Xavier; Turlure, Pascal; Raffoux, Emmanuel; Terré, Christine; Fenaux, Pierre; Castaigne, Sylvie; Dombret, Hervé; Boissel, Nicolas
2011-06-01
There is no standard post-remission therapy in older patients with acute myeloid leukemia. From 1999 to 2006, the Acute Leukemia French Association group ran two concurrent randomized trials with overlapping inclusion criteria for patients aged 65 to 70 with acute myeloid leukemia, with different post-remission strategies: two intensive courses in the 9801 trial, one intensive course or six outpatient courses in the 9803 trial. We analyzed the outcome of these patients per protocol and per post-remission therapy. Two hundred and eleven patients aged 65 to 70 years with de novo acute myeloid leukemia were enrolled in trial 9801 (n=76) or 9803 (n=135). The patients in the two trials had comparable white blood cell counts (P=0.3), cytogenetics (P=0.49), and complete remission rates (70% and 57%, respectively; P=0.17). Overall survival was identical in both trials (32% and 34% at 2 years, respectively; P=0.71). Overall survival after complete remission was identical in the 103 of 130 patients who received the planned post-remission courses (n=44 with two intensive courses, n=28 with one intensive course, n=31 with six outpatient courses; 41%, 55%, and 58% at 2 years, respectively; P=0.34). Even in patients with favorable or normal karyotype (n=97), overall survival from complete remission was not improved by more intensive post-remission therapy. In patients aged 65 to 70 years with de novo acute myeloid leukemia in complete remission after standard intensive induction chemotherapy, there is no apparent benefit from intensive post-remission therapy. (ClinicalTrials.gov Identifiers: NCT00931138 and NCT00363025).
Tustison, Nicholas J; Shrinidhi, K L; Wintermark, Max; Durst, Christopher R; Kandel, Benjamin M; Gee, James C; Grossman, Murray C; Avants, Brian B
2015-04-01
Segmenting and quantifying gliomas from MRI is an important task for diagnosis, planning intervention, and for tracking tumor changes over time. However, this task is complicated by the lack of prior knowledge concerning tumor location, spatial extent, shape, possible displacement of normal tissue, and intensity signature. To accommodate such complications, we introduce a framework for supervised segmentation based on multiple modality intensity, geometry, and asymmetry feature sets. These features drive a supervised whole-brain and tumor segmentation approach based on random forest-derived probabilities. The asymmetry-related features (based on optimal symmetric multimodal templates) demonstrate excellent discriminative properties within this framework. We also gain performance by generating probability maps from random forest models and using these maps for a refining Markov random field regularized probabilistic segmentation. This strategy allows us to interface the supervised learning capabilities of the random forest model with regularized probabilistic segmentation using the recently developed ANTsR package--a comprehensive statistical and visualization interface between the popular Advanced Normalization Tools (ANTs) and the R statistical project. The reported algorithmic framework was the top-performing entry in the MICCAI 2013 Multimodal Brain Tumor Segmentation challenge. The challenge data were widely varying consisting of both high-grade and low-grade glioma tumor four-modality MRI from five different institutions. Average Dice overlap measures for the final algorithmic assessment were 0.87, 0.78, and 0.74 for "complete", "core", and "enhanced" tumor components, respectively.
NASA Technical Reports Server (NTRS)
Ponomarev, A. L.; Brenner, D.; Hlatky, L. R.; Sachs, R. K.
2000-01-01
DNA double-strand breaks (DSBs) produced by densely ionizing radiation are not located randomly in the genome: recent data indicate DSB clustering along chromosomes. Stochastic DSB clustering at large scales, from > 100 Mbp down to < 0.01 Mbp, is modeled using computer simulations and analytic equations. A random-walk, coarse-grained polymer model for chromatin is combined with a simple track structure model in Monte Carlo software called DNAbreak and is applied to data on alpha-particle irradiation of V-79 cells. The chromatin model neglects molecular details but systematically incorporates an increase in average spatial separation between two DNA loci as the number of base-pairs between the loci increases. Fragment-size distributions obtained using DNAbreak match data on large fragments about as well as distributions previously obtained with a less mechanistic approach. Dose-response relations, linear at small doses of high linear energy transfer (LET) radiation, are obtained. They are found to be non-linear when the dose becomes so large that there is a significant probability of overlapping or close juxtaposition, along one chromosome, for different DSB clusters from different tracks. The non-linearity is more evident for large fragments than for small. The DNAbreak results furnish an example of the RLC (randomly located clusters) analytic formalism, which generalizes the broken-stick fragment-size distribution of the random-breakage model that is often applied to low-LET data.
Non-random mate choice in humans: insights from a genome scan.
Laurent, R; Toupance, B; Chaix, R
2012-02-01
Little is known about the genetic factors influencing mate choice in humans. Still, there is evidence for non-random mate choice with respect to physical traits. In addition, some studies suggest that the Major Histocompatibility Complex may affect pair formation. Nowadays, the availability of high density genomic data sets gives the opportunity to scan the genome for signatures of non-random mate choice without prior assumptions on which genes may be involved, while taking into account socio-demographic factors. Here, we performed a genome scan to detect extreme patterns of similarity or dissimilarity among spouses throughout the genome in three populations of African, European American, and Mexican origins from the HapMap 3 database. Our analyses identified genes and biological functions that may affect pair formation in humans, including genes involved in skin appearance, morphogenesis, immunity and behaviour. We found little overlap between the three populations, suggesting that the biological functions potentially influencing mate choice are population specific, in other words are culturally driven. Moreover, whenever the same functional category of genes showed a significant signal in two populations, different genes were actually involved, which suggests the possibility of evolutionary convergences. © 2011 Blackwell Publishing Ltd.
Energy parasites trigger oncogene mutation.
Pokorný, Jiří; Pokorný, Jan; Jandová, Anna; Kobilková, Jitka; Vrba, Jan; Vrba, Jan
2016-10-01
Cancer initialization can be explained as a result of parasitic virus energy consumption leading to randomized genome chemical bonding. Analysis of experimental data on cell-mediated immunity (CMI) containing about 12,000 cases of healthy humans, cancer patients and patients with precancerous cervical lesions disclosed that the specific cancer and the non-specific lactate dehydrogenase-elevating (LDH) virus antigen elicit similar responses. The specific antigen is effective only in cancer type of its origin but the non-specific antigen in all examined cancers. CMI results of CIN patients display both healthy and cancer state. The ribonucleic acid (RNA) of the LDH virus parasitizing on energy reduces the ratio of coherent/random oscillations. Decreased effect of coherent cellular electromagnetic field on bonding electrons in biological macromolecules leads to elevating probability of random genome reactions. Overlapping of wave functions in biological macromolecules depends on energy of the cellular electromagnetic field which supplies energy to bonding electrons for selective chemical bonds. CMI responses of cancer and LDH virus antigens in all examined healthy, precancerous and cancer cases point to energy mechanism in cancer initiation. Dependence of the rate of biochemical reactions on biological electromagnetic field explains yet unknown mechanism of genome mutation.
Murray, R; Pederson, K; Prosser, H; Muller, D; Hutchison, C A; Frelinger, J A
1988-01-01
We have used random oligonucleotide mutagenesis (or saturation mutagenesis) to create a library of point mutations in the alpha 1 protein domain of a Major Histocompatibility Complex (MHC) molecule. This protein domain is critical for T cell and B cell recognition. We altered the MHC class I H-2DP gene sequence such that synthetic mutant alpha 1 exons (270 bp of coding sequence), which contain mutations identified by sequence analysis, can replace the wild type alpha 1 exon. The synthetic exons were constructed from twelve overlapping oligonucleotides which contained an average of 1.3 random point mutations per intact exon. DNA sequence analysis of mutant alpha 1 exons has shown a point mutant distribution that fits a Poisson distribution, and thus emphasizes the utility of this mutagenesis technique to "scan" a large protein sequence for important mutations. We report our use of saturation mutagenesis to scan an entire exon of the H-2DP gene, a cassette strategy to replace the wild type alpha 1 exon with individual mutant alpha 1 exons, and analysis of mutant molecules expressed on the surface of transfected mouse L cells. Images PMID:2903482
Multilattice sampling strategies for region of interest dynamic MRI.
Rilling, Gabriel; Tao, Yuehui; Marshall, Ian; Davies, Mike E
2013-08-01
A multilattice sampling approach is proposed for dynamic MRI with Cartesian trajectories. It relies on the use of sampling patterns composed of several different lattices and exploits an image model where only some parts of the image are dynamic, whereas the rest is assumed static. Given the parameters of such an image model, the methodology followed for the design of a multilattice sampling pattern adapted to the model is described. The multi-lattice approach is compared to single-lattice sampling, as used by traditional acceleration methods such as UNFOLD (UNaliasing by Fourier-Encoding the Overlaps using the temporal Dimension) or k-t BLAST, and random sampling used by modern compressed sensing-based methods. On the considered image model, it allows more flexibility and higher accelerations than lattice sampling and better performance than random sampling. The method is illustrated on a phase-contrast carotid blood velocity mapping MR experiment. Combining the multilattice approach with the KEYHOLE technique allows up to 12× acceleration factors. Simulation and in vivo undersampling results validate the method. Compared to lattice and random sampling, multilattice sampling provides significant gains at high acceleration factors. © 2012 Wiley Periodicals, Inc.
Finite Element Analysis of the Implantation Process of Overlapping Stents
Xu, Jiang; Yang, Jie; Sohrabi, Salman; Zhou, Yihua; Liu, Yaling
2017-01-01
Overlapping stents are widely used in vascular stent surgeries. However, the rate of stent fractures (SF) and in-stent restenosis (ISR) after using overlapping stents is higher than that of single stent implantations. Published studies investigating the nature of overlapping stents rely primarily on medical images, which can only reveal the effect of the surgery without providing insights into how stent overlap influences the implantation process. In this paper, a finite element analysis of the overlapping stent implantation process was performed to study the interaction between overlapping stents. Four different cases, based on three typical stent overlap modes and two classical balloons, were investigated. The results showed that overlapping contact patterns among struts were edge-to-edge, edge-to-surface, and noncontact. These were mainly induced by the nonuniform deformation of the stent in the radial direction and stent tubular structures. Meanwhile, the results also revealed that the contact pressure was concentrated in the edge of overlapping struts. During the stent overlap process, the contact pattern was primarily edge-to-edge contact at the beginning and edge-to-surface contact as the contact pressure increased. The interactions between overlapping stents suggest that the failure of overlapping stents frequently occurs along stent edges, which agrees with the previous experimental research regarding the safety of overlapping stents. This paper also provides a fundamental understanding of the mechanical properties of overlapping stents. PMID:28690712
Influence of slice overlap on positron emission tomography image quality
NASA Astrophysics Data System (ADS)
McKeown, Clare; Gillen, Gerry; Dempsey, Mary Frances; Findlay, Caroline
2016-02-01
PET scans use overlapping acquisition beds to correct for reduced sensitivity at bed edges. The optimum overlap size for the General Electric (GE) Discovery 690 has not been established. This study assesses how image quality is affected by slice overlap. Efficacy of 23% overlaps (recommended by GE) and 49% overlaps (maximum possible overlap) were specifically assessed. European Association of Nuclear Medicine (EANM) guidelines for calculating minimum injected activities based on overlap size were also reviewed. A uniform flood phantom was used to assess noise (coefficient of variation, (COV)) and voxel accuracy (activity concentrations, Bq ml-1). A NEMA (National Electrical Manufacturers Association) body phantom with hot/cold spheres in a background activity was used to assess contrast recovery coefficients (CRCs) and signal to noise ratios (SNR). Different overlap sizes and sphere-to-background ratios were assessed. COVs for 49% and 23% overlaps were 9% and 13% respectively. This increased noise was difficult to visualise on the 23% overlap images. Mean voxel activity concentrations were not affected by overlap size. No clinically significant differences in CRCs were observed. However, visibility and SNR of small, low contrast spheres (⩽13 mm diameter, 2:1 sphere to background ratio) may be affected by overlap size in low count studies if they are located in the overlap area. There was minimal detectable influence on image quality in terms of noise, mean activity concentrations or mean CRCs when comparing 23% overlap with 49% overlap. Detectability of small, low contrast lesions may be affected in low count studies—however, this is a worst-case scenario. The marginal benefits of increasing overlap from 23% to 49% are likely to be offset by increased patient scan times. A 23% overlap is therefore appropriate for clinical use. An amendment to EANM guidelines for calculating injected activities is also proposed which better reflects the effect overlap size has on image noise.
NASA Astrophysics Data System (ADS)
Zou, You-Hao; Zhang, Jian-Bo; Xiong, Guang-Yi; Chen, Ying; Liu, Chuan; Liu, Yu-Bin; Ma, Jian-Ping
2017-10-01
The topological charge density and topological susceptibility are determined by a multi-probing approximation using overlap fermions in quenched SU(3) gauge theory. Then we investigate the topological structure of the quenched QCD vacuum, and compare it with results from the all-scale topological density. The results are consistent. Random permuted topological charge density is used to check whether these structures represent underlying ordered properties. The pseudoscalar glueball mass is extracted from the two-point correlation function of the topological charge density. We study 3 ensembles of different lattice spacing a with the same lattice volume 163×32. The results are compatible with the results of all-scale topological charge density, and the topological structures revealed by multi-probing are much closer to all-scale topological charge density than those from eigenmode expansion. Supported by National Natural Science Foundation of China (NSFC) (11335001, 11275169, 11075167), It is also supported in part by the DFG and the NSFC (11261130311) through funds provided to the Sino-German CRC 110 "Symmetries and the Emergence of Structure in QCD". This work was also funded in part by National Basic Research Program of China (973 Program) (2015CB856700)
Megabase sequencing of human genome by ordered-shotgun-sequencing (OSS) strategy
NASA Astrophysics Data System (ADS)
Chen, Ellson Y.
1997-05-01
So far we have used OSS strategy to sequence over 2 megabases DNA in large-insert clones from regions of human X chromosomes with different characteristic levels of GC content. The method starts by randomly fragmenting a BAC, YAC or PAC to 8-12 kb pieces and subcloning those into lambda phage. Insert-ends of these clones are sequenced and overlapped to create a partial map. Complete sequencing is then done on a minimal tiling path of selected subclones, recursively focusing on those at the edges of contigs to facilitate mergers of clones across the entire target. To reduce manual labor, PCR processes have been adapted to prepare sequencing templates throughout the entire operation. The streamlined process can thus lend itself to further automation. The OSS approach is suitable for large- scale genomic sequencing, providing considerable flexibility in the choice of subclones or regions for more or less intensive sequencing. For example, subclones containing contaminating host cell DNA or cloning vector can be recognized and ignored with minimal sequencing effort; regions overlapping a neighboring clone already sequenced need not be redone; and segments containing tandem repeats or long repetitive sequences can be spotted early on and targeted for additional attention.
Bauder, Javan M.; Breininger, David R.; Bolt, M. Rebecca; Legare, Michael L.; Jenkins, Christopher L.; Rothermel, Betsie B.; McGarigal, Kevin
2016-01-01
Understanding the factors influencing the degree of spatial overlap among conspecifics is important for understanding multiple ecological processes. Compared to terrestrial carnivores, relatively little is known about the factors influencing conspecific spatial overlap in snakes, although across snake taxa there appears to be substantial variation in conspecific spatial overlap. In this study, we described conspecific spatial overlap of eastern indigo snakes (Drymarchon couperi) in peninsular Florida and examined how conspecific spatial overlap varied by sex and season (breeding season vs. non-breeding season). We calculated multiple indices of spatial overlap using 6- and 3-month utilization distributions (UD) of dyads of simultaneously adjacent telemetered snakes. We also measured conspecific UD density values at each telemetry fix and modeled the distribution of those values as a function of overlap type, sex, and season using generalized Pareto distributions. Home range overlap between males and females was significantly greater than overlap between individuals of the same sex and male home ranges often completely contained female home ranges. Male home ranges overlapped little during both seasons, whereas females had higher levels of overlap during the non-breeding season. The spatial patterns observed in our study are consistent with those seen in many mammalian carnivores, in which low male-male overlap and high inter-sexual overlap provides males with greater access to females. We encourage additional research on the influence of prey availability on conspecific spatial overlap in snakes as well as the behavioral mechanisms responsible for maintaining the low levels of overlap we observed. PMID:27490346
Designing ECG-based physical unclonable function for security of wearable devices.
Shihui Yin; Chisung Bae; Sang Joon Kim; Jae-Sun Seo
2017-07-01
As a plethora of wearable devices are being introduced, significant concerns exist on the privacy and security of personal data stored on these devices. Expanding on recent works of using electrocardiogram (ECG) as a modality for biometric authentication, in this work, we investigate the possibility of using personal ECG signals as the individually unique source for physical unclonable function (PUF), which eventually can be used as the key for encryption and decryption engines. We present new signal processing and machine learning algorithms that learn and extract maximally different ECG features for different individuals and minimally different ECG features for the same individual over time. Experimental results with a large 741-subject in-house ECG database show that the distributions of the intra-subject (same person) Hamming distance of extracted ECG features and the inter-subject Hamming distance have minimal overlap. 256-b random numbers generated from the ECG features of 648 (out of 741) subjects pass the NIST randomness tests.
Panda, Rashmi; Puhan, N B; Panda, Ganapati
2018-02-01
Accurate optic disc (OD) segmentation is an important step in obtaining cup-to-disc ratio-based glaucoma screening using fundus imaging. It is a challenging task because of the subtle OD boundary, blood vessel occlusion and intensity inhomogeneity. In this Letter, the authors propose an improved version of the random walk algorithm for OD segmentation to tackle such challenges. The algorithm incorporates the mean curvature and Gabor texture energy features to define the new composite weight function to compute the edge weights. Unlike the deformable model-based OD segmentation techniques, the proposed algorithm remains unaffected by curve initialisation and local energy minima problem. The effectiveness of the proposed method is verified with DRIVE, DIARETDB1, DRISHTI-GS and MESSIDOR database images using the performance measures such as mean absolute distance, overlapping ratio, dice coefficient, sensitivity, specificity and precision. The obtained OD segmentation results and quantitative performance measures show robustness and superiority of the proposed algorithm in handling the complex challenges in OD segmentation.
Merchán-Pérez, Angel; Rodríguez, José-Rodrigo; González, Santiago; Robles, Víctor; DeFelipe, Javier; Larrañaga, Pedro; Bielza, Concha
2014-01-01
In the cerebral cortex, most synapses are found in the neuropil, but relatively little is known about their 3-dimensional organization. Using an automated dual-beam electron microscope that combines focused ion beam milling and scanning electron microscopy, we have been able to obtain 10 three-dimensional samples with an average volume of 180 µm3 from the neuropil of layer III of the young rat somatosensory cortex (hindlimb representation). We have used specific software tools to fully reconstruct 1695 synaptic junctions present in these samples and to accurately quantify the number of synapses per unit volume. These tools also allowed us to determine synapse position and to analyze their spatial distribution using spatial statistical methods. Our results indicate that the distribution of synaptic junctions in the neuropil is nearly random, only constrained by the fact that synapses cannot overlap in space. A theoretical model based on random sequential absorption, which closely reproduces the actual distribution of synapses, is also presented. PMID:23365213
Merchán-Pérez, Angel; Rodríguez, José-Rodrigo; González, Santiago; Robles, Víctor; Defelipe, Javier; Larrañaga, Pedro; Bielza, Concha
2014-06-01
In the cerebral cortex, most synapses are found in the neuropil, but relatively little is known about their 3-dimensional organization. Using an automated dual-beam electron microscope that combines focused ion beam milling and scanning electron microscopy, we have been able to obtain 10 three-dimensional samples with an average volume of 180 µm(3) from the neuropil of layer III of the young rat somatosensory cortex (hindlimb representation). We have used specific software tools to fully reconstruct 1695 synaptic junctions present in these samples and to accurately quantify the number of synapses per unit volume. These tools also allowed us to determine synapse position and to analyze their spatial distribution using spatial statistical methods. Our results indicate that the distribution of synaptic junctions in the neuropil is nearly random, only constrained by the fact that synapses cannot overlap in space. A theoretical model based on random sequential absorption, which closely reproduces the actual distribution of synapses, is also presented.
An Efficient Distributed Coverage Hole Detection Protocol for Wireless Sensor Networks.
Sahoo, Prasan Kumar; Chiang, Ming-Jer; Wu, Shih-Lin
2016-03-17
In wireless sensor networks (WSNs), certain areas of the monitoring region may have coverage holes and serious coverage overlapping due to the random deployment of sensors. The failure of electronic components, software bugs and destructive agents could lead to the random death of the nodes. Sensors may be dead due to exhaustion of battery power, which may cause the network to be uncovered and disconnected. Based on the deployment nature of the nodes in remote or hostile environments, such as a battlefield or desert, it is impossible to recharge or replace the battery. However, the data gathered by the sensors are highly essential for the analysis, and therefore, the collaborative detection of coverage holes has strategic importance in WSNs. In this paper, distributed coverage hole detection algorithms are designed, where nodes can collaborate to detect the coverage holes autonomously. The performance evaluation of our protocols suggests that our protocols outperform in terms of hole detection time, limited power consumption and control packet overhead to detect holes as compared to other similar protocols.
Leveraging disjoint communities for detecting overlapping community structure
NASA Astrophysics Data System (ADS)
Chakraborty, Tanmoy
2015-05-01
Network communities represent mesoscopic structure for understanding the organization of real-world networks, where nodes often belong to multiple communities and form overlapping community structure in the network. Due to non-triviality in finding the exact boundary of such overlapping communities, this problem has become challenging, and therefore huge effort has been devoted to detect overlapping communities from the network. In this paper, we present PVOC (Permanence based Vertex-replication algorithm for Overlapping Community detection), a two-stage framework to detect overlapping community structure. We build on a novel observation that non-overlapping community structure detected by a standard disjoint community detection algorithm from a network has high resemblance with its actual overlapping community structure, except the overlapping part. Based on this observation, we posit that there is perhaps no need of building yet another overlapping community finding algorithm; but one can efficiently manipulate the output of any existing disjoint community finding algorithm to obtain the required overlapping structure. We propose a new post-processing technique that by combining with any existing disjoint community detection algorithm, can suitably process each vertex using a new vertex-based metric, called permanence, and thereby finds out overlapping candidates with their community memberships. Experimental results on both synthetic and large real-world networks show that PVOC significantly outperforms six state-of-the-art overlapping community detection algorithms in terms of high similarity of the output with the ground-truth structure. Thus our framework not only finds meaningful overlapping communities from the network, but also allows us to put an end to the constant effort of building yet another overlapping community detection algorithm.
Duchêne, Sebastián; Duchêne, David; Holmes, Edward C; Ho, Simon Y W
2015-07-01
Rates and timescales of viral evolution can be estimated using phylogenetic analyses of time-structured molecular sequences. This involves the use of molecular-clock methods, calibrated by the sampling times of the viral sequences. However, the spread of these sampling times is not always sufficient to allow the substitution rate to be estimated accurately. We conducted Bayesian phylogenetic analyses of simulated virus data to evaluate the performance of the date-randomization test, which is sometimes used to investigate whether time-structured data sets have temporal signal. An estimate of the substitution rate passes this test if its mean does not fall within the 95% credible intervals of rate estimates obtained using replicate data sets in which the sampling times have been randomized. We find that the test sometimes fails to detect rate estimates from data with no temporal signal. This error can be minimized by using a more conservative criterion, whereby the 95% credible interval of the estimate with correct sampling times should not overlap with those obtained with randomized sampling times. We also investigated the behavior of the test when the sampling times are not uniformly distributed throughout the tree, which sometimes occurs in empirical data sets. The test performs poorly in these circumstances, such that a modification to the randomization scheme is needed. Finally, we illustrate the behavior of the test in analyses of nucleotide sequences of cereal yellow dwarf virus. Our results validate the use of the date-randomization test and allow us to propose guidelines for interpretation of its results. © The Author 2015. Published by Oxford University Press on behalf of the Society for Molecular Biology and Evolution. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.
Moghbel, Mehrdad; Mashohor, Syamsiah; Mahmud, Rozi; Saripan, M. Iqbal Bin
2016-01-01
Segmentation of liver tumors from Computed Tomography (CT) and tumor burden analysis play an important role in the choice of therapeutic strategies for liver diseases and treatment monitoring. In this paper, a new segmentation method for liver tumors from contrast-enhanced CT imaging is proposed. As manual segmentation of tumors for liver treatment planning is both labor intensive and time-consuming, a highly accurate automatic tumor segmentation is desired. The proposed framework is fully automatic requiring no user interaction. The proposed segmentation evaluated on real-world clinical data from patients is based on a hybrid method integrating cuckoo optimization and fuzzy c-means algorithm with random walkers algorithm. The accuracy of the proposed method was validated using a clinical liver dataset containing one of the highest numbers of tumors utilized for liver tumor segmentation containing 127 tumors in total with further validation of the results by a consultant radiologist. The proposed method was able to achieve one of the highest accuracies reported in the literature for liver tumor segmentation compared to other segmentation methods with a mean overlap error of 22.78 % and dice similarity coefficient of 0.75 in 3Dircadb dataset and a mean overlap error of 15.61 % and dice similarity coefficient of 0.81 in MIDAS dataset. The proposed method was able to outperform most other tumor segmentation methods reported in the literature while representing an overlap error improvement of 6 % compared to one of the best performing automatic methods in the literature. The proposed framework was able to provide consistently accurate results considering the number of tumors and the variations in tumor contrast enhancements and tumor appearances while the tumor burden was estimated with a mean error of 0.84 % in 3Dircadb dataset. PMID:27540353
Sánchez-Mercado, Ada; Asmüssen, Marianne; Rodríguez-Clark, Kathryn M; Rodríguez, Jon Paul; Jedrzejewski, Wlodzimierz
2016-12-01
Although most often considered independently, subsistence hunting, domestic trade, and international trade as components of illegal wildlife use (IWU) may be spatially correlated. Understanding how and where subsistence and commercial uses may co-occur has important implications for the design and implementation of effective conservation actions. We analyzed patterns in the joint geographical distribution of illegal commercial and subsistence use of multiple wildlife species in Venezuela and evaluated whether available data were sufficient to provide accurate estimates of the magnitude, scope, and detectability of IWU. We compiled records of illegal subsistence hunting and trade from several sources and fitted a random-forest classification model to predict the spatial distribution of IWUs. From 1969 to 2014, 404 species and 8,340,921 specimens were involved in IWU, for a mean extraction rate of 185,354 individuals/year. Birds were the most speciose group involved (248 spp.), but reptiles had the highest extraction rates (126,414 individuals/year vs. 3,133 individuals/year for birds). Eighty-eight percent of international trade records spatially overlapped with domestic trade, especially in the north and along the coast but also in western inland areas. The distribution of domestic trade was broadly distributed along roads, suggesting that domestic trade does not depend on large markets in cities. Seventeen percent of domestic trade records overlapped with subsistence hunting, but the spatial distribution of this overlap covered a much larger area than between commercial uses. Domestic trade seems to respond to demand from rural more than urban communities. Our approach will be useful for understanding how IWU works at national scales in other parts of the world. © 2016 Society for Conservation Biology.
Ras proteins have multiple functions in vegetative cells of Dictyostelium.
Bolourani, Parvin; Spiegelman, George; Weeks, Gerald
2010-11-01
During the aggregation of Dictyostelium cells, signaling through RasG is more important in regulating cyclic AMP (cAMP) chemotaxis, whereas signaling through RasC is more important in regulating the cAMP relay. However, RasC is capable of substituting for RasG for chemotaxis, since rasG⁻ cells are only partially deficient in chemotaxis, whereas rasC⁻/rasG⁻ cells are totally incapable of chemotaxis. In this study we have examined the possible functional overlap between RasG and RasC in vegetative cells by comparing the vegetative cell properties of rasG⁻, rasC⁻, and rasC⁻/rasG⁻ cells. In addition, since RasD, a protein not normally found in vegetative cells, is expressed in vegetative rasG⁻ and rasC⁻/rasG⁻ cells and appears to partially compensate for the absence of RasG, we have also examined the possible functional overlap between RasG and RasD by comparing the properties of rasG⁻ and rasC⁻/rasG⁻ cells with those of the mutant cells expressing higher levels of RasD. The results of these two lines of investigation show that RasD is capable of totally substituting for RasG for cytokinesis and growth in suspension, whereas RasC is without effect. In contrast, for chemotaxis to folate, RasC is capable of partially substituting for RasG, but RasD is totally without effect. Finally, neither RasC nor RasD is able to substitute for the role that RasG plays in regulating actin distribution and random motility. These specificity studies therefore delineate three distinct and none-overlapping functions for RasG in vegetative cells.
NASA Astrophysics Data System (ADS)
Franke, R.
2016-11-01
In many networks discovered in biology, medicine, neuroscience and other disciplines special properties like a certain degree distribution and hierarchical cluster structure (also called communities) can be observed as general organizing principles. Detecting the cluster structure of an unknown network promises to identify functional subdivisions, hierarchy and interactions on a mesoscale. It is not trivial choosing an appropriate detection algorithm because there are multiple network, cluster and algorithmic properties to be considered. Edges can be weighted and/or directed, clusters overlap or build a hierarchy in several ways. Algorithms differ not only in runtime, memory requirements but also in allowed network and cluster properties. They are based on a specific definition of what a cluster is, too. On the one hand, a comprehensive network creation model is needed to build a large variety of benchmark networks with different reasonable structures to compare algorithms. On the other hand, if a cluster structure is already known, it is desirable to separate effects of this structure from other network properties. This can be done with null model networks that mimic an observed cluster structure to improve statistics on other network features. A third important application is the general study of properties in networks with different cluster structures, possibly evolving over time. Currently there are good benchmark and creation models available. But what is left is a precise sandbox model to build hierarchical, overlapping and directed clusters for undirected or directed, binary or weighted complex random networks on basis of a sophisticated blueprint. This gap shall be closed by the model CHIMERA (Cluster Hierarchy Interconnection Model for Evaluation, Research and Analysis) which will be introduced and described here for the first time.
Phonological and Orthographic Overlap Effects in Fast and Masked Priming
Frisson, Steven; Bélanger, Nathalie N.; Rayner, Keith
2014-01-01
We investigated how orthographic and phonological information is activated during reading, using a fast priming task, and during single word recognition, using masked priming. Specifically, different types of overlap between prime and target were contrasted: high orthographic and high phonological overlap (track-crack), high orthographic and low phonological overlap (bear-gear), or low orthographic and high phonological overlap (fruit-chute). In addition, we examined whether (orthographic) beginning overlap (swoop-swoon) yielded the same priming pattern as end (rhyme) overlap (track-crack). Prime durations were 32 and 50ms in the fast priming version, and 50ms in the masked priming version, and mode of presentation (prime and target in lower case) was identical. The fast priming experiment showed facilitatory priming effects when both orthography and phonology overlapped, with no apparent differences between beginning and end overlap pairs. Facilitation was also found when prime and target only overlapped orthographically. In contrast, the masked priming experiment showed inhibition for both types of end overlap pairs (with and without phonological overlap), and no difference for begin overlap items. When prime and target only shared principally phonological information, facilitation was only found with a long prime duration in the fast priming experiment, while no differences were found in the masked priming version. These contrasting results suggest that fast priming and masked priming do not necessarily tap into the same type of processing. PMID:24365065
NASA Astrophysics Data System (ADS)
Bergin, Stephen M.; Chen, Yu-Hui; Rathmell, Aaron R.; Charbonneau, Patrick; Li, Zhi-Yuan; Wiley, Benjamin J.
2012-03-01
This article describes how the dimensions of nanowires affect the transmittance and sheet resistance of a random nanowire network. Silver nanowires with independently controlled lengths and diameters were synthesized with a gram-scale polyol synthesis by controlling the reaction temperature and time. Characterization of films composed of nanowires of different lengths but the same diameter enabled the quantification of the effect of length on the conductance and transmittance of silver nanowire films. Finite-difference time-domain calculations were used to determine the effect of nanowire diameter, overlap, and hole size on the transmittance of a nanowire network. For individual nanowires with diameters greater than 50 nm, increasing diameter increases the electrical conductance to optical extinction ratio, but the opposite is true for nanowires with diameters less than this size. Calculations and experimental data show that for a random network of nanowires, decreasing nanowire diameter increases the number density of nanowires at a given transmittance, leading to improved connectivity and conductivity at high transmittance (>90%). This information will facilitate the design of transparent, conducting nanowire films for flexible displays, organic light emitting diodes and thin-film solar cells.This article describes how the dimensions of nanowires affect the transmittance and sheet resistance of a random nanowire network. Silver nanowires with independently controlled lengths and diameters were synthesized with a gram-scale polyol synthesis by controlling the reaction temperature and time. Characterization of films composed of nanowires of different lengths but the same diameter enabled the quantification of the effect of length on the conductance and transmittance of silver nanowire films. Finite-difference time-domain calculations were used to determine the effect of nanowire diameter, overlap, and hole size on the transmittance of a nanowire network. For individual nanowires with diameters greater than 50 nm, increasing diameter increases the electrical conductance to optical extinction ratio, but the opposite is true for nanowires with diameters less than this size. Calculations and experimental data show that for a random network of nanowires, decreasing nanowire diameter increases the number density of nanowires at a given transmittance, leading to improved connectivity and conductivity at high transmittance (>90%). This information will facilitate the design of transparent, conducting nanowire films for flexible displays, organic light emitting diodes and thin-film solar cells. Electronic supplementary information (ESI) available: Includes methods and transmission spectra of nanowire films. See DOI: 10.1039/c2nr30126a
Epidemic spreading on complex networks with overlapping and non-overlapping community structure
NASA Astrophysics Data System (ADS)
Shang, Jiaxing; Liu, Lianchen; Li, Xin; Xie, Feng; Wu, Cheng
2015-02-01
Many real-world networks exhibit community structure where vertices belong to one or more communities. Recent studies show that community structure plays an import role in epidemic spreading. In this paper, we investigate how the extent of overlap among communities affects epidemics. In order to experiment on the characteristic of overlapping communities, we propose a rewiring algorithm that can change the community structure from overlapping to non-overlapping while maintaining the degree distribution of the network. We simulate the Susceptible-Infected-Susceptible (SIS) epidemic process on synthetic scale-free networks and real-world networks by applying our rewiring algorithm. Experiments show that epidemics spread faster on networks with higher level of overlapping communities. Furthermore, overlapping communities' effect interacts with the average degree's effect. Our work further illustrates the important role of overlapping communities in the process of epidemic spreading.
Barr, Margo L; van Ritten, Jason J; Steel, David G; Thackway, Sarah V
2012-11-22
In Australia telephone surveys have been the method of choice for ongoing jurisdictional population health surveys. Although it was estimated in 2011 that nearly 20% of the Australian population were mobile-only phone users, the inclusion of mobile phone numbers into these existing landline population health surveys has not occurred. This paper describes the methods used for the inclusion of mobile phone numbers into an existing ongoing landline random digit dialling (RDD) health survey in an Australian state, the New South Wales Population Health Survey (NSWPHS). This paper also compares the call outcomes, costs and the representativeness of the resultant sample to that of the previous landline sample. After examining several mobile phone pilot studies conducted in Australia and possible sample designs (screening dual-frame and overlapping dual-frame), mobile phone numbers were included into the NSWPHS using an overlapping dual-frame design. Data collection was consistent, where possible, with the previous years' landline RDD phone surveys and between frames. Survey operational data for the frames were compared and combined. Demographic information from the interview data for mobile-only phone users, both, and total were compared to the landline frame using χ2 tests. Demographic information for each frame, landline and the mobile-only (equivalent to a screening dual frame design), and the frames combined (with appropriate overlap adjustment) were compared to the NSW demographic profile from the 2011 census using χ2 tests. In the first quarter of 2012, 3395 interviews were completed with 2171 respondents (63.9%) from the landline frame (17.6% landline only) and 1224 (36.1%) from the mobile frame (25.8% mobile only). Overall combined response, contact and cooperation rates were 33.1%, 65.1% and 72.2% respectively. As expected from previous research, the demographic profile of the mobile-only phone respondents differed most (more that were young, males, Aboriginal and Torres Strait Islanders, overseas born and single) compared to the landline frame responders. The profile of respondents from the two frames combined, with overlap adjustment, was most similar to the latest New South Wales (NSW) population profile. The inclusion of the mobile phone numbers, through an overlapping dual-frame design, did not impact negatively on response rates or data collection, and although costing more the design was still cost-effective because of the additional interviews that were conducted with young people, Aboriginal and Torres Strait Islanders and people who were born overseas resulting in a more representative overall sample.
The effect of relatedness and pack size on territory overlap in African wild dogs.
Jackson, Craig R; Groom, Rosemary J; Jordan, Neil R; McNutt, J Weldon
2017-01-01
Spacing patterns mediate competitive interactions between conspecifics, ultimately increasing fitness. The degree of territorial overlap between neighbouring African wild dog ( Lycaon pictus ) packs varies greatly, yet the role of factors potentially affecting the degree of overlap, such as relatedness and pack size, remain unclear. We used movement data from 21 wild dog packs to calculate the extent of territory overlap (20 dyads). On average, unrelated neighbouring packs had low levels of overlap restricted to the peripheral regions of their 95% utilisation kernels. Related neighbours had significantly greater levels of peripheral overlap. Only one unrelated dyad included overlap between 75%-75% kernels, but no 50%-50% kernels overlapped. However, eight of 12 related dyads overlapped between their respective 75% kernels and six between the frequented 50% kernels. Overlap between these more frequented kernels confers a heightened likelihood of encounter, as the mean utilisation intensity per unit area within the 50% kernels was 4.93 times greater than in the 95% kernels, and 2.34 times greater than in the 75% kernels. Related packs spent significantly more time in their 95% kernel overlap zones than did unrelated packs. Pack size appeared to have little effect on overlap between related dyads, yet among unrelated neighbours larger packs tended to overlap more onto smaller packs' territories. However, the true effect is unclear given that the model's confidence intervals overlapped zero. Evidence suggests that costly intraspecific aggression is greatly reduced between related packs. Consequently, the tendency for dispersing individuals to establish territories alongside relatives, where intensively utilised portions of ranges regularly overlap, may extend kin selection and inclusive fitness benefits from the intra-pack to inter-pack level. This natural spacing system can affect survival parameters and the carrying capacity of protected areas, having important management implications for intensively managed populations of this endangered species.
Validating the random search model for two targets of different difficulty.
Chan, Alan H S; Yu, Ruifeng
2010-02-01
A random visual search model was fitted to 1,788 search times obtained from a nonidentical double-target search task. 30 Hong Kong Chinese (13 men, 17 women) ages 18 to 33 years (M = 23, SD = 6.8) took part in the experiment voluntarily. The overall adequacy and prediction accuracy of the model for various search time parameters (mean and median search times and response times) for both individual and pooled data show that search strategy may reasonably be inferred from search time distributions. The results also suggested the general applicability of the random search model for describing the search behavior of a large number of participants performing the type of search used here, as well as the practical feasibility of its application for determination of stopping policy for optimization of an inspection system design. Although the data generally conformed to the model the search for the more difficult target was faster than expected. The more difficult target was usually detected after the easier target and it is suggested that some degree of memory-guided searching may have been used for the second target. Some abnormally long search times were observed and it is possible that these might have been due to the characteristics of visual lobes, nonoptimum interfixation distances and inappropriate overlapping of lobes, as has been previously reported.
Microstructural characterization of random packings of cubic particles
Malmir, Hessam; Sahimi, Muhammad; Tabar, M. Reza Rahimi
2016-01-01
Understanding the properties of random packings of solid objects is of critical importance to a wide variety of fundamental scientific and practical problems. The great majority of the previous works focused, however, on packings of spherical and sphere-like particles. We report the first detailed simulation and characterization of packings of non-overlapping cubic particles. Such packings arise in a variety of problems, ranging from biological materials, to colloids and fabrication of porous scaffolds using salt powders. In addition, packing of cubic salt crystals arise in various problems involving preservation of pavements, paintings, and historical monuments, mineral-fluid interactions, CO2 sequestration in rock, and intrusion of groundwater aquifers by saline water. Not much is known, however, about the structure and statistical descriptors of such packings. We have developed a version of the random sequential addition algorithm to generate such packings, and have computed a variety of microstructural descriptors, including the radial distribution function, two-point probability function, orientational correlation function, specific surface, and mean chord length, and have studied the effect of finite system size and porosity on such characteristics. The results indicate the existence of both spatial and orientational long-range order in the packing, which is more distinctive for higher packing densities. The maximum packing fraction is about 0.57. PMID:27725736
NASA Astrophysics Data System (ADS)
Souza, Christiane S. R.; Cândido, Geraldo M.; Alves, Wellington; Marlet, José Maria F.; Rezende, Mirabel C.
2017-10-01
This study aims to contribute to sustainability by proposing the reuse of composite prepreg scrap as an added value from discards. The research evaluates the microstructure and mechanical properties of laminates processed by the reuse of uncured carbon fibre/F155-epoxy resin prepreg scraps, waste from the ply cutting area of an aeronautical industry. The composite scraps were used as collected and were randomly positioned to produce laminates to be cured at an autoclave. The mechanical characterization shows a decrease of 39% for the compression property due to the discontinuous fibres in the laminate and an increase of 34% for the interlaminar shear strength, when compared to continuous fibre laminates. This increase is attributed to the higher crosslink density of the epoxy resin, as a result of the cure temperature used in autoclave (60 °C higher than suggested by supplier) and also to the randomly positioned scraps. Microscopic analyses confirm the consolidation of laminates, although show resin rich areas with different sizes and shapes attributed to the overlapping of the scraps with different sizes and shapes. These resin rich areas may contribute to decrease the mechanical properties of laminates. The correlation between mechanical and morphological results shows potential to be used on non-critical structural application, as composite jigs, contributing to sustainability.
Microstructural characterization of random packings of cubic particles
Malmir, Hessam; Sahimi, Muhammad; Tabar, M. Reza Rahimi
2016-10-11
Understanding the properties of random packings of solid objects is of critical importance to a wide variety of fundamental scientific and practical problems. The great majority of the previous works focused, however, on packings of spherical and sphere-like particles. We report the first detailed simulation and characterization of packings of non-overlapping cubic particles. Such packings arise in a variety of problems, ranging from biological materials, to colloids and fabrication of porous scaffolds using salt powders. In addition, packing of cubic salt crystals arise in various problems involving preservation of pavements, paintings, and historical monuments, mineral-fluid interactions, CO 2 sequestration inmore » rock, and intrusion of groundwater aquifers by saline water. Not much is known, however, about the structure and statistical descriptors of such packings. We have developed a version of the random sequential addition algorithm to generate such packings, and have computed a variety of microstructural descriptors, including the radial distribution function, two-point probability function, orientational correlation function, specific surface, and mean chord length, and have studied the effect of finite system size and porosity on such characteristics. Here, the results indicate the existence of both spatial and orientational long-range order in the packing, which is more distinctive for higher packing densities.« less
Characteristics of nuclepore filters with large pore size—I. Physical properties
NASA Astrophysics Data System (ADS)
John, W.; Hering, S.; Reischl, G.; Sasaki, G.; Goren, S.
Measurements of pore diameter, pore density and filter thickness have been made on Nuclepore filters of 5, 8 and 12 μm pore size. The areal distribution of the pores is random, as verified by total hole counts and by counts of overlapping holes. Filter thicknesses decrease with increasing pore diameter. The Hagen-Poiseuille formula accounts for less than half of the measured pressure drop across 12 μm pore size filters. A new calculation, including a term for the pressure drop external to the filter, accounts quantitatively for the observations. There are sufficient variations among filter batches to require knowledge of the filter parameters for each batch to ensure accurate measurements using these filters.
Constipation: evaluation and treatment of colonic and anorectal motility disorders.
Rao, Satish S C
2007-09-01
This article focuses on the colonic and anorectal motility disturbances that are associated with chronic constipation and their management. Functional chronic constipation consists of three overlapping subtypes: slow transit constipation, dyssynergic defecation, and irritable bowel syndrome with constipation. The Rome criteria may serve as a useful guide for making a clinical diagnosis of functional constipation. Today, an evidence-based approach can be used to treat patients with chronic constipation. The availability of specific drugs for the treatment of chronic constipation, such as tegaserod and lubiprostone, has enhanced the therapeutic armamentarium for managing these patients. Randomized controlled trials have also established the efficacy of biofeedback therapy in the treatment of dyssynergic defecation.
Fretheim, Atle; Zhang, Fang; Ross-Degnan, Dennis; Oxman, Andrew D; Cheyne, Helen; Foy, Robbie; Goodacre, Steve; Herrin, Jeph; Kerse, Ngaire; McKinlay, R James; Wright, Adam; Soumerai, Stephen B
2015-03-01
There is often substantial uncertainty about the impacts of health system and policy interventions. Despite that, randomized controlled trials (RCTs) are uncommon in this field, partly because experiments can be difficult to carry out. An alternative method for impact evaluation is the interrupted time-series (ITS) design. Little is known, however, about how results from the two methods compare. Our aim was to explore whether ITS studies yield results that differ from those of randomized trials. We conducted single-arm ITS analyses (segmented regression) based on data from the intervention arm of cluster randomized trials (C-RCTs), that is, discarding control arm data. Secondarily, we included the control group data in the analyses, by subtracting control group data points from intervention group data points, thereby constructing a time series representing the difference between the intervention and control groups. We compared the results from the single-arm and controlled ITS analyses with results based on conventional aggregated analyses of trial data. The findings were largely concordant, yielding effect estimates with overlapping 95% confidence intervals (CI) across different analytical methods. However, our analyses revealed the importance of a concurrent control group and of taking baseline and follow-up trends into account in the analysis of C-RCTs. The ITS design is valuable for evaluation of health systems interventions, both when RCTs are not feasible and in the analysis and interpretation of data from C-RCTs. Copyright © 2015 The Authors. Published by Elsevier Inc. All rights reserved.
Latin Hypercube Sampling (LHS) UNIX Library/Standalone
DOE Office of Scientific and Technical Information (OSTI.GOV)
2004-05-13
The LHS UNIX Library/Standalone software provides the capability to draw random samples from over 30 distribution types. It performs the sampling by a stratified sampling method called Latin Hypercube Sampling (LHS). Multiple distributions can be sampled simultaneously, with user-specified correlations amongst the input distributions, LHS UNIX Library/ Standalone provides a way to generate multi-variate samples. The LHS samples can be generated either as a callable library (e.g., from within the DAKOTA software framework) or as a standalone capability. LHS UNIX Library/Standalone uses the Latin Hypercube Sampling method (LHS) to generate samples. LHS is a constrained Monte Carlo sampling scheme. Inmore » LHS, the range of each variable is divided into non-overlapping intervals on the basis of equal probability. A sample is selected at random with respect to the probability density in each interval, If multiple variables are sampled simultaneously, then values obtained for each are paired in a random manner with the n values of the other variables. In some cases, the pairing is restricted to obtain specified correlations amongst the input variables. Many simulation codes have input parameters that are uncertain and can be specified by a distribution, To perform uncertainty analysis and sensitivity analysis, random values are drawn from the input parameter distributions, and the simulation is run with these values to obtain output values. If this is done repeatedly, with many input samples drawn, one can build up a distribution of the output as well as examine correlations between input and output variables.« less
IAOseq: inferring abundance of overlapping genes using RNA-seq data.
Sun, Hong; Yang, Shuang; Tun, Liangliang; Li, Yixue
2015-01-01
Overlapping transcription constitutes a common mechanism for regulating gene expression. A major limitation of the overlapping transcription assays is the lack of high throughput expression data. We developed a new tool (IAOseq) that is based on reads distributions along the transcribed regions to identify the expression levels of overlapping genes from standard RNA-seq data. Compared with five commonly used quantification methods, IAOseq showed better performance in the estimation accuracy of overlapping transcription levels. For the same strand overlapping transcription, currently existing high-throughput methods are rarely available to distinguish which strand was present in the original mRNA template. The IAOseq results showed that the commonly used methods gave an average of 1.6 fold overestimation of the expression levels of same strand overlapping genes. This work provides a useful tool for mining overlapping transcription levels from standard RNA-seq libraries. IAOseq could be used to help us understand the complex regulatory mechanism mediated by overlapping transcripts. IAOseq is freely available at http://lifecenter.sgst.cn/main/en/IAO_seq.jsp.
Interpersonal problems, dependency, and self-criticism in major depressive disorder.
Dinger, Ulrike; Barrett, Marna S; Zimmermann, Johannes; Schauenburg, Henning; Wright, Aidan G C; Renner, Fritz; Zilcha-Mano, Sigal; Barber, Jacques P
2015-01-01
The goal of the present research was the examination of overlap between 2 research traditions on interpersonal personality traits in major depression. We hypothesized that Blatt's (2004) dimensions of depressive experiences around the dimensions of relatedness (i.e., dependency) and self-definition (i.e., self-criticism) are associated with specific interpersonal problems according to the interpersonal circumplex model (Leary, 1957). In addition, we examined correlations of interpersonal characteristics with depression severity. Analyses were conducted on 283 patients with major depressive disorder combined from 2 samples. Of the patients, 151 participated in a randomized controlled trial in the United States, and 132 patients were recruited in an inpatient unit in Germany. Patients completed measures of symptomatic distress, interpersonal problems, and depressive experiences. Dependency was associated with more interpersonal problems related to low dominance and high affiliation, while self-criticism was associated with more interpersonal problems related to low affiliation. These associations were independent of depression severity. Self-criticism showed high overlap with cognitive symptoms of depression. The findings support the interpersonal nature of Blatt's dimensions of depressive experiences. Self-criticism is associated with being too distant or cold toward others as well as greater depression severity, but is not related to the dimension of dominance. © 2014 Wiley Periodicals, Inc.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Novikov, V.
1991-05-01
The U.S. Army's detailed equipment decontamination process is a stochastic flow shop which has N independent non-identical jobs (vehicles) which have overlapping processing times. This flow shop consists of up to six non-identical machines (stations). With the exception of one station, the processing times of the jobs are random variables. Based on an analysis of the processing times, the jobs for the 56 Army heavy division companies were scheduled according to the best shortest expected processing time - longest expected processing time (SEPT-LEPT) sequence. To assist in this scheduling the Gap Comparison Heuristic was developed to select the best SEPT-LEPTmore » schedule. This schedule was then used in balancing the detailed equipment decon line in order to find the best possible site configuration subject to several constraints. The detailed troop decon line, in which all jobs are independent and identically distributed, was then balanced. Lastly, an NBC decon optimization computer program was developed using the scheduling and line balancing results. This program serves as a prototype module for the ANBACIS automated NBC decision support system.... Decontamination, Stochastic flow shop, Scheduling, Stochastic scheduling, Minimization of the makespan, SEPT-LEPT Sequences, Flow shop line balancing, ANBACIS.« less
Yang, Jialiang; Qiu, Jing; Wang, Kejing; Zhu, Lijuan; Fan, Jingjing; Zheng, Deyin; Meng, Xiaodi; Yang, Jiasheng; Peng, Lihong; Fu, Yu; Zhang, Dahan; Peng, Shouneng; Huang, Haiyun; Zhang, Yi
2017-01-01
Obesity is a primary risk factor for many diseases such as certain cancers. In this study, we have developed three algorithms including a random-walk based method OBNet, a shortest-path based method OBsp and a direct-overlap method OBoverlap, to reveal obesity-disease connections at protein-interaction subnetworks corresponding to thousands of biological functions and pathways. Through literature mining, we also curated an obesity-associated disease list, by which we compared the methods. As a result, OBNet outperforms other two methods. OBNet can predict whether a disease is obesity-related based on its associated genes. Meanwhile, OBNet identifies extensive connections between obesity genes and genes associated with a few diseases at various functional modules and pathways. Using breast cancer and Type 2 diabetes as two examples, OBNet identifies meaningful genes that may play key roles in connecting obesity and the two diseases. For example, TGFB1 and VEGFA are inferred to be the top two key genes mediating obesity-breast cancer connection in modules associated with brain development. Finally, the top modules identified by OBNet in breast cancer significantly overlap with modules identified from TCGA breast cancer gene expression study, revealing the power of OBNet in identifying biological processes involved in the disease. PMID:29156709
Wu, Wei; Park, Kyung-Tae; Holyoak, Todd; Lutkenhaus, Joe
2011-01-01
Summary The three Min proteins spatially regulate Z ring positioning in E. coli and are dynamically associated with the membrane. MinD binds to vesicles in the presence of ATP and can recruit MinC or MinE. Biochemical and genetic evidence indicate the binding sites for these two proteins on MinD overlap. Here we solved the structure of a hydrolytic-deficient mutant of MinD truncated for the C-terminal amphipathic helix involved in binding to the membrane. The structure solved in the presence of ATP is a dimer and reveals the face of MinD abutting the membrane. Using a combination of random and extensive site-directed mutagenesis additional residues important for MinE and MinC binding were identified. The location of these residues on the MinD structure confirms that the binding sites overlap and reveals that the binding sites are at the dimer interface and exposed to the cytosol. The location of the binding sites at the dimer interface offers a simple explanation for the ATP-dependency of MinC and MinE binding to MinD. PMID:21231967
Artificial neural networks as quantum associative memory
NASA Astrophysics Data System (ADS)
Hamilton, Kathleen; Schrock, Jonathan; Imam, Neena; Humble, Travis
We present results related to the recall accuracy and capacity of Hopfield networks implemented on commercially available quantum annealers. The use of Hopfield networks and artificial neural networks as content-addressable memories offer robust storage and retrieval of classical information, however, implementation of these models using currently available quantum annealers faces several challenges: the limits of precision when setting synaptic weights, the effects of spurious spin-glass states and minor embedding of densely connected graphs into fixed-connectivity hardware. We consider neural networks which are less than fully-connected, and also consider neural networks which contain multiple sparsely connected clusters. We discuss the effect of weak edge dilution on the accuracy of memory recall, and discuss how the multiple clique structure affects the storage capacity. Our work focuses on storage of patterns which can be embedded into physical hardware containing n < 1000 qubits. This work was supported by the United States Department of Defense and used resources of the Computational Research and Development Programs as Oak Ridge National Laboratory under Contract No. DE-AC0500OR22725 with the U. S. Department of Energy.
Graph rigidity, cyclic belief propagation, and point pattern matching.
McAuley, Julian J; Caetano, Tibério S; Barbosa, Marconi S
2008-11-01
A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal graphical model. Its fundamental result is that the chordal graph in question is shown to be globally rigid, implying that exact inference provides the same matching solution as exact inference in a complete graphical model. This implies that the algorithm is optimal when there is no noise in the point patterns. In this paper, we present a new graph that is also globally rigid but has an advantage over the graph proposed in [1]: Its maximal clique size is smaller, rendering inference significantly more efficient. However, this graph is not chordal, and thus, standard Junction Tree algorithms cannot be directly applied. Nevertheless, we show that loopy belief propagation in such a graph converges to the optimal solution. This allows us to retain the optimality guarantee in the noiseless case, while substantially reducing both memory requirements and processing time. Our experimental results show that the accuracy of the proposed solution is indistinguishable from that in [1] when there is noise in the point patterns.
The Evolution of Networks in Extreme and Isolated Environment
NASA Technical Reports Server (NTRS)
Johnson, Jeffrey C.; Boster, James S.; Palinkas, Lawrence A.
2000-01-01
This article reports on the evolution of network structure as it relates to the formal and informal aspects of social roles in well bounded, isolated groups. Research was conducted at the Amundsen-Scott South Pole Station over a 3-year period. Data was collected on crewmembers' networks of social interaction and personal advice over each of the 8.5-month winters during a time of complete isolation. In addition, data was collected on informal social role structure (e.g., instrumental leadership, expressive leadership). It was hypothesized that development and maintenance of a cohesive group structure was related to the presence of and group consensus on various informal social roles. The study found that core-periphery structures (i.e., reflecting cohesion) in winter-over groups were associated with the presence of critically important informal social roles (e.g., expressive leadership) and high group consensus on such informal roles. On the other hand, the evolution of clique structures (i.e., lack of cohesion) were associated with the absence of critical roles and a lack of consensus on these roles, particularly the critically important role of instrumental leader.
Liu, Jianhua; Jiang, Hongbo; Zhang, Hao; Guo, Chun; Wang, Lei; Yang, Jing; Nie, Shaofa
2017-06-27
In the summer of 2014, an influenza A(H3N2) outbreak occurred in Yichang city, Hubei province, China. A retrospective study was conducted to collect and interpret hospital and epidemiological data on it using social network analysis and global sensitivity and uncertainty analyses. Results for degree (χ2=17.6619, P<0.0001) and betweenness(χ2=21.4186, P<0.0001) centrality suggested that the selection of sampling objects were different between traditional epidemiological methods and newer statistical approaches. Clique and network diagrams demonstrated that the outbreak actually consisted of two independent transmission networks. Sensitivity analysis showed that the contact coefficient (k) was the most important factor in the dynamic model. Using uncertainty analysis, we were able to better understand the properties and variations over space and time on the outbreak. We concluded that use of newer approaches were significantly more efficient for managing and controlling infectious diseases outbreaks, as well as saving time and public health resources, and could be widely applied on similar local outbreaks.
NASA Astrophysics Data System (ADS)
Morrison, S. M.; Downs, R. T.; Golden, J. J.; Pires, A.; Fox, P. A.; Ma, X.; Zednik, S.; Eleish, A.; Prabhu, A.; Hummer, D. R.; Liu, C.; Meyer, M.; Ralph, J.; Hystad, G.; Hazen, R. M.
2016-12-01
We have developed a comprehensive database of copper (Cu) mineral characteristics. These data include crystallographic, paragenetic, chemical, locality, age, structural complexity, and physical property information for the 689 Cu mineral species approved by the International Mineralogical Association (rruff.info/ima). Synthesis of this large, varied dataset allows for in-depth exploration of statistical trends and visualization techniques. With social network analysis (SNA) and cluster analysis of minerals, we create sociograms and chord diagrams. SNA visualizations illustrate the relationships and connectivity between mineral species, which often form cliques associated with rock type and/or geochemistry. Using mineral ecology statistics, we analyze mineral-locality frequency distribution and predict the number of missing mineral species, visualized with accumulation curves. By assembly of 2-dimensional KLEE diagrams of co-existing elements in minerals, we illustrate geochemical trends within a mineral system. To explore mineral age and chemical oxidation state, we create skyline diagrams and compare trends with varying chemistry. These trends illustrate mineral redox changes through geologic time and correlate with significant geologic occurrences, such as the Great Oxidation Event (GOE) or Wilson Cycles.
Structural and chemical orders in N i 64.5 Z r 35.5 metallic glass by molecular dynamics simulation
Tang, L.; Wen, T. Q.; Wang, N.; ...
2018-03-06
The atomic structure of Ni 64.5Zr 35.5 metallic glass has been investigated by molecular dynamics (MD) simulations. The calculated structure factors from the MD glassy sample at room temperature agree well with the X-ray diffraction (XRD) and neutron diffraction (ND) experimental data. Using the pairwise cluster alignment and clique analysis methods, we show that there are three types dominant short-range order (SRO) motifs around Ni atoms in the glass sample of Ni 64.5Zr 35.5, i.e., Mixed- Icosahedron(ICO)-Cube, Twined-Cube and icosahedron-like clusters. Furthermore, chemical order and medium-range order (MRO) analysis show that the Mixed-ICOCube and Twined-Cube clusters exhibit the characteristics ofmore » the crystalline B2 phase. In conclusion, our simulation results suggest that the weak glass-forming ability (GFA) of Ni 64.5Zr 35.5 can be attributed to the competition between the glass forming ICO SRO and the crystalline Mixed-ICO-Cube and Twined-Cube motifs.« less
Structural and chemical orders in N i 64.5 Z r 35.5 metallic glass by molecular dynamics simulation
DOE Office of Scientific and Technical Information (OSTI.GOV)
Tang, L.; Wen, T. Q.; Wang, N.
The atomic structure of Ni 64.5Zr 35.5 metallic glass has been investigated by molecular dynamics (MD) simulations. The calculated structure factors from the MD glassy sample at room temperature agree well with the X-ray diffraction (XRD) and neutron diffraction (ND) experimental data. Using the pairwise cluster alignment and clique analysis methods, we show that there are three types dominant short-range order (SRO) motifs around Ni atoms in the glass sample of Ni 64.5Zr 35.5, i.e., Mixed- Icosahedron(ICO)-Cube, Twined-Cube and icosahedron-like clusters. Furthermore, chemical order and medium-range order (MRO) analysis show that the Mixed-ICOCube and Twined-Cube clusters exhibit the characteristics ofmore » the crystalline B2 phase. In conclusion, our simulation results suggest that the weak glass-forming ability (GFA) of Ni 64.5Zr 35.5 can be attributed to the competition between the glass forming ICO SRO and the crystalline Mixed-ICO-Cube and Twined-Cube motifs.« less
A contextual approach to social skills assessment in the peer group: who is the best judge?
Kwon, Kyongboon; Kim, Elizabeth Moorman; Sheridan, Susan M
2012-09-01
Using a contextual approach to social skills assessment in the peer group, this study examined the criterion-related validity of contextually relevant social skills and the incremental validity of peers and teachers as judges of children's social skills. Study participants included 342 (180 male and 162 female) students and their classroom teachers (N = 22) from rural communities. As expected, contextually relevant social skills were significantly related to a variety of social status indicators (i.e., likability, peer- and teacher-assessed popularity, reciprocated friendships, clique centrality) and positive school functioning (i.e., school liking and academic competence). Peer-assessed social skills, not teacher-assessed social skills, demonstrated consistent incremental validity in predicting various indicators of social status outcomes; peer- and teacher-assessed social skills alike showed incremental validity in predicting positive school functioning. The relation between contextually relevant social skills and study outcomes did not vary by child gender. Findings are discussed in terms of the significance of peers in the assessment of children's social skills in the peer group as well as the usefulness of a contextual approach to social skills assessment.
A low complexity visualization tool that helps to perform complex systems analysis
NASA Astrophysics Data System (ADS)
Beiró, M. G.; Alvarez-Hamelin, J. I.; Busch, J. R.
2008-12-01
In this paper, we present an extension of large network visualization (LaNet-vi), a tool to visualize large scale networks using the k-core decomposition. One of the new features is how vertices compute their angular position. While in the later version it is done using shell clusters, in this version we use the angular coordinate of vertices in higher k-shells, and arrange the highest shell according to a cliques decomposition. The time complexity goes from O(n\\sqrt n) to O(n) upon bounds on a heavy-tailed degree distribution. The tool also performs a k-core-connectivity analysis, highlighting vertices that are not k-connected; e.g. this property is useful to measure robustness or quality of service (QoS) capabilities in communication networks. Finally, the actual version of LaNet-vi can draw labels and all the edges using transparencies, yielding an accurate visualization. Based on the obtained figure, it is possible to distinguish different sources and types of complex networks at a glance, in a sort of 'network iris-print'.
Alternative Parameterizations for Cluster Editing
NASA Astrophysics Data System (ADS)
Komusiewicz, Christian; Uhlmann, Johannes
Given an undirected graph G and a nonnegative integer k, the NP-hard Cluster Editing problem asks whether G can be transformed into a disjoint union of cliques by applying at most k edge modifications. In the field of parameterized algorithmics, Cluster Editing has almost exclusively been studied parameterized by the solution size k. Contrastingly, in many real-world instances it can be observed that the parameter k is not really small. This observation motivates our investigation of parameterizations of Cluster Editing different from the solution size k. Our results are as follows. Cluster Editing is fixed-parameter tractable with respect to the parameter "size of a minimum cluster vertex deletion set of G", a typically much smaller parameter than k. Cluster Editing remains NP-hard on graphs with maximum degree six. A restricted but practically relevant version of Cluster Editing is fixed-parameter tractable with respect to the combined parameter "number of clusters in the target graph" and "maximum number of modified edges incident to any vertex in G". Many of our results also transfer to the NP-hard Cluster Deletion problem, where only edge deletions are allowed.
Optimal parallel solution of sparse triangular systems
NASA Technical Reports Server (NTRS)
Alvarado, Fernando L.; Schreiber, Robert
1990-01-01
A method for the parallel solution of triangular sets of equations is described that is appropriate when there are many right-handed sides. By preprocessing, the method can reduce the number of parallel steps required to solve Lx = b compared to parallel forward or backsolve. Applications are to iterative solvers with triangular preconditioners, to structural analysis, or to power systems applications, where there may be many right-handed sides (not all available a priori). The inverse of L is represented as a product of sparse triangular factors. The problem is to find a factored representation of this inverse of L with the smallest number of factors (or partitions), subject to the requirement that no new nonzero elements be created in the formation of these inverse factors. A method from an earlier reference is shown to solve this problem. This method is improved upon by constructing a permutation of the rows and columns of L that preserves triangularity and allow for the best possible such partition. A number of practical examples and algorithmic details are presented. The parallelism attainable is illustrated by means of elimination trees and clique trees.
Towards a Computational Analysis of Status and Leadership Styles on FDA Panels
NASA Astrophysics Data System (ADS)
Broniatowski, David A.; Magee, Christopher L.
Decisions by committees of technical experts are increasingly impacting society. These decision-makers are typically embedded within a web of social relations. Taken as a whole, these relations define an implicit social structure which can influence the decision outcome. Aspects of this structure are founded on interpersonal affinity between parties to the negotiation, on assigned roles, and on the recognition of status characteristics, such as relevant domain expertise. This paper build upon a methodology aimed at extracting an explicit representation of such social structures using meeting transcripts as a data source. Whereas earlier results demonstrated that the method presented here can identify groups of decision-makers with a contextual affinity (i.e., membership in a given medical specialty or voting clique), we now can extract meaningful status hierarchies, and can identify differing facilitation styles among committee chairs. Use of this method is demonstrated on the transcripts of U.S. Food and Drug Administration (FDA) advisory panel meeting transcripts; nevertheless, the approach presented here is extensible to other domains and requires only a meeting transcript as input.
Data-Driven Packet Loss Estimation for Node Healthy Sensing in Decentralized Cluster
Fan, Hangyu; Wang, Huandong; Li, Yong
2018-01-01
Decentralized clustering of modern information technology is widely adopted in various fields these years. One of the main reason is the features of high availability and the failure-tolerance which can prevent the entire system form broking down by a failure of a single point. Recently, toolkits such as Akka are used by the public commonly to easily build such kind of cluster. However, clusters of such kind that use Gossip as their membership managing protocol and use link failure detecting mechanism to detect link failures cannot deal with the scenario that a node stochastically drops packets and corrupts the member status of the cluster. In this paper, we formulate the problem to be evaluating the link quality and finding a max clique (NP-Complete) in the connectivity graph. We then proposed an algorithm that consists of two models driven by data from application layer to respectively solving these two problems. Through simulations with statistical data and a real-world product, we demonstrate that our algorithm has a good performance. PMID:29360792
Wu, Zhenyu; Zou, Ming
2014-10-01
An increasing number of users interact, collaborate, and share information through social networks. Unprecedented growth in social networks is generating a significant amount of unstructured social data. From such data, distilling communities where users have common interests and tracking variations of users' interests over time are important research tracks in fields such as opinion mining, trend prediction, and personalized services. However, these tasks are extremely difficult considering the highly dynamic characteristics of the data. Existing community detection methods are time consuming, making it difficult to process data in real time. In this paper, dynamic unstructured data is modeled as a stream. Tag assignments stream clustering (TASC), an incremental scalable community detection method, is proposed based on locality-sensitive hashing. Both tags and latent interactions among users are incorporated in the method. In our experiments, the social dynamic behaviors of users are first analyzed. The proposed TASC method is then compared with state-of-the-art clustering methods such as StreamKmeans and incremental k-clique; results indicate that TASC can detect communities more efficiently and effectively. Copyright © 2014 Elsevier Ltd. All rights reserved.
Wildlife governance in the 21st century—Will sustainable use endure?
Decker, Daniel J.; Organ, John F.; Forstchen, Ann; Jacobson, Cynthia A.; Siemer, William F.; Smith, Christian A.; Lederle, Patrick E.; Schiavone, Michael V.
2017-01-01
In light of the trajectory of wildlife governance in the United States, the future of sustainable use of wildlife is a topic of substantial interest in the wildlife conservation community. We examine sustainable-use principles with respect to “good governance” considerations and public trust administration principles to assess how sustainable use might fare in the 21st century. We conclude that sustainable-use principles are compatible with recently articulated wildlife governance principles and could serve to mitigate broad values and norm shifts in American society that affect social acceptability of particular uses. Wildlife governance principles emphasize inclusive discourse among diverse wildlife interests, which could minimize isolated exchanges among cliques of like-minded people pursuing their ambitions without seeking opportunity for sharing or understanding diverse views. Aligning governance practices with wildlife governance principles can help avoid such isolation. In summary, sustainable use of wildlife is likely to endure as long as society 1) believes the long-term sustainability of wildlife is not jeopardized, and 2) accepts practices associated with such use as legitimate. These are 2 criteria needing constant attention.
Structural and chemical orders in N i64.5Z r35.5 metallic glass by molecular dynamics simulation
NASA Astrophysics Data System (ADS)
Tang, L.; Wen, T. Q.; Wang, N.; Sun, Y.; Zhang, F.; Yang, Z. J.; Ho, K. M.; Wang, C. Z.
2018-03-01
The atomic structure of N i64.5Z r35.5 metallic glass has been investigated by molecular dynamics (MD) simulations. The calculated structure factors from the MD glassy sample at room temperature agree well with the x-ray diffraction (XRD) and neutron diffraction (ND) experimental data. Using the pairwise cluster alignment and clique analysis methods, we show that there are three types of dominant short-range order (SRO) motifs around Ni atoms in the glass sample of N i64.5Z r35.5 , i.e., mixed-icosahedron(ICO)-cube, intertwined-cube, and icosahedronlike clusters. Furthermore, chemical order and medium-range order (MRO) analysis show that the mixed-ICO-cube and intertwined-cube clusters exhibit the characteristics of the crystalline B2 phase. Our simulation results suggest that the weak glass-forming ability (GFA) of N i64.5Z r35.5 can be attributed to the competition between the glass forming ICO SRO and the crystalline mixed-ICO-cube and intertwined-cube motifs.
Successful COG8 and PDF overlap is mediated by alterations in splicing and polyadenylation signals.
Pereira-Castro, Isabel; Quental, Rita; da Costa, Luís T; Amorim, António; Azevedo, Luisa
2012-02-01
Although gene-free areas compose the great majority of eukaryotic genomes, a significant fraction of genes overlaps, i.e., unique nucleotide sequences are part of more than one transcription unit. In this work, the evolutionary history and origin of a same-strand gene overlap is dissected through the analysis of COG8 (component of oligomeric Golgi complex 8) and PDF (peptide deformylase). Comparative genomic surveys reveal that the relative locations of these two genes have been changing over the last 445 million years from distinct chromosomal locations in fish to overlapping in rodents and primates, indicating that the overlap between these genes precedes their divergence. The overlap between the two genes was initiated by the gain of a novel splice donor site between the COG8 stop codon and PDF initiation codon. Splicing is accomplished by the use of the PDF acceptor, leading COG8 to share the 3'end with PDF. In primates, loss of the ancestral polyadenylation signal for COG8 makes the overlap between COG8 and PDF mandatory, while in mouse and rat concurrent overlapping and non-overlapping Cog8 transcripts exist. Altogether, we demonstrate that the origin, evolution and preservation of the COG8/PDF same-strand overlap follow similar mechanistic steps as those documented for antisense overlaps where gain and/or loss of splice sites and polyadenylation signals seems to drive the process.
Locating hardware faults in a parallel computer
Archer, Charles J.; Megerian, Mark G.; Ratterman, Joseph D.; Smith, Brian E.
2010-04-13
Locating hardware faults in a parallel computer, including defining within a tree network of the parallel computer two or more sets of non-overlapping test levels of compute nodes of the network that together include all the data communications links of the network, each non-overlapping test level comprising two or more adjacent tiers of the tree; defining test cells within each non-overlapping test level, each test cell comprising a subtree of the tree including a subtree root compute node and all descendant compute nodes of the subtree root compute node within a non-overlapping test level; performing, separately on each set of non-overlapping test levels, an uplink test on all test cells in a set of non-overlapping test levels; and performing, separately from the uplink tests and separately on each set of non-overlapping test levels, a downlink test on all test cells in a set of non-overlapping test levels.
Hsu, Chi-Pin; Lin, Shang-Chih; Shih, Kao-Shang; Huang, Chang-Hung; Lee, Chian-Her
2014-12-01
After total knee replacement, the model-based Roentgen stereophotogrammetric analysis (RSA) technique has been used to monitor the status of prosthetic wear, misalignment, and even failure. However, the overlap of the prosthetic outlines inevitably increases errors in the estimation of prosthetic poses due to the limited amount of available outlines. In the literature, quite a few studies have investigated the problems induced by the overlapped outlines, and manual adjustment is still the mainstream. This study proposes two methods to automate the image processing of overlapped outlines prior to the pose registration of prosthetic models. The outline-separated method defines the intersected points and segments the overlapped outlines. The feature-recognized method uses the point and line features of the remaining outlines to initiate registration. Overlap percentage is defined as the ratio of overlapped to non-overlapped outlines. The simulated images with five overlapping percentages are used to evaluate the robustness and accuracy of the proposed methods. Compared with non-overlapped images, overlapped images reduce the number of outlines available for model-based RSA calculation. The maximum and root mean square errors for a prosthetic outline are 0.35 and 0.04 mm, respectively. The mean translation and rotation errors are 0.11 mm and 0.18°, respectively. The errors of the model-based RSA results are increased when the overlap percentage is beyond about 9%. In conclusion, both outline-separated and feature-recognized methods can be seamlessly integrated to automate the calculation of rough registration. This can significantly increase the clinical practicability of the model-based RSA technique.
Characterization of random scattering media and related information retrieval
NASA Astrophysics Data System (ADS)
Wang, Zhenyu
There has been substantial interest in optical imaging in and through random media in applications as diverse as environmental sensing and tumor detection. The rich scatter environment also leads to multiple paths or channels, which may provide higher capacity for communication. Coherent light passing through random media produces an intensity speckle pattern when imaged, as a result of multiple scatter and the imaging optics. When polarized coherent light is used, the speckle pattern is sensitive to the polarization state, depending on the amount of scatter, and such measurements provide information about the random medium. This may form the basis for enhanced imaging of random media and provide information on the scatterers themselves. Second and third order correlations over laser scan frequency are shown to lead to the ensemble averaged temporal impulse response, with sensitivity to the polarization state in the more weakly scattering regime. A new intensity interferometer is introduced that provides information about two signals incident on a scattering medium. The two coherent beams, which are not necessarily overlapping, interfere in a scattering medium. A sinusoidal modulation in the second order intensity correlation with laser scan frequency is shown to be related to the relative delay of the two incident beams. An intensity spatial correlation over input position reveals that decorrelation occurs over a length comparable to the incident beam size. Such decorrelation is also related to the amount of scatter. Remarkably, with two beams incident at different angles, the intensity correlation over the scan position has a sinusoidal modulation that is related to the incidence angle difference between the two input beams. This spatial correlation over input position thus provides information about input wavevectors.
Large Uncertainty in Estimating pCO2 From Carbonate Equilibria in Lakes
NASA Astrophysics Data System (ADS)
Golub, Malgorzata; Desai, Ankur R.; McKinley, Galen A.; Remucal, Christina K.; Stanley, Emily H.
2017-11-01
Most estimates of carbon dioxide (CO2) evasion from freshwaters rely on calculating partial pressure of aquatic CO2 (pCO2) from two out of three CO2-related parameters using carbonate equilibria. However, the pCO2 uncertainty has not been systematically evaluated across multiple lake types and equilibria. We quantified random errors in pH, dissolved inorganic carbon, alkalinity, and temperature from the North Temperate Lakes Long-Term Ecological Research site in four lake groups across a broad gradient of chemical composition. These errors were propagated onto pCO2 calculated from three carbonate equilibria, and for overlapping observations, compared against uncertainties in directly measured pCO2. The empirical random errors in CO2-related parameters were mostly below 2% of their median values. Resulting random pCO2 errors ranged from ±3.7% to ±31.5% of the median depending on alkalinity group and choice of input parameter pairs. Temperature uncertainty had a negligible effect on pCO2. When compared with direct pCO2 measurements, all parameter combinations produced biased pCO2 estimates with less than one third of total uncertainty explained by random pCO2 errors, indicating that systematic uncertainty dominates over random error. Multidecadal trend of pCO2 was difficult to reconstruct from uncertain historical observations of CO2-related parameters. Given poor precision and accuracy of pCO2 estimates derived from virtually any combination of two CO2-related parameters, we recommend direct pCO2 measurements where possible. To achieve consistently robust estimates of CO2 emissions from freshwater components of terrestrial carbon balances, future efforts should focus on improving accuracy and precision of CO2-related parameters (including direct pCO2) measurements and associated pCO2 calculations.
Park, Hye Yun; Lee, Suh-Young; Kang, Danbee; Cho, Juhee; Lee, Hyun; Lim, Seong Yong; Yoon, Ho Il; Ra, Seung Won; Kim, Ki Uk; Oh, Yeon-Mok; Sin, Don D; Lee, Sang-Do; Park, Yong Bum
2018-03-02
The recognition of asthma-chronic obstructive pulmonary disease (COPD) overlap (ACO) as a distinct phenotype of COPD or asthma has increased. Although ACO has worse clinical features than non-ACO COPD, limited information is available on long-term outcomes of lung function decline for ACO and non-ACO COPD. COPD patients with at least 3 years of follow-up were selected from the Korean Obstructive Lung Disease cohort. ACO was defined based on 3 major criteria: 1) airflow limitation in individuals 40 years of age and older, 2) ≥10 pack-years of smoking history, and 3) a history of asthma or bronchodilator response of > 400 mL in forced expiratory volume in 1 s (FEV 1 ) at baseline; and at least 1 minor criterion: 1) history of atopy or allergic rhinitis, 2) two separated bronchodilator responses of ≥12% and 200 mL in FEV 1 , or 3) peripheral blood eosinophils ≥300 cells/μL. Lung function decline was compared using a linear mixed effects model for longitudinal data with random intercept and random slope. Among 239 patients, 47 were diagnosed with ACO (19.7%). During the follow-up period, change in smoking status, use of inhaled corticosteroids (ICS) and long-acting β2-agonists or ICS and at least 2 exacerbations per year were similar between patients with non-ACO COPD and ACO. Over a median follow-up duration of 5.8 years, patients with non-ACO COPD experienced a faster annual decline in pre-bronchodilator FEV 1 than patients with ACO (- 29.3 ml/year vs. -13.9 ml/year, P = 0.042), which was persistent after adjustment for confounders affecting lung function decline. Patients with ACO showed favorable longitudinal changes in lung function compared to COPD patients over a median follow-up of 5.8 years.
Maintenance of tactile short-term memory for locations is mediated by spatial attention.
Katus, Tobias; Andersen, Søren K; Müller, Matthias M
2012-01-01
According to the attention-based rehearsal hypothesis, maintenance of spatial information is mediated by covert orienting towards memorized locations. In a somatosensory memory task, participants simultaneously received bilateral pairs of mechanical sample pulses. For each hand, sample stimuli were randomly assigned to one of three locations (fingers). A subsequent visual retro-cue determined whether the left or right hand sample was to be memorized. The retro-cue elicited lateralized activity reflecting the location of the relevant sample stimulus. Sensory processing during the retention period was probed by task-irrelevant pulses randomized to locations at the cued and uncued hand. The somatosensory N140 was enhanced for probes delivered to the cued hand, relative to uncued. Probes presented shortly after the retro-cue showed greatest attentional modulations. This suggests that transient contributions from retrospective selection overlapped with the sustained effect of attention-based rehearsal. In conclusion, focal attention shifts within tactile mnemonic content occurred after retro-cues and guided sensory processing during retention. Copyright © 2011 Elsevier B.V. All rights reserved.
Cross Matching as Strategy to Find Radio Stars
NASA Astrophysics Data System (ADS)
Christian, Tiffany; Kimball, Amy
2018-01-01
Using cross-matching between the FIRST (20cm) and GPS1 (optical) catalogs, we identified possible radio star candidates. This is an extension of earlier work by Kimball et al. (2009), who sought to identify radiostar candidates by cross-matching the FIRST (radio)and SDSS (optical) catalogs, but did not include the consideration of stellar proper motions. We used proper motions from GPS1 to match with FIRST radio sources; the region of sky where they overlap contains ~900,000 FIRST sources and several million GPS1 sources. We used WISE near-infrared and PanSTARRS optical information to identify matches that have stellar colors. Our selection constraints identified 6 stars (spectroscopically confirmed) as radio star candidates. They are faint in the radio (<1 mJy) indicating we may be searching at the limits of the radio survey. Other candidates had no spectral confirmation or object type identification in SIMBAD, which would make them ideal for follow up radio observations. However, random analysis indicated that many other possible candidates were random associations, which may also be true for these 6 stars.
Electromagnetic mixing laws: A supersymmetric approach
NASA Astrophysics Data System (ADS)
Niez, J. J.
2010-02-01
In this article we address the old problem of finding the effective dielectric constant of materials described either by a local random dielectric constant, or by a set of non-overlapping spherical inclusions randomly dispersed in a host. We use a unified theoretical framework, such that all the most important Electromagnetic Mixing Laws (EML) can be recovered as the first iterative step of a family of results, thus opening the way to future improvements through the refinements of the approximation schemes. When the material is described by a set of immersed inclusions characterized by their spatial correlation functions, we exhibit an EML which, being featured by a minimal approximation scheme, does not come from the multiple scattering paradigm. It is made of a pure Hori-Yonezawa formula, corrected by a power series of the inclusion density. The coefficients of the latter, which are given as sums of standard diagrams, are recast into electromagnetic quantities which calculation is amenable numerically thanks to codes available on the web. The methods used and developed in this work are generic and can be used in a large variety of areas ranging from mechanics to thermodynamics.
An Efficient Distributed Coverage Hole Detection Protocol for Wireless Sensor Networks
Kumar Sahoo, Prasan; Chiang, Ming-Jer; Wu, Shih-Lin
2016-01-01
In wireless sensor networks (WSNs), certain areas of the monitoring region may have coverage holes and serious coverage overlapping due to the random deployment of sensors. The failure of electronic components, software bugs and destructive agents could lead to the random death of the nodes. Sensors may be dead due to exhaustion of battery power, which may cause the network to be uncovered and disconnected. Based on the deployment nature of the nodes in remote or hostile environments, such as a battlefield or desert, it is impossible to recharge or replace the battery. However, the data gathered by the sensors are highly essential for the analysis, and therefore, the collaborative detection of coverage holes has strategic importance in WSNs. In this paper, distributed coverage hole detection algorithms are designed, where nodes can collaborate to detect the coverage holes autonomously. The performance evaluation of our protocols suggests that our protocols outperform in terms of hole detection time, limited power consumption and control packet overhead to detect holes as compared to other similar protocols. PMID:26999143
Slowing down bubbles with sound
NASA Astrophysics Data System (ADS)
Poulain, Cedric; Dangla, Remie; Guinard, Marion
2009-11-01
We present experimental evidence that a bubble moving in a fluid in which a well-chosen acoustic noise is superimposed can be significantly slowed down even for moderate acoustic pressure. Through mean velocity measurements, we show that a condition for this effect to occur is for the acoustic noise spectrum to match or overlap the bubble's fundamental resonant mode. We render the bubble's oscillations and translational movements using high speed video. We show that radial oscillations (Rayleigh-Plesset type) have no effect on the mean velocity, while above a critical pressure, a parametric type instability (Faraday waves) is triggered and gives rise to nonlinear surface oscillations. We evidence that these surface waves are subharmonic and responsible for the bubble's drag increase. When the acoustic intensity is increased, Faraday modes interact and the strongly nonlinear oscillations behave randomly, leading to a random behavior of the bubble's trajectory and consequently to a higher slow down. Our observations may suggest new strategies for bubbly flow control, or two-phase microfluidic devices. It might also be applicable to other elastic objects, such as globules, cells or vesicles, for medical applications such as elasticity-based sorting.
Fine-scale spatial genetic dynamics over the life cycle of the tropical tree Prunus africana.
Berens, D G; Braun, C; González-Martínez, S C; Griebeler, E M; Nathan, R; Böhning-Gaese, K
2014-11-01
Studying fine-scale spatial genetic patterns across life stages is a powerful approach to identify ecological processes acting within tree populations. We investigated spatial genetic dynamics across five life stages in the insect-pollinated and vertebrate-dispersed tropical tree Prunus africana in Kakamega Forest, Kenya. Using six highly polymorphic microsatellite loci, we assessed genetic diversity and spatial genetic structure (SGS) from seed rain and seedlings, and different sapling stages to adult trees. We found significant SGS in all stages, potentially caused by limited seed dispersal and high recruitment rates in areas with high light availability. SGS decreased from seed and early seedling stages to older juvenile stages. Interestingly, SGS was stronger in adults than in late juveniles. The initial decrease in SGS was probably driven by both random and non-random thinning of offspring clusters during recruitment. Intergenerational variation in SGS could have been driven by variation in gene flow processes, overlapping generations in the adult stage or local selection. Our study shows that complex sequential processes during recruitment contribute to SGS of tree populations.
Effects of nitrates on mortality in acute myocardial infarction and in heart failure
Held, P.
1992-01-01
1 Seven randomized controlled trials of intravenous nitroglycerin in a total of about 850 patients have been reported. Overall, there were 51 deaths (12.5%) in the nitroglycerin group and 87 (20%) in the control group. This indicates a 48% reduction in the odds of death (P < 0.001, 95% confidence limits (25% to 64%)). 2 There are five randomized trials of oral nitrates after acute myocardial infarction. In these trials, 11.8% of the patients in the nitrate group compared with 13.3% in the control group died. This indicates a nonsignificant 12% reduction in the odds of death but the 95% confidence interval overlaps widely with the i.v. trials. If all trials of i.v. or oral nitrates are considered the reduction in the odds of death is 32% (P < 0.01). 3 Nitrates have a beneficial effect on haemodynamics in heart failure but the data on mortality effects are sparse. In combination with hydralazine, however, long-term mortality was reduced in the V-HEFT trial of chronic heart failure. PMID:1633075
Quantum Coherence and Random Fields at Mesoscopic Scales
DOE Office of Scientific and Technical Information (OSTI.GOV)
Rosenbaum, Thomas F.
2016-03-01
We seek to explore and exploit model, disordered and geometrically frustrated magnets where coherent spin clusters stably detach themselves from their surroundings, leading to extreme sensitivity to finite frequency excitations and the ability to encode information. Global changes in either the spin concentration or the quantum tunneling probability via the application of an external magnetic field can tune the relative weights of quantum entanglement and random field effects on the mesoscopic scale. These same parameters can be harnessed to manipulate domain wall dynamics in the ferromagnetic state, with technological possibilities for magnetic information storage. Finally, extensions from quantum ferromagnets tomore » antiferromagnets promise new insights into the physics of quantum fluctuations and effective dimensional reduction. A combination of ac susceptometry, dc magnetometry, noise measurements, hole burning, non-linear Fano experiments, and neutron diffraction as functions of temperature, magnetic field, frequency, excitation amplitude, dipole concentration, and disorder address issues of stability, overlap, coherence, and control. We have been especially interested in probing the evolution of the local order in the progression from spin liquid to spin glass to long-range-ordered magnet.« less
NASA Astrophysics Data System (ADS)
Fang, Dong-Liang; Faessler, Amand; Šimkovic, Fedor
2018-04-01
In this paper, with restored isospin symmetry, we evaluated the neutrinoless double-β -decay nuclear matrix elements for 76Ge, 82Se, 130Te, 136Xe, and 150Nd for both the light and heavy neutrino mass mechanisms using the deformed quasiparticle random-phase approximation approach with realistic forces. We give detailed decompositions of the nuclear matrix elements over different intermediate states and nucleon pairs, and discuss how these decompositions are affected by the model space truncations. Compared to the spherical calculations, our results show reductions from 30 % to about 60 % of the nuclear matrix elements for the calculated isotopes mainly due to the presence of the BCS overlap factor between the initial and final ground states. The comparison between different nucleon-nucleon (NN) forces with corresponding short-range correlations shows that the choice of the NN force gives roughly 20 % deviations for the light exchange neutrino mechanism and much larger deviations for the heavy neutrino exchange mechanism.
Palmer, Lance E; Dejori, Mathaeus; Bolanos, Randall; Fasulo, Daniel
2010-01-15
With the rapid expansion of DNA sequencing databases, it is now feasible to identify relevant information from prior sequencing projects and completed genomes and apply it to de novo sequencing of new organisms. As an example, this paper demonstrates how such extra information can be used to improve de novo assemblies by augmenting the overlapping step. Finding all pairs of overlapping reads is a key task in many genome assemblers, and to this end, highly efficient algorithms have been developed to find alignments in large collections of sequences. It is well known that due to repeated sequences, many aligned pairs of reads nevertheless do not overlap. But no overlapping algorithm to date takes a rigorous approach to separating aligned but non-overlapping read pairs from true overlaps. We present an approach that extends the Minimus assembler by a data driven step to classify overlaps as true or false prior to contig construction. We trained several different classification models within the Weka framework using various statistics derived from overlaps of reads available from prior sequencing projects. These statistics included percent mismatch and k-mer frequencies within the overlaps as well as a comparative genomics score derived from mapping reads to multiple reference genomes. We show that in real whole-genome sequencing data from the E. coli and S. aureus genomes, by providing a curated set of overlaps to the contigging phase of the assembler, we nearly doubled the median contig length (N50) without sacrificing coverage of the genome or increasing the number of mis-assemblies. Machine learning methods that use comparative and non-comparative features to classify overlaps as true or false can be used to improve the quality of a sequence assembly.
NASA Astrophysics Data System (ADS)
Shaker, Ahmed; Ossaimee, Mahmoud; Zekry, A.; Abouelatta, Mohamed
2015-10-01
In this paper, we have investigated the effect of gate overlapping-on-drain on the ambipolar behavior and high frequency performance of tunnel CNTFET (T-CNTFET). It is found that gate overlapping-on-drain suppresses the ambipolar behavior and improves OFF-state current. The simulation results show that there is an optimum choice for the overlapped length. On the other hand, this overlap deteriorates the high frequency performance. The high frequency figure of merit is analyzed in terms of the unit-gain cutoff frequency (fT). Further, we propose two different approaches to improve the high frequency performance of the overlapped T-CNTFET. The first one is based on inserting a high-dielectric constant material below the overlapped part of the gate and the second is based on depositing a different work function gate metal for the overlapped region. The two solutions show very good improvement in the high frequency performance with maintaining the suppression of the ambipolar characteristics.
Understanding COPD-overlap syndromes.
Poh, Tuang Yeow; Mac Aogáin, Micheál; Chan, Adrian Kwok Wai; Yii, Anthony Chau Ang; Yong, Valerie Fei Lee; Tiew, Pei Yee; Koh, Mariko Siyue; Chotirmall, Sanjay Haresh
2017-04-01
Chronic obstructive pulmonary disease accounts for a large burden of lung disease. It can 'overlap' with other respiratory diseases including bronchiectasis, fibrosis and obstructive sleep apnea (OSA). While COPD alone confers morbidity and mortality, common features with contrasting clinical outcomes can occur in COPD 'overlap syndromes'. Areas covered: Given the large degree of heterogeneity in COPD, individual variation to treatment is adopted based on its observed phenotype, which in turn overlaps with features of other respiratory disease states such as asthma. This is coined asthma-COPD overlap syndrome ('ACOS'). Other examples of such overlapping clinical states include bronchiectasis-COPD ('BCOS'), fibrosis-COPD ('FCOS') and OSA-COPD ('OCOS'). The objective of this review is to highlight similarities and differences between the COPD-overlap syndromes in terms of risk factors, pathophysiology, diagnosis and potential treatment differences. Expert commentary: As a consequence of COPD overlap syndromes, a transition from the traditional 'one size fits all' treatment approach is necessary. Greater treatment stratification according to clinical phenotype using a precision medicine approach is now required. In this light, it is important to recognize and differentiate COPD overlap syndromes as distinct disease states compared to individual diseases such as asthma, COPD, fibrosis or bronchiectasis.
Solving Partial Differential Equations on Overlapping Grids
DOE Office of Scientific and Technical Information (OSTI.GOV)
Henshaw, W D
2008-09-22
We discuss the solution of partial differential equations (PDEs) on overlapping grids. This is a powerful technique for efficiently solving problems in complex, possibly moving, geometry. An overlapping grid consists of a set of structured grids that overlap and cover the computational domain. By allowing the grids to overlap, grids for complex geometries can be more easily constructed. The overlapping grid approach can also be used to remove coordinate singularities by, for example, covering a sphere with two or more patches. We describe the application of the overlapping grid approach to a variety of different problems. These include the solutionmore » of incompressible fluid flows with moving and deforming geometry, the solution of high-speed compressible reactive flow with rigid bodies using adaptive mesh refinement (AMR), and the solution of the time-domain Maxwell's equations of electromagnetism.« less
Barr, Margo L; Ferguson, Raymond A; Steel, David G
2014-08-12
Since 1997, the NSW Population Health Survey (NSWPHS) had selected the sample using random digit dialing of landline telephone numbers. When the survey began coverage of the population by landline phone frames was high (96%). As landline coverage in Australia has declined and continues to do so, in 2012, a sample of mobile telephone numbers was added to the survey using an overlapping dual-frame design. Details of the methodology are published elsewhere. This paper discusses the impacts of the sampling frame change on the time series, and provides possible approaches to handling these impacts. Prevalence estimates were calculated for type of phone-use, and a range of health indicators. Prevalence ratios (PR) for each of the health indicators were also calculated using Poisson regression analysis with robust variance estimation by type of phone-use. Health estimates for 2012 were compared to 2011. The full time series was examined for selected health indicators. It was estimated from the 2012 NSWPHS that 20.0% of the NSW population were mobile-only phone users. Looking at the full time series for overweight or obese and current smoking if the NSWPHS had continued to be undertaken only using a landline frame, overweight or obese would have been shown to continue to increase and current smoking would have been shown to continue to decrease. However, with the introduction of the overlapping dual-frame design in 2012, overweight or obese increased until 2011 and then decreased in 2012, and current smoking decreased until 2011, and then increased in 2012. Our examination of these time series showed that the changes were a consequence of the sampling frame change and were not real changes. Both the backcasting method and the minimal coverage method could adequately adjust for the design change and allow for the continuation of the time series. The inclusion of the mobile telephone numbers, through an overlapping dual-frame design, did impact on the time series for some of the health indicators collected through the NSWPHS, but only in that it corrected the estimates that were being calculated from a sample frame that was progressively covering less of the population.
Investigating the performance of catalyst layer micro-structures with different platinum loadings
DOE Office of Scientific and Technical Information (OSTI.GOV)
Khakaz-Baboli, Moben; Harvey, David; Pharoah, Jon
In this study a four-phase micro-structure of a PEFC catalyst layer was reconstructed by randomly placing overlapping spheres for each solid catalyst phase. The micro-structure was mirrored to make a micro-structure. A body-fit computational mesh was produced for the reconstructed micro-structure in OpenFOAM. Associated conservation equations were solved within all the phases with electrochemical reaction as the boundary condition at the interface between ionomer and platinum phases. The study is focused on the platinum loading of CL. The polarization curves of the micro-structure performance have been compared for different platinum loadings. This paper gives increased insight into the relatively greatermore » losses at decreased platinum loadings.« less
Effect of Finite Computational Domain on Turbulence Scaling Law in Both Physical and Spectral Spaces
NASA Technical Reports Server (NTRS)
Hou, Thomas Y.; Wu, Xiao-Hui; Chen, Shiyi; Zhou, Ye
1998-01-01
The well-known translation between the power law of energy spectrum and that of the correlation function or the second order structure function has been widely used in analyzing random data. Here, we show that the translation is valid only in proper scaling regimes. The regimes of valid translation are different for the correlation function and the structure function. Indeed, they do not overlap. Furthermore, in practice, the power laws exist only for a finite range of scales. We show that this finite range makes the translation inexact even in the proper scaling regime. The error depends on the scaling exponent. The current findings are applicable to data analysis in fluid turbulence and other stochastic systems.
Impact basins in Southern Daedalia, Mars: Evidence for clustered impactors?
NASA Technical Reports Server (NTRS)
Frey, Herbert; Roark, James H.
1994-01-01
The distribution of ancient massifs and old cratered terrain in the southern Daedalia region indicate the presence of at least two and probably three impact basins of large size. One of these is located near where Craddock et al. placed their center for the Daedalia Basin, but it has very different ring diameters. These basins have rings exceeding 1000 km diameter and overlap significantly with centers separated by 500 to 600 km at nearly identical latitudes of -26 to -29 deg. The smaller westernmost basin appears slightly better preserved, but there is little evidence for obvious superposition that might imply a temporal sequence. Recognizing the improbability of random impacts producing aligned, nearly contemporaneous features, we suggest these basins may have resulted from clustered impactors.
NASA Astrophysics Data System (ADS)
Verma, Arjun; Privman, Vladimir
2018-02-01
We study approach to the large-time jammed state of the deposited particles in the model of random sequential adsorption. The convergence laws are usually derived from the argument of Pomeau which includes the assumption of the dominance, at large enough times, of small landing regions into each of which only a single particle can be deposited without overlapping earlier deposited particles and which, after a certain time are no longer created by depositions in larger gaps. The second assumption has been that the size distribution of gaps open for particle-center landing in this large-time small-gaps regime is finite in the limit of zero gap size. We report numerical Monte Carlo studies of a recently introduced model of random sequential adsorption on patterned one-dimensional substrates that suggest that the second assumption must be generalized. We argue that a region exists in the parameter space of the studied model in which the gap-size distribution in the Pomeau large-time regime actually linearly vanishes at zero gap sizes. In another region, the distribution develops a threshold property, i.e., there are no small gaps below a certain gap size. We discuss the implications of these findings for new asymptotic power-law and exponential-modified-by-a-power-law convergences to jamming in irreversible one-dimensional deposition.
Lisovskiĭ, A A; Pavlinov, I Ia
2008-01-01
Any morphospace is partitioned by the forms of group variation, its structure is described by a set of scalar (range, overlap) and vector (direction) characteristics. They are analyzed quantitatively for the sex and age variations in the sample of 200 skulls of the pine marten described by 14 measurable traits. Standard dispersion and variance components analyses are employed, accompanied with several resampling methods (randomization and bootstrep); effects of changes in the analysis design on results of the above methods are also considered. Maximum likelihood algorithm of variance components analysis is shown to give an adequate estimates of portions of particular forms of group variation within the overall disparity. It is quite stable in respect to changes of the analysis design and therefore could be used in the explorations of the real data with variously unbalanced designs. A new algorithm of estimation of co-directionality of particular forms of group variation within the overall disparity is elaborated, which includes angle measures between eigenvectors of covariation matrices of effects of group variations calculated by dispersion analysis. A null hypothesis of random portion of a given group variation could be tested by means of randomization of the respective grouping variable. A null hypothesis of equality of both portions and directionalities of different forms of group variation could be tested by means of the bootstrep procedure.
Chironomidae larvae (Diptera) of Neotropical floodplain: overlap niche in different habitats.
Butakka, C M M; Ragonha, F H; Takeda, A M
2014-05-01
The niche overlap between trophic groups of Chironomidae larvae in different habitats was observed between trophic groups and between different environments in Neotropical floodplain. For the evaluation we used the index of niche overlap (CXY) and analysis of trophic networks, both from the types and amount of food items identified in the larval alimentary canal. In all environments, the larvae fed on mainly organic matter such as plants fragments and algae, but there were many omnivore larvae. Species that have high values of food items occurred in diverse environments as generalists with great overlap niche and those with a low amount of food items with less overlap niche were classified as specialists. The largest number of trophic niche overlap was observed among collector-gatherers in connected floodplain lakes. The lower values of index niche overlap were predators. The similarity in the diet of different taxa in the same niche does not necessarily imply competition between them, but coexistence when the food resource is not scarce in the environment even in partially overlapping niches.
Self, D Mitchell; Ilyas, Adeel; Stetler, William R
2018-04-27
Overlapping surgery, a long-standing practice within academic neurosurgery centers nationwide, has recently come under scrutiny from the government and media as potentially harmful to patients. Therefore, the objective of this systematic review and meta-analysis is to determine the safety of overlapping neurosurgical procedures. The authors performed a systematic review and meta-analysis in accordance with PRISMA guidelines. A review of PubMed and Medline databases was undertaken with the search phrase "overlapping surgery AND neurosurgery AND outcomes." Data regarding patient demographics, type of neurosurgical procedure, and outcomes and complications were extracted from each study. The principle summary measure was odds ratio (OR) of the association of overlapping versus non-overlapping surgery with outcomes. The literature search yielded a total of 36 studies, of which 5 studies met inclusion criteria and were included in this study. These studies included a total of 25,764 patients undergoing neurosurgical procedures. Overlapping surgery was associated with an increased likelihood of being discharged home (OR = 1.32; 95% CI 1.20 to 1.44; P < 0.001) and a reduced 30-day unexpected return to the operating room (OR = 0.79; 95% CI 0.72 to 0.87; P < 0.001). Overlapping surgery did not significantly affect OR of length of surgery, 30-day mortality, or 30-day readmission. Overlapping neurosurgical procedures were not associated with worse patient outcomes. Additional, prospective studies are needed to further assess the safety overlapping procedures. Copyright © 2018. Published by Elsevier Inc.
Detection and Evaluation of Pre-Preg Gaps and Overlaps in Glare Laminates
NASA Astrophysics Data System (ADS)
Nardi, Davide; Abouhamzeh, Morteza; Leonard, Rob; Sinke, Jos
2018-03-01
Gaps and overlaps between pre-preg plies represent common flaws in composite materials that can be introduced easily in an automated fibre placement manufacturing process and are potentially detrimental for the mechanical performances of the final laminates. Whereas gaps and overlaps have been addressed for full composite material, the topic has not been extended to a hybrid composite material such as Glare, a member of the family of Fibre Metal Laminates (FMLs). In this paper/research, the manufacturing, the detection, and the optical evaluation of intraply gaps and overlaps in Glare laminates are investigated. As part of an initial assessment study on the effect of gaps and overlaps on Glare, only the most critical lay-up has been considered. The experimental investigation started with the manufacturing of specimens having gaps and overlaps with different widths, followed by a non-destructive ultrasonic-inspection. An optical evaluation of the gaps and overlaps was performed by means of microscope image analysis of the cross sections of the specimens. The results from the non-destructive evaluations show the effectiveness of the ultrasonic detection of gaps and overlaps both in position, shape, width, and severity. The optical inspections confirm the accuracy of the non-destructive evaluation also adding useful insights about the geometrical features due to the presence of gaps and overlaps in the final Glare laminates. All the results justify the need for a further investigation on the effect of gaps and overlaps on the mechanical properties.
Comparison of Patient Outcomes and Cost of Overlapping Versus Nonoverlapping Spine Surgery.
Zygourakis, Corinna C; Sizdahkhani, Saman; Keefe, Malla; Lee, Janelle; Chou, Dean; Mummaneni, Praveen V; Ames, Christopher P
2017-04-01
Overlapping surgery recently has gained significant media attention, but there are limited data on its safety and efficacy. To date, there has been no analysis of overlapping surgery in the field of spine. Our goal was to compare overlapping versus nonoverlapping spine surgery patient outcomes and cost. A retrospective review was undertaken of 2319 spine surgeries (n = 848 overlapping; 1471 nonoverlapping) performed by 3 neurosurgery attendings from 2012 to 2015 at the University of California San Francisco. Collected variables included patient age, sex, insurance, American Society of Anesthesiology score, severity of illness, risk of mortality, procedure type, surgeon, day of surgery, source of transfer, admission type, overlapping versus nonoverlapping surgery (≥1 minute of overlapping procedure time), Medicare-Severity Diagnosis-Related Group, osteotomy, and presence of another attending/fellow/resident. Univariate, then multivariate mixed-effect models were used to evaluate the effect of the collected variables on the following outcomes: procedure time, estimated blood loss, length of stay, discharge status, 30-day mortality, 30-day unplanned readmission, unplanned return to OR, and total hospital cost. Urgent spine cases were more likely to be done in an overlapping fashion (all P < 0.01). After we adjusted for patient demographics, clinical indicators, and procedure characteristics, overlapping surgeries had longer procedure times (estimate = 26.17; P < 0.001) and lower rates of discharge to home (odds ratio 0.65; P < 0.001), but equivalent rates of 30-day mortality, readmission, return to the operating room, estimated blood loss, length of stay, and total hospital cost (all P = ns). Overlapping spine surgery may be performed safely at our institution, although continued monitoring of patient outcomes is necessary. Overlapping surgery does not lead to greater hospital costs. Copyright © 2017 Elsevier Inc. All rights reserved.
Gellad, Walid F.; Zhao, Xinhua; Thorpe, Carolyn T.; Thorpe, Joshua M.; Sileanu, Florentina E.; Cashy, John P.; Mor, Maria; Hale, Jennifer A.; Radomski, Thomas; Hausmann, Leslie R. M.; Fine, Michael J.; Good, Chester B.
2016-01-01
Background Buprenorphine is a key tool in the management of opioid use disorder, but there are growing concerns about abuse, diversion and safety. These concerns are amplified for the Department of Veterans Affairs (VA), whose patients may receive care concurrently from multiple prescribers within and outside VA. To illustrate the extent of this challenge, we examined overlapping prescriptions for buprenorphine, opioids, and benzodiazepines among Veterans dually enrolled in VA and Medicare Part D. Methods We constructed a cohort of all Veterans dually enrolled in VA and Part D who filled an opioid prescription in 2012. We identified patients who received tablet or film buprenorphine products from either source. We calculated the proportion of buprenorphine recipients with any overlapping prescription (based on days supply) for a non-buprenorphine opioid or benzodiazepine, focusing on Veterans who received overlapping prescriptions from a different system than their buprenorphine prescription (Part D buprenorphine recipients receiving overlapping opioids or benzodiazepines from VA and vice versa). Results We identified 1,790 dually enrolled Veterans with buprenorphine prescriptions, including 760 (43%) from VA and 1,091 (61%) from Part D (61 Veterans with buprenorphine from both systems were included in each group). Among VA buprenorphine recipients, 199 (26%) received an overlapping opioid prescription and 11 (1%) received an overlapping benzodiazepine prescription from Part D. Among Part D buprenorphine recipients, 208 (19%) received an overlapping opioid prescription and 178 (16%) received an overlapping benzodiazepine prescription from VA. Among VA and Part D buprenorphine recipients with cross-system opioid overlap, 25% (49/199) and 35% (72/208), respectively, had >90 days of overlap. Conclusions Many buprenorphine recipients receive overlapping prescriptions for opioids and benzodiazepines from a different health care system than the one in which their buprenorphine was filled. These findings highlight a previously undocumented safety risk for Veterans dually enrolled in VA and Medicare. PMID:27925868
Gellad, Walid F; Zhao, Xinhua; Thorpe, Carolyn T; Thorpe, Joshua M; Sileanu, Florentina E; Cashy, John P; Mor, Maria; Hale, Jennifer A; Radomski, Thomas; Hausmann, Leslie R M; Fine, Michael J; Good, Chester B
2017-01-01
Buprenorphine is a key tool in the management of opioid use disorder, but there are growing concerns about abuse, diversion, and safety. These concerns are amplified for the Department of Veterans Affairs (VA), whose patients may receive care concurrently from multiple prescribers within and outside VA. To illustrate the extent of this challenge, we examined overlapping prescriptions for buprenorphine, opioids, and benzodiazepines among veterans dually enrolled in VA and Medicare Part D. We constructed a cohort of all veterans dually enrolled in VA and Part D who filled an opioid prescription in 2012. We identified patients who received tablet or film buprenorphine products from either source. We calculated the proportion of buprenorphine recipients with any overlapping prescription (based on days supply) for a nonbuprenorphine opioid or benzodiazepine, focusing on veterans who received overlapping prescriptions from a different system than their buprenorphine prescription (Part D buprenorphine recipients receiving overlapping opioids or benzodiazepines from VA and vice versa). There were 1790 dually enrolled veterans with buprenorphine prescriptions, including 760 (43%) from VA and 1091 (61%) from Part D (61 veterans with buprenorphine from both systems were included in each group). Among VA buprenorphine recipients, 199 (26%) received an overlapping opioid prescription and 11 (1%) received an overlapping benzodiazepine prescription from Part D. Among Part D buprenorphine recipients, 208 (19%) received an overlapping opioid prescription and 178 (16%) received an overlapping benzodiazepine prescription from VA. Among VA and Part D buprenorphine recipients with cross-system opioid overlap, 25% (49/199) and 35% (72/208), respectively, had >90 days of overlap. Many buprenorphine recipients receive overlapping prescriptions for opioids and benzodiazepines from a different health care system than the one in which their buprenorphine was filled. These findings highlight a previously undocumented safety risk for veterans dually enrolled in VA and Medicare.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Zhang, J; Natwa, M; Hall, NC
Purpose: The longer patient has to remain on the table during PET imaging, the higher the likelihood of motion artifacts due to patient discomfort. This study was to investigate and optimize PET acquisition overlap in 18F-FDG oncology wholebody PET/CT to speed up PET acquisition and improve patient comfort. Methods: Wholebody 18F-FDG PET/CT of phantoms, 8 pre-clinical patients (beagles) and 5 clinical oncology patients were performed in 90s/bed on a time-of-flight Gemini TF 64 system. Imaging of phantoms and beagles was acquired with reduced PET overlaps (40%, 33%, 27%, 20%, 13% and no overlap) in addition to the system default (53%).more » In human studies, 1 or 2 reduced overlaps from the listed options were used to acquire PET/CT sweeps right after the default standard of care imaging. Image quality was blindly reviewed using visual scoring criteria and quantitative SUV assessment. NEMA PET sensitivity was performed under different overlaps. Results: All PET exams demonstrated no significant impact on the visual grades for overlaps >20%. Blinded reviews assigned the best visual scores to PET using overlaps 53%–27%. Reducing overlap to 27% for oncology patients (12-bed) saved an average of ∼40% acquisition time (11min) compared to using the default overlap (18min). No significant SUV variances were found when reducing overlap to half of default for cerebellum, lung, heart, aorta, liver, fat, muscle, bone marrow, thighs and target lesions (p>0.05), except expected variability in urinary system. Conclusion: This study demonstrated by combined phantom, pre-clinical and clinical PET/CT scans that PET acquisition overlap in axial of today’s systems can be reduced and optimized. It showed that a reduction of PET acquisition overlap to 27% (half of system default) can be implemented to reduce table time by ∼40% to improve patient comfort and minimize potential motion artifacts, without prominently degrading image quality or compromising PET quantification.« less
An extension to artifact-free projection overlaps
DOE Office of Scientific and Technical Information (OSTI.GOV)
Lin, Jianyu, E-mail: jianyulin@hotmail.com
2015-05-15
Purpose: In multipinhole single photon emission computed tomography, the overlapping of projections has been used to increase sensitivity. Avoiding artifacts in the reconstructed image associated with projection overlaps (multiplexing) is a critical issue. In our previous report, two types of artifact-free projection overlaps, i.e., projection overlaps that do not lead to artifacts in the reconstructed image, were formally defined and proved, and were validated via simulations. In this work, a new proposition is introduced to extend the previously defined type-II artifact-free projection overlaps so that a broader range of artifact-free overlaps is accommodated. One practical purpose of the new extensionmore » is to design a baffle window multipinhole system with artifact-free projection overlaps. Methods: First, the extended type-II artifact-free overlap was theoretically defined and proved. The new proposition accommodates the situation where the extended type-II artifact-free projection overlaps can be produced with incorrectly reconstructed portions in the reconstructed image. Next, to validate the theory, the extended-type-II artifact-free overlaps were employed in designing the multiplexing multipinhole spiral orbit imaging systems with a baffle window. Numerical validations were performed via simulations, where the corresponding 1-pinhole nonmultiplexing reconstruction results were used as the benchmark for artifact-free reconstructions. The mean square error (MSE) was the metric used for comparisons of noise-free reconstructed images. Noisy reconstructions were also performed as part of the validations. Results: Simulation results show that for noise-free reconstructions, the MSEs of the reconstructed images of the artifact-free multiplexing systems are very similar to those of the corresponding 1-pinhole systems. No artifacts were observed in the reconstructed images. Therefore, the testing results for artifact-free multiplexing systems designed using the extended type-II artifact-free overlaps numerically validated the developed theory. Conclusions: First, the extension itself is of theoretical importance because it broadens the selection range for optimizing multiplexing multipinhole designs. Second, the extension has an immediate application: using a baffle window to design a special spiral orbit multipinhole imaging system with projection overlaps in the orbit axial direction. Such an artifact-free baffle window design makes it possible for us to image any axial portion of interest of a long object with projection overlaps to increase sensitivity.« less
Mihalov-Kovács, Eszter; Martella, Vito; Lanave, Gianvito; Bodnar, Livia; Fehér, Enikő; Marton, Szilvia; Kemenesi, Gábor; Jakab, Ferenc; Bányai, Krisztián
2017-03-15
Canine astrovirus RNA was detected in the stools of 17/63 (26.9%) samples, using either a broadly reactive consensus RT-PCR for astroviruses or random RT-PCR coupled with massive deep sequencing. The complete or nearly complete genome sequence of five canine astroviruses was reconstructed that allowed mapping the genome organization and to investigate the genetic diversity of these viruses. The genome was about 6.6kb in length and contained three open reading frames (ORFs) flanked by a 5' UTR, and a 3' UTR plus a poly-A tail. ORF1a and ORF1b overlapped by 43 nucleotides while the ORF2 overlapped by 8 nucleotides with the 3' end of ORF1b. Upon genome comparison, four strains (HUN/2012/2, HUN/2012/6, HUN/2012/115, and HUN/2012/135) were more related genetically to each other and to UK canine astroviruses (88-96% nt identity), whilst strain HUN/2012/126 was more divergent (75-76% nt identity). In the ORF1b and ORF2, strains HUN/2012/2, HUN/2012/6, and HUN/2012/135 were related genetically to other canine astroviruses identified formerly in Europe and China, whereas strain HUN/2012/126 was related genetically to a divergent canine astrovirus strain, ITA/2010/Zoid. For one canine astrovirus, HUN/2012/8, only a 3.2kb portion of the genome, at the 3' end, could be determined. Interestingly, this strain possessed unique genetic signatures (including a longer ORF1b/ORF2 overlap and a longer 3'UTR) and it was divergent in both ORF1b and ORF2 from all other canine astroviruses, with the highest nucleotide sequence identity (68% and 63%, respectively) to a mink astrovirus, thus suggesting a possible event of interspecies transmission. The genetic heterogeneity of canine astroviruses may pose a challenge for the diagnostics and for future prophylaxis strategies. Copyright © 2016 Elsevier B.V. All rights reserved.
Manson, Robert H.; Ricketts, Taylor H.; Geissert, Daniel
2018-01-01
Payment for hydrological services (PHS) are popular tools for conserving ecosystems and their water-related services. However, improving the spatial targeting and impacts of PHS, as well as their ability to foster synergies with other ecosystem services (ES), remain challenging. We aimed at using spatial analyses to evaluate the targeting performance of México’s National PHS program in central Veracruz. We quantified the effectiveness of areas targeted for PHS in actually covering areas of high HS provision and social priority during 2003–2013. First, we quantified provisioning and spatial distributions of two target (water yield and soil retention), and one non-target ES (carbon storage) using InVEST. Subsequently, pairwise relationships among ES were quantified by using spatial correlation and overlap analyses. Finally, we evaluated targeting by: (i) prioritizing areas of individual and overlapping ES; (ii) quantifying spatial co-occurrences of these priority areas with those targeted by PHS; (iii) evaluating the extent to which PHS directly contribute to HS delivery; and (iv), testing if PHS targeted areas disproportionately covered areas with high ecological and social priority. We found that modelled priority areas exhibited non-random distributions and distinct spatial patterns. Our results show significant pairwise correlations between all ES suggesting synergistic relationships. However, our analysis showed a significantly lower overlap than expected and thus significant mismatches between PHS targeted areas and all types of priority areas. These findings suggest that the targeting of areas with high HS provisioning and social priority by Mexico’s PHS program could be improved significantly. This study underscores: (1) the importance of using maps of HS provisioning as main targeting criteria in PHS design to channel payments towards areas that require future conservation, and (2) the need for future research that helps balance ecological and socioeconomic targeting criteria. PMID:29462205
Atlas ranking and selection for automatic segmentation of the esophagus from CT scans
NASA Astrophysics Data System (ADS)
Yang, Jinzhong; Haas, Benjamin; Fang, Raymond; Beadle, Beth M.; Garden, Adam S.; Liao, Zhongxing; Zhang, Lifei; Balter, Peter; Court, Laurence
2017-12-01
In radiation treatment planning, the esophagus is an important organ-at-risk that should be spared in patients with head and neck cancer or thoracic cancer who undergo intensity-modulated radiation therapy. However, automatic segmentation of the esophagus from CT scans is extremely challenging because of the structure’s inconsistent intensity, low contrast against the surrounding tissues, complex and variable shape and location, and random air bubbles. The goal of this study is to develop an online atlas selection approach to choose a subset of optimal atlases for multi-atlas segmentation to the delineate esophagus automatically. We performed atlas selection in two phases. In the first phase, we used the correlation coefficient of the image content in a cubic region between each atlas and the new image to evaluate their similarity and to rank the atlases in an atlas pool. A subset of atlases based on this ranking was selected, and deformable image registration was performed to generate deformed contours and deformed images in the new image space. In the second phase of atlas selection, we used Kullback-Leibler divergence to measure the similarity of local-intensity histograms between the new image and each of the deformed images, and the measurements were used to rank the previously selected atlases. Deformed contours were overlapped sequentially, from the most to the least similar, and the overlap ratio was examined. We further identified a subset of optimal atlases by analyzing the variation of the overlap ratio versus the number of atlases. The deformed contours from these optimal atlases were fused together using a modified simultaneous truth and performance level estimation algorithm to produce the final segmentation. The approach was validated with promising results using both internal data sets (21 head and neck cancer patients and 15 thoracic cancer patients) and external data sets (30 thoracic patients).
Lin, Jin-Hung; Cheng, Shou-Hsia
2018-08-01
Taiwan's single health insurer introduced a medication record exchange platform, the PharmaCloud program, in 2013. This study aimed to evaluate the effects of the medication record inquiry rate on medication duplication among patients with diabetes. A retrospective pre-post design with a comparison group was conducted using nationwide health insurance claim data of diabetic patients from 2013 to 2014. Patients whose medication record inquiry rate fell within the upper 25th percentile were classified as the high-inquiry group, and the others as the low-inquiry group. The dependent variables were the likelihood of receiving duplicated medication and the overlapped medication days of the study subjects. Generalized estimation equations with difference-in-difference analysis were calculated to examine the net effect of the PharmaCloud inquiry rate for a matched sub-sample. In total, 106,508 patients with diabetes were randomly selected. From 2013 to 2014, the medication duplication rate was reduced 7.76 percentile (54.12%-46.36%) for the high-inquiry group and 9.58 percentile (63.72%-54.14%) for the low-inquiry group; the average medication overlap periods were shortened 4.36 days (8.49-4.13) and 6.29 days (11.28-4.99), respectively. The regression models showed patients in the high-inquiry group were more likely to receive duplicated medication (OR = 1.11, 95% C.I. = 1.07-1.16) and with longer overlapped days (7.53%, P = 0.0081) after the program. The medication record sharing program has reduced medication duplication among diabetes patients. However, higher inquiry rate did not lead to greater reduction in medication duplication; the overall effect might be due to enhanced internal control via prescription alert system in hospitals rather physician's review of the records. Copyright © 2018 Elsevier B.V. All rights reserved.
9 CFR 121.4 - Overlap select agents and toxins.
Code of Federal Regulations, 2012 CFR
2012-01-01
... select agent or toxin to APHIS or CDC. (i) The seizure of any of the following overlap select agents and.... This report must be followed by submission of APHIS/CDC Form 4 within 7 calendar days after seizure of the overlap select agent or toxin. (ii) For all other overlap select agents or toxins, APHIS/CDC Form...
50 CFR 229.32 - Atlantic large whale take reduction plan regulations.
Code of Federal Regulations, 2010 CFR
2010-10-01
... South Channel Restricted Trap/Pot Area where it overlaps with Lobster Management Area (LMA) 2 and the... Trap/Pot Area overlaps with Lobster Management Area (LMA) 2 and the Outer Cape LMA (as defined in the... Offshore Management Area 3 (including the area known as the Area 2/3 Overlap and Area 3/5 Overlap as...
Archer, Charles J.; Inglett, Todd A.; Ratterman, Joseph D.; Smith, Brian E.
2010-03-02
Methods, apparatus, and products are disclosed for configuring compute nodes of a parallel computer in an operational group into a plurality of independent non-overlapping collective networks, the compute nodes in the operational group connected together for data communications through a global combining network, that include: partitioning the compute nodes in the operational group into a plurality of non-overlapping subgroups; designating one compute node from each of the non-overlapping subgroups as a master node; and assigning, to the compute nodes in each of the non-overlapping subgroups, class routing instructions that organize the compute nodes in that non-overlapping subgroup as a collective network such that the master node is a physical root.
A Bayesian bird's eye view of ‘Replications of important results in social psychology’
Schönbrodt, Felix D.; Yao, Yuling; Gelman, Andrew; Wagenmakers, Eric-Jan
2017-01-01
We applied three Bayesian methods to reanalyse the preregistered contributions to the Social Psychology special issue ‘Replications of Important Results in Social Psychology’ (Nosek & Lakens. 2014 Registered reports: a method to increase the credibility of published results. Soc. Psychol. 45, 137–141. (doi:10.1027/1864-9335/a000192)). First, individual-experiment Bayesian parameter estimation revealed that for directed effect size measures, only three out of 44 central 95% credible intervals did not overlap with zero and fell in the expected direction. For undirected effect size measures, only four out of 59 credible intervals contained values greater than 0.10 (10% of variance explained) and only 19 intervals contained values larger than 0.05. Second, a Bayesian random-effects meta-analysis for all 38 t-tests showed that only one out of the 38 hierarchically estimated credible intervals did not overlap with zero and fell in the expected direction. Third, a Bayes factor hypothesis test was used to quantify the evidence for the null hypothesis against a default one-sided alternative. Only seven out of 60 Bayes factors indicated non-anecdotal support in favour of the alternative hypothesis (BF10>3), whereas 51 Bayes factors indicated at least some support for the null hypothesis. We hope that future analyses of replication success will embrace a more inclusive statistical approach by adopting a wider range of complementary techniques. PMID:28280547
Han, Hyemin; Glenn, Andrea L
2018-06-01
In fMRI research, the goal of correcting for multiple comparisons is to identify areas of activity that reflect true effects, and thus would be expected to replicate in future studies. Finding an appropriate balance between trying to minimize false positives (Type I error) while not being too stringent and omitting true effects (Type II error) can be challenging. Furthermore, the advantages and disadvantages of these types of errors may differ for different areas of study. In many areas of social neuroscience that involve complex processes and considerable individual differences, such as the study of moral judgment, effects are typically smaller and statistical power weaker, leading to the suggestion that less stringent corrections that allow for more sensitivity may be beneficial and also result in more false positives. Using moral judgment fMRI data, we evaluated four commonly used methods for multiple comparison correction implemented in Statistical Parametric Mapping 12 by examining which method produced the most precise overlap with results from a meta-analysis of relevant studies and with results from nonparametric permutation analyses. We found that voxelwise thresholding with familywise error correction based on Random Field Theory provides a more precise overlap (i.e., without omitting too few regions or encompassing too many additional regions) than either clusterwise thresholding, Bonferroni correction, or false discovery rate correction methods.
Automatic detection of regions of interest in mammographic images
NASA Astrophysics Data System (ADS)
Cheng, Erkang; Ling, Haibin; Bakic, Predrag R.; Maidment, Andrew D. A.; Megalooikonomou, Vasileios
2011-03-01
This work is a part of our ongoing study aimed at comparing the topology of anatomical branching structures with the underlying image texture. Detection of regions of interest (ROIs) in clinical breast images serves as the first step in development of an automated system for image analysis and breast cancer diagnosis. In this paper, we have investigated machine learning approaches for the task of identifying ROIs with visible breast ductal trees in a given galactographic image. Specifically, we have developed boosting based framework using the AdaBoost algorithm in combination with Haar wavelet features for the ROI detection. Twenty-eight clinical galactograms with expert annotated ROIs were used for training. Positive samples were generated by resampling near the annotated ROIs, and negative samples were generated randomly by image decomposition. Each detected ROI candidate was given a confidences core. Candidate ROIs with spatial overlap were merged and their confidence scores combined. We have compared three strategies for elimination of false positives. The strategies differed in their approach to combining confidence scores by summation, averaging, or selecting the maximum score.. The strategies were compared based upon the spatial overlap with annotated ROIs. Using a 4-fold cross-validation with the annotated clinical galactographic images, the summation strategy showed the best performance with 75% detection rate. When combining the top two candidates, the selection of maximum score showed the best performance with 96% detection rate.
NASA Astrophysics Data System (ADS)
Fyodorov, Yan V.
2018-06-01
We suggest a method of studying the joint probability density (JPD) of an eigenvalue and the associated `non-orthogonality overlap factor' (also known as the `eigenvalue condition number') of the left and right eigenvectors for non-selfadjoint Gaussian random matrices of size {N× N} . First we derive the general finite N expression for the JPD of a real eigenvalue {λ} and the associated non-orthogonality factor in the real Ginibre ensemble, and then analyze its `bulk' and `edge' scaling limits. The ensuing distribution is maximally heavy-tailed, so that all integer moments beyond normalization are divergent. A similar calculation for a complex eigenvalue z and the associated non-orthogonality factor in the complex Ginibre ensemble is presented as well and yields a distribution with the finite first moment. Its `bulk' scaling limit yields a distribution whose first moment reproduces the well-known result of Chalker and Mehlig (Phys Rev Lett 81(16):3367-3370, 1998), and we provide the `edge' scaling distribution for this case as well. Our method involves evaluating the ensemble average of products and ratios of integer and half-integer powers of characteristic polynomials for Ginibre matrices, which we perform in the framework of a supersymmetry approach. Our paper complements recent studies by Bourgade and Dubach (The distribution of overlaps between eigenvectors of Ginibre matrices, 2018. arXiv:1801.01219).
Saba, Reuben; Medina, Sarah J; Booth, Stephanie A
2014-10-01
The involvement of SNPs in miRNA target sites remains poorly investigated in neurodegenerative disease. In addition to associations with disease risk, such genetic variations can also provide novel insight into mechanistic pathways that may be responsible for disease etiology and/or pathobiology. To identify SNPs associated specifically with degenerating neurons, we restricted our analysis to genes that are dysregulated in CA1 hippocampal neurons of mice during early, preclinical phase of Prion disease. The 125 genes chosen are also implicated in other numerous degenerative and neurological diseases and disorders and are therefore likely to be of fundamental importance. We predicted those SNPs that could increase, decrease, or have neutral effects on miRNA binding. This group of genes was more likely to possess DNA variants than were genes chosen at random. Furthermore, many of the SNPs are common within the human population, and could contribute to the growing awareness that miRNAs and associated SNPs could account for detrimental neurological states. Interestingly, SNPs that overlapped miRNA-binding sites in the 3'-UTR of GABA-receptor subunit coding genes were particularly enriched. Moreover, we demonstrated that SNP rs9291296 would strengthen miR-26a-5p binding to a highly conserved site in the 3'-UTR of gamma-aminobutyric acid receptor subunit alpha-4. © 2014 WILEY PERIODICALS, INC.
Moritz, Craig C; Pratt, Renae C; Bank, Sarah; Bourke, Gayleen; Bragg, Jason G; Doughty, Paul; Keogh, J Scott; Laver, Rebecca J; Potter, Sally; Teasdale, Luisa C; Tedeschi, Leonardo G; Oliver, Paul M
2018-01-01
Understanding the joint evolutionary and ecological underpinnings of sympatry among close relatives remains a key challenge in biology. This problem can be addressed through joint phylogenomic and phenotypic analysis of complexes of closely related lineages within, and across, species and hence representing the speciation continuum. For a complex of tropical geckos from northern Australia-Gehyra nana and close relatives-we combine mtDNA phylogeography, exon-capture sequencing, and morphological data to resolve independently evolving lineages and infer their divergence history and patterns of morphological evolution. Gehyra nana is found to include nine divergent lineages and is paraphyletic with four other species from the Kimberley region of north-west Australia. Across these 13 taxa, 12 of which are restricted to rocky habitats, several lineages overlap geographically, including on the diverse Kimberley islands. Morphological evolution is dominated by body size shifts, and both body size and shape have evolved gradually across the group. However, larger body size shifts are observed among overlapping taxa than among closely related parapatric lineages of G. nana, and sympatric lineages are more divergent than expected at random. Whether elevated body size differences among sympatric lineages are due to ecological sorting or character displacement remains to be determined. © 2017 The Author(s). Evolution © 2017 The Society for the Study of Evolution.
A comparison of OCO-2 XCO2 Observations to GOSAT and Models
NASA Astrophysics Data System (ADS)
O'Dell, C.; Eldering, A.; Crisp, D.; Gunson, M. R.; Fisher, B.; Mandrake, L.; McDuffie, J. L.; Baker, D. F.; Wennberg, P. O.
2016-12-01
With their high spatial resolution and dense sampling density, observations of atmospheric carbon dioxide (CO2) from space-based sensors such as the Orbiting Carbon Observatory-2 (OCO-2) have the potential to revolutionize our understanding of carbon sources and sinks. To achieve this goal, however, requires the observations to have sub-ppm systematic errors; the large data density of OCO-2 generally reduces the importance of random errors in the retrieval of of regional scale fluxes. In this work, the Atmospheric Carbon Observations from Space (ACOS) algorithm has been applied to both OCO-2 and GOSAT observations, which overlap for the period spanning Sept 2014 to present (2+ years). Previous activities utilizing TCCON and aircraft data have shown the ACOS/GOSAT B3.5 product to be quite accurate (1-2 ppm) over both land and ocean. In this work, we apply nearly identical versions of the ACOS retrieval algorithm to both OCO-2 and GOSAT to enable comparisons during the period of overlap, and to minimize algorithm-induced differences. GOSAT/OCO-2 comparisons are used to explore potential biases in the OCO-2 data, and to better understand the nature of the bias correction required for each product. Finally, each product is compared to an ensemble of models in order to evaluate their relative consistency, a critical activity before both can be used simultaneously in carbon flux inversions with confidence.
On testing for spatial correspondence between maps of human brain structure and function.
Alexander-Bloch, Aaron F; Shou, Haochang; Liu, Siyuan; Satterthwaite, Theodore D; Glahn, David C; Shinohara, Russell T; Vandekar, Simon N; Raznahan, Armin
2018-06-01
A critical issue in many neuroimaging studies is the comparison between brain maps. Nonetheless, it remains unclear how one should test hypotheses focused on the overlap or spatial correspondence between two or more brain maps. This "correspondence problem" affects, for example, the interpretation of comparisons between task-based patterns of functional activation, resting-state networks or modules, and neuroanatomical landmarks. To date, this problem has been addressed with remarkable variability in terms of methodological approaches and statistical rigor. In this paper, we address the correspondence problem using a spatial permutation framework to generate null models of overlap by applying random rotations to spherical representations of the cortical surface, an approach for which we also provide a theoretical statistical foundation. We use this method to derive clusters of cognitive functions that are correlated in terms of their functional neuroatomical substrates. In addition, using publicly available data, we formally demonstrate the correspondence between maps of task-based functional activity, resting-state fMRI networks and gyral-based anatomical landmarks. We provide open-access code to implement the methods presented for two commonly-used tools for surface based cortical analysis (https://www.github.com/spin-test). This spatial permutation approach constitutes a useful advance over widely-used methods for the comparison of cortical maps, thereby opening new possibilities for the integration of diverse neuroimaging data. Copyright © 2018 Elsevier Inc. All rights reserved.
Liu, Feiling; Guo, Dianhao; Yuan, Zhuting; Chen, Chen; Xiao, Huamei
2017-11-20
Long non-coding RNA (lncRNA) is a class of noncoding RNA >200 bp in length that has essential roles in regulating a variety of biological processes. Here, we constructed a computational pipeline to identify lncRNA genes in the diamondback moth (Plutella xylostella), a major insect pest of cruciferous vegetables. In total, 3,324 lncRNAs corresponding to 2,475 loci were identified from 13 RNA-Seq datasets, including samples from parasitized, insecticide-resistant strains and different developmental stages. The identified P. xylostella lncRNAs had shorter transcripts and fewer exons than protein-coding genes. Seven out of nine randomly selected lncRNAs were validated by strand-specific RT-PCR. In total, 54-172 lncRNAs were specifically expressed in the insecticide resistant strains, among which one lncRNA was located adjacent to the sodium channel gene. In addition, 63-135 lncRNAs were specifically expressed in different developmental stages, among which three lncRNAs overlapped or were located adjacent to the metamorphosis-associated genes. These lncRNAs were either strongly or weakly co-expressed with their overlapping or neighboring mRNA genes. In summary, we identified thousands of lncRNAs and presented evidence that lncRNAs might have key roles in conferring insecticide resistance and regulating the metamorphosis development in P. xylostella.
Cortical Components of Reaction-Time during Perceptual Decisions in Humans.
Dmochowski, Jacek P; Norcia, Anthony M
2015-01-01
The mechanisms of perceptual decision-making are frequently studied through measurements of reaction time (RT). Classical sequential-sampling models (SSMs) of decision-making posit RT as the sum of non-overlapping sensory, evidence accumulation, and motor delays. In contrast, recent empirical evidence hints at a continuous-flow paradigm in which multiple motor plans evolve concurrently with the accumulation of sensory evidence. Here we employ a trial-to-trial reliability-based component analysis of encephalographic data acquired during a random-dot motion task to directly image continuous flow in the human brain. We identify three topographically distinct neural sources whose dynamics exhibit contemporaneous ramping to time-of-response, with the rate and duration of ramping discriminating fast and slow responses. Only one of these sources, a parietal component, exhibits dependence on strength-of-evidence. The remaining two components possess topographies consistent with origins in the motor system, and their covariation with RT overlaps in time with the evidence accumulation process. After fitting the behavioral data to a popular SSM, we find that the model decision variable is more closely matched to the combined activity of the three components than to their individual activity. Our results emphasize the role of motor variability in shaping RT distributions on perceptual decision tasks, suggesting that physiologically plausible computational accounts of perceptual decision-making must model the concurrent nature of evidence accumulation and motor planning.
Novel Discrete Element Method for 3D non-spherical granular particles.
NASA Astrophysics Data System (ADS)
Seelen, Luuk; Padding, Johan; Kuipers, Hans
2015-11-01
Granular materials are common in many industries and nature. The different properties from solid behavior to fluid like behavior are well known but less well understood. The main aim of our work is to develop a discrete element method (DEM) to simulate non-spherical granular particles. The non-spherical shape of particles is important, as it controls the behavior of the granular materials in many situations, such as static systems of packed particles. In such systems the packing fraction is determined by the particle shape. We developed a novel 3D discrete element method that simulates the particle-particle interactions for a wide variety of shapes. The model can simulate quadratic shapes such as spheres, ellipsoids, cylinders. More importantly, any convex polyhedron can be used as a granular particle shape. These polyhedrons are very well suited to represent non-rounded sand particles. The main difficulty of any non-spherical DEM is the determination of particle-particle overlap. Our model uses two iterative geometric algorithms to determine the overlap. The algorithms are robust and can also determine multiple contact points which can occur for these shapes. With this method we are able to study different applications such as the discharging of a hopper or silo. Another application the creation of a random close packing, to determine the solid volume fraction as a function of the particle shape.
Predicting rates of inbreeding in populations undergoing selection.
Woolliams, J A; Bijma, P
2000-01-01
Tractable forms of predicting rates of inbreeding (DeltaF) in selected populations with general indices, nonrandom mating, and overlapping generations were developed, with the principal results assuming a period of equilibrium in the selection process. An existing theorem concerning the relationship between squared long-term genetic contributions and rates of inbreeding was extended to nonrandom mating and to overlapping generations. DeltaF was shown to be approximately (1)/(4)(1 - omega) times the expected sum of squared lifetime contributions, where omega is the deviation from Hardy-Weinberg proportions. This relationship cannot be used for prediction since it is based upon observed quantities. Therefore, the relationship was further developed to express DeltaF in terms of expected long-term contributions that are conditional on a set of selective advantages that relate the selection processes in two consecutive generations and are predictable quantities. With random mating, if selected family sizes are assumed to be independent Poisson variables then the expected long-term contribution could be substituted for the observed, providing (1)/(4) (since omega = 0) was increased to (1)/(2). Established theory was used to provide a correction term to account for deviations from the Poisson assumptions. The equations were successfully applied, using simple linear models, to the problem of predicting DeltaF with sib indices in discrete generations since previously published solutions had proved complex. PMID:10747074
Ross, Robert S.; LoPresti, Matthew L.; Schon, Karin; Stern, Chantal E.
2013-01-01
Human social interactions are complex behaviors requiring the concerted effort of multiple neural systems to track and monitor the individuals around us. Cognitively, adjusting our behavior based on changing social cues such as facial expressions relies on working memory and the ability to disambiguate, or separate, representations of overlapping stimuli resulting from viewing the same individual with different facial expressions. We conducted an fMRI experiment examining brain regions contributing to the encoding, maintenance and retrieval of overlapping identity information during working memory using a delayed match-to-sample (DMS) task. In the overlapping condition, two faces from the same individual with different facial expressions were presented at sample. In the non-overlapping condition, the two sample faces were from two different individuals with different expressions. fMRI activity was assessed by contrasting the overlapping and non-overlapping condition at sample, delay, and test. The lateral orbitofrontal cortex showed increased fMRI signal in the overlapping condition in all three phases of the DMS task and increased functional connectivity with the hippocampus when encoding overlapping stimuli. The hippocampus showed increased fMRI signal at test. These data suggest lateral orbitofrontal cortex helps encode and maintain representations of overlapping stimuli in working memory while the orbitofrontal cortex and hippocampus contribute to the successful retrieval of overlapping stimuli. We suggest the lateral orbitofrontal cortex and hippocampus play a role in encoding, maintaining, and retrieving social cues, especially when multiple interactions with an individual need to be disambiguated in a rapidly changing social context in order to make appropriate social responses. PMID:23640112
Yoon, Young Jun; Eun, Hye Rim; Seo, Jae Hwa; Kang, Hee-Sung; Lee, Seong Min; Lee, Jeongmin; Cho, Seongjae; Tae, Heung-Sik; Lee, Jung-Hee; Kang, In Man
2015-10-01
We have investigated and proposed a highly scaled tunneling field-effect transistor (TFET) based on Ge/GaAs heterojunction with a drain overlap to suppress drain-induced barrier thinning (DIBT) and improve low-power (LP) performance. The highly scaled TFET with a drain overlap achieves lower leakage tunneling current because of the decrease in tunneling events between the source and drain, whereas a typical short-channel TFET suffers from a great deal of tunneling leakage current due to the DIBT at the off-state. However, the drain overlap inevitably increases the gate-to-drain capacitance (Cgd) because of the increase in the overlap capacitance (Cov) and inversion capacitance (Cinv). Thus, in this work, a dual-metal gate structure is additionally applied along with the drain overlap. The current performance and the total gate capacitance (Cgg) of the device with a dual-metal gate can be possibly controlled by adjusting the metal gate workfunction (φgate) and φoverlap-gate in the overlapping regions. As a result, the intrinsic delay time (τ) is greatly reduced by obtaining lower Cgg divided by the on-state current (Ion), i.e., Cgg/Ion. We have successfully demonstrated excellent LP and high-speed performance of a highly scaled TFET by adopting both drain overlap and dual-metal gate with DIBT minimization.
Overlapping clusters for distributed computation.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Mirrokni, Vahab; Andersen, Reid; Gleich, David F.
2010-11-01
Scalable, distributed algorithms must address communication problems. We investigate overlapping clusters, or vertex partitions that intersect, for graph computations. This setup stores more of the graph than required but then affords the ease of implementation of vertex partitioned algorithms. Our hope is that this technique allows us to reduce communication in a computation on a distributed graph. The motivation above draws on recent work in communication avoiding algorithms. Mohiyuddin et al. (SC09) design a matrix-powers kernel that gives rise to an overlapping partition. Fritzsche et al. (CSC2009) develop an overlapping clustering for a Schwarz method. Both techniques extend an initialmore » partitioning with overlap. Our procedure generates overlap directly. Indeed, Schwarz methods are commonly used to capitalize on overlap. Elsewhere, overlapping communities (Ahn et al, Nature 2009; Mishra et al. WAW2007) are now a popular model of structure in social networks. These have long been studied in statistics (Cole and Wishart, CompJ 1970). We present two types of results: (i) an estimated swapping probability {rho}{infinity}; and (ii) the communication volume of a parallel PageRank solution (link-following {alpha} = 0.85) using an additive Schwarz method. The volume ratio is the amount of extra storage for the overlap (2 means we store the graph twice). Below, as the ratio increases, the swapping probability and PageRank communication volume decreases.« less
Efficient methods for overlapping group lasso.
Yuan, Lei; Liu, Jun; Ye, Jieping
2013-09-01
The group Lasso is an extension of the Lasso for feature selection on (predefined) nonoverlapping groups of features. The nonoverlapping group structure limits its applicability in practice. There have been several recent attempts to study a more general formulation where groups of features are given, potentially with overlaps between the groups. The resulting optimization is, however, much more challenging to solve due to the group overlaps. In this paper, we consider the efficient optimization of the overlapping group Lasso penalized problem. We reveal several key properties of the proximal operator associated with the overlapping group Lasso, and compute the proximal operator by solving the smooth and convex dual problem, which allows the use of the gradient descent type of algorithms for the optimization. Our methods and theoretical results are then generalized to tackle the general overlapping group Lasso formulation based on the l(q) norm. We further extend our algorithm to solve a nonconvex overlapping group Lasso formulation based on the capped norm regularization, which reduces the estimation bias introduced by the convex penalty. We have performed empirical evaluations using both a synthetic and the breast cancer gene expression dataset, which consists of 8,141 genes organized into (overlapping) gene sets. Experimental results show that the proposed algorithm is more efficient than existing state-of-the-art algorithms. Results also demonstrate the effectiveness of the nonconvex formulation for overlapping group Lasso.
An ant colony based algorithm for overlapping community detection in complex networks
NASA Astrophysics Data System (ADS)
Zhou, Xu; Liu, Yanheng; Zhang, Jindong; Liu, Tuming; Zhang, Di
2015-06-01
Community detection is of great importance to understand the structures and functions of networks. Overlap is a significant feature of networks and overlapping community detection has attracted an increasing attention. Many algorithms have been presented to detect overlapping communities. In this paper, we present an ant colony based overlapping community detection algorithm which mainly includes ants' location initialization, ants' movement and post processing phases. An ants' location initialization strategy is designed to identify initial location of ants and initialize label list stored in each node. During the ants' movement phase, the entire ants move according to the transition probability matrix, and a new heuristic information computation approach is redefined to measure similarity between two nodes. Every node keeps a label list through the cooperation made by ants until a termination criterion is reached. A post processing phase is executed on the label list to get final overlapping community structure naturally. We illustrate the capability of our algorithm by making experiments on both synthetic networks and real world networks. The results demonstrate that our algorithm will have better performance in finding overlapping communities and overlapping nodes in synthetic datasets and real world datasets comparing with state-of-the-art algorithms.
Liu, Zeliang; Moore, John A.; Liu, Wing Kam
2016-05-03
Inclusions comprised on filler particles and interphase regions commonly form complex morphologies in polymer nanocomposites. Addressing these morphologies as systems of overlapping simple shapes allows for the study of dilute particles, clustered particles, and interacting interphases all in one general modeling framework. To account for the material properties in these overlapping geometries, weighted-mean and additive overlapping conditions are introduced and the corresponding inclusion-wise integral equations are formulated. An extended micromechanics method based on these overlapping conditions for linear elastic and viscoelastic heterogeneous material is then developed. An important feature of the proposed approach is that the effect of both themore » geometric overlapping (clustered particles) and physical overlapping (interacting interphases) on the effective properties can be distinguished. Lastly, we apply the extended micromechanics method to a viscoelastic polymer nanocomposite with interphase regions, and estimate the properties and thickness of the interphase region based on experimental data for carbon-black filled styrene butadiene rubbers.« less
DOE Office of Scientific and Technical Information (OSTI.GOV)
Liu, Zeliang; Moore, John A.; Liu, Wing Kam
Inclusions comprised on filler particles and interphase regions commonly form complex morphologies in polymer nanocomposites. Addressing these morphologies as systems of overlapping simple shapes allows for the study of dilute particles, clustered particles, and interacting interphases all in one general modeling framework. To account for the material properties in these overlapping geometries, weighted-mean and additive overlapping conditions are introduced and the corresponding inclusion-wise integral equations are formulated. An extended micromechanics method based on these overlapping conditions for linear elastic and viscoelastic heterogeneous material is then developed. An important feature of the proposed approach is that the effect of both themore » geometric overlapping (clustered particles) and physical overlapping (interacting interphases) on the effective properties can be distinguished. Lastly, we apply the extended micromechanics method to a viscoelastic polymer nanocomposite with interphase regions, and estimate the properties and thickness of the interphase region based on experimental data for carbon-black filled styrene butadiene rubbers.« less
NASA Technical Reports Server (NTRS)
Berkoff, Timothy A.; Welton, Ellsworth J.; Campbell, James R.; Scott, Vibart S.; Spinhirne, James D.
2003-01-01
The Micro-Pulse Lidar NETwork (MPLNET) is comprised of micro-pulse lidars (MPL) stationed around the globe to provide measurements of aerosol and cloud vertical distribution on a continuous basis. MPLNET sites are co-located with sunphotometers in the AErosol Robotic NETwork (AERONET) to provide joint measurements of aerosol optical depth, size, and other inherent optical properties. The IPCC 2001 report discusses . the importance of obtaining routine measurements of aerosol vertical structure, especially for absorbing aerosols. MPLNET provides exactly this sort of measurement, including calculation of aerosol extinction profiles, in a near real-time basis for all sites in the network. In order to obtain aerosol profiles, near range signal returns (0-6 km) must be accurately measured by the MPL. This measurement is complicated by the instrument s overlap range: Le., the minimum distance at which returning signals are completely in the instrument s field-of-view (FOV). Typical MPL overlap distances are large, between 5 - 6 km, due to the narrow FOV of the MPL receiver. A function describing the MPL overlap must be determined and used to correct signals in this range. Currently, overlap functions for MPLNET are determined using horizontal MPL measurements along a path with 10-1 5 km clear line-of-sight and a homogenous atmosphere. These conditions limit the location and ease in which successful overlaps can be obtained. Furthermore, the current MPLNET process of correcting for overlap increases the uncertainty and bias error for the near range signals and the resulting aerosol extinction profiles. To address these issues, an alternative overlap correction method using a small-diameter, wide FOV receiver is being considered for potential use in MPLNET. The wide FOV receiver has a much shorter overlap distance and will be used to calculate the overlap function of the MPL receiver. This approach has a significant benefit in that overlap corrections could be obtained without the need for horizontal measurements. A review of both overlap methods is presented, including a discussion of the impact on reducing the uncertainty and bias error in MPLNET aerosol profiles.
Necka, Elizabeth A.; Sokolowski, H. Moriah; Lyons, Ian M.
2015-01-01
Recent work has demonstrated that math anxiety is more than just the product of poor math skills. Psychosocial factors may play a key role in understanding what it means to be math anxious, and hence may aid in attempts to sever the link between math anxiety and poor math performance. One such factor may be the extent to which individuals integrate math into their sense of self. We adapted a well-established measure of this degree of integration (i.e., self-other overlap) to assess individuals’ self-math overlap. This non-verbal single-item measure showed that identifying oneself with math (having higher self-math overlap) was strongly associated with lower math anxiety (r = -0.610). We also expected that having higher self-math overlap would leave one especially susceptible to the threat of poor math performance to the self. We identified two competing hypotheses regarding how this plays out in terms of math anxiety. Those higher in self-math overlap might be more likely to worry about poor math performance, exacerbating the negative relation between math anxiety and math ability. Alternatively, those higher in self-math overlap might exhibit self-serving biases regarding their math ability, which would instead predict a decoupling of the relation between their perceived and actual math ability, and in turn the relation between their math ability and math anxiety. Results clearly favored the latter hypothesis: those higher in self-math overlap exhibited almost no relation between math anxiety and math ability, whereas those lower in self-math overlap showed a strong negative relation between math anxiety and math ability. This was partially explained by greater self-serving biases among those higher in self-math overlap. In sum, these results reveal that the degree to which one integrates math into one’s self – self-math overlap – may provide insight into how the pernicious negative relation between math anxiety and math ability may be ameliorated. PMID:26528210
Prevention of overlapping prescriptions of psychotropic drugs by community pharmacists.
Shimane, Takuya; Matsumoto, Toshihiko; Wada, Kiyoshi
2012-10-01
The nonmedical use or abuse of prescription drugs, including psychotropic medicines, is a growing health problem in Japan. Patient access to psychotropic drugs, specifically from the oversupply of medications due to overlapping prescriptions, may increase the risk of drug abuse and dependence. However, very little is known about such overlapping prescriptions. Today, the dispensing of prescriptions is generally moving from inside to outside of hospitals, with psychotropic drugs mainly dispensed at community pharmacies. In this study, we used health insurance claims (i.e., receipts) for dispensing as the main source of information in an investigation of overlapping prescriptions of psychotropic drugs. A total of 119 patients were found to have received overlapping prescriptions, as identified by community pharmacists who were members of the Saitama Pharmaceutical Association, using patient medication records, followed by medication counseling and prescription notes for the patient. According to our findings, the most frequently overlapping medication was etizolam. Etizolam can be prescribed for more than 30 days since it is not regulated under Japanese law as a "psychotropic drug." Generally, when a drug can be prescribed for a greater number of days, it increases the likelihood of an overlapping prescription during the same period. As a result, the long-term prescription of etizolam increases the risk of overlapping prescriptions. We also found that the patients who received overlapping prescriptions of etizolam were mostly elderly and the most common pattern was prescription from both internal medicine and orthopedics physicians. Etizolam has wide range of indications that are covered by health insurance. Our results suggest that patients who received overlapping prescriptions of etizolam may receive prescriptions from different prescribers for different purposes. Therefore, it may be appropriate to regulate etizolam as a "psychotropic drug" under Japanese law, thus setting a limit on the period for which it can be prescribed in order to help prevent long-term and overlapping prescriptions.
Necka, Elizabeth A; Sokolowski, H Moriah; Lyons, Ian M
2015-01-01
Recent work has demonstrated that math anxiety is more than just the product of poor math skills. Psychosocial factors may play a key role in understanding what it means to be math anxious, and hence may aid in attempts to sever the link between math anxiety and poor math performance. One such factor may be the extent to which individuals integrate math into their sense of self. We adapted a well-established measure of this degree of integration (i.e., self-other overlap) to assess individuals' self-math overlap. This non-verbal single-item measure showed that identifying oneself with math (having higher self-math overlap) was strongly associated with lower math anxiety (r = -0.610). We also expected that having higher self-math overlap would leave one especially susceptible to the threat of poor math performance to the self. We identified two competing hypotheses regarding how this plays out in terms of math anxiety. Those higher in self-math overlap might be more likely to worry about poor math performance, exacerbating the negative relation between math anxiety and math ability. Alternatively, those higher in self-math overlap might exhibit self-serving biases regarding their math ability, which would instead predict a decoupling of the relation between their perceived and actual math ability, and in turn the relation between their math ability and math anxiety. Results clearly favored the latter hypothesis: those higher in self-math overlap exhibited almost no relation between math anxiety and math ability, whereas those lower in self-math overlap showed a strong negative relation between math anxiety and math ability. This was partially explained by greater self-serving biases among those higher in self-math overlap. In sum, these results reveal that the degree to which one integrates math into one's self - self-math overlap - may provide insight into how the pernicious negative relation between math anxiety and math ability may be ameliorated.
Futagami, Seiji; Yamawaki, Hiroshi; Shimpuku, Mayumi; Izumi, Nikki; Wakabayashi, Taiga; Kodaka, Yasuhiro; Nagoya, Hiroyuki; Shindo, Tomotaka; Kawagoe, Tetsuro; Sakamoto, Choitsu
2013-01-01
The association between clinical symptoms and sleep disorders in functional dyspepsia (FD)-overlap syndrome has not been studied in detail. The subjects were 139 patients with FD, 14 with irritable bowel syndrome (IBS), 12 with nonerosive reflux disease (NERD), and 41 healthy volunteers. Gastric motility was evaluated with the (13)C-acetate breath test. We used Rome III criteria to evaluate upper abdominal symptoms, and Self-Rating Questionnaire for Depression (SRQ-D) scores to determine depression status. Sleep disorders were evaluated with Pittsburgh Sleep Quality Index (PSQI) scores. There were no significant differences in age, body-mass index, alcohol intake, and smoking rate between patients with FD alone and those with FD-overlap syndrome. The postprandial abdominal fullness score in patients with FD-NERD-IBS was significantly greater than that in patients with FD-NERD overlap syndrome (p<0.001) or FD alone (p<0.001). The score for the feeling of hunger in patients with FD-NERD-IBS was significantly greater than that in patients with FD alone (p=0.0025), FD-NERD overlap syndrome (p=0.0088), or FD-IBS overlap syndrome (p=0.0057). The heartburn score in subjects with FD-NERD-IBS overlap syndrome was significantly greater than that in subjects with FD alone (p=0.0035) or FD-IBS overlap syndrome (p=0.0026). The Tmax in patients with FD-overlap syndrome or FD alone was significantly higher than that in healthy volunteers. The Pittsburgh Sleep Quality Index score in subjects with FD-NERD-IBS overlap syndrome was significantly greater than that in subjects with FD alone. Symptom scores, such as those for postprandial abdominal fullness, heartburn, and the feeling of hunger, in patients with FD-overlap syndromes are significantly greater than those in patients with FD alone. Further studies are necessary to clarify whether various symptoms are related to sleep disorders in patients with FD-NERD-IBS overlap syndrome.
Zygourakis, Corinna C; Keefe, Malla; Lee, Janelle; Barba, Julio; McDermott, Michael W; Mummaneni, Praveen V; Lawton, Michael T
2017-02-01
Overlapping surgery is a common practice to improve surgical efficiency, but there are limited data on its safety. To analyze the patient outcomes of overlapping vs nonoverlapping surgeries performed by multiple neurosurgeons. Retrospective review of 7358 neurosurgical procedures, 2012 to 2015, at an urban academic hospital. Collected variables: patient age, gender, insurance, American Society of Anesthesiologists score, severity of illness, mortality risk, admission type, transfer source, procedure type, surgery date, number of cosurgeons, presence of neurosurgery resident/fellow/another attending, and overlapping vs nonoverlapping surgery. Outcomes: procedure time, length of stay, estimated blood loss, discharge location, 30-day mortality, 30-day readmission, return to operating room, acute respiratory failure, and severe sepsis. Statistics: univariate, then multivariate mixed-effect models. Overlapping surgery patients (n = 3725) were younger and had lower American Society of Anesthesiologists scores, severity of illness, and mortality risk (P < .0001) than nonoverlapping surgery patients (n = 3633). Overlapping surgeries had longer procedure times (214 vs 172 min; P < .0001), but shorter length of stay (7.3 vs 7.9 d; P = .010) and lower estimated blood loss (312 vs 363 mL’s; P = .003). Overlapping surgery patients were more likely to be discharged home (73.6% vs 66.2%; P < .0001), and had lower mortality rates (1.3% vs 2.5%; P = .0005) and acute respiratory failure (1.8% vs 2.6%; P = .021). In multivariate models, there was no significant difference between overlapping and nonoverlapping surgeries for any patient outcomes, except for procedure duration, which was longer in overlapping surgery (estimate = 23.03; P < .001). When planned appropriately, overlapping surgery can be performed safely within the infrastructure at our academic institution. Copyright © 2017 by the Congress of Neurological Surgeons
David-Barrett, Tamas; Rotkirch, Anna; Carney, James; Behncke Izquierdo, Isabel; Krems, Jaimie A.; Townley, Dylan; McDaniell, Elinor; Byrne-Smith, Anna; Dunbar, Robin I. M.
2015-01-01
The ability to create lasting, trust-based friendships makes it possible for humans to form large and coherent groups. The recent literature on the evolution of sociality and on the network dynamics of human societies suggests that large human groups have a layered structure generated by emotionally supported social relationships. There are also gender differences in adult social style which may involve different trade-offs between the quantity and quality of friendships. Although many have suggested that females tend to focus on intimate relations with a few other females, while males build larger, more hierarchical coalitions, the existence of such gender differences is disputed and data from adults is scarce. Here, we present cross-cultural evidence for gender differences in the preference for close friendships. We use a sample of ∼112,000 profile pictures from nine world regions posted on a popular social networking site to show that, in self-selected displays of social relationships, women favour dyadic relations, whereas men favour larger, all-male cliques. These apparently different solutions to quality-quantity trade-offs suggest a universal and fundamental difference in the function of close friendships for the two sexes. PMID:25775258
Lee, Geunho; Lee, Hyun Beom; Jung, Byung Hwa; Nam, Hojung
2017-07-01
Mass spectrometry (MS) data are used to analyze biological phenomena based on chemical species. However, these data often contain unexpected duplicate records and missing values due to technical or biological factors. These 'dirty data' problems increase the difficulty of performing MS analyses because they lead to performance degradation when statistical or machine-learning tests are applied to the data. Thus, we have developed missing values preprocessor (mvp), an open-source software for preprocessing data that might include duplicate records and missing values. mvp uses the property of MS data in which identical chemical species present the same or similar values for key identifiers, such as the mass-to-charge ratio and intensity signal, and forms cliques via graph theory to process dirty data. We evaluated the validity of the mvp process via quantitative and qualitative analyses and compared the results from a statistical test that analyzed the original and mvp-applied data. This analysis showed that using mvp reduces problems associated with duplicate records and missing values. We also examined the effects of using unprocessed data in statistical tests and examined the improved statistical test results obtained with data preprocessed using mvp.
Juarez, Paul D; Hood, Darryl B; Rogers, Gary L; Baktash, Suzanne H; Saxton, Arnold M; Matthews-Juarez, Patricia; Im, Wansoo; Cifuentes, Myriam Patricia; Phillips, Charles A; Lichtveld, Maureen Y; Langston, Michael A
2017-01-01
Objectives The aim is to identify exposures associated with lung cancer mortality and mortality disparities by race and gender using an exposome database coupled to a graph theoretical toolchain. Methods Graph theoretical algorithms were employed to extract paracliques from correlation graphs using associations between 2162 environmental exposures and lung cancer mortality rates in 2067 counties, with clique doubling applied to compute an absolute threshold of significance. Factor analysis and multiple linear regressions then were used to analyze differences in exposures associated with lung cancer mortality and mortality disparities by race and gender. Results While cigarette consumption was highly correlated with rates of lung cancer mortality for both white men and women, previously unidentified novel exposures were more closely associated with lung cancer mortality and mortality disparities for blacks, particularly black women. Conclusions Exposures beyond smoking moderate lung cancer mortality and mortality disparities by race and gender. Policy Implications An exposome approach and database coupled with scalable combinatorial analytics provides a powerful new approach for analyzing relationships between multiple environmental exposures, pathways and health outcomes. An assessment of multiple exposures is needed to appropriately translate research findings into environmental public health practice and policy. PMID:29152601
Jiang, T; Jiang, C-Y; Shu, J-H; Xu, Y-J
2017-07-10
The molecular mechanism of nasopharyngeal carcinoma (NPC) is poorly understood and effective therapeutic approaches are needed. This research aimed to excavate the attractor modules involved in the progression of NPC and provide further understanding of the underlying mechanism of NPC. Based on the gene expression data of NPC, two specific protein-protein interaction networks for NPC and control conditions were re-weighted using Pearson correlation coefficient. Then, a systematic tracking of candidate modules was conducted on the re-weighted networks via cliques algorithm, and a total of 19 and 38 modules were separately identified from NPC and control networks, respectively. Among them, 8 pairs of modules with similar gene composition were selected, and 2 attractor modules were identified via the attract method. Functional analysis indicated that these two attractor modules participate in one common bioprocess of cell division. Based on the strategy of integrating systemic module inference with the attract method, we successfully identified 2 attractor modules. These attractor modules might play important roles in the molecular pathogenesis of NPC via affecting the bioprocess of cell division in a conjunct way. Further research is needed to explore the correlations between cell division and NPC.
Network collaboration of organisations for homeless individuals in the Montreal region
Fleury, Marie-Josée; Grenier, Guy; Lesage, Alain; Ma, Nan; Ngui, André Ngamini
2014-01-01
Introduction We know little about the intensity and determinants of interorganisational collaboration within the homeless network. This study describes the characteristics and relationships (along with the variables predicting their degree of interorganisational collaboration) of 68 organisations of such a network in Montreal (Quebec, Canada). Theory and methods Data were collected primarily through a self-administered questionnaire. Descriptive analyses were conducted followed by social network and multivariate analyses. Results The Montreal homeless network has a high density (50.5%) and a decentralised structure and maintains a mostly informal collaboration with the public and cross-sectorial sectors. The network density showed more frequent contacts among four types of organisations which could point to the existence of cliques. Four variables predicted interorganisational collaboration: organisation type, number of services offered, volume of referrals and satisfaction with the relationships with public organisations. Conclusions and discussion The Montreal homeless network seems adequate to address non-complex homelessness problems. Considering, however, that most homeless individuals present chronic and complex profiles, it appears necessary to have a more formal and better integrated network of homeless organisations, particularly in the health and social service sectors, in order to improve services. PMID:24520216
Differential network as an indicator of osteoporosis with network entropy.
Ma, Lili; Du, Hongmei; Chen, Guangdong
2018-07-01
Osteoporosis is a common skeletal disorder characterized by a decrease in bone mass and density. The peak bone mass (PBM) is a significant determinant of osteoporosis. To gain insights into the indicating effect of PBM to osteoporosis, this study focused on characterizing the PBM networks and identifying key genes. One biological data set with 12 monocyte low PBM samples and 11 high PBM samples was derived to construct protein-protein interaction networks (PPINs). Based on clique-merging, module-identification algorithm was used to identify modules from PPINs. The systematic calculation and comparison were performed to test whether the network entropy can discriminate the low PBM network from high PBM network. We constructed 32 destination networks with 66 modules divided from monocyte low and high PBM networks. Among them, network 11 was the only significantly differential one (P<0.05) with 8 nodes and 28 edges. All genes belonged to precursors of osteoclasts, which were related to calcium transport as well as blood monocytes. In conclusion, based on the entropy in PBM PPINs, the differential network appears to be a novel therapeutic indicator for osteoporosis during the bone monocyte progression; these findings are helpful in disclosing the pathogenetic mechanisms of osteoporosis.
Biclustering Protein Complex Interactions with a Biclique FindingAlgorithm
DOE Office of Scientific and Technical Information (OSTI.GOV)
Ding, Chris; Zhang, Anne Ya; Holbrook, Stephen
2006-12-01
Biclustering has many applications in text mining, web clickstream mining, and bioinformatics. When data entries are binary, the tightest biclusters become bicliques. We propose a flexible and highly efficient algorithm to compute bicliques. We first generalize the Motzkin-Straus formalism for computing the maximal clique from L{sub 1} constraint to L{sub p} constraint, which enables us to provide a generalized Motzkin-Straus formalism for computing maximal-edge bicliques. By adjusting parameters, the algorithm can favor biclusters with more rows less columns, or vice verse, thus increasing the flexibility of the targeted biclusters. We then propose an algorithm to solve the generalized Motzkin-Straus optimizationmore » problem. The algorithm is provably convergent and has a computational complexity of O(|E|) where |E| is the number of edges. It relies on a matrix vector multiplication and runs efficiently on most current computer architectures. Using this algorithm, we bicluster the yeast protein complex interaction network. We find that biclustering protein complexes at the protein level does not clearly reflect the functional linkage among protein complexes in many cases, while biclustering at protein domain level can reveal many underlying linkages. We show several new biologically significant results.« less
Sentiment Diffusion of Public Opinions about Hot Events: Based on Complex Network
Hao, Xiaoqing; An, Haizhong; Zhang, Lijia; Li, Huajiao; Wei, Guannan
2015-01-01
To study the sentiment diffusion of online public opinions about hot events, we collected people’s posts through web data mining techniques. We calculated the sentiment value of each post based on a sentiment dictionary. Next, we divided those posts into five different orientations of sentiments: strongly positive (P), weakly positive (p), neutral (o), weakly negative (n), and strongly negative (N). These sentiments are combined into modes through coarse graining. We constructed sentiment mode complex network of online public opinions (SMCOP) with modes as nodes and the conversion relation in chronological order between different types of modes as edges. We calculated the strength, k-plex clique, clustering coefficient and betweenness centrality of the SMCOP. The results show that the strength distribution obeys power law. Most posts’ sentiments are weakly positive and neutral, whereas few are strongly negative. There are weakly positive subgroups and neutral subgroups with ppppp and ooooo as the core mode, respectively. Few modes have larger betweenness centrality values and most modes convert to each other with these higher betweenness centrality modes as mediums. Therefore, the relevant person or institutes can take measures to lead people’s sentiments regarding online hot events according to the sentiment diffusion mechanism. PMID:26462230
Clique size and network characteristics in hyperlink cinema. Constraints of evolved psychology.
Krems, Jaimie Arona; Dunbar, R I M
2013-12-01
Hyperlink cinema is an emergent film genre that seeks to push the boundaries of the medium in order to mirror contemporary life in the globalized community. Films in the genre thus create an interacting network across space and time in such a way as to suggest that people's lives can intersect on scales that would not have been possible without modern technologies of travel and communication. This allows us to test the hypothesis that new kinds of media might permit us to break through the natural cognitive constraints that limit the number and quality of social relationships we can manage in the conventional face-to-face world. We used network analysis to test this hypothesis with data from 12 hyperlink films, using 10 motion pictures from a more conventional film genre as a control. We found few differences between hyperlink cinema films and the control genre, and few differences between hyperlink cinema films and either the real world or classical drama (e.g., Shakespeare's plays). Conversation group size seems to be especially resilient to alteration. It seems that, despite many efficiency advantages, modern media are unable to circumvent the constraints imposed by our evolved psychology.
Correlations between Community Structure and Link Formation in Complex Networks
Liu, Zhen; He, Jia-Lin; Kapoor, Komal; Srivastava, Jaideep
2013-01-01
Background Links in complex networks commonly represent specific ties between pairs of nodes, such as protein-protein interactions in biological networks or friendships in social networks. However, understanding the mechanism of link formation in complex networks is a long standing challenge for network analysis and data mining. Methodology/Principal Findings Links in complex networks have a tendency to cluster locally and form so-called communities. This widely existed phenomenon reflects some underlying mechanism of link formation. To study the correlations between community structure and link formation, we present a general computational framework including a theory for network partitioning and link probability estimation. Our approach enables us to accurately identify missing links in partially observed networks in an efficient way. The links having high connection likelihoods in the communities reveal that links are formed preferentially to create cliques and accordingly promote the clustering level of the communities. The experimental results verify that such a mechanism can be well captured by our approach. Conclusions/Significance Our findings provide a new insight into understanding how links are created in the communities. The computational framework opens a wide range of possibilities to develop new approaches and applications, such as community detection and missing link prediction. PMID:24039818
Multiple-hopping trajectories near a rotating asteroid
NASA Astrophysics Data System (ADS)
Shen, Hong-Xin; Zhang, Tian-Jiao; Li, Zhao; Li, Heng-Nian
2017-03-01
We present a study of the transfer orbits connecting landing points of irregular-shaped asteroids. The landing points do not touch the surface of the asteroids and are chosen several meters above the surface. The ant colony optimization technique is used to calculate the multiple-hopping trajectories near an arbitrary irregular asteroid. This new method has three steps which are as follows: (1) the search of the maximal clique of candidate target landing points; (2) leg optimization connecting all landing point pairs; and (3) the hopping sequence optimization. In particular this method is applied to asteroids 433 Eros and 216 Kleopatra. We impose a critical constraint on the target landing points to allow for extensive exploration of the asteroid: the relative distance between all the arrived target positions should be larger than a minimum allowed value. Ant colony optimization is applied to find the set and sequence of targets, and the differential evolution algorithm is used to solve for the hopping orbits. The minimum-velocity increment tours of hopping trajectories connecting all the landing positions are obtained by ant colony optimization. The results from different size asteroids indicate that the cost of the minimum velocity-increment tour depends on the size of the asteroids.
David-Barrett, Tamas; Rotkirch, Anna; Carney, James; Behncke Izquierdo, Isabel; Krems, Jaimie A; Townley, Dylan; McDaniell, Elinor; Byrne-Smith, Anna; Dunbar, Robin I M
2015-01-01
The ability to create lasting, trust-based friendships makes it possible for humans to form large and coherent groups. The recent literature on the evolution of sociality and on the network dynamics of human societies suggests that large human groups have a layered structure generated by emotionally supported social relationships. There are also gender differences in adult social style which may involve different trade-offs between the quantity and quality of friendships. Although many have suggested that females tend to focus on intimate relations with a few other females, while males build larger, more hierarchical coalitions, the existence of such gender differences is disputed and data from adults is scarce. Here, we present cross-cultural evidence for gender differences in the preference for close friendships. We use a sample of ∼112,000 profile pictures from nine world regions posted on a popular social networking site to show that, in self-selected displays of social relationships, women favour dyadic relations, whereas men favour larger, all-male cliques. These apparently different solutions to quality-quantity trade-offs suggest a universal and fundamental difference in the function of close friendships for the two sexes.
Restoration and reconstruction from overlapping images
NASA Technical Reports Server (NTRS)
Reichenbach, Stephen E.; Kaiser, Daniel J.; Hanson, Andrew L.; Li, Jing
1997-01-01
This paper describes a technique for restoring and reconstructing a scene from overlapping images. In situations where there are multiple, overlapping images of the same scene, it may be desirable to create a single image that most closely approximates the scene, based on all of the data in the available images. For example, successive swaths acquired by NASA's planned Moderate Imaging Spectrometer (MODIS) will overlap, particularly at wide scan angles, creating a severe visual artifact in the output image. Resampling the overlapping swaths to produce a more accurate image on a uniform grid requires restoration and reconstruction. The one-pass restoration and reconstruction technique developed in this paper yields mean-square-optimal resampling, based on a comprehensive end-to-end system model that accounts for image overlap, and subject to user-defined and data-availability constraints on the spatial support of the filter.
Avdievich, Nikolai I; Giapitzakis, Ioannis-Angelos; Pfrommer, Andreas; Henning, Anke
2018-02-01
To improve the decoupling of a transceiver human head phased array at ultra-high fields (UHF, ≥ 7T) and to optimize its transmit (Tx) and receive (Rx) performance, a single-row eight-element (1 × 8) tight-fit transceiver overlapped loop array was developed and constructed. Overlapping the loops increases the RF field penetration depth but can compromise decoupling by generating substantial mutual resistance. Based on analytical modeling, we optimized the loop geometry and relative positioning to simultaneously minimize the resistive and inductive coupling and constructed a 9.4T eight-loop transceiver head phased array decoupled entirely by overlapping loops. We demonstrated that both the magnetic and electric coupling between adjacent loops is compensated at the same time by overlapping and nearly perfect decoupling (below -30 dB) can be obtained without additional decoupling strategies. Tx-efficiency and SNR of the overlapped array outperformed that of a common UHF gapped array of similar dimensions. Parallel Rx-performance was also not compromised due to overlapping the loops. As a proof of concept we developed and constructed a 9.4T (400 MHz) overlapped transceiver head array based on results of the analytical modeling. We demonstrated that at UHF overlapping loops not only provides excellent decoupling but also improves both Tx- and Rx-performance. Magn Reson Med 79:1200-1211, 2018. © 2017 International Society for Magnetic Resonance in Medicine. © 2017 International Society for Magnetic Resonance in Medicine.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Gao, Xiao-Long; Liu, Jing; Zhang, Lin-Jie, E-mail: zhanglinjie@mail.xjtu.edu.cn
2014-07-01
The effect of the overlapping factor on the microstructures and mechanical properties of pulsed Nd:YAG laser welded Ti6Al4V alloy sheets was investigated by microstructural observations, microhardness tests, tensile tests and fatigue tests. A microstructural examination shows that by increasing the overlapping factor, the grains in the fusion zone become coarser, and the width of the heat affected zone increases. As overlapping factor increases, the width of region composed completely of martensite α′ and the secondary α phase in the heat affected zone increases, consequently the gradient of microstructure along the direction from the fusion zone to base metal decreases, somore » does the gradient of microhardness. The results of tensile and fatigue tests reveal that the joints made using medium overlapping factor exhibit better mechanical properties than those welded with low and high overlapping factors. Based on the experimental results, it can be stated that a sound weld of Ti6Al4V alloy can be obtained if an appropriate overlapping factor is used. - Highlights: • The weld quality of Ti6Al4V alloy under various overlapping factors was assessed. • Tensile and fatigue tests were conducted with as-welded specimen. • Localized strain across the weld was measured using DIC photogrammetry system. • A sound weld of Ti6Al4V alloy is obtained by using right overlapping factor.« less
Applying Propensity Score Methods in Medical Research: Pitfalls and Prospects
Luo, Zhehui; Gardiner, Joseph C.; Bradley, Cathy J.
2012-01-01
The authors review experimental and nonexperimental causal inference methods, focusing on assumptions for the validity of instrumental variables and propensity score (PS) methods. They provide guidance in four areas for the analysis and reporting of PS methods in medical research and selectively evaluate mainstream medical journal articles from 2000 to 2005 in the four areas, namely, examination of balance, overlapping support description, use of estimated PS for evaluation of treatment effect, and sensitivity analyses. In spite of the many pitfalls, when appropriately evaluated and applied, PS methods can be powerful tools in assessing average treatment effects in observational studies. Appropriate PS applications can create experimental conditions using observational data when randomized controlled trials are not feasible and, thus, lead researchers to an efficient estimator of the average treatment effect. PMID:20442340
Loh, Alvin; Soman, Teesta; Brian, Jessica; Bryson, Susan E; Roberts, Wendy; Szatmari, Peter; Smith, Isabel M; Zwaigenbaum, Lonnie
2007-01-01
This study examined motor behaviors in a longitudinal cohort of infant siblings of children with autism. Stereotypic movements and postures occurring during standardized observational assessments at 12 and 18 months were coded from videotapes. Participants included eight infant siblings later diagnosed with autism spectrum disorder (ASD), a random sample of nine non-diagnosed siblings, and 15 controls. Videos were coded blind to diagnostic group. At 12 and 18 months the ASD group "arm waved" more frequently and at 18 months, one posture ("hands to ears") was more frequently observed in the ASD and non-diagnosed group compared to the controls. Overall, the siblings subsequently diagnosed with ASD and the comparison groups had considerable overlap in their repertoires of stereotyped behaviors.
Long-term outcome of hypochondriacal personality disorder.
Tyrer, P; Seivewright, N; Seivewright, H
1999-02-01
Hypochondriacal personality disorder diagnosed according to the Personality Assessment Schedule, a structured clinical interview, was related to outcome after 2 years and 5 years in a randomized, controlled trial of treatment of generalized anxiety, panic, and dysthymic disorders. Seventeen individuals (9%) from a population of 181 patients had hypochondriacal personality disorder and they experienced a significantly worse outcome than other patients, including those with other personality disorders, in terms of symptomatic change and health service utilization. This lack of improvement was associated with persistent somatization in hypochondriacal personality disorder. The results give further support to the belief that hypochondriacal personality disorder is a valid clinical diagnosis that has important clinical correlates, but further work is needed to establish the extent of its overlap with hypochondriasis as a mental state disorder.
An Efficient Semi-fragile Watermarking Scheme for Tamper Localization and Recovery
NASA Astrophysics Data System (ADS)
Hou, Xiang; Yang, Hui; Min, Lianquan
2018-03-01
To solve the problem that remote sensing images are vulnerable to be tampered, a semi-fragile watermarking scheme was proposed. Binary random matrix was used as the authentication watermark, which was embedded by quantizing the maximum absolute value of directional sub-bands coefficients. The average gray level of every non-overlapping 4×4 block was adopted as the recovery watermark, which was embedded in the least significant bit. Watermarking detection could be done directly without resorting to the original images. Experimental results showed our method was robust against rational distortions to a certain extent. At the same time, it was fragile to malicious manipulation, and realized accurate localization and approximate recovery of the tampered regions. Therefore, this scheme can protect the security of remote sensing image effectively.
NASA Astrophysics Data System (ADS)
Zou, Zhen-Zhen; Yu, Xu-Tao; Zhang, Zai-Chen
2018-04-01
At first, the entanglement source deployment problem is studied in a quantum multi-hop network, which has a significant influence on quantum connectivity. Two optimization algorithms are introduced with limited entanglement sources in this paper. A deployment algorithm based on node position (DNP) improves connectivity by guaranteeing that all overlapping areas of the distribution ranges of the entanglement sources contain nodes. In addition, a deployment algorithm based on an improved genetic algorithm (DIGA) is implemented by dividing the region into grids. From the simulation results, DNP and DIGA improve quantum connectivity by 213.73% and 248.83% compared to random deployment, respectively, and the latter performs better in terms of connectivity. However, DNP is more flexible and adaptive to change, as it stops running when all nodes are covered.
ERIC Educational Resources Information Center
Fowler, R. Clarke
2017-01-01
This study explores the relationship between grade-level overlap between elementary education (ELED) and early childhood education (ECED) licenses and ECED teacher output. Analysis of Title 2 data indicates that ECED/ELED overlap is extensive, as evidenced by the number of states with grade-level overlaps of 5 (n = 2), 4 (n = 24), 3 (n = 10), and…
Binding Sites Analyser (BiSA): Software for Genomic Binding Sites Archiving and Overlap Analysis
Khushi, Matloob; Liddle, Christopher; Clarke, Christine L.; Graham, J. Dinny
2014-01-01
Genome-wide mapping of transcription factor binding and histone modification reveals complex patterns of interactions. Identifying overlaps in binding patterns by different factors is a major objective of genomic studies, but existing methods to archive large numbers of datasets in a personalised database lack sophistication and utility. Therefore we have developed transcription factor DNA binding site analyser software (BiSA), for archiving of binding regions and easy identification of overlap with or proximity to other regions of interest. Analysis results can be restricted by chromosome or base pair overlap between regions or maximum distance between binding peaks. BiSA is capable of reporting overlapping regions that share common base pairs; regions that are nearby; regions that are not overlapping; and average region sizes. BiSA can identify genes located near binding regions of interest, genomic features near a gene or locus of interest and statistical significance of overlapping regions can also be reported. Overlapping results can be visualized as Venn diagrams. A major strength of BiSA is that it is supported by a comprehensive database of publicly available transcription factor binding sites and histone modifications, which can be directly compared to user data. The documentation and source code are available on http://bisa.sourceforge.net PMID:24533055
Sentinel-1 TOPS interferometry for along-track displacement measurement
NASA Astrophysics Data System (ADS)
Jiang, H. J.; Pei, Y. Y.; Li, J.
2017-02-01
The European Space Agency’s Sentinel-1 mission, a constellation of two C-band synthetic aperture radar (SAR) satellites, utilizes terrain observation by progressive scan (TOPS) antenna beam steering as its default operation mode to achieve wide-swath coverage and short revisit time. The beam steering during the TOPS acquisition provides a means to measure azimuth motion by using the phase difference between forward and backward looking interferograms within regions of burst overlap. Hence, there are two spectral diversity techniques for along-track displacement measurement, including multi-aperture interferometry (MAI) and “burst overlap interferometry”. This paper analyses the measurement accuracies of MAI and burst overlap interferometry. Due to large spectral separation in the overlap region, burst overlap interferometry is a more sensitive measurement. We present a TOPS interferometry approach for along-track displacement measurement. The phase bias caused by azimuth miscoregistration is first estimated by burst overlap interferometry over stationary regions. After correcting the coregistration error, the MAI phase and the interferometric phase difference between burst overlaps are recalculated to obtain along-track displacements. We test the approach with Sentinel-1 TOPS interferometric data over the 2015 Mw 7.8 Nepal earthquake fault. The results prove the feasibility of our approach and show the potential of joint estimation of along-track displacement with burst overlap interferometry and MAI.
De Carolis, Giuliano; Paroli, Mery; Tollapi, Lara; Doust, Matthew W; Burgher, Abram H; Yu, Cong; Yang, Thomas; Morgan, Donna M; Amirdelfan, Kasra; Kapural, Leonardo; Sitzman, B Todd; Bundschu, Richard; Vallejo, Ricardo; Benyamin, Ramsin M; Yearwood, Thomas L; Gliner, Bradford E; Powell, Ashley A; Bradley, Kerry
2017-05-01
Spinal cord stimulation (SCS) has been successfully used to treat chronic intractable pain for over 40 years. Successful clinical application of SCS is presumed to be generally dependent on maximizing paresthesia-pain overlap; critical to achieving this is positioning of the stimulation field at the physiologic midline. Recently, the necessity of paresthesia for achieving effective relief in SCS has been challenged by the introduction of 10 kHz paresthesia-free stimulation. In a large, prospective, randomized controlled pivotal trial, HF10 therapy was demonstrated to be statistically and clinically superior to paresthesia-based SCS in the treatment of severe chronic low back and leg pain. HF10 therapy, unlike traditional paresthesia-based SCS, requires no paresthesia to be experienced by the patient, nor does it require paresthesia mapping at any point during lead implant or post-operative programming. To determine if pain relief was related to technical factors of paresthesia, we measured and analyzed the paresthesia responses of patients successfully using HF10 therapy. Prospective, multicenter, non-randomized, non-controlled interventional study. Outpatient pain clinic at 10 centers across the US and Italy. Patients with both back and leg pain already implanted with an HF10 therapy device for up to 24 months were included in this multicenter study. Patients provided pain scores prior to and after using HF10 therapy. Each patient's most efficacious HF10 therapy stimulation program was temporarily modified to a low frequency (LF; 60 Hz), wide pulse width (~470 mus), paresthesia-generating program. On a human body diagram, patients drew the locations of their chronic intractable pain and, with the modified program activated, all regions where they experienced LF paresthesia. Paresthesia and pain drawings were then analyzed to estimate the correlation of pain relief outcomes to overlap of pain by paresthesia, and the mediolateral distribution of paresthesia (as a surrogate of physiologic midline lead positioning). A total of 61 patients participated across 11 centers. Twenty-eight men and 33 women with a mean age of 56 ± 12 years of age participated in the study. The average duration of implantable pulse generator (IPG) implant was 19 ± 9 months. The average predominant pain score, as measured on a 0 - 10 visual analog scale (VAS), prior to HF10 therapy was 7.8 ± 1.3 and at time of testing was 2.5 ± 2.1, yielding an average pain relief of 70 ± 24%. For all patients, the mean paresthesia coverage of pain was 21 ± 28%, with 43% of patients having zero paresthesia coverage of pain. Analysis revealed no correlation between percentage of LF paresthesia overlap of predominant pain and HF10 therapy efficacy (P = 0.56). Exact mediolateral positioning of the stimulation electrodes was not found to be a statistically significant predictor of pain relief outcomes. Non-randomized/non-controlled study design; short-term evaluation; certain technical factors not investigated. Both paresthesia concordance with pain and precise midline positioning of the stimulation contacts appear to be inconsequential technical factors for successful HF10 therapy application. These results suggest that HF10 therapy is not only paresthesia-free, but may be paresthesia-independent.
Overlap Spectrum Fiber Bragg Grating Sensor Based on Light Power Demodulation
Zhang, Hao; Jiang, Junzhen; Liu, Shuang; Chen, Huaixi; Zheng, Xiaoqian; Qiu, Yishen
2018-01-01
Demodulation is a bottleneck for applications involving fiber Bragg gratings (FBGs). An overlap spectrum FBG sensor based on a light power demodulation method is presented in this paper. The demodulation method uses two chirp FBGs (cFBGs) of which the reflection spectra partially overlap each other. The light power variation of the overlap spectrum can be linked to changes in the measurand, and the sensor function can be realized via this relationship. A temperature experiment showed that the relationship between the overlap power spectrum of the FBG sensor and temperature had good linearity and agreed with the theoretical analysis. PMID:29772793
Monolithic coupling of a SU8 waveguide to a silicon photodiode
NASA Astrophysics Data System (ADS)
Nathan, M.; Levy, O.; Goldfarb, I.; Ruzin, A.
2003-12-01
We present quantitative results of light coupling from SU8 waveguides into silicon p-n photodiodes in monolithically integrated structures. Multimode, 12 μm thick, and 20 μm wide SU8 waveguides were fabricated to overlap 40×180 μm2 photodiodes, with three different waveguide-photodiode overlap lengths. The attenuation due to leaky-mode coupling in the overlap area was then calculated from photocurrent measurements. The overlap attenuation ranged from a minimum of 2.2 dB per mm overlap length to a maximum of about 3 dB/mm, comparing favorably with reported nonpolymeric waveguide-Si photodiode attenuations.
Automatic prevention of label overlap
DOT National Transportation Integrated Search
1976-03-01
The project comprised a number of simulation exercises : designed to evaluate methods of either preventing or : resolving the problems likely to be caused by label overlap on : Labelled Plan Displays (LPD). The automatic prevention of : label overlap...
Reingle, Jennifer M.; Maldonado-Molina, Mildred M.
2013-01-01
The purpose of this article is to evaluate the victim–offender overlap among a nationally representative sample of Native American adolescents and young adults. Data for this study were obtained from 338 Native American youth who participated in the National Longitudinal Study of Adolescent Health (Add Health) Waves I-IV. Group-based trajectory modeling was used to estimate trajectories of violence and victimization separately. Bivariate tests were used to assess the overlap between victimization and violent trajectory groups. Multinomial regression procedures were used to assess the predictors of victimization, offending, and the overlap category of both victimization and offending. Three trajectory groups were found for violence (nonviolent, escalators, and desistors) and victimization (nonvictim, decreasing victimization, and increasing victimization). We found substantial evidence of an overlap between victimization and offending among Native Americans, as 27.5% of the sample reported both victimization and offending. Those in the overlap group had greater number of risk factors present at baseline. These results suggest that the victim–offender overlap is present in Native American adolescents. Explanations and implications are discussed. PMID:24078778