A new topological index for the Changchun institute of applied chemistry C-13 NMR information system

A method to assign a single number representation for each atom (node) in a molecular graph, Atomic IDentification (AID) number, is proposed based on the counts of weighted paths terminated on that atom. Then, a new topological index, Molecular IDentification (MID) number is developed from AID. The MID is tested systematically, over half a million of structures are examined, and MID shows high discrimination for various structural isomers. Thus it can be used for documentation in the Changchun Institute of Chemistry C-13 NMR information system.

GENERAL ALPHA-N INDEX AND ITS APPLICATION .2. THE CORRELATION BETWEEN THE GENERAL ALPHA-N INDEX AND PHYSICAL-PROPERTIES OF NEUTRAL PHOSPHORUS-COMPOUNDS

The relationship between the alpha-N index and physical properties of neutral phosphorus extractants is studied. Using the general alpha-N index which could describe extractants with minute difference in structure, the good correlation between it and various physical properties of the neutral phosphorus extractants (e.g., densities, refractive index, shift ratio of paper chromatography and IR frequencies of bond P = O) is obtained. The result indicates that general alpha-N index is a good topological index of organic compounds.

网络控制系统稳定性的图理论

针对具有有界时延和数据包丢失的网络控制系统,提出了一种新的稳定性判据.基于Lyapunov方法和图论理论,给出非线性离散和连续网络控制系统渐近稳定的充分条件,获得保持这两类系统稳定的最大允许时延界,得到控制器设计方法.并且,利用区间矩阵的谱特征,给出网络控制系统区间稳定的充分条件.设计算法,获得比例积分反馈控制器增益.算例表明所提方法的有效性。

基于图论的无线传感器网络拓扑控制方法研究

传感器技术、通信技术和计算机技术的飞速发展，孕育了具有现代意义的无线传感器网络，带来了一项新的信息革命。无线传感器网络的出现改变了人与自然的交互方式，其应用领域已经深入到了社会生活的各个方面。 无线传感器网络是一种测控网络，网络设计一般侧重网络的节能性、生命周期的延长、网络的扩展性等方面。对于网络拓扑控制来说，由于网络中节点数量众多、能力有限，网络的拓扑结构相当复杂，同时节点易失效也导致了网络拓扑结构的频繁变化，所以拓扑控制是无线传感器网络中重要的研究问题。本文基于图论中的理论知识，对无线传感器网络中的拓扑控制进行了研究，主要内容和研究成果包括以下几个方面。  论述了无线传感器网络拓扑控制问题研究的基本内容、分类、评价指标，并且指出了前人研究的成果的不足之处。  为了对无线传感器网络中节点进行功率控制，以单位圆盘图为模型构造了一个几何支撑图结构。此支撑图满足连通性、平面性、t-支撑图以及稀疏性，并且构造此支撑图的通信开销相对于其它支撑图构造算法大大降低。  针对无线传感器网络中没有基础结构的特点，利用连通支配集理论构造了无线传感器网络的虚拟骨干结构，从而把无线传感器网络映射成一个层次型的骨干结构。  基于修剪策略提出了一种极小连通支配集构造算法。算法又分为集中式和分布式两个版本。集中式算法中不仅考虑了节点的度、节点id，还综合考虑了节点的剩余能量，从而平衡了网络中节点的能量消耗，延长了算法的稳定运行时间，减少了拓扑结构重构的频率，有利于延长网络的生存时间。分布式算法中，节点根据两条邻居信息，采用了一种本地化的启发式搜索策略，从而降低了整个算法的信息复杂度。此外，这种基于修剪策略的构造算法实现方法非常简单，且够在算法运行的任何时刻得到一个可行的解。  基于极大独立集技术提出了一种启发式的极小连通支配集构造算法。在求解极大独立集过程中只需要根据节点和一跳邻居节点之间的信息确定极大独立集，在求解连通集时，根据独立节点的性质采用了本地化的启发式算法，从而提高了算法的性能，构造算法的信息复杂度也相对较低。仿真结果表明，构造算法在整个过程中所需要的通信开销大大降低，从而节省了节点的能量，有利于延长网络的生存时间。  根据无线传感器网络中节点易失效的特点，提出了一个容错的虚拟骨干构造算法。算法基于极大独立集构造方法，首先构造一个连通支配集，然后基于本地化信息得到一个支配度为k的冗余连通支配集，最后再使用协商和贪心策略使得连通支配集的连通度为m，从而得到一个m-连通k-支配集。仿真结果表明算法信息复杂度低，构造算法所需要的数据通信量降低。 本文基于图论知识，针对无线传感器网络的特点，对无线传感器网络的拓扑结构控制方法进行了研究，各项研究成果可以为无线传感器网络设计者提供一些有益的指导。

