LP-oriented upper bounds for the weighted stability number of a graph

Upper bounds for the weighted stability number of a graph are considered that are based on the approximation of its stable set polytope by linear inequalities for odd cycles and p-wheels in the graph. Algorithms are developed for finding upper bounds on the basis of solution of LP problems with a finite number of inequalities produced by the shortest path algorithm for a special graph. The results of test experiments are given for graphs with several hundred or thousand vertices. This work was partially financially supported by the CRDF Cooperative Grants Program under grant UKM2-2812-KV-06. Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 157–170, January–February 2009.     

Output transformations and separation results for feedback linearisable delay systems

The class of strict-feedback systems enjoys special properties that make it similar to linear systems. This paper proves that such a class is equivalent, under a change of coordinates, to the wider class of feedback linearisable systems with multiplicative input, when the multiplicative terms are functions of the measured variables only. We apply this result to the control problem of feedback linearisable nonlinear MIMO systems with input and/or output delays. In this way, we provide sufficient conditions under which a separation result holds for output feedback control and moreover a predictor-based controller exists. When these conditions are satisfied, we obtain that the existence of stabilising controllers for arbitrarily large delays in the input and/or the output can be proved for a wider class of systems than previously known.     

On the equivalence between global recurrence and the existence of a smooth Lyapunov function for hybrid systems

We study a weak stability property called recurrence for a class of hybrid systems. An open set is recurrent if there are no finite escape times and every complete trajectory eventually reaches the set. Under sufficient regularity properties for the hybrid system we establish that the existence of a smooth, radially unbounded Lyapunov function that decreases along solutions outside an open, bounded set is a necessary and sufficient condition for recurrence of that set. Recurrence of open, bounded sets is robust to sufficiently small state dependent perturbations and this robustness property is crucial for establishing the existence of a Lyapunov function that is smooth. We also highlight some connections between recurrence and other well studied properties like asymptotic stability and ultimate boundedness.     

Practical exponential stability of perturbed triangular systems and a separation principle

In this paper, we present a practical stability result for perturbed dynamic systems depending on a parameter and we study the practical exponential stability of perturbed triangular systems. These results are applied to show that a separation principle for nonlinear uncertain systems can be achieved and which considers practical global uniform exponential stability. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

面向大规模图计算的连通分量算法分析与优化

近年来,图计算在诸多领域发挥着越来越重要的作用。连通分量算法是图计算的重要基础算法,可以应用于可达性查询、一致性检测等众多场景。面向大规模图遍历Graph500标准测试,对连通分量算法进行了算法和数据结构优化。主要有以下创新:(1)对并查集提出了捷径向量算法,并测试了算法和数据结构的配合程度;(2)利用多线程迭代轮转对算法实现并行加速;(3)从多个维度比较了不同实现方法的优缺点。基于优化方法,对性能进行了评估分析,当scale=25(包含2²⁵个节点)时,捷径向量算法对基于二维向量和链表的按秩合并算法的加速比分别是1.38倍和1.40倍,对BFS和DFS的加速比分别为4.76倍和4.70倍,且空间占用为该2个算法的4.1%～4.6%,此外,并行对串行的加速比为1.57倍。     

前端渲染函数调用图工具的设计与实现

针对内核在线分析工具,使用服务器计算函数调用图存在渲染时间长、网络传输数据量大等问题,基于Node.js的前端渲染函数调用图工具FRCG(front-end rendering call graph),使用前后端分离的方式,将数据处理与调用图渲染拆分到前后端分别进行.服务器异步处理请求,返回JSON数据,优化传输数据量...     

Optimal controllers not satisfying the separation theorem

The paper deals with the problem of finding an optimal feedback control for stochastic continuous-time system with incomplete information. In the case of linear-quadratic-Gaussian assumptions, a standard solution is given by the separation theorem via two separate problems of estimation and control. Other controllers of the same structure (dynamic unit + feedback) that minimize a quadratic functional but do not satisfy the separation principle are considered. For all such (equivalent) controllers, the quadratic functional has the same value. Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 134–145, May–June, 2000.     

Bond graph modeling and optimization of photovoltaic pumping system: Simulation and experimental results

Bond graphs are a promising possibility for modeling complex physical systems. This paper explores its potential by undertaking the analysis, modeling and design of a water pumping photovoltaic system. The effectiveness of photovoltaic water pumping systems depends on the sufficiency between the generated energy and the volume of pumped water. Another point developed in this paper presents the optimization of a photovoltaic (PV) water pumping system using maximum power point tracking technique (MPPT). The optimization is based on the detection of the optimal power. This optimization technique is developed to optimize the usage of power. The presented MPPT technique is used in photovoltaic water pumping system in order to increasing its efficiency. A buck–boost chopper allows an adaptation interface between the panel and the battery checked by a tracking mechanism known as the MPPT (Maximum Power Point Tracking). A new algorithm is presented to control a maximum power point tracker MPPT through a bond graph. From the chemical reactions in the batteries to the control laws of the power electronics structures, a bond graph model is proposed for every single part of the system. The model is used in simulations and the results compared to actual measurements. The model is used in simulations and the results compared to actual measurements, showing an accuracy of nearly 99%.     

An effective and efficient parallel approach for random graph generation over GPUs

