In this paper a recurrent network, which consists of O(√mlogm) RBF (radial basis functions) units with maximum norm employing any activation function that has different values in at least two nonnegative points, is c...
详细信息
Musical patterns that recur in approximate, rather than identical, form within the body of a musical work are considered to be of considerable importance in music analysis. Here we consider the "evolutionary chai...
详细信息
the growing demand for more efficient and effective healthcare services, coupled with an implicit requirement for supporting citizen mobility and continuity of care, is currently setting the stage for the exploitation...
详细信息
Multilayer artificial neural networks (ANN) are often used for the solution of classification problems or for the time series forecasting. An appropriate number of learning and testing patterns must be available for t...
详细信息
ISBN:
(纸本)3540413480
Multilayer artificial neural networks (ANN) are often used for the solution of classification problems or for the time series forecasting. An appropriate number of learning and testing patterns must be available for the ANN training. Each training pattern is composed of n input parameters and m output parameters. Number m is usually given by the problem formulation, but the number n may be often selected from a greater set of input parameters. An optimal selection of input parameters is a very important task especially in a situation when the number of usable input parameters is great and the analytical relations between the input and output parameters are not known. the number of neurons in all ANN layers must be generally kept as small as possible because of the optimal generalisation ability. In this paper we present a possible way for the selection of significant input parameters (the so called "markers"), which are the most important ones from the point of view of influence on the output parameters. these parameters are later used for the training of ANN. A statistical approach is usually used for this reason [5]. After some experience in the ANN application we recognised that the approach based on mathematical logic, i. e. the GUHA method (General Unary Hypotheses Automaton) is also suitable for the determination of markers. Besides the minimisation of the number of elements in the input layer of ANN, also the number of neurons in hidden layers must be optimised. For this reason standard methods of pruning can be used, described e. g. in [1]. We have used this method in the following applications: – Optimisation of the intervals between the major overhaul of plane engines by the analysis of tribodiagnostic data. Only selected types of chemical pollution in oil can be taken into account.– Prediction of bleeding of patients with chronic lymphoblastic leukemia. Only a part of parameters about the patient is important from this point of view (see [2]).– Optimisati
In this paper the notion of quantum finite one-counter automata (QF1CA) is introduced. Introduction of the notion is similar to that of the 2-way quantum finite state automata in [1]. the well-formedness conditions fo...
详细信息
ISBN:
(纸本)354066694X
In this paper the notion of quantum finite one-counter automata (QF1CA) is introduced. Introduction of the notion is similar to that of the 2-way quantum finite state automata in [1]. the well-formedness conditions for the automata are specified ensuring unitarity of evolution. A special kind of QF1CA, called simple, that satisfies the well-formedness conditions is introduced. that allows specify rules for constructing such automata more naturally and simpler than in general case. Possible models of language recognition by QF1CA are considered. the recognition of some languages by QF1CA is shown and compared with recognition by probabilistic counterparts.
the proceedings contain 37 papers. the special focus in this conference is on trends in theory and Core Technologies. the topics include: Quantum challenges;stability of approximation algorithms for hard optimization ...
ISBN:
(纸本)354066694X
the proceedings contain 37 papers. the special focus in this conference is on trends in theory and Core Technologies. the topics include: Quantum challenges;stability of approximation algorithms for hard optimization problems;algorithms on compressed strings and arrays;WWW based collaboration withthe BSCW system;middleware and quality of service;dynamic reconfiguration of CORBA-based applications;fast, error correcting parser combinators;java based business components, and new tools to develop applications;databases and the world wide web;exploiting formality in software engineering;biomolecular computing and programming;software change and evolution;distributed simulation with cellular automata;supporting group-by and pipelining in bitmap-enabled query processors;on interactive computation;coherent concepts, robust learning;application of artificial neural networks for different engineering problems;a new structure for pattern matching;principles of forecasting;quantum finite multitape automata;decomposable bulk synchronous parallel computers;component change and version identification in SOFA;pattern equations and equations with stuttering;garbage collection for mobile and replicated objects;randomized gossiping by packets in faulty networks;simulation problems for one-counter machines;on semantics of petri nets over partial algebra;towards possibilistic decision functions with minimum-based sugeno integrals;quantum finite one-counter automata;a performance comparison of mobile agents and RPC;cyclic cutwidth of the mesh;some afterthoughts on hopfield networks;a persistent-set approach to abstract state-space construction in verification;computational power of neuroidal nets and cellular automata with dynamically reconfigurable buses.
Compiler writers have always heavily relied on tools: parser generators for generating parsers out of context free grammars, attribute grammar systems for generating semantic analyzers out of attribute grammars, and s...
ISBN:
(纸本)354066694X
Compiler writers have always heavily relied on tools: parser generators for generating parsers out of context free grammars, attribute grammar systems for generating semantic analyzers out of attribute grammars, and systems for generating code generators out of descriptions of machine architectures. Since designing such special formalisms and constructing such tools deals with one of the most important issues in computerscience, courses on compiler construction have always formed part of the core computerscience curriculum.
In the present paper we investigate four relatively independent issues, which complete our knowledge regarding the computational aspects of popular Hopfield nets. In Section 2 of the paper, the computational equivalen...
详细信息
this talk will give an overview of an interdisciplinary research project being developed at the University of Memphis, led by a team of computer scientists, psychologists, and educators. the project's goal is to r...
详细信息
暂无评论