We propose a framework for building decision strategies using Bayesian network models and discuss its application to adaptive testing. Dynamic programming and algorithm are used to find optimal adaptive tests. The proposed algorithm is based on a new admissible heuristic function.
The paper describes the process of building the Czech Digital Mathematics Library (DML-CZ) upon DSpace System. At first, the DML-CZ will be briefly introduced. Then we will describe DSpace system and its architecture together with Manakin — a system for building user interface above DSpace. The first technical part of the paper will be about mapping DML-CZ structure onto DSpace structures and about our importing tools and the way of managing requested features which are not supported by the default...
Obfuscation is a process that changes the code, but without any change to semantics. This process can be done on two levels. On the binary code level, where the instructions or control flow are modified, or on the source code level, where we can change only a structure of code to make it harder to read or we can make adjustments to reduce chance of successful reverse engineering.
The aim of this paper is to present how to make a dedicaded computed language polymorphic and multi type, in C++to solve partial differential equations with the finite element method. The driving idea is to make the language as close as possible to the mathematical notation.
The aim of this paper is to present how to make a dedicaded computed language polymorphic and multi type, in C++ to solve partial differential equations with the finite element method. The driving idea is to make the language as close as possible to the mathematical notation.
To represent a set whose members are known partially, the graded ill-known set is proposed. In this paper, we investigate calculations of function values of graded ill-known sets. Because a graded ill-known set is characterized by a possibility distribution in the power set, the calculations of function values of graded ill-known sets are based on the extension principle but generally complex. To reduce the complexity, lower and upper approximations of a given graded ill-known set are used at the...
Three basic operations on labelled net structures are proposed: synchronised union, synchronised intersection and synchronised difference. The first of them is a version of known parallel composition with synchronised actions identically labelled. The operations work analogously to the ordinary union, intersection and difference on sets. It is shown that the universe of net structures with these operations is a distributive lattice and – if infinite pre/post sets of transitions are allowed – even...
Three basic operations on labelled net structures are proposed: synchronised union, synchronised intersection and synchronised difference. The first of them is a version of known parallel composition with synchronised actions identically labelled. The operations work analogously to the ordinary union, intersection and difference on sets. It is shown that the universe of net structures with these operations is a distributive lattice and – if infinite pre/post sets of transitions are allowed – even...
We introduce in this article a new method to calculate all absolute and relatif primitive invariants of finite groups. This method is inspired from K. Girstmair which calculate an absolute primitive invariant of minimal degree. Are presented two algorithms, the first one enable us to calculate all primitive invariants of minimal degree, and the second one calculate all absolute or relative primitive invariants with distincts coefficients. This work take place in Galois Theory and Invariant Theory. ...