Search

This paper is concerned with a multi-resolution tool for screening paper formation variations in various frequency regions on production line. A paper web is illuminated by two red diode lasers and the reflected light recorded as two time series of high resolution measurements constitute the input signal to the papermaking process monitoring system. The time series are divided into blocks and each block is analyzed separately. The task is treated as kernel based novelty detection applied to a multi-resolution time series representation obtained from the band-pass filtering of the Fourier power spectrum of the series. The frequency content of each frequency region is characterized by a feature vector, which is transformed using the canonical correlation analysis and then categorized into the inlier or outlier class by the novelty detector. The ratio of outlying data points, significantly exceeding the predetermined value, indicates abnormalities in the paper formation. The tools developed are used for online paper formation monitoring in a paper mill. [ABSTRACT FROM AUTHOR]

This paper is concerned with a multi-resolution tool for analysis of a time series aiming to detect abnormalities in various frequency regions. The task is treated as a kernel based novelty detection applied to a multi-level time series representation obtained from the discrete wavelet transform. Having a priori knowledge that the abnormalities manifest themselves in several frequency regions, a committee of detectors utilizing data dependent aggregation weights is build by combining outputs of detectors operating in those regions. [ABSTRACT FROM AUTHOR]

In certain classes of chemical reaction networks (CRN), there may be two stable states. The challenge is to find a model of the CRN such that the stability properties can be predicted. In this paper we consider the problem of building a P-system designed to simulate the CRN in an attempt to determine if the CRN is stable or bistable. We found that for the networks in [2] none of the bistable CRN would have a bistable P-system by stoichiometry alone. The reaction kinetics must be included in the P-system model; the implementation of which has been considered an open problem. In this paper we conclude that a P-system for a CRN in m reactants and n products has at most 2(m2 + mn) membranes and 6(m2 + mn) rules. This suggests that P-system models of a chemical reaction network, including both stoichiometry and reaction kinetics can be built. [ABSTRACT FROM AUTHOR]

A comprehensive view of speech and voice technologies is now demanding better and more complex tools amenable of extracting as much knowledge about sound and speech as possible. Many knowledge-extraction tasks from speech and voice share well-known procedures at the algorithmic level under the point of view of bio-inspiration. The same resources employed to decode speech phones may be used in the characterization of the speaker (gender, age, speaking group, etc.). Based on these facts the present paper examines a hierarchy of sound processing levels at the auditory and perceptual levels on the brain neural paths which can be translated into a bio-inspired audio-processing architecture. Through this paper its fundamental characteristics are analyzed in relation with current tendencies in cognitive audio processing. Examples extracted from speech processing applications in the domain of acoustic-phonetics are presented. These may find applicability in speaker's characterization, forensics, and biometry, among others. [ABSTRACT FROM AUTHOR]

This paper investigates a production planning problem in which the inventory is deteriorating at a constant rate, demand is price dependent and back-order is allowed. It is assumed in most previous works that back-ordering customers may not cancel their orders. However, in reality, many customers may withdraw or cancel their orders before receiving their orders. Tacking the cancellation phenomenon into account, this paper develops a continuous-time model to simultaneously determine the production decision and the selling price. A simple algorithm is used to obtain the optimal solutions. Numerical examples are also used to illustrate the solution searching procedure and the characteristics of the optimal decisions. [ABSTRACT FROM AUTHOR]

In this paper, we handle a negotiation method in which a main negotiation consists of multiple sub-negotiations. In items allocation for commerce, there are some risks on the trade because the market balance is determined by supply and demand. The result of main negotiation is also determined by the order of sub-negotiations and agents' behaviors since agents' budgets have limitations on the actual commercial trading. However, it is difficult to decide the order of negotiations, such as simultaneous decisions and rotations. In this paper, we give the trading model in such cases, that is, agents purchase items by pooled buying. In actual trading as pooled buying, items are sold by the volume discount. Concretely, we discuss joint-stock company and private limited partnership on the web. In the negotiation phase, an agent proposes pooled buying based on the number of items and their prices considering their budgets. The degree of risks is calculated. All agents can see the risks with each item. Agents cooperate to the proposing agent based on the degree of risks. In this paper, we give two scenarios for trading. One is to avoid free riders who get surplus without risks. Another one is to promote agents' participation to increase social surplus. For risk aversion and promoting cooperation, we employ the side-payment policy, that is, cooperative agents' risks are preserved to a minimum. Further, we give some discussions where agents must pay the negotiation costs and charge for storage. [ABSTRACT FROM AUTHOR]