积分偏移的计算几何与并行实现

The Second Round of Oil & Gas Exploration needs more precision imaging method, velocity vs. depth model and geometry description on Complicated Geological Mass. Prestack time migration on inhomogeneous media was the technical basic of velocity analysis, prestack time migration on Rugged surface, angle gather and multi-domain noise suppression. In order to realize this technique, several critical technical problems need to be solved, such as parallel computation, velocity algorithm on ununiform grid and visualization. The key problem is organic combination theories of migration and computational geometry. Based on technical problems of 3-D prestack time migration existing in inhomogeneous media and requirements from nonuniform grid, parallel process and visualization, the thesis was studied systematically on three aspects: Infrastructure of velocity varies laterally Green function traveltime computation on ununiform grid, parallel computational of kirchhoff integral migration and 3D visualization, by combining integral migration theory and Computational Geometry. The results will provide powerful technical support to the implement of prestack time migration and convenient compute infrastructure of wave number domain simulation in inhomogeneous media. The main results were obtained as follows: 1. Symbol of one way wave Lie algebra integral, phase and green function traveltime expressions were analyzed, and simple 2-D expression of Lie algebra integral symbol phase and green function traveltime in time domain were given in inhomogeneous media by using pseudo-differential operators’ exponential map and Lie group algorithm preserving geometry structure. Infrastructure calculation of five parts, including derivative, commutating operator, Lie algebra root tree, exponential map root tree and traveltime coefficients , was brought forward when calculating asymmetry traveltime equation containing lateral differential in 3-D by this method. 2. By studying the infrastructure calculation of asymmetry traveltime in 3-D based on lateral velocity differential and combining computational geometry, a method to build velocity library and interpolate on velocity library using triangulate was obtained, which fit traveltime calculate requirements of parallel time migration and velocity estimate. 3. Combining velocity library triangulate and computational geometry, a structure which was convenient to calculate differential in horizontal, commutating operator and integral in vertical was built. Furthermore, recursive algorithm, for calculating architecture on lie algebra integral and exponential map root tree (Magnus in Math), was build and asymmetry traveltime based on lateral differential algorithm was also realized. 4. Based on graph theory and computational geometry, a minimum cycle method to decompose area into polygon blocks, which can be used as topological representation of migration result was proposed, which provided a practical method to block representation and research to migration interpretation results. 5. Based on MPI library, a process of bringing parallel migration algorithm at arbitrary sequence traces into practical was realized by using asymmetry traveltime based on lateral differential calculation and Kirchhoff integral method. 6. Visualization of geological data and seismic data were studied by the tools of OpenGL and Open Inventor, based on computational geometry theory, and a 3D visualize system on seismic imaging data was designed.

Reti complesse e analisi del segnale elettroencefalografico

