Indecisive Belief Functions
Daniel, Milan
2015 - English This study presents an idea of indecisive functions, their general and also special definitions, plausibility and pignistic indecisive belief functions. The rich structure of indecisive belief functions is studied in general, and also in special views: both general substructures and indecisive belief functions on three-element and general finite frames of discernment. We are focused to pignistic and contour (plausibility) indecisive belief functions, including their mutual relationship in our study. The later have interesting algebraic structure related to Dempster’s rule of combination. Keywords: belief function; theory of evidence; Dempster-Shafer theory; Dempster’s semigroup Fulltext is available at external website. Indecisive Belief Functions

This study presents an idea of indecisive functions, their general and also special definitions, plausibility and pignistic indecisive belief functions. The rich structure of indecisive belief ...

Daniel, Milan
Ústav informatiky, 2015

Synergy between the Parameter Estimation and a Design Variable Optimization for FRAP Experiments
Matonoha, Ctirad; Papáček, Š.
2015 - English Available in digital repository of the ASCR Synergy between the Parameter Estimation and a Design Variable Optimization for FRAP Experiments

Matonoha, Ctirad; Papáček, Š.
Ústav informatiky, 2015

Dynamic Contact Problems in Bone Neoplasm Analyses and the Primal-Dual Active Set (PDAS) Method
Nedoma, Jiří
2015 - English In the contribution growths of the neoplasms (benign and malignant tumors and cysts), located in a system of loaded bones, will be simulated. The main goal of the contribution is to present the useful methods and efficient algorithms for their solutions. Because the geometry of the system of loaded and possible fractured bones with enlarged neoplasms changes in time, the corresponding mathematical models of tumor’s and cyst’s evolutions lead to the coupled free boundary problems and the dynamic contact problems with or without friction. The discussed parts of these models will be based on the theory of dynamic contact problems without or with Tresca or Coulomb frictions in the visco-elastic rheology. The numerical solution of the problem with Coulomb friction is based on the semi-implicit scheme in time and the finite element method in space, where the Coulomb law of friction at every time level will be approximated by its value from the previous time level. The algorithm for the corresponding model of friction will be based on the discrete mortar formulation of the saddle point problem and the primal-dual active set algorithm. The algorithm for the Coulomb friction model will be based on the fixpoint algorithm, that will be an extension of the PDAS algorithm for the Tresca friction. In this algorithm the friction bound is iteratively modified using the normal component of the Lagrange multiplier. Thus the friction bound and the active and inactive sets are updated in every step of the iterative algorithm and at every time step corresponding to the semi-implicit scheme. Keywords: dynamic contact problems; mathematical models of neoplasms - tumors and cysts; Coulomb and Tresca frictions; variational formulation; semi-implicit scheme; FEM; mortar approximation; PDAS algorithm Fulltext is available at external website. Dynamic Contact Problems in Bone Neoplasm Analyses and the Primal-Dual Active Set (PDAS) Method

In the contribution growths of the neoplasms (benign and malignant tumors and cysts), located in a system of loaded bones, will be simulated. The main goal of the contribution is to present the useful ...

Nedoma, Jiří
Ústav informatiky, 2015

Homomorphic Coordinates of Dempster’s Semigroup
Daniel, Milan
2015 - English Coordinates of belief functions on two-element frame of discernment are defined using homomorphisms of Dempster’s semigroup (the algebra of belief functions with Dempster’s rule). Three systems of the coordinates (h-f, h-f0, and coordinates based on decomposition of belief functions) are analysed with a focus to their homomorphic properties. Further, ideas of generalisation of the investigated systems of coordinates to general finite frame of discernment are presented. Keywords: belief functions; Dempster-Shafer Theory; Dempster's semigroup; homomorphism; homomorphic coordinates Fulltext is available at external website. Homomorphic Coordinates of Dempster’s Semigroup

Coordinates of belief functions on two-element frame of discernment are defined using homomorphisms of Dempster’s semigroup (the algebra of belief functions with Dempster’s rule). Three systems of the ...

Daniel, Milan
Ústav informatiky, 2015

The Distribution Mapping Functions
Jiřina, Marcel
2015 - English The target of this study is to make clear the difference of the distribution mapping function introduced in 2003 and the classical notion of point processes theory, the counting function N, Ripley’s K-function, and other two distance functions, F and G-functions. We summarize here necessary starting points from the point process theory using the famous work by Baddeley, a two-volume book of Daley and Vere-Jones and short paper by Dixon. When dealing with the distribution mapping function we use up-to-date formulations used in various papers since 2003. Keywords: multidimensional data; correlation dimension; distance; metrics,; distribution mapping function Available in a digital repository NRGL The Distribution Mapping Functions

The target of this study is to make clear the difference of the distribution mapping function introduced in 2003 and the classical notion of point processes theory, the counting function N, Ripley’s ...

Jiřina, Marcel
Ústav informatiky, 2015