This paper presents a new philosophy to model the behavior of a Student in a Tutorial-like system using Learning Automata (LA). The model of the Student in our system is inferred using a higher-level of LA, referred to Meta-LA, which attempt to characterize the learning model of the Students (or Student Simulators), while the latter use the Tutorial-like system. To our knowledge, this is the first published result which attempts to infer the learning model of an LA when it is treated externally as a black box, whose outputs are the only observable quantities. Additionally, our paper represents a new class of Multi-Automata systems, where the Meta-LA communicate with the Students, also modelled using LA, in a synchronous scheme of interconnecting automata. [ABSTRACT FROM AUTHOR]

A novel neural filter and its application to active control of nonlinear noise are proposed in this paper. This method helps to avoid the premature saturation of backpropagation algorithm; meanwhile, guarantees the system convergence by the proposed self-tuning method. The comparison between the conventional filtered-X least-mean-square (FXLMS) algorithm and proposed method for nonlinear broadband noise in active noise cancellation (ANC) system is also made in this paper. The proposed design method is very easy to be implemented and versatile to the other applications. Several simulation results show that the proposed method can effectively cancel the narrowband and nonlinear broadband noise in a duct. [ABSTRACT FROM AUTHOR]

Performance of a genetic algorithm for function optimization, often appeared in real-world applications, depends on its crossover operator strongly. Existing crossover operators are designed for intensive search in certain promising regions. This paper, first, discusses where the promising search regions are on the basis of some assumptions about the fitness landscapes of objective functions and those about a state of a population, and this discussion reveals that existing crossover operators intensively search some of the promising regions but not all of them. Then, this paper designs a new crossover operator for searching all of the promising regions. For utilizing the advantageous features of this crossover operator, a new selection model considering characteristic preservation is also introduced. Several experiments have shown the proposed method has worked effectively on various test functions. [ABSTRACT FROM AUTHOR]

Assembly design decision making is to provide a solution of currently violating design by evaluating assembly design alternatives with the consideration of the assembly design decision (ADD) criteria and of the causal interactions with manufacturing-environmental factors. Even though existing assembly design support systems have a systematic mechanism for determining the decision-criterion weight, the system still has a limitation to capture the interactions between manufacturing-environmental factors and ADD criteria. Thus, we introduce in this paper, Bayesian belief networks (BBN) for the representation and reasoning of the manufacturing-environmental knowledge. BBN has a sound mathematical foundation and reasoning capability. It also has an efficient evidence propagation mechanism and a proven track record in industry-scale applications. However, it is less friendly and flexible, when used for knowledge acquisition. In this paper, we propose a methodology for the indirect knowledge acquisition, using fuzzy cognitive maps, and for the conversion of the representation into BBN. [ABSTRACT FROM AUTHOR]

This paper proposes a context-based image retrieval system based on color, area, and perimeter intercepted lengths of segmented objects in an image. It characterizes the shape of an object by its area and the intercepted lengths obtained by intercepting the object perimeter by eight lines with different orientations passing through the object center, and the object color by its mean and standard deviation (STD). Recently, we reported that the color-shape based method (CSBM) is better than conventional color histogram (CCH) and fuzzy color histogram (FCH) in retrieving computer-generated images. However, its performance is only fair in the retrieval of natural images. For CSBM, object color is treated as uniform by reducing the number of colors in an image to only 27 colors. In this paper, we improve the performance by representing the color features of an object with its mean and STD. During the image retrieval stage, t-value is calculated based on the color features of two images, one in the query and the other in the database. The result shows that the proposed method achieves better performance in retrieving natural images compared to CCH, FCH, and CSBM. In the future, the proposed technique will be applied for the retrieval of digitized museum artifacts. [ABSTRACT FROM AUTHOR]

Several papers have already shown the interest of using multiple classifiers in order to enhance the performance of biometric person authentication systems. In this paper, we would like to argue that the core task of Biometric Person Authentication is actually a multiple classifier problem as such: indeed, in order to reach state-of-the-art performance, we argue that all current systems , in one way or another, try to solve several tasks simultaneously and that without such joint training (or sharing), they would not succeed as well. We explain hereafter this perspective, and according to it, we propose some ways to take advantage of it, ranging from more parameter sharing to similarity learning. [ABSTRACT FROM AUTHOR]