The identification of subject-specific traits extracted from patterns of brain activity still represents an important challenge. The need to detect distinctive brain features, which is relevant for biometric and brain computer interface systems, has been also emphasized in monitoring the effect of clinical treatments and in evaluating the progression of brain disorders. Graph theory and network science tools have revealed fundamental mechanisms of functional brain organization in resting-state M/EEG analysis. Nevertheless, it is still not clearly understood how several methodological aspects may bias the topology of the reconstructed functional networks. In this context, the literature shows inconsistency in the chosen length of the selected epochs, impeding a meaningful comparison between results from different studies. In this study we propose an approach which aims to investigate the existence of a distinctive functional core (sub-network) using an unbiased reconstruction of network topology. Brain signals from a public and freely available EEG dataset were analyzed using a phase synchronization based measure, minimum spanning tree and k-core decomposition. The analysis was performed for each classical brain rhythm separately. Furthermore, we aim to provide a network approach insensitive to the effects that epoch length has on functional connectivity (FC) and network reconstruction. Two different measures, the phase lag index (PLI) and the Amplitude Envelope Correlation (AEC), were applied to EEG resting-state recordings for a group of eighteen healthy volunteers. Weighted clustering coefficient (CCw), weighted characteristic path length (Lw) and minimum spanning tree (MST) parameters were computed to evaluate the network topology. The analysis was performed on both scalp and source-space data. Results about distinctive functional core, show highest classification rates from k-core decomposition in gamma (EER=0.130, AUC=0.943) and high beta (EER=0.172, AUC=0.905) frequency bands. Results from scalp analysis concerning the influence of epoch length, show a decrease in both mean PLI and AEC values with an increase in epoch length, with a tendency to stabilize at a length of 12 seconds for PLI and 6 seconds for AEC. Moreover, CCw and Lw show very similar behaviour, with metrics based on AEC more reliable in terms of stability. In general, MST parameters stabilize at short epoch lengths, particularly for MSTs based on PLI (1-6 seconds versus 4-8 seconds for AEC). At the source-level the results were even more reliable, with stability already at 1 second duration for PLI-based MSTs. Our results confirm that EEG analysis may represent an effective tool to identify subject-specific characteristics that may be of great impact for several bioengineering applications. Regarding epoch length, the present work suggests that both PLI and AEC depend on epoch length and that this has an impact on the reconstructed network topology, particularly at the scalp-level. Source-level MST topology is less sensitive to differences in epoch length, therefore enabling the comparison of brain network topology between different studies.

Nearest-neighbor Queries in Probabilistic Graphs

Large probabilistic graphs arise in various domains spanning from social networks to biological and communication networks. An important query in these graphs is the k nearest-neighbor query, which involves finding and reporting the k closest nodes to a specific node. This query assumes the existence of a measure of the "proximity" or the "distance" between any two nodes in the graph. To that end, we propose various novel distance functions that extend well known notions of classical graph theory, such as shortest paths and random walks. We argue that many meaningful distance functions are computationally intractable to compute exactly. Thus, in order to process nearest-neighbor queries, we resort to Monte Carlo sampling and exploit novel graph-transformation ideas and pruning opportunities. In our extensive experimental analysis, we explore the trade-offs of our approximation algorithms and demonstrate that they scale well on real-world probabilistic graphs with tens of millions of edges.

Feasibility of online collaborative voltage stability control of power systems

This paper presents the results of feasibility study of a novel concept of power system on-line collaborative voltage stability control. The proposal of the on-line collaboration between power system controllers is to enhance their overall performance and efficiency to cope with the increasing operational uncertainty of modern power systems. In the paper, the framework of proposed on-line collaborative voltage stability control is firstly presented, which is based on the deployment of multi-agent systems and real-time communication for on-line collaborative control. Then two of the most important issues in implementing the proposed on-line collaborative voltage stability control are addressed: (1) Error-tolerant communication protocol for fast information exchange among multiple intelligent agents; (2) Deployment of multi-agent systems by using graph theory to implement power system post-emergency control. In the paper, the proposed on-line collaborative voltage stability control is tested in the example 10-machine 39-node New England power system. Results of feasibility study from simulation are given considering the low-probability power system cascading faults.

Networks for systems biology: conceptual connection of data and function

The purpose of this study is to survey the use of networks and network-based methods in systems biology. This study starts with an introduction to graph theory and basic measures allowing to quantify structural properties of networks. Then, the authors present important network classes and gene networks as well as methods for their analysis. In the last part of this study, the authors review approaches that aim at analysing the functional organisation of gene networks and the use of networks in medicine. In addition to this, the authors advocate networks as a systematic approach to general problems in systems biology, because networks are capable of assuming multiple roles that are very beneficial connecting experimental data with a functional interpretation in biological terms.

