The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Two measures of asymmetry, of one random variable with respect to another, are proposed. The first is functional (asymmetry curve) ; the second is numerical (asymmetry index), and is based on the first. Their formal definitions and properties are presented as well as several applicationsto various data. These examples were swpecifically chosen to show the interpretations of the proposed measure and...
Głównym celem niniejszego opracowania jest prezentacja wyników analizy zbioru 601 ankiet zebranych przez Fundację POmocy Matematykom i Informatykom Niesprawnym Ruchowo (FPMiINR) w latach 1997-2001. Ankiety dostarczyły informacji o sytuacji życiowej, społecznej i zawodowej wszystkich respondentów, którzy w tym okresie zgłosili się do Fundacji osobiście, listownie lub przez pocztę elektroniczną, proszą...
We present an extension of a bounded model checking algorithm to deal with temporal epistemic formulas. We use the algorithm to solve a variant of the bit transmission problem
Bounded Model Checking (BMC) based on SAT methods consists in searching for a counterexample of a particular length and to generate a propositional formula that is satisfiable iff such a counterexample exists. Our paper shows how the concept of bounded model checking can be extended to deal with \TACTL\ (the universal fragment of \TCTL ) properties of a network of concurrent Timed Automata.
The paper deals with the problem of achieving a goal in a system in which certain actions can be executed. The initial state and the states that may be reached from this state by executing actions are represented by sets of sente nces, each sentence saying that some objects are or are not in a relation. Available actions are represented as instances of rewriting rules. The problem consists in finding...
The paper deals with the problem of checking reachability for timed automata. The main idea consists in combining the well-know forward reachability algorithm and the Bounded Model Checking (BMC) method. In order to check reachability of a state satisfying some desired property, first the transition relation of a timed automaton is unfolded to the depth k Î N and encoded as a prepositional formula...
We present a new approach to updateable, object-oriented, virtual (non-materialized) database views. It is based on the stack-based approach (SBA) to object-oriented query languages, which assumes the description of semantics in the form of abstract implementation of query/programming language constructs. The semantics is expressed in terms of naming, scoping and binding. It involves an environmental...
A new technology for service description and composition in open and distributed environment is proposed. The technology consists of description language (called Entish) and composition protocol called entish 1.0. They are based on software agent paradigm. The description language is the contents language of the messages that are exchanged (between agents and services) according to the composition...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.