Traditional boosting method like adaboost, boosts a weak learning algorithm by updating the sample weights (the relative importance of the training samples) iteratively. In this paper, we propose to integrate feature re-weighting into boosting scheme, which not only weights the samples but also weights the feature elements iteratively. To avoid overfitting problem caused by feature re-weighting on a small training data set, we also incorporate relevance feedback into boosting and propose an interactive boosting called i.Boosting. It merges adaboost, feature re-weighting and relevance feedback into one framework and exploits the favorable attributes of these methods. In this paper, i.Boosting is implemented using Adaptive Discriminant Analysis (ADA) as base classifiers. It not only enhances but also combines a set of ADA classifiers into a more powerful one. A feature re-weighting method for ADA is also proposed and integrated in i.Boosting. Extensive experiments on UCI benchmark data sets, three facial image data sets and COREL color image data sets show the superior performance of i.Boosting over AdaBoost and other state-of-the-art projection-based classifiers. [ABSTRACT FROM AUTHOR]

Researchers have attempted to explain the power of Genetic Programming (GP) search using various notions of schema. However empirical studies of schemas have been limited due to their vast numbers in typical populations. This paper addresses the problem of analyzing schemas represented by tree-fragments. It describes a new efficient way of representing the huge sets of fragments in a population of GP programs and presents an algorithm to find all fragments using this efficient representation. Using this algorithm, the paper presents an initial analysis of fragments in populations of up to 300 programs, each up to seven nodes deep. The analysis demonstrates a surprisingly large variation in the numbers of fragments through evolution and a non-monotonic rise in the most useful fragments. With his method, empirical investigation of the GP building block hypothesis and schema theory in realistic sized GP systems becomes possible. [ABSTRACT FROM AUTHOR]

The Broadcast Language is a programming formalism devised by Holland in 1975, which aims at improving the efficiency of Genetic Algorithms (GAs) during long-term evolution. The key mechanism of the Broadcast Language is to allow GAs to employ an adaptable problem representation. Fixed problem encoding is commonly used by GAs but may limit their performance in particular cases. This paper describes an implementation of the Broadcast Language and its application to modeling biochemical networks. Holland presented the Broadcast Language in his book "Adaptation in Natural and Artificial Systems" where only a description of the language was provided, without any implementation. Our primary motivation for this work was the fact that there is currently no published implementation of the Broadcast Language available. Secondly, no additional examination of the Broadcast Language and its applications can be found in the literature. Holland proposed that the Broadcast Language would be suitable for the modeling of biochemical models. However, he did not support this belief with any experimental work. In this paper, we propose an implementation of the Broadcast Language which is then applied to the modeling of a signal transduction network. We conclude the paper by proposing that with some refinements it will be possible to use the Broadcast Language to evolve biochemical networks in silico. [ABSTRACT FROM AUTHOR]

Learning classifier systems have previously been shown to have some application in single-step tasks. This paper extends work in the area by applying the classifier system to progressively more complex multi-modal test environments, each with typical search space characteristics, convex/non-convex regions of high performance and complex interplay between variables. In particular, two test environments are used to investigate the effects of different degrees of feature sampling, parameter sensitivity, training set size and rule subsumption. Results show that XCSR is able to deduce the characteristics of such problem spaces to a suitable level of accuracy. This paper provides a foundation for the possible use of XCS as an exploratory tool that can provide information from conceptual design spaces enabling a designer to identify the best direction for further investigation as well as a better representation of their design problem through redefinition and reformulation of the design space. [ABSTRACT FROM AUTHOR]

This paper demonstrates that, with minimal modifications, a classifier system can be made to operate just as an ant colony optimizer does for solving the TSP. The paper contains a formal proof of this result, and suggests that the modifications made could be useful in other ways. In effect, the paper suggests that there may be a new role for classifier systems in optimization, inspired by the way that ant colony optimizers have achieved their successes. The paper also suggests that there may be ways suggested by classifier systems to modify ant colony optimization practice. [ABSTRACT FROM AUTHOR]

After two papers comparing ATNoSFERES with XCSM, a Learning Classifier System with internal states, this paper is devoted to a comparison between ATNoSFERES and ACS (an Anticipatory Learning Classifier System). As previously, we focus on the way perceptual aliazing problems encountered in non-Markov environments are solved with both kinds of systems. We shortly present ATNoSFERES, a framework based on an indirect encoding Genetic Algorithm which builds finite-state automata controllers, and we compare it with ACS through two benchmark experiments. The comparison shows that the difference in performance between both system depends on the environment. This raises a discussion of the adequacy of both adaptive mechanisms to particular subclasses of non-Markov problems. Furthermore, since ACS converges much faster than ATNoSFERES, we discuss the need to introduce learning capabilities in our model. As a conclusion, we advocate for the need of more experimental comparisons between different systems in the Learning Classifier System community. [ABSTRACT FROM AUTHOR]

