Displaying similar documents to “Some Characteristics of the Process Measure of the Amount of Information”

Noun Sense Disambiguation using Co-Occurrence Relation in Machine Translation

Choe, Changil, Kim, Hyonil (2012)

Serdica Journal of Computing

Similarity:

Word Sense Disambiguation, the process of identifying the meaning of a word in a sentence when the word has multiple meanings, is a critical problem of machine translation. It is generally very difficult to select the correct meaning of a word in a sentence, especially when the syntactical difference between the source and target language is big, e.g., English-Korean machine translation. To achieve a high level of accuracy of noun sense selection in machine translation, we introduced...

Epsilon-independence between two processes

Tomasz Downarowicz, Paulina Grzegorek (2008)

Studia Mathematica

Similarity:

We study the notion of ε-independence of a process on finitely (or countably) many states and that of ε-independence between two processes defined on the same measure preserving transformation. For that we use the language of entropy. First we demonstrate that if a process is ε-independent then its ε-independence from another process can be verified using a simplified condition. The main direction of our study is to find natural examples of ε-independence. In case of ε-independence of...

BPMN Analysis of Public Procurement

Semerdjieva, Maria, Krastev, Evgeniy (2012)

Serdica Journal of Computing

Similarity:

ACM Computing Classification System (1998): D.0, D.2.11. This paper formulates a realistic case study of a public procurement process, where the national legal system is taken in consideration. Business Process Modeling Notation (BPMN) is used for encoding processes related to the analysis of public procurement tasks. Critical elements in the public procurement process that affect time, quality and cost are identified at the organizational, process execution and system levels....

On the analysis of Petri nets and their synthesis from process languages

Ludwik Czaja (2003)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

Processes in Place/Transition (P/T) nets are defined inductively by a peculiar numbering of place occurrences. Along with an associative sequential composition called catenation and a neutral process, a monoid of processes is obtained. The power algebra of this monoid contains all process languages with appropriate operations on them. Hence the problems of analysis and synthesis, analogous to those in the formal languages and automata theory, arise. Here, the analysis problem is: for...

Drunken man infinite words complexity

Marion Le Gonidec (2008)

RAIRO - Theoretical Informatics and Applications

Similarity:

In this article, we study the complexity of drunken man infinite words. We show that these infinite words, generated by a deterministic and complete countable automaton, or equivalently generated by a substitution over a countable alphabet of constant length, have complexity functions equivalent to (log ) when goes to infinity.