A New Proof of the Hansen-Bliek-Rohn Optimality Result
Rohn, Jiří
2014 - English Keywords: interval linear equations; unit midpoint; Hansen-Bliek-Rohn optimality result Available in a digital repository NRGL A New Proof of the Hansen-Bliek-Rohn Optimality Result

Rohn, Jiří
Ústav informatiky, 2014

Fast nondeterministic matrix multiplication via derandomization of Freivalds' algorithm (Revised corrected version)
Wiedermann, Jiří
2014 - English Keywords: matrix multiplication; verification of matrix product; nondeterministic algorithms; modular arithmetic; complexity Available in a digital repository NRGL Fast nondeterministic matrix multiplication via derandomization of Freivalds' algorithm (Revised corrected version)

Wiedermann, Jiří
Ústav informatiky, 2014

The thermal regime of ice pits of the Borec hill
Türkott, L.; Martinčíková, Eva; Potop, V.
2014 - English The ecological stability of the sites with stenoec organisms is important factor for maintaining them at given location. Phonolite system of the Borec hill creates a unique labyrinth of vents. Thermal anomalies occur during the year in the fissure system and create specific microclimate. Flow direction is given by the temperature gradient inside and outside of the system. The lower part of fissure system is located in the debris fields, while the upper part on top of the hill. Phonolite rocks are cooled down by air streaming from the debris fields during the winter. Direction of the air flow changes in the spring and summer. The cold air is exhaled from these vents on the lower parts of system and creates ice pits with the typical vegetation. Keywords: ice pit; air temperature; Boreč hill; ventalore Available on request at various institutes of the ASCR The thermal regime of ice pits of the Borec hill

The ecological stability of the sites with stenoec organisms is important factor for maintaining them at given location. Phonolite system of the Borec hill creates a unique labyrinth of vents. Thermal ...

Türkott, L.; Martinčíková, Eva; Potop, V.
Ústav informatiky, 2014

ITAT 2014. Information Technologies - Applications and Theory. Part I
Kůrková, Věra; Bajer, Lukáš
2014 - English ITAT 2014. Information Technologies - Applications and Theory. Part I. Prague : Institute of Computer Science AS CR, 2014. 101 p. ISBN 978-80-87136-18-8. This volume is the first part of the two-volume proceedings of the 14th conference Information Technologies – Applications and Theory (ITAT 2014). The conference was held in Jasná, Demänovská Dolina, Slovakia, on September 25–29, 2014. ITAT is a computer science conference with the primary goal of exchanging information on recent research results between Czech and Slovak scientific communities, and it presents a platform for young researchers and PhD students to start new collaborations. This year, it was held in parallel with two collocated conferences Datakon and Znalosti with which it shared some invited plenary talks and a poster session. Overall, 51 papers were submitted to all conference tracks. This volume presents 16 papers of the main track, which were selected by the program committee based on at least two reviews by the program committee members. Papers from the three workshops and extended abstracts of posters are included in the second volume. Keywords: computer science; machine-learning; computer linguistics; data-mining; bio-informatics; parallel processing Available on request at various institutes of the ASCR ITAT 2014. Information Technologies - Applications and Theory. Part I

ITAT 2014. Information Technologies - Applications and Theory. Part I. Prague : Institute of Computer Science AS CR, 2014. 101 p. ISBN 978-80-87136-18-8. This volume is the first part of the ...

Kůrková, Věra; Bajer, Lukáš
Ústav informatiky, 2014

Inconspicuous Appeal of Amorphous Computing Systems
Wiedermann, Jiří
2014 - English Amorphous computing systems typically consist of myriads of tiny simple processors that are randomly distributed at fixed positions or move randomly in a confined volume. The processors are “embodied” meaning that each of them has its own source of energy, has a “body” equipped with various sensors and communication means and has a computational control part. Initially, the processors have no identifiers and from the technological reasons, in the interest of their maximal simplicity, their computational, communication, sensory and locomotion (if any) parts are reduced to an absolute minimum. The processors communicate wirelessly, e.g., in an airborne medium they communicate via a short-range radio, acoustically or optically and in a waterborne medium via molecular communication. In the extreme cases the computational part of the processors can be simplified down to probabilistic finite state automata or even combinatorial circuits and the system as a whole can still be made universally programmable. From the theoretical point of view the structure and the properties of the amorphous systems qualify them among the simplest (non-uniform) universal computational devices. From the practical viewpoint, once technology will enable a mass production of the required processors a host of new applications so far inaccessible to classical approaches to computing will follow. Keywords: amorphous computing; computational universality; computational complexity Available on request at various institutes of the ASCR Inconspicuous Appeal of Amorphous Computing Systems

Amorphous computing systems typically consist of myriads of tiny simple processors that are randomly distributed at fixed positions or move randomly in a confined volume. The processors are “embodied” ...

Wiedermann, Jiří
Ústav informatiky, 2014