It is a big challenge to guarantee the quality of association rules in some application areas (e.g., in Web information gathering) since duplications and ambiguities of data values (e.g., terms). Rough set based decision tables could be efficient tools for solving this challenge. This paper first illustrates the relationship between decision tables and association mining. It proves that a decision rule is a kind of closed pattern. It also presents an alternative concept of rough association rules to improve the quality of discovered knowledge in this area. The premise of a rough association rule consists of a set of terms (items) and a weight distribution of terms (items). The distinct advantage of rough association rules is that they contain more specific information than normal association rules. This paper also conducts some experiments to compare the proposed method with association rule mining and decision tables; and the experimental results verify that the proposed approach is promising. [ABSTRACT FROM AUTHOR]

Predicting the behavior of DNA molecules in vitro is one of the most fundamental issues on DNA computing, but is also known to be quite difficult. Shiozaki et al. proposed a probabilistic model that can simulate many features of biochemical experiments in terms of the reaction rate [7], although there are several differences between the biochemical experiments and the computational simulations on the model. In this paper, we extend the model to support base pairs construction among k DNA sequences, which plays an essential role in realizing branch migrations. The simulation results have much more similarities to the biochemical experiments results than ones on the previous model, which implies that the analysis of the model may give some insight about the reaction rate. Through the analysis, we conclude this paper by giving a guideline for designing DNA sequences that can quickly react. [ABSTRACT FROM AUTHOR]

Recently, the idea of spiking neurons and thus of computing by spiking was incorporated into membrane computing, and so-called spiking neural P systems (abbreviated SN P systems) were introduced. Very shortly, in these systems neurons linked by synapses communicate by exchanging identical signals (spikes), with the information encoded in the distance between consecutive spikes. Several ways of using such devices for computing were considered in a series of papers, with universality results obtained in the case of computing numbers, both in the generating and the accepting mode; generating, accepting, or processing strings or infinite sequences was also proved to be of interest. In the present paper, after a short survey of central notions and results related to spiking neural P systems (including the case when SN P systems are used as string generators), we contribute to this area with two (types of) results: (i) we produce small universal spiking neural P systems (84 neurons are sufficient in the basic definition, but this number is decreased to 49 neurons if a slight generalization of spiking rules is adopted), and (ii) we investigate the possibility of generating a language by following the trace of a designated spike in its way through the neurons. [ABSTRACT FROM AUTHOR]

This paper presents a coordination model, the Actor, Role and Coordinator (ARC) model, to address three main concerns inherent in a pervasive Open Distributed and Embedded (ODE) system: dynamicity, scalability, and stringent QoS requirements. The model treats a pervasive ODE system as a composition of concurrent computation and coerced coordination. In particular, concurrent computation is modeled as Actors, while coerced coordination specifies the system's QoS requirements by mapping them to coordination constraints. The coordination constraints are transparently imposed on actors through message manipulations, which are carried out by the roles and coordinators. The coordinators are responsible for the coordination among roles, while the roles in our model provide abstractions for coordinated behaviors that may be shared by multiple actors and further assume local coordination responsibilities for the actors playing the roles. The role's behavior abstraction decouples the syntactic dependencies between the coordinators and the actors, thus shielding the coordinator layer from the dynamicity of underlying actors inherent in ODE systems. This paper also formally defines the role and coordinator behaviors and the composition of the actor computation model with the proposed coerced coordination model. Our formal study has shown that the ARC system is closed under composition and recursion. [ABSTRACT FROM AUTHOR]

Enabling coordination among ubiquitous computing applications and resources requires programming abstractions and development tools tailored to this unique environment. This paper introduces a suite of coordination abstractions that enables expressive interaction between ubiquitous computing applications and dynamically available resources. In our model, applications express their coordination needs in terms of application sessions that are loosely defined by a set of interactions with remote resources. Our approach allows developers to delegate responsibility for the construction and maintenance of the communication links necessary to support the application's sessions to an underlying middleware. In this paper, we formalize a suite of session definitions for coordination in general classes of ubiquitous computing applications. We also present a middleware based on this coordination model that directly supports the software development task. Finally, we demonstrate the simplicity and flexibility of our approach using a real-world application. [ABSTRACT FROM AUTHOR]

