求解圆盘图中最小连通支配集的近似算法

针对无线传感器网络常用的拓扑模型单位圆盘图,提出了基于分布式贪心策略的近似算法DDT,在算法执行的每一轮中,根据一跳邻域范围内的权值和邻居的状态信息,选举出节点并和已确定的节点连接,逐步构造出网络图中的一个支配树。用概率方法研究了支配树中的节点度的性质,通过对极大独立集和最小连通支配集之间关系的分析,得到单位圆盘图中最小连通支配集问题一个新的近似比。计算结果表明,和相关的分布式算法相比,DDT产生的连通支配集在规模上更优。     

The Search of Equilibrium Strategies for Controlled Boundary Value Problem

The present paper is focused on the finite‐time differential game of m players with nonzero sum. The principal difference from regular cases consists in the fact that the states of players are subordinated to boundary value system of ordinary differential equations (rather than the initial value system). By the end of the game we understand the equilibrium situation and our purpose is to design a well‐founded suitable method for the equilibrium control search.     

Structural Synthesis of Modular Weakly Connected Neural Networks. I. Methodology of Structural Synthesis of Modular Neural Networks

Structural models of modular neural networks without loops are considered. The notion of a weakly connected network is introduced. A genetic principle of generation of weakly connected neural networks is proposed, and its reproductive power is proved on the basis of the theory of categories. Algorithmic realizations of structural synthesis are considered. Some examples are given.     

An algorithm of file encryption based on sum function sequences

An algorithm of file encryption based on sum function sequences is discussed in this paper. A file is encrypted by applying sum function sequences, bits with exclusive-or operation, and circular cryptographic key. Comparing with traditional algorithms and others, it is harder to decode, and the system cost is lower. New encryption algorithms can be made by transforming source codes with sum function sequences, and it can be used to encrypt different files.     

基于最小连通邻域图的ISOMAP算法

噪音的干扰和邻域大小的不合适会在ISOMAP算法的邻域图中引入“短路”边,使其不能正确表达数据的邻域结构,从而使该算法具有较差的鲁棒性和拓扑稳定性。为此,根据最小连通邻域图能有效避免“短路”边的特点,提出了一种能有效删除“短路”边因而更具鲁棒性和拓扑稳定性的ISOMAP算法——基于最小连通邻域图的ISOMAP（MCNG-ISOMAP）算法。该算法能在一定程度上避免邻域大小难以有效选取的问题,同时还能在不依赖于邻域大小的情况下发现数据真正的固有维数。     

Connected sum of digital closed surfaces

During the past 20 years the research of digital surfaces has proceeded to find their properties in the digital space Zⁿ, such as a topological number, a simple k-point, the 3D-Jordan theorem, a k-separating set, a boundary detecting algorithm and so on. Actually, unlike surfaces in a continuous space, the features of digital surfaces have different characteristics. The aim of this paper is to introduce the notion of a digital closed k-surface in Zⁿ, n ? 3, with the general k-adjacency relations as a generalization of Malgouyres’ and Morgenthaler’s k-surfaces in Z³, to establish some minimal simple closed k-surfaces in Z³ and to find their digital topological properties in relation with the k-fundamental group and k-contractibility. Moreover, a connected sum of two digital closed surfaces is introduced and its digital topological properties are investigated.     

一个新的分布式最小连通支配集近似算法

在计算机网络中广泛使用广播来解决一些网络问题,设计有效的广播算法是一项重要的课题。文中提出一种分布地计算网络最小连通支配集的近似算法并给出了它的正确性证明。它只需要网络节点具有局部的网络状态信息,可伸缩性强。通过此算法可以在网络中自动形成一个虚拟骨干网,从而可为网络中的广播和路由操作提供一个有效的通信基础。模拟结果表明,文中提出的算法求得的连通支配集小,能较好地应用于一般网络以及移动自组网络中。     

一种面向政府采购的多属性反向拍卖模型

为了对政府采购中电子反向拍卖系统的适用性进行改善.利用多属性决策理论和相关算法,对多属性反向拍卖的步骤和模型进行研究.对只按价格来选取供应商的方式进行了改进,建立了多属性选取供应商的反向拍卖系统.系统实现了选取供应商的自动化,能达到综合属性的最优,满足政府采购中以反拍方式进行采购的需求,提高了采购效率,降低了采购成本.     

视频监控中基于颜色特征的运动目标匹配研究

提出了一种基于颜色特征的运动目标匹配方法。通过颜色直方图定义了运动目标的主颜色区域,并依据最大隶属度原则建立RGB三维彩色空间主颜色区域信息的模糊子集,最后采用模糊相似匹配原理对匹配目标与待匹配目标模糊集的模糊隶属度函数和贴近度函数进行比较,得出匹配结果。实验结果表明,该方法在解决视频监控中运动目标匹配问题时是可行且可靠的。     

A fast connected components labeling algorithm for binary images

A fast label-equivalence-based connected components labeling algorithm is proposed in this paper.It is a combination of two existing efficient methods,which are pivotal operations in two-pass connected components labeling algorithms.One is a fast pixel scan method,and the other is an array-based Union-Find data structure.The scan procedure assigns each foreground pixel a provisional label according to the location of the pixel.That is to say,it labels the foreground pixels following background pixels and foreground pixels in different ways,which greatly reduces the number of neighbor pixel checks.The array-based Union-Find data structure resolves the label equivalences between provisional labels by using only a single array with path compression,and it improves the efficiency of the resolving procedure which is very time-consuming in general label-equivalence-based algorithms.The experiments on various types of images with different sizes show that the proposed algorithm is superior to other labeling approaches for huge images containing many big connected components.