In this paper, we present a novel system which automat-ically converts text documents into XML by using machine-learningtechniques. In the first phase, the system uses the Self-OrganizingMap (SOM) algorithm to arrange marked-up documents on a two-dimensional map such that the documents similar in content appearcloser to each other. In the second phase, it then uses the induc...

We consider a queueing network in which there are constraints on which queues may be served simultaneously; such networks may be used to model input-queued switches and wireless networks. The scheduling policy for such a network specifies which queues to serve at any point in time. We consider a family of scheduling policies, related to the maximum-weight policy of Tassiulas and Ephremides [IEE...

Work ow processes are long duration activities and therefore it is not possible to apply the well accepted correctness techniques of transactions directly to work ow systems In this paper we rst mention the correctness problems of work ow systems and then exploit the available seman tics in work ow speci cation in the form of data and serial control ow dependencies to de ne isolation units We s...

A t ransform is introduced that maps cellular automata and discrete neural networks to dynamical systems on the unit interval. This transform is a topological conjugacy except at countably many points. In many cases, it gives rise to continuous full conjugates , in which case the transform preserves entropy. The transform also allows transfer of many dynamical properties of continuous systems t...

A f ramework for t r a n s l a t i n g speake r ' s meaning or intention is proposed based on two notions, Illocutionary Force Types (IFTs) for analysis and Decision Parameters (DPs) for g e n e r a t i o n . IFTs are a c e r t a i n k i n d of classification of utterances concerning speaker's meaning. DPs present background information of language use in order to derive an appropriate expressi...

A system, ca l l ed GAP, which automat ica l ly produces LISP func t ions from example computations is descr ibed. GAP uses a knowledge of LISP programming to i n d u c t i v e l y i n f e r the LISP f u n c t i o n 'obviously ' intended by a given ' i o p a i r ' ( i . e . a s ing le input to be presented to the f u n c t i o n and the output which must r e s u l t ) . The system is w r i t t ...

Many of the current automatic differentiation (AD) tools have similar characteristics. Unfortunately, it is often the case that the similarities between these various AD tools can not be easily ascertained by reading the corresponding documentation. To clarify this situation, a taxonomy of AD tools is presented. The taxonomy places AD tools into the Elemental, Extensional, Integral, Operational...

A genetic algorit hm is proposed for the training and construction of a multilayer perceptron. The genetic algorit hm works on a layer-by-layer basis. For each layer, it automat ically chooses the number of neurons required, computes the synaptic weights between the present layer of neurons and the next layer, and gives a set of training patterns for the succeeding layer. The algorithm presente...

Large real-world graphs often show interesting properties, such as power-law degree distributions and very small diameters. Discovering such patterns and regularities has a wide range of potential applications. It could help us with detecting outliers or abnormal subnetworks (such as terrorist networks or illegal money-laundering rings), maximizing e ciency of disease controlling, marketing, fo...

The very important objective of the digital designer when using discrete gates for implement a Boolean function is to keep the number of used gates to a minimum and win a memory space without lost the original information. In this sense, the Simplification is very important and could be achieved by a purely algebraic process, but it can be tedious when it arrived to a very large number of varia...