In this paper we present the application of the inductive database approach to two practical analytical case studies: Web usage mining in Web logs and financial data. As far as concerns the Web domain, we have considered the enriched XML Web logs, that we call conceptual logs, produced by specific Web applications. These ones have been built by using a conceptual model, namely WebML, and its accompanying CASE tool, WebRatio. The Web conceptual logs integrate the usual information about user requests with meta-data concerning the Web site structure. As far as concerns the analysis of financial data, we have considered the trade stock exchange index Dow Jones and studied its component stocks from 1997 to 2002 using the so-called technical analysis. Technical analysis consists in the identification of the relevant (graphical) patterns that occur in the plot of evolution of a stock quote as time proceeds, often adopting different time granularities. On the plots the correlations between distinctive variables of the stocks quote are pointed out, such as the quote trend, the percentage variation and the volume of the stocks exchanged. In particular we adopted candle-sticks, a figurative pattern representing in a condensed diagram the evolution of the stock quotes in a daily stock exchange. In technical analysis, candle-sticks have been frequently used by practitioners to predict the trend of the stocks quotes in the market. We then apply a data mining language, namely MINE RULE, to these data in order to identify different types of patterns. As far as Web data is concerned, recurrent navigation paths, page contents most frequently visited, and anomalies such as intrusion attempts or a harmful usage of the resources are among the most important patterns. As far as concerns the financial domain, we searched for the sets of stocks which frequently exhibited a positive daily exchange in the same days, so as to constitute a collection of quotes for the constitution of the customers' portfolio, or the candle-sticks frequently associated to certain stocks, or finally the most similar stocks, in the sense that they mostly presented in the same dates the same typology of candle-stick, that is the same behaviour in time. The purpose of this paper is to show that the exploitation of the nuggets of information embedded in the data and of the specialised mining constructs provided by the query languages, enables the rapid customization of the mining procedures following to the users' need. Given our experience, we also claim that the use of queries in advanced languages, as opposed to ad-hoc heuristics, eases the specification and the discovery of a large spectrum of patterns. [ABSTRACT FROM AUTHOR]

Constraints-based mining languages are widely exploited to enhance the KDD process. In this paper we propose a novel incremental approach to extract itemsets and association rules from large databases. Here incremental is used to emphasize that the mining engine does not start from scratch. Instead, it exploits the result set of previously executed queries in order to simplify the mining process. Incremental algorithms show several beneficial features. First of all they exploit previous results in the pruning of the itemset lattice. Second, they are able to exploit the mining constraints of the current query in order to prune the search space even more. In this paper we propose two incremental algorithms that are able to deal with two — recently identified — types of constraints, namely item dependent and context dependent ones. Moreover, we describe an algorithm that can be used to extract association rules from scratch in presence of context dependent constraints. [ABSTRACT FROM AUTHOR]

Many researchers in our community (this author included) regularly emphasize the role constraints play in improving performance of data-mining algorithms. This emphasis has led to remarkable progress - current algorithms allow an incredibly rich and varied set of hidden patterns to be efficiently elicited from massive datasets, even under the burden of NP-hard problem definitions and disk-resident or distributed data. But this progress has come at a cost. In our single-minded drive towards maximum performance, we have often neglected and in fact hindered the important role of discovery in the knowledge discovery and data-mining (KDD) process. In this paper, I propose various strategies for applying constraints within algorithms for itemset and rule mining in order to escape this pitfallMy use of the informal "I" rather than the typical "we" is to emphasize this paper is a personal position statement, along with a view of existing research in light of my position.. [ABSTRACT FROM AUTHOR]

This paper presents a middleware system for multi-agents on a distributed system as a general test-bed for bio-inspired approaches. The middleware is unique to other approaches, including distributed object systems, because it can maintain and migrate a dynamic federation of multiple agents on different computers. It enables each agent to explicitly define its own deployment policy as a relocation between the agent and another agent. This paper describes a prototype implementation of the middleware built on a Java-based mobile agent system and its practical applications that illustrates the utility and effectiveness of the approach in real distributed systems. [ABSTRACT FROM AUTHOR]

Resource replication is a crucial technique for improving system performance of distributed applications with shared resources. A larger number of replicas require shorter time to reach a replica of the requested resource, but consume more storage of hosts. Therefore, it is indispensable to adjust the number of replicas appropriately for its application. This paper considers the problem for controlling the density of replicas adaptively in dynamic networks. The goal of the problem is to adjust the number of replicas to a constant fraction of the current network size. This paper proposes algorithm inspired by the single species population model, which is a well-known population ecology model. The simulation results show that the proposed algorithm realize self-adaptation of the replica density in dynamic networks. [ABSTRACT FROM AUTHOR]

