Approximating the single source unsplittable min-cost flow problem

In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given graph with edge capacities and costs; the demand of each commodity must be routed along a single path so that the total flow through any edge is at most its capacity. Moreover, the total cost must not exceed a given budget. This problem has been introduced by Kleinberg [7] and generalizes several NP-complete problems from various areas in combinatorial optimization such as packing, partitioning, scheduling, load balancing, and virtual-circuit routing. Kolliopoulos and Stein [9] and Dinitz, Garg, and Goemans [4] developed algorithms improving the first approximation results of Kleinberg for the problem of minimizing the violation of edge capacities and for other variants. However, known techniques do not seem to be capable of providing solutions without also violating the cost constraint. We give the first approximation results with hard cost constraints. Moreover, all our results dominate the best known bicriteria approximations. Finally, we provide results on the hardness of approximation for several variants of the problem. Received: August 23, 2000 / Accepted: April 20, 2001?Published online October 2, 2001     

On Numerical Solution of Shape Inverse Problems

The new method is proposed for the numerical solution of a class of shape inverse problems. The size and the location of a small opening in the domain of integration of an elliptic equation is identified on the basis of an observation. The observation includes the finite number of shape functionals. The approximation of the shape functionals by using the so-called topological derivatives is used to perform the learning process of an artificial neural network. The results of computations for 2D examples show, that the method allows to determine an approximation of the global solution to the inverse problem, sufficiently closed to the exact solution. The proposed method can be extended to the problems with an opening of general shape and to the identification problems of small inclusions. However, the mathematical theory of the proposed approach still requires futher research. In particular, the proof of global convergence of the method is an open problem.     

基于反向传播神经网络的阻抗断层图像重建新方法

电阻抗成像是通过对物体表面电压、电流的测量来重建物体内部阻抗分布或变化图像的一种新颖计算机断层成像技术。阻抗断层图像重建是一种病态的、非线性的逆问题。提出了一种全新的阻抗断层图像重建方法，它利用反向传播神经网络来表征物体内部阻抗变化位置与物体表面电压变化大小的非线性映射关系，从而可以根据对物体表面测量电压的变化先准确定位阻抗变化区域，再用线性近似方法重建阻抗变化图像，这种方法不仅具有一定的抗噪能力，而且成像精度和空间分辨率都大大好于逆投影方法。     

基于模糊神经网络的自适应PID控制器

提出了一种应用于自适应PID控制器的神经网络与模糊控制相结合的算法,该算法可以有效地解决普通PID控制器依赖于对象的数学模型的缺点,可实现控制系统的在线自适应调整,可满足实时控制的要求。仿真结果表明,基于模糊神经网络整定的PID控制器具有较好的自学习和自适应性,具有较快的响应速度。     

基于BP网络分类器的交通标志识别

针对中国全部3大类116个交通标志,即禁令标志、指示标志、警告标志,用BP网络实现分类功能.实验中使用了3种测试集,即加高斯噪声、水平扭曲和日本交通标志实景图,对BP网络的分类性能进行了测试.实验结果表明:用BP网络实现交通标志粗分类功能的效果是比较理想的,对交通标志的颜色失真和形状失真均具有较好的容错性和鲁棒性.     

A multi-target approach for isolated word recognition using artificial neural network

I.TntroductionStatisticalandneuralnetworkmcthodsforpatternclassiflcationusesignificantlydifTerentapproachesintrainingaclassificr.Inthestatistica1approach,thcformationofaclassifier1arge1ydependsonthestatisticsofthetrainingpatternsand,insomecases,theassumptionsaboutthedistributionofthepopulation.Theneuralnetworkmethodisnon-parametricandcanbeadaptivcinthetrainingprocessl'l.Becauseofitssimplicityandflexibility,theneuralnetworkhasbecnincreasing1yusedforpatternclassiflcation.Itisnowwe11knownthatan…     

Spectral pattern recognition of improved voice quality

The self-organizing map (a neural network) was applied to the spectral pattern recognition of voice quality in 34 subjects: 15 patients operated on because of insufficient glottal closure and 19 subjects not treated for voice disorders. The voice samples, segments of sustained /a/, were perceptually rated by six experts. A self-organized acoustic feature map was first computed from tokens of /a/ and then used for the analysis of the samples. The locations of the samples on the map were determined and the distances from a normal reference were compared with the perceptual ratings. The map locations corresponded to the degree of audible disorder: the samples judged as normal were overlapping or close to the normal reference, whereas the samples judged as dysphonie were located further away from it. The comparison of pre- and postoperative samples of the patients showed that the perceived improvement of voice quality was also detected by the map.     

EXPONENTIAL STABILITY AND PERIODIC SOLUTION OF HYBRID BIDIRECTIONAL ASSOCIATIVE MEMORY NEURAL NETWORKS WITH DISCRETE DELAYS

In this paper, we study the existence, uniqueness, and the global exponential stability of the periodic solution and equilibrium of hybrid bidirectional associative memory neural networks with discrete delays. By ingeniously importing real parameters di > 0 (i = 1,2, …, n) which can be adjusted, making use of the Lyapunov functional method and some analysis techniques, some new sufficient conditions are established. Our results generalize and improve the related results in [9]. These conditions can be used both to design globally exponentially stable and periodical oscillatory hybrid bidirectional associative neural networks with discrete delays, and to enlarge the area of designing neural networks. Our work has important significance in related theory and its application.     

带有边集限制的最均匀支撑树问题

本在无向网络中，建立了带有边集限制的最均匀支撑树问题的网络模型．中首先解决最均匀支撑树问题，并给出求无向网络中最均匀支撑树的多项式时间算法；然后，给出了求无向网络中带有边集限制的最小树多项式时间算法；最后，在已解决的两个问题的基础上解决了带有边集限制的最均匀支撑树问题．     

Fuzzy Entropy： Axiomatic Definition and Neural Networks Model

The measure of uncertainty is adopted as a measure of information. The measures of fuzziness are known as fuzzy information measures. The measure of a quantity of fuzzy information gained from a fuzzy set or fuzzy system is known as fuzzy entropy. Fuzzy entropy has been focused and studied by many researchers in various fields. In this paper, firstly, the axiomatic definition of fuzzy entropy is discussed. Then, neural networks model of fuzzy entropy is proposed, based on the computing capability of neural networks. In the end, two examples are discussed to show the efficiency of the model.