Algorithmic Methods in Queues and in the Exploration of Point Processes

This is a review of methodology for the algorithmic study of some useful models in point process and queueing theory, as discussed in three lectures at the Summer Institute at Sozopol, Bulgaria. We provide references to sources where the extensive details of this work are found. For future investigation, some open problems and new methodological approaches are proposed.

An Algorithmic Approach to Inferring Cross-Ontology Links while Mapping Anatomical Ontologies

ACM Computing Classification System (1998): J.3.

Algorithmic Background of the Host Recommendation in the Adaptive Distributed Multimedia Server

Partial support of the Hungarian State Eötvös Scholarship, the Hungarian National Science Fund (Grant No. OTKA 42559 and 42706) and the Mobile Innovation Center, Hungary is gratefully acknowledged.

On the Coherence Between Probability and Possibility Measures

* This paper is supported by CICYT (Spain) under Project TIN 2005-08943-C02-01.

Algorithmic Minimization of Non-zero Entries in 0,1-Matrices

In this paper we present algorithms which work on pairs of 0,1- matrices which multiply again a matrix of zero and one entries. When applied over a pair, the algorithms change the number of non-zero entries present in the matrices, meanwhile their product remains unchanged. We establish the conditions under which the number of 1s decreases. We recursively define as well pairs of matrices which product is a specific matrix and such that by applying on them these algorithms, we minimize the total number of non-zero entries present in both matrices. These matrices may be interpreted as solutions for a well known information retrieval problem, and in this case the number of 1 entries represent the complexity of the retrieve and information update operations.

Evaluating Misclassification Probability Using Empirical Risk

* The work is supported by RFBR, grant 04-01-00858-a

The B-Terminal Busy Probability Prediction

In the teletraffic engineering of all the telecommunication networks, parameters characterizing the terminal traffic are used. One of the most important of them is the probability of finding the called (B-terminal) busy. This parameter is studied in some of the first and last papers in Teletraffic Theory. We propose a solution in this topic in the case of (virtual) channel systems, such as PSTN and GSM. We propose a detailed conceptual traffic model and, based on it, an analytical macro-state model of the system in stationary state, with: Bernoulli– Poisson–Pascal input flow; repeated calls; limited number of homogeneous terminals; losses due to abandoned and interrupted dialling, blocked and interrupted switching, not available intent terminal, blocked and abandoned ringing and abandoned conversation. Proposed in this paper approach may help in determination of many network traffic characteristics at session level, in performance evaluation of the next generation mobile networks.

An Algorithmic Solution for Management of Related Text Objects with Application in Phytopharmacy

This paper presents an algorithmic solution for management of related text objects, in which are integrated algorithms for their extraction from paper or electronic format, for their storage and processing in a relational database. The developed algorithms for data extraction and data analysis enable one to find specific features and relations between the text objects from the database. The algorithmic solution is applied to data from the field of phytopharmacy in Bulgaria. It can be used as a tool and methodology for other subject areas where there are complex relationships between text objects.

On the Extinction Probability for Bisexual Branching Processes in Varying Environments

2000 Mathematics Subject Classification: 60J80

Developing Students’ Mathematical Thinking and Algorithmic Culture in IT Classes

Report published in the Proceedings of the National Conference on "Education in the Information Society", Plovdiv, May, 2012

Randomized Push-Out Mechanisms in Priority Queuing and their Probability Characteristics

2002 Mathematics Subject Classification: 60K25.

Sensitivity Analysis of Some Applied Probability Models

2000 Mathematics Subject Classi cation: Primary 90C31. Secondary 62C12, 62P05, 93C41.

On the Moving Boundary Hitting Probability for the Brownian Motion

2000 Mathematics Subject Classification: 60J65.

Upper and Lower Bounds for Ruin Probability

In this note we discuss upper and lower bound for the ruin probability in an insurance model with very heavy-tailed claims and interarrival times.

An Estimate of the Probability Pr(X

2000 Mathematics Subject Classification: 33C90, 62E99