This paper describes how a distributed neural architecture for the general control of robots has been applied for the generation of a walking behaviour in the Aibo robotic dog. The architecture described has been already demonstrated useful for the generation of more simple behaviours like standing or standing up. This paper describes specifically how it has been applied to the generation of a walking pattern in a quadruped with twelve degrees of freedom, in both simulator and real robot. The main target of this paper is to show that our distributed architecture can be applied to complex dynamic tasks like walking. Nevertheless, by showing this, we also show how a completely neural and distributed controller can be obtained for a robot as complex as Aibo on a task as complex as walking. This second result is by itself a new and interesting one since, to our extent, there are no other completely neural controllers for quadruped with so many DOF that allow the robot to walk. Bio-inspiration is used in three ways: first we use the concept of central pattern generators in animals to obtain the desired walking robot. Second we apply evolutionary processes to obtain the neural controllers. Third, we seek limitations in how real dogs do walk in order to apply them to our controller and limit the search space. [ABSTRACT FROM AUTHOR]

An all-optical neural network based on coupled ring lasers is proposed in this paper. Each laser in the network has a different wavelength, representing one neuron. The network status is determined by the wavelength of the network's light output. Inputs to the network are in the optical power domain. The nonlinear threshold function required for neural-network operation is achieved optically by interaction between the lasers. A simple laser model developed in the paper has illuminated the behavior of the coupled lasers. An experimental system is implemented using single mode fiber optic components at wavelengths near 1550 nm. A number of functions are implemented to demonstrate the practicality of the new network. From the experiment, a conclusion can be obtained that the neural network is particularly robust against input wavelength variations. [ABSTRACT FROM AUTHOR]

This paper proposes a reconfigurable architecture for VLSI implementation of BP neural networks with on-chip learning. Basing on systolic arrays, this architecture can flexibly adapt to neural networks with different scales, transfer functions or learning algorithms by reconfiguration of basic processing components,. Three kinds of reconfigurable processing units (RPU) are proposed firstly basing on the analysis of neural network's reconfiguration. Secondly, the paper proposes a reconfigurable systolic architecture and the method of mapping BP networks into this architecture. The implementation of an instance on FPGA is introduced in the last. The results show that this flexible architecture can also achieve a high learning speed of 432M CUPS (Connection Updated Per Second) at 100MHz using 22 multipliers. [ABSTRACT FROM AUTHOR]

In this paper there is a natural language interface presented, which consists of the intelligent mechanisms of human identification, speech recognition, word and command recognition, command syntax and result analysis, command safety assessment, technological process supervision as well as human reaction assessment. In this paper there is also a review of the selected issues on recognition of speech commands in natural language given by the operator of the technological device. A view is offered of the complexity of the recognition process of the operator's words and commands using neural networks made of a few layers of neurons. The paper presents research results of speech recognition and automatic recognition of commands in natural language using artificial neural networks. [ABSTRACT FROM AUTHOR]

New applications of artificial neural networks are capable of recognition and verification of effects and safety of commands given by the operator of the technological device. In this paper there is a review of the selected issues on estimation of results and safety of the operator's commands as well as supervision of the technological process. A view is offered of the complexity of effect analysis and safety assessment of commands given by the operator using neural networks. The first part of the paper introduces a new concept of modern supervising systems of the technological process using a natural language human-machine interface and discusses the general topics and issues. The second part is devoted to a discussion of more specific topics of the automatic command verification that have led to interesting new approaches and techniques. [ABSTRACT FROM AUTHOR]

It is well known, the Job-Shop Scheduling Problem (JSSP) is the most complicated and typical problem of all kinds of production scheduling problems, the allocation of resources over time to perform a collection of tasks. The current method has several shortcomings in solving the JSSP. In this paper, we correct these deficiencies by introducing a dynamic model that is based on an analysis of the run-time behavior of CSANN algorithm. At the same time, this paper proposes several new heuristics in order to improve the performance of CSANN. The computational simulations have shown that the proposed hybrid approach has good performance with respect to the quality of solution and the speed of computation. [ABSTRACT FROM AUTHOR]

As more and more industries experience the globalization of business activities, measuring productivity performance has become an area of concern for companies and policy makers in Europe, the United States, Japan and so on. A novel way about nonlinear regression modeling of high-technology manufacturing (HTM) productivity with the support vector machines (SVM) is presented in this paper. Optimization of labor productivity (LP) is also presented in this paper, which is based on chaos and uses the SVM regression model as the objective function. [ABSTRACT FROM AUTHOR]

In this paper posture control of a human arm in the sagittal plane is investigated by means of model simulations. The arm is modeled by a nonlinear neuromusculoskeletal model with two degrees of freedom and six muscles. A multilayer perceptron network is used in this paper, and effectively adapted by Levenberg-Marquardt training algorithm. The duration of next movement is regulated according as current feedback states. Simulation Results indicate that this method can maintain two joints at different location in allowable bound. The control scheme provides novel insight into neural prosthesis control and robotic control. [ABSTRACT FROM AUTHOR]