The widespread usage of random graphs   has been highlighted in the context of database applications for several years. This because such data structures turn out to be very useful in a large family of database applications ranging from simulation to sampling, from analysis of complex networks to study of randomized algorithms, and so forth. Amongst others, Erd?s–Rényi _Γv,p${\Gamma }_{v,p}$ is the most popular model to obtain and manipulate random graphs. Unfortunately, it has been demonstrated that classical algorithms for generating Erd?s–Rényi based random graphs do not scale well in large instances and, in addition to this, fail to make use of the parallel processing capabilities of modern hardware. Inspired by this main motivation, in this paper we propose and experimentally assess a novel parallel algorithm for generating random graphs under the Erd?s–Rényi model that is designed and implemented in a Graphics Processing Unit (GPU), called PPreZER. We demonstrate the nice amenities due to our solution via a succession of several intermediary algorithms, both sequential and parallel, which show the limitations of classical approaches and the benefits due to the PPreZER algorithm. Finally, our comprehensive experimental assessment and analysis brings to light a relevant average speedup gain of PPreZER over baseline algorithms.     

基于图文法的程序流程图与源代码自动转换

程序流程图在整个软件工程的生命周期中发挥着非常重要的作用。在软件设计中,设计人员通常需要先根据算法从结构上画出程序执行流程图,然后再依据流程图写出相应的源程序代码;在分析和维护软件时,如果能先将源程序代码逆向转换成流程图,则可以有效地帮助分析程序结构。显然,若能让计算机自动地实现流程图与源程序代码之间的相互转换,将大量节省软件开发的人力资源和时间耗费。讨论了如何利用基于边的图文法EGG来自动地实现这种转换,并用具体例子展示了应用EGG图文法的归约和推导操作分别实现流程图的语法分析和流程图的逆向生成,前者可以完成从流程图自动生成源程序代码,而后者则可以从源程序代码自动生成流程图。     

Characterizing and recognizing the visibility graph of a funnel-shaped polygon

A funnel, which is notable for its fundamental role in visibility algorithms, is defined as a polygon that has exactly three convex vertices, two of which are connected by a boundary edge. In this paper we investigate the visibility graph of a funnel which we call an F-graph.We first present two characterizations of an F-graph, one of whose sufficiency proof itself is a linear time Real RAM algorithm for drawing a funnel on the plane that corresponds to an F-graph. We next give a linear-time algorithm for recognizing an F-graph. When the algorithm recognizes an F-graph, it also reports one of the Hamiltonian cycles defining the boundary of its corresponding funnel. This recognition algorithm takes linear time even on a RAM.We finally show that an F-graph is weakly triangulated and therefore perfect, which agrees with the fact that perfect graphs are related to geometric structures.This work was supported in part by the Korea Science and Engineering Foundation under Grant 91-01-01.     

Algorithms for multi-level graph planarity testing and layout

In this paper we consider the problems of testing a multi-level graph for planarity and laying out or, drawing, a multi-level graph in a clear way. We introduce a new abstraction of a common integer linear programming formulation of the problems that we call a vertex-exchange graph. We demonstrate how this concept can be used to solve the problems by providing clear and simple algorithms for testing a multi-level graph for planarity and laying out a multi-level graph when planar.     

基于特征和结构信息增强的图神经网络集成学习框架

近年来,图神经网络由于其丰富的表征和推理能力受到广泛的关注,然而,目前的研究聚焦于卷积策略和网络结构的调整以获得更高的性能,不可避免地面临单一模型局限性的约束。受到集成学习思想的启发,面向图神经网络创新性地提出一套集成学习框架(EL-GNN)。不同于常规的文本和图像数据,图数据除了特征信息外还包括了丰富的拓扑结构信息。因此,EL-GNN不仅将不同基分类器的预测结果进行融合,还在集成阶段额外补充了结构信息。此外,基于特征相似或结构邻居节点通常具有相似标签的先验假设,借助特征图重构,进一步优化集成策略,充分平衡了节点的特征和结构信息。大量实验表明,提出的集成策略取得了良好的成效,并EL-GNN在节点分类任务上显著优于现有模型。     

A communication-reduced and computation-balanced framework for fast graph computation

The bulk synchronous parallel (BSP) model is very user friendly for coding and debugging parallel graph algorithms. However, existing BSP-based distributed graph-processing frameworks, such as Pregel, GPS and Giraph, routinely suffer from high communication costs. These high communication costs mainly stem from the fine-grained message-passing communication model. In order to address this problem, we propose a new computation model with low communication costs, called LCC-BSP. We use this model to design and implement a high-performance distributed graph-processing framework called LCC-Graph. This framework eliminates high communication costs in existing distributed graph-processing frameworks. Moreover, LCC-Graph also balances the computation workloads among all compute nodes by optimizing graph partitioning, significantly reducing the computation time for each superstep. Evaluation of LCC-Graph on a 32-node cluster, driven by real-world graph datasets, shows that it significantly outperforms existing distributed graph-processing frameworks in terms of runtime, particularly when the system is supported by a high-bandwidth network. For example, LCC-Graph achieves an order of magnitude performance improvement over GPS and GraphLab.     

Conditions for the equivalence of internal and external stabilityfor distributed parameter systems

Conditions are given on a controlled, observed distributed parameter system under which external stability, also known as input-output stability, implies internal stability, which is the exponential stability of the underlying semigroup generator. It is shown that when the system satisfies a general definition of stabilizability and detectability, external stability is equivalent to internal stability. Unlike the case previous definitions of stabilizability and detectability, a system which satisfies these does not necessarily have a spectrum decomposition. Therefore, in order to check internal stability, it is often sufficient to check the boundedness of the transfer function in the right-half complex plane. This is illustrated with a simple example