Dominating induced matchings

We study the problem of determining whether or not a graph G has an induced matching that dominates every edge of the graph, which is also known as efficient edge domination. This problem is known to be NP-complete in general as well as in some restricted domains, such as bipartite graphs or regular graphs. In this paper, we identify a graph parameter to which the complexity of the problem is sensible and produce results of both negative (intractable) and positive (solvable in polynomial time) type. © 2009 Springer Berlin Heidelberg.

Efficient edge domination in regular graphs

An induced matching of a graph G is a matching having no two edges joined by an edge. An efficient edge dominating set of G is an induced matching M such that every other edge of G is adjacent to some edge in M. We relate maximum induced matchings and efficient edge dominating sets, showing that efficient edge dominating sets are maximum induced matchings, and that maximum induced matchings on regular graphs with efficient edge dominating sets are efficient edge dominating sets. A necessary condition for the existence of efficient edge dominating sets in terms of spectra of graphs is established. We also prove that, for arbitrary fixed p ≥ 3, deciding on the existence of efficient edge dominating sets on p-regular graphs is NP-complete. © 2008 Elsevier B.V. All rights reserved.

Convex Quadratic Programming Approach to the Maximum Matching Problem

The problem of determining a maximum matching or whether there exists a perfect matching, is very common in a large variety of applications and as been extensively studied in graph theory. In this paper we start to introduce a characterisation of a family of graphs for which its stability number is determined by convex quadratic programming. The main results connected with the recognition of this family of graphs are also introduced. It follows a necessary and sufficient condition which characterise a graph with a perfect matching and an algorithmic strategy, based on the determination of the stability number of line graphs, by convex quadratic programming, applied to the determination of a perfect matching. A numerical example for the recognition of graphs with a perfect matching is described. Finally, the above algorithmic strategy is extended to the determination of a maximum matching of an arbitrary graph and some related results are presented.

Politopo de Birkhoff acíclico

Neste trabalho estabelece-se uma interpreta c~ao geom etrica, em termos da teoria dos grafos, para v ertices, arestas e faces de uma qualquer dimens~ao do politopo de Birkho ac clico, Tn = n(T), onde T e uma arvore com n v ertices. Generaliza-se o resultado obtido por G. Dahl, [18], para o c alculo do di^ametro do grafo G( t n), onde t n e o politopo das matrizes tridiagonais duplamente estoc asticas. Adicionalmente, para q = 0; 1; 2; 3 s~ao obtidas f ormulas expl citas para a contagem do n umero de q faces do politopo de Birkho tridiagonal, t n, e e feito o estudo da natureza geom etrica dessas mesmas faces. S~ao, tamb em, apresentados algoritmos para efectuar contagens do n umero de faces de dimens~ao inferior a de uma dada face do politopo de Birkho ac clico.

Grafos para todos

Dissertação de Mestrado, Matemática, Especialização em Matemática para o Ensino, Faculdade de Ciências e Tecnologia, Universidade do Algarve, 2007

Mögliche neue Strukturen im Ortsnetz und ihre minimale Länge

Auch für das Teilnehmeranschlußnetz werden neben dem heute üblichen „Sternnetz" neuerdings „Ring-" und „Verzweigungsnetze" genannt, und es wird die Frage diskutiert, ob damit geringere Kosten zu erwarten sind. Mit Begriffen der Graphentheorie werden hier z.B. die Strukturen Stern, Ring, Baum definiert. Ein gedachtes Ortsnetz wird dann in quadratische Bereiche mit der Seitenlänge l und mit M Teilnehmern aufgeteilt. Für verschiedene Strukturen des Leiternetzes in der Teilnehmerebene werden die Mindestlängen der Leiter und der Kabelkanäle berechnet. Unter anderem zeigt sich, daß unabhängig von der Struktur des Leiternetzes die Kabelkanäle, ein dominierender Kostenanteil in der Teilnehmerebene, praktisch gleich lang sind, nämlich l/M^0,5 je Teilnehmer.