In this paper, we aim to address the cell phase identification problem, and two important aspects, the feature extraction methods and the classifier design, are discussed. In our study, we first propose extracting high frequency information of different orientations using Steerable filters. Next, we employ a multi-layer neural network using the back-propagation algorithm to replace K-Nearest Neighbor (KNN) classifier which has been implemented in the Cellular Image Quantitator (CELLIQ) system [3]. Experimental results provide a comparison between the proposed steerable filter features and existing regular features which have been used in published papers [3, 5]. From the comparison, it can be concluded that Steerable filter features can effectively represent the cells in different phases and improve the classification accuracy. Neural network also has a better performance than KNN currently deployed in CELLIQ system [3]. [ABSTRACT FROM AUTHOR]

Many interaction data still exist only in the biomedical literature and they require much effort to construct well-structured data. Discovering useful knowledge from large collections of papers is becoming more important for efficient biological and biomedical researches as genomic research advances. In this paper, we present a relation kernel-based interaction extraction method to extract knowledge efficiently. We extract protein interactions of from text documents with relation kernel and Yeast was used as an example target organism. Kernel for relation extraction is constructed with predefined interaction corpus and set of interaction patterns. The proposed method only exploits shallow parsed documents. Experimental results show that the proposed kernel method achieves a recall rate of 79.0% and precision rate of 80.8% for protein interaction extraction from biomedical document without full parsing efforts. [ABSTRACT FROM AUTHOR]

In self and non-self discrimination (SNSD) model, it is very important to generate a desirable detector set since it decides the performance and scale of the SNSD model based task. By using the famous principle of negative selection in natural immune system, a novel generating algorithm of detector, multiple-point bit mutation method, is proposed in this paper. It utilizes random multiple-point mutation to look for non-self detectors in a large range in the whole space of detectors, such that we can obtain a required detector set in a reasonable computation time. This paper describes the work procedure of the proposed detector generating algorithm. We tested the algorithm by using many datasets and compared it with the Exhaustive Detector Generating Algorithm in details. The experimental results show that the proposed algorithm outperforms the Exhaustive Detector Generating Algorithm both in computational complexities and detection performance. [ABSTRACT FROM AUTHOR]

This paper addresses the important issues of error control for video transmission over 3G, considering the fact that wireless video delivery faces the huge challenge of the high error rate and time variability in wireless channel. This paper proposes a real world statistics based event-trigger bit error rate (BER) model, which can describe and handle the time-varying wireless channel error characteristics better. Moreover, a recurrent neural network is employed to decide the state transfer as a mechanism. Simulation results and comparisons demonstrate effectiveness and efficiency of the proposed method in term of visual performance and transmission efficiency over a variety of wireless channel conditions. [ABSTRACT FROM AUTHOR]

The recommendation G.728 depends on the Levinson-Durbin (L-D) algorithm to update its gain filter coefficients. In this paper, it is contrasted with BP neural network method. Because quantizer has not existed at optimizing gain filter, the quantization SNR can not be used to evaluate its performance. This paper proposes a scheme to estimate SNR so that gain predictor can be separately optimized with quantizer. Using BP neural network filter, the calculation quantity is only 6.7 percent of L-D method's and its average segment SNR is about 0.156dB higher than G.728. It is also used to evaluate the case that excitation vector is 16 or 20 samples, respectively, the BP neural network algorithm has similarly good result. [ABSTRACT FROM AUTHOR]

This paper proposes a hybrid neural network model based on the Generalized Learning Vector Quantization(GLVQ) learning algorithm and applies this proposed method to the BIT system of More-Electric Aircraft Electrical Power System (MEAEPS). This paper first discusses the feasibility of application unsupervised neural networks to the BIT system and the representative Generalized LVQ (GLVQ) neural network is selected due to its good performance in clustering analysis. Next, we adopt a new form of loss factor to modify the original GLVQ algorithm in order to make it more suitable for our application. Since unsupervised networks cannot distinguish the similar classes, we add a LVQ layer to the GLVQ network to construct a hybrid neural network model. Finally, the proposed method has been applied to the intelligent BIT system of the MEAEPS, and the results show that the proposed method is promising to improve the performance of the BIT system. [ABSTRACT FROM AUTHOR]

