Learning a color distance metric for region-based image segmentation

In this paper we describe an experiment where we studied empirically the application of a learned distance metric to be used as discrimination function for an established color image segmentation algorithm. For this purpose we chose the Mumford–Shah energy functional and the Mahalanobis distance metric. The objective was to test our approach in an objective and quantifiable way on this specific algorithm employing this particular distance model, without making generalization claims. The empirical validation of the results was performed in two experiments: one applying the resulting segmentation method on a subset of the Berkeley Image Database, an exemplar image set possessing ground-truths and validating the results against the ground-truths using two well-known inter-cluster validation methods, namely, the Rand and BGM indexes, and another experiment using images of the same context divided into training and testing set, where the distance metric is learned from the training set and then applied to segment all the images. The obtained results suggest that the use of the specified learned distance metric provides better and more robust segmentations, even if no other modification of the segmentation algorithm is performed.     

基于FDI算法在软件测试实践中的应用

软件测试对于软件系统的性能以及功能都有很重要的意义,是保证软件可靠运行的关键.在软件测试的实践应用中,对于软件故障定位时,提出了基于谓词统计故障定位的算法,也就是FDI频率差异积分算法.在软件测试实践中采用基于FDI频率差异积分算法,可以很好地监控软件程序,测试软件的覆盖率以及执行时间等内存占用情况,并找到软件的故障瓶颈,以便采取更好的方法改进软件性能.探讨了实践中基于FDI频率差异积分算法在软件测试内的应用.     

Univariate marginal distribution algorithm dynamics for a class of parametric functions with unitation constraints

In this paper, we introduce a mathematical model for analyzing the dynamics of the univariate marginal distribution algorithm (UMDA) for a class of parametric functions with isolated global optima. We prove a number of results that are used to model the evolution of UMDA probability distributions for this class of functions. We show that a theoretical analysis can assess the effect of the function parameters on the convergence and rate of convergence of UMDA. We also introduce for the first time a long string limit analysis of UMDA. Finally, we relate the results to ongoing research on the application of the estimation of distribution algorithms for problems with unitation constraints.     

A new neural network algorithm for planarization problems

To deal with the planarization problem widely used in many applications including routing very-large-scale integration （VLSI） circuits, this paper points out that only when its vertices are arranged in some specific order in a line can a planar graph be embedded on a line without any cross connections or cross edges. Energy function is proposed to meet the need of embedding a graph on a single line and route it correctly. A Hopfield network is designed according to the proposed energy function for such embedding and routing. The advantage of the proposed method is that it not only can detect if a graph is a planar one or not, but also can embed a planar graph or the maximal planar subgraph of a non-planar graph on a single line. In addition, simulated annealing is employed for helping the network to escape from local minima during the running of the Hopfield network. Experiments of the proposed method and its comparison with some existent conventional methods were performed and the results indicate that the proposed method is of great feasibility and effectiveness especially for the planarization problem of large graphs.     

谈局域网的性能优化

在局域网运行和维护的过程中,网络管理员不仅要确保网络能够提供正常的服务,还要采取各种措施保证网络能够可靠、安全、高效地运行,从整个网络的角度提高网络的性能。     

常用内排序算法的分析与比较

该文在对常用内排序算法基本思想分析的基础上,从算法的稳定性;算法在最好情况下、最坏情况下的交换次数和移动次数;算法的时间复杂度等方面进行了详细的比较分析。     

Expansion of a matrix in terms of external products of configuration vectors

The paper proposes a neural-net iterative algorithm that allows us to represent any random symmetrical N×N matrix as a weighted Hebbian series of configuration vectors with a given accuracy. The iterative algorithm is shown to demonstrate the fastest convergence when the vectors of expansion are stable nods of the N-dimensional space corresponding to the extremums of the neural-net energy functional. It so proves that all conclusions about neural networks and optimization algorithms that are based on Hebbian matrices are true for any other type of matrix. The text was submitted by the author in English.     

知识获取技术及其在网络智能故障诊断中的应用

基于遗传算法提出了一种新型的机器学习方法,它利用遗传算法的全局寻优手段,为解决知识获取这一瓶颈问题另辟捷径。论述了该方法的原理及其实现过程,并且给出了网络故障诊断应用实例,证明了它的有效性。     

The election problem in asynchronous distributed systems with bounded faulty processes

Determining the “weakest” failure detectors is a central topic in solving many agreement problems such as Consensus, Non-Blocking Atomic Commit and Election in asynchronous distributed systems. So far, this has been studied extensively for several such fundamental problems. It is stated that Perfect Failure Detector P is the weakest failure detector to solve the Election problem with any number of faulty processes. In this paper, we introduce Modal failure detector M and show that to solve Election, M is the weakest failure detector to solve election when the number of faulty processes is less than ⌈n/2⌉. We also show that it is strictly weaker than P.

An LMI approach to constrained optimization with homogeneous forms

This paper considers the problem of determining the minimum Euclidean distance of a point from a polynomial surface in . It is well known that this problem is in general non-convex. The main purpose of the paper is to investigate to what extent linear matrix inequality (LMI) techniques can be exploited for solving this problem. The first result of the paper shows that a lower bound to the global minimum can be achieved via the solution of a one-parameter family of linear matrix inequalities (LMIs). It is also pointed out that for some classes of problems the solution of a single LMI problem provides the lower bound. The second result concerns the tightness of the bound. It is shown that optimality of the lower bound amounts to solving a system of linear equations. An application example is finally presented to show the features of the approach.