BUDI: Architecture for Fuzzy Search in Documental Repositories.
Buffer overflow period in a MAP queue.
Building a knowledge base for correspondence analysis.
This paper introduces a statistical strategy for Correspondence Analysis. A formal description of the choices, actions and decisions taken during data analysis is built. Rules and heuristics have been obtained from the application of this technique to real case studies.The strategy proposed checks suitability of certain types of data matrices for this analysis and also considers a guidance and interpretation of the application of this technique. Some algorithmic-like rules are presented and specific...
Building adaptive tests using Bayesian networks
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.
Building blocks of upward planar digraphs.
Building representative-based data aggregation tree in wireless sensor networks.
Building the Czech Digital Mathematics Library upon DSpace system
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...
C source code obfuscator
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.
C++ tools to construct our user-level language
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.
C++ Tools to construct our user-level language
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.
Cache aware data laying for the Gauss-Seidel smoother.
Calcul de la distance par les sous-mots
Calcul du centralisateur d'un groupe de permutations
Calcul pratique du treillis de Galois d'une correspondance
Calcul réparti d'un extrémum et du routage associé dans un réseau quelconque
Calculation des valeurs numcute{e}riques des polynomes au moyen des spectres mathematiques
Calculations of graded ill-known sets
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...
Calculi of net structures and sets are similar
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...
Calculi of net structures and sets are similar
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...
Calculs approchés de la borne inférieure de valeurs réparties