This paper presents a power system stabilizer design that uses a generalized minimum variance-inverse dynamic neuro controller, which is the combination of the inverse dynamic neural model, the generalized minimum variance, and the neuro compensator. An inverse dynamic neural model represents the inverse dynamics of the system. The inverse dynamic neural model is trained to provide control input into the system, which makes the plant output reach the target value at the next sampling time. Once the inverse dynamic neural model is trained, it does not require retuning for cases with other types of disturbances. In this paper, a generalized minimum variance control scheme is adapted to prevent unstable system performance caused by non-minimum phase characteristics. In addition, a neural compensator is designed to compensate for modeling errors. The proposed control scheme is tested in a multimachine power system. [ABSTRACT FROM AUTHOR]

The distribution system problems, such as planning, loss minimization, and energy restoration, usually involve the phase balancing or network reconfiguration procedures. The determination of an optimal phase balance is, in general, a combinatorial optimization problem. This paper proposes optimal reconfiguration of the phase balancing using the neural network, to switch on and off the different switches, allowing the three phases supply by the transformer to the end-users to be balanced. This paper presents the application examples of the proposed method using the real and simulated test data. [ABSTRACT FROM AUTHOR]

Electric Power Load Forecasting is important for the economic and secure operation of power system, and highly accurate forecasting result leads to substantial savings in operating cost and increased reliability of power supply. Conventional load forecasting techniques, including time series methods and stochastic methods, are widely used by electric power companies for forecasting load profiles. However, their accuracy is limited under some conditions. In this paper, neural networks have been successfully applied to load forecasting. Forecasting model with Neural Networks is set up based on the analysis of the characteristics of electric power load, and it works well even with rapidly changing weather conditions. This paper also proposes a novel method to improve the generalization ability of the Neural Networks, and this leads to further increasing accuracy of load forecasting. [ABSTRACT FROM AUTHOR]

In this paper, we propose a grasping control method for robot hand using fuzzy theory and partially- linearized neural network. The robot hand has Double-Octagon Tactile Sensor (D.O.T.S), which has been proposed in our previous papers, to detect grasping force between the grasped object and the robot fingers. Because the measured forces are fluctuant due to the measuring error and vibration of the hand, the tactile information is ambiguous. In order to quickly control the grasping force to prevent the grasped object sliding out off the robot fingers, we apply the possibility theory to deal with the ambiguous problem of the tactile information, and use the partially- linearized neural network (P.L.N.N) to construct a fuzzy neural network. The method proposed in this paper is verified by applying it to practical grasping control of breakable objects, such as eggs, fruits, etc. [ABSTRACT FROM AUTHOR]

This paper considers the problem of PD control of overhead crane in the presence of uncertainty associated with crane dynamics. By using radial basis function neural networks, these uncertainties can be compensated effectively. This new neural control can resolve the two problems for overhead crane control: 1) decrease steady-state error of normal PD control. 2) guarantee stability via neural compensation. By Lyapunov method and input-to-state stability technique, we prove that these robust controllers with neural compensators are stable. Real-time experiments are presented to show the applicability of the approach presented in this paper. [ABSTRACT FROM AUTHOR]

A novel least squares support vector machines based on Mexican hat wavelet kernel is presented in the paper. The wavelet kernel which is admissible support vector kernel is characterized by its local analysis and approximate orthogonality, and we can well obtain estimates for regression by applying a least squares wavelet support vector machines (LS-WSVM). To test the validity of the proposed method, this paper demonstrates that LS-WSVM can be used effectively for the identification and adaptive control of nonlinear dynamical systems. Simulation results reveal that the identification and adaptive control schemes suggested based on LS-WSVM gives considerably better performance and show faster and stable learning in comparison to neural networks or fuzzy logic systems. LS-WSVM provides an attractive approach to study the properties of complex nonlinear system modeling and adaptive control. [ABSTRACT FROM AUTHOR]

Presented in this paper is neural network based adaptive control for a class of affine nonlinear systems in the strict-feedback form with unknown nonlinearities. A popular recursive design methodology - backstepping is employed to systematically construct feedback control laws and associated Lyapunov functions. The significance of this paper is to make best use of available signals, avoid unnecessary parameterization, and minimize the node number of neural networks as on-line approximators. The design assures that all the signals in the closed loop are semi-globally uniformly, ultimately bounded and the outputs of the system converges to a tunable small neighborhood of the desired trajectory. Novel parameter tuning algorithms are obtained on a more practical basis. [ABSTRACT FROM AUTHOR]

In this paper, the topic of fractional order digital differentiators (FODD) is designed using neural networks approximation method. First, FODD amplitude response is given in the form of sum of exponential basis functions. Then, the exponential basis function neural network is used to approximate FODD amplitude response. Finally, some examples compared with others' method are given to illustrate the advantages of this paper approach. [ABSTRACT FROM AUTHOR]