Problémy matematické lingvistiky řešené československými matematiky
This work aims to fill a lacunae in the project-oriented production systems literature providing a formal analytic description of the rework effects formulae and the determination of the extended design time due to a certain degree of overlapping in a pair of activities. It is made through the utilization of concepts of workflow construction with hidden (semi) Markov models theory and establishing a way to disaggregate activities into sub-activities, in order to determine the activity parameters...
This article presents the principal results of the doctoral thesis “Recognition of neume notation in historical documents” by Lasko Laskov (Institute of Mathematics and Informatics at Bulgarian Academy of Sciences), successfully defended before the Specialized Academic Council for Informatics and Mathematical Modelling on 07 June 2010.Byzantine neume notation is a specific form of note script, used by the Orthodox Christian Church since ancient times until nowadays for writing music and musical...
We describe here how Tralics can be used to convert LaTeX documents into XML or HTML. It uses an ad-hoc DTD (a simplification of the TEI), but the translation of the math formulas is conforming to the presentation MathML 2.0 recommendations. We explain how to run and parametrize the software. We give an overview of the various MathML constructs, and how they are rendered by different browsers.
Message handling systems with finitely many servers are mathematically described as homogeneous Markov networks. For hierarchic networks is found a recursive algorithm evaluating after finitely many steps all steady state parameters. Applications to optimization of the system design and management are discussed, as well as a program product 5P (Program for Prognosis of Performance Parameters and Problems) based on the presented theoretical conclusions. The theoretic achievements as well as the practical...
We introduce an algebra with free variables, an algebra with undefined values, a program algebra over a term algebra, an algebra with integers, and an algebra with arrays. Program algebra is defined as universal algebra with assignments. Programs depend on the set of generators with supporting variables and supporting terms which determine the value of free variables in the next state. The execution of a program is changing state according to successor function using supporting terms.
Fuzzy logic is one of the tools for management of uncertainty; it works with more than two values, usually with a continuous scale, the real interval . Implementation restrictions in applications force us to use in fact a finite scale (finite chain) of truth degrees. In this paper, we study logical operations on finite chains, in particular conjunctions. We describe a computer program generating all finitely-valued fuzzy conjunctions (-norms). It allows also to select these -norms according to...
This review outlines the recent progress made in developing more accurate and efficient solutions to model electrostatics in systems comprised of bio-macromolecules and nanoobjects, the last one referring to objects that do not have biological function themselves but nowadays are frequently used in biophysical and medical approaches in conjunction with bio-macromolecules. The problem of modeling macromolecular electrostatics is reviewed from two different angles: as a mathematical task provided...