shall use the generic term information systems, in its broadest sense, to collectively refer to these application perspectives. We argue in this paper that so-called ontologies present their own methodological and architectural peculiarities: on the methodological side, their main peculiarity

of protecting information in computers. Access The ability to make use of information stored in a computer system. Used frequently as a verb, to the horror of grammarians. Access control list A list of principals that are authorized to have access to some object. Authenticate To verify the identity of a person

With increasing size and complexity of the implementations of information systems, it is necessary to use some logical construct (or architecture) for defining and controlling the interfaces and the integration of all of the components of the system. This paper defines information systems

The installation of high-speed networks using optical fiber and high bandwidth messsage forwarding gateways is changing the physical capabilities of information systems. These capabilities must be complemented with corresponding software systems advances to obtain a real benefit. Without smart

We give an efficient procedure for verifying that a finite-state concurrent system meets a specification expressed in a (propositional, branching-time) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent

of finite games, such as Selten’s finitely repeated chain-store game or in the finitely repeated prisoners ’ dilemma. We reexamine Selten’s model, adding to it a “small ” amount of imperfect (or incomplete) information about players ’ payoffs, and we find that this addition is sufficient to give rise

use this technique to augment an existing CRF-based information extraction system with long-distance dependency models, enforcing label consistency and extraction template consistency constraints. This technique results in an error reduction of up to 9 % over state-of-the-art systems on two

in control theory, except — as the subtitle has warned us — those involving stochastic processes or infinite-dimensional systems. The level is appropriate for a senior

Entropy and relative entropy are proposed as features extracted from symbol sequences. Firstly, a proper Iterated Function System is driven by the sequence, producing a fractaMike representation (CSR) with a low computational cost. Then, two entropic measures are applied to the CSR histogram

of groundwater systems under various initial/boundary conditions and management schemes will be practiced. The emphasis of the student presentations will be based on published papers concerning the applied aspects of groundwater computer modeling utilizing finite difference and analytical computer models