Graph-theoretic approach to quantum correlations.
Cabello, Adán; Severini, Simone; Winter, Andreas
2014-01-31
Correlations in Bell and noncontextuality inequalities can be expressed as a positive linear combination of probabilities of events. Exclusive events can be represented as adjacent vertices of a graph, so correlations can be associated to a subgraph. We show that the maximum value of the correlations for classical, quantum, and more general theories is the independence number, the Lovász number, and the fractional packing number of this subgraph, respectively. We also show that, for any graph, there is always a correlation experiment such that the set of quantum probabilities is exactly the Grötschel-Lovász-Schrijver theta body. This identifies these combinatorial notions as fundamental physical objects and provides a method for singling out experiments with quantum correlations on demand.
A study of brain networks associated with swallowing using graph-theoretical approaches.
Bo Luan
Full Text Available Functional connectivity between brain regions during swallowing tasks is still not well understood. Understanding these complex interactions is of great interest from both a scientific and a clinical perspective. In this study, functional magnetic resonance imaging (fMRI was utilized to study brain functional networks during voluntary saliva swallowing in twenty-two adult healthy subjects (all females, [Formula: see text] years of age. To construct these functional connections, we computed mean partial correlation matrices over ninety brain regions for each participant. Two regions were determined to be functionally connected if their correlation was above a certain threshold. These correlation matrices were then analyzed using graph-theoretical approaches. In particular, we considered several network measures for the whole brain and for swallowing-related brain regions. The results have shown that significant pairwise functional connections were, mostly, either local and intra-hemispheric or symmetrically inter-hemispheric. Furthermore, we showed that all human brain functional network, although varying in some degree, had typical small-world properties as compared to regular networks and random networks. These properties allow information transfer within the network at a relatively high efficiency. Swallowing-related brain regions also had higher values for some of the network measures in comparison to when these measures were calculated for the whole brain. The current results warrant further investigation of graph-theoretical approaches as a potential tool for understanding the neural basis of dysphagia.
Using Graph and Vertex Entropy to Compare Empirical Graphs with Theoretical Graph Models
Tomasz Kajdanowicz
2016-09-01
Full Text Available Over the years, several theoretical graph generation models have been proposed. Among the most prominent are: the Erdős–Renyi random graph model, Watts–Strogatz small world model, Albert–Barabási preferential attachment model, Price citation model, and many more. Often, researchers working with real-world data are interested in understanding the generative phenomena underlying their empirical graphs. They want to know which of the theoretical graph generation models would most probably generate a particular empirical graph. In other words, they expect some similarity assessment between the empirical graph and graphs artificially created from theoretical graph generation models. Usually, in order to assess the similarity of two graphs, centrality measure distributions are compared. For a theoretical graph model this means comparing the empirical graph to a single realization of a theoretical graph model, where the realization is generated from the given model using an arbitrary set of parameters. The similarity between centrality measure distributions can be measured using standard statistical tests, e.g., the Kolmogorov–Smirnov test of distances between cumulative distributions. However, this approach is both error-prone and leads to incorrect conclusions, as we show in our experiments. Therefore, we propose a new method for graph comparison and type classification by comparing the entropies of centrality measure distributions (degree centrality, betweenness centrality, closeness centrality. We demonstrate that our approach can help assign the empirical graph to the most similar theoretical model using a simple unsupervised learning method.
Intraplate seismicity in Canada: a graph theoretic approach to data analysis and interpretation
K. Vasudevan
2010-10-01
Full Text Available Intraplate seismicity occurs in central and northern Canada, but the underlying origin and dynamics remain poorly understood. Here, we apply a graph theoretic approach to characterize the statistical structure of spatiotemporal clustering exhibited by intraplate seismicity, a direct consequence of the underlying nonlinear dynamics. Using a recently proposed definition of "recurrences" based on record breaking processes (Davidsen et al., 2006, 2008, we have constructed directed graphs using catalogue data for three selected regions (Region 1: 45°−48° N/74°−80° W; Region 2: 51°−55° N/77°−83° W; and Region 3: 56°−70° N/65°−95° W, with attributes drawn from the location, origin time and the magnitude of the events. Based on comparisons with a null model derived from Poisson distribution or Monte Carlo shuffling of the catalogue data, our results provide strong evidence in support of spatiotemporal correlations of seismicity in all three regions considered. Similar evidence for spatiotemporal clustering has been documented using seismicity catalogues for southern California, suggesting possible similarities in underlying earthquake dynamics of both regions despite huge differences in the variability of seismic activity.
Linear game non-contextuality and Bell inequalities—a graph-theoretic approach
Rosicka, M; Ramanathan, R; Gnaciński, P; Horodecki, M; Horodecki, K; Horodecki, P; Severini, S
2016-01-01
We study the classical and quantum values of a class of one- and two-party unique games, that generalizes the well-known XOR games to the case of non-binary outcomes. In the bipartite case the generalized XOR (XOR-d) games we study are a subclass of the well-known linear games. We introduce a ‘constraint graph’ associated to such a game, with the constraints defining the game represented by an edge-coloring of the graph. We use the graph-theoretic characterization to relate the task of finding equivalent games to the notion of signed graphs and switching equivalence from graph theory. We relate the problem of computing the classical value of single-party anti-correlation XOR games to finding the edge bipartization number of a graph, which is known to be MaxSNP hard, and connect the computation of the classical value of XOR-d games to the identification of specific cycles in the graph. We construct an orthogonality graph of the game from the constraint graph and study its Lovász theta number as a general upper bound on the quantum value even in the case of single-party contextual XOR-d games. XOR-d games possess appealing properties for use in device-independent applications such as randomness of the local correlated outcomes in the optimal quantum strategy. We study the possibility of obtaining quantum algebraic violation of these games, and show that no finite XOR-d game possesses the property of pseudo-telepathy leaving the frequently used chained Bell inequalities as the natural candidates for such applications. We also show this lack of pseudo-telepathy for multi-party XOR-type inequalities involving two-body correlation functions. (paper)
Linear game non-contextuality and Bell inequalities—a graph-theoretic approach
Rosicka, M.; Ramanathan, R.; Gnaciński, P.; Horodecki, K.; Horodecki, M.; Horodecki, P.; Severini, S.
2016-04-01
We study the classical and quantum values of a class of one- and two-party unique games, that generalizes the well-known XOR games to the case of non-binary outcomes. In the bipartite case the generalized XOR (XOR-d) games we study are a subclass of the well-known linear games. We introduce a ‘constraint graph’ associated to such a game, with the constraints defining the game represented by an edge-coloring of the graph. We use the graph-theoretic characterization to relate the task of finding equivalent games to the notion of signed graphs and switching equivalence from graph theory. We relate the problem of computing the classical value of single-party anti-correlation XOR games to finding the edge bipartization number of a graph, which is known to be MaxSNP hard, and connect the computation of the classical value of XOR-d games to the identification of specific cycles in the graph. We construct an orthogonality graph of the game from the constraint graph and study its Lovász theta number as a general upper bound on the quantum value even in the case of single-party contextual XOR-d games. XOR-d games possess appealing properties for use in device-independent applications such as randomness of the local correlated outcomes in the optimal quantum strategy. We study the possibility of obtaining quantum algebraic violation of these games, and show that no finite XOR-d game possesses the property of pseudo-telepathy leaving the frequently used chained Bell inequalities as the natural candidates for such applications. We also show this lack of pseudo-telepathy for multi-party XOR-type inequalities involving two-body correlation functions.
Hindumathi, V; Kranthi, T; Rao, S B; Manimaran, P
2014-06-01
With rapidly changing technology, prediction of candidate genes has become an indispensable task in recent years mainly in the field of biological research. The empirical methods for candidate gene prioritization that succors to explore the potential pathway between genetic determinants and complex diseases are highly cumbersome and labor intensive. In such a scenario predicting potential targets for a disease state through in silico approaches are of researcher's interest. The prodigious availability of protein interaction data coupled with gene annotation renders an ease in the accurate determination of disease specific candidate genes. In our work we have prioritized the cervix related cancer candidate genes by employing Csaba Ortutay and his co-workers approach of identifying the candidate genes through graph theoretical centrality measures and gene ontology. With the advantage of the human protein interaction data, cervical cancer gene sets and the ontological terms, we were able to predict 15 novel candidates for cervical carcinogenesis. The disease relevance of the anticipated candidate genes was corroborated through a literature survey. Also the presence of the drugs for these candidates was detected through Therapeutic Target Database (TTD) and DrugMap Central (DMC) which affirms that they may be endowed as potential drug targets for cervical cancer.
Sone, Daichi; Matsuda, Hiroshi; Ota, Miho; Maikusa, Norihide; Kimura, Yukio; Sumida, Kaoru; Yokoyama, Kota; Imabayashi, Etsuko; Watanabe, Masako; Watanabe, Yutaka; Okazaki, Mitsutoshi; Sato, Noriko
2016-09-01
Graph theory is an emerging method to investigate brain networks. Altered cerebral blood flow (CBF) has frequently been reported in temporal lobe epilepsy (TLE), but graph theoretical findings of CBF are poorly understood. Here, we explored graph theoretical networks of CBF in TLE using arterial spin labeling imaging. We recruited patients with TLE and unilateral hippocampal sclerosis (HS) (19 patients with left TLE, and 21 with right TLE) and 20 gender- and age-matched healthy control subjects. We obtained all participants' CBF maps using pseudo-continuous arterial spin labeling and analyzed them using the Graph Analysis Toolbox (GAT) software program. As a result, compared to the controls, the patients with left TLE showed a significantly low clustering coefficient (p=0.024), local efficiency (p=0.001), global efficiency (p=0.010), and high transitivity (p=0.015), whereas the patients with right TLE showed significantly high assortativity (p=0.046) and transitivity (p=0.011). The group with right TLE also had high characteristic path length values (p=0.085), low global efficiency (p=0.078), and low resilience to targeted attack (p=0.101) at a trend level. Lower normalized clustering coefficient (p=0.081) in the left TLE and higher normalized characteristic path length (p=0.089) in the right TLE were found also at a trend level. Both the patients with left and right TLE showed significantly decreased clustering in similar areas, i.e., the cingulate gyri, precuneus, and occipital lobe. Our findings revealed differing left-right network metrics in which an inefficient CBF network in left TLE and vulnerability to irritation in right TLE are suggested. The left-right common finding of regional decreased clustering might reflect impaired default-mode networks in TLE. Copyright © 2016 Elsevier Inc. All rights reserved.
On the design of a hierarchical SS7 network: A graph theoretical approach
Krauss, Lutz; Rufa, Gerhard
1994-04-01
This contribution is concerned with the design of Signaling System No. 7 networks based on graph theoretical methods. A hierarchical network topology is derived by combining the advantage of the hierarchical network structure with the realization of node disjoint routes between nodes of the network. By using specific features of this topology, we develop an algorithm to construct circle-free routing data and to assure bidirectionality also in case of failure situations. The methods described are based on the requirements that the network topology, as well as the routing data, may be easily changed.
Kumar, Abhishek; Clement, Shibu; Agrawal, V P
2010-07-15
An attempt is made to address a few ecological and environment issues by developing different structural models for effluent treatment system for electroplating. The effluent treatment system is defined with the help of different subsystems contributing to waste minimization. Hierarchical tree and block diagram showing all possible interactions among subsystems are proposed. These non-mathematical diagrams are converted into mathematical models for design improvement, analysis, comparison, storage retrieval and commercially off-the-shelf purchases of different subsystems. This is achieved by developing graph theoretic model, matrix models and variable permanent function model. Analysis is carried out by permanent function, hierarchical tree and block diagram methods. Storage and retrieval is done using matrix models. The methodology is illustrated with the help of an example. Benefits to the electroplaters/end user are identified. 2010 Elsevier B.V. All rights reserved.
Abnormalities of functional brain networks in pathological gambling: a graph-theoretical approach
Tschernegg, Melanie; Crone, Julia S.; Eigenberger, Tina; Schwartenbeck, Philipp; Fauth-Bühler, Mira; Lemènager, Tagrid; Mann, Karl; Thon, Natasha; Wurst, Friedrich M.; Kronbichler, Martin
2013-01-01
Functional neuroimaging studies of pathological gambling (PG) demonstrate alterations in frontal and subcortical regions of the mesolimbic reward system. However, most investigations were performed using tasks involving reward processing or executive functions. Little is known about brain network abnormalities during task-free resting state in PG. In the present study, graph-theoretical methods were used to investigate network properties of resting state functional magnetic resonance imaging data in PG. We compared 19 patients with PG to 19 healthy controls (HCs) using the Graph Analysis Toolbox (GAT). None of the examined global metrics differed between groups. At the nodal level, pathological gambler showed a reduced clustering coefficient in the left paracingulate cortex and the left juxtapositional lobe (supplementary motor area, SMA), reduced local efficiency in the left SMA, as well as an increased node betweenness for the left and right paracingulate cortex and the left SMA. At an uncorrected threshold level, the node betweenness in the left inferior frontal gyrus was decreased and increased in the caudate. Additionally, increased functional connectivity between fronto-striatal regions and within frontal regions has also been found for the gambling patients. These findings suggest that regions associated with the reward system demonstrate reduced segregation but enhanced integration while regions associated with executive functions demonstrate reduced integration. The present study makes evident that PG is also associated with abnormalities in the topological network structure of the brain during rest. Since alterations in PG cannot be explained by direct effects of abused substances on the brain, these findings will be of relevance for understanding functional connectivity in other addictive disorders. PMID:24098282
Abnormalities of Functional Brain Networks in Pathological Gambling: A Graph-Theoretical Approach
Melanie eTschernegg
2013-09-01
Full Text Available Functional neuroimaging studies of pathological gambling demonstrate alterations in frontal and subcortical regions of the mesolimbic reward system. However, most investigations were performed using tasks involving reward processing or executive functions. Little is known about brain network abnormalities during task-free resting state in pathological gambling. In the present study, graph-theoretical methods were used to investigate network properties of resting state functional MRI data in pathological gambling. We compared 19 patients with pathological gambling to 19 healthy controls using the Graph Analysis Toolbox (GAT. None of the examined global metrics differed between groups. At the nodal level, pathological gambler showed a reduced clustering coefficient in the left paracingulate cortex and the left juxtapositional lobe (SMA, reduced local efficiency in the left SMA, as well as an increased node betweenness for the left and right paracingulate cortex and the left SMA. At an uncorrected threshold level, the node betweenness in the left inferior frontal gyrus was decreased and increased in the caudate. Additionally, increased functional connectivity between fronto-striatal regions and within frontal regions has also been found for the gambling patients.These findings suggest that regions associated with the reward system demonstrate reduced segregation but enhanced integration while regions associated with executive functions demonstrate reduced integration. The present study makes evident that pathological gambling is also associated with abnormalities in the topological network structure of the brain during rest. Since alterations in pathological gambling cannot be explained by direct effects of abused substances on the brain, these findings will be of relevance for understanding functional connectivity in other addictive disorders.
A Comparison of Approaches for Solving Hard Graph-Theoretic Problems
2015-04-29
and Search”, in Discrete Mathematics and Its Applications, Book 7, CRC Press (1998): Boca Raton. [6] A. Lucas, “Ising Formulations of Many NP Problems...owner. 14. ABSTRACT In order to formulate mathematical conjectures likely to be true, a number of base cases must be determined. However, many... combinatorial problems are NP-hard and the computational complexity makes this research approach difficult using a standard brute force approach on a
Chemical graph-theoretic cluster expansions
Klein, D.J.
1986-01-01
A general computationally amenable chemico-graph-theoretic cluster expansion method is suggested as a paradigm for incorporation of chemical structure concepts in a systematic manner. The cluster expansion approach is presented in a formalism general enough to cover a variety of empirical, semiempirical, and even ab initio applications. Formally such approaches for the utilization of chemical structure-related concepts may be viewed as discrete analogues of Taylor series expansions. The efficacy of the chemical structure concepts then is simply bound up in the rate of convergence of the cluster expansions. In many empirical applications, e.g., boiling points, chromatographic separation coefficients, and biological activities, this rate of convergence has been observed to be quite rapid. More note will be made here of quantum chemical applications. Relations to questions concerning size extensivity of energies and size consistency of wave functions are addressed
Graph-theoretical concepts and physicochemical data
Lionello Pogliani
2003-02-01
Full Text Available Graph theoretical concepts have been used to model the molecular polarizabilities of fifty-four organic derivatives, and the induced dipole moment of a set of fifty-seven organic compounds divided into three subsets. The starting point of these modeling strategies is the hydrogen-suppressed chemical graph and pseudograph of a molecule, which works very well for second row atoms. From these types of graphs a set of graph-theoretical basis indices, the molecular connectivity indices, can be derived and used to model properties and activities of molecules. With the aid of the molecular connectivity basis indices it is then possible to build higher-order descriptors. The problem of 'graph' encoding the contribution of the inner-core electrons of heteroatoms can here be solved with the aid of odd complete graphs, Kp-(p-odd. The use of these graph tools allow to draw an optimal modeling of the molecular polarizabilities and a satisfactory modeling of the induced dipole moment of a wide set of organic derivatives.
Predicting conversion from MCI to AD using resting-state fMRI, graph theoretical approach and SVM.
Hojjati, Seyed Hani; Ebrahimzadeh, Ata; Khazaee, Ali; Babajani-Feremi, Abbas
2017-04-15
We investigated identifying patients with mild cognitive impairment (MCI) who progress to Alzheimer's disease (AD), MCI converter (MCI-C), from those with MCI who do not progress to AD, MCI non-converter (MCI-NC), based on resting-state fMRI (rs-fMRI). Graph theory and machine learning approach were utilized to predict progress of patients with MCI to AD using rs-fMRI. Eighteen MCI converts (average age 73.6 years; 11 male) and 62 age-matched MCI non-converters (average age 73.0 years, 28 male) were included in this study. We trained and tested a support vector machine (SVM) to classify MCI-C from MCI-NC using features constructed based on the local and global graph measures. A novel feature selection algorithm was developed and utilized to select an optimal subset of features. Using subset of optimal features in SVM, we classified MCI-C from MCI-NC with an accuracy, sensitivity, specificity, and the area under the receiver operating characteristic (ROC) curve of 91.4%, 83.24%, 90.1%, and 0.95, respectively. Furthermore, results of our statistical analyses were used to identify the affected brain regions in AD. To the best of our knowledge, this is the first study that combines the graph measures (constructed based on rs-fMRI) with machine learning approach and accurately classify MCI-C from MCI-NC. Results of this study demonstrate potential of the proposed approach for early AD diagnosis and demonstrate capability of rs-fMRI to predict conversion from MCI to AD by identifying affected brain regions underlying this conversion. Copyright © 2017 Elsevier B.V. All rights reserved.
Graph theoretical model of a sensorimotor connectome in zebrafish.
Stobb, Michael; Peterson, Joshua M; Mazzag, Borbala; Gahtan, Ethan
2012-01-01
Mapping the detailed connectivity patterns (connectomes) of neural circuits is a central goal of neuroscience. The best quantitative approach to analyzing connectome data is still unclear but graph theory has been used with success. We present a graph theoretical model of the posterior lateral line sensorimotor pathway in zebrafish. The model includes 2,616 neurons and 167,114 synaptic connections. Model neurons represent known cell types in zebrafish larvae, and connections were set stochastically following rules based on biological literature. Thus, our model is a uniquely detailed computational representation of a vertebrate connectome. The connectome has low overall connection density, with 2.45% of all possible connections, a value within the physiological range. We used graph theoretical tools to compare the zebrafish connectome graph to small-world, random and structured random graphs of the same size. For each type of graph, 100 randomly generated instantiations were considered. Degree distribution (the number of connections per neuron) varied more in the zebrafish graph than in same size graphs with less biological detail. There was high local clustering and a short average path length between nodes, implying a small-world structure similar to other neural connectomes and complex networks. The graph was found not to be scale-free, in agreement with some other neural connectomes. An experimental lesion was performed that targeted three model brain neurons, including the Mauthner neuron, known to control fast escape turns. The lesion decreased the number of short paths between sensory and motor neurons analogous to the behavioral effects of the same lesion in zebrafish. This model is expandable and can be used to organize and interpret a growing database of information on the zebrafish connectome.
Graph theoretical model of a sensorimotor connectome in zebrafish.
Michael Stobb
Full Text Available Mapping the detailed connectivity patterns (connectomes of neural circuits is a central goal of neuroscience. The best quantitative approach to analyzing connectome data is still unclear but graph theory has been used with success. We present a graph theoretical model of the posterior lateral line sensorimotor pathway in zebrafish. The model includes 2,616 neurons and 167,114 synaptic connections. Model neurons represent known cell types in zebrafish larvae, and connections were set stochastically following rules based on biological literature. Thus, our model is a uniquely detailed computational representation of a vertebrate connectome. The connectome has low overall connection density, with 2.45% of all possible connections, a value within the physiological range. We used graph theoretical tools to compare the zebrafish connectome graph to small-world, random and structured random graphs of the same size. For each type of graph, 100 randomly generated instantiations were considered. Degree distribution (the number of connections per neuron varied more in the zebrafish graph than in same size graphs with less biological detail. There was high local clustering and a short average path length between nodes, implying a small-world structure similar to other neural connectomes and complex networks. The graph was found not to be scale-free, in agreement with some other neural connectomes. An experimental lesion was performed that targeted three model brain neurons, including the Mauthner neuron, known to control fast escape turns. The lesion decreased the number of short paths between sensory and motor neurons analogous to the behavioral effects of the same lesion in zebrafish. This model is expandable and can be used to organize and interpret a growing database of information on the zebrafish connectome.
Planar articulated mechanism design by graph theoretical enumeration
Kawamoto, A; Bendsøe, Martin P.; Sigmund, Ole
2004-01-01
This paper deals with design of articulated mechanisms using a truss-based ground-structure representation. By applying a graph theoretical enumeration approach we can perform an exhaustive analysis of all possible topologies for a test example for which we seek a symmetric mechanism. This guaran....... This guarantees that one can identify the global optimum solution. The result underlines the importance of mechanism topology and gives insight into the issues specific to articulated mechanism designs compared to compliant mechanism designs....
Neural complexity: A graph theoretic interpretation
Barnett, L.; Buckley, C. L.; Bullock, S.
2011-04-01
One of the central challenges facing modern neuroscience is to explain the ability of the nervous system to coherently integrate information across distinct functional modules in the absence of a central executive. To this end, Tononi [Proc. Natl. Acad. Sci. USA.PNASA60027-842410.1073/pnas.91.11.5033 91, 5033 (1994)] proposed a measure of neural complexity that purports to capture this property based on mutual information between complementary subsets of a system. Neural complexity, so defined, is one of a family of information theoretic metrics developed to measure the balance between the segregation and integration of a system’s dynamics. One key question arising for such measures involves understanding how they are influenced by network topology. Sporns [Cereb. Cortex53OPAV1047-321110.1093/cercor/10.2.127 10, 127 (2000)] employed numerical models in order to determine the dependence of neural complexity on the topological features of a network. However, a complete picture has yet to be established. While De Lucia [Phys. Rev. EPLEEE81539-375510.1103/PhysRevE.71.016114 71, 016114 (2005)] made the first attempts at an analytical account of this relationship, their work utilized a formulation of neural complexity that, we argue, did not reflect the intuitions of the original work. In this paper we start by describing weighted connection matrices formed by applying a random continuous weight distribution to binary adjacency matrices. This allows us to derive an approximation for neural complexity in terms of the moments of the weight distribution and elementary graph motifs. In particular, we explicitly establish a dependency of neural complexity on cyclic graph motifs.
Unsupervised active learning based on hierarchical graph-theoretic clustering.
Hu, Weiming; Hu, Wei; Xie, Nianhua; Maybank, Steve
2009-10-01
Most existing active learning approaches are supervised. Supervised active learning has the following problems: inefficiency in dealing with the semantic gap between the distribution of samples in the feature space and their labels, lack of ability in selecting new samples that belong to new categories that have not yet appeared in the training samples, and lack of adaptability to changes in the semantic interpretation of sample categories. To tackle these problems, we propose an unsupervised active learning framework based on hierarchical graph-theoretic clustering. In the framework, two promising graph-theoretic clustering algorithms, namely, dominant-set clustering and spectral clustering, are combined in a hierarchical fashion. Our framework has some advantages, such as ease of implementation, flexibility in architecture, and adaptability to changes in the labeling. Evaluations on data sets for network intrusion detection, image classification, and video classification have demonstrated that our active learning framework can effectively reduce the workload of manual classification while maintaining a high accuracy of automatic classification. It is shown that, overall, our framework outperforms the support-vector-machine-based supervised active learning, particularly in terms of dealing much more efficiently with new samples whose categories have not yet appeared in the training samples.
NICO
L-rhamnose and L-fucose: A Theoretical Approach ... L-ramnose and L-fucose, by means of the Monte Carlo conformational search method. The energy of the conformers ..... which indicates an increased probability for the occurrence of.
Information Retrieval and Graph Analysis Approaches for Book Recommendation
Chahinez Benkoussas; Patrice Bellot
2015-01-01
A combination of multiple information retrieval approaches is proposed for the purpose of book recommendation. In this paper, book recommendation is based on complex user's query. We used different theoretical retrieval models: probabilistic as InL2 (Divergence from Randomness model) and language model and tested their interpolated combination. Graph analysis algorithms such as PageRank have been successful in Web environments. We consider the application of this algorithm in a new retrieval ...
Graph theoretical analysis of EEG functional connectivity during music perception.
Wu, Junjie; Zhang, Junsong; Liu, Chu; Liu, Dongwei; Ding, Xiaojun; Zhou, Changle
2012-11-05
The present study evaluated the effect of music on large-scale structure of functional brain networks using graph theoretical concepts. While most studies on music perception used Western music as an acoustic stimulus, Guqin music, representative of Eastern music, was selected for this experiment to increase our knowledge of music perception. Electroencephalography (EEG) was recorded from non-musician volunteers in three conditions: Guqin music, noise and silence backgrounds. Phase coherence was calculated in the alpha band and between all pairs of EEG channels to construct correlation matrices. Each resulting matrix was converted into a weighted graph using a threshold, and two network measures: the clustering coefficient and characteristic path length were calculated. Music perception was found to display a higher level mean phase coherence. Over the whole range of thresholds, the clustering coefficient was larger while listening to music, whereas the path length was smaller. Networks in music background still had a shorter characteristic path length even after the correction for differences in mean synchronization level among background conditions. This topological change indicated a more optimal structure under music perception. Thus, prominent small-world properties are confirmed in functional brain networks. Furthermore, music perception shows an increase of functional connectivity and an enhancement of small-world network organizations. Copyright © 2012 Elsevier B.V. All rights reserved.
Detecting Network Vulnerabilities Through Graph TheoreticalMethods
Cesarz, Patrick; Pomann, Gina-Maria; Torre, Luis de la; Villarosa, Greta; Flournoy, Tamara; Pinar, Ali; Meza Juan
2007-09-30
Identifying vulnerabilities in power networks is an important problem, as even a small number of vulnerable connections can cause billions of dollars in damage to a network. In this paper, we investigate a graph theoretical formulation for identifying vulnerabilities of a network. We first try to find the most critical components in a network by finding an optimal solution for each possible cutsize constraint for the relaxed version of the inhibiting bisection problem, which aims to find loosely coupled subgraphs with significant demand/supply mismatch. Then we investigate finding critical components by finding a flow assignment that minimizes the maximum among flow assignments on all edges. We also report experiments on IEEE 30, IEEE 118, and WSCC 179 benchmark power networks.
Graph-theoretic techniques for web content mining
Schenker, Adam; Bunke, Horst; Last, Mark
2005-01-01
This book describes exciting new opportunities for utilizing robust graph representations of data with common machine learning algorithms. Graphs can model additional information which is often not present in commonly used data representations, such as vectors.
Information Retrieval and Graph Analysis Approaches for Book Recommendation.
Benkoussas, Chahinez; Bellot, Patrice
2015-01-01
A combination of multiple information retrieval approaches is proposed for the purpose of book recommendation. In this paper, book recommendation is based on complex user's query. We used different theoretical retrieval models: probabilistic as InL2 (Divergence from Randomness model) and language model and tested their interpolated combination. Graph analysis algorithms such as PageRank have been successful in Web environments. We consider the application of this algorithm in a new retrieval approach to related document network comprised of social links. We called Directed Graph of Documents (DGD) a network constructed with documents and social information provided from each one of them. Specifically, this work tackles the problem of book recommendation in the context of INEX (Initiative for the Evaluation of XML retrieval) Social Book Search track. A series of reranking experiments demonstrate that combining retrieval models yields significant improvements in terms of standard ranked retrieval metrics. These results extend the applicability of link analysis algorithms to different environments.
An Association-Oriented Partitioning Approach for Streaming Graph Query
Yun Hao
2017-01-01
Full Text Available The volumes of real-world graphs like knowledge graph are increasing rapidly, which makes streaming graph processing a hot research area. Processing graphs in streaming setting poses significant challenges from different perspectives, among which graph partitioning method plays a key role. Regarding graph query, a well-designed partitioning method is essential for achieving better performance. Existing offline graph partitioning methods often require full knowledge of the graph, which is not possible during streaming graph processing. In order to handle this problem, we propose an association-oriented streaming graph partitioning method named Assc. This approach first computes the rank values of vertices with a hybrid approximate PageRank algorithm. After splitting these vertices with an adapted variant affinity propagation algorithm, the process order on vertices in the sliding window can be determined. Finally, according to the level of these vertices and their association, the partition where the vertices should be distributed is decided. We compare its performance with a set of streaming graph partition methods and METIS, a widely adopted offline approach. The results show that our solution can partition graphs with hundreds of millions of vertices in streaming setting on a large collection of graph datasets and our approach outperforms other graph partitioning methods.
Graph theoretical analysis of resting magnetoencephalographic functional connectivity networks
Lindsay eRutter
2013-07-01
Full Text Available Complex networks have been observed to comprise small-world properties, believed to represent an optimal organization of local specialization and global integration of information processing at reduced wiring cost. Here, we applied magnitude squared coherence to resting magnetoencephalographic time series in reconstructed source space, acquired from controls and patients with schizophrenia, and generated frequency-dependent adjacency matrices modeling functional connectivity between virtual channels. After configuring undirected binary and weighted graphs, we found that all human networks demonstrated highly localized clustering and short characteristic path lengths. The most conservatively thresholded networks showed efficient wiring, with topographical distance between connected vertices amounting to one-third as observed in surrogate randomized topologies. Nodal degrees of the human networks conformed to a heavy-tailed exponentially truncated power-law, compatible with the existence of hubs, which included theta and alpha bilateral cerebellar tonsil, beta and gamma bilateral posterior cingulate, and bilateral thalamus across all frequencies. We conclude that all networks showed small-worldness, minimal physical connection distance, and skewed degree distributions characteristic of physically-embedded networks, and that these calculations derived from graph theoretical mathematics did not quantifiably distinguish between subject populations, independent of bandwidth. However, post-hoc measurements of edge computations at the scale of the individual vertex revealed trends of reduced gamma connectivity across the posterior medial parietal cortex in patients, an observation consistent with our prior resting activation study that found significant reduction of synthetic aperture magnetometry gamma power across similar regions. The basis of these small differences remains unclear.
Graph Theory Approach for Studying Food Webs
Longjas, A.; Tejedor, A.; Foufoula-Georgiou, E.
2017-12-01
Food webs are complex networks of feeding interactions among species in ecological communities. Metrics describing food web structure have been proposed to compare and classify food webs ranging from food chain length, connectance, degree distribution, centrality measures, to the presence of motifs (distinct compartments), among others. However, formal methodologies for studying both food web topology and the dynamic processes operating on them are still lacking. Here, we utilize a quantitative framework using graph theory within which a food web is represented by a directed graph, i.e., a collection of vertices (species or trophic species defined as sets of species sharing the same predators and prey) and directed edges (predation links). This framework allows us to identify apex (environmental "source" node) to outlet (top predators) subnetworks and compute the steady-state flux (e.g., carbon, nutrients, energy etc.) in the food web. We use this framework to (1) construct vulnerability maps that quantify the relative change of flux delivery to the top predators in response to perturbations in prey species (2) identify keystone species, whose loss would precipitate further species extinction, and (3) introduce a suite of graph-theoretic metrics to quantify the topologic (imposed by food web connectivity) and dynamic (dictated by the flux partitioning and distribution) components of a food web's complexity. By projecting food webs into a 2D Topodynamic Complexity Space whose coordinates are given by Number of alternative paths (topologic) and Leakage Index (dynamic), we show that this space provides a basis for food web comparison and provide physical insights into their dynamic behavior.
Survey of Approaches to Generate Realistic Synthetic Graphs
Lim, Seung-Hwan [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Lee, Sangkeun [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Powers, Sarah S [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Shankar, Mallikarjun [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Imam, Neena [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
2016-10-01
A graph is a flexible data structure that can represent relationships between entities. As with other data analysis tasks, the use of realistic graphs is critical to obtaining valid research results. Unfortunately, using the actual ("real-world") graphs for research and new algorithm development is difficult due to the presence of sensitive information in the data or due to the scale of data. This results in practitioners developing algorithms and systems that employ synthetic graphs instead of real-world graphs. Generating realistic synthetic graphs that provide reliable statistical confidence to algorithmic analysis and system evaluation involves addressing technical hurdles in a broad set of areas. This report surveys the state of the art in approaches to generate realistic graphs that are derived from fitted graph models on real-world graphs.
Graph-theoretic measures of multivariate association and prediction
Friedman, J.H.; Rafsky, L.C.
1983-01-01
Interpoint-distance-based graphs can be used to define measures of association that extend Kendall's notion of a generalized correlation coefficient. The authors present particular statistics that provide distribution-free tests of independence sensitive to alternatives involving non-monotonic relationships. Moreover, since ordering plays no essential role, the ideas that fully applicable in a multivariate setting. The authors also define an asymmetric coefficient measuring the extent to which (a vector) X can be used to make single-valued predictions of (a vector) Y. The authors discuss various techniques for proving that such statistics are asymptotically normal. As an example of the effectiveness of their approach, the authors present an application to the examination of residuals from multiple regression. 18 references, 2 figures, 1 table
Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
Furmańczyk Hanna
2016-09-01
Full Text Available In many applications in sequencing and scheduling it is desirable to have an underlaying graph as equitably colored as possible. In this paper we survey recent theoretical results concerning conditions for equitable colorability of some graphs and recent theoretical results concerning the complexity of equitable coloring problem. Next, since the general coloring problem is strongly NP-hard, we report on practical experiments with some efficient polynomial-time algorithms for approximate equitable coloring of general graphs.
Theoretical Approaches to Coping
Sofia Zyga
2013-01-01
Full Text Available Introduction: Dealing with stress requires conscious effort, it cannot be perceived as equal to individual's spontaneous reactions. The intentional management of stress must not be confused withdefense mechanisms. Coping differs from adjustment in that the latter is more general, has a broader meaning and includes diverse ways of facing a difficulty.Aim: An exploration of the definition of the term "coping", the function of the coping process as well as its differentiation from other similar meanings through a literature review.Methodology: Three theoretical approaches of coping are introduced; the psychoanalytic approach; approaching by characteristics; and the Lazarus and Folkman interactive model.Results: The strategic methods of the coping approaches are described and the article ends with a review of the approaches including the functioning of the stress-coping process , the classificationtypes of coping strategies in stress-inducing situations and with a criticism of coping approaches.Conclusions: The comparison of coping in different situations is difficult, if not impossible. The coping process is a slow process, so an individual may select one method of coping under one set ofcircumstances and a different strategy at some other time. Such selection of strategies takes place as the situation changes.
Graph theoretical analysis and application of fMRI-based brain network in Alzheimer's disease
LIU Xue-na
2012-08-01
Full Text Available Alzheimer's disease (AD, a progressive neurodegenerative disease, is clinically characterized by impaired memory and many other cognitive functions. However, the pathophysiological mechanisms underlying the disease are not thoroughly understood. In recent years, using functional magnetic resonance imaging (fMRI as well as advanced graph theory based network analysis approach, several studies of patients with AD suggested abnormal topological organization in both global and regional properties of functional brain networks, specifically, as demonstrated by a loss of small-world network characteristics. These studies provide novel insights into the pathophysiological mechanisms of AD and could be helpful in developing imaging biomarkers for disease diagnosis. In this paper we introduce the essential concepts of complex brain networks theory, and review recent advances of the study on human functional brain networks in AD, especially focusing on the graph theoretical analysis of small-world network based on fMRI. We also propound the existent problems and research orientation.
Systems information management: graph theoretical approach
Temel, T.
2006-01-01
This study proposes a new method for characterising the underlying information structure of a multi-sector system. A complete characterisation is accomplished by identifying information gaps and cause-effect information pathways in the system, and formulating critical testable hypotheses.
Quantitative graph theory mathematical foundations and applications
Dehmer, Matthias
2014-01-01
The first book devoted exclusively to quantitative graph theory, Quantitative Graph Theory: Mathematical Foundations and Applications presents and demonstrates existing and novel methods for analyzing graphs quantitatively. Incorporating interdisciplinary knowledge from graph theory, information theory, measurement theory, and statistical techniques, this book covers a wide range of quantitative-graph theoretical concepts and methods, including those pertaining to real and random graphs such as:Comparative approaches (graph similarity or distance)Graph measures to characterize graphs quantitat
An algebraic approach to graph codes
Pinero, Fernando
This thesis consists of six chapters. The first chapter, contains a short introduction to coding theory in which we explain the coding theory concepts we use. In the second chapter, we present the required theory for evaluation codes and also give an example of some fundamental codes in coding...... theory as evaluation codes. Chapter three consists of the introduction to graph based codes, such as Tanner codes and graph codes. In Chapter four, we compute the dimension of some graph based codes with a result combining graph based codes and subfield subcodes. Moreover, some codes in chapter four...
Xiaojin Li
2013-01-01
Full Text Available Previous studies have investigated both structural and functional brain networks via graph-theoretical methods. However, there is an important issue that has not been adequately discussed before: what is the optimal theoretical graph model for describing the structural networks of human brain? In this paper, we perform a comparative study to address this problem. Firstly, large-scale cortical regions of interest (ROIs are localized by recently developed and validated brain reference system named Dense Individualized Common Connectivity-based Cortical Landmarks (DICCCOL to address the limitations in the identification of the brain network ROIs in previous studies. Then, we construct structural brain networks based on diffusion tensor imaging (DTI data. Afterwards, the global and local graph properties of the constructed structural brain networks are measured using the state-of-the-art graph analysis algorithms and tools and are further compared with seven popular theoretical graph models. In addition, we compare the topological properties between two graph models, namely, stickiness-index-based model (STICKY and scale-free gene duplication model (SF-GD, that have higher similarity with the real structural brain networks in terms of global and local graph properties. Our experimental results suggest that among the seven theoretical graph models compared in this study, STICKY and SF-GD models have better performances in characterizing the structural human brain network.
Ponten, S.C.; Daffertshofer, A.; Hillebrand, A.; Stam, C.J.
2010-01-01
We investigated the relationship between structural network properties and both synchronization strength and functional characteristics in a combined neural mass and graph theoretical model of the electroencephalogram (EEG). Thirty-two neural mass models (NMMs), each representing the lump activity
ARTICLE Robust Diagnosis of Mechatronics System by Bond Graph Approach
Abderrahmene Sellami
2018-03-01
Full Text Available This article presents design of a robust diagnostic system based on bond graph model for a mechatronic system. Mechatronics is the synergistic and systemic combination of mechanics, electronics and computer science. The design of a mechatronic system modeled by the bond graph model becomes easier and more generous. The bond graph tool is a unified graphical language for all areas of engineering sciences and confirmed as a structured approach to modeling and simulation of multidisciplinary systems.
Extracting Gene Networks for Low-Dose Radiation Using Graph Theoretical Algorithms
Voy, Brynn H [ORNL; Scharff, Jon [University of Tennessee, Knoxville (UTK); Perkins, Andy [University of Tennessee, Knoxville (UTK); Saxton, Arnold [University of Tennessee, Knoxville (UTK); Borate, Bhavesh [University of Tennessee, Knoxville (UTK); Chesler, Elissa J [ORNL; Branstetter, Lisa R [ORNL; Langston, Michael A [University of Tennessee, Knoxville (UTK)
2006-01-01
Genes with common functions often exhibit correlated expression levels, which can be used to identify sets of interacting genes from microarray data. Microarrays typically measure expression across genomic space, creating a massive matrix of co-expression that must be mined to extract only the most relevant gene interactions. We describe a graph theoretical approach to extracting co-expressed sets of genes, based on the computation of cliques. Unlike the results of traditional clustering algorithms, cliques are not disjoint and allow genes to be assigned to multiple sets of interacting partners, consistent with biological reality. A graph is created by thresholding the correlation matrix to include only the correlations most likely to signify functional relationships. Cliques computed from the graph correspond to sets of genes for which significant edges are present between all members of the set, representing potential members of common or interacting pathways. Clique membership can be used to infer function about poorly annotated genes, based on the known functions of better-annotated genes with which they share clique membership (i.e., ''guilt-by-association''). We illustrate our method by applying it to microarray data collected from the spleens of mice exposed to low-dose ionizing radiation. Differential analysis is used to identify sets of genes whose interactions are impacted by radiation exposure. The correlation graph is also queried independently of clique to extract edges that are impacted by radiation. We present several examples of multiple gene interactions that are altered by radiation exposure and thus represent potential molecular pathways that mediate the radiation response.
Extracting gene networks for low-dose radiation using graph theoretical algorithms.
Brynn H Voy
2006-07-01
Full Text Available Genes with common functions often exhibit correlated expression levels, which can be used to identify sets of interacting genes from microarray data. Microarrays typically measure expression across genomic space, creating a massive matrix of co-expression that must be mined to extract only the most relevant gene interactions. We describe a graph theoretical approach to extracting co-expressed sets of genes, based on the computation of cliques. Unlike the results of traditional clustering algorithms, cliques are not disjoint and allow genes to be assigned to multiple sets of interacting partners, consistent with biological reality. A graph is created by thresholding the correlation matrix to include only the correlations most likely to signify functional relationships. Cliques computed from the graph correspond to sets of genes for which significant edges are present between all members of the set, representing potential members of common or interacting pathways. Clique membership can be used to infer function about poorly annotated genes, based on the known functions of better-annotated genes with which they share clique membership (i.e., "guilt-by-association". We illustrate our method by applying it to microarray data collected from the spleens of mice exposed to low-dose ionizing radiation. Differential analysis is used to identify sets of genes whose interactions are impacted by radiation exposure. The correlation graph is also queried independently of clique to extract edges that are impacted by radiation. We present several examples of multiple gene interactions that are altered by radiation exposure and thus represent potential molecular pathways that mediate the radiation response.
Information Retrieval and Graph Analysis Approaches for Book Recommendation
Chahinez Benkoussas
2015-01-01
Full Text Available A combination of multiple information retrieval approaches is proposed for the purpose of book recommendation. In this paper, book recommendation is based on complex user's query. We used different theoretical retrieval models: probabilistic as InL2 (Divergence from Randomness model and language model and tested their interpolated combination. Graph analysis algorithms such as PageRank have been successful in Web environments. We consider the application of this algorithm in a new retrieval approach to related document network comprised of social links. We called Directed Graph of Documents (DGD a network constructed with documents and social information provided from each one of them. Specifically, this work tackles the problem of book recommendation in the context of INEX (Initiative for the Evaluation of XML retrieval Social Book Search track. A series of reranking experiments demonstrate that combining retrieval models yields significant improvements in terms of standard ranked retrieval metrics. These results extend the applicability of link analysis algorithms to different environments.
Visibility graph approach to exchange rate series
Yang, Yue; Wang, Jianbo; Yang, Huijie; Mang, Jingshi
2009-10-01
By means of a visibility graph, we investigate six important exchange rate series. It is found that the series convert into scale-free and hierarchically structured networks. The relationship between the scaling exponents of the degree distributions and the Hurst exponents obeys the analytical prediction for fractal Brownian motions. The visibility graph can be used to obtain reliable values of Hurst exponents of the series. The characteristics are explained by using the multifractal structures of the series. The exchange rate of EURO to Japanese Yen is widely used to evaluate risk and to estimate trends in speculative investments. Interestingly, the hierarchies of the visibility graphs for the exchange rate series of these two currencies are significantly weak compared with that of the other series.
Guidelines for a graph-theoretic implementation of structural equation modeling
Grace, James B.; Schoolmaster, Donald R.; Guntenspergen, Glenn R.; Little, Amanda M.; Mitchell, Brian R.; Miller, Kathryn M.; Schweiger, E. William
2012-01-01
Structural equation modeling (SEM) is increasingly being chosen by researchers as a framework for gaining scientific insights from the quantitative analyses of data. New ideas and methods emerging from the study of causality, influences from the field of graphical modeling, and advances in statistics are expanding the rigor, capability, and even purpose of SEM. Guidelines for implementing the expanded capabilities of SEM are currently lacking. In this paper we describe new developments in SEM that we believe constitute a third-generation of the methodology. Most characteristic of this new approach is the generalization of the structural equation model as a causal graph. In this generalization, analyses are based on graph theoretic principles rather than analyses of matrices. Also, new devices such as metamodels and causal diagrams, as well as an increased emphasis on queries and probabilistic reasoning, are now included. Estimation under a graph theory framework permits the use of Bayesian or likelihood methods. The guidelines presented start from a declaration of the goals of the analysis. We then discuss how theory frames the modeling process, requirements for causal interpretation, model specification choices, selection of estimation method, model evaluation options, and use of queries, both to summarize retrospective results and for prospective analyses. The illustrative example presented involves monitoring data from wetlands on Mount Desert Island, home of Acadia National Park. Our presentation walks through the decision process involved in developing and evaluating models, as well as drawing inferences from the resulting prediction equations. In addition to evaluating hypotheses about the connections between human activities and biotic responses, we illustrate how the structural equation (SE) model can be queried to understand how interventions might take advantage of an environmental threshold to limit Typha invasions. The guidelines presented provide for
Using graph approach for managing connectivity in integrative landscape modelling
Rabotin, Michael; Fabre, Jean-Christophe; Libres, Aline; Lagacherie, Philippe; Crevoisier, David; Moussa, Roger
2013-04-01
In cultivated landscapes, a lot of landscape elements such as field boundaries, ditches or banks strongly impact water flows, mass and energy fluxes. At the watershed scale, these impacts are strongly conditionned by the connectivity of these landscape elements. An accurate representation of these elements and of their complex spatial arrangements is therefore of great importance for modelling and predicting these impacts.We developped in the framework of the OpenFLUID platform (Software Environment for Modelling Fluxes in Landscapes) a digital landscape representation that takes into account the spatial variabilities and connectivities of diverse landscape elements through the application of the graph theory concepts. The proposed landscape representation consider spatial units connected together to represent the flux exchanges or any other information exchanges. Each spatial unit of the landscape is represented as a node of a graph and relations between units as graph connections. The connections are of two types - parent-child connection and up/downstream connection - which allows OpenFLUID to handle hierarchical graphs. Connections can also carry informations and graph evolution during simulation is possible (connections or elements modifications). This graph approach allows a better genericity on landscape representation, a management of complex connections and facilitate development of new landscape representation algorithms. Graph management is fully operational in OpenFLUID for developers or modelers ; and several graph tools are available such as graph traversal algorithms or graph displays. Graph representation can be managed i) manually by the user (for example in simple catchments) through XML-based files in easily editable and readable format or ii) by using methods of the OpenFLUID-landr library which is an OpenFLUID library relying on common open-source spatial libraries (ogr vector, geos topologic vector and gdal raster libraries). Open
Theoretical approaches to elections defining
Natalya V. Lebedeva
2011-01-01
Theoretical approaches to elections defining develop the nature, essence and content of elections, help to determine their place and a role as one of the major national law institutions in democratic system.
Theoretical approaches to elections defining
Natalya V. Lebedeva
2011-01-01
Full Text Available Theoretical approaches to elections defining develop the nature, essence and content of elections, help to determine their place and a role as one of the major national law institutions in democratic system.
Graph Theoretical Analysis Reveals: Women's Brains Are Better Connected than Men's.
Balázs Szalkai
Full Text Available Deep graph-theoretic ideas in the context with the graph of the World Wide Web led to the definition of Google's PageRank and the subsequent rise of the most popular search engine to date. Brain graphs, or connectomes, are being widely explored today. We believe that non-trivial graph theoretic concepts, similarly as it happened in the case of the World Wide Web, will lead to discoveries enlightening the structural and also the functional details of the animal and human brains. When scientists examine large networks of tens or hundreds of millions of vertices, only fast algorithms can be applied because of the size constraints. In the case of diffusion MRI-based structural human brain imaging, the effective vertex number of the connectomes, or brain graphs derived from the data is on the scale of several hundred today. That size facilitates applying strict mathematical graph algorithms even for some hard-to-compute (or NP-hard quantities like vertex cover or balanced minimum cut. In the present work we have examined brain graphs, computed from the data of the Human Connectome Project, recorded from male and female subjects between ages 22 and 35. Significant differences were found between the male and female structural brain graphs: we show that the average female connectome has more edges, is a better expander graph, has larger minimal bisection width, and has more spanning trees than the average male connectome. Since the average female brain weighs less than the brain of males, these properties show that the female brain has better graph theoretical properties, in a sense, than the brain of males. It is known that the female brain has a smaller gray matter/white matter ratio than males, that is, a larger white matter/gray matter ratio than the brain of males; this observation is in line with our findings concerning the number of edges, since the white matter consists of myelinated axons, which, in turn, roughly correspond to the connections
A hierarchical approach to reducing communication in parallel graph algorithms
Harshvardhan,
2015-01-01
Large-scale graph computing has become critical due to the ever-increasing size of data. However, distributed graph computations are limited in their scalability and performance due to the heavy communication inherent in such computations. This is exacerbated in scale-free networks, such as social and web graphs, which contain hub vertices that have large degrees and therefore send a large number of messages over the network. Furthermore, many graph algorithms and computations send the same data to each of the neighbors of a vertex. Our proposed approach recognizes this, and reduces communication performed by the algorithm without change to user-code, through a hierarchical machine model imposed upon the input graph. The hierarchical model takes advantage of locale information of the neighboring vertices to reduce communication, both in message volume and total number of bytes sent. It is also able to better exploit the machine hierarchy to further reduce the communication costs, by aggregating traffic between different levels of the machine hierarchy. Results of an implementation in the STAPL GL shows improved scalability and performance over the traditional level-synchronous approach, with 2.5 × - 8× improvement for a variety of graph algorithms at 12, 000+ cores.
A graph theoretical perspective of a drug abuse epidemic model
Nyabadza, F.; Mukwembi, S.; Rodrigues, B. G.
2011-05-01
A drug use epidemic can be represented by a finite number of states and transition rules that govern the dynamics of drug use in each discrete time step. This paper investigates the spread of drug use in a community where some users are in treatment and others are not in treatment, citing South Africa as an example. In our analysis, we consider the neighbourhood prevalence of each individual, i.e., the proportion of the individual’s drug user contacts who are not in treatment amongst all of his or her contacts. We introduce parameters α∗, β∗ and γ∗, depending on the neighbourhood prevalence, which govern the spread of drug use. We examine how changes in α∗, β∗ and γ∗ affect the system dynamics. Simulations presented support the theoretical results.
Theoretical Bound of CRLB for Energy Efficient Technique of RSS-Based Factor Graph Geolocation
Kahar Aziz, Muhammad Reza; Heriansyah; Saputra, EfaMaydhona; Musa, Ardiansyah
2018-03-01
To support the increase of wireless geolocation development as the key of the technology in the future, this paper proposes theoretical bound derivation, i.e., Cramer Rao lower bound (CRLB) for energy efficient of received signal strength (RSS)-based factor graph wireless geolocation technique. The theoretical bound derivation is crucially important to evaluate whether the energy efficient technique of RSS-based factor graph wireless geolocation is effective as well as to open the opportunity to further innovation of the technique. The CRLB is derived in this paper by using the Fisher information matrix (FIM) of the main formula of the RSS-based factor graph geolocation technique, which is lied on the Jacobian matrix. The simulation result shows that the derived CRLB has the highest accuracy as a bound shown by its lowest root mean squared error (RMSE) curve compared to the RMSE curve of the RSS-based factor graph geolocation technique. Hence, the derived CRLB becomes the lower bound for the efficient technique of RSS-based factor graph wireless geolocation.
Graph theoretical calculation of systems reliability with semi-Markov processes
Widmer, U.
1984-06-01
The determination of the state probabilities and related quantities of a system characterized by an SMP (or a homogeneous MP) can be performed by means of graph-theoretical methods. The calculation procedures for semi-Markov processes based on signal flow graphs are reviewed. Some methods from electrotechnics are adapted in order to obtain a representation of the state probabilities by means of trees. From this some formulas are derived for the asymptotic state probabilities and for the mean life-time in reliability considerations. (Auth.)
Use of Graph-Theoretic Models in Technological Preparation of Assembly Plant
Peter Franzevich Yurchik
2015-05-01
Full Text Available The article examines the existing ways of describing the structural and technological properties of the product in the process of building and repair. It turned out that the main body of work on the preparation process of assembling production uses graph-theoretic model of the product. It is shown that, in general, the structural integrity of many-form connections and relations on the set of components that can not be adequately described by binary structures, such as graphs, networks or trees.
Kwon, Oh-Hyun; Crnovrsanin, Tarik; Ma, Kwan-Liu
2018-01-01
Using different methods for laying out a graph can lead to very different visual appearances, with which the viewer perceives different information. Selecting a "good" layout method is thus important for visualizing a graph. The selection can be highly subjective and dependent on the given task. A common approach to selecting a good layout is to use aesthetic criteria and visual inspection. However, fully calculating various layouts and their associated aesthetic metrics is computationally expensive. In this paper, we present a machine learning approach to large graph visualization based on computing the topological similarity of graphs using graph kernels. For a given graph, our approach can show what the graph would look like in different layouts and estimate their corresponding aesthetic metrics. An important contribution of our work is the development of a new framework to design graph kernels. Our experimental study shows that our estimation calculation is considerably faster than computing the actual layouts and their aesthetic metrics. Also, our graph kernels outperform the state-of-the-art ones in both time and accuracy. In addition, we conducted a user study to demonstrate that the topological similarity computed with our graph kernel matches perceptual similarity assessed by human users.
Huang, Xiaoke; Zhao, Ye; Yang, Jing; Zhang, Chong; Ma, Chao; Ye, Xinyue
2016-01-01
We propose TrajGraph, a new visual analytics method, for studying urban mobility patterns by integrating graph modeling and visual analysis with taxi trajectory data. A special graph is created to store and manifest real traffic information recorded by taxi trajectories over city streets. It conveys urban transportation dynamics which can be discovered by applying graph analysis algorithms. To support interactive, multiscale visual analytics, a graph partitioning algorithm is applied to create region-level graphs which have smaller size than the original street-level graph. Graph centralities, including Pagerank and betweenness, are computed to characterize the time-varying importance of different urban regions. The centralities are visualized by three coordinated views including a node-link graph view, a map view and a temporal information view. Users can interactively examine the importance of streets to discover and assess city traffic patterns. We have implemented a fully working prototype of this approach and evaluated it using massive taxi trajectories of Shenzhen, China. TrajGraph's capability in revealing the importance of city streets was evaluated by comparing the calculated centralities with the subjective evaluations from a group of drivers in Shenzhen. Feedback from a domain expert was collected. The effectiveness of the visual interface was evaluated through a formal user study. We also present several examples and a case study to demonstrate the usefulness of TrajGraph in urban transportation analysis.
Theoretical Approaches to Political Communication.
Chesebro, James W.
Political communication appears to be emerging as a theoretical and methodological academic area of research within both speech-communication and political science. Five complimentary approaches to political science (Machiavellian, iconic, ritualistic, confirmational, and dramatistic) may be viewed as a series of variations which emphasize the…
Genecentric: a package to uncover graph-theoretic structure in high-throughput epistasis data
Gallant, Andrew; Leiserson, Mark DM; Kachalov, Maxim; Cowen, Lenore J; Hescott, Benjamin J
2013-01-01
Background New technology has resulted in high-throughput screens for pairwise genetic interactions in yeast and other model organisms. For each pair in a collection of non-essential genes, an epistasis score is obtained, representing how much sicker (or healthier) the double-knockout organism will be compared to what would be expected from the sickness of the component single knockouts. Recent algorithmic work has identified graph-theoretic patterns in this data that can indicate functional ...
Engineering system dynamics a unified graph-centered approach
Brown, Forbes T
2006-01-01
For today's students, learning to model the dynamics of complex systems is increasingly important across nearly all engineering disciplines. First published in 2001, Forbes T. Brown's Engineering System Dynamics: A Unified Graph-Centered Approach introduced students to a unique and highly successful approach to modeling system dynamics using bond graphs. Updated with nearly one-third new material, this second edition expands this approach to an even broader range of topics. What's New in the Second Edition? In addition to new material, this edition was restructured to build students' competence in traditional linear mathematical methods before they have gone too far into the modeling that still plays a pivotal role. New topics include magnetic circuits and motors including simulation with magnetic hysteresis; extensive new material on the modeling, analysis, and simulation of distributed-parameter systems; kinetic energy in thermodynamic systems; and Lagrangian and Hamiltonian methods. MATLAB(R) figures promi...
Theoretical issues in quantum computing: Graph isomorphism, PageRank, and Hamiltonian determination
Rudinger, Kenneth Michael
This thesis explores several theoretical questions pertaining to quantum computing. First we examine several questions regarding multi-particle quantum random walk-based algorithms for the graph isomorphism problem. We find that there exists a non-trivial difference between continuous-time walks of one and two non-interacting particles as compared to non-interacting walks of three or more particles, in that the latter are able to distinguish many strongly regular graphs (SRGs), a class of graphs with many graph pairs that are difficult to distinguish. We demonstrate analytically where this distinguishing power comes from, and we show numerically that three-particle and four-particle non-interacting continuous-time walks can distinguish many pairs of strongly regular graphs. We additionally show that this distinguishing power, while it grows with particle number, is bounded, so that no continuous-time non-interacting walk of fixed particle number can distinguish all strongly regular graphs. We then investigate the relationship between continuous-time and discrete-time walks, in the context of the graph isomorphism problem. While it has been previously demonstrated numerically that discrete-time walks of non-interacting particles can distinguish some SRGs, we demonstrate where this distinguishing power comes from. We also show that while no continuous-time non-interacting walk of fixed particle number can distinguish SRGs, it remains a possibility that such a discrete-time walk could, leaving open the possibility of a non-trivial difference between discrete-time and continuous-time walks. The last piece of our work on graph isomorphism examines limitations on certain kinds of continuous-time walk-based algorithms for distinguishing graphs. We show that a very general class of continuous-time walk algorithms, with a broad class of allowable interactions, cannot distinguish all graphs. We next consider a previously-proposed quantum adiabatic algorithm for computing the
State space model extraction of thermohydraulic systems – Part I: A linear graph approach
Uren, K.R.; Schoor, G. van
2013-01-01
Thermohydraulic simulation codes are increasingly making use of graphical design interfaces. The user can quickly and easily design a thermohydraulic system by placing symbols on the screen resembling system components. These components can then be connected to form a system representation. Such system models may then be used to obtain detailed simulations of the physical system. Usually this kind of simulation models are too complex and not ideal for control system design. Therefore, a need exists for automated techniques to extract lumped parameter models useful for control system design. The goal of this first paper, in a two part series, is to propose a method that utilises a graphical representation of a thermohydraulic system, and a lumped parameter modelling approach, to extract state space models. In this methodology each physical domain of the thermohydraulic system is represented by a linear graph. These linear graphs capture the interaction between all components within and across energy domains – hydraulic, thermal and mechanical. These linear graphs are analysed using a graph-theoretic approach to derive reduced order state space models. These models capture the dominant dynamics of the thermohydraulic system and are ideal for control system design purposes. The proposed state space model extraction method is demonstrated by considering a U-tube system. A non-linear state space model is extracted representing both the hydraulic and thermal domain dynamics of the system. The simulated state space model is compared with a Flownex ® model of the U-tube. Flownex ® is a validated systems thermal-fluid simulation software package. - Highlights: • A state space model extraction methodology based on graph-theoretic concepts. • An energy-based approach to consider multi-domain systems in a common framework. • Allow extraction of transparent (white-box) state space models automatically. • Reduced order models containing only independent state
An approach to multiscale modelling with graph grammars.
Ong, Yongzhi; Streit, Katarína; Henke, Michael; Kurth, Winfried
2014-09-01
Functional-structural plant models (FSPMs) simulate biological processes at different spatial scales. Methods exist for multiscale data representation and modification, but the advantages of using multiple scales in the dynamic aspects of FSPMs remain unclear. Results from multiscale models in various other areas of science that share fundamental modelling issues with FSPMs suggest that potential advantages do exist, and this study therefore aims to introduce an approach to multiscale modelling in FSPMs. A three-part graph data structure and grammar is revisited, and presented with a conceptual framework for multiscale modelling. The framework is used for identifying roles, categorizing and describing scale-to-scale interactions, thus allowing alternative approaches to model development as opposed to correlation-based modelling at a single scale. Reverse information flow (from macro- to micro-scale) is catered for in the framework. The methods are implemented within the programming language XL. Three example models are implemented using the proposed multiscale graph model and framework. The first illustrates the fundamental usage of the graph data structure and grammar, the second uses probabilistic modelling for organs at the fine scale in order to derive crown growth, and the third combines multiscale plant topology with ozone trends and metabolic network simulations in order to model juvenile beech stands under exposure to a toxic trace gas. The graph data structure supports data representation and grammar operations at multiple scales. The results demonstrate that multiscale modelling is a viable method in FSPM and an alternative to correlation-based modelling. Advantages and disadvantages of multiscale modelling are illustrated by comparisons with single-scale implementations, leading to motivations for further research in sensitivity analysis and run-time efficiency for these models.
Theoretical Approaches to Nuclear Proliferation
Konstantin S. Tarasov
2015-01-01
Full Text Available This article analyses discussions between representatives of three schools in the theory of international relations - realism, liberalism and constructivism - on the driving factors of nuclear proliferation. The paper examines major theoretical approaches, outlined in the studies of Russian and foreign scientists, to the causes of nuclear weapons development, while unveiling their advantages and limitations. Much of the article has been devoted to alternative approaches, particularly, the role of mathematical modeling in assessing proliferation risks. The analysis also reveals a variety of different approaches to nuclear weapons acquisition, as well as the absence of a comprehensive proliferation theory. Based on the research results the study uncovers major factors both favoring and impeding nuclear proliferation. The author shows that the lack of consensus between realists, liberals and constructivists on the nature of proliferation led a number of scientists to an attempt to explain nuclear rationale by drawing from the insights of more than one school in the theory of IR. Detailed study of the proliferation puzzle contributes to a greater understating of contemporary international realities, helps to identify mechanisms that are most likely to deter states from obtaining nuclear weapons and is of the outmost importance in predicting short- and long-term security environment. Furthermore, analysis of the existing scientific literature on nuclear proliferation helps to determine future research agenda of the subject at hand.
Artistic image analysis using graph-based learning approaches.
Carneiro, Gustavo
2013-08-01
We introduce a new methodology for the problem of artistic image analysis, which among other tasks, involves the automatic identification of visual classes present in an art work. In this paper, we advocate the idea that artistic image analysis must explore a graph that captures the network of artistic influences by computing the similarities in terms of appearance and manual annotation. One of the novelties of our methodology is the proposed formulation that is a principled way of combining these two similarities in a single graph. Using this graph, we show that an efficient random walk algorithm based on an inverted label propagation formulation produces more accurate annotation and retrieval results compared with the following baseline algorithms: bag of visual words, label propagation, matrix completion, and structural learning. We also show that the proposed approach leads to a more efficient inference and training procedures. This experiment is run on a database containing 988 artistic images (with 49 visual classification problems divided into a multiclass problem with 27 classes and 48 binary problems), where we show the inference and training running times, and quantitative comparisons with respect to several retrieval and annotation performance measures.
Randic, M.; Wilkins, C.L.
1979-01-01
Selected molecular data on alkanes have been reexamined in a search for general regularities in isomeric variations. In contrast to the prevailing approaches concerned with fitting data by searching for optimal parameterization, the present work is primarily aimed at established trends, i.e., searching for relative magnitudes and their regularities among the isomers. Such an approach is complementary to curve fitting or correlation seeking procedures. It is particularly useful when there are incomplete data which allow trends to be recognized but no quantitative correlation to be established. One proceeds by first ordering structures. One way is to consider molecular graphs and enumerate paths of different length as the basic graph invariant. It can be shown that, for several thermodynamic molecular properties, the number of paths of length two (p 2 ) and length three (p 3 ) are critical. Hence, an ordering based on p 2 and p 3 indicates possible trends and behavior for many molecular properties, some of which relate to others, some which do not. By considering a grid graph derived by attributing to each isomer coordinates (p 2 ,p 3 ) and connecting points along the coordinate axis, one obtains a simple presentation useful for isomer structural interrelations. This skeletal frame is one upon which possible trends for different molecular properties may be conveniently represented. The significance of the results and their conceptual value is discussed. 16 figures, 3 tables
Tammy M K Cheng
Full Text Available Recent analyses of human genome sequences have given rise to impressive advances in identifying non-synonymous single nucleotide polymorphisms (nsSNPs. By contrast, the annotation of nsSNPs and their links to diseases are progressing at a much slower pace. Many of the current approaches to analysing disease-associated nsSNPs use primarily sequence and evolutionary information, while structural information is relatively less exploited. In order to explore the potential of such information, we developed a structure-based approach, Bongo (Bonds ON Graph, to predict structural effects of nsSNPs. Bongo considers protein structures as residue-residue interaction networks and applies graph theoretical measures to identify the residues that are critical for maintaining structural stability by assessing the consequences on the interaction network of single point mutations. Our results show that Bongo is able to identify mutations that cause both local and global structural effects, with a remarkably low false positive rate. Application of the Bongo method to the prediction of 506 disease-associated nsSNPs resulted in a performance (positive predictive value, PPV, 78.5% similar to that of PolyPhen (PPV, 77.2% and PANTHER (PPV, 72.2%. As the Bongo method is solely structure-based, our results indicate that the structural changes resulting from nsSNPs are closely associated to their pathological consequences.
An unprecedented multi attribute decision making using graph theory matrix approach
N.K. Geetha
2018-02-01
Full Text Available A frame work for investigating the best combination of functioning parameters on a variable compression ratio diesel engine is proposed in the present study using a multi attribute optimization methodology, Graph Theory Matrix Approach. The functioning parameters, attributes, sub attributes and functioning variables of sub attributes are chosen based on expert’s opinion and literature review. The directed graphs are developed for attributes and sub attributes. The ‘Parameter Index’ was calculated for all trials to choose the best trial. The experimental results are verified with the theoretical data. Functioning parameters with combination of compression ratio of 17, fuel injection pressure of 20 N/mm2 and fuel injection pressure of 21°bTDC was found to be best. The proposed method allows the decision maker to systematically and logically find the best combination of functioning parameters.
A Hybrid Approach to Processing Big Data Graphs on Memory-Restricted Systems
Harshvardhan,; West, Brandon; Fidel, Adam; Amato, Nancy M.; Rauchwerger, Lawrence
2015-01-01
that sacrifice performance. In this work, we propose a novel RAM-Disk hybrid approach to graph processing that can scale well from a single shared-memory node to large distributed-memory systems. It works by partitioning the graph into sub graphs that fit in RAM
Roy, Priyanka; Gholami, Peyman; Kuppuswamy Parthasarathy, Mohana; Zelek, John; Lakshminarayanan, Vasudevan
2018-02-01
Segmentation of spectral-domain Optical Coherence Tomography (SD-OCT) images facilitates visualization and quantification of sub-retinal layers for diagnosis of retinal pathologies. However, manual segmentation is subjective, expertise dependent, and time-consuming, which limits applicability of SD-OCT. Efforts are therefore being made to implement active-contours, artificial intelligence, and graph-search to automatically segment retinal layers with accuracy comparable to that of manual segmentation, to ease clinical decision-making. Although, low optical contrast, heavy speckle noise, and pathologies pose challenges to automated segmentation. Graph-based image segmentation approach stands out from the rest because of its ability to minimize the cost function while maximising the flow. This study has developed and implemented a shortest-path based graph-search algorithm for automated intraretinal layer segmentation of SD-OCT images. The algorithm estimates the minimal-weight path between two graph-nodes based on their gradients. Boundary position indices (BPI) are computed from the transition between pixel intensities. The mean difference between BPIs of two consecutive layers quantify individual layer thicknesses, which shows statistically insignificant differences when compared to a previous study [for overall retina: p = 0.17, for individual layers: p > 0.05 (except one layer: p = 0.04)]. These results substantiate the accurate delineation of seven intraretinal boundaries in SD-OCT images by this algorithm, with a mean computation time of 0.93 seconds (64-bit Windows10, core i5, 8GB RAM). Besides being self-reliant for denoising, the algorithm is further computationally optimized to restrict segmentation within the user defined region-of-interest. The efficiency and reliability of this algorithm, even in noisy image conditions, makes it clinically applicable.
A Community-Aware Approach to Minimizing Dissemination in Graphs
Zhang, Chuxu
2017-08-02
Given a graph, can we minimize the spread of an entity (such as a meme or a virus) while maintaining the graph’s community structure (defined as groups of nodes with denser intra-connectivity than inter-connectivity)? At first glance, these two objectives seem at odds with each other. To minimize dissemination, nodes or links are often deleted to reduce the graph’s connectivity. These deletions can (and often do) destroy the graph’s community structure, which is an important construct in real-world settings (e.g., communities promote trust among their members). We utilize rewiring of links to achieve both objectives. Examples of rewiring in real life are prevalent, such as purchasing products from a new farm since the local farm has signs of mad cow disease; getting information from a new source after a disaster since your usual source is no longer available, etc. Our community-aware approach, called constrCRlink (short for Constraint Community Relink), preserves (on average) 98.6% of the efficacy of the best community-agnostic link-deletion approach (namely, NetMelt+), but changes the original community structure of the graph by only 4.5%. In contrast, NetMelt+ changes 13.6% of the original community structure.
The graph-theoretic minimum energy path problem for ionic conduction
Ippei Kishida
2015-10-01
Full Text Available A new computational method was developed to analyze the ionic conduction mechanism in crystals through graph theory. The graph was organized into nodes, which represent the crystal structures modeled by ionic site occupation, and edges, which represent structure transitions via ionic jumps. We proposed a minimum energy path problem, which is similar to the shortest path problem. An effective algorithm to solve the problem was established. Since our method does not use randomized algorithm and time parameters, the computational cost to analyze conduction paths and a migration energy is very low. The power of the method was verified by applying it to α-AgI and the ionic conduction mechanism in α-AgI was revealed. The analysis using single point calculations found the minimum energy path for long-distance ionic conduction, which consists of 12 steps of ionic jumps in a unit cell. From the results, the detailed theoretical migration energy was calculated as 0.11 eV by geometry optimization and nudged elastic band method. Our method can refine candidates for possible jumps in crystals and it can be adapted to other computational methods, such as the nudged elastic band method. We expect that our method will be a powerful tool for analyzing ionic conduction mechanisms, even for large complex crystals.
Graph approach to the gradient expansion of density functionals
Kozlowski, P.M.; Nalewajski, R.F.
1986-01-01
A graph representation of terms in the gradient expansion of the kinetic energy density functional is presented. They briefly discuss the implications of the virial theorem for the graph structure and relations between possible graphs at a given order of expansion
Seiller, Thomas
2016-01-01
Interaction graphs were introduced as a general, uniform, construction of dynamic models of linear logic, encompassing all Geometry of Interaction (GoI) constructions introduced so far. This series of work was inspired from Girard's hyperfinite GoI, and develops a quantitative approach that should...... be understood as a dynamic version of weighted relational models. Until now, the interaction graphs framework has been shown to deal with exponentials for the constrained system ELL (Elementary Linear Logic) while keeping its quantitative aspect. Adapting older constructions by Girard, one can clearly define...... "full" exponentials, but at the cost of these quantitative features. We show here that allowing interpretations of proofs to use continuous (yet finite in a measure-theoretic sense) sets of states, as opposed to earlier Interaction Graphs constructions were these sets of states were discrete (and finite...
Theoretical Approaches to Lignin Chemistry
Shevchenko, Sergey M.
1994-01-01
A critical review is presented of the applications of theoretical methods to the studies of the structure and chemical reactivity of lignin, including simulation of macromolecular properties, conformational calculations, quantum chemical analyses of electronic structure, spectra and chemical reactivity. Modern concepts of spatial organization and chemical reactivity of lignins are discussed.
Pogliani, Lionello
2010-01-30
Twelve properties of a highly heterogeneous class of organic solvents have been modeled with a graph-theoretical molecular connectivity modified (MC) method, which allows to encode the core electrons and the hydrogen atoms. The graph-theoretical method uses the concepts of simple, general, and complete graphs, where these last types of graphs are used to encode the core electrons. The hydrogen atoms have been encoded by the aid of a graph-theoretical perturbation parameter, which contributes to the definition of the valence delta, delta(v), a key parameter in molecular connectivity studies. The model of the twelve properties done with a stepwise search algorithm is always satisfactory, and it allows to check the influence of the hydrogen content of the solvent molecules on the choice of the type of descriptor. A similar argument holds for the influence of the halogen atoms on the type of core electron representation. In some cases the molar mass, and in a minor way, special "ad hoc" parameters have been used to improve the model. A very good model of the surface tension could be obtained by the aid of five experimental parameters. A mixed model method based on experimental parameters plus molecular connectivity indices achieved, instead, to consistently improve the model quality of five properties. To underline is the importance of the boiling point temperatures as descriptors in these last two model methodologies. Copyright 2009 Wiley Periodicals, Inc.
Zhang, L.-C.; Patone, M.
2017-01-01
We synthesise the existing theory of graph sampling. We propose a formal definition of sampling in finite graphs, and provide a classification of potential graph parameters. We develop a general approach of Horvitz–Thompson estimation to T-stage snowball sampling, and present various reformulations of some common network sampling methods in the literature in terms of the outlined graph sampling theory.
PAGANI Toolkit: Parallel graph-theoretical analysis package for brain network big data.
Du, Haixiao; Xia, Mingrui; Zhao, Kang; Liao, Xuhong; Yang, Huazhong; Wang, Yu; He, Yong
2018-05-01
The recent collection of unprecedented quantities of neuroimaging data with high spatial resolution has led to brain network big data. However, a toolkit for fast and scalable computational solutions is still lacking. Here, we developed the PArallel Graph-theoretical ANalysIs (PAGANI) Toolkit based on a hybrid central processing unit-graphics processing unit (CPU-GPU) framework with a graphical user interface to facilitate the mapping and characterization of high-resolution brain networks. Specifically, the toolkit provides flexible parameters for users to customize computations of graph metrics in brain network analyses. As an empirical example, the PAGANI Toolkit was applied to individual voxel-based brain networks with ∼200,000 nodes that were derived from a resting-state fMRI dataset of 624 healthy young adults from the Human Connectome Project. Using a personal computer, this toolbox completed all computations in ∼27 h for one subject, which is markedly less than the 118 h required with a single-thread implementation. The voxel-based functional brain networks exhibited prominent small-world characteristics and densely connected hubs, which were mainly located in the medial and lateral fronto-parietal cortices. Moreover, the female group had significantly higher modularity and nodal betweenness centrality mainly in the medial/lateral fronto-parietal and occipital cortices than the male group. Significant correlations between the intelligence quotient and nodal metrics were also observed in several frontal regions. Collectively, the PAGANI Toolkit shows high computational performance and good scalability for analyzing connectome big data and provides a friendly interface without the complicated configuration of computing environments, thereby facilitating high-resolution connectomics research in health and disease. © 2018 Wiley Periodicals, Inc.
Machine learning a theoretical approach
Natarajan, Balas K
2014-01-01
This is the first comprehensive introduction to computational learning theory. The author's uniform presentation of fundamental results and their applications offers AI researchers a theoretical perspective on the problems they study. The book presents tools for the analysis of probabilistic models of learning, tools that crisply classify what is and is not efficiently learnable. After a general introduction to Valiant's PAC paradigm and the important notion of the Vapnik-Chervonenkis dimension, the author explores specific topics such as finite automata and neural networks. The presentation
A Hybrid Approach to Processing Big Data Graphs on Memory-Restricted Systems
Harshvardhan,
2015-05-01
With the advent of big-data, processing large graphs quickly has become increasingly important. Most existing approaches either utilize in-memory processing techniques that can only process graphs that fit completely in RAM, or disk-based techniques that sacrifice performance. In this work, we propose a novel RAM-Disk hybrid approach to graph processing that can scale well from a single shared-memory node to large distributed-memory systems. It works by partitioning the graph into sub graphs that fit in RAM and uses a paging-like technique to load sub graphs. We show that without modifying the algorithms, this approach can scale from small memory-constrained systems (such as tablets) to large-scale distributed machines with 16, 000+ cores.
A hierarchical approach to reducing communication in parallel graph algorithms
Harshvardhan,; Amato, Nancy M.; Rauchwerger, Lawrence
2015-01-01
. This is exacerbated in scale-free networks, such as social and web graphs, which contain hub vertices that have large degrees and therefore send a large number of messages over the network. Furthermore, many graph algorithms and computations send the same data to each
A Qualitative Approach to Sketch the Graph of a Function.
Alson, Pedro
1992-01-01
Presents a qualitative and global method of graphing functions that involves transformations of the graph of a known function in the cartesian coordinate system referred to as graphic operators. Explains how the method has been taught to students and some comments about the results obtained. (MDH)
Graph theoretical stable allocation as a tool for reproduction of control by human operators
van Nooijen, Ronald; Ertsen, Maurits; Kolechkina, Alla
2016-04-01
During the design of central control algorithms for existing water resource systems under manual control it is important to consider the interaction with parts of the system that remain under manual control and to compare the proposed new system with the existing manual methods. In graph theory the "stable allocation" problem has good solution algorithms and allows for formulation of flow distribution problems in terms of priorities. As a test case for the use of this approach we used the algorithm to derive water allocation rules for the Gezira Scheme, an irrigation system located between the Blue and White Niles south of Khartoum. In 1925, Gezira started with 300,000 acres; currently it covers close to two million acres.
Guimarães Katia S
2006-04-01
Full Text Available Abstract Background Most cellular processes are carried out by multi-protein complexes, groups of proteins that bind together to perform a specific task. Some proteins form stable complexes, while other proteins form transient associations and are part of several complexes at different stages of a cellular process. A better understanding of this higher-order organization of proteins into overlapping complexes is an important step towards unveiling functional and evolutionary mechanisms behind biological networks. Results We propose a new method for identifying and representing overlapping protein complexes (or larger units called functional groups within a protein interaction network. We develop a graph-theoretical framework that enables automatic construction of such representation. We illustrate the effectiveness of our method by applying it to TNFα/NF-κB and pheromone signaling pathways. Conclusion The proposed representation helps in understanding the transitions between functional groups and allows for tracking a protein's path through a cascade of functional groups. Therefore, depending on the nature of the network, our representation is capable of elucidating temporal relations between functional groups. Our results show that the proposed method opens a new avenue for the analysis of protein interaction networks.
Intrinsic functional brain architecture derived from graph theoretical analysis in the human fetus.
Moriah E Thomason
Full Text Available The human brain undergoes dramatic maturational changes during late stages of fetal and early postnatal life. The importance of this period to the establishment of healthy neural connectivity is apparent in the high incidence of neural injury in preterm infants, in whom untimely exposure to ex-uterine factors interrupts neural connectivity. Though the relevance of this period to human neuroscience is apparent, little is known about functional neural networks in human fetal life. Here, we apply graph theoretical analysis to examine human fetal brain connectivity. Utilizing resting state functional magnetic resonance imaging (fMRI data from 33 healthy human fetuses, 19 to 39 weeks gestational age (GA, our analyses reveal that the human fetal brain has modular organization and modules overlap functional systems observed postnatally. Age-related differences between younger (GA <31 weeks and older (GA≥31 weeks fetuses demonstrate that brain modularity decreases, and connectivity of the posterior cingulate to other brain networks becomes more negative, with advancing GA. By mimicking functional principles observed postnatally, these results support early emerging capacity for information processing in the human fetal brain. Current technical limitations, as well as the potential for fetal fMRI to one day produce major discoveries about fetal origins or antecedents of neural injury or disease are discussed.
Jonathan Laney
2015-01-01
Full Text Available The assessment of neuroplasticity after stroke through functional magnetic resonance imaging (fMRI analysis is a developing field where the objective is to better understand the neural process of recovery and to better target rehabilitation interventions. The challenge in this population stems from the large amount of individual spatial variability and the need to summarize entire brain maps by generating simple, yet discriminating features to highlight differences in functional connectivity. Independent vector analysis (IVA has been shown to provide superior performance in preserving subject variability when compared with widely used methods such as group independent component analysis. Hence, in this paper, graph-theoretical (GT analysis is applied to IVA-generated components to effectively exploit the individual subjects' connectivity to produce discriminative features. The analysis is performed on fMRI data collected from individuals with chronic stroke both before and after a 6-week arm and hand rehabilitation intervention. Resulting GT features are shown to capture connectivity changes that are not evident through direct comparison of the group t-maps. The GT features revealed increased small worldness across components and greater centrality in key motor networks as a result of the intervention, suggesting improved efficiency in neural communication. Clinically, these results bring forth new possibilities as a means to observe the neural processes underlying improvements in motor function.
Haraldsdóttir, Hulda S.; Fleming, Ronan M. T.
2016-01-01
Conserved moieties are groups of atoms that remain intact in all reactions of a metabolic network. Identification of conserved moieties gives insight into the structure and function of metabolic networks and facilitates metabolic modelling. All moiety conservation relations can be represented as nonnegative integer vectors in the left null space of the stoichiometric matrix corresponding to a biochemical network. Algorithms exist to compute such vectors based only on reaction stoichiometry but their computational complexity has limited their application to relatively small metabolic networks. Moreover, the vectors returned by existing algorithms do not, in general, represent conservation of a specific moiety with a defined atomic structure. Here, we show that identification of conserved moieties requires data on reaction atom mappings in addition to stoichiometry. We present a novel method to identify conserved moieties in metabolic networks by graph theoretical analysis of their underlying atom transition networks. Our method returns the exact group of atoms belonging to each conserved moiety as well as the corresponding vector in the left null space of the stoichiometric matrix. It can be implemented as a pipeline of polynomial time algorithms. Our implementation completes in under five minutes on a metabolic network with more than 4,000 mass balanced reactions. The scalability of the method enables extension of existing applications for moiety conservation relations to genome-scale metabolic networks. We also give examples of new applications made possible by elucidating the atomic structure of conserved moieties. PMID:27870845
The graph representation approach to topological field theory in 2 + 1 dimensions
Martin, S.P.
1991-02-01
An alternative definition of topological quantum field theory in 2+1 dimensions is discussed. The fundamental objects in this approach are not gauge fields as in the usual approach, but non-local observables associated with graphs. The classical theory of graphs is defined by postulating a simple diagrammatic rule for computing the Poisson bracket of any two graphs. The theory is quantized by exhibiting a quantum deformation of the classical Poisson bracket algebra, which is realized as a commutator algebra on a Hilbert space of states. The wavefunctions in this ''graph representation'' approach are functionals on an appropriate set of graphs. This is in contrast to the usual ''connection representation'' approach in which the theory is defined in terms of a gauge field and the wavefunctions are functionals on the space of flat spatial connections modulo gauge transformations
Managerial Leadership - A Theoretical Approach
Felicia Cornelia MACARIE
2007-06-01
Full Text Available The paper endeavors to offer an overview of the major theories on leadership and the way in which it influences the management of contemporary organizations. Numerous scholars highlight that there are numerous overlaps between the concepts of management and leadership. This is the reason why the first section of the paper focuses on providing an extensive overview of the literature regarding the meaning of the two aforementioned concepts. The second section addresses more in depth the concept of leadership and managerial leadership and focuses on the ideal profile of the leader. The last section of the paper critically discusses various types of leadership and more specifically modern approaches to the concept and practices of leadership.
MetricForensics: A Multi-Level Approach for Mining Volatile Graphs
Henderson, Keith [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Eliassi-Rad, Tina [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Faloutsos, Christos [Carnegie Mellon Univ., Pittsburgh, PA (United States); Akoglu, Leman [Carnegie Mellon Univ., Pittsburgh, PA (United States); Li, Lei [Carnegie Mellon Univ., Pittsburgh, PA (United States); Maruhashi, Koji [Fujitsu Laboratories Ltd., Kanagawa (Japan); Prakash, B. Aditya [Carnegie Mellon Univ., Pittsburgh, PA (United States); Tong, H [Carnegie Mellon Univ., Pittsburgh, PA (United States)
2010-02-08
Advances in data collection and storage capacity have made it increasingly possible to collect highly volatile graph data for analysis. Existing graph analysis techniques are not appropriate for such data, especially in cases where streaming or near-real-time results are required. An example that has drawn significant research interest is the cyber-security domain, where internet communication traces are collected and real-time discovery of events, behaviors, patterns and anomalies is desired. We propose MetricForensics, a scalable framework for analysis of volatile graphs. MetricForensics combines a multi-level “drill down" approach, a collection of user-selected graph metrics and a collection of analysis techniques. At each successive level, more sophisticated metrics are computed and the graph is viewed at a finer temporal resolution. In this way, MetricForensics scales to highly volatile graphs by only allocating resources for computationally expensive analysis when an interesting event is discovered at a coarser resolution first. We test MetricForensics on three real-world graphs: an enterprise IP trace, a trace of legitimate and malicious network traffic from a research institution, and the MIT Reality Mining proximity sensor data. Our largest graph has »3M vertices and »32M edges, spanning 4:5 days. The results demonstrate the scalability and capability of MetricForensics in analyzing volatile graphs; and highlight four novel phenomena in such graphs: elbows, broken correlations, prolonged spikes, and strange stars.
A Ranking Approach on Large-Scale Graph With Multidimensional Heterogeneous Information.
Wei, Wei; Gao, Bin; Liu, Tie-Yan; Wang, Taifeng; Li, Guohui; Li, Hang
2016-04-01
Graph-based ranking has been extensively studied and frequently applied in many applications, such as webpage ranking. It aims at mining potentially valuable information from the raw graph-structured data. Recently, with the proliferation of rich heterogeneous information (e.g., node/edge features and prior knowledge) available in many real-world graphs, how to effectively and efficiently leverage all information to improve the ranking performance becomes a new challenging problem. Previous methods only utilize part of such information and attempt to rank graph nodes according to link-based methods, of which the ranking performances are severely affected by several well-known issues, e.g., over-fitting or high computational complexity, especially when the scale of graph is very large. In this paper, we address the large-scale graph-based ranking problem and focus on how to effectively exploit rich heterogeneous information of the graph to improve the ranking performance. Specifically, we propose an innovative and effective semi-supervised PageRank (SSP) approach to parameterize the derived information within a unified semi-supervised learning framework (SSLF-GR), then simultaneously optimize the parameters and the ranking scores of graph nodes. Experiments on the real-world large-scale graphs demonstrate that our method significantly outperforms the algorithms that consider such graph information only partially.
Pathfinding in graph-theoretic sabotage models. I. Simultaneous attack by several teams
Hulme, B.L.
1976-07-01
Graph models are developed for fixed-site safeguards systems. The problem of finding optimal routes for several sabotage teams is cast as a problem of finding shortest paths in a graph. The motivation, rationale, and interpretation of the mathematical models are discussed in detail, and an algorithm for efficiently solving the associated path problem is described
Towards a Set Theoretical Approach to Big Data Analytics
Mukkamala, Raghava Rao; Hussain, Abid; Vatrapu, Ravi
2014-01-01
Formal methods, models and tools for social big data analytics are largely limited to graph theoretical approaches such as social network analysis (SNA) informed by relational sociology. There are no other unified modeling approaches to social big data that integrate the conceptual, formal...... this technique to the data analysis of big social data collected from Facebook page of the fast fashion company, H&M....... and software realms. In this paper, we first present and discuss a theory and conceptual model of social data. Second, we outline a formal model based on set theory and discuss the semantics of the formal model with a real-world social data example from Facebook. Third, we briefly present and discuss...
Set-Theoretic Approach to Maturity Models
Lasrado, Lester Allan
Despite being widely accepted and applied, maturity models in Information Systems (IS) have been criticized for the lack of theoretical grounding, methodological rigor, empirical validations, and ignorance of multiple and non-linear paths to maturity. This PhD thesis focuses on addressing...... these criticisms by incorporating recent developments in configuration theory, in particular application of set-theoretic approaches. The aim is to show the potential of employing a set-theoretic approach for maturity model research and empirically demonstrating equifinal paths to maturity. Specifically...... methodological guidelines consisting of detailed procedures to systematically apply set theoretic approaches for maturity model research and provides demonstrations of it application on three datasets. The thesis is a collection of six research papers that are written in a sequential manner. The first paper...
Fractional graph theory a rational approach to the theory of graphs
Scheinerman, Edward R
2013-01-01
A unified treatment of the most important results in the study of fractional graph concepts, this volume explores the various ways in which integer-valued concepts can be modified to derive nonintegral values. It begins with the general fractional theory of hypergraphs and presents in-depth coverage of fundamental and advanced topics. Subjects include fractional matching, fractional coloring, fractional edge coloring, fractional arboricity via matroid methods, and fractional isomorphism. The final chapter examines additional topics such as fractional domination, fractional intersection numbers
Graph theoretical analysis of functional network for comprehension of sign language.
Liu, Lanfang; Yan, Xin; Liu, Jin; Xia, Mingrui; Lu, Chunming; Emmorey, Karen; Chu, Mingyuan; Ding, Guosheng
2017-09-15
Signed languages are natural human languages using the visual-motor modality. Previous neuroimaging studies based on univariate activation analysis show that a widely overlapped cortical network is recruited regardless whether the sign language is comprehended (for signers) or not (for non-signers). Here we move beyond previous studies by examining whether the functional connectivity profiles and the underlying organizational structure of the overlapped neural network may differ between signers and non-signers when watching sign language. Using graph theoretical analysis (GTA) and fMRI, we compared the large-scale functional network organization in hearing signers with non-signers during the observation of sentences in Chinese Sign Language. We found that signed sentences elicited highly similar cortical activations in the two groups of participants, with slightly larger responses within the left frontal and left temporal gyrus in signers than in non-signers. Crucially, further GTA revealed substantial group differences in the topologies of this activation network. Globally, the network engaged by signers showed higher local efficiency (t (24) =2.379, p=0.026), small-worldness (t (24) =2.604, p=0.016) and modularity (t (24) =3.513, p=0.002), and exhibited different modular structures, compared to the network engaged by non-signers. Locally, the left ventral pars opercularis served as a network hub in the signer group but not in the non-signer group. These findings suggest that, despite overlap in cortical activation, the neural substrates underlying sign language comprehension are distinguishable at the network level from those for the processing of gestural action. Copyright © 2017 Elsevier B.V. All rights reserved.
Genecentric: a package to uncover graph-theoretic structure in high-throughput epistasis data.
Gallant, Andrew; Leiserson, Mark D M; Kachalov, Maxim; Cowen, Lenore J; Hescott, Benjamin J
2013-01-18
New technology has resulted in high-throughput screens for pairwise genetic interactions in yeast and other model organisms. For each pair in a collection of non-essential genes, an epistasis score is obtained, representing how much sicker (or healthier) the double-knockout organism will be compared to what would be expected from the sickness of the component single knockouts. Recent algorithmic work has identified graph-theoretic patterns in this data that can indicate functional modules, and even sets of genes that may occur in compensatory pathways, such as a BPM-type schema first introduced by Kelley and Ideker. However, to date, any algorithms for finding such patterns in the data were implemented internally, with no software being made publically available. Genecentric is a new package that implements a parallelized version of the Leiserson et al. algorithm (J Comput Biol 18:1399-1409, 2011) for generating generalized BPMs from high-throughput genetic interaction data. Given a matrix of weighted epistasis values for a set of double knock-outs, Genecentric returns a list of generalized BPMs that may represent compensatory pathways. Genecentric also has an extension, GenecentricGO, to query FuncAssociate (Bioinformatics 25:3043-3044, 2009) to retrieve GO enrichment statistics on generated BPMs. Python is the only dependency, and our web site provides working examples and documentation. We find that Genecentric can be used to find coherent functional and perhaps compensatory gene sets from high throughput genetic interaction data. Genecentric is made freely available for download under the GPLv2 from http://bcb.cs.tufts.edu/genecentric.
Wang, Chao; Xu, Jin; Zhao, Songzhen; Lou, Wutao
2016-01-01
The study was dedicated to investigating the change in information processing in brain networks of vascular dementia (VaD) patients during the process of decision making. EEG was recorded from 18 VaD patients and 19 healthy controls when subjects were performing a visual oddball task. The whole task was divided into several stages by using global field power analysis. In the stage related to the decision-making process, graph theoretical analysis was applied to the binary directed network derived from EEG signals at nine electrodes in the frontal, central, and parietal regions in δ (0.5-3.5Hz), θ (4-7Hz), α1 (8-10Hz), α2 (11-13Hz), and β (14-30Hz) frequency bands based on directed transfer function. A weakened outgoing information flow, a decrease in out-degree, and an increase in in-degree were found in the parietal region in VaD patients, compared to healthy controls. In VaD patients, the parietal region may also lose its hub status in brain networks. In addition, the clustering coefficient was significantly lower in VaD patients. Impairment might be present in the parietal region or its connections with other regions, and it may serve as one of the causes for cognitive decline in VaD patients. The brain networks of VaD patients were significantly altered toward random networks. The present study extended our understanding of VaD from the perspective of brain functional networks, and it provided possible interpretations for cognitive deficits in VaD patients. Copyright © 2015 International Federation of Clinical Neurophysiology. Published by Elsevier Ireland Ltd. All rights reserved.
Jun Lv
Full Text Available Functional brain networks of human have been revealed to have small-world properties by both analyzing electroencephalogram (EEG and functional magnetic resonance imaging (fMRI time series.In our study, by using graph theoretical analysis, we attempted to investigate the changes of paralimbic-limbic cortex between wake and sleep states. Ten healthy young people were recruited to our experiment. Data from 2 subjects were excluded for the reason that they had not fallen asleep during the experiment. For each subject, blood oxygen level dependency (BOLD images were acquired to analyze brain network, and peripheral pulse signals were obtained continuously to identify if the subject was in sleep periods. Results of fMRI showed that brain networks exhibited stronger small-world characteristics during sleep state as compared to wake state, which was in consistent with previous studies using EEG synchronization. Moreover, we observed that compared with wake state, paralimbic-limbic cortex had less connectivity with neocortical system and centrencephalic structure in sleep.In conclusion, this is the first study, to our knowledge, has observed that small-world properties of brain functional networks altered when human sleeps without EEG synchronization. Moreover, we speculate that paralimbic-limbic cortex organization owns an efficient defense mechanism responsible for suppressing the external environment interference when humans sleep, which is consistent with the hypothesis that the paralimbic-limbic cortex may be functionally disconnected from brain regions which directly mediate their interactions with the external environment. Our findings also provide a reasonable explanation why stable sleep exhibits homeostasis which is far less susceptible to outside world.
Ye, Zheng; Doñamayor, Nuria; Münte, Thomas F
2014-02-01
A set of cortical and sub-cortical brain structures has been linked with sentence-level semantic processes. However, it remains unclear how these brain regions are organized to support the semantic integration of a word into sentential context. To look into this issue, we conducted a functional magnetic resonance imaging (fMRI) study that required participants to silently read sentences with semantically congruent or incongruent endings and analyzed the network properties of the brain with two approaches, independent component analysis (ICA) and graph theoretical analysis (GTA). The GTA suggested that the whole-brain network is topologically stable across conditions. The ICA revealed a network comprising the supplementary motor area (SMA), left inferior frontal gyrus, left middle temporal gyrus, left caudate nucleus, and left angular gyrus, which was modulated by the incongruity of sentence ending. Furthermore, the GTA specified that the connections between the left SMA and left caudate nucleus as well as that between the left caudate nucleus and right thalamus were stronger in response to incongruent vs. congruent endings. Copyright © 2012 Wiley Periodicals, Inc.
Time series analysis of S&P 500 index: A horizontal visibility graph approach
Vamvakaris, Michail D.; Pantelous, Athanasios A.; Zuev, Konstantin M.
2018-05-01
The behavior of stock prices has been thoroughly studied throughout the last century, and contradictory results have been reported in the corresponding literature. In this paper, a network theoretical approach is provided to investigate how crises affected the behavior of US stock prices. We analyze high frequency data from S&P500 via the Horizontal Visibility Graph method, and find that all major crises that took place worldwide in the last twenty years, affected significantly the behavior of the price-index. Nevertheless, we observe that each of those crises impacted the index in a different way and magnitude. Interestingly, our results suggest that the predictability of the price-index series increases during the periods of crises.
A semantic graph-based approach to biomedical summarisation.
Plaza, Laura; Díaz, Alberto; Gervás, Pablo
2011-09-01
Access to the vast body of research literature that is available in biomedicine and related fields may be improved by automatic summarisation. This paper presents a method for summarising biomedical scientific literature that takes into consideration the characteristics of the domain and the type of documents. To address the problem of identifying salient sentences in biomedical texts, concepts and relations derived from the Unified Medical Language System (UMLS) are arranged to construct a semantic graph that represents the document. A degree-based clustering algorithm is then used to identify different themes or topics within the text. Different heuristics for sentence selection, intended to generate different types of summaries, are tested. A real document case is drawn up to illustrate how the method works. A large-scale evaluation is performed using the recall-oriented understudy for gisting-evaluation (ROUGE) metrics. The results are compared with those achieved by three well-known summarisers (two research prototypes and a commercial application) and two baselines. Our method significantly outperforms all summarisers and baselines. The best of our heuristics achieves an improvement in performance of almost 7.7 percentage units in the ROUGE-1 score over the LexRank summariser (0.7862 versus 0.7302). A qualitative analysis of the summaries also shows that our method succeeds in identifying sentences that cover the main topic of the document and also considers other secondary or "satellite" information that might be relevant to the user. The method proposed is proved to be an efficient approach to biomedical literature summarisation, which confirms that the use of concepts rather than terms can be very useful in automatic summarisation, especially when dealing with highly specialised domains. Copyright © 2011 Elsevier B.V. All rights reserved.
A Practical Approach to Constructing a Knowledge Graph for Cybersecurity
Yan Jia
2018-02-01
Full Text Available Cyberattack forms are complex and varied, and the detection and prediction of dynamic types of attack are always challenging tasks. Research on knowledge graphs is becoming increasingly mature in many fields. At present, it is very significant that certain scholars have combined the concept of the knowledge graph with cybersecurity in order to construct a cybersecurity knowledge base. This paper presents a cybersecurity knowledge base and deduction rules based on a quintuple model. Using machine learning, we extract entities and build ontology to obtain a cybersecurity knowledge base. New rules are then deduced by calculating formulas and using the path-ranking algorithm. The Stanford named entity recognizer (NER is also used to train an extractor to extract useful information. Experimental results show that the Stanford NER provides many features and the useGazettes parameter may be used to train a recognizer in the cybersecurity domain in preparation for future work. Keywords: Cybersecurity, Knowledge graph, Knowledge deduction
A cluster expansion approach to exponential random graph models
Yin, Mei
2012-01-01
The exponential family of random graphs are among the most widely studied network models. We show that any exponential random graph model may alternatively be viewed as a lattice gas model with a finite Banach space norm. The system may then be treated using cluster expansion methods from statistical mechanics. In particular, we derive a convergent power series expansion for the limiting free energy in the case of small parameters. Since the free energy is the generating function for the expectations of other random variables, this characterizes the structure and behavior of the limiting network in this parameter region
A Set Theoretical Approach to Maturity Models
Lasrado, Lester; Vatrapu, Ravi; Andersen, Kim Normann
2016-01-01
characterized by equifinality, multiple conjunctural causation, and case diversity. We prescribe methodological guidelines consisting of a six-step procedure to systematically apply set theoretic methods to conceptualize, develop, and empirically derive maturity models and provide a demonstration......Maturity Model research in IS has been criticized for the lack of theoretical grounding, methodological rigor, empirical validations, and ignorance of multiple and non-linear paths to maturity. To address these criticisms, this paper proposes a novel set-theoretical approach to maturity models...
Game theoretic approaches for spectrum redistribution
Wu, Fan
2014-01-01
This brief examines issues of spectrum allocation for the limited resources of radio spectrum. It uses a game-theoretic perspective, in which the nodes in the wireless network are rational and always pursue their own objectives. It provides a systematic study of the approaches that can guarantee the system's convergence at an equilibrium state, in which the system performance is optimal or sub-optimal. The author provides a short tutorial on game theory, explains game-theoretic channel allocation in clique and in multi-hop wireless networks and explores challenges in designing game-theoretic m
A direct mining approach to efficient constrained graph pattern discovery
Zhu, Feida; Zhang, Zequn; Qu, Qiang
2013-01-01
Despite the wealth of research on frequent graph pattern mining, how to efficiently mine the complete set of those with constraints still poses a huge challenge to the existing algorithms mainly due to the inherent bottleneck in the mining paradigm. In essence, mining requests with explicitly-spe...
A Numerical Approach to Long Cycles in Graphs and Digraphs
Fiedler, Miroslav
2001-01-01
Roč. 235, - (2001), s. 233-236 ISSN 0012-365X R&D Projects: GA ČR GA201/98/0222 Institutional research plan: AV0Z1030915 Keywords : graph * diagraph * cycle * Hamilton cycle Subject RIV: BA - General Mathematics Impact factor: 0.301, year: 2001
Crichton, Gamal; Guo, Yufan; Pyysalo, Sampo; Korhonen, Anna
2018-05-21
Link prediction in biomedical graphs has several important applications including predicting Drug-Target Interactions (DTI), Protein-Protein Interaction (PPI) prediction and Literature-Based Discovery (LBD). It can be done using a classifier to output the probability of link formation between nodes. Recently several works have used neural networks to create node representations which allow rich inputs to neural classifiers. Preliminary works were done on this and report promising results. However they did not use realistic settings like time-slicing, evaluate performances with comprehensive metrics or explain when or why neural network methods outperform. We investigated how inputs from four node representation algorithms affect performance of a neural link predictor on random- and time-sliced biomedical graphs of real-world sizes (∼ 6 million edges) containing information relevant to DTI, PPI and LBD. We compared the performance of the neural link predictor to those of established baselines and report performance across five metrics. In random- and time-sliced experiments when the neural network methods were able to learn good node representations and there was a negligible amount of disconnected nodes, those approaches outperformed the baselines. In the smallest graph (∼ 15,000 edges) and in larger graphs with approximately 14% disconnected nodes, baselines such as Common Neighbours proved a justifiable choice for link prediction. At low recall levels (∼ 0.3) the approaches were mostly equal, but at higher recall levels across all nodes and average performance at individual nodes, neural network approaches were superior. Analysis showed that neural network methods performed well on links between nodes with no previous common neighbours; potentially the most interesting links. Additionally, while neural network methods benefit from large amounts of data, they require considerable amounts of computational resources to utilise them. Our results indicate
Partial discharge transients: The field theoretical approach
McAllister, Iain Wilson; Crichton, George C
1998-01-01
Up until the mid-1980s the theory of partial discharge transients was essentially static. This situation had arisen because of the fixation with the concept of void capacitance and the use of circuit theory to address what is in essence a field problem. Pedersen rejected this approach and instead...... began to apply field theory to the problem of partial discharge transients. In the present paper, the contributions of Pedersen using the field theoretical approach will be reviewed and discussed....
New Theoretical Approach Integrated Education and Technology
Ding, Gang
2010-01-01
The paper focuses on exploring new theoretical approach in education with development of online learning technology, from e-learning to u-learning and virtual reality technology, and points out possibilities such as constructing a new teaching ecological system, ubiquitous educational awareness with ubiquitous technology, and changing the…
Visibility graph approach to the analysis of ocean tidal records
Telesca, Luciano; Lovallo, Michele; Pierini, Jorge O.
2012-01-01
By using the recent method of the visibility graph, three time series of oceanic tide level in central Argentina were investigated. The degree distributions show a rich structure; in particular the maximum is due to the main periodic oscillations at 24 hours and 12 hours and higher harmonics. The degree distributions of the residuals (obtained removing from the original signals the cyclic components) suggest that the local effects, linked with the particular coastal conditions of the sites, are discernible for the degree k 100. Although a relationship between the spectral exponent α and the exponent of the degree distribution γ of tidal signals can be recognized, this cannot be simply stated due to the very rich and complex structure of time dynamics of tides. The present study, even if still preliminary, show the importance of the visibility graph method in investigating the complex time dynamics of observational and experimental signals.
The Mathematics of Networks Science: Scale-Free, Power-Law Graphs and Continuum Theoretical Analysis
Padula, Janice
2012-01-01
When hoping to initiate or sustain students' interest in mathematics teachers should always consider relevance, relevance to students' lives and in the middle and later years of instruction in high school and university, accessibility. A topic such as the mathematics behind networks science, more specifically scale-free graphs, is up-to-date,…
Radiotherapy problem under fuzzy theoretic approach
Ammar, E.E.; Hussein, M.L.
2003-01-01
A fuzzy set theoretic approach is used for radiotherapy problem. The problem is faced with two goals: the first is to maximize the fraction of surviving normal cells and the second is to minimize the fraction of surviving tumor cells. The theory of fuzzy sets has been employed to formulate and solve the problem. A linguistic variable approach is used for treating the first goal. The solutions obtained by the modified approach are always efficient and best compromise. A sensitivity analysis of the solutions to the differential weights is given
The cavity approach to parallel dynamics of Ising spins on a graph
Neri, I; Bollé, D
2009-01-01
We use the cavity method to study the parallel dynamics of disordered Ising models on a graph. In particular, we derive a set of recursive equations in single-site probabilities of paths propagating along the edges of the graph. These equations are analogous to the cavity equations for equilibrium models and are exact on a tree. On graphs with exclusively directed edges we find an exact expression for the stationary distribution. We present the phase diagrams for an Ising model on an asymmetric Bethe lattice and for a neural network with Hebbian interactions on an asymmetric scale-free graph. For graphs with a nonzero fraction of symmetric edges the equations can be solved for a finite number of time steps. Theoretical predictions are confirmed by simulations. Using a heuristic method the cavity equations are extended to a set of equations that determine the marginals of the stationary distribution of Ising models on graphs with a nonzero fraction of symmetric edges. The results from this method are discussed and compared with simulations
Assessment of tautomer distribution using the condensed reaction graph approach
Gimadiev, T. R.; Madzhidov, T. I.; Nugmanov, R. I.; Baskin, I. I.; Antipin, I. S.; Varnek, A.
2018-03-01
We report the first direct QSPR modeling of equilibrium constants of tautomeric transformations (logK T ) in different solvents and at different temperatures, which do not require intermediate assessment of acidity (basicity) constants for all tautomeric forms. The key step of the modeling consisted in the merging of two tautomers in one sole molecular graph ("condensed reaction graph") which enables to compute molecular descriptors characterizing entire equilibrium. The support vector regression method was used to build the models. The training set consisted of 785 transformations belonging to 11 types of tautomeric reactions with equilibrium constants measured in different solvents and at different temperatures. The models obtained perform well both in cross-validation (Q2 = 0.81 RMSE = 0.7 logK T units) and on two external test sets. Benchmarking studies demonstrate that our models outperform results obtained with DFT B3LYP/6-311 ++ G(d,p) and ChemAxon Tautomerizer applicable only in water at room temperature.
A Parallel Approach for Frequent Subgraph Mining in a Single Large Graph Using Spark
Fengcai Qiao
2018-02-01
Full Text Available Frequent subgraph mining (FSM plays an important role in graph mining, attracting a great deal of attention in many areas, such as bioinformatics, web data mining and social networks. In this paper, we propose SSiGraM (Spark based Single Graph Mining, a Spark based parallel frequent subgraph mining algorithm in a single large graph. Aiming to approach the two computational challenges of FSM, we conduct the subgraph extension and support evaluation parallel across all the distributed cluster worker nodes. In addition, we also employ a heuristic search strategy and three novel optimizations: load balancing, pre-search pruning and top-down pruning in the support evaluation process, which significantly improve the performance. Extensive experiments with four different real-world datasets demonstrate that the proposed algorithm outperforms the existing GraMi (Graph Mining algorithm by an order of magnitude for all datasets and can work with a lower support threshold.
GRAPH THEORY APPROACH TO QUANTIFY UNCERTAINTY OF PERFORMANCE MEASURES
Sérgio D. Sousa
2015-03-01
Full Text Available In this work, the performance measurement process is studied to quantify the uncertainty induced in the resulting performance measure (PM. To that end, the causes of uncertainty are identified, analysing the activities undertaken in the three following stages of the performance measurement process: design and implementation, data collection and record, and determination and analysis. A quantitative methodology based on graph theory and on the sources of uncertainty of the performance measurement process is used to calculate an uncertainty index to evaluate the level of uncertainty of a given PM or (key performance indicator. An application example is presented. The quantification of PM uncertainty could contribute to better represent the risk associated with a given decision and also to improve the PM to increase its precision and reliability.
Theoretical and methodological approaches in discourse analysis.
Stevenson, Chris
2004-01-01
Discourse analysis (DA) embodies two main approaches: Foucauldian DA and radical social constructionist DA. Both are underpinned by social constructionism to a lesser or greater extent. Social constructionism has contested areas in relation to power, embodiment, and materialism, although Foucauldian DA does focus on the issue of power Embodiment and materialism may be especially relevant for researchers of nursing where the physical body is prominent. However, the contested nature of social constructionism allows a fusion of theoretical and methodological approaches tailored to a specific research interest. In this paper, Chris Stevenson suggests a framework for working out and declaring the DA approach to be taken in relation to a research area, as well as to aid anticipating methodological critique. Method, validity, reliability and scholarship are discussed from within a discourse analytic frame of reference.
Theoretical and methodological approaches in discourse analysis.
Stevenson, Chris
2004-10-01
Discourse analysis (DA) embodies two main approaches: Foucauldian DA and radical social constructionist DA. Both are underpinned by social constructionism to a lesser or greater extent. Social constructionism has contested areas in relation to power, embodiment, and materialism, although Foucauldian DA does focus on the issue of power. Embodiment and materialism may be especially relevant for researchers of nursing where the physical body is prominent. However, the contested nature of social constructionism allows a fusion of theoretical and methodological approaches tailored to a specific research interest. In this paper, Chris Stevenson suggests a frame- work for working out and declaring the DA approach to be taken in relation to a research area, as well as to aid anticipating methodological critique. Method, validity, reliability and scholarship are discussed from within a discourse analytic frame of reference.
A gauge-theoretic approach to gravity.
Krasnov, Kirill
2012-08-08
Einstein's general relativity (GR) is a dynamical theory of the space-time metric. We describe an approach in which GR becomes an SU(2) gauge theory. We start at the linearized level and show how a gauge-theoretic Lagrangian for non-interacting massless spin two particles (gravitons) takes a much more simple and compact form than in the standard metric description. Moreover, in contrast to the GR situation, the gauge theory Lagrangian is convex. We then proceed with a formulation of the full nonlinear theory. The equivalence to the metric-based GR holds only at the level of solutions of the field equations, that is, on-shell. The gauge-theoretic approach also makes it clear that GR is not the only interacting theory of massless spin two particles, in spite of the GR uniqueness theorems available in the metric description. Thus, there is an infinite-parameter class of gravity theories all describing just two propagating polarizations of the graviton. We describe how matter can be coupled to gravity in this formulation and, in particular, how both the gravity and Yang-Mills arise as sectors of a general diffeomorphism-invariant gauge theory. We finish by outlining a possible scenario of the ultraviolet completion of quantum gravity within this approach.
无
2002-01-01
An integrated approach to generation of precedence relations and precedence graphs for assembly sequence planning is presented, which contains more assembly flexibility. The approach involves two stages. Based on the assembly model, the components in the assembly can be divided into partially constrained components and completely constrained components in the first stage, and then geometric precedence relation for every component is generated automatically. According to the result of the first stage, the second stage determines and constructs all precedence graphs. The algorithms of these two stages proposed are verified by two assembly examples.
A sign-theoretic approach to biotechnology
Bruni, Luis Emilio
” semiotic networks across hierarchical levels and for relating the different emergent codes in living systems. I consider this an important part of the work because there I define some of the main concepts that will help me to analyse different codes and semiotic processes in living systems in order...... to exemplify what is the relevance of a sign-theoretic approach to biotechnology. In particular, I introduce the notion of digital-analogical consensus as a semiotic pattern for the creation of complex logical products that constitute specific signs. The chapter ends with some examples of conspicuous semiotic...... to exemplify how a semiotic approach can be of help when organising the knowledge that can lead us to understanding the relevance, the role and the position of signal transduction networks in relation to the larger semiotic networks in which they function, i.e.: in the hierarchical formal processes of mapping...
Vecchio, Fabrizio; Miraglia, Francesca; Bramanti, Placido; Rossini, Paolo Maria
2014-01-01
Modern analysis of electroencephalographic (EEG) rhythms provides information on dynamic brain connectivity. To test the hypothesis that aging processes modulate the brain connectivity network, EEG recording was conducted on 113 healthy volunteers. They were divided into three groups in accordance with their ages: 36 Young (15-45 years), 46 Adult (50-70 years), and 31 Elderly (>70 years). To evaluate the stability of the investigated parameters, a subgroup of 10 subjects underwent a second EEG recording two weeks later. Graph theory functions were applied to the undirected and weighted networks obtained by the lagged linear coherence evaluated by eLORETA on cortical sources. EEG frequency bands of interest were: delta (2-4 Hz), theta (4-8 Hz), alpha1 (8-10.5 Hz), alpha2 (10.5-13 Hz), beta1 (13-20 Hz), beta2 (20-30 Hz), and gamma (30-40 Hz). The spectral connectivity analysis of cortical sources showed that the normalized Characteristic Path Length (λ) presented the pattern Young > Adult>Elderly in the higher alpha band. Elderly also showed a greater increase in delta and theta bands than Young. The correlation between age and λ showed that higher ages corresponded to higher λ in delta and theta and lower in the alpha2 band; this pattern reflects the age-related modulation of higher (alpha) and decreased (delta) connectivity. The Normalized Clustering coefficient (γ) and small-world network modeling (σ) showed non-significant age-modulation. Evidence from the present study suggests that graph theory can aid in the analysis of connectivity patterns estimated from EEG and can facilitate the study of the physiological and pathological brain aging features of functional connectivity networks.
Сlassification of methods of production of computer forensic by usage approach of graph theory
Anna Ravilyevna Smolina
2016-06-01
Full Text Available Сlassification of methods of production of computer forensic by usage approach of graph theory is proposed. If use this classification, it is possible to accelerate and simplify the search of methods of production of computer forensic and this process to automatize.
Сlassification of methods of production of computer forensic by usage approach of graph theory
Anna Ravilyevna Smolina; Alexander Alexandrovich Shelupanov
2016-01-01
Сlassification of methods of production of computer forensic by usage approach of graph theory is proposed. If use this classification, it is possible to accelerate and simplify the search of methods of production of computer forensic and this process to automatize.
Wi Hoon eJung
2013-10-01
Full Text Available One major characteristic of experts is intuitive judgment, which is an automatic process whereby patterns stored in memory through long-term training are recognized. Indeed, long-term training may influence brain structure and function. A recent study revealed that chess experts at rest showed differences in structure and functional connectivity (FC in the head of caudate, which is associated with rapid best next-move generation. However, less is known about the structure and function of the brains of Baduk experts compared with those of experts in other strategy games. Therefore, we performed voxel-based morphometry and FC analyses in Baduk experts to investigate structural brain differences and to clarify the influence of these differences on functional interactions. We also conducted graph theoretical analysis to explore the topological organization of whole-brain functional networks. Compared to novices, Baduk experts exhibited decreased and increased gray matter volume in the amygdala and nucleus accumbens, respectively. We also found increased FC between the amygdala and medial orbitofrontal cortex and decreased FC between the nucleus accumbens and medial prefrontal cortex. Further graph theoretical analysis revealed differences in measures of the integration of the network and in the regional nodal characteristics of various brain regions activated during Baduk. This study provides evidence for structural and functional differences as well as altered topological organization of the whole-brain functional networks in Baduk experts. Our findings also offer novel suggestions about the cognitive mechanisms behind Baduk expertise, which involves intuitive decision-making mediated by somatic marker circuitry and visuospatial processing.
A graph-based approach to detect spatiotemporal dynamics in satellite image time series
Guttler, Fabio; Ienco, Dino; Nin, Jordi; Teisseire, Maguelonne; Poncelet, Pascal
2017-08-01
Enhancing the frequency of satellite acquisitions represents a key issue for Earth Observation community nowadays. Repeated observations are crucial for monitoring purposes, particularly when intra-annual process should be taken into account. Time series of images constitute a valuable source of information in these cases. The goal of this paper is to propose a new methodological framework to automatically detect and extract spatiotemporal information from satellite image time series (SITS). Existing methods dealing with such kind of data are usually classification-oriented and cannot provide information about evolutions and temporal behaviors. In this paper we propose a graph-based strategy that combines object-based image analysis (OBIA) with data mining techniques. Image objects computed at each individual timestamp are connected across the time series and generates a set of evolution graphs. Each evolution graph is associated to a particular area within the study site and stores information about its temporal evolution. Such information can be deeply explored at the evolution graph scale or used to compare the graphs and supply a general picture at the study site scale. We validated our framework on two study sites located in the South of France and involving different types of natural, semi-natural and agricultural areas. The results obtained from a Landsat SITS support the quality of the methodological approach and illustrate how the framework can be employed to extract and characterize spatiotemporal dynamics.
iBGP: A Bipartite Graph Propagation Approach for Mobile Advertising Fraud Detection
Jinlong Hu
2017-01-01
Full Text Available Online mobile advertising plays a vital financial role in supporting free mobile apps, but detecting malicious apps publishers who generate fraudulent actions on the advertisements hosted on their apps is difficult, since fraudulent traffic often mimics behaviors of legitimate users and evolves rapidly. In this paper, we propose a novel bipartite graph-based propagation approach, iBGP, for mobile apps advertising fraud detection in large advertising system. We exploit the characteristics of mobile advertising user’s behavior and identify two persistent patterns: power law distribution and pertinence and propose an automatic initial score learning algorithm to formulate both concepts to learn the initial scores of non-seed nodes. We propose a weighted graph propagation algorithm to propagate the scores of all nodes in the user-app bipartite graphs until convergence. To extend our approach for large-scale settings, we decompose the objective function of the initial score learning model into separate one-dimensional problems and parallelize the whole approach on an Apache Spark cluster. iBGP was applied on a large synthetic dataset and a large real-world mobile advertising dataset; experiment results demonstrate that iBGP significantly outperforms other popular graph-based propagation methods.
A Graph-Algorithmic Approach for the Study of Metastability in Markov Chains
Gan, Tingyue; Cameron, Maria
2017-06-01
Large continuous-time Markov chains with exponentially small transition rates arise in modeling complex systems in physics, chemistry, and biology. We propose a constructive graph-algorithmic approach to determine the sequence of critical timescales at which the qualitative behavior of a given Markov chain changes, and give an effective description of the dynamics on each of them. This approach is valid for both time-reversible and time-irreversible Markov processes, with or without symmetry. Central to this approach are two graph algorithms, Algorithm 1 and Algorithm 2, for obtaining the sequences of the critical timescales and the hierarchies of Typical Transition Graphs or T-graphs indicating the most likely transitions in the system without and with symmetry, respectively. The sequence of critical timescales includes the subsequence of the reciprocals of the real parts of eigenvalues. Under a certain assumption, we prove sharp asymptotic estimates for eigenvalues (including pre-factors) and show how one can extract them from the output of Algorithm 1. We discuss the relationship between Algorithms 1 and 2 and explain how one needs to interpret the output of Algorithm 1 if it is applied in the case with symmetry instead of Algorithm 2. Finally, we analyze an example motivated by R. D. Astumian's model of the dynamics of kinesin, a molecular motor, by means of Algorithm 2.
Graph Theoretical Analysis of Developmental Patterns of the White Matter Network
Zhang eChen
2013-11-01
Full Text Available Understanding the development of human brain organization is critical for gaining insight into how the enhancement of cognitive processes is related to the fine-tuning of the brain network. However, the developmental trajectory of the large-scale white matter (WM network is not fully understood. Here, using graph theory, we examine developmental changes in the organization of WM networks in 180 typically-developing participants. WM networks were constructed using whole brain tractography and 78 cortical regions of interest were extracted from each participant. The subjects were first divided into 5 equal sample size (n=36 groups (early childhood: 6.0-9.7 years; late childhood: 9.8-12.7 years; adolescence: 12.9-17.5 years; young adult: 17.6-21.8 years; adult: 21.9-29.6 years. Most prominent changes in the topological properties of developing brain networks occur at late childhood and adolescence. During late childhood period, the structural brain network showed significant increase in the global efficiency but decrease in modularity, suggesting a shift of topological organization toward a more randomized configuration. However, while preserving most topological features, there was a significant increase in the local efficiency at adolescence, suggesting the dynamic process of rewiring and rebalancing brain connections at different growth stages. In addition, several pivotal hubs were identified that are vital for the global coordination of information flow over the whole brain network across all age groups. Significant increases of nodal efficiency were present in several regions such as precuneus at late childhood. Finally, a stable and functionally/anatomically related modular organization was identified throughout the development of the WM network. This study used network analysis to elucidate the topological changes in brain maturation, paving the way for developing novel methods for analyzing disrupted brain connectivity in
Vecchio, Fabrizio; Di Iorio, Riccardo; Miraglia, Francesca; Granata, Giuseppe; Romanello, Roberto; Bramanti, Placido; Rossini, Paolo Maria
2018-04-01
Transcranial direct current stimulation (tDCS) is a non-invasive technique able to modulate cortical excitability in a polarity-dependent way. At present, only few studies investigated the effects of tDCS on the modulation of functional connectivity between remote cortical areas. The aim of this study was to investigate-through graph theory analysis-how bipolar tDCS modulate cortical networks high-density EEG recordings were acquired before and after bipolar cathodal, anodal and sham tDCS involving the primary motor and pre-motor cortices of the dominant hemispherein 14 healthy subjects. Results showed that, after bipolar anodal tDCS stimulation, brain networks presented a less evident "small world" organization with a global tendency to be more random in its functional connections with respect to prestimulus condition in both hemispheres. Results suggest that tDCS globally modulates the cortical connectivity of the brain, modifying the underlying functional organization of the stimulated networks, which might be related to changes in synaptic efficiency of the motor network and related brain areas. This study demonstrated that graph analysis approach to EEG recordings is able to intercept changes in cortical functions mediated by bipolar anodal tDCS mainly involving the dominant M1 and related motor areas. Concluding, tDCS could be an useful technique to help understanding brain rhythms and their topographic functional organization and specificity.
Graph-based sequence annotation using a data integration approach
Pesch Robert
2008-06-01
Full Text Available The automated annotation of data from high throughput sequencing and genomics experiments is a significant challenge for bioinformatics. Most current approaches rely on sequential pipelines of gene finding and gene function prediction methods that annotate a gene with information from different reference data sources. Each function prediction method contributes evidence supporting a functional assignment. Such approaches generally ignore the links between the information in the reference datasets. These links, however, are valuable for assessing the plausibility of a function assignment and can be used to evaluate the confidence in a prediction. We are working towards a novel annotation system that uses the network of information supporting the function assignment to enrich the annotation process for use by expert curators and predicting the function of previously unannotated genes. In this paper we describe our success in the first stages of this development. We present the data integration steps that are needed to create the core database of integrated reference databases (UniProt, PFAM, PDB, GO and the pathway database Ara- Cyc which has been established in the ONDEX data integration system. We also present a comparison between different methods for integration of GO terms as part of the function assignment pipeline and discuss the consequences of this analysis for improving the accuracy of gene function annotation.
Graph-based sequence annotation using a data integration approach.
Pesch, Robert; Lysenko, Artem; Hindle, Matthew; Hassani-Pak, Keywan; Thiele, Ralf; Rawlings, Christopher; Köhler, Jacob; Taubert, Jan
2008-08-25
The automated annotation of data from high throughput sequencing and genomics experiments is a significant challenge for bioinformatics. Most current approaches rely on sequential pipelines of gene finding and gene function prediction methods that annotate a gene with information from different reference data sources. Each function prediction method contributes evidence supporting a functional assignment. Such approaches generally ignore the links between the information in the reference datasets. These links, however, are valuable for assessing the plausibility of a function assignment and can be used to evaluate the confidence in a prediction. We are working towards a novel annotation system that uses the network of information supporting the function assignment to enrich the annotation process for use by expert curators and predicting the function of previously unannotated genes. In this paper we describe our success in the first stages of this development. We present the data integration steps that are needed to create the core database of integrated reference databases (UniProt, PFAM, PDB, GO and the pathway database Ara-Cyc) which has been established in the ONDEX data integration system. We also present a comparison between different methods for integration of GO terms as part of the function assignment pipeline and discuss the consequences of this analysis for improving the accuracy of gene function annotation. The methods and algorithms presented in this publication are an integral part of the ONDEX system which is freely available from http://ondex.sf.net/.
McGibbney, L. J.; Jiang, Y.; Burgess, A. B.
2017-12-01
Big Earth observation data have been produced, archived and made available online, but discovering the right data in a manner that precisely and efficiently satisfies user needs presents a significant challenge to the Earth Science (ES) community. An emerging trend in information retrieval community is to utilize knowledge graphs to assist users in quickly finding desired information from across knowledge sources. This is particularly prevalent within the fields of social media and complex multimodal information processing to name but a few, however building a domain-specific knowledge graph is labour-intensive and hard to keep up-to-date. In this work, we update our progress on the Earth Science Knowledge Graph (ESKG) project; an ESIP-funded testbed project which provides an automatic approach to building a dynamic knowledge graph for ES to improve interdisciplinary data discovery by leveraging implicit, latent existing knowledge present within across several U.S Federal Agencies e.g. NASA, NOAA and USGS. ESKG strengthens ties between observations and user communities by: 1) developing a knowledge graph derived from various sources e.g. Web pages, Web Services, etc. via natural language processing and knowledge extraction techniques; 2) allowing users to traverse, explore, query, reason and navigate ES data via knowledge graph interaction. ESKG has the potential to revolutionize the way in which ES communities interact with ES data in the open world through the entity, spatial and temporal linkages and characteristics that make it up. This project enables the advancement of ESIP collaboration areas including both Discovery and Semantic Technologies by putting graph information right at our fingertips in an interactive, modern manner and reducing the efforts to constructing ontology. To demonstrate the ESKG concept, we will demonstrate use of our framework across NASA JPL's PO.DAAC, NOAA's Earth Observation Requirements Evaluation System (EORES) and various USGS
Recent Theoretical Approaches to Minimal Artificial Cells
Fabio Mavelli
2014-05-01
Full Text Available Minimal artificial cells (MACs are self-assembled chemical systems able to mimic the behavior of living cells at a minimal level, i.e. to exhibit self-maintenance, self-reproduction and the capability of evolution. The bottom-up approach to the construction of MACs is mainly based on the encapsulation of chemical reacting systems inside lipid vesicles, i.e. chemical systems enclosed (compartmentalized by a double-layered lipid membrane. Several researchers are currently interested in synthesizing such simple cellular models for biotechnological purposes or for investigating origin of life scenarios. Within this context, the properties of lipid vesicles (e.g., their stability, permeability, growth dynamics, potential to host reactions or undergo division processes… play a central role, in combination with the dynamics of the encapsulated chemical or biochemical networks. Thus, from a theoretical standpoint, it is very important to develop kinetic equations in order to explore first—and specify later—the conditions that allow the robust implementation of these complex chemically reacting systems, as well as their controlled reproduction. Due to being compartmentalized in small volumes, the population of reacting molecules can be very low in terms of the number of molecules and therefore their behavior becomes highly affected by stochastic effects both in the time course of reactions and in occupancy distribution among the vesicle population. In this short review we report our mathematical approaches to model artificial cell systems in this complex scenario by giving a summary of three recent simulations studies on the topic of primitive cell (protocell systems.
Theoretical approaches to social innovation – A critical literature review
Butzin, A.; Davis, A.; Domanski, D.; Dhondt, S.; Howaldt, J.; Kaletka, C.; Kesselring, A.; Kopp, R.; Millard, J.; Oeij, P.; Rehfeld, D.; Schaper-Rinkel, P.; Schwartz, M.; Scoppetta, A.; Wagner-Luptacik, P.; Weber, M.
2014-01-01
The SI-DRIVE report “Theoretical approaches to Social Innovation – A Critical Literature Review” delivers a comprehensive overview on the state of the art of theoretically relevant building blocks for advancing a theoretical understanding of social innovation. It collects different theoretical
A Multi-Level Middle-Out Cross-Zooming Approach for Large Graph Analytics
Wong, Pak C.; Mackey, Patrick S.; Cook, Kristin A.; Rohrer, Randall M.; Foote, Harlan P.; Whiting, Mark A.
2009-10-11
This paper presents a working graph analytics model that embraces the strengths of the traditional top-down and bottom-up approaches with a resilient crossover concept to exploit the vast middle-ground information overlooked by the two extreme analytical approaches. Our graph analytics model is developed in collaboration with researchers and users, who carefully studied the functional requirements that reflect the critical thinking and interaction pattern of a real-life intelligence analyst. To evaluate the model, we implement a system prototype, known as GreenHornet, which allows our analysts to test the theory in practice, identify the technological and usage-related gaps in the model, and then adapt the new technology in their work space. The paper describes the implementation of GreenHornet and compares its strengths and weaknesses against the other prevailing models and tools.
iBGP: A Bipartite Graph Propagation Approach for Mobile Advertising Fraud Detection
Hu, Jinlong; Liang, Junjie; Dong, Shoubin
2017-01-01
Online mobile advertising plays a vital financial role in supporting free mobile apps, but detecting malicious apps publishers who generate fraudulent actions on the advertisements hosted on their apps is difficult, since fraudulent traffic often mimics behaviors of legitimate users and evolves rapidly. In this paper, we propose a novel bipartite graph-based propagation approach, iBGP, for mobile apps advertising fraud detection in large advertising system. We exploit the characteristics of m...
Liu, Yuelu; Hong, Xiangfei; Bengson, Jesse J; Kelley, Todd A; Ding, Mingzhou; Mangun, George R
2017-08-15
The neural mechanisms by which intentions are transformed into actions remain poorly understood. We investigated the network mechanisms underlying spontaneous voluntary decisions about where to focus visual-spatial attention (willed attention). Graph-theoretic analysis of two independent datasets revealed that regions activated during willed attention form a set of functionally-distinct networks corresponding to the frontoparietal network, the cingulo-opercular network, and the dorsal attention network. Contrasting willed attention with instructed attention (where attention is directed by external cues), we observed that the dorsal anterior cingulate cortex was allied with the dorsal attention network in instructed attention, but shifted connectivity during willed attention to interact with the cingulo-opercular network, which then mediated communications between the frontoparietal network and the dorsal attention network. Behaviorally, greater connectivity in network hubs, including the dorsolateral prefrontal cortex, the dorsal anterior cingulate cortex, and the inferior parietal lobule, was associated with faster reaction times. These results, shown to be consistent across the two independent datasets, uncover the dynamic organization of functionally-distinct networks engaged to support intentional acts. Copyright © 2017 Elsevier Inc. All rights reserved.
Wang, Jieqiong; Li, Ting; Xian, Junfang; Wang, Ningli; He, Huiguang
2016-01-01
Most previous glaucoma studies with resting-state fMRI have focused on the neuronal activity in the individual structure of the brain, yet ignored the functional communication of anatomically separated structures. The purpose of this study is to investigate the efficiency of the functional communication change or not in glaucoma patients. We applied the resting-state fMRI data to construct the connectivity network of 25 normal controls and 25 age-gender-matched primary open angle glaucoma patients. Graph theoretical analysis was performed to assess brain network pattern differences between the two groups. No significant differences of the global network measures were found between the two groups. However, the local measures were radically reorganized in glaucoma patients. Comparing with the hub regions in normal controls' network, we found that six hub regions disappeared and nine hub regions appeared in the network of patients. In addition, the betweenness centralities of two altered hub regions, right fusiform gyrus and right lingual gyrus, were significantly correlated with the visual field mean deviation. Although the efficiency of functional communication is preserved in the brain network of the glaucoma at the global level, the efficiency of functional communication is altered in some specialized regions of the glaucoma. (orig.)
Wang, Jieqiong [Chinese Academy of Sciences, State Key Laboratory of Management and Control for Complex Systems, Institute of Automation, Beijing (China); Li, Ting; Xian, Junfang [Capital Medical University, Department of Radiology, Beijing Tongren Hospital, Beijing (China); Wang, Ningli [Capital Medical University, Department of Ophthalmology, Beijing Tongren Hospital, Beijing (China); He, Huiguang [Chinese Academy of Sciences, State Key Laboratory of Management and Control for Complex Systems, Institute of Automation, Beijing (China); Chinese Academy of Sciences, Research Center for Brain-Inspired Intelligence, Institute of Automation, Beijing (China)
2016-11-15
Most previous glaucoma studies with resting-state fMRI have focused on the neuronal activity in the individual structure of the brain, yet ignored the functional communication of anatomically separated structures. The purpose of this study is to investigate the efficiency of the functional communication change or not in glaucoma patients. We applied the resting-state fMRI data to construct the connectivity network of 25 normal controls and 25 age-gender-matched primary open angle glaucoma patients. Graph theoretical analysis was performed to assess brain network pattern differences between the two groups. No significant differences of the global network measures were found between the two groups. However, the local measures were radically reorganized in glaucoma patients. Comparing with the hub regions in normal controls' network, we found that six hub regions disappeared and nine hub regions appeared in the network of patients. In addition, the betweenness centralities of two altered hub regions, right fusiform gyrus and right lingual gyrus, were significantly correlated with the visual field mean deviation. Although the efficiency of functional communication is preserved in the brain network of the glaucoma at the global level, the efficiency of functional communication is altered in some specialized regions of the glaucoma. (orig.)
Zhang, Yongping; Shang, Pengjian; Xiong, Hui; Xia, Jianan
Time irreversibility is an important property of nonequilibrium dynamic systems. A visibility graph approach was recently proposed, and this approach is generally effective to measure time irreversibility of time series. However, its result may be unreliable when dealing with high-dimensional systems. In this work, we consider the joint concept of time irreversibility and adopt the phase-space reconstruction technique to improve this visibility graph approach. Compared with the previous approach, the improved approach gives a more accurate estimate for the irreversibility of time series, and is more effective to distinguish irreversible and reversible stochastic processes. We also use this approach to extract the multiscale irreversibility to account for the multiple inherent dynamics of time series. Finally, we apply the approach to detect the multiscale irreversibility of financial time series, and succeed to distinguish the time of financial crisis and the plateau. In addition, Asian stock indexes away from other indexes are clearly visible in higher time scales. Simulations and real data support the effectiveness of the improved approach when detecting time irreversibility.
Zabiniako Vitaly
2014-12-01
Full Text Available In this article, the authors perform an analysis in order to assess adaptation of magnetic force-directed algorithms for context-based information extraction from multi-attributed graphs during visualization sessions. Theoretic standings behind magnetic force-directed approach are stated together with review on how particular features of respective algorithms in combination with appropriate visual techniques are especially suitable for improved processing and presenting of knowledge that is captured in form of graphs. The complexity of retrieving multi-attributed information within the proposed approach is handled with dedicated tools, such as selective attraction of nodes to MFE (Magnetic Force Emitter based on search criteria, localization of POI (Point of Interest regions, graph node anchoring, etc. Implicit compatibility of aforementioned tools with interactive nature of data exploration is distinguished. Description of case study, based on bibliometric network analysis is given, which is followed by the review of existing related works in this field. Conclusions are made and further studies in the field of visualization of multi-attributed graphs are defined.
Zhang, Huaguang; Feng, Tao; Yang, Guang-Hong; Liang, Hongjing
2015-07-01
In this paper, the inverse optimal approach is employed to design distributed consensus protocols that guarantee consensus and global optimality with respect to some quadratic performance indexes for identical linear systems on a directed graph. The inverse optimal theory is developed by introducing the notion of partial stability. As a result, the necessary and sufficient conditions for inverse optimality are proposed. By means of the developed inverse optimal theory, the necessary and sufficient conditions are established for globally optimal cooperative control problems on directed graphs. Basic optimal cooperative design procedures are given based on asymptotic properties of the resulting optimal distributed consensus protocols, and the multiagent systems can reach desired consensus performance (convergence rate and damping rate) asymptotically. Finally, two examples are given to illustrate the effectiveness of the proposed methods.
A Graph Cut Approach to Artery/Vein Classification in Ultra-Widefield Scanning Laser Ophthalmoscopy.
Pellegrini, Enrico; Robertson, Gavin; MacGillivray, Tom; van Hemert, Jano; Houston, Graeme; Trucco, Emanuele
2018-02-01
The classification of blood vessels into arterioles and venules is a fundamental step in the automatic investigation of retinal biomarkers for systemic diseases. In this paper, we present a novel technique for vessel classification on ultra-wide-field-of-view images of the retinal fundus acquired with a scanning laser ophthalmoscope. To the best of our knowledge, this is the first time that a fully automated artery/vein classification technique for this type of retinal imaging with no manual intervention has been presented. The proposed method exploits hand-crafted features based on local vessel intensity and vascular morphology to formulate a graph representation from which a globally optimal separation between the arterial and venular networks is computed by graph cut approach. The technique was tested on three different data sets (one publicly available and two local) and achieved an average classification accuracy of 0.883 in the largest data set.
Child Language Acquisition: Contrasting Theoretical Approaches
Ambridge, Ben; Lieven, Elena V. M.
2011-01-01
Is children's language acquisition based on innate linguistic structures or built from cognitive and communicative skills? This book summarises the major theoretical debates in all of the core domains of child language acquisition research (phonology, word-learning, inflectional morphology, syntax and binding) and includes a complete introduction…
A game theoretic approach to assignment problems
Klijn, F.
2000-01-01
Game theory deals with the mathematical modeling and analysis of conflict and cooperation in the interaction of multiple decision makers. This thesis adopts two game theoretic methods to analyze a range of assignment problems that arise in various economic situations. The first method has as
Michel Feidt
2012-03-01
Full Text Available In recent decades, the approach known as Finite-Time Thermodynamics has provided a fruitful theoretical framework for the optimization of heat engines operating between a heat source (at temperature and a heat sink (at temperature . The aim of this paper is to propose a more complete approach based on the association of Finite-Time Thermodynamics and the Bond-Graph approach for modeling endoreversible heat engines. This approach makes it possible for example to find in a simple way the characteristics of the optimal operating point at which the maximum mechanical power of the endoreversible heat engine is obtained with entropy flow rate as control variable. Furthermore it provides the analytical expressions of the optimal operating point of an irreversible heat engine where the energy conversion is accompanied by irreversibilities related to internal heat transfer and heat dissipation phenomena. This original approach, applied to an analysis of the performance of a thermoelectric generator, will be the object of a future publication.
Game Theoretical Approach to Supply Chain Microfinance
Sim , Jaehun; Prabhu , Vittaldas ,
2013-01-01
Part 1: Sustainable Production; International audience; This paper considers a supply chain microfinance model in which a manufacturer acts as a lender and a raw material supplier as a borrower. Using a game theoretical analysis, the study investigates how investment levels, raw material prices, and profit margins are influenced by loan interest rates under two types of decentralized channel policies: manufacturer Stackelberg and vertical Nash game. In addition, the study shows how the profit...
Mining chemical reactions using neighborhood behavior and condensed graphs of reactions approaches.
de Luca, Aurélie; Horvath, Dragos; Marcou, Gilles; Solov'ev, Vitaly; Varnek, Alexandre
2012-09-24
This work addresses the problem of similarity search and classification of chemical reactions using Neighborhood Behavior (NB) and Condensed Graphs of Reaction (CGR) approaches. The CGR formalism represents chemical reactions as a classical molecular graph with dynamic bonds, enabling descriptor calculations on this graph. Different types of the ISIDA fragment descriptors generated for CGRs in combination with two metrics--Tanimoto and Euclidean--were considered as chemical spaces, to serve for reaction dissimilarity scoring. The NB method has been used to select an optimal combination of descriptors which distinguish different types of chemical reactions in a database containing 8544 reactions of 9 classes. Relevance of NB analysis has been validated in generic (multiclass) similarity search and in clustering with Self-Organizing Maps (SOM). NB-compliant sets of descriptors were shown to display enhanced mapping propensities, allowing the construction of better Self-Organizing Maps and similarity searches (NB and classical similarity search criteria--AUC ROC--correlate at a level of 0.7). The analysis of the SOM clusters proved chemically meaningful CGR substructures representing specific reaction signatures.
Key Concept Identification: A Comprehensive Analysis of Frequency and Topical Graph-Based Approaches
Muhammad Aman
2018-05-01
Full Text Available Automatic key concept extraction from text is the main challenging task in information extraction, information retrieval and digital libraries, ontology learning, and text analysis. The statistical frequency and topical graph-based ranking are the two kinds of potentially powerful and leading unsupervised approaches in this area, devised to address the problem. To utilize the potential of these approaches and improve key concept identification, a comprehensive performance analysis of these approaches on datasets from different domains is needed. The objective of the study presented in this paper is to perform a comprehensive empirical analysis of selected frequency and topical graph-based algorithms for key concept extraction on three different datasets, to identify the major sources of error in these approaches. For experimental analysis, we have selected TF-IDF, KP-Miner and TopicRank. Three major sources of error, i.e., frequency errors, syntactical errors and semantical errors, and the factors that contribute to these errors are identified. Analysis of the results reveals that performance of the selected approaches is significantly degraded by these errors. These findings can help us develop an intelligent solution for key concept extraction in the future.
Generating random networks and graphs
Coolen, Ton; Roberts, Ekaterina
2017-01-01
This book supports researchers who need to generate random networks, or who are interested in the theoretical study of random graphs. The coverage includes exponential random graphs (where the targeted probability of each network appearing in the ensemble is specified), growth algorithms (i.e. preferential attachment and the stub-joining configuration model), special constructions (e.g. geometric graphs and Watts Strogatz models) and graphs on structured spaces (e.g. multiplex networks). The presentation aims to be a complete starting point, including details of both theory and implementation, as well as discussions of the main strengths and weaknesses of each approach. It includes extensive references for readers wishing to go further. The material is carefully structured to be accessible to researchers from all disciplines while also containing rigorous mathematical analysis (largely based on the techniques of statistical mechanics) to support those wishing to further develop or implement the theory of rand...
On characterizing terrain visibility graphs
William Evans
2015-06-01
Full Text Available A terrain is an $x$-monotone polygonal line in the $xy$-plane. Two vertices of a terrain are mutually visible if and only if there is no terrain vertex on or above the open line segment connecting them. A graph whose vertices represent terrain vertices and whose edges represent mutually visible pairs of terrain vertices is called a terrain visibility graph. We would like to find properties that are both necessary and sufficient for a graph to be a terrain visibility graph; that is, we would like to characterize terrain visibility graphs.Abello et al. [Discrete and Computational Geometry, 14(3:331--358, 1995] showed that all terrain visibility graphs are “persistent”. They showed that the visibility information of a terrain point set implies some ordering requirements on the slopes of the lines connecting pairs of points in any realization, and as a step towards showing sufficiency, they proved that for any persistent graph $M$ there is a total order on the slopes of the (pseudo lines in a generalized configuration of points whose visibility graph is $M$.We give a much simpler proof of this result by establishing an orientation to every triple of vertices, reflecting some slope ordering requirements that are consistent with $M$ being the visibility graph, and prove that these requirements form a partial order. We give a faster algorithm to construct a total order on the slopes. Our approach attempts to clarify the implications of the graph theoretic properties on the ordering of the slopes, and may be interpreted as defining properties on an underlying oriented matroid that we show is a restricted type of $3$-signotope.
Quantum information processing with graph states
Schlingemann, Dirk-Michael
2005-04-01
Graph states are multiparticle states which are associated with graphs. Each vertex of the graph corresponds to a single system or particle. The links describe quantum correlations (entanglement) between pairs of connected particles. Graph states were initiated independently by two research groups: On the one hand, graph states were introduced by Briegel and Raussendorf as a resource for a new model of one-way quantum computing, where algorithms are implemented by a sequence of measurements at single particles. On the other hand, graph states were developed by the author of this thesis and ReinhardWerner in Braunschweig, as a tool to build quantum error correcting codes, called graph codes. The connection between the two approaches was fully realized in close cooperation of both research groups. This habilitation thesis provides a survey of the theory of graph codes, focussing mainly, but not exclusively on the author's own research work. We present the theoretical and mathematical background for the analysis of graph codes. The concept of one-way quantum computing for general graph states is discussed. We explicitly show how to realize the encoding and decoding device of a graph code on a one-way quantum computer. This kind of implementation is to be seen as a mathematical description of a quantum memory device. In addition to that, we investigate interaction processes, which enable the creation of graph states on very large systems. Particular graph states can be created, for instance, by an Ising type interaction between next neighbor particles which sits at the points of an infinitely extended cubic lattice. Based on the theory of quantum cellular automata, we give a constructive characterization of general interactions which create a translationally invariant graph state. (orig.)
Mooney, Barbara Logan; Corrales, L René; Clark, Aurora E
2012-03-30
This work discusses scripts for processing molecular simulations data written using the software package R: A Language and Environment for Statistical Computing. These scripts, named moleculaRnetworks, are intended for the geometric and solvent network analysis of aqueous solutes and can be extended to other H-bonded solvents. New algorithms, several of which are based on graph theory, that interrogate the solvent environment about a solute are presented and described. This includes a novel method for identifying the geometric shape adopted by the solvent in the immediate vicinity of the solute and an exploratory approach for describing H-bonding, both based on the PageRank algorithm of Google search fame. The moleculaRnetworks codes include a preprocessor, which distills simulation trajectories into physicochemical data arrays, and an interactive analysis script that enables statistical, trend, and correlation analysis, and other data mining. The goal of these scripts is to increase access to the wealth of structural and dynamical information that can be obtained from molecular simulations. Copyright © 2012 Wiley Periodicals, Inc.
UNCERTAINTY IN NEOCLASSICAL AND KEYNESIAN THEORETICAL APPROACHES: A BEHAVIOURAL PERSPECTIVE
Sinziana BALTATESCU
2015-11-01
Full Text Available The ”mainstream” neoclassical assumptions about human economic behavior are currently challenged by both behavioural researches on human behaviour and other theoretical approaches which, in the context of the recent economic and financial crisis find arguments to reinforce their theoretical statements. The neoclassical “perfect rationality” assumption is most criticized and provokes the mainstream theoretical approach to efforts of revisiting the theoretical framework in order to re-state the economic models validity. Uncertainty seems, in this context, to be the concept that allows other theoretical approaches to take into consideration a more realistic individual from the psychological perspective. This paper is trying to present a comparison between the neoclassical and Keynesian approach of the uncertainty, considering the behavioural arguments and challenges addressed to the mainstream theory.
A Bond Graph Approach for the Modeling and Simulation of a Buck Converter
Rached Zrafi
2018-01-01
Full Text Available This paper deals with the modeling of bond graph buck converter systems. The bond graph formalism, which represents a heterogeneous formalism for physical modeling, is used to design a sub-model of a power MOSFET and PiN diode switchers. These bond graph models are based on the device’s electrical elements. The application of these models to a bond graph buck converter permit us to obtain an invariant causal structure when the switch devices change state. This paper shows the usefulness of the bond graph device’s modeling to simulate an implicit bond graph buck converter.
THE NETWORKS IN TOURISM: A THEORETICAL APPROACH
Maria TĂTĂRUȘANU
2016-12-01
Full Text Available The economic world in which tourism companies act today is in a continuous changing process. The most important factor of these changes is the globalization of their environment, both in economic, social, natural and cultural aspects. The tourism companies can benefit from the opportunities brought by globalization, but also could be menaced by the new context. How could react the companies to these changes in order to create and maintain long term competitive advantage for their business? In the present paper we make a literature review of the new tourism companies´ business approach: the networks - a result and/or a reason for exploiting the opportunities or, on the contrary, for keeping their actual position on the market. It’s a qualitative approach and the research methods used are analyses, synthesis, abstraction, which are considered the most appropriate to achieve the objective of the paper.
Theoretical approach to the scanning tunneling microscope
Noguera, C.
1990-01-01
Within a one-electron approach, based on a Green's-function formalism, a nonperturbative expression for the tunneling current is obtained and used to discuss which spectroscopic information may be deduced from a scanning-tunneling-microscope experiment. It is shown up to which limits the voltage dependence of the tunneling current reproduces the local density of states at the surface, and how the reflection coefficients of the electronic waves at the surface may modify it
MEDICAL BRAIN DRAIN - A THEORETICAL APPROACH
Boncea Irina
2013-07-01
Full Text Available Medical brain drain is defined as the migration of health personnel from developing countries to developed countries and between industrialized nations in search for better opportunities. This phenomenon became a global growing concern due to its impact on both the donor and the destination countries. This article aims to present the main theoretical contributions starting from 1950 until today and the historical evolution, in the attempt of correlating the particular case of medical brain drain with the theory and evolution of the brain drain in general. This article raises questions and offers answers, identifies the main issues and looks for possible solutions in order to reduce the emigration of medical doctors. Factors of influence include push (low level of income, poor working conditions, the absence of job openings and social recognition, oppressive political climate and pull (better remuneration and working conditions, prospects for career development, job satisfaction, security factors. Developing countries are confronting with the loss of their most valuable intellectuals and the investment in their education, at the benefit of developed nations. An ethical debate arises as the disparities between countries increases, industrialized nations filling in the gaps in health systems with professionals from countries already facing shortages. However, recent literature emphasizes the possibility of a “beneficial brain drain” through education incentives offered by the emigration prospects. Other sources of “brain gain” for donor country are the remittances, the scientific networks and return migration. Measures to stem the medical brain drain involve the common effort and collaboration between developing and developed countries and international organizations. Measures adopted by donor countries include higher salaries, better working conditions, security, career opportunities, incentives to stimulate return migration. Destination
Komachi, Mamoru; Kudo, Taku; Shimbo, Masashi; Matsumoto, Yuji
Bootstrapping has a tendency, called semantic drift, to select instances unrelated to the seed instances as the iteration proceeds. We demonstrate the semantic drift of Espresso-style bootstrapping has the same root as the topic drift of Kleinberg's HITS, using a simplified graph-based reformulation of bootstrapping. We confirm that two graph-based algorithms, the von Neumann kernels and the regularized Laplacian, can reduce the effect of semantic drift in the task of word sense disambiguation (WSD) on Senseval-3 English Lexical Sample Task. Proposed algorithms achieve superior performance to Espresso and previous graph-based WSD methods, even though the proposed algorithms have less parameters and are easy to calibrate.
The dynamics of alliances. A game theoretical approach
Ridder, A. de
2007-01-01
In this dissertation, Annelies de Ridder presents a game theoretical approach to strategic alliances. More specifically, the dynamics of and within alliances have been studied. To do so, four new models have been developed in the game theoretical tradition. Both coalition theory and strategic game
Gould, Ronald
2012-01-01
This introduction to graph theory focuses on well-established topics, covering primary techniques and including both algorithmic and theoretical problems. The algorithms are presented with a minimum of advanced data structures and programming details. This thoroughly corrected 1988 edition provides insights to computer scientists as well as advanced undergraduates and graduate students of topology, algebra, and matrix theory. Fundamental concepts and notation and elementary properties and operations are the first subjects, followed by examinations of paths and searching, trees, and networks. S
Social representations: a theoretical approach in health
Isaiane Santos Bittencourt
2011-03-01
Full Text Available Objective: To present the theory of social representations, placing its epistemology and knowing the basic concepts of its approach as a structural unit of knowledge for health studies. Justification: The use of this theory comes from the need to understand social eventsunder the lens of the meanings constructed by the community. Data Synthesis: This was a descriptive study of literature review, which used as a source of data collection the classical authors of social representations supported by articles from electronic search at Virtual Health Library (VHL. The definition and discussion of collected data enabled to introduce two themes, versed on the history and epistemology of representations and on the structuralapproach of representations in health studies. Conclusion: This review allowed highlight the importance of locating the objects of study with regard to contextual issues of individual and collective histories, valuing the plurality of relations, to come closer to reality that is represented by the subjects.
Computational and Game-Theoretic Approaches for Modeling Bounded Rationality
L. Waltman (Ludo)
2011-01-01
textabstractThis thesis studies various computational and game-theoretic approaches to economic modeling. Unlike traditional approaches to economic modeling, the approaches studied in this thesis do not rely on the assumption that economic agents behave in a fully rational way. Instead, economic
A relevance theoretic approach to intertextuality in print advertising
Anonymous vs. acknowledged intertexts: A relevance theoretic approach to intertextuality in print advertising. ... make intertextual references to texts from mass media genres other than advertising as part of an ... AJOL African Journals Online.
Eric Vaz
2013-12-01
Full Text Available Urban sprawl and growth has experienced increased concern in geographic and environmental literature. Preceding the existence of robust frameworks found in regional and urban planning, as well as urban geography and economics, the spatial properties of allocation of urban land use are still far from being completely understood. This is largely due to the underlying complexity of the change found at the spatial level of urban land use, merging social, economic and natural drivers. The spatial patterns formed, and the connectivity established among the different subsets of land-use types, becomes a complex network of interactions over time, helping to shape the structure of the city. The possibility to merge the configuration of land-use with complex networks may be assessed elegantly through graph theory. Nodes and edges can become abstract representations of typologies of space and are represented into a topological space of different land use types which traditionally share common spatial boundaries. Within a regional framework, the links between adjacent and neighboring urban land use types become better understood, by means of a KamadaKawai algorithm. This study uses land use in Lisbon over three years, 1990, 2000 and 2006, to develop a Kamada-Kawai graph interpretation of land-use as a result of neighboring power. The rapid change witnessed in Lisbon since the nineties, as well as the availability of CORINE Land Cover data in these three time stamps, permits a reflection on anthropogenic land-use change in urban and semi-urban areas in Portugal’s capital. This paper responds to (1 the structure and connectivity of urban land use over time, demonstrating that most of the agricultural land is stressed to transform to urban, gaining a central role in future. (2 Offer a systemic approach to land-use transitions generating what we call spatial memory, where land use change is often unpredictable over space, but becomes evident in a graph theory
Theoretical approaches to lightness and perception.
Gilchrist, Alan
2015-01-01
. Evidence for and against these approaches is reviewed.
A Selectivity based approach to Continuous Pattern Detection in Streaming Graphs
Choudhury, Sutanay; Holder, Larry; Chin, George; Agarwal, Khushbu; Feo, John T.
2015-05-27
Cyber security is one of the most significant technical challenges in current times. Detecting adversarial activities, prevention of theft of intellectual properties and customer data is a high priority for corporations and government agencies around the world. Cyber defenders need to analyze massive-scale, high-resolution network flows to identify, categorize, and mitigate attacks involving networks spanning institutional and national boundaries. Many of the cyber attacks can be described as subgraph patterns, with prominent examples being insider infiltrations (path queries), denial of service (parallel paths) and malicious spreads (tree queries). This motivates us to explore subgraph matching on streaming graphs in a continuous setting. The novelty of our work lies in using the subgraph distributional statistics collected from the streaming graph to determine the query processing strategy. We introduce a ``Lazy Search" algorithm where the search strategy is decided on a vertex-to-vertex basis depending on the likelihood of a match in the vertex neighborhood. We also propose a metric named ``Relative Selectivity" that is used to select between different query processing strategies. Our experiments performed on real online news, network traffic stream and a synthetic social network benchmark demonstrate 10-100x speedups over non-incremental, selectivity agnostic approaches.
The Epstein-Glaser approach to perturbative quantum field theory: graphs and Hopf algebras
Lange, Alexander
2005-01-01
The paper aims at investigating perturbative quantum field theory in the approach of Epstein and Glaser (EG) and, in particular, its formulation in the language of graphs and Hopf algebras (HAs). Various HAs are encountered, each one associated with a special combination of physical concepts such as normalization, localization, pseudounitarity, causal regularization, and renormalization. The algebraic structures, representing the perturbative expansion of the S-matrix, are imposed on operator-valued distributions equipped with appropriate graph indices. Translation invariance ensures the algebras to be analytically well defined and graded total symmetry allows to formulate bialgebras. The algebraic results are given embedded in the corresponding physical framework, covering the two EG versions by Fredenhagen and Scharf that differ with respect to the concrete recursive implementation of causality. Besides, the ultraviolet divergences occurring in Feynman's representation are mathematically reasoned. As a final result, the change of the renormalization scheme in the context of EG is modeled via a HA and interpreted as the EG analog of Kreimer's HA
Forecasting Construction Cost Index based on visibility graph: A network approach
Zhang, Rong; Ashuri, Baabak; Shyr, Yu; Deng, Yong
2018-03-01
Engineering News-Record (ENR), a professional magazine in the field of global construction engineering, publishes Construction Cost Index (CCI) every month. Cost estimators and contractors assess projects, arrange budgets and prepare bids by forecasting CCI. However, fluctuations and uncertainties of CCI cause irrational estimations now and then. This paper aims at achieving more accurate predictions of CCI based on a network approach in which time series is firstly converted into a visibility graph and future values are forecasted relied on link prediction. According to the experimental results, the proposed method shows satisfactory performance since the error measures are acceptable. Compared with other methods, the proposed method is easier to implement and is able to forecast CCI with less errors. It is convinced that the proposed method is efficient to provide considerably accurate CCI predictions, which will make contributions to the construction engineering by assisting individuals and organizations in reducing costs and making project schedules.
Dramaturgical and Music-Theoretical Approaches to Improvisation Pedagogy
Huovinen, Erkki; Tenkanen, Atte; Kuusinen, Vesa-Pekka
2011-01-01
The aim of this article is to assess the relative merits of two approaches to teaching musical improvisation: a music-theoretical approach, focusing on chords and scales, and a "dramaturgical" one, emphasizing questions of balance, variation and tension. Adult students of music pedagogy, with limited previous experience in improvisation,…
Preservation of Newspapers: Theoretical Approaches and Practical Achievements
Hasenay, Damir; Krtalic, Maja
2010-01-01
The preservation of newspapers is the main topic of this paper. A theoretical overview of newspaper preservation is given, with an emphasis on the importance of a systematic and comprehensive approach. Efficient newspaper preservation implies understanding the meaning of preservation in general, as well as understanding specific approaches,…
Hosseini, S M Hadi; Hoeft, Fumiko; Kesler, Shelli R
2012-01-01
In recent years, graph theoretical analyses of neuroimaging data have increased our understanding of the organization of large-scale structural and functional brain networks. However, tools for pipeline application of graph theory for analyzing topology of brain networks is still lacking. In this report, we describe the development of a graph-analysis toolbox (GAT) that facilitates analysis and comparison of structural and functional network brain networks. GAT provides a graphical user interface (GUI) that facilitates construction and analysis of brain networks, comparison of regional and global topological properties between networks, analysis of network hub and modules, and analysis of resilience of the networks to random failure and targeted attacks. Area under a curve (AUC) and functional data analyses (FDA), in conjunction with permutation testing, is employed for testing the differences in network topologies; analyses that are less sensitive to the thresholding process. We demonstrated the capabilities of GAT by investigating the differences in the organization of regional gray-matter correlation networks in survivors of acute lymphoblastic leukemia (ALL) and healthy matched Controls (CON). The results revealed an alteration in small-world characteristics of the brain networks in the ALL survivors; an observation that confirm our hypothesis suggesting widespread neurobiological injury in ALL survivors. Along with demonstration of the capabilities of the GAT, this is the first report of altered large-scale structural brain networks in ALL survivors.
S M Hadi Hosseini
Full Text Available In recent years, graph theoretical analyses of neuroimaging data have increased our understanding of the organization of large-scale structural and functional brain networks. However, tools for pipeline application of graph theory for analyzing topology of brain networks is still lacking. In this report, we describe the development of a graph-analysis toolbox (GAT that facilitates analysis and comparison of structural and functional network brain networks. GAT provides a graphical user interface (GUI that facilitates construction and analysis of brain networks, comparison of regional and global topological properties between networks, analysis of network hub and modules, and analysis of resilience of the networks to random failure and targeted attacks. Area under a curve (AUC and functional data analyses (FDA, in conjunction with permutation testing, is employed for testing the differences in network topologies; analyses that are less sensitive to the thresholding process. We demonstrated the capabilities of GAT by investigating the differences in the organization of regional gray-matter correlation networks in survivors of acute lymphoblastic leukemia (ALL and healthy matched Controls (CON. The results revealed an alteration in small-world characteristics of the brain networks in the ALL survivors; an observation that confirm our hypothesis suggesting widespread neurobiological injury in ALL survivors. Along with demonstration of the capabilities of the GAT, this is the first report of altered large-scale structural brain networks in ALL survivors.
An original approach to the mathematical concept of graph from braid crafts
Albanese Veronica
2016-01-01
Full Text Available In previous researches we found that a community of Argentinean artisans models its own practices of braiding using graphs. Inspired by these findings, we designed an educational activity to introduce the concept of graphs. The study of graphs helps students to develop combinatorial and systematic thinking as well as skills to model reality and abstract and generalize patterns from particular situations. The tasks proposed aim to construct the concept of graphs, then identify characteristics that allow some graphs to be models of braids and finally use them to invent more graphs for new braids. The activity performed in a secondary school teachers’ educational course, had quite satisfactory results due to the number of braids invented and the small amount of mistakes made by the participants.
One-dimensional barcode reading: an information theoretic approach
Houni, Karim; Sawaya, Wadih; Delignon, Yves
2008-03-01
In the convergence context of identification technology and information-data transmission, the barcode found its place as the simplest and the most pervasive solution for new uses, especially within mobile commerce, bringing youth to this long-lived technology. From a communication theory point of view, a barcode is a singular coding based on a graphical representation of the information to be transmitted. We present an information theoretic approach for 1D image-based barcode reading analysis. With a barcode facing the camera, distortions and acquisition are modeled as a communication channel. The performance of the system is evaluated by means of the average mutual information quantity. On the basis of this theoretical criterion for a reliable transmission, we introduce two new measures: the theoretical depth of field and the theoretical resolution. Simulations illustrate the gain of this approach.
Lee, Kyu J.; Kunii, T. L.; Noma, T.
1993-01-01
In this paper, we propose a syntactic pattern recognition method for non-schematic drawings, based on a new attributed graph grammar with flexible embedding. In our graph grammar, the embedding rule permits the nodes of a guest graph to be arbitrarily connected with the nodes of a host graph. The ambiguity caused by this flexible embedding is controlled with the evaluation of synthesized attributes and the check of context sensitivity. To integrate parsing with the synthesized attribute evaluation and the context sensitivity check, we also develop a bottom up parsing algorithm.
Molecular approach of uranyl/mineral surfaces: theoretical approach
Roques, J.
2009-01-01
As migration of radio-toxic elements through the geosphere is one of the processes which may affect the safety of a radioactive waste storage site, the author shows that numerical modelling is a support to experimental result exploitation, and allows the development of new interpretation and prediction codes. He shows that molecular modelling can be used to study processes of interaction between an actinide ion (notably a uranyl ion) and a mineral surface (a TiO 2 substrate). He also reports the predictive theoretical study of the interaction between an uranyl ion and a gibbsite substrate
BEHAVIORAL INPUTS TO THE THEORETICAL APPROACH OF THE ECONOMIC CRISIS
Sinziana BALTATESCU
2015-09-01
Full Text Available The current economic and financial crisis gave room for the theoretical debates to reemerge. The economic reality challenged the mainstream neoclassical approach leaving the opportunity for the Austrian School, Post Keynesianism or Institutionalists to bring in front theories that seem to better explain the economic crisis and thus, leaving space for more efficient economic policies to result. In this context, the main assumptions of the mainstream theoretical approach are challenged and reevaluated, behavioral economics is one of the main challengers. Without developing in an integrated school of thought yet, behavioral economics brings new elements within the framework of economic thinking. How are the main theoretical approaches integrating these new elements and whether this process is going to narrow the theory or enrich it to be more comprehensive are questions to which this paper tries to answer, or, at least, to leave room for an answer.
Designing a graph-based approach to landscape ecological assessment of linear infrastructures
Girardet, Xavier, E-mail: xavier.girardet@univ-fcomte.fr; Foltête, Jean-Christophe, E-mail: jean-christophe.foltete@univ-fcomte.fr; Clauzel, Céline, E-mail: celine.clauzel@univ-fcomte.fr
2013-09-15
The development of major linear infrastructures contributes to landscape fragmentation and impacts natural habitats and biodiversity in various ways. To anticipate and minimize such impacts, landscape planning needs to be capable of effective strategic environmental assessment (SEA) and of supporting environmental impact assessment (EIA) decisions. To this end, species distribution models (SDMs) are an effective way of making predictive maps of the presence of a given species. In this paper, we propose to combine SDMs and graph-based representation of landscape networks to integrate the potential long-distance effect of infrastructures on species distribution. A diachronic approach, comparing distribution before and after the linear infrastructure is constructed, leads to the design of a species distribution assessment (SDA), taking into account population isolation. The SDA makes it possible (1) to estimate the local variation in probability of presence and (2) to characterize the impact of the infrastructure in terms of global variation in presence and of distance of disturbance. The method is illustrated by assessing the impact of the construction of a high-speed railway line on the distribution of several virtual species in Franche-Comté (France). The study shows the capacity of the SDA to characterize the impact of a linear infrastructure either as a research concern or as a spatial planning challenge. SDAs could be helpful in deciding among several scenarios for linear infrastructure routes or for the location of mitigation measures. -- Highlights: • Graph connectivity metrics were integrated into a species distribution model. • SDM was performed before and after the implementation of linear infrastructure. • The local variation of presence provides spatial indicators of the impact.
AN INTEGRATED RANSAC AND GRAPH BASED MISMATCH ELIMINATION APPROACH FOR WIDE-BASELINE IMAGE MATCHING
M. Hasheminasab
2015-12-01
Full Text Available In this paper we propose an integrated approach in order to increase the precision of feature point matching. Many different algorithms have been developed as to optimizing the short-baseline image matching while because of illumination differences and viewpoints changes, wide-baseline image matching is so difficult to handle. Fortunately, the recent developments in the automatic extraction of local invariant features make wide-baseline image matching possible. The matching algorithms which are based on local feature similarity principle, using feature descriptor as to establish correspondence between feature point sets. To date, the most remarkable descriptor is the scale-invariant feature transform (SIFT descriptor , which is invariant to image rotation and scale, and it remains robust across a substantial range of affine distortion, presence of noise, and changes in illumination. The epipolar constraint based on RANSAC (random sample consensus method is a conventional model for mismatch elimination, particularly in computer vision. Because only the distance from the epipolar line is considered, there are a few false matches in the selected matching results based on epipolar geometry and RANSAC. Aguilariu et al. proposed Graph Transformation Matching (GTM algorithm to remove outliers which has some difficulties when the mismatched points surrounded by the same local neighbor structure. In this study to overcome these limitations, which mentioned above, a new three step matching scheme is presented where the SIFT algorithm is used to obtain initial corresponding point sets. In the second step, in order to reduce the outliers, RANSAC algorithm is applied. Finally, to remove the remained mismatches, based on the adjacent K-NN graph, the GTM is implemented. Four different close range image datasets with changes in viewpoint are utilized to evaluate the performance of the proposed method and the experimental results indicate its robustness and
Designing a graph-based approach to landscape ecological assessment of linear infrastructures
Girardet, Xavier; Foltête, Jean-Christophe; Clauzel, Céline
2013-01-01
The development of major linear infrastructures contributes to landscape fragmentation and impacts natural habitats and biodiversity in various ways. To anticipate and minimize such impacts, landscape planning needs to be capable of effective strategic environmental assessment (SEA) and of supporting environmental impact assessment (EIA) decisions. To this end, species distribution models (SDMs) are an effective way of making predictive maps of the presence of a given species. In this paper, we propose to combine SDMs and graph-based representation of landscape networks to integrate the potential long-distance effect of infrastructures on species distribution. A diachronic approach, comparing distribution before and after the linear infrastructure is constructed, leads to the design of a species distribution assessment (SDA), taking into account population isolation. The SDA makes it possible (1) to estimate the local variation in probability of presence and (2) to characterize the impact of the infrastructure in terms of global variation in presence and of distance of disturbance. The method is illustrated by assessing the impact of the construction of a high-speed railway line on the distribution of several virtual species in Franche-Comté (France). The study shows the capacity of the SDA to characterize the impact of a linear infrastructure either as a research concern or as a spatial planning challenge. SDAs could be helpful in deciding among several scenarios for linear infrastructure routes or for the location of mitigation measures. -- Highlights: • Graph connectivity metrics were integrated into a species distribution model. • SDM was performed before and after the implementation of linear infrastructure. • The local variation of presence provides spatial indicators of the impact
Expert and Novice Approaches to Using Graphs: Evidence from Eye-Track Experiments
Wirth, K. R.; Lindgren, J. M.
2015-12-01
Professionals and students in geology use an array of graphs to study the earth, but relatively little detail is known about how users interact with these graphs. Comprehension of graphical information in the earth sciences is further complicated by the common use of non-traditional formats (e.g., inverted axes, logarithmic scales, normalized plots, ternary diagrams). Many educators consider graph-reading skills an important outcome of general education science curricula, so it is critical that we understand both the development of graph-reading skills and the instructional practices that are most efficacious. Eye-tracking instruments provide quantitative information about eye movements and offer important insights into the development of expertise in graph use. We measured the graph reading skills and eye movements of novices (students with a variety of majors and educational attainment) and experts (faculty and staff from a variety of disciplines) while observing traditional and non-traditional graph formats. Individuals in the expert group consistently demonstrated significantly greater accuracy in responding to questions (e.g., retrieval, interpretation, prediction) about graphs. Among novices, only the number of college math and science courses correlated with response accuracy. Interestingly, novices and experts exhibited similar eye-tracks when they first encountered a new graph; they typically scanned through the title, x and y-axes, and data regions in the first 5-15 seconds. However, experts are readily distinguished from novices by a greater number of eye movements (20-35%) between the data and other graph elements (e.g., title, x-axis, y-axis) both during and after the initial orientation phase. We attribute the greater eye movements between the different graph elements an outcome of the generally better-developed self-regulation skills (goal-setting, monitoring, self-evaluation) that likely characterize individuals in our expert group.
Amine Labriji
2017-07-01
Full Text Available The topic of identifying the similarity of graphs was considered as highly recommended research field in the Web semantic, artificial intelligence, the shape recognition and information research. One of the fundamental problems of graph databases is finding similar graphs to a graph query. Existing approaches dealing with this problem are usually based on the nodes and arcs of the two graphs, regardless of parental semantic links. For instance, a common connection is not identified as being part of the similarity of two graphs in cases like two graphs without common concepts, the measure of similarity based on the union of two graphs, or the one based on the notion of maximum common sub-graph (SCM, or the distance of edition of graphs. This leads to an inadequate situation in the context of information research. To overcome this problem, we suggest a new measure of similarity between graphs, based on the similarity measure of Wu and Palmer. We have shown that this new measure satisfies the properties of a measure of similarities and we applied this new measure on examples. The results show that our measure provides a run time with a gain of time compared to existing approaches. In addition, we compared the relevance of the similarity values obtained, it appears that this new graphs measure is advantageous and offers a contribution to solving the problem mentioned above.
Cao, Hengyi; Plichta, Michael M; Schäfer, Axel; Haddad, Leila; Grimm, Oliver; Schneider, Michael; Esslinger, Christine; Kirsch, Peter; Meyer-Lindenberg, Andreas; Tost, Heike
2014-01-01
The investigation of the brain connectome with functional magnetic resonance imaging (fMRI) and graph theory analyses has recently gained much popularity, but little is known about the robustness of these properties, in particular those derived from active fMRI tasks. Here, we studied the test-retest reliability of brain graphs calculated from 26 healthy participants with three established fMRI experiments (n-back working memory, emotional face-matching, resting state) and two parcellation schemes for node definition (AAL atlas, functional atlas proposed by Power et al.). We compared the intra-class correlation coefficients (ICCs) of five different data processing strategies and demonstrated a superior reliability of task-regression methods with condition-specific regressors. The between-task comparison revealed significantly higher ICCs for resting state relative to the active tasks, and a superiority of the n-back task relative to the face-matching task for global and local network properties. While the mean ICCs were typically lower for the active tasks, overall fair to good reliabilities were detected for global and local connectivity properties, and for the n-back task with both atlases, smallworldness. For all three tasks and atlases, low mean ICCs were seen for the local network properties. However, node-specific good reliabilities were detected for node degree in regions known to be critical for the challenged functions (resting-state: default-mode network nodes, n-back: fronto-parietal nodes, face-matching: limbic nodes). Between-atlas comparison demonstrated significantly higher reliabilities for the functional parcellations for global and local network properties. Our findings can inform the choice of processing strategies, brain atlases and outcome properties for fMRI studies using active tasks, graph theory methods, and within-subject designs, in particular future pharmaco-fMRI studies. © 2013 Elsevier Inc. All rights reserved.
Hively, Lee M.
2014-09-16
Data collected from devices and human condition may be used to forewarn of critical events such as machine/structural failure or events from brain/heart wave data stroke. By monitoring the data, and determining what values are indicative of a failure forewarning, one can provide adequate notice of the impending failure in order to take preventive measures. This disclosure teaches a computer-based method to convert dynamical numeric data representing physical objects (unstructured data) into discrete-phase-space states, and hence into a graph (structured data) for extraction of condition change.
Endriss, U.; Grandi, U.
Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of situations, e.g., when applying a voting rule (graphs as preference
A NETWORK-THEORETICAL APPROACH TO UNDERSTANDING INTERSTELLAR CHEMISTRY
Jolley, Craig C.; Douglas, Trevor
2010-01-01
Recent years have seen dramatic advances in computational models of chemical processes in the interstellar medium (ISM). Typically, these models have been used to calculate changes in chemical abundances with time; the calculated abundances can then be compared with chemical abundances derived from observations. In this study, the output from an astrochemical simulation has been used to generate directed graphs with weighted edges; these have been analyzed with the tools of network theory to uncover whole-network properties of reaction systems in dark molecular clouds. The results allow the development of a model in which global network properties can be rationalized in terms of the basic physical properties of the reaction system. The ISM network exhibits an exponential degree distribution, which is likely to be a generic feature of chemical networks involving a broad range of reaction rate constants. While species abundances span several orders of magnitude, the formation and destruction rates for most species are approximately balanced-departures from this rule indicate species (such as CO) that play a critical role in shaping the dynamics of the system. Future theoretical or observational studies focusing on individual molecular species will be able to situate them in terms of their role in the complete system or quantify the degree to which they deviate from the typical system behavior.
Twistor-theoretic approach to topological field theories
Ito, Kei.
1991-12-01
The two-dimensional topological field theory which describes a four-dimensional self-dual space-time (gravitational instanton) as a target space, which we constructed before, is shown to be deeply connected with Penrose's 'twistor theory'. The relations are presented in detail. Thus our theory offers a 'twistor theoretic' approach to topological field theories. (author)
SOCIOLOGICAL UNDERSTANDING OF INTERNET: THEORETICAL APPROACHES TO THE NETWORK ANALYSIS
D. E. Dobrinskaya
2016-01-01
Full Text Available The network is an efficient way of social structure analysis for contemporary sociologists. It gives broad opportunities for detailed and fruitful research of different patterns of ties and social relations by quantitative analytical methods and visualization of network models. The network metaphor is used as the most representative tool for description of a new type of society. This new type is characterized by flexibility, decentralization and individualization. Network organizational form became the dominant form in modern societies. The network is also used as a mode of inquiry. Actually three theoretical network approaches in the Internet research case are the most relevant: social network analysis, “network society” theory and actor-network theory. Every theoretical approach has got its own notion of network. Their special methodological and theoretical features contribute to the Internet studies in different ways. The article represents a brief overview of these network approaches. This overview demonstrates the absence of a unified semantic space of the notion of “network” category. This fact, in turn, points out the need for detailed analysis of these approaches to reveal their theoretical and empirical possibilities in application to the Internet studies.
Multiple stakeholders in road pricing: A game theoretic approach
Ohazulike, Anthony; Still, Georg J.; Kern, Walter; van Berkum, Eric C.; Hausken, Kjell; Zhuang, Jun
2015-01-01
We investigate a game theoretic approach as an alternative to the standard multi-objective optimization models for road pricing. Assuming that various, partly conflicting traffic externalities (congestion, air pollution, noise, safety, etcetera) are represented by corresponding players acting on a
An Activity Theoretical Approach to Social Interaction during Study Abroad
Shively, Rachel L.
2016-01-01
This case study examines how one study abroad student oriented to social interaction during a semester in Spain. Using an activity theoretical approach, the findings indicate that the student not only viewed social interaction with his Spanish host family and an expert-Spanish-speaking age peer as an opportunity for second language (L2) learning,…
Uniform Single Valued Neutrosophic Graphs
S. Broumi
2017-09-01
Full Text Available In this paper, we propose a new concept named the uniform single valued neutrosophic graph. An illustrative example and some properties are examined. Next, we develop an algorithmic approach for computing the complement of the single valued neutrosophic graph. A numerical example is demonstrated for computing the complement of single valued neutrosophic graphs and uniform single valued neutrosophic graph.
Golino, Hudson F; Epskamp, Sacha
2017-01-01
The estimation of the correct number of dimensions is a long-standing problem in psychometrics. Several methods have been proposed, such as parallel analysis (PA), Kaiser-Guttman's eigenvalue-greater-than-one rule, multiple average partial procedure (MAP), the maximum-likelihood approaches that use fit indexes as BIC and EBIC and the less used and studied approach called very simple structure (VSS). In the present paper a new approach to estimate the number of dimensions will be introduced and compared via simulation to the traditional techniques pointed above. The approach proposed in the current paper is called exploratory graph analysis (EGA), since it is based on the graphical lasso with the regularization parameter specified using EBIC. The number of dimensions is verified using the walktrap, a random walk algorithm used to identify communities in networks. In total, 32,000 data sets were simulated to fit known factor structures, with the data sets varying across different criteria: number of factors (2 and 4), number of items (5 and 10), sample size (100, 500, 1000 and 5000) and correlation between factors (orthogonal, .20, .50 and .70), resulting in 64 different conditions. For each condition, 500 data sets were simulated using lavaan. The result shows that the EGA performs comparable to parallel analysis, EBIC, eBIC and to Kaiser-Guttman rule in a number of situations, especially when the number of factors was two. However, EGA was the only technique able to correctly estimate the number of dimensions in the four-factor structure when the correlation between factors were .7, showing an accuracy of 100% for a sample size of 5,000 observations. Finally, the EGA was used to estimate the number of factors in a real dataset, in order to compare its performance with the other six techniques tested in the simulation study.
A queer-theoretical approach to community health psychology.
Easpaig, Bróna R Nic Giolla; Fryer, David M; Linn, Seònaid E; Humphrey, Rhianna H
2014-01-01
Queer-theoretical resources offer ways of productively rethinking how central concepts such as 'person-context', 'identity' and 'difference' may be understood for community health psychologists. This would require going beyond consideration of the problems with which queer theory is popularly associated to cautiously engage with the aspects of this work relevant to the promotion of collective practice and engaging with processes of marginalisation. In this article, we will draw upon and illustrate the queer-theoretical concepts of 'performativity' and 'cultural intelligibility' before moving towards a preliminary mapping of what a queer-informed approach to community health psychology might involve.
Monoenergetic approximation of a polyenergetic beam: a theoretical approach
Robinson, D.M.; Scrimger, J.W.
1991-01-01
There exist numerous occasions in which it is desirable to approximate the polyenergetic beams employed in radiation therapy by a beam of photons of a single energy. In some instances, commonly used rules of thumb for the selection of an appropriate energy may be valid. A more accurate approximate energy, however, may be determined by an analysis which takes into account both the spectral qualities of the beam and the material through which it passes. The theoretical basis of this method of analysis is presented in this paper. Experimental agreement with theory for a range of materials and beam qualities is also presented and demonstrates the validity of the theoretical approach taken. (author)
A quantum annealing approach for fault detection and diagnosis of graph-based systems
Perdomo-Ortiz, A.; Fluegemann, J.; Narasimhan, S.; Biswas, R.; Smelyanskiy, V. N.
2015-02-01
Diagnosing the minimal set of faults capable of explaining a set of given observations, e.g., from sensor readouts, is a hard combinatorial optimization problem usually tackled with artificial intelligence techniques. We present the mapping of this combinatorial problem to quadratic unconstrained binary optimization (QUBO), and the experimental results of instances embedded onto a quantum annealing device with 509 quantum bits. Besides being the first time a quantum approach has been proposed for problems in the advanced diagnostics community, to the best of our knowledge this work is also the first research utilizing the route Problem → QUBO → Direct embedding into quantum hardware, where we are able to implement and tackle problem instances with sizes that go beyond previously reported toy-model proof-of-principle quantum annealing implementations; this is a significant leap in the solution of problems via direct-embedding adiabatic quantum optimization. We discuss some of the programmability challenges in the current generation of the quantum device as well as a few possible ways to extend this work to more complex arbitrary network graphs.
Simplicial complexes of graphs
Jonsson, Jakob
2008-01-01
A graph complex is a finite family of graphs closed under deletion of edges. Graph complexes show up naturally in many different areas of mathematics, including commutative algebra, geometry, and knot theory. Identifying each graph with its edge set, one may view a graph complex as a simplicial complex and hence interpret it as a geometric object. This volume examines topological properties of graph complexes, focusing on homotopy type and homology. Many of the proofs are based on Robin Forman's discrete version of Morse theory. As a byproduct, this volume also provides a loosely defined toolbox for attacking problems in topological combinatorics via discrete Morse theory. In terms of simplicity and power, arguably the most efficient tool is Forman's divide and conquer approach via decision trees; it is successfully applied to a large number of graph and digraph complexes.
A theoretical approach to artificial intelligence systems in medicine.
Spyropoulos, B; Papagounos, G
1995-10-01
The various theoretical models of disease, the nosology which is accepted by the medical community and the prevalent logic of diagnosis determine both the medical approach as well as the development of the relevant technology including the structure and function of the A.I. systems involved. A.I. systems in medicine, in addition to the specific parameters which enable them to reach a diagnostic and/or therapeutic proposal, entail implicitly theoretical assumptions and socio-cultural attitudes which prejudice the orientation and the final outcome of the procedure. The various models -causal, probabilistic, case-based etc. -are critically examined and their ethical and methodological limitations are brought to light. The lack of a self-consistent theoretical framework in medicine, the multi-faceted character of the human organism as well as the non-explicit nature of the theoretical assumptions involved in A.I. systems restrict them to the role of decision supporting "instruments" rather than regarding them as decision making "devices". This supporting role and, especially, the important function which A.I. systems should have in the structure, the methods and the content of medical education underscore the need of further research in the theoretical aspects and the actual development of such systems.
Ferruccio ePanzica
2013-11-01
Full Text Available In the context of focal drug-resistant epilepsies, the surgical resection of the epileptogenic zone (EZ, the cortical region responsible for the onset, early seizures organization and propagation, may be the only therapeutic option for reducing or suppressing seizures. The rather high rate of failure in epilepsy surgery of extra-temporal epilepsies highlights that the precise identification of the EZ, mandatory objective to achieve seizure freedom, is still an unsolved problem that requires more sophisticated methods of investigation.Despite the wide range of non-invasive investigations, intracranial stereo-EEG (SEEG recordings still represent, in many patients, the gold standard for the EZ identification. In this contest, the EZ localization is still based on visual analysis of SEEG, inevitably affected by the drawback of subjectivity and strongly time-consuming. Over the last years, considerable efforts have been made to develop advanced signal analysis techniques able to improve the identification of the EZ. Particular attention has been paid to those methods aimed at quantifying and characterising the interactions and causal relationships between neuronal populations, since is nowadays well assumed that epileptic phenomena are associated with abnormal changes in brain synchronisation mechanisms, and initial evidence has shown the suitability of this approach for the EZ localisation. The aim of this review is to provide an overview of the different EEG signal processing methods applied to study connectivity between distinct brain cortical regions, namely in focal epilepsies. In addition, with the aim of localizing the EZ, the approach based on graph theory will be described, since the study of the topological properties of the networks has strongly improved the study of brain connectivity mechanisms.
A graph signal filtering-based approach for detection of different edge types on airborne lidar data
Bayram, Eda; Vural, Elif; Alatan, Aydin
2017-10-01
Airborne Laser Scanning is a well-known remote sensing technology, which provides a dense and highly accurate, yet unorganized point cloud of earth surface. During the last decade, extracting information from the data generated by airborne LiDAR systems has been addressed by many studies in geo-spatial analysis and urban monitoring applications. However, the processing of LiDAR point clouds is challenging due to their irregular structure and 3D geometry. In this study, we propose a novel framework for the detection of the boundaries of an object or scene captured by LiDAR. Our approach is motivated by edge detection techniques in vision research and it is established on graph signal filtering which is an exciting and promising field of signal processing for irregular data types. Due to the convenient applicability of graph signal processing tools on unstructured point clouds, we achieve the detection of the edge points directly on 3D data by using a graph representation that is constructed exclusively to answer the requirements of the application. Moreover, considering the elevation data as the (graph) signal, we leverage aerial characteristic of the airborne LiDAR data. The proposed method can be employed both for discovering the jump edges on a segmentation problem and for exploring the crease edges on a LiDAR object on a reconstruction/modeling problem, by only adjusting the filter characteristics.
Nguyen, Louis H.; Ramakrishnan, Jayant; Granda, Jose J.
2006-01-01
The assembly and operation of the International Space Station (ISS) require extensive testing and engineering analysis to verify that the Space Station system of systems would work together without any adverse interactions. Since the dynamic behavior of an entire Space Station cannot be tested on earth, math models of the Space Station structures and mechanical systems have to be built and integrated in computer simulations and analysis tools to analyze and predict what will happen in space. The ISS Centrifuge Rotor (CR) is one of many mechanical systems that need to be modeled and analyzed to verify the ISS integrated system performance on-orbit. This study investigates using Bond Graph modeling techniques as quick and simplified ways to generate models of the ISS Centrifuge Rotor. This paper outlines the steps used to generate simple and more complex models of the CR using Bond Graph Computer Aided Modeling Program with Graphical Input (CAMP-G). Comparisons of the Bond Graph CR models with those derived from Euler-Lagrange equations in MATLAB and those developed using multibody dynamic simulation at the National Aeronautics and Space Administration (NASA) Johnson Space Center (JSC) are presented to demonstrate the usefulness of the Bond Graph modeling approach for aeronautics and space applications.
Model selection and inference a practical information-theoretic approach
Burnham, Kenneth P
1998-01-01
This book is unique in that it covers the philosophy of model-based data analysis and an omnibus strategy for the analysis of empirical data The book introduces information theoretic approaches and focuses critical attention on a priori modeling and the selection of a good approximating model that best represents the inference supported by the data Kullback-Leibler information represents a fundamental quantity in science and is Hirotugu Akaike's basis for model selection The maximized log-likelihood function can be bias-corrected to provide an estimate of expected, relative Kullback-Leibler information This leads to Akaike's Information Criterion (AIC) and various extensions and these are relatively simple and easy to use in practice, but little taught in statistics classes and far less understood in the applied sciences than should be the case The information theoretic approaches provide a unified and rigorous theory, an extension of likelihood theory, an important application of information theory, and are ...
Child education and management: theoretical approaches on legislation
Rúbia Borges
2017-11-01
Full Text Available The aim of this work was to investigate theoretical approaches regarding to daycare centers and management, considering childhood education for different audiences, such children and babies on the childhood perspective. On qualitative approach, this research is bibliographical and reflects on official documents about the theme. The development of this research occurred through analysis on educational Brazilian laws, starting by the Federal Constitution (FC, Law of Guidelines and Bases for National Education (LGB, National Curriculum Guidelines and the Education National Plan (ENP. The results point to a generalist legislation that allow certain autonomy on the education. However, there is the need to deepen theoretical and practical studies on the reality of institutions which have the education as the paramount purpose, in order to offer education with quality and attending to the needs from the audience in these institutions.
Groupies in multitype random graphs
Shang, Yilun
2016-01-01
A groupie in a graph is a vertex whose degree is not less than the average degree of its neighbors. Under some mild conditions, we show that the proportion of groupies is very close to 1/2 in multitype random graphs (such as stochastic block models), which include Erd?s-R?nyi random graphs, random bipartite, and multipartite graphs as special examples. Numerical examples are provided to illustrate the theoretical results.
Groupies in multitype random graphs.
Shang, Yilun
2016-01-01
A groupie in a graph is a vertex whose degree is not less than the average degree of its neighbors. Under some mild conditions, we show that the proportion of groupies is very close to 1/2 in multitype random graphs (such as stochastic block models), which include Erdős-Rényi random graphs, random bipartite, and multipartite graphs as special examples. Numerical examples are provided to illustrate the theoretical results.
Blogging in Higher Education: Theoretical and Practical Approach
Gulfidan CAN; Devrim OZDEMIR
2006-01-01
In this paper the blogging method, which includes new forms of writing, is supported as an alternative approach to address the frequently asserted problems in higher education such as product-oriented assessment and lack of value given to students' writing as contribution to the discourse of the academic disciplines. Both theoretical and research background information is provided to clarify the rationale of using this method in higher education. Furthermore, recommended way of using this met...
Theoretical and expert system approach to photoionization theories
Petrović Ivan D.
2016-01-01
Full Text Available The influence of the ponderomotive and the Stark shifts on the tunneling transition rate was observed, for non-relativistic linearly polarized laser field for alkali atoms, with three different theoretical models, the Keldysh theory, the Perelomov, Popov, Terent'ev (PPT theory, and the Ammosov, Delone, Krainov (ADK theory. We showed that aforementioned shifts affect the transition rate differently for different approaches. Finally, we presented a simple expert system for analysis of photoionization theories.
Marrero-Ponce, Yovani; Santiago, Oscar Martínez; López, Yoan Martínez; Barigye, Stephen J; Torrens, Francisco
2012-11-01
In this report, we present a new mathematical approach for describing chemical structures of organic molecules at atomic-molecular level, proposing for the first time the use of the concept of the derivative ([Formula: see text]) of a molecular graph (MG) with respect to a given event (E), to obtain a new family of molecular descriptors (MDs). With this purpose, a new matrix representation of the MG, which generalizes graph's theory's traditional incidence matrix, is introduced. This matrix, denominated the generalized incidence matrix, Q, arises from the Boolean representation of molecular sub-graphs that participate in the formation of the graph molecular skeleton MG and could be complete (representing all possible connected sub-graphs) or constitute sub-graphs of determined orders or types as well as a combination of these. The Q matrix is a non-quadratic and unsymmetrical in nature, its columns (n) and rows (m) are conditions (letters) and collection of conditions (words) with which the event occurs. This non-quadratic and unsymmetrical matrix is transformed, by algebraic manipulation, to a quadratic and symmetric matrix known as relations frequency matrix, F, which characterizes the participation intensity of the conditions (letters) in the events (words). With F, we calculate the derivative over a pair of atomic nuclei. The local index for the atomic nuclei i, Δ(i), can therefore be obtained as a linear combination of all the pair derivatives of the atomic nuclei i with all the rest of the j's atomic nuclei. Here, we also define new strategies that generalize the present form of obtaining global or local (group or atom-type) invariants from atomic contributions (local vertex invariants, LOVIs). In respect to this, metric (norms), means and statistical invariants are introduced. These invariants are applied to a vector whose components are the values Δ(i) for the atomic nuclei of the molecule or its fragments. Moreover, with the purpose of differentiating
de Mol, M.J.; Rensink, Arend; Hunt, James J.
This paper introduces an approach for adding graph transformation-based functionality to existing JAVA programs. The approach relies on a set of annotations to identify the intended graph structure, as well as on user methods to manipulate that structure, within the user’s own JAVA class
On the automation of periodic hard real-time processes : a graph-theoretical approach
Boode, Antoon Hendrik
2018-01-01
Summary In certain single-core mono-processor configurations, e.g. embedded control systems like robotic applications comprising many short processes, process context switches may consume a considerable amount of the available processing power. Reducing the number of context switches decreases the
On the automation of periodic hard real-time processes: a graph-theoretical approach
Boode, Antoon Hendrik
2018-01-01
Summary In certain single-core mono-processor configurations, e.g. embedded control systems like robotic applications comprising many short processes, process context switches may consume a considerable amount of the available processing power. Reducing the number of context switches decreases the execution time and thereby increases the performance of the application. Furthermore, the end-to-end processing time suffers from the idle time of the processor, because, for example, processes have...
Preventing Wormhole Attacks on Wireless Ad Hoc Networks: A Graph Theoretic Approach
Lazos, L; Poovendran, Radha; Meadows, C; Syverson, P; Chang, L. W
2005-01-01
We study the problem of characterizing the wormhole attack, an attack that can be mounted on a wide range of wireless network protocols without compromising any cryptographic quantity or network node...
Park, Bong Soo; Lee, Yoo Jin; Park, Jin-Han; Kim, Il Hwan; Park, Si Hyung; Lee, Ho-Joon; Park, Kang Min
2018-06-01
We evaluated global topology and organization of regional hubs in the brain networks and microstructural abnormalities in the white matter of patients with reflex syncope. Twenty patients with reflex syncope and thirty healthy subjects were recruited, and they underwent diffusion tensor imaging (DTI) scans. Graph theory was applied to obtain network measures based on extracted DTI data, using DSI Studio. We then investigated differences in the network measures between the patients with reflex syncope and the healthy subjects. We also analyzed microstructural abnormalities of white matter using tract-based spatial statistics analysis (TBSS). Measures of global topology were not different between patients with reflex syncope and healthy subjects. However, in reflex syncope patients, the strength measures of the right angular, left inferior frontal, left middle orbitofrontal, left superior medial frontal, and left middle temporal gyrus were lower than in healthy subjects. The betweenness centrality measures of the left middle orbitofrontal, left fusiform, and left lingual gyrus in patients were lower than those in healthy subjects. The PageRank centrality measures of the right angular, left middle orbitofrontal, and left superior medial frontal gyrus in patients were lower than those in healthy subjects. Regarding the analysis of the white matter microstructure, there were no differences in the fractional anisotropy and mean diffusivity values between the two groups. We have identified a reorganization of network hubs in the brain network of patients with reflex syncope. These alterations in brain network may play a role in the pathophysiologic mechanism underlying reflex syncope. © 2018 The Authors. Brain and Behavior published by Wiley Periodicals, Inc.
Principle-theoretic approach of kondo and construction-theoretic formalism of gauge theories
Jain, L.C.
1986-01-01
Einstein classified various theories in physics as principle-theories and constructive-theories. In this lecture Kondo's approach to microscopic and macroscopic phenomena is analysed for its principle theoretic pursuit as followed by construction. The fundamentals of his theory may be recalled as Tristimulus principle, Observation principle, Kawaguchi spaces, empirical information, epistemological point of view, unitarity, intrinsicality, and dimensional analysis subject to logical and geometrical achievement. On the other hand, various physicists have evolved constructive gauge theories through the phenomenological point of view, often a collective one. Their synthetic method involves fibre bundles and connections, path integrals as well as other hypothetical structures. They lead towards clarity, completeness and adaptability
A Graph-Based Approach for 3D Building Model Reconstruction from Airborne LiDAR Point Clouds
Bin Wu
2017-01-01
Full Text Available 3D building model reconstruction is of great importance for environmental and urban applications. Airborne light detection and ranging (LiDAR is a very useful data source for acquiring detailed geometric and topological information of building objects. In this study, we employed a graph-based method based on hierarchical structure analysis of building contours derived from LiDAR data to reconstruct urban building models. The proposed approach first uses a graph theory-based localized contour tree method to represent the topological structure of buildings, then separates the buildings into different parts by analyzing their topological relationships, and finally reconstructs the building model by integrating all the individual models established through the bipartite graph matching process. Our approach provides a more complete topological and geometrical description of building contours than existing approaches. We evaluated the proposed method by applying it to the Lujiazui region in Shanghai, China, a complex and large urban scene with various types of buildings. The results revealed that complex buildings could be reconstructed successfully with a mean modeling error of 0.32 m. Our proposed method offers a promising solution for 3D building model reconstruction from airborne LiDAR point clouds.
Product shipping information using graceful labeling on undirected tree graph approach
Kuan, Yoong Kooi; Ghani, Ahmad Termimi Ab
2017-08-01
Product shipping information is the related information of an ordered product that ready to be shipped to the foreign customer's company, where the information represents as an irrefutable proof in black and white to the local manufacturer by E-mails. This messy and unordered list of information is stored in E-mail folders by the people incharge, which do not function in collating the information properly. So, in this paper, an algorithm is proposed on how to rearrange the messy information from the sequence of a path graph structure into a concise version of a caterpillar graph with achieving the concept of graceful labeling. The final graceful caterpillar graph consists of the full listed information together with the numbering, which able to assist people get the information fleetly for shipping arrangement procedure.
Theoretical orientations in environmental planning: An inquiry into alternative approaches
Briassoulis, Helen
1989-07-01
In the process of devising courses of action to resolve problems arising at the society-environment interface, a variety of planning approaches are followed, whose adoption is influenced by—among other things—the characteristics of environmental problems, the nature of the decision-making context, and the intellectual traditions of the disciplines contributing to the study of these problems. This article provides a systematic analysis of six alternative environmental planning approaches—comprehensive/rational, incremental, adaptive, contingency, advocacy, and participatory/consensual. The relative influence of the abovementioned factors is examined, the occurrence of these approaches in real-world situations is noted, and their environmental soundness and political realism is evaluated. Because of the disparity between plan formulation and implementation and between theoretical form and empirical reality, a synthetic view of environmental planning approaches is taken and approaches in action are identified, which characterize the totality of the planning process from problem definition to plan implementation, as well as approaches in the becoming, which may be on the horizon of environmental planning of tomorrow. The suggested future research directions include case studies to verify and detail the presence of the approaches discussed, developing measures of success of a given approach in a given decision setting, and an intertemporal analysis of environmental planning approaches.
An attempt of classification of theoretical approaches to national identity
Milošević-Đorđević Jasna S.
2003-01-01
Full Text Available It is compulsory that complex social concepts should be defined in different ways and approached from the perspective of different science disciplines. Therefore, it is difficult to precisely define them without overlapping of meaning with other similar concepts. This paper has made an attempt towards theoretical classification of the national identity and differentiate that concept in comparison to the other related concepts (race, ethnic group, nation, national background, authoritativeness, patriarchy. Theoretical assessments are classified into two groups: ones that are dealing with nature of national identity and others that are stating one or more dimensions of national identity, crucial for its determination. On the contrary to the primordialistic concept of national identity, describing it as a fundamental, deeply rooted human feature, there are many numerous contemporary theoretical approaches (instrumentalist, constructivist, functionalistic, emphasizing changeable, fluid, instrumentalist function of the national identity. Fundamental determinants of national identity are: language, culture (music, traditional myths, state symbols (territory, citizenship, self-categorization, religion, set of personal characteristics and values.
Cooperation or Localization in European Capacity Markets? A Coalitional Game over Graph Approach
Giorgos Stamtsis
2018-06-01
Full Text Available Capacity markets, as a means to address the capacity adequacy issue, are constantly becoming an important part of the European internal electricity market. The debate focuses on how the capacity markets will be smoothly integrated in one Pan-European power market, without resulting in multiple national fragmentations and consequently in economic efficiency losses. Cross-border participation and regional cooperation are considered as two sine qua non conditions in this respect. The present paper provides a coalitional game theoretical approach aiming to facilitate the cooperation of neighboring countries, when it comes to the security of electricity supply and the necessity of establishing a capacity market. Such an approach can support respective decisions about capacity markets cooperation as well as stress-test the benefits considering all cooperation possibilities.
Using graph theory for automated electric circuit solving
Toscano, L; Stella, S; Milotti, E
2015-01-01
Graph theory plays many important roles in modern physics and in many different contexts, spanning diverse topics such as the description of scale-free networks and the structure of the universe as a complex directed graph in causal set theory. Graph theory is also ideally suited to describe many concepts in computer science. Therefore it is increasingly important for physics students to master the basic concepts of graph theory. Here we describe a student project where we develop a computational approach to electric circuit solving which is based on graph theoretic concepts. This highly multidisciplinary approach combines abstract mathematics, linear algebra, the physics of circuits, and computer programming to reach the ambitious goal of implementing automated circuit solving. (paper)
A System Theoretical Inspired Approach to Knowledge Construction
Mathiasen, Helle
2008-01-01
student's knowledge construction, in the light of operative constructivism, inspired by the German sociologist N. Luhmann's system theoretical approach to epistemology. Taking observations as operations based on distinction and indication (selection) contingency becomes a fundamental condition in learning...... Abstract The aim of this paper is to discuss the relation between teaching and learning. The point of departure is that teaching environments (communication forums) is a potential facilitator for learning processes and knowledge construction. The paper present a theoretical frame work, to discuss...... processes, and a condition which teaching must address as far as teaching strives to stimulate non-random learning outcomes. Thus learning outcomes understood as the individual learner's knowledge construction cannot be directly predicted from events and characteristics in the environment. This has...
Information Ergonomics A theoretical approach and practical experience in transportation
Sandl, Peter
2012-01-01
The variety and increasing availability of hypermedia information systems, which are used in stationary applications like operators’ consoles as well as mobile systems, e.g. driver information and navigation systems in automobiles form a foundation for the mediatization of the society. From the human engineering point of view this development and the ensuing increased importance of information systems for economic and private needs require careful deliberation of the derivation and application of ergonomics methods particularly in the field of information systems. This book consists of two closely intertwined parts. The first, theoretical part defines the concept of an information system, followed by an explanation of action regulation as well as cognitive theories to describe man information system interaction. A comprehensive description of information ergonomics concludes the theoretical approach. In the second, practically oriented part of this book authors from industry as well as from academic institu...
Graphing trillions of triangles.
Burkhardt, Paul
2017-07-01
The increasing size of Big Data is often heralded but how data are transformed and represented is also profoundly important to knowledge discovery, and this is exemplified in Big Graph analytics. Much attention has been placed on the scale of the input graph but the product of a graph algorithm can be many times larger than the input. This is true for many graph problems, such as listing all triangles in a graph. Enabling scalable graph exploration for Big Graphs requires new approaches to algorithms, architectures, and visual analytics. A brief tutorial is given to aid the argument for thoughtful representation of data in the context of graph analysis. Then a new algebraic method to reduce the arithmetic operations in counting and listing triangles in graphs is introduced. Additionally, a scalable triangle listing algorithm in the MapReduce model will be presented followed by a description of the experiments with that algorithm that led to the current largest and fastest triangle listing benchmarks to date. Finally, a method for identifying triangles in new visual graph exploration technologies is proposed.
Creyx, M.; Delacourt, E.; Morin, C.; Desmet, B.
2016-01-01
A dynamic model using the bond graph formalism of the expansion cylinder of an open Joule cycle Ericsson engine intended for a biomass-fuelled micro-CHP system is presented. Dynamic phenomena, such as the thermodynamic evolution of air, the instantaneous air mass flow rates linked to pressure drops crossing the valves, the heat transferred through the expansion cylinder wall and the mechanical friction losses, are included in the model. The influence on the Ericsson engine performances of the main operating conditions (intake air pressure and temperature, timing of intake and exhaust valve closing, rotational speed, mechanical friction losses and heat transfer at expansion cylinder wall) is studied. The operating conditions maximizing the performances of the Ericsson engine used in the a biomass-fuelled micro-CHP unit are an intake air pressure between 6 and 8 bar, a maximized intake air temperature, an adjustment of the intake and exhaust valve closing corresponding to an expansion cycle close to the theoretical Joule cycle, a rotational speed close to 800 rpm. The heat transfer at the expansion cylinder wall reduces the engine performances. - Highlights: • A bond graph dynamic model of the Ericsson engine expansion cylinder is presented. • Dynamic aspects are modelled: pressure drops, friction losses, wall heat transfer. • Influent factors and phenomena on the engine performances are investigated. • Expansion cycles close to the theoretical Joule cycle maximize the performances. • The heat transfer at the expansion chamber wall reduces the performances.
Mal-Netminer: Malware Classification Approach Based on Social Network Analysis of System Call Graph
Jae-wook Jang
2015-01-01
Full Text Available As the security landscape evolves over time, where thousands of species of malicious codes are seen every day, antivirus vendors strive to detect and classify malware families for efficient and effective responses against malware campaigns. To enrich this effort and by capitalizing on ideas from the social network analysis domain, we build a tool that can help classify malware families using features driven from the graph structure of their system calls. To achieve that, we first construct a system call graph that consists of system calls found in the execution of the individual malware families. To explore distinguishing features of various malware species, we study social network properties as applied to the call graph, including the degree distribution, degree centrality, average distance, clustering coefficient, network density, and component ratio. We utilize features driven from those properties to build a classifier for malware families. Our experimental results show that “influence-based” graph metrics such as the degree centrality are effective for classifying malware, whereas the general structural metrics of malware are less effective for classifying malware. Our experiments demonstrate that the proposed system performs well in detecting and classifying malware families within each malware class with accuracy greater than 96%.
Row—column visibility graph approach to two-dimensional landscapes
Xiao Qin; Pan Xue; Li Xin-Li; Stephen Mutua; Yang Hui-Jie; Jiang Yan; Wang Jian-Yong; Zhang Qing-Jun
2014-01-01
A new concept, called the row—column visibility graph, is proposed to map two-dimensional landscapes to complex networks. A cluster coverage is introduced to describe the extensive property of node clusters on a Euclidean lattice. Graphs mapped from fractals generated with the probability redistribution model behave scale-free. They have pattern-induced hierarchical organizations and comparatively much more extensive structures. The scale-free exponent has a negative correlation with the Hurst exponent, however, there is no deterministic relation between them. Graphs for fractals generated with the midpoint displacement model are exponential networks. When the Hurst exponent is large enough (e.g., H > 0.5), the degree distribution decays much more slowly, the average coverage becomes significant large, and the initially hierarchical structure at H < 0.5 is destroyed completely. Hence, the row—column visibility graph can be used to detect the pattern-related new characteristics of two-dimensional landscapes. (interdisciplinary physics and related areas of science and technology)
A Graph-Based Approach to Action Scheduling in a Parallel Database System
Grefen, P.W.P.J.; Apers, Peter M.G.
Parallel database machines are meant to obtain high performance in transaction processing, both in terms of response time adn throughput. To obtain high performance, a good scheduling of the execution of the various actions in transactions is crucial. This paper describes a graph-based technique for
SOCIOLOGICAL UNDERSTANDING OF INTERNET: THEORETICAL APPROACHES TO THE NETWORK ANALYSIS
D. E. Dobrinskaya
2016-01-01
Full Text Available Internet studies are carried out by various scientific disciplines and in different research perspectives. Sociological studies of the Internet deal with a new technology, a revolutionary means of mass communication and a social space. There is a set of research difficulties associated with the Internet. Firstly, the high speed and wide spread of Internet technologies’ development. Secondly, the collection and filtration of materials concerning with Internet studies. Lastly, the development of new conceptual categories, which are able to reflect the impact of the Internet development in contemporary world. In that regard the question of the “network” category use is essential. Network is the base of Internet functioning, on the one hand. On the other hand, network is the ground for almost all social interactions in modern society. So such society is called network society. Three theoretical network approaches in the Internet research case are the most relevant: network society theory, social network analysis and actor-network theory. Each of these theoretical approaches contributes to the study of the Internet. They shape various images of interactions between human beings in their entity and dynamics. All these approaches also provide information about the nature of these interactions.
Theoretical approaches to determining the financial provision of public transportation
O.A. Vygovska
2018-03-01
Full Text Available The work is devoted to the improvement of theoretical approaches in determining the financial provision of transportation by public transport at the regional level. The author summarizes the concept of the «financial security» and defines the main difference from the term «financing». The systematization of key differences in the financial provision of a transport company from other financial entities of the economic sector at the national and regional levels is carried out. The disadvantages and advantages of sources of financial support are analyzed. The purpose of the article is to study theoretical approaches in determining the financial provision of transportation by public transport at the regional level. The prospects for further scientific research are the need to identify new scientific approaches and techniques to substantiate and elaborate the concept of the «financial provision of transportation by public transport». The practical application of the research should be formed in a detailed analysis of cash flow streams in the system of «state – regional authority – economic entity». The financial provision of transportation by public transport at the regional level has not been given the sufficient attention in the scientific research within the country. This fact confirms the need for a thorough analysis of the transport industry as a whole.
Generalized connectivity of graphs
Li, Xueliang
2016-01-01
Noteworthy results, proof techniques, open problems and conjectures in generalized (edge-) connectivity are discussed in this book. Both theoretical and practical analyses for generalized (edge-) connectivity of graphs are provided. Topics covered in this book include: generalized (edge-) connectivity of graph classes, algorithms, computational complexity, sharp bounds, Nordhaus-Gaddum-type results, maximum generalized local connectivity, extremal problems, random graphs, multigraphs, relations with the Steiner tree packing problem and generalizations of connectivity. This book enables graduate students to understand and master a segment of graph theory and combinatorial optimization. Researchers in graph theory, combinatorics, combinatorial optimization, probability, computer science, discrete algorithms, complexity analysis, network design, and the information transferring models will find this book useful in their studies.
Li, Rui; Zhang, Xiaodong; Li, Hanzhe; Zhang, Liming; Lu, Zhufeng; Chen, Jiangcheng
2018-08-01
Brain control technology can restore communication between the brain and a prosthesis, and choosing a Brain-Computer Interface (BCI) paradigm to evoke electroencephalogram (EEG) signals is an essential step for developing this technology. In this paper, the Scene Graph paradigm used for controlling prostheses was proposed; this paradigm is based on Steady-State Visual Evoked Potentials (SSVEPs) regarding the Scene Graph of a subject's intention. A mathematic model was built to predict SSVEPs evoked by the proposed paradigm and a sinusoidal stimulation method was used to present the Scene Graph stimulus to elicit SSVEPs from subjects. Then, a 2-degree of freedom (2-DOF) brain-controlled prosthesis system was constructed to validate the performance of the Scene Graph-SSVEP (SG-SSVEP)-based BCI. The classification of SG-SSVEPs was detected via the Canonical Correlation Analysis (CCA) approach. To assess the efficiency of proposed BCI system, the performances of traditional SSVEP-BCI system were compared. Experimental results from six subjects suggested that the proposed system effectively enhanced the SSVEP responses, decreased the degradation of SSVEP strength and reduced the visual fatigue in comparison with the traditional SSVEP-BCI system. The average signal to noise ratio (SNR) of SG-SSVEP was 6.31 ± 2.64 dB, versus 3.38 ± 0.78 dB of traditional-SSVEP. In addition, the proposed system achieved good performances in prosthesis control. The average accuracy was 94.58% ± 7.05%, and the corresponding high information transfer rate (IRT) was 19.55 ± 3.07 bit/min. The experimental results revealed that the SG-SSVEP based BCI system achieves the good performance and improved the stability relative to the conventional approach. Copyright © 2018 Elsevier B.V. All rights reserved.
MEDIATIC NARRATIVES AND IDENTIFICATION PROCESSES. A THEORETICAL AND METHODOLOGICAL APPROACH
Salomé Sola Morales
2013-04-01
Full Text Available This article, theoretical and argumentative, lays the conceptual and methodological basis for the study of the link between identity and narrative media identification processes undertaken by individuals and groups. Thus, the setting national identifications, professional, religious or gender is here proposed as the result of the dialectic between the 'media narrative identity', which the media produce and convey, and identification processes that individuals and groups perform. Furthermore we propose the use of the biographical method as a form of empirical approach to psycho-social phenomenon
Success Determination by Innovation: A Theoretical Approach in Marketing
Raj Kumar Gautam
2012-10-01
Full Text Available The paper aims at to identify the main issues in the marketing which needs immediate attention of the marketers. The importance of innovation in the marketing has also been highlighted and marketing mix have been related to innovative and creative ideas. The study is based on the secondary data, various research papers, articles has been studied to develop a innovative approach in the marketing. Marketing innovative ideas relating to business lead generation, product, price, distribution, promotion of product, and revenue generation have been highlighted in the paper. All the suggestions are theoretical and may have relevance and implication to the marketers.
Success Determination by Innovation: A Theoretical Approach in Marketing
Raj Kumar Gautam
2012-11-01
Full Text Available The paper aims at to identify the main issues in the marketing which needs immediate attention of the marketers. The importance of innovation in the marketing has also been highlighted and marketing mix have been related to innovative and creative ideas. The study is based on the secondary data, various research papers, articles has been studied to develop a innovative approach in the marketing. Marketing innovative ideas relating to business lead generation, product, price, distribution, promotion of product, and revenue generation have been highlighted in the paper. All the suggestions are theoretical and may have relevance and implication to the marketers.
Discrimination Power of Polynomial-Based Descriptors for Graphs by Using Functional Matrices.
Dehmer, Matthias; Emmert-Streib, Frank; Shi, Yongtang; Stefu, Monica; Tripathi, Shailesh
2015-01-01
In this paper, we study the discrimination power of graph measures that are based on graph-theoretical matrices. The paper generalizes the work of [M. Dehmer, M. Moosbrugger. Y. Shi, Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix, Applied Mathematics and Computation, 268(2015), 164-168]. We demonstrate that by using the new functional matrix approach, exhaustively generated graphs can be discriminated more uniquely than shown in the mentioned previous work.
Andoulsi, R.
2001-12-01
We present in this thesis a study of a class of photovoltaic system by a bond graph approach. This study concerns the modelling, the analysis and the control of some configurations including PV generator, DC/DC converters and DC motor-pumps. The modelling of the different elements of a photovoltaic system is an indispensable stage that must precede all application of sizing, identification or simulation. However, theses PV systems are of hybrid type and their modelling is complex. It is why we use a unified modelling approach based on the bond graph technique. This methodology is completely systematic and has a sufficient flexibility for allowing the introduction of different components in the system. In the first chapter, we recall the principle of functioning of a photovoltaic generator and we treat mainly the MPPT (Maximum Power Point Tracking) working. In the second chapter, we elaborate bond graph models of various photovoltaic system configurations. For the PV source, we elaborate, in a first stage, a complete model taking into account the various physical phenomena influencing the quality of the PV source. In a second stage, we deduce a reduced bond graph model more easy to use for analysis and control purposes. For the DC/DC converters, we recall the bond graph modelling of switching elements and the average bond graph of the DC/DC converters developed in the literature. Thus, we deduce the bond graphs models of the various DC/DC converters to be used. The third chapter presents a dynamic study of some configurations stability in linear procedure. In the fourth chapter, we study the feasibility of non linear controllers by input/output linearization for some configurations of PV systems. In this study, we use the concept of inverse bond graph to determine, by a bond graph approach, the expression of the control input and the nature of the stability of the internal dynamics (dynamics of zeros). The fifth chapter is dedicated for the presentation of some
Vanadium supersaturated silicon system: a theoretical and experimental approach
Garcia-Hemme, Eric; García, Gregorio; Palacios, Pablo; Montero, Daniel; García-Hernansanz, Rodrigo; Gonzalez-Diaz, Germán; Wahnon, Perla
2017-12-01
The effect of high dose vanadium ion implantation and pulsed laser annealing on the crystal structure and sub-bandgap optical absorption features of V-supersaturated silicon samples has been studied through the combination of experimental and theoretical approaches. Interest in V-supersaturated Si focusses on its potential as a material having a new band within the Si bandgap. Rutherford backscattering spectrometry measurements and formation energies computed through quantum calculations provide evidence that V atoms are mainly located at interstitial positions. The response of sub-bandgap spectral photoconductance is extended far into the infrared region of the spectrum. Theoretical simulations (based on density functional theory and many-body perturbation in GW approximation) bring to light that, in addition to V atoms at interstitial positions, Si defects should also be taken into account in explaining the experimental profile of the spectral photoconductance. The combination of experimental and theoretical methods provides evidence that the improved spectral photoconductance up to 6.2 µm (0.2 eV) is due to new sub-bandgap transitions, for which the new band due to V atoms within the Si bandgap plays an essential role. This enables the use of V-supersaturated silicon in the third generation of photovoltaic devices.
Proxy Graph: Visual Quality Metrics of Big Graph Sampling.
Nguyen, Quan Hoang; Hong, Seok-Hee; Eades, Peter; Meidiana, Amyra
2017-06-01
Data sampling has been extensively studied for large scale graph mining. Many analyses and tasks become more efficient when performed on graph samples of much smaller size. The use of proxy objects is common in software engineering for analysis and interaction with heavy objects or systems. In this paper, we coin the term 'proxy graph' and empirically investigate how well a proxy graph visualization can represent a big graph. Our investigation focuses on proxy graphs obtained by sampling; this is one of the most common proxy approaches. Despite the plethora of data sampling studies, this is the first evaluation of sampling in the context of graph visualization. For an objective evaluation, we propose a new family of quality metrics for visual quality of proxy graphs. Our experiments cover popular sampling techniques. Our experimental results lead to guidelines for using sampling-based proxy graphs in visualization.
Theoretical, Methodological, and Empirical Approaches to Cost Savings: A Compendium
M Weimar
1998-12-10
This publication summarizes and contains the original documentation for understanding why the U.S. Department of Energy's (DOE's) privatization approach provides cost savings and the different approaches that could be used in calculating cost savings for the Tank Waste Remediation System (TWRS) Phase I contract. The initial section summarizes the approaches in the different papers. The appendices are the individual source papers which have been reviewed by individuals outside of the Pacific Northwest National Laboratory and the TWRS Program. Appendix A provides a theoretical basis for and estimate of the level of savings that can be" obtained from a fixed-priced contract with performance risk maintained by the contractor. Appendix B provides the methodology for determining cost savings when comparing a fixed-priced contractor with a Management and Operations (M&O) contractor (cost-plus contractor). Appendix C summarizes the economic model used to calculate cost savings and provides hypothetical output from preliminary calculations. Appendix D provides the summary of the approach for the DOE-Richland Operations Office (RL) estimate of the M&O contractor to perform the same work as BNFL Inc. Appendix E contains information on cost growth and per metric ton of glass costs for high-level waste at two other DOE sites, West Valley and Savannah River. Appendix F addresses a risk allocation analysis of the BNFL proposal that indicates,that the current approach is still better than the alternative.
Introduction to superfluidity field-theoretical approach and applications
Schmitt, Andreas
2015-01-01
Superfluidity – and closely related to it, superconductivity – are very general phenomena that can occur on vastly different energy scales. Their underlying theoretical mechanism of spontaneous symmetry breaking is even more general and applies to a multitude of physical systems. In these lecture notes, a pedagogical introduction to the field-theory approach to superfluidity is presented. The connection to more traditional approaches, often formulated in a different language, is carefully explained in order to provide a consistent picture that is useful for students and researchers in all fields of physics. After introducing the basic concepts, such as the two-fluid model and the Goldstone mode, selected topics of current research are addressed, such as the BCS-BEC crossover and Cooper pairing with mismatched Fermi momenta.
Brouwer, A.E.; Haemers, W.H.; Brouwer, A.E.; Haemers, W.H.
2012-01-01
This chapter presents some simple results on graph spectra.We assume the reader is familiar with elementary linear algebra and graph theory. Throughout, J will denote the all-1 matrix, and 1 is the all-1 vector.
How cells engulf: a review of theoretical approaches to phagocytosis
Richards, David M.; Endres, Robert G.
2017-12-01
Phagocytosis is a fascinating process whereby a cell surrounds and engulfs particles such as bacteria and dead cells. This is crucial both for single-cell organisms (as a way of acquiring nutrients) and as part of the immune system (to destroy foreign invaders). This whole process is hugely complex and involves multiple coordinated events such as membrane remodelling, receptor motion, cytoskeleton reorganisation and intracellular signalling. Because of this, phagocytosis is an excellent system for theoretical study, benefiting from biophysical approaches combined with mathematical modelling. Here, we review these theoretical approaches and discuss the recent mathematical and computational models, including models based on receptors, models focusing on the forces involved, and models employing energetic considerations. Along the way, we highlight a beautiful connection to the physics of phase transitions, consider the role of stochasticity, and examine links between phagocytosis and other types of endocytosis. We cover the recently discovered multistage nature of phagocytosis, showing that the size of the phagocytic cup grows in distinct stages, with an initial slow stage followed by a much quicker second stage starting around half engulfment. We also address the issue of target shape dependence, which is relevant to both pathogen infection and drug delivery, covering both one-dimensional and two-dimensional results. Throughout, we pay particular attention to recent experimental techniques that continue to inform the theoretical studies and provide a means to test model predictions. Finally, we discuss population models, connections to other biological processes, and how physics and modelling will continue to play a key role in future work in this area.
Gohatre, Umakant Bhaskar; Patil, Venkat P.
2018-04-01
In computer vision application, the multiple object detection and tracking, in real-time operation is one of the important research field, that have gained a lot of attentions, in last few years for finding non stationary entities in the field of image sequence. The detection of object is advance towards following the moving object in video and then representation of object is step to track. The multiple object recognition proof is one of the testing assignment from detection multiple objects from video sequence. The picture enrollment has been for quite some time utilized as a reason for the location the detection of moving multiple objects. The technique of registration to discover correspondence between back to back casing sets in view of picture appearance under inflexible and relative change. The picture enrollment is not appropriate to deal with event occasion that can be result in potential missed objects. In this paper, for address such problems, designs propose novel approach. The divided video outlines utilizing area adjancy diagram of visual appearance and geometric properties. Then it performed between graph sequences by using multi graph matching, then getting matching region labeling by a proposed graph coloring algorithms which assign foreground label to respective region. The plan design is robust to unknown transformation with significant improvement in overall existing work which is related to moving multiple objects detection in real time parameters.
Fundamentals of algebraic graph transformation
Ehrig, Hartmut; Prange, Ulrike; Taentzer, Gabriele
2006-01-01
Graphs are widely used to represent structural information in the form of objects and connections between them. Graph transformation is the rule-based manipulation of graphs, an increasingly important concept in computer science and related fields. This is the first textbook treatment of the algebraic approach to graph transformation, based on algebraic structures and category theory. Part I is an introduction to the classical case of graph and typed graph transformation. In Part II basic and advanced results are first shown for an abstract form of replacement systems, so-called adhesive high-level replacement systems based on category theory, and are then instantiated to several forms of graph and Petri net transformation systems. Part III develops typed attributed graph transformation, a technique of key relevance in the modeling of visual languages and in model transformation. Part IV contains a practical case study on model transformation and a presentation of the AGG (attributed graph grammar) tool envir...
Harary, Frank
2015-01-01
Presented in 1962-63 by experts at University College, London, these lectures offer a variety of perspectives on graph theory. Although the opening chapters form a coherent body of graph theoretic concepts, this volume is not a text on the subject but rather an introduction to the extensive literature of graph theory. The seminar's topics are geared toward advanced undergraduate students of mathematics.Lectures by this volume's editor, Frank Harary, include ""Some Theorems and Concepts of Graph Theory,"" ""Topological Concepts in Graph Theory,"" ""Graphical Reconstruction,"" and other introduc
Yoo, Illhoi; Hu, Xiaohua; Song, Il-Yeol
2007-11-27
A huge amount of biomedical textual information has been produced and collected in MEDLINE for decades. In order to easily utilize biomedical information in the free text, document clustering and text summarization together are used as a solution for text information overload problem. In this paper, we introduce a coherent graph-based semantic clustering and summarization approach for biomedical literature. Our extensive experimental results show the approach shows 45% cluster quality improvement and 72% clustering reliability improvement, in terms of misclassification index, over Bisecting K-means as a leading document clustering approach. In addition, our approach provides concise but rich text summary in key concepts and sentences. Our coherent biomedical literature clustering and summarization approach that takes advantage of ontology-enriched graphical representations significantly improves the quality of document clusters and understandability of documents through summaries.
An introduction to grids, graphs, and networks
Pozrikidis, C
2014-01-01
An Introduction to Grids, Graphs, and Networks aims to provide a concise introduction to graphs and networks at a level that is accessible to scientists, engineers, and students. In a practical approach, the book presents only the necessary theoretical concepts from mathematics and considers a variety of physical and conceptual configurations as prototypes or examples. The subject is timely, as the performance of networks is recognized as an important topic in the study of complex systems with applications in energy, material, and information grid transport (epitomized by the internet). The bo
Agha-mohammadi, Ali-akbar
2013-06-01
This paper is concerned with the problem of stochastic optimal control (possibly with imperfect measurements) in the presence of constraints. We propose a computationally tractable framework to address this problem. The method lends itself to sampling-based methods where we construct a graph in the state space of the problem, on which a Dynamic Programming (DP) is solved and a closed-loop feedback policy is computed. The constraints are seamlessly incorporated to the control policy selection by including their effect on the transition probabilities of the graph edges. We present a unified framework that is applicable both in the state space (with perfect measurements) and in the information space (with imperfect measurements).
Learning Based Approach for Optimal Clustering of Distributed Program's Call Flow Graph
Abofathi, Yousef; Zarei, Bager; Parsa, Saeed
Optimal clustering of call flow graph for reaching maximum concurrency in execution of distributable components is one of the NP-Complete problems. Learning automatas (LAs) are search tools which are used for solving many NP-Complete problems. In this paper a learning based algorithm is proposed to optimal clustering of call flow graph and appropriate distributing of programs in network level. The algorithm uses learning feature of LAs to search in state space. It has been shown that the speed of reaching to solution increases remarkably using LA in search process, and it also prevents algorithm from being trapped in local minimums. Experimental results show the superiority of proposed algorithm over others.
Nuclear Fermi Dynamics: physical content versus theoretical approach
Griffin, J.J.
1977-01-01
Those qualitative properties of nuclei, and of their energetic collisions, which seem of most importance for the flow of nuclear matter are listed and briefly discussed. It is suggested that nuclear matter flow is novel among fluid dynamical problems. The name, Nuclear Fermi Dynamics, is proposed as an appropriate unambiguous label. The Principle of Commensurability, which suggests the measurement of the theoretical content of an approach against its expected predictive range is set forth and discussed. Several of the current approaches to the nuclear matter flow problem are listed and subjected to such a test. It is found that the Time-Dependent Hartree-Fock (TDHF) description, alone of all the major theoretical approaches currently in vogue, incorporates each of the major qualitative features within its very concise single mathematical assumption. Some limitations of the conventional TDHF method are noted, and one particular defect is discussed in detail: the Spurious Cross Channel Correlations which arise whenever several asymptotic reaction channels must be simultaneously described by a single determinant. A reformulated Time-Dependent-S-Matrix Hartree-Fock Theory is proposed, which obviates this difficulty. It is noted that the structure of TD-S-HF can be applied to a more general class of non-linear wave mechanical problems than simple TDHF. Physical requirements minimal to assure that TD-S-HF represents a sensible reaction theory are utilized to prescribe the definition of acceptable asymptotic channels. That definition, in turn, defines the physical range of the TD-S-HF theory as the description of collisions of certain mathematically well-defined objects of mixed quantal and classical character, the ''TDHF droplets.''
Query optimization for graph analytics on linked data using SPARQL
Hong, Seokyong [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Lee, Sangkeun [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Lim, Seung -Hwan [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Sukumar, Sreenivas R. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Vatsavai, Ranga Raju [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
2015-07-01
Triplestores that support query languages such as SPARQL are emerging as the preferred and scalable solution to represent data and meta-data as massive heterogeneous graphs using Semantic Web standards. With increasing adoption, the desire to conduct graph-theoretic mining and exploratory analysis has also increased. Addressing that desire, this paper presents a solution that is the marriage of Graph Theory and the Semantic Web. We present software that can analyze Linked Data using graph operations such as counting triangles, finding eccentricity, testing connectedness, and computing PageRank directly on triple stores via the SPARQL interface. We describe the process of optimizing performance of the SPARQL-based implementation of such popular graph algorithms by reducing the space-overhead, simplifying iterative complexity and removing redundant computations by understanding query plans. Our optimized approach shows significant performance gains on triplestores hosted on stand-alone workstations as well as hardware-optimized scalable supercomputers such as the Cray XMT.
Analytic game—theoretic approach to ground-water extraction
Loáiciga, Hugo A.
2004-09-01
The roles of cooperation and non-cooperation in the sustainable exploitation of a jointly used groundwater resource have been quantified mathematically using an analytical game-theoretic formulation. Cooperative equilibrium arises when ground-water users respect water-level constraints and consider mutual impacts, which allows them to derive economic benefits from ground-water indefinitely, that is, to achieve sustainability. This work shows that cooperative equilibrium can be obtained from the solution of a quadratic programming problem. For cooperative equilibrium to hold, however, enforcement must be effective. Otherwise, according to the commonized costs-privatized profits paradox, there is a natural tendency towards non-cooperation and non-sustainable aquifer mining, of which overdraft is a typical symptom. Non-cooperative behavior arises when at least one ground-water user neglects the externalities of his adopted ground-water pumping strategy. In this instance, water-level constraints may be violated in a relatively short time and the economic benefits from ground-water extraction fall below those obtained with cooperative aquifer use. One example illustrates the game theoretic approach of this work.
Factors determining early internationalization of entrepreneurial SMEs: Theoretical approach
Agne Matiusinaite
2015-12-01
Full Text Available Purpose – This study extends the scientific discussion of early internationalization of SMEs. The main purpose of this paper – to develop a theoretical framework to investigate factors determining early internationalization of international new ventures. Design/methodology/approach – The conceptual framework is built on the analysis and synthesis of scientific literature. Findings – This paper presents different factors, which determine early internationalization of international new ventures. These factors are divided to entrepreneurial, organizational and contextual factors. We argue that early internationalization of international new ventures is defined by entrepreneurial characteristics and previous experience of the entrepreneur, opportunities recognition and exploitation, risk tolerance, specific of the organization, involvement into networks and contextual factors. Study proved that only interaction between factors and categories has an effect for business development and successful implementation of early internationalization. Research limitations/implications – The research was conducted on the theoretical basis of scientific literature. The future studies could include a practical confirmation or denial of such allocation of factors. Originality/value – The originality of this study lies in the finding that factor itself has limited effect to early internationalization. Only the interoperability of categories and factors gives a positive impact on early internationalization of entrepreneurial SMEs.
Investigations on Actuator Dynamics through Theoretical and Finite Element Approach
Somashekhar S. Hiremath
2010-01-01
Full Text Available This paper gives a new approach for modeling the fluid-structure interaction of servovalve component-actuator. The analyzed valve is a precision flow control valve-jet pipe electrohydraulic servovalve. The positioning of an actuator depends upon the flow rate from control ports, in turn depends on the spool position. Theoretical investigation is made for No-load condition and Load condition for an actuator. These are used in finite element modeling of an actuator. The fluid-structure-interaction (FSI is established between the piston and the fluid cavities at the piston end. The fluid cavities were modeled with special purpose hydrostatic fluid elements while the piston is modeled with brick elements. The finite element method is used to simulate the variation of cavity pressure, cavity volume, mass flow rate, and the actuator velocity. The finite element analysis is extended to study the system's linearized response to harmonic excitation using direct solution steady-state dynamics. It was observed from the analysis that the natural frequency of the actuator depends upon the position of the piston in the cylinder. This is a close match with theoretical and simulation results. The effect of bulk modulus is also presented in the paper.
Towards a capability approach to child growth: A theoretical framework.
Haisma, Hinke; Yousefzadeh, Sepideh; Boele Van Hensbroek, Pieter
2018-04-01
Child malnutrition is an important cause of under-5 mortality and morbidity around the globe. Despite the partial success of (inter)national efforts to reduce child mortality, under-5 mortality rates continue to be high. The multidimensional approaches of the Sustainable Development Goals may suggest new directions for rethinking strategies for reducing child mortality and malnutrition. We propose a theoretical framework for developing a "capability" approach to child growth. The current child growth monitoring practices are based on 2 assumptions: (a) that anthropometric and motor development measures are the appropriate indicators; and (b) that child growth can be assessed using a single universal standard that is applicable around the world. These practices may be further advanced by applying a capability approach to child growth, whereby growth is redefined as the achievement of certain capabilities (of society, parents, and children). This framework is similar to the multidimensional approach to societal development presented in the seminal work of Amartya Sen. To identify the dimensions of healthy child growth, we draw upon theories from the social sciences and evolutionary biology. Conceptually, we consider growth as a plural space and propose assessing growth by means of a child growth matrix in which the context is embedded in the assessment. This approach will better address the diversities and the inequalities in child growth. Such a multidimensional measure will have implications for interventions and policy, including prevention and counselling, and could have an impact on child malnutrition and mortality. © 2017 The Authors. Maternal and Child Nutrition Published by John Wiley & Sons, Ltd.
A theoretical approach to photosynthetically active radiation silicon sensor
Tamasi, M.J.L.; Martínez Bogado, M.G.
2013-01-01
This paper presents a theoretical approach for the development of low cost radiometers to measure photosynthetically active radiation (PAR). Two alternatives are considered: a) glass optical filters attached to a silicon sensor, and b) dielectric coating on a silicon sensor. The devices proposed are based on radiometers previously developed by the Argentine National Atomic Energy Commission. The objective of this work is to adapt these low cost radiometers to construct reliable instruments for measuring PAR. The transmittance of optical filters and sensor response have been analyzed for different dielectric materials, number of layers deposited, and incidence angles. Uncertainties in thickness of layer deposition were evaluated. - Highlights: • Design of radiometers to measure photosynthetically active radiation • The study has used a filter and a Si sensor to modify spectral response. • Dielectric multilayers on glass and silicon sensor • Spectral response related to different incidence angles, materials and spectra
Hyperbolicity in median graphs
mic problems in hyperbolic spaces and hyperbolic graphs have been .... that in general the main obstacle is that we do not know the location of ...... [25] Jonckheere E and Lohsoonthorn P, A hyperbolic geometry approach to multipath routing,.
Online adaptive approach for a game-theoretic strategy for complete vehicle energy management
Chen, H.; Kessels, J.T.B.A.; Weiland, S.
2015-01-01
This paper introduces an adaptive approach for a game-theoretic strategy on Complete Vehicle Energy Management. The proposed method enhances the game-theoretic approach such that the strategy is able to adapt to real driving behavior. The classical game-theoretic approach relies on one probability
An integrated theoretical and practical approach for teaching hydrogeology
Bonomi, Tullia; Fumagalli, Letizia; Cavallin, Angelo
2013-04-01
Hydrogeology as an earth science intersects the broader disciplines of geology, engineering, and environmental studies but it does not overlap fully with any of them. It is focused on its own range of problems and over time has developed a rich variety of methods and approaches. The resolution of many hydrogeological problems requires knowledge of elements of geology, hydraulics, physics and chemistry; moreover in recent years the knowledge of modelling techniques has become a necessary ability. Successful transfer of all this knowledge to the students depends on the breadth of material taught in courses, the natural skills of the students and any practical experience the students can obtain. In the Department of Earth and Environmental Sciences of the University of Milano-Bicocca, the teaching of hydrogeology is developed in three inter-related courses: 1) general hydrogeology, 2) applied hydrogeology, 3) groundwater pollution and remediation. The sequence focuses on both groundwater flux and contaminant transport, supplemented by workshops involving case studies and computer labs, which provide the students with practical translation of the theoretical aspects of the science into the world of work. A second key aspect of the program utilizes the students' skill at learning through online approaches, and this is done through three approaches: A) by developing the courses on a University e-learning platform that allows the students to download lectures, articles, and teacher comments, and to participate in online forums; B) by carring out exercises through computer labs where the student analyze and process hydrogeological data by means of different numerical codes, that in turn enable them to manage databases and to perform aquifer test analysis, geostatistical analysis, and flux and transport modelling both in the unsaturated and saturated zone. These exercises are of course preceded by theoretical lectures on codes and software, highlighting their features and
Monitoring Effective Connectivity in the Preterm Brain: A Graph Approach to Study Maturation
M. Lavanga
2017-01-01
Full Text Available In recent years, functional connectivity in the developmental science received increasing attention. Although it has been reported that the anatomical connectivity in the preterm brain develops dramatically during the last months of pregnancy, little is known about how functional and effective connectivity change with maturation. The present study investigated how effective connectivity in premature infants evolves. To assess it, we use EEG measurements and graph-theory methodologies. We recorded data from 25 preterm babies, who underwent long-EEG monitoring at least twice during their stay in the NICU. The recordings took place from 27 weeks postmenstrual age (PMA until 42 weeks PMA. Results showed that the EEG-connectivity, assessed using graph-theory indices, moved from a small-world network to a random one, since the clustering coefficient increases and the path length decreases. This shift can be due to the development of the thalamocortical connections and long-range cortical connections. Based on the network indices, we developed different age-prediction models. The best result showed that it is possible to predict the age of the infant with a root mean-squared error (MSE equal to 2.11 weeks. These results are similar to the ones reported in the literature for age prediction in preterm babies.
A signal-flow-graph approach to on-line gradient calculation.
Campolucci, P; Uncini, A; Piazza, F
2000-08-01
A large class of nonlinear dynamic adaptive systems such as dynamic recurrent neural networks can be effectively represented by signal flow graphs (SFGs). By this method, complex systems are described as a general connection of many simple components, each of them implementing a simple one-input, one-output transformation, as in an electrical circuit. Even if graph representations are popular in the neural network community, they are often used for qualitative description rather than for rigorous representation and computational purposes. In this article, a method for both on-line and batch-backward gradient computation of a system output or cost function with respect to system parameters is derived by the SFG representation theory and its known properties. The system can be any causal, in general nonlinear and time-variant, dynamic system represented by an SFG, in particular any feedforward, time-delay, or recurrent neural network. In this work, we use discrete-time notation, but the same theory holds for the continuous-time case. The gradient is obtained in a straightforward way by the analysis of two SFGs, the original one and its adjoint (obtained from the first by simple transformations), without the complex chain rule expansions of derivatives usually employed. This method can be used for sensitivity analysis and for learning both off-line and on-line. On-line learning is particularly important since it is required by many real applications, such as digital signal processing, system identification and control, channel equalization, and predistortion.
Foodsheds in Virtual Water Flow Networks: A Spectral Graph Theory Approach
Nina Kshetry
2017-06-01
Full Text Available A foodshed is a geographic area from which a population derives its food supply, but a method to determine boundaries of foodsheds has not been formalized. Drawing on the food–water–energy nexus, we propose a formal network science definition of foodsheds by using data from virtual water flows, i.e., water that is virtually embedded in food. In particular, we use spectral graph partitioning for directed graphs. If foodsheds turn out to be geographically compact, it suggests the food system is local and therefore reduces energy and externality costs of food transport. Using our proposed method we compute foodshed boundaries at the global-scale, and at the national-scale in the case of two of the largest agricultural countries: India and the United States. Based on our determination of foodshed boundaries, we are able to better understand commodity flows and whether foodsheds are contiguous and compact, and other factors that impact environmental sustainability. The formal method we propose may be used more broadly to study commodity flows and their impact on environmental sustainability.
Bounding the HL-index of a graph: a majorization approach.
Clemente, Gian Paolo; Cornaro, Alessandra
2016-01-01
In mathematical chemistry, the median eigenvalues of the adjacency matrix of a molecular graph are strictly related to orbital energies and molecular orbitals. In this regard, the difference between the occupied orbital of highest energy (HOMO) and the unoccupied orbital of lowest energy (LUMO) has been investigated (see Fowler and Pisansky in Acta Chim. Slov. 57:513-517, 2010). Motivated by the HOMO-LUMO separation problem, Jaklič et al. in (Ars Math. Contemp. 5:99-115, 2012) proposed the notion of HL -index that measures how large in absolute value are the median eigenvalues of the adjacency matrix. Several bounds for this index have been provided in the literature. The aim of the paper is to derive alternative inequalities to bound the HL -index. By applying majorization techniques and making use of some known relations, we derive new and sharper upper bounds for this index. Analytical and numerical results show the performance of these bounds on different classes of graphs.
Optimization of Investment Planning Based on Game-Theoretic Approach
Elena Vladimirovna Butsenko
2018-03-01
Full Text Available The game-theoretic approach has a vast potential in solving economic problems. On the other hand, the theory of games itself can be enriched by the studies of real problems of decision-making. Hence, this study is aimed at developing and testing the game-theoretic technique to optimize the management of investment planning. This technique enables to forecast the results and manage the processes of investment planning. The proposed method of optimizing the management of investment planning allows to choose the best development strategy of an enterprise. This technique uses the “game with nature” model, and the Wald criterion, the maximum criterion and the Hurwitz criterion as criteria. The article presents a new algorithm for constructing the proposed econometric method to optimize investment project management. This algorithm combines the methods of matrix games. Furthermore, I show the implementation of this technique in a block diagram. The algorithm includes the formation of initial data, the elements of the payment matrix, as well as the definition of maximin, maximal, compromise and optimal management strategies. The methodology is tested on the example of the passenger transportation enterprise of the Sverdlovsk Railway in Ekaterinburg. The application of the proposed methodology and the corresponding algorithm allowed to obtain an optimal price strategy for transporting passengers for one direction of traffic. This price strategy contributes to an increase in the company’s income with minimal risk from the launch of this direction. The obtained results and conclusions show the effectiveness of using the developed methodology for optimizing the management of investment processes in the enterprise. The results of the research can be used as a basis for the development of an appropriate tool and applied by any economic entity in its investment activities.
Boersma, Maria; Smit, Dirk J A; Boomsma, Dorret I; De Geus, Eco J C; Delemarre-van de Waal, Henriette A; Stam, Cornelis J
2013-01-01
The child brain is a small-world network, which is hypothesized to change toward more ordered configurations with development. In graph theoretical studies, comparing network topologies under different conditions remains a critical point. Constructing a minimum spanning tree (MST) might present a solution, since it does not require setting a threshold and uses a fixed number of nodes and edges. In this study, the MST method is introduced to examine developmental changes in functional brain network topology in young children. Resting-state electroencephalography was recorded from 227 children twice at 5 and 7 years of age. Synchronization likelihood (SL) weighted matrices were calculated in three different frequency bands from which MSTs were constructed, which represent constructs of the most important routes for information flow in a network. From these trees, several parameters were calculated to characterize developmental change in network organization. The MST diameter and eccentricity significantly increased, while the leaf number and hierarchy significantly decreased in the alpha band with development. Boys showed significant higher leaf number, betweenness, degree and hierarchy and significant lower SL, diameter, and eccentricity than girls in the theta band. The developmental changes indicate a shift toward more decentralized line-like trees, which supports the previously hypothesized increase toward regularity of brain networks with development. Additionally, girls showed more line-like decentralized configurations, which is consistent with the view that girls are ahead of boys in brain development. MST provides an elegant method sensitive to capture subtle developmental changes in network organization without the bias of network comparison.
A Theoretical Explanation of Marital Conflicts by Paradigmatic Approach
اسماعیل جهانی دولت آباد
2017-06-01
Full Text Available Due to the economic, social and cultural changes in recent decades and consequently alterations in the form and duties of families and expectations of individuals from marriage, the institution of the family and marriage are enormously involved with different challenges and conflicts in comparison to past years. Fragile marital relationships, conflicts and divorce are results of such situations in Iran. Accordingly, the present study, which is designed through meta-analysis and deduction based on the concept analysis and reconceptualization of recent studies, has committed to manifest a proper different paradigm to explain marital conflicts. This paradigm is relying on various theoretical approaches, particularly the theory of symbolic interactionism as the main explanatory mean, and also applying the concept of “Marital Paradigm” as the missing information in previous studies of this field. It explains the marital conflicts between couples as paradigmatic conflicts; and its main idea is that marital conflict is not the result of one or more fixed and specified factors, but it is the production of encountering the opposing (or different paradigms.
Intelligent cognitive radio jamming - a game-theoretical approach
Dabcevic, Kresimir; Betancourt, Alejandro; Marcenaro, Lucio; Regazzoni, Carlo S.
2014-12-01
Cognitive radio (CR) promises to be a solution for the spectrum underutilization problems. However, security issues pertaining to cognitive radio technology are still an understudied topic. One of the prevailing such issues are intelligent radio frequency (RF) jamming attacks, where adversaries are able to exploit on-the-fly reconfigurability potentials and learning mechanisms of cognitive radios in order to devise and deploy advanced jamming tactics. In this paper, we use a game-theoretical approach to analyze jamming/anti-jamming behavior between cognitive radio systems. A non-zero-sum game with incomplete information on an opponent's strategy and payoff is modelled as an extension of Markov decision process (MDP). Learning algorithms based on adaptive payoff play and fictitious play are considered. A combination of frequency hopping and power alteration is deployed as an anti-jamming scheme. A real-life software-defined radio (SDR) platform is used in order to perform measurements useful for quantifying the jamming impacts, as well as to infer relevant hardware-related properties. Results of these measurements are then used as parameters for the modelled jamming/anti-jamming game and are compared to the Nash equilibrium of the game. Simulation results indicate, among other, the benefit provided to the jammer when it is employed with the spectrum sensing algorithm in proactive frequency hopping and power alteration schemes.
Vestergaard, Preben Dahl; Hartnell, Bert L.
2006-01-01
There are many results dealing with the problem of decomposing a fixed graph into isomorphic subgraphs. There has also been work on characterizing graphs with the property that one can delete the edges of a number of edge disjoint copies of the subgraph and, regardless of how that is done, the gr...
A Modal-Logic Based Graph Abstraction
Bauer, J.; Boneva, I.B.; Kurban, M.E.; Rensink, Arend; Ehrig, H; Heckel, R.; Rozenberg, G.; Taentzer, G.
2008-01-01
Infinite or very large state spaces often prohibit the successful verification of graph transformation systems. Abstract graph transformation is an approach that tackles this problem by abstracting graphs to abstract graphs of bounded size and by lifting application of productions to abstract
A graph-based approach to construct target-focused libraries for virtual screening.
Naderi, Misagh; Alvin, Chris; Ding, Yun; Mukhopadhyay, Supratik; Brylinski, Michal
2016-01-01
Due to exorbitant costs of high-throughput screening, many drug discovery projects commonly employ inexpensive virtual screening to support experimental efforts. However, the vast majority of compounds in widely used screening libraries, such as the ZINC database, will have a very low probability to exhibit the desired bioactivity for a given protein. Although combinatorial chemistry methods can be used to augment existing compound libraries with novel drug-like compounds, the broad chemical space is often too large to be explored. Consequently, the trend in library design has shifted to produce screening collections specifically tailored to modulate the function of a particular target or a protein family. Assuming that organic compounds are composed of sets of rigid fragments connected by flexible linkers, a molecule can be decomposed into its building blocks tracking their atomic connectivity. On this account, we developed eSynth, an exhaustive graph-based search algorithm to computationally synthesize new compounds by reconnecting these building blocks following their connectivity patterns. We conducted a series of benchmarking calculations against the Directory of Useful Decoys, Enhanced database. First, in a self-benchmarking test, the correctness of the algorithm is validated with the objective to recover a molecule from its building blocks. Encouragingly, eSynth can efficiently rebuild more than 80 % of active molecules from their fragment components. Next, the capability to discover novel scaffolds is assessed in a cross-benchmarking test, where eSynth successfully reconstructed 40 % of the target molecules using fragments extracted from chemically distinct compounds. Despite an enormous chemical space to be explored, eSynth is computationally efficient; half of the molecules are rebuilt in less than a second, whereas 90 % take only about a minute to be generated. eSynth can successfully reconstruct chemically feasible molecules from molecular fragments
Distinguishing prognostic and predictive biomarkers: An information theoretic approach.
Sechidis, Konstantinos; Papangelou, Konstantinos; Metcalfe, Paul D; Svensson, David; Weatherall, James; Brown, Gavin
2018-05-02
The identification of biomarkers to support decision-making is central to personalised medicine, in both clinical and research scenarios. The challenge can be seen in two halves: identifying predictive markers, which guide the development/use of tailored therapies; and identifying prognostic markers, which guide other aspects of care and clinical trial planning, i.e. prognostic markers can be considered as covariates for stratification. Mistakenly assuming a biomarker to be predictive, when it is in fact largely prognostic (and vice-versa) is highly undesirable, and can result in financial, ethical and personal consequences. We present a framework for data-driven ranking of biomarkers on their prognostic/predictive strength, using a novel information theoretic method. This approach provides a natural algebra to discuss and quantify the individual predictive and prognostic strength, in a self-consistent mathematical framework. Our contribution is a novel procedure, INFO+, which naturally distinguishes the prognostic vs predictive role of each biomarker and handles higher order interactions. In a comprehensive empirical evaluation INFO+ outperforms more complex methods, most notably when noise factors dominate, and biomarkers are likely to be falsely identified as predictive, when in fact they are just strongly prognostic. Furthermore, we show that our methods can be 1-3 orders of magnitude faster than competitors, making it useful for biomarker discovery in 'big data' scenarios. Finally, we apply our methods to identify predictive biomarkers on two real clinical trials, and introduce a new graphical representation that provides greater insight into the prognostic and predictive strength of each biomarker. R implementations of the suggested methods are available at https://github.com/sechidis. konstantinos.sechidis@manchester.ac.uk. Supplementary data are available at Bioinformatics online.
Graph Sampling for Covariance Estimation
Chepuri, Sundeep Prabhakar
2017-04-25
In this paper the focus is on subsampling as well as reconstructing the second-order statistics of signals residing on nodes of arbitrary undirected graphs. Second-order stationary graph signals may be obtained by graph filtering zero-mean white noise and they admit a well-defined power spectrum whose shape is determined by the frequency response of the graph filter. Estimating the graph power spectrum forms an important component of stationary graph signal processing and related inference tasks such as Wiener prediction or inpainting on graphs. The central result of this paper is that by sampling a significantly smaller subset of vertices and using simple least squares, we can reconstruct the second-order statistics of the graph signal from the subsampled observations, and more importantly, without any spectral priors. To this end, both a nonparametric approach as well as parametric approaches including moving average and autoregressive models for the graph power spectrum are considered. The results specialize for undirected circulant graphs in that the graph nodes leading to the best compression rates are given by the so-called minimal sparse rulers. A near-optimal greedy algorithm is developed to design the subsampling scheme for the non-parametric and the moving average models, whereas a particular subsampling scheme that allows linear estimation for the autoregressive model is proposed. Numerical experiments on synthetic as well as real datasets related to climatology and processing handwritten digits are provided to demonstrate the developed theory.
Modelling of Non-Linear Pilot Disinfection Water System: A Bond Graph Approach
Naoufel ZITOUNI
2012-08-01
Full Text Available The ultraviolet (UV irradiations are used to solve the bacteriological problem of the drinking water quality. A discharge-gas lamp is used to produce this type of irradiation. The UV lamp is fed by photovoltaic (PV energy via electronic ballast composed by an inverter, a transformer and resonant circuit (RLC. The aim of this work is to give a useful global model of the system. In particular, we introduce the complicated UV lamp model and the water disinfection kinetics, where the radiant energy flux emitted by the discharge-gas lamp and the arc voltage are a complex functions of the current and time. This system is intended to be mainly used in rural zones, the photovoltaic modules as source of energy is an adequate solution. To optimise the power transfer from the PV array to ballast and UV lamp, a Maximum Power Point Tracking (MPPT device may be located between PV array and the loads. In this paper, we developed a bond-graph model which gives the water quality from UV flow, gas type, pressure, lamp current and geometrical characteristic. Finally reliable simulations are established and compared with experimental tests.
Simoens Frederik
2006-01-01
Full Text Available This paper concerns channel tracking in a multiantenna context for correlated flat-fading channels obeying a Gauss-Markov model. It is known that data-aided tracking of fast-fading channels requires a lot of pilot symbols in order to achieve sufficient accuracy, and hence decreases the spectral efficiency. To overcome this problem, we design a code-aided estimation scheme which exploits information from both the pilot symbols and the unknown coded data symbols. The algorithm is derived based on a factor graph representation of the system and application of the sum-product algorithm. The sum-product algorithm reveals how soft information from the decoder should be exploited for the purpose of estimation and how the information bits can be detected. Simulation results illustrate the effectiveness of our approach.
Khaouch, Zakaria; Zekraoui, Mustapha; Bengourram, Jamaa; Kouider, Nourreeddine; Mabrouki, Mustapha
2016-11-01
In this paper, we would like to focus on modeling main parts of the wind turbines (blades, gearbox, tower, generator and pitching system) from a mechatronics viewpoint using the Bond-Graph Approach (BGA). Then, these parts are combined together in order to simulate the complete system. Moreover, the real dynamic behavior of the wind turbine is taken into account and with the new model; final load simulation is more realistic offering benefits and reliable system performance. This model can be used to develop control algorithms to reduce fatigue loads and enhance power production. Different simulations are carried-out in order to validate the proposed wind turbine model, using real data provided in the open literature (blade profile and gearbox parameters for a 750 kW wind turbine). Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.
Hendrix, William; Jenkins, John; Padmanabhan, Kanchana; Chakraborty, Arpan
2014-01-01
Practical Graph Mining with R presents a "do-it-yourself" approach to extracting interesting patterns from graph data. It covers many basic and advanced techniques for the identification of anomalous or frequently recurring patterns in a graph, the discovery of groups or clusters of nodes that share common patterns of attributes and relationships, the extraction of patterns that distinguish one category of graphs from another, and the use of those patterns to predict the category of new graphs. Hands-On Application of Graph Data Mining Each chapter in the book focuses on a graph mining task, such as link analysis, cluster analysis, and classification. Through applications using real data sets, the book demonstrates how computational techniques can help solve real-world problems. The applications covered include network intrusion detection, tumor cell diagnostics, face recognition, predictive toxicology, mining metabolic and protein-protein interaction networks, and community detection in social networks. De...
Cheung, King Sing
2014-01-01
Petri nets are a formal and theoretically rich model for the modelling and analysis of systems. A subclass of Petri nets, augmented marked graphs possess a structure that is especially desirable for the modelling and analysis of systems with concurrent processes and shared resources.This monograph consists of three parts: Part I provides the conceptual background for readers who have no prior knowledge on Petri nets; Part II elaborates the theory of augmented marked graphs; finally, Part III discusses the application to system integration. The book is suitable as a first self-contained volume
Anticipation-related brain connectivity in bipolar and unipolar depression: a graph theory approach.
Manelis, Anna; Almeida, Jorge R C; Stiffler, Richelle; Lockovich, Jeanette C; Aslam, Haris A; Phillips, Mary L
2016-09-01
Bipolar disorder is often misdiagnosed as major depressive disorder, which leads to inadequate treatment. Depressed individuals versus healthy control subjects, show increased expectation of negative outcomes. Due to increased impulsivity and risk for mania, however, depressed individuals with bipolar disorder may differ from those with major depressive disorder in neural mechanisms underlying anticipation processes. Graph theory methods for neuroimaging data analysis allow the identification of connectivity between multiple brain regions without prior model specification, and may help to identify neurobiological markers differentiating these disorders, thereby facilitating development of better therapeutic interventions. This study aimed to compare brain connectivity among regions involved in win/loss anticipation in depressed individuals with bipolar disorder (BDD) versus depressed individuals with major depressive disorder (MDD) versus healthy control subjects using graph theory methods. The study was conducted at the University of Pittsburgh Medical Center and included 31 BDD, 39 MDD, and 36 healthy control subjects. Participants were scanned while performing a number guessing reward task that included the periods of win and loss anticipation. We first identified the anticipatory network across all 106 participants by contrasting brain activation during all anticipation periods (win anticipation + loss anticipation) versus baseline, and win anticipation versus loss anticipation. Brain connectivity within the identified network was determined using the Independent Multiple sample Greedy Equivalence Search (IMaGES) and Linear non-Gaussian Orientation, Fixed Structure (LOFS) algorithms. Density of connections (the number of connections in the network), path length, and the global connectivity direction ('top-down' versus 'bottom-up') were compared across groups (BDD/MDD/healthy control subjects) and conditions (win/loss anticipation). These analyses showed that
Korovin, Iakov S.; Tkachenko, Maxim G.
2018-03-01
In this paper we present a heuristic approach, improving the efficiency of methods, used for creation of efficient architecture of water distribution networks. The essence of the approach is a procedure of search space reduction the by limiting the range of available pipe diameters that can be used for each edge of the network graph. In order to proceed the reduction, two opposite boundary scenarios for the distribution of flows are analysed, after which the resulting range is further narrowed by applying a flow rate limitation for each edge of the network. The first boundary scenario provides the most uniform distribution of the flow in the network, the opposite scenario created the net with the highest possible flow level. The parameters of both distributions are calculated by optimizing systems of quadratic functions in a confined space, which can be effectively performed with small time costs. This approach was used to modify the genetic algorithm (GA). The proposed GA provides a variable number of variants of each gene, according to the number of diameters in list, taking into account flow restrictions. The proposed approach was implemented to the evaluation of a well-known test network - the Hanoi water distribution network [1], the results of research were compared with a classical GA with an unlimited search space. On the test data, the proposed trip significantly reduced the search space and provided faster and more obvious convergence in comparison with the classical version of GA.
Exner, Pavel; Lipovský, J.
2017-01-01
Roč. 58, č. 4 (2017), č. článku 042101. ISSN 0022-2488 R&D Projects: GA ČR GA17-01706S Institutional support: RVO:61389005 Keywords : self-adjoint coupling * high-energy regime * resonances in quantum graphs Subject RIV: BE - Theoretical Physics OBOR OECD: Atomic, molecular and chemical physics ( physics of atoms and molecules including collision, interaction with radiation, magnetic resonances, Mössbauer effect) Impact factor: 1.077, year: 2016
SUSTAINABLE TOURISM AND ITS FORMS - A THEORETICAL APPROACH
Bac Dorin
2013-07-01
Full Text Available From the second half of the twentieth century, the importance of the tourism industry to the world economy continued to grow, reaching today impressive figures: receipts of almost $ 1,000 billion and direct employment for over 70 million people (WTTC 2012, without taking into account the multiplier effect (according to the same statistics of WTTC, if considering the multiplier effect, the values are: $ 5,990 billion in tourism receipts, and 253.5 million jobs. We can say that tourism: has a higher capacity to generate and distribute incomes compared to other sectors; has a high multiplier effect; determines a high level of consumption of varied products and services. In this context, voices began to emerge, which presented the problems and challenges generated by the tourism activity. Many regions are facing real problems generated by tourism entrepreneurs and tourists who visit the community. Therefore, at the end of the last century, there were authors who sought to define a new form of tourism, which eliminated the negative impacts and increased the positive ones. As a generic term they used alternative tourism, but because of the ambiguity of the term, they tried to find a more precise term, which would define the concept easier. Thus emerged: ecotourism, rural tourism, Pro Poor Tourism etc.. All these forms have been introduced under the umbrella concept of sustainable tourism. In the present paper we will take a theoretical approach, in order to present some forms of sustainable tourism. During our research we covered the ideas and concepts promoted by several authors and academics but also some international organizations with focus on tourism. We considered these forms of tourism, as they respect all the rules of sustainable tourism and some of them have great potential to grow in both developed and emerging countries. The forms of sustainable tourism we identified are: ecotourism, pro-poor tourism, volunteer tourism and slow tourism. In
Resilience or Flexibility– A Theoretical Approach on Romanian Development Regions
Roxana Voicu – Dorobanțu
2015-09-01
Full Text Available The paper describes a theoretical contextualization of flexibility, sustainability, durability and resilience, in the context of the sustainable development goals. The main purpose is to identify the theoretical handles that may be used in the creation of a flexibility indicator. Thus, research questions related to the theoretical differentiation between durable and sustainable, flexible and resilient are answered. Further on, the paper describes the situation of the Romanian regions in terms of development indicators, based on Eurostat data, as a premise for further research on the possibility of their leapfrogging. This work was financially supported through the project “Routes of academic excellence in doctoral and post-doctoral research- REACH” co-financed through the European Social Fund, by Sectoral Operational Programme Human Resources Development 2007-2013, contract no POSDRU/59/1.5/S/137926.
Game-theoretic interference coordination approaches for dynamic spectrum access
Xu, Yuhua
2016-01-01
Written by experts in the field, this book is based on recent research findings in dynamic spectrum access for cognitive radio networks. It establishes a game-theoretic framework and presents cutting-edge technologies for distributed interference coordination. With game-theoretic formulation and the designed distributed learning algorithms, it provides insights into the interactions between multiple decision-makers and the converging stable states. Researchers, scientists and engineers in the field of cognitive radio networks will benefit from the book, which provides valuable information, useful methods and practical algorithms for use in emerging 5G wireless communication.
Ribes, Luis
2017-01-01
This book offers a detailed introduction to graph theoretic methods in profinite groups and applications to abstract groups. It is the first to provide a comprehensive treatment of the subject. The author begins by carefully developing relevant notions in topology, profinite groups and homology, including free products of profinite groups, cohomological methods in profinite groups, and fixed points of automorphisms of free pro-p groups. The final part of the book is dedicated to applications of the profinite theory to abstract groups, with sections on finitely generated subgroups of free groups, separability conditions in free and amalgamated products, and algorithms in free groups and finite monoids. Profinite Graphs and Groups will appeal to students and researchers interested in profinite groups, geometric group theory, graphs and connections with the theory of formal languages. A complete reference on the subject, the book includes historical and bibliographical notes as well as a discussion of open quest...
Theoretical and methodological approaches to economic competitiveness (Part I
Macari Vadim
2013-01-01
Full Text Available The article is based on study of several representative bibliographical sources,it is tried to examine, to order from logical and scientific point of view some of the most common theoretical and methodological understandings of the essence, definition, phenomenon, types, haracteristics and indices of economic competitiveness.
Theoretical and methodological approaches to economic competitiveness (part II
Macari Vadim
2013-02-01
Full Text Available This article, on the basis of the study of many representative bibliographic sources, examines and tries to order from logical and scientific point of view some of the most common theoretical and methodological treatments of the essence, definition, phenomenon, types, characteristics and indices of economic competitiveness.
THEORETICAL AND METHODOLOGICAL APPROACHES TO ECONOMIC COMPETITIVENESS (Part II
Vadim MACARI
2013-02-01
Full Text Available This article, on the basis of the study of many representative bibliographic sources, examines and tries to order from logical and scientific point of view some of the most common theoretical and methodological treatments of the essence, definition, phenomenon, types, characteristics and indices of economic competitiveness.
THEORETICAL AND METHODOLOGICAL APPROACHES TO ECONOMIC COMPETITIVENESS (Part I
Vadim MACARI
2013-01-01
Full Text Available The article is based on study of several representative bibliographical sources,it is tried to examine, to order from logical and scientific point of view some of the most common theoretical and methodological understandings of the essence, definition, phenomenon, types, characteristics and indices of economic competitiveness.
Zhang, Honghai; Abiose, Ademola K.; Campbell, Dwayne N.; Sonka, Milan; Martins, James B.; Wahle, Andreas
2010-03-01
Quantitative analysis of the left ventricular shape and motion patterns associated with left ventricular mechanical dyssynchrony (LVMD) is essential for diagnosis and treatment planning in congestive heart failure. Real-time 3D echocardiography (RT3DE) used for LVMD analysis is frequently limited by heavy speckle noise or partially incomplete data, thus a segmentation method utilizing learned global shape knowledge is beneficial. In this study, the endocardial surface of the left ventricle (LV) is segmented using a hybrid approach combining active shape model (ASM) with optimal graph search. The latter is used to achieve landmark refinement in the ASM framework. Optimal graph search translates the 3D segmentation into the detection of a minimum-cost closed set in a graph and can produce a globally optimal result. Various information-gradient, intensity distributions, and regional-property terms-are used to define the costs for the graph search. The developed method was tested on 44 RT3DE datasets acquired from 26 LVMD patients. The segmentation accuracy was assessed by surface positioning error and volume overlap measured for the whole LV as well as 16 standard LV regions. The segmentation produced very good results that were not achievable using ASM or graph search alone.
Mechatronics by bond graphs an object-oriented approach to modelling and simulation
Damić, Vjekoslav
2015-01-01
This book presents a computer-aided approach to the design of mechatronic systems. Its subject is an integrated modeling and simulation in a visual computer environment. Since the first edition, the simulation software changed enormously, became more user-friendly and easier to use. Therefore, a second edition became necessary taking these improvements into account. The modeling is based on system top-down and bottom-up approach. The mathematical models are generated in a form of differential-algebraic equations and solved using numerical and symbolic algebra methods. The integrated approach developed is applied to mechanical, electrical and control systems, multibody dynamics, and continuous systems. .
Group theoretic approaches to nuclear and hadronic collective motion
Biedenharn, L.C.
1982-01-01
Three approaches to nuclear and hadronic collective motion are reviewed, compared and contrasted: the standard symmetry approach as typified by the Interacting Boson Model, the kinematic symmetry group approach of Gell-Mann and Tomonaga, and the recent direct construction by Buck. 50 references
Scientific-theoretical research approach to practical theology in ...
All of them work with practical theological hermeneutics. The basic hermeneutic approach of Daniël Louw is widened with an integrated approach by Richard R. Osmer in which practical theology as a hermeneutic discipline also includes the empirical aspect which the action theory approach has contributed to the ...
Group theoretic approaches to nuclear and hadronic collective motion
Biedenharn, L.C.
1982-01-01
Three approaches to nuclear and hadronic collective motion are reviewed, compared and contrasted: the standard symmetry approach as typified by the Interacting Boson Model, the kinematic symmetry group approach of Gell-Mann and Tomonaga, and the recent direct construction by Buck. 50 references.
An Efficient Monte Carlo Approach to Compute PageRank for Large Graphs on a Single PC
Sonobe Tomohiro
2016-03-01
Full Text Available This paper describes a novel Monte Carlo based random walk to compute PageRanks of nodes in a large graph on a single PC. The target graphs of this paper are ones whose size is larger than the physical memory. In such an environment, memory management is a difficult task for simulating the random walk among the nodes. We propose a novel method that partitions the graph into subgraphs in order to make them fit into the physical memory, and conducts the random walk for each subgraph. By evaluating the walks lazily, we can conduct the walks only in a subgraph and approximate the random walk by rotating the subgraphs. In computational experiments, the proposed method exhibits good performance for existing large graphs with several passes of the graph data.
A comparison of approaches for finding minimum identifying codes on graphs
Horan, Victoria; Adachi, Steve; Bak, Stanley
2016-05-01
In order to formulate mathematical conjectures likely to be true, a number of base cases must be determined. However, many combinatorial problems are NP-hard and the computational complexity makes this research approach difficult using a standard brute force approach on a typical computer. One sample problem explored is that of finding a minimum identifying code. To work around the computational issues, a variety of methods are explored and consist of a parallel computing approach using MATLAB, an adiabatic quantum optimization approach using a D-Wave quantum annealing processor, and lastly using satisfiability modulo theory (SMT) and corresponding SMT solvers. Each of these methods requires the problem to be formulated in a unique manner. In this paper, we address the challenges of computing solutions to this NP-hard problem with respect to each of these methods.
THEORETICAL AND METHODOLOGICAL APPROACHES TO REGIONAL COMPETITION INVESTIGATION
A.I. Tatarkin
2006-03-01
Full Text Available The article is dedicated to theoretical-methodological issues of regional economy competitiveness investigation. Economic essence of regional competitiveness is analyzed, its definition is given. The factors that determine relations of competition on medium and macrolevels are proved. The basic differences between world-economical and inter-regional communications are formulated. The specific features of globalization processes as form of competitive struggle are considered.
Representing electrons a biographical approach to theoretical entities
Arabatzis, Theodore
2006-01-01
Both a history and a metahistory, Representing Electrons focuses on the development of various theoretical representations of electrons from the late 1890s to 1925 and the methodological problems associated with writing about unobservable scientific entities. Using the electron-or rather its representation-as a historical actor, Theodore Arabatzis illustrates the emergence and gradual consolidation of its representation in physics, its career throughout old quantum theory, and its appropriation and reinterpretation by chemists. As Arabatzis develops this novel biographical
Vincze, Arpad; Nemeth, Andras
2013-01-01
According to a recent statement, the IAEA seeks to develop a more effective safeguards system to achieve greater deterrence, because deterrence of proliferation is much more effective than detection. To achieve this goal, a less predictive safeguards system is being developed based on the advanced state-level approach that is driven by all available safeguards-relevant information. The 'directed graph analysis' is recommended as a possible methodology to implement acquisition path analysis by the IAEA to support the State evaluation process. The basic methodology is simple, well established, powerful, and its adaptation to the modelling of the nuclear profile of a State requires minimum software development. Based on this methodology the material flow network model has been developed under the Hungarian Support Programme to the IAEA, which is described in detail. In the proposed model, materials in different chemical and physical form can flow through pipes representing declared processes, material transports, diversions or undeclared processes. The nodes of the network are the material types, while the edges of the network are the pipes. A state parameter (p) is assigned to each node and edge representing the probability of their existence in the State. The possible application of this model in the State-level analytical approach will be discussed and outlook for further work will be given. The paper is followed by the slides of the presentation
We need theoretical physics approaches to study living systems
Blagoev, Krastan B.; Shukla, Kamal; affil="3" >Herbert Levine,
2013-08-01
Living systems, as created initially by the transition from assemblies of large molecules to self-reproducing information-rich cells, have for centuries been studied via the empirical toolkit of biology. This has been a highly successful enterprise, bringing us from the vague non-scientific notions of vitalism to the modern appreciation of the biophysical and biochemical bases of life. Yet, the truly mind-boggling complexity of even the simplest self-sufficient cells, let alone the emergence of multicellular organisms, of brain and consciousness, and to ecological communities and human civilizations, calls out for a complementary approach. In this editorial, we propose that theoretical physics can play an essential role in making sense of living matter. When faced with a highly complex system, a physicist builds simplified models. Quoting Philip W Anderson's Nobel prize address, 'the art of model-building is the exclusion of real but irrelevant parts of the problem and entails hazards for the builder and the reader. The builder may leave out something genuinely relevant and the reader, armed with too sophisticated an experimental probe, may take literally a schematized model. Very often such a simplified model throws more light on the real working of nature....' In his formulation, the job of a theorist is to get at the crux of the system by ignoring details and yet to find a testable consequence of the resulting simple picture. This is rather different than the predilection of the applied mathematician who wants to include all the known details in the hope of a quantitative simulacrum of reality. These efforts may be practically useful, but do not usually lead to increased understanding. To illustrate how this works, we can look at a non-living example of complex behavior that was afforded by spatiotemporal patterning in the Belousov-Zhabotinsky reaction [1]. Physicists who worked on this system did not attempt to determine all the relevant chemical intermediates
Theoretical analysis of two ACO approaches for the traveling salesman problem
Kötzing, Timo; Neumann, Frank; Röglin, Heiko
2012-01-01
Bioinspired algorithms, such as evolutionary algorithms and ant colony optimization, are widely used for different combinatorial optimization problems. These algorithms rely heavily on the use of randomness and are hard to understand from a theoretical point of view. This paper contributes...... to the theoretical analysis of ant colony optimization and studies this type of algorithm on one of the most prominent combinatorial optimization problems, namely the traveling salesperson problem (TSP). We present a new construction graph and show that it has a stronger local property than one commonly used...... for constructing solutions of the TSP. The rigorous runtime analysis for two ant colony optimization algorithms, based on these two construction procedures, shows that they lead to good approximation in expected polynomial time on random instances. Furthermore, we point out in which situations our algorithms get...
Agha Mohammad Ali Kermani, Mehrdad; Fatemi Ardestani, Seyed Farshad; Aliahmadi, Alireza; Barzinpour, Farnaz
2017-01-01
Influence maximization deals with identification of the most influential nodes in a social network given an influence model. In this paper, a game theoretic framework is developed that models a competitive influence maximization problem. A novel competitive influence model is additionally proposed that incorporates user heterogeneity, message content, and network structure. The proposed game-theoretic model is solved using Nash Equilibrium in a real-world dataset. It is shown that none of the well-known strategies are stable and at least one player has the incentive to deviate from the proposed strategy. Moreover, violation of Nash equilibrium strategy by each player leads to their reduced payoff. Contrary to previous works, our results demonstrate that graph topology, as well as the nodes' sociability and initial tendency measures have an effect on the determination of the influential node in the network.
Graph Theory. 2. Vertex Descriptors and Graph Coloring
Lorentz JÄNTSCHI
2002-12-01
Full Text Available This original work presents the construction of a set of ten sequence matrices and their applications for ordering vertices in graphs. For every sequence matrix three ordering criteria are applied: lexicographic ordering, based on strings of numbers, corresponding to every vertex, extracted as rows from sequence matrices; ordering by the sum of path lengths from a given vertex; and ordering by the sum of paths, starting from a given vertex. We also examine a graph that has different orderings for the above criteria. We then proceed to demonstrate that every criterion induced its own partition of graph vertex. We propose the following theoretical result: both LAVS and LVDS criteria generate identical partitioning of vertices in any graph. Finally, a coloring of graph vertices according to introduced ordering criteria was proposed.
Rand, C.P. du; Schoor, G. van
2012-01-01
Highlights: ► Different uncorrelated fault signatures are derived for HTGR component faults. ► A multiple classifier ensemble increases confidence in classification accuracy. ► Detailed simulation model of system is not required for fault diagnosis. - Abstract: The second paper in a two part series presents the area error method for generation of representative enthalpy–entropy (h–s) fault signatures to classify malfunctions in generation IV nuclear high temperature gas-cooled reactor (HTGR) components. The second classifier is devised to ultimately address the fault diagnosis (FD) problem via the proposed methods in a multiple classifier (MC) ensemble. FD is realized by way of different input feature sets to the classification algorithm based on the area and trajectory of the residual shift between the fault-free and the actual operating h–s graph models. The application of the proposed technique is specifically demonstrated for 24 single fault transients considered in the main power system (MPS) of the Pebble Bed Modular Reactor (PBMR). The results show that the area error technique produces different fault signatures with low correlation for all the examined component faults. A brief evaluation of the two fault signature generation techniques is presented and the performance of the area error method is documented using the fault classification index (FCI) presented in Part I of the series. The final part of this work reports the application of the proposed approach for classification of an emulated fault transient in data from the prototype Pebble Bed Micro Model (PBMM) plant. Reference data values are calculated for the plant via a thermo-hydraulic simulation model of the MPS. The results show that the correspondence between the fault signatures, generated via experimental plant data and simulated reference values, are generally good. The work presented in the two part series, related to the classification of component faults in the MPS of different
Golino, H.F.; Epskamp, S.
2017-01-01
The estimation of the correct number of dimensions is a long-standing problem in psychometrics. Several methods have been proposed, such as parallel analysis (PA), Kaiser-Guttman’s eigenvalue-greater-than-one rule, multiple average partial procedure (MAP), the maximum-likelihood approaches that use
Strength of wood versus rate of testing - A theoretical approach
Nielsen, Lauge Fuglsang
2007-01-01
Strength of wood is normally measured in ramp load experiments. Experience shows that strength increases with increasing rate of testing. This feature is considered theoretically in this paper. It is shown that the influence of testing rate is a phenomenon, which depends on the quality...... of the considered wood. Low quality wood shows lesser influence of testing rate. This observation agrees with the well-known statement made by Borg Madsen that weak wood subjected to a constant load, has a longer lifetime than strong wood. In general, the influence of testing rate on strength increases...
Theoretical approaches to digital services and digital democracy
Hoff, Jens Villiam; Scheele, Christian Elling
2014-01-01
The purpose of this paper is to develop a theoretical framework, which can be used in the analysis of all types of (political-administrative) web applications. Through a discussion and criticism of social construction of technology (SCOT), an earlier version of this model based on new medium theory...... are translated into specific (political-administrative) practices, and how these practices are produced through the interplay between discourses, actors and technology. However, the new version places practices more firmly at the centre of the model, as practices, following Reckwitz, is seen as the enactment...
A Representation-Theoretic Approach to Reversible Computation with Applications
Maniotis, Andreas Milton
Reversible computing is a sub-discipline of computer science that helps to understand the foundations of the interplay between physics, algebra, and logic in the context of computation. Its subjects of study are computational devices and abstract models of computation that satisfy the constraint ......, there is still no uniform and consistent theory that is general in the sense of giving a model-independent account to the field....... of information conservation. Such machine models, which are known as reversible models of computation, have been examined both from a theoretical perspective and from an engineering perspective. While a bundle of many isolated successful findings and applications concerning reversible computing exists...
Trudeau, Richard J
1994-01-01
Preface1. Pure Mathematics Introduction; Euclidean Geometry as Pure Mathematics; Games; Why Study Pure Mathematics?; What's Coming; Suggested Reading2. Graphs Introduction; Sets; Paradox; Graphs; Graph diagrams; Cautions; Common Graphs; Discovery; Complements and Subgraphs; Isomorphism; Recognizing Isomorphic Graphs; Semantics The Number of Graphs Having a Given nu; Exercises; Suggested Reading3. Planar Graphs Introduction; UG, K subscript 5, and the Jordan Curve Theorem; Are there More Nonplanar Graphs?; Expansions; Kuratowski's Theorem; Determining Whether a Graph is Planar or
Planar graphs theory and algorithms
Nishizeki, T
1988-01-01
Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together with constructive proofs for the theorems. Many of the algorithms are written in Pidgin PASCAL, and are the best-known ones; the complexities are linear or 0(nlogn). The first two chapters provide the foundations of graph theoretic notions and algorithmic techniques. The remaining chapters discuss the topics of planarity testing, embedding, drawing, vertex- or edge-coloring, maximum independence set, subgraph listing, planar separator theorem, Hamiltonian cycles, and single- or multicommodity flows. Suitable for a course on algorithms, graph theory, or planar graphs, the volume will also be useful for computer scientists and graph theorists at the research level. An extensive reference section is included.
The production of scientific videos: a theoretical approach
Carlos Ernesto Gavilondo Rodriguez
2016-12-01
Full Text Available The article presents the results of theoretical research on the production of scientific videos and its application to the teaching-learning process carried out in schools in the city of Guayaquil, Ecuador. It is located within the production line and Audiovisual Communication. Creation of scientific videos, from the Communication major with a concentration in audiovisual production and multimedia of the Salesian Polytechnic University. For the realization of the article it was necessary to use key terms that helped subsequently to data collection. used terms such as: audiovisual production, understood as the production of content for audiovisual media; the following term used audiovisual communication is recognized as the process in which there is an exchange of messages through an audible and / or visual system; and the last term we use is scientifically video, which is one that uses audiovisual resources to obtain relevant and reliable information.As part of the theoretical results a methodological proposal for the video production is presented for educational purposes. In conclusion set out, first, that from the communicative statement in recent times, current social relations, constitute a successful context of possibilities shown to education to generate meeting points between the world of the everyday and the knowledge. Another indicator validated as part of the investigation, is that teachers surveyed use the potential of the audiovisual media, and supported them, deploy alternatives for use.
Field-theoretic approach to fluctuation effects in neural networks
Buice, Michael A.; Cowan, Jack D.
2007-01-01
A well-defined stochastic theory for neural activity, which permits the calculation of arbitrary statistical moments and equations governing them, is a potentially valuable tool for theoretical neuroscience. We produce such a theory by analyzing the dynamics of neural activity using field theoretic methods for nonequilibrium statistical processes. Assuming that neural network activity is Markovian, we construct the effective spike model, which describes both neural fluctuations and response. This analysis leads to a systematic expansion of corrections to mean field theory, which for the effective spike model is a simple version of the Wilson-Cowan equation. We argue that neural activity governed by this model exhibits a dynamical phase transition which is in the universality class of directed percolation. More general models (which may incorporate refractoriness) can exhibit other universality classes, such as dynamic isotropic percolation. Because of the extremely high connectivity in typical networks, it is expected that higher-order terms in the systematic expansion are small for experimentally accessible measurements, and thus, consistent with measurements in neocortical slice preparations, we expect mean field exponents for the transition. We provide a quantitative criterion for the relative magnitude of each term in the systematic expansion, analogous to the Ginsburg criterion. Experimental identification of dynamic universality classes in vivo is an outstanding and important question for neuroscience
A new theoretical approach to adsorption desorption behavior of Ga on GaAs surfaces
Kangawa, Y.; Ito, T.; Taguchi, A.; Shiraishi, K.; Ohachi, T.
2001-11-01
We propose a new theoretical approach for studying adsorption-desorption behavior of atoms on semiconductor surfaces. The new theoretical approach based on the ab initio calculations incorporates the free energy of gas phase; therefore we can calculate how adsorption and desorption depends on growth temperature and beam equivalent pressure (BEP). The versatility of the new theoretical approach was confirmed by the calculation of Ga adsorption-desorption transition temperatures and transition BEPs on the GaAs(0 0 1)-(4×2)β2 Ga-rich surface. This new approach is feasible to predict how adsorption and desorption depend on the growth conditions.
Towards a theory of geometric graphs
Pach, Janos
2004-01-01
The early development of graph theory was heavily motivated and influenced by topological and geometric themes, such as the Konigsberg Bridge Problem, Euler's Polyhedral Formula, or Kuratowski's characterization of planar graphs. In 1936, when Denes Konig published his classical Theory of Finite and Infinite Graphs, the first book ever written on the subject, he stressed this connection by adding the subtitle Combinatorial Topology of Systems of Segments. He wanted to emphasize that the subject of his investigations was very concrete: planar figures consisting of points connected by straight-line segments. However, in the second half of the twentieth century, graph theoretical research took an interesting turn. In the most popular and most rapidly growing areas (the theory of random graphs, Ramsey theory, extremal graph theory, algebraic graph theory, etc.), graphs were considered as abstract binary relations rather than geometric objects. Many of the powerful techniques developed in these fields have been su...
Summary: beyond fault trees to fault graphs
Alesso, H.P.; Prassinos, P.; Smith, C.F.
1984-09-01
Fault Graphs are the natural evolutionary step over a traditional fault-tree model. A Fault Graph is a failure-oriented directed graph with logic connectives that allows cycles. We intentionally construct the Fault Graph to trace the piping and instrumentation drawing (P and ID) of the system, but with logical AND and OR conditions added. Then we evaluate the Fault Graph with computer codes based on graph-theoretic methods. Fault Graph computer codes are based on graph concepts, such as path set (a set of nodes traveled on a path from one node to another) and reachability (the complete set of all possible paths between any two nodes). These codes are used to find the cut-sets (any minimal set of component failures that will fail the system) and to evaluate the system reliability
A Game-Theoretical Approach to Multimedia Social Networks Security
Liu, Enqiang; Liu, Zengliang; Shao, Fei; Zhang, Zhiyong
2014-01-01
The contents access and sharing in multimedia social networks (MSNs) mainly rely on access control models and mechanisms. Simple adoptions of security policies in the traditional access control model cannot effectively establish a trust relationship among parties. This paper proposed a novel two-party trust architecture (TPTA) to apply in a generic MSN scenario. According to the architecture, security policies are adopted through game-theoretic analyses and decisions. Based on formalized utilities of security policies and security rules, the choice of security policies in content access is described as a game between the content provider and the content requester. By the game method for the combination of security policies utility and its influences on each party's benefits, the Nash equilibrium is achieved, that is, an optimal and stable combination of security policies, to establish and enhance trust among stakeholders. PMID:24977226
A theoretical approach for energy saving in industrial steam boilers
Sabry, T.I.; Mohamed, N.H.; Elghonimy, A.M.
1993-01-01
Optimization of the performance characteristics of such a steam boiler has been analyzed theoretically. Suitable thermodynamic relations have been utilized here to construct a computer model that would carry out the boiler performance characteristics at different operating parameters (e.g.; amount of excess air, fuel type, rate of blowdown preheating of combustion air and flow gases temperature). The results demonstrate that this computer model is to be used successfully in selecting the different operating parameters of the steam boiler at variant loads considering the best economical operation. Besides, this model can be used to investigate the sensitivity of the performance characteristics to the deviation of the boiler operating parameters from their optimum values. It was found also that changing the operating parameters beside the type of fuel in a boiler affects its performance characteristics. 3 figs
Theoretical information measurement in nonrelativistic time-dependent approach
Najafizade, S. A.; Hassanabadi, H.; Zarrinkamar, S.
2018-02-01
The information-theoretic measures of time-dependent Schrödinger equation are investigated via the Shannon information entropy, variance and local Fisher quantities. In our calculations, we consider the two first states n = 0,1 and obtain the position Sx (t) and momentum Sp (t) Shannon entropies as well as Fisher information Ix (t) in position and momentum Ip (t) spaces. Using the Fourier transformed wave function, we obtain the results in momentum space. Some interesting features of the information entropy densities ρs (x,t) and γs (p,t), as well as the probability densities ρ (x,t) and γ (p,t) for time-dependent states are demonstrated. We establish a general relation between variance and Fisher's information. The Bialynicki-Birula-Mycielski inequality is tested and verified for the states n = 0,1.
A game-theoretic approach to donor kidney sharing.
O'Brien, B J
1988-01-01
Graft survival in renal transplantation is a function, amongst other things, of the degree of histocompatibility lymphocyte-A (HLA) tissue matching achieved between donor and recipient. Yet a donor procured at centre A might match a transplant candidate at centre B and vice versa. This raises the question of whether, and under what circumstances, surgeons will offer and exchange donor kidneys and gain from such trade in terms of graft survival. We analyse the problem in a game-theoretic framework where the choice of strategy 'to offer or not?' is evaluated in the context of the uncertainty of reciprocation by the other player(s) in the game. The equilibrium solution to a number of variations of the game is predicted to be non-cooperation resulting in collectively sub-optimal graft survival rates. Some policy options for improving cooperation are considered including exchange incentives and coercive measures.
A theoretical approach on controlling agricultural pest by biological controls.
Mondal, Prasanta Kumar; Jana, Soovoojeet; Kar, T K
2014-03-01
In this paper we propose and analyze a prey-predator type dynamical system for pest control where prey population is treated as the pest. We consider two classes for the pest namely susceptible pest and infected pest and the predator population is the natural enemy of the pest. We also consider average delay for both the predation rate i.e. predation to the susceptible pest and infected pest. Considering a subsystem of original system in the absence of infection, we analyze the existence of all possible non-negative equilibria and their stability criteria for both the subsystem as well as the original system. We present the conditions for transcritical bifurcation and Hopf bifurcation in the disease free system. The theoretical evaluations are demonstrated through numerical simulations.
A Theoretical Approach to Engineering a New Enzyme
Anderson, Greg; Gomatam, Ravi; Behera, Raghu N.
2016-01-01
Density function theory, a subfield of quantum mechanics (QM), in combination with molecular mechanics (MM) has opened the way to engineer new artificial enzymes. Herein, we report theoretical calculations done using QM/MM to examine whether the regioselectivity and rate of chlorination of the enzyme chloroperoxidase can be improved by replacing the vanadium of this enzyme with niobium through dialysis. Our calculations show that a niobium substituted chloroperoxidase will be able to enter the initial steps of the catalytic cycle for chlorination. Although the protonation state of the niobium substituted enzyme is calculated to be different from than that of the natural vanadium substituted enzyme, our calculations show that the catalytic cycle can still proceed forward. Using natural bond orbitals, we analyse the electronic differences between the niobium substituted enzyme and the natural enzyme. We conclude by briefly examining how good of a model QM/MM provides for understanding the mechanism of catalysis of chloroperoxidase. (paper)
Laser debonding of ceramic orthodontic brackets: a theoretical approach
Kearney, Kristine L.; Marangoni, Roy D.; Rickabaugh, Jeff L.
1992-06-01
Ceramic brackets are an esthetic substitute for conventional stainless steel brackets in orthodontic patients. However, ceramic brackets are more brittle and have higher bond strengths which can lead to bracket breakage and enamel damage during debonding. It has been demonstrated that various lasers can facilitate ceramic bracket removal. One mechanism with the laser is through the softening of the bracket adhesive. The high energy density from the laser on the bracket and adhesive can have a resultant deleterious thermal effect on the pulp of the tooth which may lead to pulpal death. A theoretical computer model of bracket, adhesive, enamel and dentin has been generated for predicting heat flow through this system. Heat fluxes at varying intensities and modes have been input into the program and the resultant temperatures at various points or nodes were determined. Further pursuit should lead to optimum parameters for laser debonding which would have minimal effects on the pulp.
Tourism and international business: The theoretical approach and practical experiences
Jovičić Dobrica
2011-01-01
Full Text Available The paper discusses the relationships between tourism and international business. The research is based upon combining various theoretical concepts, significant empirical experiences and own attitudes of the authors. The key conclusion of the paper is that, despite of the partial progress in understanding tourism businesses, the relationships between tourism and international business need additional stimulus. In other words, more complete research in the related domains is needed in future. Any understanding of tourism is inadequate without appreciating the contributions that international business might bring, yet at the same time international business is incomplete in its coverage of international trade unless tourism is considered. The consumption-driven agenda of much tourism research has been favoured over supply-side discourses of the production process it self. That is why the role of major transnational companies, setting the trends that other types of firms in the tourism sector follow is focused in the paper.
Diestel, Reinhard
2017-01-01
This standard textbook of modern graph theory, now in its fifth edition, combines the authority of a classic with the engaging freshness of style that is the hallmark of active mathematics. It covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each field by one or two deeper results, again with proofs given in full detail. The book can be used as a reliable text for an introductory course, as a graduate text, and for self-study. From the reviews: “This outstanding book cannot be substituted with any other book on the present textbook market. It has every chance of becoming the standard textbook for graph theory.”Acta Scientiarum Mathematiciarum “Deep, clear, wonderful. This is a serious book about the heart of graph theory. It has depth and integrity. ”Persi Diaconis & Ron Graham, SIAM Review “The book has received a very enthusiastic reception, which it amply deserves. A masterly elucidation of modern graph theo...
Social self-esteem: theoretical and methodological approaches to research
Usova E.N.
2017-09-01
Full Text Available The perspective of the analysis of the phenomenon of the social well-being of patients with chronic diseases from the standpoint of the sociology of medicine is proved. Modern approaches to the study of social well-being within the framework of sociological and psychological approaches are singled out. The importance of studying the levels of social well-being (institutional and individual is presented to explain the individual's chosen strategies of behavior in the disease situation. The vectors of operationalization of the category of social well-being within the sociology of medicine are indicated.
Photodynamic therapy: Theoretical and experimental approaches to dosimetry
Wang, Ken Kang-Hsin
Singlet oxygen (1O2) is the major cytotoxic species generated during photodynamic therapy (PDT), and 1O 2 reactions with biological targets define the photodynamic dose at the most fundamental level. We have developed a theoretical model for rigorously describing the spatial and temporal dynamics of oxygen (3O 2) consumption and transport and microscopic 1O 2 dose deposition during PDT in vivo. Using experimentally established physiological and photophysical parameters, the mathematical model allows computation of the dynamic variation of hemoglobin-3O 2 saturation within vessels, irreversible photosensitizer degradation due to photobleaching, therapy-induced blood flow decrease and the microscopic distributions of 3O2 and 1O 2 dose deposition under various irradiation conditions. mTHPC, a promising photosensitizer for PDT, is approved in Europe for the palliative treatment of head and neck cancer. Using the theoretical model and informed by intratumor sensitizer concentrations and distributions, we calculated photodynamic dose depositions for mTHPC-PDT. Our results demonstrate that the 1O 2 dose to the tumor volume does not track even qualitatively with long-term tumor responses. Thus, in this evaluation of mTHPC-PDT, any PDT dose metric that is proportional to singlet oxygen creation and/or deposition would fail to predict the tumor response. In situations like this one, other reporters of biological response to therapy would be necessary. In addition to the case study of mTHPC-PDT, we also use the mathematical model to simulate clinical photobleaching data, informed by a possible blood flow reduction during treatment. In a recently completed clinical trial at Roswell Park Cancer Institute, patients with superficial basal cell carcinoma received topical application of 5-aminolevulinic acid (ALA) and were irradiated with 633 nm light at 10-150 mW cm-2 . Protoporphyrin IX (PpIX) photobleaching in the lesion and the adjacent perilesion normal margin was monitored by
THEORETICAL APPROACHES TO THE DEFINITION OF THE "INFORMATION RESOURCE"
I. Netreba
2014-01-01
Existing approaches to determining the nature of the category "information resource" are detailed and systematized. The relationships between the categories "information resource", "information technology", "information management system" are revealed. Determined the importance of information resources for the production process at the enterprise.
Game-theoretic approaches to optimal risk sharing
Boonen, T.J.
2014-01-01
This Ph.D. thesis studies optimal risk capital allocation and optimal risk sharing. The first chapter deals with the problem of optimally allocating risk capital across divisions within a financial institution. To do so, an asymptotic approach is used to generalize the well-studied Aumann-Shapley
Fuzzy set theoretic approach to fault tree analysis | Tyagi ...
This approach can be widely used to improve the reliability and to reduce the operating cost of a system. The proposed techniques are discussed and illustrated by taking an example of a nuclear power plant. Keywords: Fault tree, Triangular and Trapezoidal fuzzy number, Fuzzy importance, Ranking of fuzzy numbers ...
Towards a capability approach to child growth : A theoretical framework
Haisma, Hinke; Yousefzadeh Faal Daghati, Sepideh; Boele Van Hensbroek, Pieter
Child malnutrition is an important cause of under-five mortality and morbidity around the globe. Despite the partial success of (inter)national efforts to reduce child mortality, under-five mortality rates continue to be high. The multidimensional approaches of the Sustainable Development Goals may
Bell inequalities for graph states
Toth, G.; Hyllus, P.; Briegel, H.J.; Guehne, O.
2005-01-01
Full text: In the last years graph states have attracted an increasing interest in the field of quantum information theory. Graph states form a family of multi-qubit states which comprises many popular states such as the GHZ states and the cluster states. They also play an important role in applications. For instance, measurement based quantum computation uses graph states as resources. From a theoretical point of view, it is remarkable that graph states allow for a simple description in terms of stabilizing operators. In this contribution, we investigate the non-local properties of graph states. We derive a family of Bell inequalities which require three measurement settings for each party and are maximally violated by graph states. In turn, any graph state violates at least one of the inequalities. We show that for certain types of graph states the violation of these inequalities increases exponentially with the number of qubits. We also discuss connections to other entanglement properties such as the positively of the partial transpose or the geometric measure of entanglement. (author)
Network reconstruction via graph blending
Estrada, Rolando
2016-05-01
Graphs estimated from empirical data are often noisy and incomplete due to the difficulty of faithfully observing all the components (nodes and edges) of the true graph. This problem is particularly acute for large networks where the number of components may far exceed available surveillance capabilities. Errors in the observed graph can render subsequent analyses invalid, so it is vital to develop robust methods that can minimize these observational errors. Errors in the observed graph may include missing and spurious components, as well fused (multiple nodes are merged into one) and split (a single node is misinterpreted as many) nodes. Traditional graph reconstruction methods are only able to identify missing or spurious components (primarily edges, and to a lesser degree nodes), so we developed a novel graph blending framework that allows us to cast the full estimation problem as a simple edge addition/deletion problem. Armed with this framework, we systematically investigate the viability of various topological graph features, such as the degree distribution or the clustering coefficients, and existing graph reconstruction methods for tackling the full estimation problem. Our experimental results suggest that incorporating any topological feature as a source of information actually hinders reconstruction accuracy. We provide a theoretical analysis of this phenomenon and suggest several avenues for improving this estimation problem.
KnowLife: a versatile approach for constructing a large knowledge graph for biomedical sciences.
Ernst, Patrick; Siu, Amy; Weikum, Gerhard
2015-05-14
Biomedical knowledge bases (KB's) have become important assets in life sciences. Prior work on KB construction has three major limitations. First, most biomedical KBs are manually built and curated, and cannot keep up with the rate at which new findings are published. Second, for automatic information extraction (IE), the text genre of choice has been scientific publications, neglecting sources like health portals and online communities. Third, most prior work on IE has focused on the molecular level or chemogenomics only, like protein-protein interactions or gene-drug relationships, or solely address highly specific topics such as drug effects. We address these three limitations by a versatile and scalable approach to automatic KB construction. Using a small number of seed facts for distant supervision of pattern-based extraction, we harvest a huge number of facts in an automated manner without requiring any explicit training. We extend previous techniques for pattern-based IE with confidence statistics, and we combine this recall-oriented stage with logical reasoning for consistency constraint checking to achieve high precision. To our knowledge, this is the first method that uses consistency checking for biomedical relations. Our approach can be easily extended to incorporate additional relations and constraints. We ran extensive experiments not only for scientific publications, but also for encyclopedic health portals and online communities, creating different KB's based on different configurations. We assess the size and quality of each KB, in terms of number of facts and precision. The best configured KB, KnowLife, contains more than 500,000 facts at a precision of 93% for 13 relations covering genes, organs, diseases, symptoms, treatments, as well as environmental and lifestyle risk factors. KnowLife is a large knowledge base for health and life sciences, automatically constructed from different Web sources. As a unique feature, KnowLife is harvested from
Hydrogen storage in lithium hydride: A theoretical approach
Banger, Suman; Nayak, Vikas; Verma, U. P.
2018-04-01
First principles calculations have been carried out to analyze structural stability of lithium hydride (LiH) in NaCl phase using the full potential linearized augmented plane wave (FP-LAPW) method within the framework of density functional theory (DFT). Calculations have been extended to physiosorbed H-atom compounds LiH·H2, LiH·3H2 and LiH·4H2. The obtained results are discussed in the paper. The results for LiH are in excellent agreement with earlier reported data. The obtained direct energy band gap of LiH is 3.0 eV which is in excellent agreement with earlier reported theoretical band gap. The electronic band structure plots of the hydrogen adsorbed compounds show metallic behavior. The elastic constants, anisotropy factor, shear modulus, Young's modulus, Poisson's ratio and cohesive energies of all the compounds are calculated. Calculation of the optical spectra such as the real and imaginary parts of dielectric function, optical reflectivity, absorption coefficient, optical conductivity, refractive index, extinction coefficient and electron energy loss are performed for the energy range 0-15 eV. The obtained results for LiH·H2, LiH·3H2 and LiH·4H2, are reported for the first time. This study has been made in search of materials for hydrogen storage. It is concluded that LiH is a promising material for hydrogen storage.
Exploring Job Satisfaction of Nursing Faculty: Theoretical Approaches.
Wang, Yingchen; Liesveld, Judy
2015-01-01
The Future of Nursing report identified the shortage of nursing faculty as 1 of the barriers to nursing education. In light of this, it is becoming increasingly important to understand the work-life of nursing faculty. The current research focused on job satisfaction of nursing faculty from 4 theoretical perspectives: human capital theory, which emphasizes the expected monetary and nonmonetary returns for any career choices; structural theory, which emphasizes the impact of institutional features on job satisfaction; positive extrinsic environment by self-determination theory, which asserts that a positive extrinsic environment promotes competency and effective outcomes at work; and psychological theory, which emphasizes the proposed relationship between job performance and satisfaction. In addition to the measures for human capital theory, institutional variables (from structural theory and self-determination theory), and productivity measures (from psychological theory), the authors also selected sets of variables for personal characteristics to investigate their effects on job satisfaction. The results indicated that variables related to human capital theory, especially salary, contributed the most to job satisfaction, followed by those related to institutional variables. Personal variables and productivity variables as a whole contributed as well. The only other variable with marginal significance was faculty's perception of institutional support for teaching. Published by Elsevier Inc.
A Game Theoretic Approach to Cyber Attack Prediction
Peng Liu
2005-11-28
The area investigated by this project is cyber attack prediction. With a focus on correlation-based prediction, current attack prediction methodologies overlook the strategic nature of cyber attack-defense scenarios. As a result, current cyber attack prediction methodologies are very limited in predicting strategic behaviors of attackers in enforcing nontrivial cyber attacks such as DDoS attacks, and may result in low accuracy in correlation-based predictions. This project develops a game theoretic framework for cyber attack prediction, where an automatic game-theory-based attack prediction method is proposed. Being able to quantitatively predict the likelihood of (sequences of) attack actions, our attack prediction methodology can predict fine-grained strategic behaviors of attackers and may greatly improve the accuracy of correlation-based prediction. To our best knowledge, this project develops the first comprehensive framework for incentive-based modeling and inference of attack intent, objectives, and strategies; and this project develops the first method that can predict fine-grained strategic behaviors of attackers. The significance of this research and the benefit to the public can be demonstrated to certain extent by (a) the severe threat of cyber attacks to the critical infrastructures of the nation, including many infrastructures overseen by the Department of Energy, (b) the importance of cyber security to critical infrastructure protection, and (c) the importance of cyber attack prediction to achieving cyber security.
Success Determination by Innovation: A Theoretical Approach in Marketing
Raj Kumar Gautam
2012-01-01
The paper aims at to identify the main issues in the marketing which needs immediate attention of the marketers. The importance of innovation in the marketing has also been highlighted and marketing mix have been related to innovative and creative ideas. The study is based on the secondary data, various research papers, articles has been studied to develop a innovative approach in the marketing. Marketing innovative ideas relating to business lead generation, product, price, distribution, pro...
Mapping between Classical Risk Management and Game Theoretical Approaches
Rajbhandari , Lisa; Snekkenes , Einar ,
2011-01-01
Part 2: Work in Progress; International audience; In a typical classical risk assessment approach, the probabilities are usually guessed and not much guidance is provided on how to get the probabilities right. When coming up with probabilities, people are generally not well calibrated. History may not always be a very good teacher. Hence, in this paper, we explain how game theory can be integrated into classical risk management. Game theory puts emphasis on collecting representative data on h...
Theoretical approach of the seismic behaviour of a LMFBR core
Parent, J.M.
1983-01-01
The vibratory behaviour of two one-degree-freedom mechanical systems, having known coupling and damping features, is investigated by transposition to two electrical circuits inductively coupled. This approach is carried out in two steps: the first one supposes that both circuits are identical, while the second one considers the general case where both circuits are unlike. It is shown that one or two resonant frequencies may occur, depending on the coupling and the damping conditions
A measure theoretic approach to traffic flow optimization on networks
Cacace, Simone; Camilli, Fabio; De Maio, Raul; Tosin, Andrea
2018-01-01
We consider a class of optimal control problems for measure-valued nonlinear transport equations describing traffic flow problems on networks. The objective isto minimise/maximise macroscopic quantities, such as traffic volume or average speed,controlling few agents, for example smart traffic lights and automated cars. The measuretheoretic approach allows to study in a same setting local and nonlocal drivers interactionsand to consider the control variables as additional measures interacting ...
The Economic Security of Bank: Theoretical Basis and Systemic Approach
Gavlovska Nataliia I.
2017-07-01
Full Text Available The article analyzes the existing approaches to interpreting the category of «economic security of bank». A author’s own definition of the concept of «economic security of bank» has been proposed, which should be understood as condition of protecting the vital interests of bank, achieved by harmonizing relationships with the entities of external influence and optimizing the internal system processes, thus enabling efficient function as well as development by means of an adaptation mechanism. A number of approaches to understanding the substance of the above concept has been allocated and their main characteristics have been provided. The need to study the specifics of interaction of banking institutions with the external environment in the context of interaction between the State agents and market actors has been underlined. Features of formation of the term of «system» have been defined, three main groups of approaches to interpretation of the term have been provided. A author’s own definition of the concept of «economic security system of bank» has been proposed. A concrete definition of principles for building an economic security system of bank has been provided.
Hossien Pourghassem
2011-04-01
Full Text Available Relevance feedback approaches is used to improve the performance of content-based image retrieval systems. In this paper, a novel relevance feedback approach based on similarity measure modification in an X-ray image retrieval system based on fuzzy representation using fuzzy attributed relational graph (FARG is presented. In this approach, optimum weight of each feature in feature vector is calculated using similarity rate between query image and relevant and irrelevant images in user feedback. The calculated weight is used to tune fuzzy graph matching algorithm as a modifier parameter in similarity measure. The standard deviation of the retrieved image features is applied to calculate the optimum weight. The proposed image retrieval system uses a FARG for representation of images, a fuzzy matching graph algorithm as similarity measure and a semantic classifier based on merging scheme for determination of the search space in image database. To evaluate relevance feedback approach in the proposed system, a standard X-ray image database consisting of 10000 images in 57 classes is used. The improvement of the evaluation parameters shows proficiency and efficiency of the proposed system.
Theoretical approach of complex DNA lesions: from formation to repair
Bignon, Emmanuelle
2017-01-01
This thesis work is focused on the theoretical modelling of DNA damages, from formation to repair. Several projects have been led in this framework, which can be sorted into three different parts. One on hand, we studied complex DNA reactivity. It included a study about 8-oxo-7,8-dihydro-guanine (8oxoG) mechanisms of formation, a project concerning the UV-induced pyrimidine 6-4 pyrimidone (6-4PP) endogenous photo-sensitizer features, and another one about DNA photo-sensitization by nonsteroidal anti-inflammatory drugs (i.e. ketoprofen and ibuprofen). On the other hand, we investigated mechanical properties of damaged DNA. The structural signature of a DNA lesion is of major importance for their repair, unfortunately only few NMR and X-ray structures of such systems are available. In order to gain insights into their dynamical structure, we investigated a series of complex damages: clustered abasic sites, interstrand cross-links, and the 6-4PP photo-lesion. Likewise, we studied the interaction modes DNA with several polyamines, which are well known to interact with the double helix, but also with the perspective to model DNA-protein cross-linking. The third part concerned the study of DNA interactions with repair enzymes. In line with the structural study about clustered abasic sites, we investigated the dynamics of the same system, but this time interacting with the APE1 endonuclease. We also studied interactions between the Fpg glycosylase with an oligonucleotides containing tandem 8-oxoG on one hand and 8-oxoG - abasic site as multiply damaged sites. Thus, we shed new lights on damaged DNA reactivity, structure and repair, which provides perspectives for biomedicine and life's mechanisms understanding as we begin to describe nucleosomal DNA. (author)
A representation theoretic approach to the WZW Verlinde formula
Fuchs, J
1997-01-01
By exploring the description of chiral blocks in terms of co-invariants, a proof of the Verlinde formula for WZW models is obtained which is entirely based on the representation theory of affine Lie algebras. In contrast to other proofs of the Verlinde formula, this approach works for all untwisted affine Lie algebras. As a by-product we obtain a homological interpretation of the Verlinde multiplicities, as Euler characteristics of complexes built from invariant tensors of finite-dimensional simple Lie algebras.
Theoretical approach to the magnetocaloric effect with hysteresis
Basso, V.; Bertotti, G.; LoBue, M.; Sasso, C.P.
2005-01-01
In this paper a thermodynamic model with internal variables is presented and applied to ferromagnetic hysteresis. The out-of-equilibrium Gibbs free energy of a magnetic system is expressed as a function of the internal state of the Preisach model. Expressions for the system entropy and the entropy production are derived. By this approach it is possible to reproduce the characteristic features of the experimentally observed temperature changes (of the order of 10 -4 K around room temperature) induced by the magnetic field along the hysteresis loop performed in iron under adiabatic condition
Decision-theoretic approaches to non-knowledge in economics
Svetlova, Ekaterina; van Elst, Henk
2014-01-01
We review two strands of conceptual approaches to the formal representation of a decision maker's non-knowledge at the initial stage of a static one-person, one-shot decision problem in economic theory. One focuses on representations of non-knowledge in terms of probability measures over sets of mutually exclusive and exhaustive consequence-relevant states of Nature, the other deals with unawareness of potentially important events by means of sets of states that are less complete than the ful...
Van den Hove, Sybille
2003-01-01
A key justification for the rapid development of participatory approaches for environment and sustainable development governance stems from the characteristics of environmental issues. Environmental issues - and radioactive waste disposal is a good example - typically present four important physical characteristics: complexity, uncertainty, large temporal and spatial scales, and irreversibility, which all have consequences on what can be called the social characteristics of environmental issues. These include: social complexity and conflicts of interests, transversality, diffuse responsibilities and impacts, no clear division between micro- and macro-levels, and short-term costs of dealing with the issue associated with benefits which might occur only in the long-term. In turn, these physical and social characteristics determine the type of problem-solving processes needed to tackle environmental issues. It appears that the problem-solving processes best suited to confront global environmental issues will be dynamic processes of capacity-building, - aiming at innovative, flexible and adjustable answers, - allowing for the progressive integration of information as it becomes available, and of different value judgements and logics, - involving various actors from different backgrounds and levels. In promoting more democratic practices, these processes additionally should supersede traditional politics and allow co-ordination across different policy areas. It is deemed that participatory approaches have the potential to meet these problem-solving requirements
Polynomial-time computability of the edge-reliability of graphs using Gilbert's formula
Thomas J. Marlowe
1998-01-01
Full Text Available Reliability is an important consideration in analyzing computer and other communication networks, but current techniques are extremely limited in the classes of graphs which can be analyzed efficiently. While Gilbert's formula establishes a theoretically elegant recursive relationship between the edge reliability of a graph and the reliability of its subgraphs, naive evaluation requires consideration of all sequences of deletions of individual vertices, and for many graphs has time complexity essentially Θ (N!. We discuss a general approach which significantly reduces complexity, encoding subgraph isomorphism in a finer partition by invariants, and recursing through the set of invariants.
Theoretical triangulation as an approach for revealing the complexity of a classroom discussion
van Drie, J.; Dekker, R.
2013-01-01
In this paper we explore the value of theoretical triangulation as a methodological approach for the analysis of classroom interaction. We analyze an excerpt of a whole-class discussion in history from three theoretical perspectives: interactivity of the discourse, conceptual level raising and
Consumer Perception of Competitiveness – Theoretical-Instrumental Approach
Duralia Oana
2016-04-01
Full Text Available Behaviorist economic approach has recorded a quantum leap in a relatively short period of time, as studying the relationship between consumer behavior and companies’ strategic decisions based on market competitiveness are no longer an unknown area. However, this issue remains actual in view of the fact that during the decision process of purchase, consumers do not always behave rationally, as they are the only ones who can appreciate if the offer of the company, in terms of range, quality, price and auxiliary services meet their needs or not. In this context, this paper aims to deepen the existing interconnection between the market decisions of the enterprise and consumer behavior, as measure standard for the competitiveness of a firm on a certain market.
Group-theoretical approach to relativistic eikonal physics
Leon, J; Quiros, M [Instituto de Enstructura de la Materia, C.S.I.C., Madrid (Spain); Departamento de Matematica, Universidad Complutense, Campus de Alcala (Spain)); Ramirez Mittelbrunn, J [Instituto de Estructura de la Materia, C.S.I.C., Madrid (Spain)
1977-09-01
A contraction of the Poincare group is performed leading to the eikonal approximation. Invariants, one-particle states, spinning particles and some interaction problems are studied with the following results: momenta of ultrarelativistic particles behave as lightlike, the little group being E/sub 2/, spin behaves as that of zero-mass particles, helicity being conserved in the presence of interactions. The full eikonal results are rederived for Green's functions, wave functions, etc. The way for computing corrections due to transverse momenta and spin-dependent interactions is outlined. A parallel analysis is made for the infinite-momentum frame, the similarities and differences between this formalism and the eikonal approach being disclosed.
Prospecting theoretical approaches to understand internationalization of creative economy firms
Sílvio Luís de Vasconcellos
2017-12-01
Full Text Available We argue that the internationalization process of firms in the creative economy has particular aspects that distinguish it from internationalization of firms in traditional economic sectors. We explore ways in which the international business literature might be helpful for understanding how internationalization takes place in firms whose core business is creation of ideas. We conducted a case study using a focus group technique to investigate a creative economy firm specialized in computer graphics. The firm already does business internationally as a producer of electronic mockup models, but is transitioning to the computer-generated video production industry. Our results suggest that behavioral approaches to international business related to entrepreneurship, as well as country origin effects and networks theory could be useful to expanding knowledge about the internationalization process in such firms, in which creativity is a critical resource.
Gusev, E Yu; Chereshnev, V A
2013-01-01
Theoretical and methodological approaches to description of systemic inflammation as general pathological process are discussed. It is shown, that there is a need of integration of wide range of types of researches to develop a model of systemic inflammation.
Matched pairs approach to set theoretic solutions of the Yang-Baxter equation
Gateva-Ivanova, T.; Majid, S.
2005-08-01
We study set-theoretic solutions (X,r) of the Yang-Baxter equations on a set X in terms of the induced left and right actions of X on itself. We give a characterization of involutive square-free solutions in terms of cyclicity conditions. We characterise general solutions in terms of an induced matched pair of unital semigroups S(X,r) and construct (S,r S ) from the matched pair. Finally, we study extensions of solutions in terms of matched pairs of their associated semigroups. We also prove several general results about matched pairs of unital semigroups of the required type, including iterated products S bowtie S bowtie S underlying the proof that r S is a solution, and extensions (S bowtie T, r Sb owtie T ). Examples include a general 'double' construction (S bowtie S,r Sb owtie S ) and some concrete extensions, their actions and graphs based on small sets. (author)
Field-theoretic approach to gravity in the flat space-time
Cavalleri, G [Centro Informazioni Studi Esperienze, Milan (Italy); Milan Univ. (Italy). Ist. di Fisica); Spinelli, G [Istituto di Matematica del Politecnico di Milano, Milano (Italy)
1980-01-01
In this paper it is discussed how the field-theoretical approach to gravity starting from the flat space-time is wider than the Einstein approach. The flat approach is able to predict the structure of the observable space as a consequence of the behaviour of the particle proper masses. The field equations are formally equal to Einstein's equations without the cosmological term.
Chartrand, Gary; Zhang, Ping
2010-01-01
Gary Chartrand has influenced the world of Graph Theory for almost half a century. He has supervised more than a score of Ph.D. dissertations and written several books on the subject. The most widely known of these texts, Graphs and Digraphs, … has much to recommend it, with clear exposition, and numerous challenging examples [that] make it an ideal textbook for the advanced undergraduate or beginning graduate course. The authors have updated their notation to reflect the current practice in this still-growing area of study. By the authors' estimation, the 5th edition is approximately 50% longer than the 4th edition. … the legendary Frank Harary, author of the second graph theory text ever produced, is one of the figures profiled. His book was the standard in the discipline for several decades. Chartrand, Lesniak and Zhang have produced a worthy successor.-John T. Saccoman, MAA Reviews, June 2012 (This book is in the MAA's basic library list.)As with the earlier editions, the current text emphasizes clear...
Theoretical approaches to x-ray absorption fine structure
Rehr, J. J.; Albers, R. C.
2000-01-01
Dramatic advances in the understanding of x-ray absorption fine structure (XAFS) have been made over the past few decades, which have led ultimately to a highly quantitative theory. This review covers these developments from a unified multiple-scattering viewpoint. The authors focus on extended x-ray absorption fine structure (EXAFS) well above an x-ray edge, and, to a lesser extent, on x-ray absorption near-edge structure (XANES) closer to an edge. The discussion includes both formal considerations, derived from a many-electron formulation, and practical computational methods based on independent-electron models, with many-body effects lumped into various inelastic losses and energy shifts. The main conceptual issues in XAFS theory are identified and their relative importance is assessed; these include the convergence of the multiple-scattering expansion, curved-wave effects, the scattering potential, inelastic losses, self-energy shifts, and vibrations and structural disorder. The advantages and limitations of current computational approaches are addressed, with particular regard to quantitative experimental comparisons. (c) 2000 The American Physical Society
Hybrid empirical--theoretical approach to modeling uranium adsorption
Hull, Larry C.; Grossman, Christopher; Fjeld, Robert A.; Coates, John T.; Elzerman, Alan W.
2004-01-01
An estimated 330 metric tons of U are buried in the radioactive waste Subsurface Disposal Area (SDA) at the Idaho National Engineering and Environmental Laboratory (INEEL). An assessment of U transport parameters is being performed to decrease the uncertainty in risk and dose predictions derived from computer simulations of U fate and transport to the underlying Snake River Plain Aquifer. Uranium adsorption isotherms were measured for 14 sediment samples collected from sedimentary interbeds underlying the SDA. The adsorption data were fit with a Freundlich isotherm. The Freundlich n parameter is statistically identical for all 14 sediment samples and the Freundlich K f parameter is correlated to sediment surface area (r 2 =0.80). These findings suggest an efficient approach to material characterization and implementation of a spatially variable reactive transport model that requires only the measurement of sediment surface area. To expand the potential applicability of the measured isotherms, a model is derived from the empirical observations by incorporating concepts from surface complexation theory to account for the effects of solution chemistry. The resulting model is then used to predict the range of adsorption conditions to be expected in the vadose zone at the SDA based on the range in measured pore water chemistry. Adsorption in the deep vadose zone is predicted to be stronger than in near-surface sediments because the total dissolved carbonate decreases with depth
Relativistic kinematics and dynamics: a new group theoretical approach
Giovannini, N.
1983-01-01
The author reanalyzes the relationships between physical states and space-time symmetries with a view to describing relativistic extended and interacting systems. For this description he proposes to introduce, in space-time, an additional observable, related to a natural notion of simultaneity. The introduction of this new observable is justified on the basis of the operational meaning of the relations between state descriptions and symmetries in this case. The Poincare transformations are correspondingly split into two parts: the first one, kinematical, related to the symmetries of the description of the states, the other one, dynamical, related to the possible forms for the evolution. It is shown that the kinematical symmetries lead in a straightforward way to the expected classical and quantal state spaces for single particles of arbitrary spin and the author shows how the remaining symmetries can be related to the derivation of the possible forms for the dynamics. He finds as a particular case the usual dynamics of single particles in external fields (with some satisfactory improvements due to the corresponding new interpretation) and extends the method to the dynamics of N interacting particles. He also shows why this new approach and interpretation of relativistic states is necessary and how it allows a covariant description in the problems raised by the (recently measured) quantum correlations at-a-distance concerning the Einstein-Podolsky-Rosen paradox, something which seems quite impossible in the usual frameworks. (Auth.)
Bond graph modeling of centrifugal compression systems
Uddin, Nur; Gravdahl, Jan Tommy
2015-01-01
A novel approach to model unsteady fluid dynamics in a compressor network by using a bond graph is presented. The model is intended in particular for compressor control system development. First, we develop a bond graph model of a single compression system. Bond graph modeling offers a different perspective to previous work by modeling the compression system based on energy flow instead of fluid dynamics. Analyzing the bond graph model explains the energy flow during compressor surge. Two pri...
An Information-Theoretic Approach to PMU Placement in Electric Power Systems
Li, Qiao; Cui, Tao; Weng, Yang; Negi, Rohit; Franchetti, Franz; Ilic, Marija D.
2012-01-01
This paper presents an information-theoretic approach to address the phasor measurement unit (PMU) placement problem in electric power systems. Different from the conventional 'topological observability' based approaches, this paper advocates a much more refined, information-theoretic criterion, namely the mutual information (MI) between the PMU measurements and the power system states. The proposed MI criterion can not only include the full system observability as a special case, but also ca...
Wang, Jin-Hui; Zuo, Xi-Nian; Gohel, Suril; Milham, Michael P.; Biswal, Bharat B.; He, Yong
2011-01-01
Graph-based computational network analysis has proven a powerful tool to quantitatively characterize functional architectures of the brain. However, the test-retest (TRT) reliability of graph metrics of functional networks has not been systematically examined. Here, we investigated TRT reliability of topological metrics of functional brain networks derived from resting-state functional magnetic resonance imaging data. Specifically, we evaluated both short-term (5 months apart) TRT reliability for 12 global and 6 local nodal network metrics. We found that reliability of global network metrics was overall low, threshold-sensitive and dependent on several factors of scanning time interval (TI, long-term>short-term), network membership (NM, networks excluding negative correlations>networks including negative correlations) and network type (NT, binarized networks>weighted networks). The dependence was modulated by another factor of node definition (ND) strategy. The local nodal reliability exhibited large variability across nodal metrics and a spatially heterogeneous distribution. Nodal degree was the most reliable metric and varied the least across the factors above. Hub regions in association and limbic/paralimbic cortices showed moderate TRT reliability. Importantly, nodal reliability was robust to above-mentioned four factors. Simulation analysis revealed that global network metrics were extremely sensitive (but varying degrees) to noise in functional connectivity and weighted networks generated numerically more reliable results in compared with binarized networks. For nodal network metrics, they showed high resistance to noise in functional connectivity and no NT related differences were found in the resistance. These findings provide important implications on how to choose reliable analytical schemes and network metrics of interest. PMID:21818285
On the centrality of some graphs
Vecdi Aytac
2017-10-01
Full Text Available A central issue in the analysis of complex networks is the assessment of their stability and vulnerability. A variety of measures have been proposed in the literature to quantify the stability of networks and a number of graph-theoretic parameters have been used to derive formulas for calculating network reliability. Different measures for graph vulnerability have been introduced so far to study different aspects of the graph behavior after removal of vertices or links such as connectivity, toughness, scattering number, binding number, residual closeness and integrity. In this paper, we consider betweenness centrality of a graph. Betweenness centrality of a vertex of a graph is portion of the shortest paths all pairs of vertices passing through a given vertex. In this paper, we obtain exact values for betweenness centrality for some wheel related graphs namely gear, helm, sunflower and friendship graphs.
Benchmarking Measures of Network Controllability on Canonical Graph Models
Wu-Yan, Elena; Betzel, Richard F.; Tang, Evelyn; Gu, Shi; Pasqualetti, Fabio; Bassett, Danielle S.
2018-03-01
The control of networked dynamical systems opens the possibility for new discoveries and therapies in systems biology and neuroscience. Recent theoretical advances provide candidate mechanisms by which a system can be driven from one pre-specified state to another, and computational approaches provide tools to test those mechanisms in real-world systems. Despite already having been applied to study network systems in biology and neuroscience, the practical performance of these tools and associated measures on simple networks with pre-specified structure has yet to be assessed. Here, we study the behavior of four control metrics (global, average, modal, and boundary controllability) on eight canonical graphs (including Erdős-Rényi, regular, small-world, random geometric, Barábasi-Albert preferential attachment, and several modular networks) with different edge weighting schemes (Gaussian, power-law, and two nonparametric distributions from brain networks, as examples of real-world systems). We observe that differences in global controllability across graph models are more salient when edge weight distributions are heavy-tailed as opposed to normal. In contrast, differences in average, modal, and boundary controllability across graph models (as well as across nodes in the graph) are more salient when edge weight distributions are less heavy-tailed. Across graph models and edge weighting schemes, average and modal controllability are negatively correlated with one another across nodes; yet, across graph instances, the relation between average and modal controllability can be positive, negative, or nonsignificant. Collectively, these findings demonstrate that controllability statistics (and their relations) differ across graphs with different topologies and that these differences can be muted or accentuated by differences in the edge weight distributions. More generally, our numerical studies motivate future analytical efforts to better understand the mathematical
Hierarchy of modular graph identities
D’Hoker, Eric; Kaidi, Justin
2016-01-01
The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between two-loop graphs at all weights, and between higher-loop graphs of weights four and five were constructed. In the present paper, these results are generalized in two complementary directions. First, all identities at weight six and all dihedral identities at weight seven are obtained and proven. Whenever the Laurent polynomial at the cusp is available, the form of these identities confirms the pattern by which the vanishing of the Laurent polynomial governs the full modular identity. Second, the family of modular graph functions is extended to include all graphs with derivative couplings and worldsheet fermions. These extended families of modular graph functions are shown to obey a hierarchy of inhomogeneous Laplace eigenvalue equations. The eigenvalues are calculated analytically for the simplest infinite sub-families and obtained by Maple for successively more complicated sub-families. The spectrum is shown to consist solely of eigenvalues s(s−1) for positive integers s bounded by the weight, with multiplicities which exhibit rich representation-theoretic patterns.
Hierarchy of modular graph identities
D’Hoker, Eric; Kaidi, Justin [Mani L. Bhaumik Institute for Theoretical Physics, Department of Physics and Astronomy,University of California,Los Angeles, CA 90095 (United States)
2016-11-09
The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between two-loop graphs at all weights, and between higher-loop graphs of weights four and five were constructed. In the present paper, these results are generalized in two complementary directions. First, all identities at weight six and all dihedral identities at weight seven are obtained and proven. Whenever the Laurent polynomial at the cusp is available, the form of these identities confirms the pattern by which the vanishing of the Laurent polynomial governs the full modular identity. Second, the family of modular graph functions is extended to include all graphs with derivative couplings and worldsheet fermions. These extended families of modular graph functions are shown to obey a hierarchy of inhomogeneous Laplace eigenvalue equations. The eigenvalues are calculated analytically for the simplest infinite sub-families and obtained by Maple for successively more complicated sub-families. The spectrum is shown to consist solely of eigenvalues s(s−1) for positive integers s bounded by the weight, with multiplicities which exhibit rich representation-theoretic patterns.
Blanke, Mogens
2005-01-01
This paper addresses the design process of diagnosis and fault-tolerant control when a system should operate despite multiple failures in sensors or actuators. Graph-theory based analysis of system's structure is demonstrated to be a unique design methodology that can cope with the diagnosis desi...
Bipartite separability and nonlocal quantum operations on graphs
Dutta, Supriyo; Adhikari, Bibhas; Banerjee, Subhashish; Srikanth, R.
2016-07-01
In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for separability, although there are entangled states with positive partial transpose for which the degree criterion fails. Here we introduce the concept of partially symmetric graphs and degree symmetric graphs by using the well-known concept of partial transposition of a graph and degree criteria, respectively. Thus, we provide classes of bipartite separable states of dimension m ×n arising from partially symmetric graphs. We identify partially asymmetric graphs that lack the property of partial symmetry. We develop a combinatorial procedure to create a partially asymmetric graph from a given partially symmetric graph. We show that this combinatorial operation can act as an entanglement generator for mixed states arising from partially symmetric graphs.
Lacasa, Lucas
2014-01-01
Dynamical processes can be transformed into graphs through a family of mappings called visibility algorithms, enabling the possibility of (i) making empirical time series analysis and signal processing and (ii) characterizing classes of dynamical systems and stochastic processes using the tools of graph theory. Recent works show that the degree distribution of these graphs encapsulates much information on the signals' variability, and therefore constitutes a fundamental feature for statistical learning purposes. However, exact solutions for the degree distributions are only known in a few cases, such as for uncorrelated random processes. Here we analytically explore these distributions in a list of situations. We present a diagrammatic formalism which computes for all degrees their corresponding probability as a series expansion in a coupling constant which is the number of hidden variables. We offer a constructive solution for general Markovian stochastic processes and deterministic maps. As case tests we focus on Ornstein–Uhlenbeck processes, fully chaotic and quasiperiodic maps. Whereas only for certain degree probabilities can all diagrams be summed exactly, in the general case we show that the perturbation theory converges. In a second part, we make use of a variational technique to predict the complete degree distribution for special classes of Markovian dynamics with fast-decaying correlations. In every case we compare the theory with numerical experiments. (paper)
Kou, Qiang; Wu, Si; Tolic, Nikola; Paša-Tolic, Ljiljana; Liu, Yunlong; Liu, Xiaowen
2017-05-01
Although proteomics has rapidly developed in the past decade, researchers are still in the early stage of exploring the world of complex proteoforms, which are protein products with various primary structure alterations resulting from gene mutations, alternative splicing, post-translational modifications, and other biological processes. Proteoform identification is essential to mapping proteoforms to their biological functions as well as discovering novel proteoforms and new protein functions. Top-down mass spectrometry is the method of choice for identifying complex proteoforms because it provides a 'bird's eye view' of intact proteoforms. The combinatorial explosion of various alterations on a protein may result in billions of possible proteoforms, making proteoform identification a challenging computational problem. We propose a new data structure, called the mass graph, for efficient representation of proteoforms and design mass graph alignment algorithms. We developed TopMG, a mass graph-based software tool for proteoform identification by top-down mass spectrometry. Experiments on top-down mass spectrometry datasets showed that TopMG outperformed existing methods in identifying complex proteoforms. http://proteomics.informatics.iupui.edu/software/topmg/. xwliu@iupui.edu. Supplementary data are available at Bioinformatics online. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com
Olayan, Rawan S.
2017-11-23
Motivation Finding computationally drug-target interactions (DTIs) is a convenient strategy to identify new DTIs at low cost with reasonable accuracy. However, the current DTI prediction methods suffer the high false positive prediction rate. Results We developed DDR, a novel method that improves the DTI prediction accuracy. DDR is based on the use of a heterogeneous graph that contains known DTIs with multiple similarities between drugs and multiple similarities between target proteins. DDR applies non-linear similarity fusion method to combine different similarities. Before fusion, DDR performs a pre-processing step where a subset of similarities is selected in a heuristic process to obtain an optimized combination of similarities. Then, DDR applies a random forest model using different graph-based features extracted from the DTI heterogeneous graph. Using five repeats of 10-fold cross-validation, three testing setups, and the weighted average of area under the precision-recall curve (AUPR) scores, we show that DDR significantly reduces the AUPR score error relative to the next best start-of-the-art method for predicting DTIs by 34% when the drugs are new, by 23% when targets are new, and by 34% when the drugs and the targets are known but not all DTIs between them are not known. Using independent sources of evidence, we verify as correct 22 out of the top 25 DDR novel predictions. This suggests that DDR can be used as an efficient method to identify correct DTIs.
Quick Mining of Isomorphic Exact Large Patterns from Large Graphs
Almasri, Islam
2014-12-01
The applications of the sub graph isomorphism search are growing with the growing number of areas that model their systems using graphs or networks. Specifically, many biological systems, such as protein interaction networks, molecular structures and protein contact maps, are modeled as graphs. The sub graph isomorphism search is concerned with finding all sub graphs that are isomorphic to a relevant query graph, the existence of such sub graphs can reflect on the characteristics of the modeled system. The most computationally expensive step in the search for isomorphic sub graphs is the backtracking algorithm that traverses the nodes of the target graph. In this paper, we propose a pruning approach that is inspired by the minimum remaining value heuristic that achieves greater scalability over large query and target graphs. Our testing on various biological networks shows that performance enhancement of our approach over existing state-of-the-art approaches varies between 6x and 53x. © 2014 IEEE.
Quick Mining of Isomorphic Exact Large Patterns from Large Graphs
Almasri, Islam; Gao, Xin; Fedoroff, Nina V.
2014-01-01
The applications of the sub graph isomorphism search are growing with the growing number of areas that model their systems using graphs or networks. Specifically, many biological systems, such as protein interaction networks, molecular structures and protein contact maps, are modeled as graphs. The sub graph isomorphism search is concerned with finding all sub graphs that are isomorphic to a relevant query graph, the existence of such sub graphs can reflect on the characteristics of the modeled system. The most computationally expensive step in the search for isomorphic sub graphs is the backtracking algorithm that traverses the nodes of the target graph. In this paper, we propose a pruning approach that is inspired by the minimum remaining value heuristic that achieves greater scalability over large query and target graphs. Our testing on various biological networks shows that performance enhancement of our approach over existing state-of-the-art approaches varies between 6x and 53x. © 2014 IEEE.
Chartrand, Gary; Rosen, Kenneth H
2008-01-01
Beginning with the origin of the four color problem in 1852, the field of graph colorings has developed into one of the most popular areas of graph theory. Introducing graph theory with a coloring theme, Chromatic Graph Theory explores connections between major topics in graph theory and graph colorings as well as emerging topics. This self-contained book first presents various fundamentals of graph theory that lie outside of graph colorings, including basic terminology and results, trees and connectivity, Eulerian and Hamiltonian graphs, matchings and factorizations, and graph embeddings. The remainder of the text deals exclusively with graph colorings. It covers vertex colorings and bounds for the chromatic number, vertex colorings of graphs embedded on surfaces, and a variety of restricted vertex colorings. The authors also describe edge colorings, monochromatic and rainbow edge colorings, complete vertex colorings, several distinguishing vertex and edge colorings, and many distance-related vertex coloring...
Commuting graphs of matrix algebras
Akbari, S.; Bidkhori, H.; Mohammadian, A.
2006-08-01
The commuting graph of a ring R, denoted by Γ(R), is a graph whose vertices are all non- central elements of R and two distinct vertices x and y are adjacent if and only if xy = yx. The commuting graph of a group G, denoted by Γ(G), is similarly defined. In this paper we investigate some graph theoretic properties of Γ(M n (F)), where F is a field and n ≥ 2. Also we study the commuting graphs of some classical groups such as GL n (F) and SL n (F). We show that Γ(M n (F)) is a connected graph if and only if every field extension of F of degree n contains a proper intermediate field. We prove that apart from finitely many fields, a similar result is true for Γ(GL n (F)) and Γ(SL n (F)). Also we show that for two fields E and F and integers m, n ≥> 2, if Γ(M m (E)) ≅ Γ(M n (F)), then m = n and vertical bar E vertical bar = vertical bar F vertical bar. (author)
Graph theory and its applications
Gross, Jonathan L
2006-01-01
Gross and Yellen take a comprehensive approach to graph theory that integrates careful exposition of classical developments with emerging methods, models, and practical needs. Their unparalleled treatment provides a text ideal for a two-semester course and a variety of one-semester classes, from an introductory one-semester course to courses slanted toward classical graph theory, operations research, data structures and algorithms, or algebra and topology.
Sequential Optimization of Paths in Directed Graphs Relative to Different Cost Functions
Mahayni, Malek A.
2011-07-01
Finding optimal paths in directed graphs is a wide area of research that has received much of attention in theoretical computer science due to its importance in many applications (e.g., computer networks and road maps). Many algorithms have been developed to solve the optimal paths problem with different kinds of graphs. An algorithm that solves the problem of paths’ optimization in directed graphs relative to different cost functions is described in [1]. It follows an approach extended from the dynamic programming approach as it solves the problem sequentially and works on directed graphs with positive weights and no loop edges. The aim of this thesis is to implement and evaluate that algorithm to find the optimal paths in directed graphs relative to two different cost functions ( , ). A possible interpretation of a directed graph is a network of roads so the weights for the function represent the length of roads, whereas the weights for the function represent a constraint of the width or weight of a vehicle. The optimization aim for those two functions is to minimize the cost relative to the function and maximize the constraint value associated with the function. This thesis also includes finding and proving the relation between the two different cost functions ( , ). When given a value of one function, we can find the best possible value for the other function. This relation is proven theoretically and also implemented and experimented using Matlab®[2].
Graph Theory and Ion and Molecular Aggregation in Aqueous Solutions
Choi, Jun-Ho; Lee, Hochan; Choi, Hyung Ran; Cho, Minhaeng
2018-04-01
In molecular and cellular biology, dissolved ions and molecules have decisive effects on chemical and biological reactions, conformational stabilities, and functions of small to large biomolecules. Despite major efforts, the current state of understanding of the effects of specific ions, osmolytes, and bioprotecting sugars on the structure and dynamics of water H-bonding networks and proteins is not yet satisfactory. Recently, to gain deeper insight into this subject, we studied various aggregation processes of ions and molecules in high-concentration salt, osmolyte, and sugar solutions with time-resolved vibrational spectroscopy and molecular dynamics simulation methods. It turns out that ions (or solute molecules) have a strong propensity to self-assemble into large and polydisperse aggregates that affect both local and long-range water H-bonding structures. In particular, we have shown that graph-theoretical approaches can be used to elucidate morphological characteristics of large aggregates in various aqueous salt, osmolyte, and sugar solutions. When ion and molecular aggregates in such aqueous solutions are treated as graphs, a variety of graph-theoretical properties, such as graph spectrum, degree distribution, clustering coefficient, minimum path length, and graph entropy, can be directly calculated by considering an ensemble of configurations taken from molecular dynamics trajectories. Here we show percolating behavior exhibited by ion and molecular aggregates upon increase in solute concentration in high solute concentrations and discuss compelling evidence of the isomorphic relation between percolation transitions of ion and molecular aggregates and water H-bonding networks. We anticipate that the combination of graph theory and molecular dynamics simulation methods will be of exceptional use in achieving a deeper understanding of the fundamental physical chemistry of dissolution and in describing the interplay between the self-aggregation of solute
Graph Theory and Ion and Molecular Aggregation in Aqueous Solutions.
Choi, Jun-Ho; Lee, Hochan; Choi, Hyung Ran; Cho, Minhaeng
2018-04-20
In molecular and cellular biology, dissolved ions and molecules have decisive effects on chemical and biological reactions, conformational stabilities, and functions of small to large biomolecules. Despite major efforts, the current state of understanding of the effects of specific ions, osmolytes, and bioprotecting sugars on the structure and dynamics of water H-bonding networks and proteins is not yet satisfactory. Recently, to gain deeper insight into this subject, we studied various aggregation processes of ions and molecules in high-concentration salt, osmolyte, and sugar solutions with time-resolved vibrational spectroscopy and molecular dynamics simulation methods. It turns out that ions (or solute molecules) have a strong propensity to self-assemble into large and polydisperse aggregates that affect both local and long-range water H-bonding structures. In particular, we have shown that graph-theoretical approaches can be used to elucidate morphological characteristics of large aggregates in various aqueous salt, osmolyte, and sugar solutions. When ion and molecular aggregates in such aqueous solutions are treated as graphs, a variety of graph-theoretical properties, such as graph spectrum, degree distribution, clustering coefficient, minimum path length, and graph entropy, can be directly calculated by considering an ensemble of configurations taken from molecular dynamics trajectories. Here we show percolating behavior exhibited by ion and molecular aggregates upon increase in solute concentration in high solute concentrations and discuss compelling evidence of the isomorphic relation between percolation transitions of ion and molecular aggregates and water H-bonding networks. We anticipate that the combination of graph theory and molecular dynamics simulation methods will be of exceptional use in achieving a deeper understanding of the fundamental physical chemistry of dissolution and in describing the interplay between the self-aggregation of solute
Graph Theory to Pure Mathematics: Some Illustrative Examples
Graph Theory to Pure Mathematics: Some. Illustrative Examples v Yegnanarayanan is a. Professor of Mathematics at MNM Jain Engineering. College, Chennai. His research interests include graph theory and its applications to both pure maths and theoretical computer science. Keywords. Graph theory, matching theory,.
A new theoretical approach to analyze complex processes in cytoskeleton proteins.
Li, Xin; Kolomeisky, Anatoly B
2014-03-20
Cytoskeleton proteins are filament structures that support a large number of important biological processes. These dynamic biopolymers exist in nonequilibrium conditions stimulated by hydrolysis chemical reactions in their monomers. Current theoretical methods provide a comprehensive picture of biochemical and biophysical processes in cytoskeleton proteins. However, the description is only qualitative under biologically relevant conditions because utilized theoretical mean-field models neglect correlations. We develop a new theoretical method to describe dynamic processes in cytoskeleton proteins that takes into account spatial correlations in the chemical composition of these biopolymers. Our approach is based on analysis of probabilities of different clusters of subunits. It allows us to obtain exact analytical expressions for a variety of dynamic properties of cytoskeleton filaments. By comparing theoretical predictions with Monte Carlo computer simulations, it is shown that our method provides a fully quantitative description of complex dynamic phenomena in cytoskeleton proteins under all conditions.
Software for Graph Analysis and Visualization
M. I. Kolomeychenko
2014-01-01
Full Text Available This paper describes the software for graph storage, analysis and visualization. The article presents a comparative analysis of existing software for analysis and visualization of graphs, describes the overall architecture of application and basic principles of construction and operation of the main modules. Furthermore, a description of the developed graph storage oriented to storage and processing of large-scale graphs is presented. The developed algorithm for finding communities and implemented algorithms of autolayouts of graphs are the main functionality of the product. The main advantage of the developed software is high speed processing of large size networks (up to millions of nodes and links. Moreover, the proposed graph storage architecture is unique and has no analogues. The developed approaches and algorithms are optimized for operating with big graphs and have high productivity.
On a conjecture concerning helly circle graphs
Durán Guillermo
2003-01-01
Full Text Available We say that G is an e-circle graph if there is a bijection between its vertices and straight lines on the cartesian plane such that two vertices are adjacent in G if and only if the corresponding lines intersect inside the circle of radius one. This definition suggests a method for deciding whether a given graph G is an e-circle graph, by constructing a convenient system S of equations and inequations which represents the structure of G, in such a way that G is an e-circle graph if and only if S has a solution. In fact, e-circle graphs are exactly the circle graphs (intersection graphs of chords in a circle, and thus this method provides an analytic way for recognizing circle graphs. A graph G is a Helly circle graph if G is a circle graph and there exists a model of G by chords such that every three pairwise intersecting chords intersect at the same point. A conjecture by Durán (2000 states that G is a Helly circle graph if and only if G is a circle graph and contains no induced diamonds (a diamond is a graph formed by four vertices and five edges. Many unsuccessful efforts - mainly based on combinatorial and geometrical approaches - have been done in order to validate this conjecture. In this work, we utilize the ideas behind the definition of e-circle graphs and restate this conjecture in terms of an equivalence between two systems of equations and inequations, providing a new, analytic tool to deal with it.
EVOLUTION OF THEORETICAL APPROACHES TO THE DEFINITION OF THE CATEGORY “PERSONNEL POTENTIAL”
Аlexandra Deshchenko
2016-02-01
Full Text Available The article describes the evolution of theoretical approaches to definition of the category «personnel potential» based on the analysis of approaches to definition of the conceptual apparatus of labor Economics, including such categories as: labor force, labor resources, labor potential, human resources, human capital, human capital different authors. The analysis of the evolution of the terms in accordance with the stages of development of a society.
The decays Psub(c) -> VP in the group theoretical and quark diagrammatic approaches
Tuan, S.F.; Xiaoyuan Li.
1983-08-01
Decays of charmed meson into one vector meson and one pseudoscalar meson Psub(c) -> VP in both the group theoretical and quark diagrammatic approaches are considered. A complete decay amplitude analysis is given. The present available experimental data can be accomodated if the contributions from exotic final states and exotic piece of weak Hamiltonian are also taken into account. (orig.)
THE REPURCHASE OF SHARES - ANOTHER FORM OF REWARDING INVESTORS - A THEORETICAL APPROACH
PRISACARIU Maria
2013-06-01
Full Text Available Among the shareholder remuneration policies, in recent years, share repurchases are gaining more and more ground. Like any other phenomenon or financial practice, repurchases lacked no theories to explain their motivation, effects and controversies. This paper proposes a theoretical approach to the subject by summarizing relevant research in order to highlight the motivations behind this decision and its implications.
Купрєєва, Ю. О.
2015-01-01
In this article the author discusses the main theoretical and methodological approaches to the study of protest activity. Among them - the theory of collective behavior, the relative deprivation theory, the new social movements theory and the resource mobilization theory. Highlighted their strengths and weaknesses. Focused on the new direction of protest studies connected with the development of the Internet.
Arosio, Marcello; Martina, Mario L. V.
2017-04-01
The emergent behaviour of the contemporary complex, socio-technical and interconnected society makes the collective risk greater than the sum of the parts and this requires a holistic, systematic and integrated approach. Although there have been major improvements in recent years, there are still some limitation in term of a holistic approach that is able to include the emergent value hidden in the connections between exposed elements and the interactions between the different spheres of the multi-hazards, vulnerability, exposure and resilience. To deal with these challenges it is necessary to consider the connections between the exposed elements (e.g. populations, schools, hospital, etc.) and to quantify the relative importance of the elements and their interconnections (e.g. the need of injured people to go to hospital or children to school). In a system (e.g. road, hospital and ecological network, etc.), or in a System of System (e.g. socio-technical urban service), there are critical elements that, beyond the intrinsic vulnerability, can be characterized by greater or lower vulnerability because of their physical, geographical, cyber or logical connections. To this aim, we propose in this study a comparative analysis between traditional reductionist approach and a new holistic approach to vulnerability assessment to natural hazards. The analysis considers a study case of a socio-economic complex system through an innovative approach based on the properties of graph G=(N,L). A graph consists of two sets N (nodes) and L (links): the nodes represent the single exposed elements (physical, social, environmental, etc.) to a hazard, while the links (or connections) represent the interaction between the elements. The final goal is to illustrate an application of this innovative approach of integrated collective vulnerability assessment.
Graph visualization (Invited talk)
Wijk, van J.J.; Kreveld, van M.J.; Speckmann, B.
2012-01-01
Black and white node link diagrams are the classic method to depict graphs, but these often fall short to give insight in large graphs or when attributes of nodes and edges play an important role. Graph visualization aims obtaining insight in such graphs using interactive graphical representations.
The person-oriented approach: A short theoretical and practical guide
Lars R. Bergman
2014-05-01
Full Text Available A short overview of the person-oriented approach is given as a guide to the researcher interested in carrying out person-oriented research. Theoretical, methodological, and practical considerations of the approach are discussed. First, some historical roots are traced, followed by a description of the holisticinteractionistic research paradigm, which provided the general framework for the development of the modern person-oriented approach. The approach has both a theoretical and a methodological facet and after presenting its key theoretical tenets, an overview is given of some common person-oriented methods. Central to the person-oriented approach is a system view with its components together forming a pattern regarded as indivisible. This pattern should be understood and studied as a whole, not broken up into pieces (variables that are studied as separate entities. Hence, usually methodological tools are used by which whole patterns are analysed (e.g. cluster analysis. An empirical example is given where the pattern development of school grades is studied.
Theoretical Approaches in Evolutionary Ecology: Environmental Feedback as a Unifying Perspective.
Lion, Sébastien
2018-01-01
Evolutionary biology and ecology have a strong theoretical underpinning, and this has fostered a variety of modeling approaches. A major challenge of this theoretical work has been to unravel the tangled feedback loop between ecology and evolution. This has prompted the development of two main classes of models. While quantitative genetics models jointly consider the ecological and evolutionary dynamics of a focal population, a separation of timescales between ecology and evolution is assumed by evolutionary game theory, adaptive dynamics, and inclusive fitness theory. As a result, theoretical evolutionary ecology tends to be divided among different schools of thought, with different toolboxes and motivations. My aim in this synthesis is to highlight the connections between these different approaches and clarify the current state of theory in evolutionary ecology. Central to this approach is to make explicit the dependence on environmental dynamics of the population and evolutionary dynamics, thereby materializing the eco-evolutionary feedback loop. This perspective sheds light on the interplay between environmental feedback and the timescales of ecological and evolutionary processes. I conclude by discussing some potential extensions and challenges to our current theoretical understanding of eco-evolutionary dynamics.
The Theoretical and Empirical Approaches to the Definition of Audit Risk
Berezhniy Yevgeniy B.
2017-12-01
Full Text Available The risk category is one of the key factors in planning the audit and assessing its results. The article is aimed at generalizing the theoretical and empirical approaches to the definition of audit risk and methods of its reduction. The structure of audit risk was analyzed and it has been determined, that each of researchers approached to structuring of audit risk from the subjective point of view. The author’s own model of audit risk has been proposed. The basic methods of assessment of audit risk are generalized, the theoretical and empirical approaches to its definition are allocated, also it is noted, that application of any of the given models can be suitable rather for approximate estimation, than for exact calculation of an audit risk, as it is accompanied by certain shortcomings.
Michael T. Lee
2016-09-01
Full Text Available Empirical evidence demonstrates that motivated employees mean better organizational performance. The objective of this conceptual paper is to articulate the progress that has been made in understanding employee motivation and organizational performance, and to suggest how the theory concerning employee motivation and organizational performance may be advanced. We acknowledge the existing limitations of theory development and suggest an alternative research approach. Current motivation theory development is based on conventional quantitative analysis (e.g., multiple regression analysis, structural equation modeling. Since researchers are interested in context and understanding of this social phenomena holistically, they think in terms of combinations and configurations of a set of pertinent variables. We suggest that researchers take a set-theoretic approach to complement existing conventional quantitative analysis. To advance current thinking, we propose a set-theoretic approach to leverage employee motivation for organizational performance.
Topological charge on the lattice: a field theoretical view of the geometrical approach
Rastelli, L.; Rossi, P.; Vicari, E.
1997-01-01
We construct sequences of ''field theoretical'' lattice topological charge density operators which formally approach geometrical definitions in 2D CP N-1 models and 4D SU(N) Yang-Mills theories. The analysis of these sequences of operators suggests a new way of looking at the geometrical method, showing that geometrical charges can be interpreted as limits of sequences of field theoretical (analytical) operators. In perturbation theory, renormalization effects formally tend to vanish along such sequences. But, since the perturbative expansion is asymptotic, this does not necessarily lead to well-behaved geometrical limits. It indeed leaves open the possibility that non-perturbative renormalizations survive. (orig.)
Chemical Graph Transformation with Stereo-Information
Andersen, Jakob Lykke; Flamm, Christoph; Merkle, Daniel
2017-01-01
Double Pushout graph transformation naturally facilitates the modelling of chemical reactions: labelled undirected graphs model molecules and direct derivations model chemical reactions. However, the most straightforward modelling approach ignores the relative placement of atoms and their neighbo......Double Pushout graph transformation naturally facilitates the modelling of chemical reactions: labelled undirected graphs model molecules and direct derivations model chemical reactions. However, the most straightforward modelling approach ignores the relative placement of atoms...... and their neighbours in space. Stereoisomers of chemical compounds thus cannot be distinguished, even though their chemical activity may differ substantially. In this contribution we propose an extended chemical graph transformation system with attributes that encode information about local geometry. The modelling...... of graph transformation, but we here propose a framework that also allows for partially specified stereoinformation. While there are several stereochemical configurations to be considered, we focus here on the tetrahedral molecular shape, and suggest general principles for how to treat all other chemically...
Ahmed, Saeema; Storga, M
2009-01-01
to developing the ontology engineering design integrated taxonomies (EDIT) with a theoretical approach in which concepts and relations are elicited from engineering design theories ontology (DO) The limitations and advantages of each approach are discussed. The research methodology adopted is to map......This paper presents a comparison of two previous and separate efforts to develop an ontology in the engineering design domain, together with an ontology proposal from which ontologies for a specific application may be derived. The research contrasts an empirical, user-centered approach...
Pragmatic Graph Rewriting Modifications
Rodgers, Peter; Vidal, Natalia
1999-01-01
We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host graph, where nodes specified as 'Once Only' in the LHS of a rewrite match at most once with a corresponding node in the host graph. This reduces the previously common use of tags to indicate the progress of matching in the graph. The second modification controls the application of LHS graphs, where those specified a...
Polynomial-time computability of the edge-reliability of graphs using Gilbert's formula
Marlowe Thomas J.
1998-01-01
Full Text Available Reliability is an important consideration in analyzing computer and other communication networks, but current techniques are extremely limited in the classes of graphs which can be analyzed efficiently. While Gilbert's formula establishes a theoretically elegant recursive relationship between the edge reliability of a graph and the reliability of its subgraphs, naive evaluation requires consideration of all sequences of deletions of individual vertices, and for many graphs has time complexity essentially Θ (N!. We discuss a general approach which significantly reduces complexity, encoding subgraph isomorphism in a finer partition by invariants, and recursing through the set of invariants. We illustrate this approach using threshhold graphs, and show that any computation of reliability using Gilbert's formula will be polynomial-time if and only if the number of invariants considered is polynomial; we then show families of graphs with polynomial-time, and non-polynomial reliability computation, and show that these encompass most previously known results. We then codify our approach to indicate how it can be used for other classes of graphs, and suggest several classes to which the technique can be applied.
Eigenfunction statistics on quantum graphs
Gnutzmann, S.; Keating, J.P.; Piotet, F.
2010-01-01
We investigate the spatial statistics of the energy eigenfunctions on large quantum graphs. It has previously been conjectured that these should be described by a Gaussian Random Wave Model, by analogy with quantum chaotic systems, for which such a model was proposed by Berry in 1977. The autocorrelation functions we calculate for an individual quantum graph exhibit a universal component, which completely determines a Gaussian Random Wave Model, and a system-dependent deviation. This deviation depends on the graph only through its underlying classical dynamics. Classical criteria for quantum universality to be met asymptotically in the large graph limit (i.e. for the non-universal deviation to vanish) are then extracted. We use an exact field theoretic expression in terms of a variant of a supersymmetric σ model. A saddle-point analysis of this expression leads to the estimates. In particular, intensity correlations are used to discuss the possible equidistribution of the energy eigenfunctions in the large graph limit. When equidistribution is asymptotically realized, our theory predicts a rate of convergence that is a significant refinement of previous estimates. The universal and system-dependent components of intensity correlation functions are recovered by means of an exact trace formula which we analyse in the diagonal approximation, drawing in this way a parallel between the field theory and semiclassics. Our results provide the first instance where an asymptotic Gaussian Random Wave Model has been established microscopically for eigenfunctions in a system with no disorder.
Andreas P. Braun
2016-04-01
Full Text Available Box graphs succinctly and comprehensively characterize singular fibers of elliptic fibrations in codimension two and three, as well as flop transitions connecting these, in terms of representation theoretic data. We develop a framework that provides a systematic map between a box graph and a crepant algebraic resolution of the singular elliptic fibration, thus allowing an explicit construction of the fibers from a singular Weierstrass or Tate model. The key tool is what we call a fiber face diagram, which shows the relevant information of a (partial toric triangulation and allows the inclusion of more general algebraic blowups. We shown that each such diagram defines a sequence of weighted algebraic blowups, thus providing a realization of the fiber defined by the box graph in terms of an explicit resolution. We show this correspondence explicitly for the case of SU(5 by providing a map between box graphs and fiber faces, and thereby a sequence of algebraic resolutions of the Tate model, which realizes each of the box graphs.
Chromatic polynomials of random graphs
Van Bussel, Frank; Fliegner, Denny; Timme, Marc; Ehrlich, Christoph; Stolzenberg, Sebastian
2010-01-01
Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very small, very sparse or highly structured. Recent algorithmic advances (Timme et al 2009 New J. Phys. 11 023001) now make it possible to compute chromatic polynomials for moderately sized graphs of arbitrary structure and number of edges. Here we present chromatic polynomials of ensembles of random graphs with up to 30 vertices, over the entire range of edge density. We specifically focus on the locations of the zeros of the polynomial in the complex plane. The results indicate that the chromatic zeros of random graphs have a very consistent layout. In particular, the crossing point, the point at which the chromatic zeros with non-zero imaginary part approach the real axis, scales linearly with the average degree over most of the density range. While the scaling laws obtained are purely empirical, if they continue to hold in general there are significant implications: the crossing points of chromatic zeros in the thermodynamic limit separate systems with zero ground state entropy from systems with positive ground state entropy, the latter an exception to the third law of thermodynamics.
Attack Graph Construction for Security Events Analysis
Andrey Alexeevich Chechulin
2014-09-01
Full Text Available The paper is devoted to investigation of the attack graphs construction and analysis task for a network security evaluation and real-time security event processing. Main object of this research is the attack modeling process. The paper contains the description of attack graphs building, modifying and analysis technique as well as overview of implemented prototype for network security analysis based on attack graph approach.
Maunz, Peter Lukas Wilhelm [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Sterk, Jonathan David [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Lobser, Daniel [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Parekh, Ojas D. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Ryan-Anderson, Ciaran [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
2016-01-01
In recent years, advanced network analytics have become increasingly important to na- tional security with applications ranging from cyber security to detection and disruption of ter- rorist networks. While classical computing solutions have received considerable investment, the development of quantum algorithms to address problems, such as data mining of attributed relational graphs, is a largely unexplored space. Recent theoretical work has shown that quan- tum algorithms for graph analysis can be more efficient than their classical counterparts. Here, we have implemented a trapped-ion-based two-qubit quantum information proces- sor to address these goals. Building on Sandia's microfabricated silicon surface ion traps, we have designed, realized and characterized a quantum information processor using the hyperfine qubits encoded in two 171 Yb + ions. We have implemented single qubit gates using resonant microwave radiation and have employed Gate set tomography (GST) to characterize the quan- tum process. For the first time, we were able to prove that the quantum process surpasses the fault tolerance thresholds of some quantum codes by demonstrating a diamond norm distance of less than 1 . 9 x 10 [?] 4 . We used Raman transitions in order to manipulate the trapped ions' motion and realize two-qubit gates. We characterized the implemented motion sensitive and insensitive single qubit processes and achieved a maximal process infidelity of 6 . 5 x 10 [?] 5 . We implemented the two-qubit gate proposed by Molmer and Sorensen and achieved a fidelity of more than 97 . 7%.
Bapat, Ravindra B
2014-01-01
This new edition illustrates the power of linear algebra in the study of graphs. The emphasis on matrix techniques is greater than in other texts on algebraic graph theory. Important matrices associated with graphs (for example, incidence, adjacency and Laplacian matrices) are treated in detail. Presenting a useful overview of selected topics in algebraic graph theory, early chapters of the text focus on regular graphs, algebraic connectivity, the distance matrix of a tree, and its generalized version for arbitrary graphs, known as the resistance matrix. Coverage of later topics include Laplacian eigenvalues of threshold graphs, the positive definite completion problem and matrix games based on a graph. Such an extensive coverage of the subject area provides a welcome prompt for further exploration. The inclusion of exercises enables practical learning throughout the book. In the new edition, a new chapter is added on the line graph of a tree, while some results in Chapter 6 on Perron-Frobenius theory are reo...
Graph Transformation for Consolidation of Creativity Sessions Results
Dolog, Peter
2010-01-01
Graph transformation approach for consolidation of creativity sessions results is part of the FP7 EU/IST project idSpace: Tooling of and training for collaborative, distributed product innovation. The goal of graph transformation approach is to provide a tool for merging results of various sessions...... (such as brainstorming sessions), which are represented as graphs, when the session participants- are physically distributed....
A Group Theoretic Approach to Metaheuristic Local Search for Partitioning Problems
2005-05-01
Tabu Search. Mathematical and Computer Modeling 39: 599-616. 107 Daskin , M.S., E. Stern. 1981. A Hierarchical Objective Set Covering Model for EMS... A Group Theoretic Approach to Metaheuristic Local Search for Partitioning Problems by Gary W. Kinney Jr., B.G.S., M.S. Dissertation Presented to the...DISTRIBUTION STATEMENT A Approved for Public Release Distribution Unlimited The University of Texas at Austin May, 2005 20050504 002 REPORT
Field theoretical approach to proton-nucleus reactions: II-Multiple-step excitation process
Eiras, A.; Kodama, T.; Nemes, M.
1989-01-01
A field theoretical formulation to multiple step excitation process in proton-nucleus collision within the context of a relativistic eikonal approach is presented. A closed form expression for the double differential cross section can be obtained whose structure is very simple and makes the physics transparent. Glauber's formulation of the same process is obtained as a limit of ours and the necessary approximations are studied and discussed. (author) [pt
Theoretical approach to the destruction or sterilization of drugs in aqueous solution
Slegers, Catherine; Tilquin, Bernard
2005-01-01
Two novel applications in the radiation processing of aqueous solutions of drugs are the sterilization of injectable drugs and the decontamination of hospital wastewaters by ionizing radiation. The parameters influencing the destruction of the drug in aqueous solutions are studied with a computer simulation program. This theoretical approach has revealed that the dose rate is the most important parameter that can be easily varied in order to optimize the destruction or the protection of the drug
A THEORETICAL APPROACH TO THE TRANSITION FROM A RESOURCE BASED TO A KNOWLEDGE-ECONOMY
Diana GIOACASI
2015-09-01
Full Text Available Economic development and the emergence of new technologies have changed the optics on the factors that are generating added value. The transition from a resource-dependent economy to one focused on tangible non-financial factors has progressed in a gradual manner and took place under the influence of globalization and of the internet boom. The aim of this article is to provide a theoretical approach to this phenomenon from the perspective of the temporal evolution of enterprise resources.
Anel A. Kireyeva
2016-01-01
Abstract The aim of this research is to develop new theoretical approaches of the formation of IT clusters in order to strengthen of trend of the innovative industrialization and competitiveness of the country. Keeping with the previous literature, this study determines by the novelty of the problem, concerning the formation of IT clusters, which can become a driving force of transformation due to the interaction, improving efficiency and introducing advanced technology. In this research,...
A Balanced Theoretical and Empirical Approach for the Development of a Design Support Tool
Jensen, Thomas Aakjær; Hansen, Claus Thorp
1996-01-01
The introduction of a new design support system may change the engineering designer's work situation. Therefore, it may not be possible to derive all the functionalities for a design support system from solely empirical studies of manual design work. Alternatively the design support system could ...... system, indicating a proposal for how to balance a theoretical and empirical approach. The result of this research will be utilized in the development of a Designer's Workbench to support the synthesis activity in mechanical design....
Adaptive Graph Convolutional Neural Networks
Li, Ruoyu; Wang, Sheng; Zhu, Feiyun; Huang, Junzhou
2018-01-01
Graph Convolutional Neural Networks (Graph CNNs) are generalizations of classical CNNs to handle graph data such as molecular data, point could and social networks. Current filters in graph CNNs are built for fixed and shared graph structure. However, for most real data, the graph structures varies in both size and connectivity. The paper proposes a generalized and flexible graph CNN taking data of arbitrary graph structure as input. In that way a task-driven adaptive graph is learned for eac...
Incremental Frequent Subgraph Mining on Large Evolving Graphs
Abdelhamid, Ehab; Canim, Mustafa; Sadoghi, Mohammad; Bhatta, Bishwaranjan; Chang, Yuan-Chi; Kalnis, Panos
2017-01-01
, such as social networks, utilize large evolving graphs. Mining these graphs using existing techniques is infeasible, due to the high computational cost. In this paper, we propose IncGM+, a fast incremental approach for continuous frequent subgraph mining problem
Decision support models for solid waste management: Review and game-theoretic approaches
Karmperis, Athanasios C.; Aravossis, Konstantinos; Tatsiopoulos, Ilias P.; Sotirchos, Anastasios
2013-01-01
Highlights: ► The mainly used decision support frameworks for solid waste management are reviewed. ► The LCA, CBA and MCDM models are presented and their strengths, weaknesses, similarities and possible combinations are analyzed. ► The game-theoretic approach in a solid waste management context is presented. ► The waste management bargaining game is introduced as a specific decision support framework. ► Cooperative and non-cooperative game-theoretic approaches to decision support for solid waste management are discussed. - Abstract: This paper surveys decision support models that are commonly used in the solid waste management area. Most models are mainly developed within three decision support frameworks, which are the life-cycle assessment, the cost–benefit analysis and the multi-criteria decision-making. These frameworks are reviewed and their strengths and weaknesses as well as their critical issues are analyzed, while their possible combinations and extensions are also discussed. Furthermore, the paper presents how cooperative and non-cooperative game-theoretic approaches can be used for the purpose of modeling and analyzing decision-making in situations with multiple stakeholders. Specifically, since a waste management model is sustainable when considering not only environmental and economic but also social aspects, the waste management bargaining game is introduced as a specific decision support framework in which future models can be developed
Decision support models for solid waste management: Review and game-theoretic approaches
Karmperis, Athanasios C., E-mail: athkarmp@mail.ntua.gr [Sector of Industrial Management and Operational Research, School of Mechanical Engineering, National Technical University of Athens, Iroon Polytechniou 9, 15780 Athens (Greece); Army Corps of Engineers, Hellenic Army General Staff, Ministry of Defence (Greece); Aravossis, Konstantinos; Tatsiopoulos, Ilias P.; Sotirchos, Anastasios [Sector of Industrial Management and Operational Research, School of Mechanical Engineering, National Technical University of Athens, Iroon Polytechniou 9, 15780 Athens (Greece)
2013-05-15
Highlights: ► The mainly used decision support frameworks for solid waste management are reviewed. ► The LCA, CBA and MCDM models are presented and their strengths, weaknesses, similarities and possible combinations are analyzed. ► The game-theoretic approach in a solid waste management context is presented. ► The waste management bargaining game is introduced as a specific decision support framework. ► Cooperative and non-cooperative game-theoretic approaches to decision support for solid waste management are discussed. - Abstract: This paper surveys decision support models that are commonly used in the solid waste management area. Most models are mainly developed within three decision support frameworks, which are the life-cycle assessment, the cost–benefit analysis and the multi-criteria decision-making. These frameworks are reviewed and their strengths and weaknesses as well as their critical issues are analyzed, while their possible combinations and extensions are also discussed. Furthermore, the paper presents how cooperative and non-cooperative game-theoretic approaches can be used for the purpose of modeling and analyzing decision-making in situations with multiple stakeholders. Specifically, since a waste management model is sustainable when considering not only environmental and economic but also social aspects, the waste management bargaining game is introduced as a specific decision support framework in which future models can be developed.
Karapeychik Igor M.
2013-03-01
Full Text Available Within the frameworks of the author’s concept of the potential of an enterprise as the ability to conduct its immanently appropriate activity and also the idea of presentation of the size of the potential in the form of potential function from parameters of the state of an enterprise and foreign economic environment the article develops a scientific and methodical approach to construction and analysis of the potential function of an enterprise. The offered approach envisages building an economic and mathematical model of an enterprise of the optimisation type with consideration of environmental factors, determination of the size of economic potential as a maximum possible (optimal with the set condition of an enterprise and external environment of net income, statistical test of the model with possible values of external parameters (formation of statistical sampling of the graph of the potential function of an enterprise and application of statistical methods including methods of correlation, factor and regression analysis, for the study of its properties. Operability of this approach is shown on the example of the study of properties of the potential function of a model enterprise. In the course of approbation the article demonstrates its ability to reveal specific features of impact of external factors on economic potential of an enterprise; establishes, as a common regularity, differential influence of various environmental factors, caused not only by the nature of these factors, but also production and economic specific features and specific state of an enterprise. The article shows that the quantitative values of the force of influence of the said factors upon the value of economic potential, obtained during statistical analysis of the potential function of an enterprise, could serve as an instrument of ranking these factors by the priority level in the goal setting tasks at the stage of formation of the strategy of enterprise development
A game-theoretic approach to real-time system testing
David, Alexandre; Larsen, Kim Guldstrand; Li, Shuhao
2008-01-01
This paper presents a game-theoretic approach to the testing of uncontrollable real-time systems. By modelling the systems with Timed I/O Game Automata and specifying the test purposes as Timed CTL formulas, we employ a recently developed timed game solver UPPAAL-TIGA to synthesize winning...... strategies, and then use these strategies to conduct black-box conformance testing of the systems. The testing process is proved to be sound and complete with respect to the given test purposes. Case study and preliminary experimental results indicate that this is a viable approach to uncontrollable timed...... system testing....
C. Dalfo
2015-10-01
Full Text Available We study a family of graphs related to the $n$-cube. The middle cube graph of parameter k is the subgraph of $Q_{2k-1}$ induced by the set of vertices whose binary representation has either $k-1$ or $k$ number of ones. The middle cube graphs can be obtained from the well-known odd graphs by doubling their vertex set. Here we study some of the properties of the middle cube graphs in the light of the theory of distance-regular graphs. In particular, we completely determine their spectra (eigenvalues and their multiplicities, and associated eigenvectors.
Topological properties of the limited penetrable horizontal visibility graph family
Wang, Minggang; Vilela, André L. M.; Du, Ruijin; Zhao, Longfeng; Dong, Gaogao; Tian, Lixin; Stanley, H. Eugene
2018-05-01
The limited penetrable horizontal visibility graph algorithm was recently introduced to map time series in complex networks. In this work, we extend this algorithm to create a directed-limited penetrable horizontal visibility graph and an image-limited penetrable horizontal visibility graph. We define two algorithms and provide theoretical results on the topological properties of these graphs associated with different types of real-value series. We perform several numerical simulations to check the accuracy of our theoretical results. Finally, we present an application of the directed-limited penetrable horizontal visibility graph to measure real-value time series irreversibility and an application of the image-limited penetrable horizontal visibility graph that discriminates noise from chaos. We also propose a method to measure the systematic risk using the image-limited penetrable horizontal visibility graph, and the empirical results show the effectiveness of our proposed algorithms.
PRIVATE GRAPHS – ACCESS RIGHTS ON GRAPHS FOR SEAMLESS NAVIGATION
W. Dorner
2016-06-01
Full Text Available After the success of GNSS (Global Navigational Satellite Systems and navigation services for public streets, indoor seems to be the next big development in navigational services, relying on RTLS – Real Time Locating Services (e.g. WIFI and allowing seamless navigation. In contrast to navigation and routing services on public streets, seamless navigation will cause an additional challenge: how to make routing data accessible to defined users or restrict access rights for defined areas or only to parts of the graph to a defined user group? The paper will present case studies and data from literature, where seamless and especially indoor navigation solutions are presented (hospitals, industrial complexes, building sites, but the problem of restricted access rights was only touched from a real world, but not a technical perspective. The analysis of case studies will show, that the objective of navigation and the different target groups for navigation solutions will demand well defined access rights and require solutions, how to make only parts of a graph to a user or application available to solve a navigational task. The paper will therefore introduce the concept of private graphs, which is defined as a graph for navigational purposes covering the street, road or floor network of an area behind a public street and suggest different approaches how to make graph data for navigational purposes available considering access rights and data protection, privacy and security issues as well.
Conceptual graph grammar--a simple formalism for sublanguage.
Johnson, S B
1998-11-01
There are a wide variety of computer applications that deal with various aspects of medical language: concept representation, controlled vocabulary, natural language processing, and information retrieval. While technical and theoretical methods appear to differ, all approaches investigate different aspects of the same phenomenon: medical sublanguage. This paper surveys the properties of medical sublanguage from a formal perspective, based on detailed analyses cited in the literature. A review of several computer systems based on sublanguage approaches shows some of the difficulties in addressing the interaction between the syntactic and semantic aspects of sublanguage. A formalism called Conceptual Graph Grammar is presented that attempts to combine both syntax and semantics into a single notation by extending standard Conceptual Graph notation. Examples from the domain of pathology diagnoses are provided to illustrate the use of this formalism in medical language analysis. The strengths and weaknesses of the approach are then considered. Conceptual Graph Grammar is an attempt to synthesize the common properties of different approaches to sublanguage into a single formalism, and to begin to define a common foundation for language-related research in medical informatics.
Luciana Netto
2018-02-01
Full Text Available Abstract Objective: Theoretical reflection that uses Reflexivity as a theoretical reference and its objective is to approach Donald Schön's reflective thinking, interrelating it with the innovative curriculum. Method: The writings of Schön and other authors who addressed the themes in their works were used. Results: The innovative curriculum as an expression of dissatisfaction with the fragmentation paradigm may favor reflective practice, since it is necessary to mobilize reflexivity for actions and contexts that are unpredictable in the field of health promotion. Conclusions: The innovative curriculum favors and is favored by a reflective practice and the development of competencies for the promotion of health. Implications for practice: The findings apply to the practice of nurses to deal with the conditioning and determinants of the health-disease process.
Ofenheimer, Aldo; Buchmayr, Bruno; Kolleck, Ralf; Merklein, Marion
2005-01-01
The influence of strain paths (loading history) on material formability is well known in sheet forming processes. Sophisticated experimental methods are used to determine the entire shape of strain paths of forming limits for aluminum AA6016-T4 alloy. Forming limits for sheet metal in as-received condition as well as for different pre-deformation are presented. A theoretical approach based on Arrieux's intrinsic Forming Limit Stress Curve (FLSC) concept is employed to numerically predict the influence of loading history on forming severity. The detailed experimental strain paths are used in the theoretical study instead of any linear or bilinear simplified loading histories to demonstrate the predictive quality of forming limits in the state of stress
Zapata, Carlos M; Zuluaga Monica M; Dyner, Isaac
2005-01-01
Alternative Energy Generation Sources are turning relevant in several countries worldwide because of technology improvement and the environmental treatment. In this paper, the most common problems of renewable energy sources are accomplished, different incentives and regulatory mandates from several countries are exposed, and a first theoretical approach to a renewable energies incentive system in Colombia is discussed. The paper is fundamentally in theoretical aspects and international experience in renewable energies incentives to accelerate their diffusion; features are analyzed towards a special incentive system for renewable energies in Colombia. As a conclusion, in Colombia will be apply indirect incentives like low interest rate, taxes exemptions and so on. But these incentives are applied to limit the support of electricity productivity in generating organizations.
A short course in quantum information theory an approach from theoretical physics
Diosi, Lajos
2011-01-01
This short and concise primer takes the vantage point of theoretical physics and the unity of physics. It sets out to strip the burgeoning field of quantum information science to its basics by linking it to universal concepts in physics. An extensive lecture rather than a comprehensive textbook, this volume is based on courses delivered over several years to advanced undergraduate and beginning graduate students, but essentially it addresses anyone with a working knowledge of basic quantum physics. Readers will find these lectures a most adequate entry point for theoretical studies in this field. For the second edition, the authors has succeeded in adding many new topics while sticking to the conciseness of the overall approach. A new chapter on qubit thermodynamics has been added, while new sections and subsections have been incorporated in various chapter to deal with weak and time-continuous measurements, period-finding quantum algorithms and quantum error corrections. From the reviews of the first edition...
Graph theoretic aspects of music theory
Althuis, T.A.; Göbel, F.
2001-01-01
The cycle on twelve points is a well-known representation of the twelve pitch classes of the traditional scale. We treat a more general situation where the number of pitch classes can be different from twelve and where, moreover, other measures of closeness are taken into account. We determine all
Graph Model Based Indoor Tracking
Jensen, Christian Søndergaard; Lu, Hua; Yang, Bin
2009-01-01
The tracking of the locations of moving objects in large indoor spaces is important, as it enables a range of applications related to, e.g., security and indoor navigation and guidance. This paper presents a graph model based approach to indoor tracking that offers a uniform data management...
Soetevent, A.R.
2010-01-01
This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. I propose an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. One feature of graph models of price competition is that spatial
Graphing Inequalities, Connecting Meaning
Switzer, J. Matt
2014-01-01
Students often have difficulty with graphing inequalities (see Filloy, Rojano, and Rubio 2002; Drijvers 2002), and J. Matt Switzer's students were no exception. Although students can produce graphs for simple inequalities, they often struggle when the format of the inequality is unfamiliar. Even when producing a correct graph of an…
van Dam, Edwin R.; Koolen, Jack H.; Tanaka, Hajime
2016-01-01
This is a survey of distance-regular graphs. We present an introduction to distance-regular graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of distance-regular graphs since the monograph 'BCN'[Brouwer, A.E., Cohen, A.M., Neumaier,
Fuzzy Graph Language Recognizability
Kalampakas , Antonios; Spartalis , Stefanos; Iliadis , Lazaros
2012-01-01
Part 5: Fuzzy Logic; International audience; Fuzzy graph language recognizability is introduced along the lines of the established theory of syntactic graph language recognizability by virtue of the algebraic structure of magmoids. The main closure properties of the corresponding class are investigated and several interesting examples of fuzzy graph languages are examined.
Brouwer, A.E.; Haemers, W.H.
2012-01-01
This book gives an elementary treatment of the basic material about graph spectra, both for ordinary, and Laplace and Seidel spectra. The text progresses systematically, by covering standard topics before presenting some new material on trees, strongly regular graphs, two-graphs, association
Shafii, Mohammad Ali; Meidianti, Rahma; Wildian,; Fitriyani, Dian; Tongkukut, Seni H. J.; Arkundato, Artoto
2014-01-01
Theoretical analysis of integral neutron transport equation using collision probability (CP) method with quadratic flux approach has been carried out. In general, the solution of the neutron transport using the CP method is performed with the flat flux approach. In this research, the CP method is implemented in the cylindrical nuclear fuel cell with the spatial of mesh being conducted into non flat flux approach. It means that the neutron flux at any point in the nuclear fuel cell are considered different each other followed the distribution pattern of quadratic flux. The result is presented here in the form of quadratic flux that is better understanding of the real condition in the cell calculation and as a starting point to be applied in computational calculation
Shafii, Mohammad Ali, E-mail: mashafii@fmipa.unand.ac.id; Meidianti, Rahma, E-mail: mashafii@fmipa.unand.ac.id; Wildian,, E-mail: mashafii@fmipa.unand.ac.id; Fitriyani, Dian, E-mail: mashafii@fmipa.unand.ac.id [Department of Physics, Andalas University Padang West Sumatera Indonesia (Indonesia); Tongkukut, Seni H. J. [Department of Physics, Sam Ratulangi University Manado North Sulawesi Indonesia (Indonesia); Arkundato, Artoto [Department of Physics, Jember University Jember East Java Indonesia (Indonesia)
2014-09-30
Theoretical analysis of integral neutron transport equation using collision probability (CP) method with quadratic flux approach has been carried out. In general, the solution of the neutron transport using the CP method is performed with the flat flux approach. In this research, the CP method is implemented in the cylindrical nuclear fuel cell with the spatial of mesh being conducted into non flat flux approach. It means that the neutron flux at any point in the nuclear fuel cell are considered different each other followed the distribution pattern of quadratic flux. The result is presented here in the form of quadratic flux that is better understanding of the real condition in the cell calculation and as a starting point to be applied in computational calculation.
Tripathy, Shreepada; Miller, Karen H; Berkenbosch, John W; McKinley, Tara F; Boland, Kimberly A; Brown, Seth A; Calhoun, Aaron W
2016-06-01
Controversy exists in the simulation community as to the emotional and educational ramifications of mannequin death due to learner action or inaction. No theoretical framework to guide future investigations of learner actions currently exists. The purpose of our study was to generate a model of the learner experience of mannequin death using a mixed methods approach. The study consisted of an initial focus group phase composed of 11 learners who had previously experienced mannequin death due to action or inaction on the part of learners as defined by Leighton (Clin Simul Nurs. 2009;5(2):e59-e62). Transcripts were analyzed using grounded theory to generate a list of relevant themes that were further organized into a theoretical framework. With the use of this framework, a survey was generated and distributed to additional learners who had experienced mannequin death due to action or inaction. Results were analyzed using a mixed methods approach. Forty-one clinicians completed the survey. A correlation was found between the emotional experience of mannequin death and degree of presession anxiety (P framework. Using the previous approach, we created a model of the effect of mannequin death on the educational and psychological state of learners. We offer the final model as a guide to future research regarding the learner experience of mannequin death.
Hektner, Joel M; Brennan, Alison L; Brotherson, Sean E
2013-09-01
The Nurtured Heart Approach to parenting (NHA; Glasser & Easley, 2008) is summarized and evaluated in terms of its alignment with current theoretical perspectives and empirical evidence in family studies and developmental science. Originally conceived and promoted as a behavior management approach for parents of difficult children (i.e., with behavior disorders), NHA is increasingly offered as a valuable strategy for parents of any children, despite a lack of published empirical support. Parents using NHA are trained to minimize attention to undesired behaviors, provide positive attention and praise for compliance with rules, help children be successful by scaffolding and shaping desired behavior, and establish a set of clear rules and consequences. Many elements of the approach have strong support in the theoretical and empirical literature; however, some of the assumptions are more questionable, such as that negative child behavior can always be attributed to unintentional positive reinforcement by parents responding with negative attention. On balance, NHA appears to promote effective and validated parenting practices, but its effectiveness now needs to be tested empirically. © FPI, Inc.
Yemets Vadym V.
2016-05-01
Full Text Available The article proposes a classification for periods of evolution of theoretical approaches to disclosing the economic substance of accumulation of capital, taking into account the civilizational approach to the development of society. The author has proposed five stages in the evolution of theoretical approaches, which are closely related to the development of economy and stipulate dominance of a certain form of accumulation of capital. So, the first stage (time period B.C. – the 5th Century is referred to as Individual-social significance of accumulation of capital; the second stage (from the 6th century to the 16th century – Accumulation of monetary capitals; the third stage (from the mid-17th century until the end of the 18th century – Industrialproduction accumulation of capital; the fourth stage (from the mid-19th century until the 70s of the 20th century – Investment-oriented accumulation of capital; the fifth stage (from the 70s of the 20th century up to the current period – Globally-intensive accumulation of capital.
Bora, B.; Bhuyan, H.; Favre, M.; Wyndham, E.; Chuaqui, H.
2012-01-01
Plasma series resonance (PSR) effect is well known in geometrically asymmetric capacitively couple radio frequency plasma. However, plasma series resonance effect in geometrically symmetric plasma has not been properly investigated. In this work, a theoretical approach is made to investigate the plasma series resonance effect and its influence on Ohmic and stochastic heating in geometrically symmetric discharge. Electrical asymmetry effect by means of dual frequency voltage waveform is applied to excite the plasma series resonance. The results show considerable variation in heating with phase difference between the voltage waveforms, which may be applicable in controlling the plasma parameters in such plasma.
Group theoretic approach for solving the problem of diffusion of a drug through a thin membrane
Abd-El-Malek, Mina B.; Kassem, Magda M.; Meky, Mohammed L. M.
2002-03-01
The transformation group theoretic approach is applied to study the diffusion process of a drug through a skin-like membrane which tends to partially absorb the drug. Two cases are considered for the diffusion coefficient. The application of one parameter group reduces the number of independent variables by one, and consequently the partial differential equation governing the diffusion process with the boundary and initial conditions is transformed into an ordinary differential equation with the corresponding conditions. The obtained differential equation is solved numerically using the shooting method, and the results are illustrated graphically and in tables.
Hell, Pavol
2004-01-01
This is a book about graph homomorphisms. Graph theory is now an established discipline but the study of graph homomorphisms has only recently begun to gain wide acceptance and interest. The subject gives a useful perspective in areas such as graph reconstruction, products, fractional and circular colourings, and has applications in complexity theory, artificial intelligence, telecommunication, and, most recently, statistical physics.Based on the authors' lecture notes for graduate courses, this book can be used as a textbook for a second course in graph theory at 4th year or master's level an
Visibility Graph Based Time Series Analysis.
Stephen, Mutua; Gu, Changgui; Yang, Huijie
2015-01-01
Network based time series analysis has made considerable achievements in the recent years. By mapping mono/multivariate time series into networks, one can investigate both it's microscopic and macroscopic behaviors. However, most proposed approaches lead to the construction of static networks consequently providing limited information on evolutionary behaviors. In the present paper we propose a method called visibility graph based time series analysis, in which series segments are mapped to visibility graphs as being descriptions of the corresponding states and the successively occurring states are linked. This procedure converts a time series to a temporal network and at the same time a network of networks. Findings from empirical records for stock markets in USA (S&P500 and Nasdaq) and artificial series generated by means of fractional Gaussian motions show that the method can provide us rich information benefiting short-term and long-term predictions. Theoretically, we propose a method to investigate time series from the viewpoint of network of networks.
Visibility Graph Based Time Series Analysis.
Mutua Stephen
Full Text Available Network based time series analysis has made considerable achievements in the recent years. By mapping mono/multivariate time series into networks, one can investigate both it's microscopic and macroscopic behaviors. However, most proposed approaches lead to the construction of static networks consequently providing limited information on evolutionary behaviors. In the present paper we propose a method called visibility graph based time series analysis, in which series segments are mapped to visibility graphs as being descriptions of the corresponding states and the successively occurring states are linked. This procedure converts a time series to a temporal network and at the same time a network of networks. Findings from empirical records for stock markets in USA (S&P500 and Nasdaq and artificial series generated by means of fractional Gaussian motions show that the method can provide us rich information benefiting short-term and long-term predictions. Theoretically, we propose a method to investigate time series from the viewpoint of network of networks.
Joint Graph Layouts for Visualizing Collections of Segmented Meshes
Ren, Jing; Schneider, Jens; Ovsjanikov, Maks; Wonka, Peter
2017-01-01
We present a novel and efficient approach for computing joint graph layouts and then use it to visualize collections of segmented meshes. Our joint graph layout algorithm takes as input the adjacency matrices for a set of graphs along with partial, possibly soft, correspondences between nodes of different graphs. We then use a two stage procedure, where in the first step, we extend spectral graph drawing to include a consistency term so that a collection of graphs can be handled jointly. Our second step extends metric multi-dimensional scaling with stress majorization to the joint layout setting, while using the output of the spectral approach as initialization. Further, we discuss a user interface for exploring a collection of graphs. Finally, we show multiple example visualizations of graphs stemming from collections of segmented meshes and we present qualitative and quantitative comparisons with previous work.
Joint Graph Layouts for Visualizing Collections of Segmented Meshes
Ren, Jing
2017-09-12
We present a novel and efficient approach for computing joint graph layouts and then use it to visualize collections of segmented meshes. Our joint graph layout algorithm takes as input the adjacency matrices for a set of graphs along with partial, possibly soft, correspondences between nodes of different graphs. We then use a two stage procedure, where in the first step, we extend spectral graph drawing to include a consistency term so that a collection of graphs can be handled jointly. Our second step extends metric multi-dimensional scaling with stress majorization to the joint layout setting, while using the output of the spectral approach as initialization. Further, we discuss a user interface for exploring a collection of graphs. Finally, we show multiple example visualizations of graphs stemming from collections of segmented meshes and we present qualitative and quantitative comparisons with previous work.
A theoretical approach to medication adherence for children and youth with psychiatric disorders.
Charach, Alice; Volpe, Tiziana; Boydell, Katherine M; Gearing, Robin E
2008-01-01
This article provides a theoretical review of treatment adherence for children and youth with psychiatric disorders where pharmacological agents are first-line interventions. Four empirically based models of health behavior are reviewed and applied to the sparse literature about medication adherence for children with attention-deficit/hyperactivity disorder and young people with first-episode psychosis. Three qualitative studies of medication use are summarized, and details from the first-person narratives are used to illustrate the theoretical models. These studies indicate, when taken together, that the clinical approach to addressing poor medication adherence in children and youth with psychiatric disorders should be guided by more than one theoretical model. Mental health experts should clarify beliefs, address misconceptions, and support exploration of alternative treatment options unless contraindicated. Recognizing the larger context of the family, allowing time for parents and children to change their attitudes, and offering opportunities for easy access to medication in the future are important ways of respecting patient preferences, while steering them toward best-evidence interventions. Future research using qualitative methods of inquiry to investigate parent, child, and youth experiences of mental health interventions should identify effective ways to improve treatment adherence.
Introduction to quantum graphs
Berkolaiko, Gregory
2012-01-01
A "quantum graph" is a graph considered as a one-dimensional complex and equipped with a differential operator ("Hamiltonian"). Quantum graphs arise naturally as simplified models in mathematics, physics, chemistry, and engineering when one considers propagation of waves of various nature through a quasi-one-dimensional (e.g., "meso-" or "nano-scale") system that looks like a thin neighborhood of a graph. Works that currently would be classified as discussing quantum graphs have been appearing since at least the 1930s, and since then, quantum graphs techniques have been applied successfully in various areas of mathematical physics, mathematics in general and its applications. One can mention, for instance, dynamical systems theory, control theory, quantum chaos, Anderson localization, microelectronics, photonic crystals, physical chemistry, nano-sciences, superconductivity theory, etc. Quantum graphs present many non-trivial mathematical challenges, which makes them dear to a mathematician's heart. Work on qu...
Kundu, Kousik; Costa, Fabrizio; Backofen, Rolf
2013-07-01
State-of-the-art experimental data for determining binding specificities of peptide recognition modules (PRMs) is obtained by high-throughput approaches like peptide arrays. Most prediction tools applicable to this kind of data are based on an initial multiple alignment of the peptide ligands. Building an initial alignment can be error-prone, especially in the case of the proline-rich peptides bound by the SH3 domains. Here, we present a machine-learning approach based on an efficient graph-kernel technique to predict the specificity of a large set of 70 human SH3 domains, which are an important class of PRMs. The graph-kernel strategy allows us to (i) integrate several types of physico-chemical information for each amino acid, (ii) consider high-order correlations between these features and (iii) eliminate the need for an initial peptide alignment. We build specialized models for each human SH3 domain and achieve competitive predictive performance of 0.73 area under precision-recall curve, compared with 0.27 area under precision-recall curve for state-of-the-art methods based on position weight matrices. We show that better models can be obtained when we use information on the noninteracting peptides (negative examples), which is currently not used by the state-of-the art approaches based on position weight matrices. To this end, we analyze two strategies to identify subsets of high confidence negative data. The techniques introduced here are more general and hence can also be used for any other protein domains, which interact with short peptides (i.e. other PRMs). The program with the predictive models can be found at http://www.bioinf.uni-freiburg.de/Software/SH3PepInt/SH3PepInt.tar.gz. We also provide a genome-wide prediction for all 70 human SH3 domains, which can be found under http://www.bioinf.uni-freiburg.de/Software/SH3PepInt/Genome-Wide-Predictions.tar.gz. Supplementary data are available at Bioinformatics online.
Kundu, Kousik; Costa, Fabrizio; Backofen, Rolf
2013-01-01
Motivation: State-of-the-art experimental data for determining binding specificities of peptide recognition modules (PRMs) is obtained by high-throughput approaches like peptide arrays. Most prediction tools applicable to this kind of data are based on an initial multiple alignment of the peptide ligands. Building an initial alignment can be error-prone, especially in the case of the proline-rich peptides bound by the SH3 domains. Results: Here, we present a machine-learning approach based on an efficient graph-kernel technique to predict the specificity of a large set of 70 human SH3 domains, which are an important class of PRMs. The graph-kernel strategy allows us to (i) integrate several types of physico-chemical information for each amino acid, (ii) consider high-order correlations between these features and (iii) eliminate the need for an initial peptide alignment. We build specialized models for each human SH3 domain and achieve competitive predictive performance of 0.73 area under precision-recall curve, compared with 0.27 area under precision-recall curve for state-of-the-art methods based on position weight matrices. We show that better models can be obtained when we use information on the noninteracting peptides (negative examples), which is currently not used by the state-of-the art approaches based on position weight matrices. To this end, we analyze two strategies to identify subsets of high confidence negative data. The techniques introduced here are more general and hence can also be used for any other protein domains, which interact with short peptides (i.e. other PRMs). Availability: The program with the predictive models can be found at http://www.bioinf.uni-freiburg.de/Software/SH3PepInt/SH3PepInt.tar.gz. We also provide a genome-wide prediction for all 70 human SH3 domains, which can be found under http://www.bioinf.uni-freiburg.de/Software/SH3PepInt/Genome-Wide-Predictions.tar.gz. Contact: backofen@informatik.uni-freiburg.de Supplementary
Quantum noise in the mirror–field system: A field theoretic approach
Hsiang, Jen-Tsung; Wu, Tai-Hung; Lee, Da-Shin; King, Sun-Kun; Wu, Chun-Hsien
2013-01-01
We revisit the quantum noise problem in the mirror–field system by a field-theoretic approach. Here a perfectly reflecting mirror is illuminated by a single-mode coherent state of the massless scalar field. The associated radiation pressure is described by a surface integral of the stress-tensor of the field. The read-out field is measured by a monopole detector, from which the effective distance between the detector and mirror can be obtained. In the slow-motion limit of the mirror, this field-theoretic approach allows to identify various sources of quantum noise that all in all leads to uncertainty of the read-out measurement. In addition to well-known sources from shot noise and radiation pressure fluctuations, a new source of noise is found from field fluctuations modified by the mirror’s displacement. Correlation between different sources of noise can be established in the read-out measurement as the consequence of interference between the incident field and the field reflected off the mirror. In the case of negative correlation, we found that the uncertainty can be lowered than the value predicted by the standard quantum limit. Since the particle-number approach is often used in quantum optics, we compared results obtained by both approaches and examine its validity. We also derive a Langevin equation that describes the stochastic dynamics of the mirror. The underlying fluctuation–dissipation relation is briefly mentioned. Finally we discuss the backreaction induced by the radiation pressure. It will alter the mean displacement of the mirror, but we argue this backreaction can be ignored for a slowly moving mirror. - Highlights: ► The quantum noise problem in the mirror–field system is re-visited by a field-theoretic approach. ► Other than the shot noise and radiation pressure noise, we show there are new sources of noise and correlation between them. ► The noise correlations can be used to suppress the overall quantum noise on the mirror.
Quantum noise in the mirror-field system: A field theoretic approach
Hsiang, Jen-Tsung, E-mail: cosmology@gmail.com [Department of Physics, National Dong-Hwa University, Hua-lien, Taiwan, ROC (China); Wu, Tai-Hung [Department of Physics, National Dong-Hwa University, Hua-lien, Taiwan, ROC (China); Lee, Da-Shin, E-mail: dslee@mail.ndhu.edu.tw [Department of Physics, National Dong-Hwa University, Hua-lien, Taiwan, ROC (China); King, Sun-Kun [Institutes of Astronomy and Astrophysics, Academia Sinica, Taipei, Taiwan, ROC (China); Wu, Chun-Hsien [Department of Physics, Soochow University, Taipei, Taiwan, ROC (China)
2013-02-15
We revisit the quantum noise problem in the mirror-field system by a field-theoretic approach. Here a perfectly reflecting mirror is illuminated by a single-mode coherent state of the massless scalar field. The associated radiation pressure is described by a surface integral of the stress-tensor of the field. The read-out field is measured by a monopole detector, from which the effective distance between the detector and mirror can be obtained. In the slow-motion limit of the mirror, this field-theoretic approach allows to identify various sources of quantum noise that all in all leads to uncertainty of the read-out measurement. In addition to well-known sources from shot noise and radiation pressure fluctuations, a new source of noise is found from field fluctuations modified by the mirror's displacement. Correlation between different sources of noise can be established in the read-out measurement as the consequence of interference between the incident field and the field reflected off the mirror. In the case of negative correlation, we found that the uncertainty can be lowered than the value predicted by the standard quantum limit. Since the particle-number approach is often used in quantum optics, we compared results obtained by both approaches and examine its validity. We also derive a Langevin equation that describes the stochastic dynamics of the mirror. The underlying fluctuation-dissipation relation is briefly mentioned. Finally we discuss the backreaction induced by the radiation pressure. It will alter the mean displacement of the mirror, but we argue this backreaction can be ignored for a slowly moving mirror. - Highlights: Black-Right-Pointing-Pointer The quantum noise problem in the mirror-field system is re-visited by a field-theoretic approach. Black-Right-Pointing-Pointer Other than the shot noise and radiation pressure noise, we show there are new sources of noise and correlation between them. Black-Right-Pointing-Pointer The noise
A Game Theoretic Approach to Nuclear Security Analysis against Insider Threat
Kim, Kyonam; Kim, So Young; Yim, Mansung [Korea Advanced Institute of Science and Technology, Daejeon (Korea, Republic of); Schneider, Erich [Univ. of Texas at Austin, Texas (United States)
2014-05-15
As individuals with authorized access to a facility and system who use their trusted position for unauthorized purposes, insiders are able to take advantage of their access rights and knowledge of a facility to bypass dedicated security measures. They can also capitalize on their knowledge to exploit any vulnerabilities in safety-related systems, with cyber security of safety-critical information technology systems offering an important example of the 3S interface. While this Probabilistic Risk Assessment (PRA) approach is appropriate for describing fundamentally random events like component failure of a safety system, it does not capture the adversary's intentions, nor does it account for adversarial response and adaptation to defensive investments. To address these issues of intentionality and interactions, this study adopts a game theoretic approach. The interaction between defender and adversary is modeled as a two-person Stackelberg game. The optimal strategy of both players is found from the equilibrium of this game. A defender strategy consists of a set of design modifications and/or post-construction security upgrades. An attacker strategy involves selection of a target as well as a pathway to that target. In this study, application of the game theoretic approach is demonstrated using a simplified test case problem. Novel to our approach is the modeling of insider threat that affects the non-detection probability of an adversary. The game-theoretic approach has the advantage of modelling an intelligent adversary who has an intention and complete knowledge of the facility. In this study, we analyzed the expected adversarial path and security upgrades with a limited budget with insider threat modeled as increasing the non-detection probability. Our test case problem categorized three groups of adversary paths assisted by insiders and derived the largest insider threat in terms of the budget for security upgrades. Certainly more work needs to be done to
A Game Theoretic Approach to Nuclear Security Analysis against Insider Threat
Kim, Kyonam; Kim, So Young; Yim, Mansung; Schneider, Erich
2014-01-01
As individuals with authorized access to a facility and system who use their trusted position for unauthorized purposes, insiders are able to take advantage of their access rights and knowledge of a facility to bypass dedicated security measures. They can also capitalize on their knowledge to exploit any vulnerabilities in safety-related systems, with cyber security of safety-critical information technology systems offering an important example of the 3S interface. While this Probabilistic Risk Assessment (PRA) approach is appropriate for describing fundamentally random events like component failure of a safety system, it does not capture the adversary's intentions, nor does it account for adversarial response and adaptation to defensive investments. To address these issues of intentionality and interactions, this study adopts a game theoretic approach. The interaction between defender and adversary is modeled as a two-person Stackelberg game. The optimal strategy of both players is found from the equilibrium of this game. A defender strategy consists of a set of design modifications and/or post-construction security upgrades. An attacker strategy involves selection of a target as well as a pathway to that target. In this study, application of the game theoretic approach is demonstrated using a simplified test case problem. Novel to our approach is the modeling of insider threat that affects the non-detection probability of an adversary. The game-theoretic approach has the advantage of modelling an intelligent adversary who has an intention and complete knowledge of the facility. In this study, we analyzed the expected adversarial path and security upgrades with a limited budget with insider threat modeled as increasing the non-detection probability. Our test case problem categorized three groups of adversary paths assisted by insiders and derived the largest insider threat in terms of the budget for security upgrades. Certainly more work needs to be done to
Milad Elyasi
2014-04-01
Full Text Available In the recent decade, studying the economic order quantity (EOQ models with imperfect quality has appealed to many researchers. Only few papers are published discussing EOQ models with imperfect items in a supply chain. In this paper, a two-echelon decentralized supply chain consisting of a manufacture and a supplier that both face just in time (JIT inventory problem is considered. It is sought to find the optimal number of the shipments and the quantity of each shipment in a way that minimizes the both manufacturer’s and the supplier’s cost functions. To the authors’ best knowledge, this is the first paper that deals with imperfect items in a decentralized supply chain. Thereby, three different game theoretical solution approaches consisting of two non-cooperative games and a cooperative game are proposed. Comparing the results of three different scenarios with those of the centralized model, the conclusions are drawn to obtain the best approach.
Theoretical and empirical approaches to using films as a means to increase communication efficiency.
Kiselnikova, N.V.
2016-07-01
Full Text Available The theoretical framework of this analytic study is based on studies in the field of film perception. Films are considered as a communicative system that is encrypted in an ordered series of shots, and decoding proceeds during perception. The shots are the elements of a cinematic message that must be “read” by viewer. The objective of this work is to analyze the existing theoretical approaches to using films in psychotherapy and education. An original approach to film therapy that is based on teaching clients to use new communicative sets and psychotherapeutic patterns through watching films is presented. The article specifies the main emphasized points in theories of film therapy and education. It considers the specifics of film therapy in the process of increasing the effectiveness of communication. It discusses the advantages and limitations of the proposed method. The contemporary forms of film therapy and the formats of cinema clubs are criticized. The theoretical assumptions and empirical research that could be used as a basis for a method of developing effective communication by means of films are discussed. Our studies demonstrate that the usage of film therapy must include an educational stage for more effective and stable results. This means teaching viewers how to recognize certain psychotherapeutic and communicative patterns in the material of films, to practice the skill of finding as many examples as possible for each pattern and to transfer the acquired schemes of analyzing and recognizing patterns into one’s own life circumstances. The four stages of the film therapeutic process as well as the effects that are achieved at each stage are described in detail. In conclusion, the conditions under which the usage of the film therapy method would be the most effective are observed. Various properties of client groups and psychotherapeutic scenarios for using the method of active film therapy are described.
Supply chain collaboration: A Game-theoretic approach to profit allocation
Ponte, B.; Fernández, I.; Rosillo, R.; Parreño, J.; García, N.
2016-07-01
Purpose: This paper aims to develop a theoretical framework for profit allocation, as a mechanism for aligning incentives, in collaborative supply chains. Design/methodology/approach: The issue of profit distribution is approached from a game-theoretic perspective. We use the nucleolus concept. The framework is illustrated through a numerical example based on the Beer Game scenario. Findings: The nucleolus offers a powerful perspective to tackle this problem, as it takes into consideration the bargaining power of the different echelons. We show that this framework outperforms classical alternatives. Research limitations/implications: The allocation of the overall supply chain profit is analyzed from a static perspective. Considering the dynamic nature of the problem would be an interesting next step. Practical implications: We provide evidence of drawbacks derived from classical solutions to the profit allocation problem. Real-world collaborative supply chains need of robust mechanisms like the one tackled in this work to align incentives from the various actors. Originality/value: Adopting an efficient collaborative solution is a major challenge for supply chains, since it is a wide and complex process that requires an appropriate scheme. Within this framework, profit allocation is essential.
A Game-theoretical Approach for Distributed Cooperative Control of Autonomous Underwater Vehicles
Lu, Yimeng
2018-05-01
This thesis explores a game-theoretical approach for underwater environmental monitoring applications. We first apply game-theoretical algorithm to multi-agent resource coverage problem in drifting environments. Furthermore, existing utility design and learning process of the algorithm are modified to fit specific constraints of underwater exploration/monitoring tasks. The revised approach can take the real scenario of underwater monitoring applications such as the effect of sea current, previous knowledge of the resource and occasional communications between agents into account, and adapt to them to reach better performance. As the motivation of this thesis is from real applications, in this work we emphasize highly on implementation phase. A ROS-Gazebo simulation environment was created for preparation of actual tests. The algorithms are implemented in simulating both the dynamics of vehicles and the environment. After that, a multi-agent underwater autonomous robotic system was developed for hardware test in real settings with local controllers to make their own decisions. These systems are used for testing above mentioned algorithms and future development of other underwater projects. After that, other works related to robotics during this thesis will be briefly mentioned, including contributions in MBZIRC robotics competition and distributed control of UAVs in an adversarial environment.
Supply chain collaboration: A Game-theoretic approach to profit allocation
Ponte, B.; Fernández, I.; Rosillo, R.; Parreño, J.; García, N.
2016-01-01
Purpose: This paper aims to develop a theoretical framework for profit allocation, as a mechanism for aligning incentives, in collaborative supply chains. Design/methodology/approach: The issue of profit distribution is approached from a game-theoretic perspective. We use the nucleolus concept. The framework is illustrated through a numerical example based on the Beer Game scenario. Findings: The nucleolus offers a powerful perspective to tackle this problem, as it takes into consideration the bargaining power of the different echelons. We show that this framework outperforms classical alternatives. Research limitations/implications: The allocation of the overall supply chain profit is analyzed from a static perspective. Considering the dynamic nature of the problem would be an interesting next step. Practical implications: We provide evidence of drawbacks derived from classical solutions to the profit allocation problem. Real-world collaborative supply chains need of robust mechanisms like the one tackled in this work to align incentives from the various actors. Originality/value: Adopting an efficient collaborative solution is a major challenge for supply chains, since it is a wide and complex process that requires an appropriate scheme. Within this framework, profit allocation is essential.
Integer Flows and Circuit Covers of Graphs and Signed Graphs
Cheng, Jian
The work in Chapter 2 is motivated by Tutte and Jaeger's pioneering work on converting modulo flows into integer-valued flows for ordinary graphs. For a signed graphs (G, sigma), we first prove that for each k ∈ {2, 3}, if (G, sigma) is (k - 1)-edge-connected and contains an even number of negative edges when k = 2, then every modulo k-flow of (G, sigma) can be converted into an integer-valued ( k + 1)-ow with a larger or the same support. We also prove that if (G, sigma) is odd-(2p+1)-edge-connected, then (G, sigma) admits a modulo circular (2 + 1/ p)-flows if and only if it admits an integer-valued circular (2 + 1/p)-flows, which improves all previous result by Xu and Zhang (DM2005), Schubert and Steffen (EJC2015), and Zhu (JCTB2015). Shortest circuit cover conjecture is one of the major open problems in graph theory. It states that every bridgeless graph G contains a set of circuits F such that each edge is contained in at least one member of F and the length of F is at most 7/5∥E(G)∥. This concept was recently generalized to signed graphs by Macajova et al. (JGT2015). In Chapter 3, we improve their upper bound from 11∥E( G)∥ to 14/3 ∥E(G)∥, and if G is 2-edgeconnected and has even negativeness, then it can be further reduced to 11/3 ∥E(G)∥. Tutte's 3-flow conjecture has been studied by many graph theorists in the last several decades. As a new approach to this conjecture, DeVos and Thomassen considered the vectors as ow values and found that there is a close relation between vector S1-flows and integer 3-NZFs. Motivated by their observation, in Chapter 4, we prove that if a graph G admits a vector S1-flow with rank at most two, then G admits an integer 3-NZF. The concept of even factors is highly related to the famous Four Color Theorem. We conclude this dissertation in Chapter 5 with an improvement of a recent result by Chen and Fan (JCTB2016) on the upperbound of even factors. We show that if a graph G contains an even factor, then it
Uren, Kenneth R.; Schoor, George van; Rand, Carel P. du; Botha, Anrika
2016-01-01
Highlights: • An integrated sensor fault detection and isolation method for nuclear power plants. • Utilise techniques such as non-temporal parity space and principal component analysis. • Utilise statistical methods and fuzzy systems for sensor fault isolation. • Allow the detection of multiple sensor faults. • Proposed methodology suitable for online implementation. - Abstract: Sensor fault detection and isolation (FDI) is an important element in modern nuclear power plant (NPP) diagnostic systems. In this respect, sensor FDI of generation II and III water-cooled nuclear energy systems has become an active research topic to continually improve levels of reliability, safety, and operation. However, evolutionary advances in reactor and component technology together with different energy conversion methodologies support the investigation of alternative approaches to sensor FDI. Within this context, the basic aim of this two part series is to propose, implement and evaluate an integrated approach for sensor FDI and signal reconstruction in generation IV nuclear high temperature gas-cooled reactors (HTGRs). In part I of this two part series, the methodology and theoretical background of the integrated sensor FDI and signal reconstruction approach are given. This approach combines techniques such as non-temporal parity space analysis (PSA), principal component analysis (PCA), sensor fusion and fuzzy decision systems to form a more powerful sensor FDI methodology that exploits the strengths of the individual techniques. An illustrative example of the PCA algorithm is given making use of actual data retrieved from a pilot plant called the pebble bed micro model (PBMM). This is a prototype gas turbine power plant based on the first design configuration of the pebble bed modular reactor (PBMR). In part II, the described integrated sensor fault detection approach will be evaluated by means of two case studies. In the first case study the approach will be evaluated
Query Optimizations over Decentralized RDF Graphs
Abdelaziz, Ibrahim; Mansour, Essam; Ouzzani, Mourad; Aboulnaga, Ashraf; Kalnis, Panos
2017-01-01
Applications in life sciences, decentralized social networks, Internet of Things, and statistical linked dataspaces integrate data from multiple decentralized RDF graphs via SPARQL queries. Several approaches have been proposed to optimize query
Groups, graphs and random walks
Salvatori, Maura; Sava-Huss, Ecaterina
2017-01-01
An accessible and panoramic account of the theory of random walks on groups and graphs, stressing the strong connections of the theory with other branches of mathematics, including geometric and combinatorial group theory, potential analysis, and theoretical computer science. This volume brings together original surveys and research-expository papers from renowned and leading experts, many of whom spoke at the workshop 'Groups, Graphs and Random Walks' celebrating the sixtieth birthday of Wolfgang Woess in Cortona, Italy. Topics include: growth and amenability of groups; Schrödinger operators and symbolic dynamics; ergodic theorems; Thompson's group F; Poisson boundaries; probability theory on buildings and groups of Lie type; structure trees for edge cuts in networks; and mathematical crystallography. In what is currently a fast-growing area of mathematics, this book provides an up-to-date and valuable reference for both researchers and graduate students, from which future research activities will undoubted...
Laplacian Estrada and normalized Laplacian Estrada indices of evolving graphs.
Yilun Shang
Full Text Available Large-scale time-evolving networks have been generated by many natural and technological applications, posing challenges for computation and modeling. Thus, it is of theoretical and practical significance to probe mathematical tools tailored for evolving networks. In this paper, on top of the dynamic Estrada index, we study the dynamic Laplacian Estrada index and the dynamic normalized Laplacian Estrada index of evolving graphs. Using linear algebra techniques, we established general upper and lower bounds for these graph-spectrum-based invariants through a couple of intuitive graph-theoretic measures, including the number of vertices or edges. Synthetic random evolving small-world networks are employed to show the relevance of the proposed dynamic Estrada indices. It is found that neither the static snapshot graphs nor the aggregated graph can approximate the evolving graph itself, indicating the fundamental difference between the static and dynamic Estrada indices.
Laplacian Estrada and normalized Laplacian Estrada indices of evolving graphs.
Shang, Yilun
2015-01-01
Large-scale time-evolving networks have been generated by many natural and technological applications, posing challenges for computation and modeling. Thus, it is of theoretical and practical significance to probe mathematical tools tailored for evolving networks. In this paper, on top of the dynamic Estrada index, we study the dynamic Laplacian Estrada index and the dynamic normalized Laplacian Estrada index of evolving graphs. Using linear algebra techniques, we established general upper and lower bounds for these graph-spectrum-based invariants through a couple of intuitive graph-theoretic measures, including the number of vertices or edges. Synthetic random evolving small-world networks are employed to show the relevance of the proposed dynamic Estrada indices. It is found that neither the static snapshot graphs nor the aggregated graph can approximate the evolving graph itself, indicating the fundamental difference between the static and dynamic Estrada indices.
Enabling Graph Appliance for Genome Assembly
Singh, Rina [ORNL; Graves, Jeffrey A [ORNL; Lee, Sangkeun (Matt) [ORNL; Sukumar, Sreenivas R [ORNL; Shankar, Mallikarjun [ORNL
2015-01-01
In recent years, there has been a huge growth in the amount of genomic data available as reads generated from various genome sequencers. The number of reads generated can be huge, ranging from hundreds to billions of nucleotide, each varying in size. Assembling such large amounts of data is one of the challenging computational problems for both biomedical and data scientists. Most of the genome assemblers developed have used de Bruijn graph techniques. A de Bruijn graph represents a collection of read sequences by billions of vertices and edges, which require large amounts of memory and computational power to store and process. This is the major drawback to de Bruijn graph assembly. Massively parallel, multi-threaded, shared memory systems can be leveraged to overcome some of these issues. The objective of our research is to investigate the feasibility and scalability issues of de Bruijn graph assembly on Cray s Urika-GD system; Urika-GD is a high performance graph appliance with a large shared memory and massively multithreaded custom processor designed for executing SPARQL queries over large-scale RDF data sets. However, to the best of our knowledge, there is no research on representing a de Bruijn graph as an RDF graph or finding Eulerian paths in RDF graphs using SPARQL for potential genome discovery. In this paper, we address the issues involved in representing a de Bruin graphs as RDF graphs and propose an iterative querying approach for finding Eulerian paths in large RDF graphs. We evaluate the performance of our implementation on real world ebola genome datasets and illustrate how genome assembly can be accomplished with Urika-GD using iterative SPARQL queries.
EmptyHeaded: A Relational Engine for Graph Processing.
Aberger, Christopher R; Tu, Susan; Olukotun, Kunle; Ré, Christopher
2016-01-01
There are two types of high-performance graph processing engines: low- and high-level engines. Low-level engines (Galois, PowerGraph, Snap) provide optimized data structures and computation models but require users to write low-level imperative code, hence ensuring that efficiency is the burden of the user. In high-level engines, users write in query languages like datalog (SociaLite) or SQL (Grail). High-level engines are easier to use but are orders of magnitude slower than the low-level graph engines. We present EmptyHeaded, a high-level engine that supports a rich datalog-like query language and achieves performance comparable to that of low-level engines. At the core of EmptyHeaded's design is a new class of join algorithms that satisfy strong theoretical guarantees but have thus far not achieved performance comparable to that of specialized graph processing engines. To achieve high performance, EmptyHeaded introduces a new join engine architecture, including a novel query optimizer and data layouts that leverage single-instruction multiple data (SIMD) parallelism. With this architecture, EmptyHeaded outperforms high-level approaches by up to three orders of magnitude on graph pattern queries, PageRank, and Single-Source Shortest Paths (SSSP) and is an order of magnitude faster than many low-level baselines. We validate that EmptyHeaded competes with the best-of-breed low-level engine (Galois), achieving comparable performance on PageRank and at most 3× worse performance on SSSP.
Combinatorial and geometric aspects of Feynman graphs and Feynman integrals
Bergbauer, Christoph
2009-06-11
The integrals associated to Feynman graphs must have been a source of frustration for particle physicists ever since. Indeed there is a delicate difference between being able to draw a Feynman graph and being able to compute the associated Feynman integral. Although perturbation theory has brought enormous breakthroughs, many physicists turned to more abstract developments in quantum field theory, looked for other ways to produce perturbational results, or left the field entirely. Nonetheless there is a significant number of physicists, computational and theoretical, who pursue the quest for concepts and algorithms to compute and understand those integrals to higher and higher orders. Their motivation is to help test the validity of the underlying physical theory. For a mathematician, Feynman graphs and their integrals provide a rich subject in their own right, independent of their computability. It was only recently though that the work of Bloch, Esnault and Kreimer has brought a growing interest of mathematicians from various disciplines to the subject. In fact it opened up a completely new direction of research: a motivic interpretation of Feynman graphs that unites their combinatorial, geometric and arithmetic aspects. This idea had been in the air for a while, based on computational results of Broadhurst and Kreimer, and on a theorem of Belkale and Brosnan related to a conjecture of Kontsevich about the generality of the underlying motives. A prerequisite for the motivic approach is a profound understanding of renormalization that was established less recently in a modern language by Connes and Kreimer. This dissertation studies the renormalization of Feynman graphs in position space using an adapted resolution of singularities, and makes two other contributions of mostly combinatorial nature to the subject. I hope this may serve as a reference for somebody who feels comfortable with the traditional position space literature and looks for a transition to the
Combinatorial and geometric aspects of Feynman graphs and Feynman integrals
Bergbauer, Christoph
2009-01-01
The integrals associated to Feynman graphs must have been a source of frustration for particle physicists ever since. Indeed there is a delicate difference between being able to draw a Feynman graph and being able to compute the associated Feynman integral. Although perturbation theory has brought enormous breakthroughs, many physicists turned to more abstract developments in quantum field theory, looked for other ways to produce perturbational results, or left the field entirely. Nonetheless there is a significant number of physicists, computational and theoretical, who pursue the quest for concepts and algorithms to compute and understand those integrals to higher and higher orders. Their motivation is to help test the validity of the underlying physical theory. For a mathematician, Feynman graphs and their integrals provide a rich subject in their own right, independent of their computability. It was only recently though that the work of Bloch, Esnault and Kreimer has brought a growing interest of mathematicians from various disciplines to the subject. In fact it opened up a completely new direction of research: a motivic interpretation of Feynman graphs that unites their combinatorial, geometric and arithmetic aspects. This idea had been in the air for a while, based on computational results of Broadhurst and Kreimer, and on a theorem of Belkale and Brosnan related to a conjecture of Kontsevich about the generality of the underlying motives. A prerequisite for the motivic approach is a profound understanding of renormalization that was established less recently in a modern language by Connes and Kreimer. This dissertation studies the renormalization of Feynman graphs in position space using an adapted resolution of singularities, and makes two other contributions of mostly combinatorial nature to the subject. I hope this may serve as a reference for somebody who feels comfortable with the traditional position space literature and looks for a transition to the
Jayasree, P. K.; Arun, K. V.; Oormila, R.; Sreelakshmi, H.
2018-05-01
As per Indian Standards, laterally loaded piles are usually analysed using the method adopted by IS 2911-2010 (Part 1/Section 2). But the practising engineers are of the opinion that the IS method is very conservative in design. This work aims at determining the extent to which the conventional IS design approach is conservative. This is done through a comparative study between IS approach and the theoretical model based on Vesic's equation. Bore log details for six different bridges were collected from the Kerala Public Works Department. Cast in situ fixed head piles embedded in three soil conditions both end bearing as well as friction piles were considered and analyzed separately. Piles were also modelled in STAAD.Pro software based on IS approach and the results were validated using Matlock and Reese (In Proceedings of fifth international conference on soil mechanics and foundation engineering, 1961) equation. The results were presented as the percentage variation in values of bending moment and deflection obtained by different methods. The results obtained from the mathematical model based on Vesic's equation and that obtained as per the IS approach were compared and the IS method was found to be uneconomical and conservative.
Modeling the economic impact of medication adherence in type 2 diabetes: a theoretical approach.
Cobden, David S; Niessen, Louis W; Rutten, Frans Fh; Redekop, W Ken
2010-09-07
While strong correlations exist between medication adherence and health economic outcomes in type 2 diabetes, current economic analyses do not adequately consider them. We propose a new approach to incorporate adherence in cost-effectiveness analysis. We describe a theoretical approach to incorporating the effect of adherence when estimating the long-term costs and effectiveness of an antidiabetic medication. This approach was applied in a Markov model which includes common diabetic health states. We compared two treatments using hypothetical patient cohorts: injectable insulin (IDM) and oral (OAD) medications. Two analyses were performed, one which ignored adherence (analysis 1) and one which incorporated it (analysis 2). Results from the two analyses were then compared to explore the extent to which adherence may impact incremental cost-effectiveness ratios. In both analyses, IDM was more costly and more effective than OAD. When adherence was ignored, IDM generated an incremental cost-effectiveness of $12,097 per quality-adjusted life-year (QALY) gained versus OAD. Incorporation of adherence resulted in a slightly higher ratio ($16,241/QALY). This increase was primarily due to better adherence with OAD than with IDM, and the higher direct medical costs for IDM. Incorporating medication adherence into economic analyses can meaningfully influence the estimated cost-effectiveness of type 2 diabetes treatments, and should therefore be considered in health care decision-making. Future work on the impact of adherence on health economic outcomes, and validation of different approaches to modeling adherence, is warranted.
Theoretical approach in optimization of stability of the multicomponent solid waste form
Raicevic, S.; Plecas, I.; Mandic, M.
1998-01-01
Chemical precipitation of radionuclides and their immobilization into the solid matrix represents an important approach in the radioactive wastewater treatment. Unfortunately, because of the complexity of the system, optimization of this process in terms of its efficacy and safety represents a serious practical problem, even in treatment of the monocomponent nuclear waste. This situation is additionally complicated in the case of the polycomponent nuclear waste because of the synergic effects of interactions between the radioactive components and the solid matrix. Recently, we have proposed a general theoretical approach for optimization of the process of precipitation and immobilization of metal impurities by the solid matrix. One of the main advantages of this approach represents the possibility of treatment of the multicomponent liquid waste, immobilized by the solid matrix. This approach was used here for investigation of the stability of the system hydroxyapatite (HAP) - Pb/Cd, which was selected as a model multicomponent waste system. In this analysis, we have used a structurally dependent term of the cohesive energy as a stability criterion. (author)
Spectral clustering and biclustering learning large graphs and contingency tables
Bolla, Marianna
2013-01-01
Explores regular structures in graphs and contingency tables by spectral theory and statistical methods This book bridges the gap between graph theory and statistics by giving answers to the demanding questions which arise when statisticians are confronted with large weighted graphs or rectangular arrays. Classical and modern statistical methods applicable to biological, social, communication networks, or microarrays are presented together with the theoretical background and proofs. This book is suitable for a one-semester course for graduate students in data mining, mult
Logsdon, M Cynthia; Mittelberg, Meghan; Morrison, David; Robertson, Ashley; Luther, James F; Wisniewski, Stephen R; Confer, Andrea; Eng, Heather; Sit, Dorothy K Y; Wisner, Katherine L
2014-12-01
The purpose of this study was to determine which of the four common approaches to coding maternal-infant interaction best discriminates between mothers with and without postpartum depression. After extensive training, four research assistants coded 83 three minute videotapes of maternal infant interaction at 12month postpartum visits. Four theoretical approaches to coding (Maternal Behavior Q-Sort, the Dyadic Mini Code, Ainsworth Maternal Sensitivity Scale, and the Child-Caregiver Mutual Regulation Scale) were used. Twelve month data were chosen to allow the maximum possible exposure of the infant to maternal depression during the first postpartum year. The videotapes were created in a laboratory with standard procedures. Inter-rater reliabilities for each coding method ranged from .7 to .9. The coders were blind to depression status of the mother. Twenty-seven of the women had major depressive disorder during the 12month postpartum period. Receiver operating characteristics analysis indicated that none of the four methods of analyzing maternal infant interaction discriminated between mothers with and without major depressive disorder. Limitations of the study include the cross-sectional design and the low number of women with major depressive disorder. Further analysis should include data from videotapes at earlier postpartum time periods, and alternative coding approaches should be considered. Nurses should continue to examine culturally appropriate ways in which new mothers can be supported in how to best nurture their babies. Copyright © 2014 Elsevier Inc. All rights reserved.
Chartrand, Gary
1984-01-01
Graph theory is used today in the physical sciences, social sciences, computer science, and other areas. Introductory Graph Theory presents a nontechnical introduction to this exciting field in a clear, lively, and informative style. Author Gary Chartrand covers the important elementary topics of graph theory and its applications. In addition, he presents a large variety of proofs designed to strengthen mathematical techniques and offers challenging opportunities to have fun with mathematics. Ten major topics - profusely illustrated - include: Mathematical Models, Elementary Concepts of Grap
James Christopher Ryan
2017-01-01
Full Text Available The current commentary offers a reflection on the conceptualizations of Lee and Raschke's (2016 proposal for a set-theoretic approach to employee motivation and organizational performance. The commentary is informed by the current author's operationalization of set-theoretic research on employee motivation which occurred contemporaneously to the work of Lee and Raschke. Observations on the state of current research on employee motivation, development of motivation theory and future directions of set-theoretic approaches to employee motivation and performance are offered.
Karolina Taczanowska
2017-12-01
Full Text Available Mountain protected areas (PAs aim to preserve vulnerable environments and at the same time encourage numerous outdoor leisure activities. Understanding the way people use natural environments is crucial to balance the needs of visitors and site capacities. This study aims to develop an approach to evaluate the structure and use of designated skiing zones in PAs combining Global Positioning System (GPS tracking and analytical methods based on graph theory. The study is based on empirical data (n = 609 GPS tracks of backcountry skiers collected in Tatra National Park (TNP, Poland. The physical structure of the entire skiing zones system has been simplified into a graph structure (structural network; undirected graph. In a second step, the actual use of the area by skiers (functional network; directed graph was analyzed using a graph-theoretic approach. Network coherence (connectivity indices: β, γ, α, movement directions at path segments, and relative importance of network nodes (node centrality measures: degree, betweenness, closeness, and proximity prestige were calculated. The system of designated backcountry skiing zones was not evenly used by the visitors. Therefore, the calculated parameters differ significantly between the structural and the functional network. In particular, measures related to the actually used trails are of high importance from the management point of view. Information about the most important node locations can be used for planning sign-posts, on-site maps, interpretative boards, or other tourist infrastructure.
A short course in quantum information theory. An approach from theoretical physics. 2. ed.
Diosi, Lajos
2011-01-01
This short and concise primer takes the vantage point of theoretical physics and the unity of physics. It sets out to strip the burgeoning field of quantum information science to its basics by linking it to universal concepts in physics. An extensive lecture rather than a comprehensive textbook, this volume is based on courses delivered over several years to advanced undergraduate and beginning graduate students, but essentially it addresses anyone with a working knowledge of basic quantum physics. Readers will find these lectures a most adequate entry point for theoretical studies in this field. For the second edition, the authors has succeeded in adding many new topics while sticking to the conciseness of the overall approach. A new chapter on qubit thermodynamics has been added, while new sections and subsections have been incorporated in various chapter to deal with weak and time-continuous measurements, period-finding quantum algorithms and quantum error corrections. From the reviews of the first edition: ''The best things about this book are its brevity and clarity. In around 100 pages it provides a tutorial introduction to quantum information theory, including problems and solutions.. it's worth a look if you want to quickly get up to speed with the language and central concepts of quantum information theory, including the background classical information theory.'' (Craig Savage, Australian Physics, Vol. 44 (2), 2007). (orig.)
NON-TERRITORIAL AUTONOMY IN RUSSIA: PRACTICAL IMPLICATIONS OF THEORETICAL APPROACHES
Tatiana RUDNEVA
2012-06-01
Full Text Available Despite the theoretical possibility to use non-territorial autonomy as a mechanism through which ethnic groups can fulfil their right to selfdetermination along with other minority rights, not many states have been willing to put theory into practice. The article offers an explanation why wider applicability of NTA is problematic by arguing that the theory itself is not yet polished enough to be implemented. The study includes examination of both theoretical approaches and empirical data from a case study of an attempt to establish NTAs in the Russian Federation. The findings suggest that inconsistencies and unclarities in the theory do correlate with practical flaws of NTAs, which allows to suggest that when the theory is tested empirically, the reality reveals all the flaws of the theory. The results indicate that the concept of NTA needs further refinement and development to make it more practice-oriented and applicable. As the problem of minority rights is still to be dealt with, we also propose a model of global union of NTAs where each ethnic group is represented by a non-governmental organisation, which seems to be more applicable than the others, alongside a number of other mechanisms that are even more essential and universal and focus on defending basic human rights
Optimization of rootkit revealing system resources – A game theoretic approach
K. Muthumanickam
2015-10-01
Full Text Available Malicious rootkit is a collection of programs designed with the intent of infecting and monitoring the victim computer without the user’s permission. After the victim has been compromised, the remote attacker can easily cause further damage. In order to infect, compromise and monitor, rootkits adopt Native Application Programming Interface (API hooking technique. To reveal the hidden rootkits, current rootkit detection techniques check different data structures which hold reference to Native APIs. To verify these data structures, a large amount of system resources are required. This is because of the number of APIs in these data structures being quite large. Game theoretic approach is a useful mathematical tool to simulate network attacks. In this paper, a mathematical model is framed to optimize resource consumption using game-theory. To the best of our knowledge, this is the first work to be proposed for optimizing resource consumption while revealing rootkit presence using game theory. Non-cooperative game model is taken to discuss the problem. Analysis and simulation results show that our game theoretic model can effectively reduce the resource consumption by selectively monitoring the number of APIs in windows platform.
Raiko Diana V.
2018-03-01
Full Text Available The article is aimed at the substantiation based on the analysis of the company theories of the basic theoretical provisions on the formation of industrial enterprise management instruments. The article determines that the subject of research in theories is enterprise, the object is the process of management of potential according to the forms of business organization and technology of partnership relations, the goal is high financial results, stabilization of the activity, and social responsibility. The publication carries out an analysis of enterprise theories on the determining of its essence as a socio-economic system in the following directions: technical preparation of production, economic theory and law, theory of systems, marketing-management. As a result of the research, the general set of functions has been identified – the socio-economic functions of enterprise by groups: information-legal, production, marketing-management, social responsibility. When building management instruments, it is suggested to take into consideration the direct and inverse relationships of enterprise at all levels of management – micro, meso and macro. On this ground, the authors have developed provisions on formation of instruments of management of industrial enterprises according to two approaches – theoretical and functional.
A Game Theoretic Approach for Balancing Energy Consumption in Clustered Wireless Sensor Networks.
Yang, Liu; Lu, Yinzhi; Xiong, Lian; Tao, Yang; Zhong, Yuanchang
2017-11-17
Clustering is an effective topology control method in wireless sensor networks (WSNs), since it can enhance the network lifetime and scalability. To prolong the network lifetime in clustered WSNs, an efficient cluster head (CH) optimization policy is essential to distribute the energy among sensor nodes. Recently, game theory has been introduced to model clustering. Each sensor node is considered as a rational and selfish player which will play a clustering game with an equilibrium strategy. Then it decides whether to act as the CH according to this strategy for a tradeoff between providing required services and energy conservation. However, how to get the equilibrium strategy while maximizing the payoff of sensor nodes has rarely been addressed to date. In this paper, we present a game theoretic approach for balancing energy consumption in clustered WSNs. With our novel payoff function, realistic sensor behaviors can be captured well. The energy heterogeneity of nodes is considered by incorporating a penalty mechanism in the payoff function, so the nodes with more energy will compete for CHs more actively. We have obtained the Nash equilibrium (NE) strategy of the clustering game through convex optimization. Specifically, each sensor node can achieve its own maximal payoff when it makes the decision according to this strategy. Through plenty of simulations, our proposed game theoretic clustering is proved to have a good energy balancing performance and consequently the network lifetime is greatly enhanced.
Sergiu Ciprian Catinas
2015-07-01
Full Text Available A detailed theoretical and practical investigation of the reinforced concrete elements is due to recent techniques and method that are implemented in the construction market. More over a theoretical study is a demand for a better and faster approach nowadays due to rapid development of the calculus technique. The paper above will present a study for implementing in a static calculus the direct stiffness matrix method in order capable to address phenomena related to different stages of loading, rapid change of cross section area and physical properties. The method is a demand due to the fact that in our days the FEM (Finite Element Method is the only alternative to such a calculus and FEM are considered as expensive methods from the time and calculus resources point of view. The main goal in such a method is to create the moment-curvature diagram in the cross section that is analyzed. The paper above will express some of the most important techniques and new ideas as well in order to create the moment curvature graphic in the cross sections considered.
Incremental View Maintenance for Deductive Graph Databases Using Generalized Discrimination Networks
Thomas Beyhl
2016-12-01
Full Text Available Nowadays, graph databases are employed when relationships between entities are in the scope of database queries to avoid performance-critical join operations of relational databases. Graph queries are used to query and modify graphs stored in graph databases. Graph queries employ graph pattern matching that is NP-complete for subgraph isomorphism. Graph database views can be employed that keep ready answers in terms of precalculated graph pattern matches for often stated and complex graph queries to increase query performance. However, such graph database views must be kept consistent with the graphs stored in the graph database. In this paper, we describe how to use incremental graph pattern matching as technique for maintaining graph database views. We present an incremental maintenance algorithm for graph database views, which works for imperatively and declaratively specified graph queries. The evaluation shows that our maintenance algorithm scales when the number of nodes and edges stored in the graph database increases. Furthermore, our evaluation shows that our approach can outperform existing approaches for the incremental maintenance of graph query results.
Craciun, Stefan; Brockmeier, Austin J; George, Alan D; Lam, Herman; Príncipe, José C
2011-01-01
Methods for decoding movements from neural spike counts using adaptive filters often rely on minimizing the mean-squared error. However, for non-Gaussian distribution of errors, this approach is not optimal for performance. Therefore, rather than using probabilistic modeling, we propose an alternate non-parametric approach. In order to extract more structure from the input signal (neuronal spike counts) we propose using minimum error entropy (MEE), an information-theoretic approach that minimizes the error entropy as part of an iterative cost function. However, the disadvantage of using MEE as the cost function for adaptive filters is the increase in computational complexity. In this paper we present a comparison between the decoding performance of the analytic Wiener filter and a linear filter trained with MEE, which is then mapped to a parallel architecture in reconfigurable hardware tailored to the computational needs of the MEE filter. We observe considerable speedup from the hardware design. The adaptation of filter weights for the multiple-input, multiple-output linear filters, necessary in motor decoding, is a highly parallelizable algorithm. It can be decomposed into many independent computational blocks with a parallel architecture readily mapped to a field-programmable gate array (FPGA) and scales to large numbers of neurons. By pipelining and parallelizing independent computations in the algorithm, the proposed parallel architecture has sublinear increases in execution time with respect to both window size and filter order.
Model-free information-theoretic approach to infer leadership in pairs of zebrafish.
Butail, Sachit; Mwaffo, Violet; Porfiri, Maurizio
2016-04-01
Collective behavior affords several advantages to fish in avoiding predators, foraging, mating, and swimming. Although fish schools have been traditionally considered egalitarian superorganisms, a number of empirical observations suggest the emergence of leadership in gregarious groups. Detecting and classifying leader-follower relationships is central to elucidate the behavioral and physiological causes of leadership and understand its consequences. Here, we demonstrate an information-theoretic approach to infer leadership from positional data of fish swimming. In this framework, we measure social interactions between fish pairs through the mathematical construct of transfer entropy, which quantifies the predictive power of a time series to anticipate another, possibly coupled, time series. We focus on the zebrafish model organism, which is rapidly emerging as a species of choice in preclinical research for its genetic similarity to humans and reduced neurobiological complexity with respect to mammals. To overcome experimental confounds and generate test data sets on which we can thoroughly assess our approach, we adapt and calibrate a data-driven stochastic model of zebrafish motion for the simulation of a coupled dynamical system of zebrafish pairs. In this synthetic data set, the extent and direction of the coupling between the fish are systematically varied across a wide parameter range to demonstrate the accuracy and reliability of transfer entropy in inferring leadership. Our approach is expected to aid in the analysis of collective behavior, providing a data-driven perspective to understand social interactions.
Adriaan R. Soetevent
2010-01-01
This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. I propose an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. One feature of graph models of price competition is that spatial discontinuities in firm-level demand may occur. I show that the existence result of D'Aspremont et al. (1979) does not extend to simple star graphs. I conjecture that this non-existence result holds...
Pim Heijnen; Adriaan Soetevent
2014-01-01
This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. We derive an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. These graph models of price competition may lead to spatial discontinuities in firm-level demand. We show that the existence result of D'Aspremont et al. (1979) does not extend to simple star graphs and conjecture that this non-existence result holds more general...
Aleks Kissinger
2014-03-01
Full Text Available String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. Dixon, Duncan and Kissinger introduced string graphs, which are a combinatoric representations of string diagrams, amenable to automated reasoning about diagrammatic theories via graph rewrite systems. In this extended abstract, we show how the power of such rewrite systems can be greatly extended by introducing pattern graphs, which provide a means of expressing infinite families of rewrite rules where certain marked subgraphs, called !-boxes ("bang boxes", on both sides of a rule can be copied any number of times or removed. After reviewing the string graph formalism, we show how string graphs can be extended to pattern graphs and how pattern graphs and pattern rewrite rules can be instantiated to concrete string graphs and rewrite rules. We then provide examples demonstrating the expressive power of pattern graphs and how they can be applied to study interacting algebraic structures that are central to categorical quantum mechanics.
Gelfand, I M; Shnol, E E
1969-01-01
The second in a series of systematic studies by a celebrated mathematician I. M. Gelfand and colleagues, this volume presents students with a well-illustrated sequence of problems and exercises designed to illuminate the properties of functions and graphs. Since readers do not have the benefit of a blackboard on which a teacher constructs a graph, the authors abandoned the customary use of diagrams in which only the final form of the graph appears; instead, the book's margins feature step-by-step diagrams for the complete construction of each graph. The first part of the book employs simple fu
Creating more effective graphs
Robbins, Naomi B
2012-01-01
A succinct and highly readable guide to creating effective graphs The right graph can be a powerful tool for communicating information, improving a presentation, or conveying your point in print. If your professional endeavors call for you to present data graphically, here's a book that can help you do it more effectively. Creating More Effective Graphs gives you the basic knowledge and techniques required to choose and create appropriate graphs for a broad range of applications. Using real-world examples everyone can relate to, the author draws on her years of experience in gr
Lothian, Joshua [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Powers, Sarah S. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Sullivan, Blair D. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Baker, Matthew B. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Schrock, Jonathan [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Poole, Stephen W. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
2013-10-01
The benchmarking effort within the Extreme Scale Systems Center at Oak Ridge National Laboratory seeks to provide High Performance Computing benchmarks and test suites of interest to the DoD sponsor. The work described in this report is a part of the effort focusing on graph generation. A previously developed benchmark, SystemBurn, allowed the emulation of different application behavior profiles within a single framework. To complement this effort, similar capabilities are desired for graph-centric problems. This report examines existing synthetic graph generator implementations in preparation for further study on the properties of their generated synthetic graphs.
Mansutti, Alessio; Miculan, Marino; Peressotti, Marco
2017-01-01
We introduce loose graph simulations (LGS), a new notion about labelled graphs which subsumes in an intuitive and natural way subgraph isomorphism (SGI), regular language pattern matching (RLPM) and graph simulation (GS). Being a unification of all these notions, LGS allows us to express directly...... also problems which are “mixed” instances of previous ones, and hence which would not fit easily in any of them. After the definition and some examples, we show that the problem of finding loose graph simulations is NP-complete, we provide formal translation of SGI, RLPM, and GS into LGSs, and we give...
Alberto Apostolico
2009-08-01
Full Text Available The Web Graph is a large-scale graph that does not fit in main memory, so that lossless compression methods have been proposed for it. This paper introduces a compression scheme that combines efficient storage with fast retrieval for the information in a node. The scheme exploits the properties of the Web Graph without assuming an ordering of the URLs, so that it may be applied to more general graphs. Tests on some datasets of use achieve space savings of about 10% over existing methods.
maila dinia husni rahim
2016-03-01
Full Text Available As adults, we often believe that children are only interested with games and children’s ‘stuff’. However research has shown that children do indeed show a greater interest in the world around them, including about politics, elections, and democracy. If we need to teach children about democracy, what are the best methods of teaching democracy to young children? Narrative is considered as an effective medium to convey messages to children and discuss hard subjects. This paper is a theoretical exploration that looks at the narrative approach to teaching and learning about democracy with young children. The researchers has used a literature review to look at why narratives should be used, what narratives should be used and how to use narratives.
Vytelingum, Perukrishnen; Cliff, Dave; Jennings, Nicholas R.
We develop a new model to analyse the strategic behaviour of buyers and sellers in market mechanisms. In particular, we wish to understand how the different strategies they adopt affect their economic efficiency in the market and to understand the impact of these choices on the overall efficiency of the marketplace. To this end, we adopt a two-population evolutionary game theoretic approach, where we consider how the behaviours of both buyers and sellers evolve in marketplaces. In so doing, we address the shortcomings of the previous state-of-the-art analytical model that assumes that buyers and sellers have to adopt the same mixed strategy in the market. Finally, we apply our model in one of the most common market mechanisms, the Continuous Double Auction, and demonstrate how it allows us to provide new insights into the strategic interactions of such trading agents.
A game-theoretical approach for reciprocal security-related prevention investment decisions
Reniers, Genserik; Soudan, Karel
2010-01-01
Every company situated within a chemical cluster faces important security risks from neighbouring companies. Investing in reciprocal security preventive measures is therefore necessary to avoid major accidents. These investments do not, however, provide a direct return on investment for the investor-company and thus plants are hesitative to invest. Moreover, there is likelihood that even if a company has fully invested in reciprocal security prevention, its neighbour has not, and as a result the company can experience a major accident caused by an initial (minor or major) accident that occurred in an adjacent chemical enterprise. In this article we employ a game-theoretic approach to interpret and model behaviour of two neighbouring chemical plants while negotiating and deciding on reciprocal security prevention investments.
Souza, Vânia de; Gazzinelli, Maria Flávia; Soares, Amanda Nathale; Fernandes, Marconi Moura; Oliveira, Rebeca Nunes Guedes de; Fonseca, Rosa Maria Godoy Serpa da
2017-04-01
To describe the Papo Reto [Straight Talk] game and reflect on its theoretical-methodological basis. Analytical study on the process of elaboration of the Papo Reto online game, destined to adolescents aged 15-18 years, with access to the Game between 2014 and 2015. the interactions of 60 adolescents from Belo Horizonte and São Paulo constituted examples of the potentialities of the Game to favor the approach to sexuality with adolescents through simulation of reality, invention and interaction. Based on those potentialities, four thinking categories were discussed: the game as pedagogic device; the game as simulation of realities; the game as device for inventive learning; and the game empowering the interaction. By permitting that the adolescents take risks on new ways, the Game allows them to become creative and active in the production of senses, in the creation of their discourses and in the ways of thinking, feeling and acting in the sexuality field.
Dynamic Load on a Pipe Caused by Acetylene Detonations – Experiments and Theoretical Approaches
Axel Sperber
1999-01-01
Full Text Available The load acting on the wall of a pipe by a detonation, which is travelling through, is not yet well characterized. The main reasons are the limited amount of sufficiently accurate pressure time history data and the requirement of considering the dynamics of the system. Laser vibrometry measurements were performed to determine the dynamic response of the pipe wall on a detonation. Different modelling approaches were used to quantify, theoretically, the radial displacements of the pipe wall. There is good agreement between measured and predicted values of vibration frequencies and the propagation velocities of transverse waves. Discrepancies mainly due to wave propagation effects were found in the amplitudes of the radial velocities. They might be overcome by the use of a dynamic load factor or improved modelling methods.
Combined action of ionizing radiation with another factor: common rules and theoretical approach
Kim, Jin Kyu; Roh, Changhyun; Komarova, Ludmila N.; Petin, Vladislav G.
2013-01-01
Two or more factors can simultaneously make their combined effects on the biological objects. This study has focused on theoretical approach to synergistic interaction due to the combined action of radiation and another factor on cell inactivation. A mathematical model for the synergistic interaction of different environmental agents was suggested for quantitative prediction of irreversibly damaged cells after combined exposures. The model takes into account the synergistic interaction of agents and based on the supposition that additional effective damages responsible for the synergy are irreversible and originated from an interaction of ineffective sub lesions. The experimental results regarding the irreversible component of radiation damage of diploid yeast cells simultaneous exposed to heat with ionizing radiation or UV light are presented. A good agreement of experimental results with model predictions was demonstrated. The importance of the results obtained for the interpretation of the mechanism of synergistic interaction of various environmental factors is discussed. (author)