Ontology similarity calculation and ontology mapping are crucial research topics in information retrieval. Ontology, as a concept structure model, is widely used in biology, physics, geography and social sciences. In this paper, we present new algorithms for ontology similarity measurement and ontology mapping using harmonic analysis and diffusion regularization on hypergraph. The optimal funct...

The combination of radiotherapy treatments and breast reconstruction, using temporary tissue expanders, generates several concerns due to the presence of a magnetic valve inside the radiation field. The objective of this work is to evaluate a radiotherapy treatment planning for a patient using a tissue expander. Isodose curve maps, obtained using radiochromic films, were compared to the ones ca...

We present a new type of Markov Chain algo rithm for the calculation of combined Dempster Shafer belief which is almost linear in the size of the frame thus making the calculation of belief feasible for a wider range of problems We also indicate how these algorithms may be used in the cal culation of belief in product spaces associated with networks

We report the results of a next-to-leading order event generator of purely gluonic jet production. This calculation is the rst step in the construction of a full next-to-leading order calculation of three jet production at hadron colliders. Several jet-algorithms commonly used in experiments are implemented and their numerical stability is investigated.

We report the results of a next-to-leading order event generator of purely gluonic jet production. This calculation is the first step in the construction of a full next-to-leading order calculation of three jet production at hadron colliders. Several jet-algorithms commonly used in experiments are implemented and their numerical stability is investigated.

607 Abstract— In this work, we present solutions of two problems. First, the representation of pattern recognition problem in the standard nml T table of the algorithm estimate calculation was considered. Second, the problem of finding the model, consisting of the optimal parameters of an algorithm was considered. Such procedure is carried out by the selection optimal values of the parameters o...

The vast majority of problems faced by bioinformatics are very complex and time consuming. They require the use of modern high-performance computational systems and the development of algorithms for such system. Heterogeneous computing systems which include graphics processing unit (GPU) occupy a separate niche. Such systems allow to accelerate solving of some task significantly. The task perfo...

Music classification continues to be an important component of music information retrieval research. An underutilized tool for improving the performance of classifiers is feature weighting. A major reason for its unpopularity, despite its benefits, is the potentially infinite calculation time it requires to achieve optimal results. Genetic algorithms offer potentially sub-optimal but reasonable...

An analogy between celebrated Kendall equation for busy periods in the system M |GI|1 and analytical results for busy periods in the priority systemsMr|GIr |1 is drawn. These results can be viewed as generalizations of the functional Kendall equation. The methodology and algorithms of numerical solution of recurrent functional equations which appear in the analysis of such queueing systems are ...

Incremental versions of batch algorithms are often desired, for increased time efficiency in the streaming data setting, or increased memory efficiency in general. In this paper we present a novel algorithm for incremental kernel PCA, based on rank one updates to the eigendecomposition of the kernel matrix, which is more computationally efficient than comparable existing algorithms. We extend o...