This paper studies the problem of diiusion in Markovian models, such as hidden Markov models (HMMs) and how it makes very diicult the task of learning of long-term dependencies in sequences. Using results from Markov chain theory, we show that the problem of diiusion is reduced if the transition probabilities approach 0 or 1. Under this condition, standard HMMs have very limited modeling capabi...

In this paper we simplify the model of computation considered in [1], namely network of evolutionary picture processors, by moving the filters from the nodes to the edges. Each edge is now viewed as a twoway channel such that input and output filters, respectively, of the two nodes connected by the edge coincide. Thus, the possibility of controlling the computation in such networks seems to be ...

We develop a module-based framework for constraint modeling where it is possible to combine different constraint modeling languages and exploit their strengths in a flexible way. In the framework a constraint model consists of modules with clear input/output interfaces. When combining modules, apart from the interface, a module is a black box whose internals are invisible to the outside world. ...

Careful simulation-based evaluation plays an important role in the design of file and disk systems. We describe here a particular approach to such evaluations that combines techniques in workload synthesis, file system modeling, and detailed disk behavior modeling. Together, these make feasible the detailed simulation of I/O hardware and file system software. In particular, using the techniques...

We propose a declarative framework for modelling multi-agent systems and specify a number of properties of these systems and agents within them. The framework is parametric with respect to an input/output semantics for agents, whereby inputs are the agents’ observations, and outputs are their actions. The observations include actions performed by other agents and events happening in the world. ...

A system is data-independent with respect to a data type X iff the operations it can perform on values of type X are restricted to just equality testing. The system may also store, input and output values of type X. We study model checking of systems which are data-independent with respect to two distinct type variables X and Y , and may in addition use arrays with indices from X and values fro...

A new approach to diagnostic testing of embedded memories is presented which enables the design of tests that provide complete detection and distinguishing of all faults in a given fault model. The approach is based on decomposition of functional memory faults into basic fault effects and output tracing. Output tracing involves storing all read operation results for defective memory cells and r...

This paper presents an assertional-style verification of the aircraft landing protocol of NASA’s SATS (Small Aircraft Transportation System) concept [1] using the I/O automata framework and the PVS theorem prover. We reconstructed the mathematical model of the landing protocol presented in [2] as an I/O automaton. In addition, we translated the I/O automaton into a corresponding PVS specificati...

The module theorem by Janhunen et al. demonstrates how to provide a modular structure in answer set programming, where each module has a well-defined input/output interface which can be used to establish the compositionality of answer sets. The theorem is useful in the analysis of answer set programs, and is a basis of incremental grounding and reactive answer set programming. We extend the mod...

The performance of monitoring and control techniques for distributed-sensor systems is affected by the choice of the measurement sensor location. In this paper a methodology is suggested to solve the optimal sensor location problem. The suggested algorithm does not require any explicit knowledge of the plant model, and is based upon a sequential procedure selecting at each iteration the most in...