17743297
A Gradient BYY Harmony Learning Algorithm on Mixture of Experts for Curve Detection
Curve detection is a basic problem in image processing and has been extensively studied in the literature. However, it remains a difficult problem. In this paper, we study this problem from the Bayesian Ying-Yang (BYY) learning theory via the harmony learning principle on a BYY system with the mixture of experts (ME). A gradient BYY harmony learning algorithm is proposed to detect curves (straight lines or circles) from a binary image. It is demonstrated by the simulation and image experiments that this gradient algorithm can not only detect curves against noise, but also automatically determine the number of straight lines or circles during parameter learning.
6431369
A Neural Network Approach to Real-Time Pattern Recognition
This paper presents a new neural network approach to real-time pattern recognition on a given set of binary (or bipolar) sample patterns. The perceptive neuron of a binary pattern is defined and constructed as a binary neuron with a neighborhood perceptive field. Letting its hidden units be the respective perceptive neurons of the patterns, a three-layer forward neural network is constructed to recognize these patterns with minimum error probability in a noisy environment. The theoretical and simulation analyses show that the network is effective for pattern recognition and can be under strict real-time constraints.
370694
Further Results on the Asymptotic Memory Capacity of the Generalized Hopfield Network
This paper presents a further theoretical analysis on the asymptotic memory capacity of the generalized Hopfield network (GHN) under the perceptron learning scheme. It has been proved that the asymptotic memory capacity of the GHN is exactly 2(n− 1), where n is the number of neurons in the network. That is, the GHN of n neurons can store 2(n− 1) bipolar sample patterns as its stable states when n is large, which has significantly improved the existing results on the asymptotic memory capacity of the GHN.
361698
The Mahalanobis Distance Based Rival Penalized Competitive Learning Algorithm
The rival penalized competitive learning (RPCL) algorithm has been developed to make the clustering analysis on a set of sample data in which the number of clusters is unknown, and recent theoretical analysis shows that it can be constructed by minimizing a special kind of cost function on the sample data. In this paper, we use the Mahalanobis distance instead of the Euclidean distance in the cost function computation and propose the Mahalanobis distance based rival penalized competitive learning (MDRPCL) algorithm. It is demonstrated by the experiments that the MDRPCL algorithm can be successful to determine the number of elliptical clusters in a data set and lead to a good classification result.
26305122
The Stability of the Generalized Hopfield Networks in Randomly Asynchronous Mode
We present a study on the stability of the generalized Hopfield network in randomly asynchronous mode. First, the stability is investigated from the state space of the network. We introduce a concept of hole and define two kinds of stability in randomly asynchronous mode. By mathematical inductive method, we have proved that a generalized Hopfield network with non negative weights is strictly stable, that is, the network evolves to a simple hole-stable state with probability one when it starts at any initial state. For the general case, we made the simulation experiments on the networks with the number of neurons from 5 to 10. The empirical results have shown that almost any generalized Hopfield network with simple holes is strictly stable. Copyright 1997 Elsevier Science Ltd.
1465121
MFCC and SVM Based Recognition of Chinese Vowels
The recognition of vowels in Chinese speech is very important for Chinese speech recognition and understanding. However, it is rather difficult and there has been no efficient method to solve it yet. In this paper, we propose a new approach to the recognition of Chinese vowels via the support vector machine (SVM) with the Mel-Frequency Cepstral Coefficients (MFCCs) as the vowel’s features. It is shown by the experiments that this method can reach a high recognition accuracy on the given vowels database and outperform the SVM with the Linear Prediction Coding Cepstral (LPCC) coefficients as the vowel’s features.
19569352
Peer Collaboration Modes and Private Room Services in TOMSCOP
This paper presents the implementation of peer group management services in a pure P2P groupware framework called TOMSCOP (technology of multiuser synchronous collaboration platform). To support a variety of computer-based collaborative activities and styles, a user in a group can be assigned a role or identity such as a discusser peer, a chair peer, a presenter peer, a player peer, or an observer peer-Based on the above identities and their control service, we developed three collaboration modes, i.e., discussion mode, presentation mode and rotation mode, for smoothly manipulating shared applications in their different usages. Moreover we designed and implemented the public and private room services for users to create suitable collaboration rooms that match theirs privacy requirements. These modes and services not only provide more functions to TOMSCOP users, but also support software developers for easily and flexibly making P2P shared applications with different purposes
892651
A genetic algorithm for optimal 3-connected telecommunication network designs
In this paper, a genetic algorithm for three connected telecommunication network designs is proposed. The genetic algorithm uses a new approach to solution representation, in which constraints such as diameter and connectivity constraints can be easily encoded and two-point crossover with the operation of swapping duplicated nodes ensures solutions generated through genetic evolution are all feasible so that both checking of the constraints and repair mechanism can be avoided. Both efficiency and effectiveness are increased due to no checking of the constraints and no repair mechanism conducted. In fact, our design algorithm for three-connected network design can he extended to a high-connectivity network design.
206840605
The design and implementation of a distributed Web document database
Distance learning has become a very important mechanism for virtual university operation. In order to realize such an operation smoothly, it is necessary to consider distance learning from three perspectives: administration, awareness, and assessment. We are currently implementing a virtual university environment according to these guidelines. In this paper, we propose a new Web documentation database as a supporting environment of the Multimedia Micro-University project. The design of this database facilitates a Web documentation development paradigm that we have proposed earlier. From a script description, to its implementation as well as testing records, the database and its interface allow the user to design Web documents as virtual courses to be used in a Web-savvy virtual library. The database supports object reuse and sharing, as well as referential integrity and concurrence. In order to allow real-time course demonstration, i.e. also propose a simple course distribution mechanism, which allows the pre-broadcast of course materials. The System is implemented as a three-tier architecture which runs under MS Windows and other platforms.
2749728
Interval-valued statistical modeling of oxide chemical-mechanical polishing
Technology-oriented tools provide the raw data needed to optimize the fabrication process itself, and to predict problematic variational impacts on silicon design. Unfortunately, even in these physics-oriented tools, statistically uncertain quantities appear as crucial inputs. To date, Monte Carlo techniques have been the dominant solution method. We suggest an alternative in which uncertainties are represented as correlated intervals, and interval-valued computations replace the standard scalar operations in the numerical algorithm for the tool. We use an oxide chemical-mechanical polishing tool as an example, and show how to "retrofit" workable statistical models on top of the original algorithm. Accuracies to within /spl sim/1-10% of Monte Carlo simulation, and speedups of /spl sim/10-100X can be achieved, depending on whether we choose a formulation which emphasizes accuracy, or efficiency.
12844525
A distributed Web document database and its supporting environment
We propose a new Web documentation database as a supporting environment of the Multimedia Micro-University project. The design of this database facilitates a Web documentation development paradigm that we have proposed earlier. From a script description to its implementation as well as testing records, the database and its interface allow the user to design Web documents as virtual courses to be used in a Web-savvy virtual library. The database supports object reuse and sharing, as well as referential integrity and concurrence. In order to allow real-time course demonstration, we also propose a simple course distribution mechanism, which allows the pre-broadcast of course materials. The system is implemented as a three-tier architecture which runs under MS Windows and other platforms.