On the Coherence Between Probability and Possibility Measures

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

Mixed Negative Binomial Distribution by Weighted Gamma Mixing Distribution

Павел Т. Стойнов - В тази работа се разглежда отрицателно биномното разпределение, известно още като разпределение на Пойа. Предполагаме, че смесващото разпределение е претеглено гама разпределение. Изведени са вероятностите в някои частни случаи. Дадени са рекурентните формули на Панжер.

Application of the Heterogeneous System Prediction Method to Pattern Recognition Problem

* This work was financially supported by RFBR-04-01-00858.

Application of the Multivariate Prediction Method to Time Series

* This work was financially supported by RFBR-04-01-00858.

On some Mixture Distributions

The aim of this paper is to establish some mixture distributions that arise in stochastic processes. Some basic functions associated with the probability mass function of the mixture distributions, such as k-th moments, characteristic function and factorial moments are computed. Further we obtain a three-term recurrence relation for each established mixture distribution.

Solution of Space-Time Fractional Schrödinger Equation Occurring in Quantum Mechanics

Dedicated to Professor A.M. Mathai on the occasion of his 75-th birthday. Mathematics Subject Classi¯cation 2010: 26A33, 44A10, 33C60, 35J10.

On the Quotient Function Employed in the Blind Source Separation Problem

MSC 2010: 42C40, 94A12

Tail Inference for a Law in a Max-Semistable Domain of Attraction

2000 Mathematics Subject Classification: 62G32, 62G05.

Branching Populations of Cells Bearing a Continuous Label

2000 Mathematics Subject Classification: 60J80.

A Modified Model of Risk Business

2000 Mathematics Subject Classification: 60K10, 62P05

On the Poisson Process of Order k Space

2010 Mathematics Subject Classification: 60E05, 62P05.

Study of Queuing Systems with a Generalized Departure Process

This work was supported by the Bulgarian National Science Fund under grant BY-TH-105/2005.

Distances between Predicates in By-Analogy Reasoning Systems

The purpose is to develop expert systems where by-analogy reasoning is used. Knowledge “closeness” problems are known to frequently emerge in such systems if knowledge is represented by different production rules. To determine a degree of closeness for production rules a distance between predicates is introduced. Different types of distances between two predicate value distribution functions are considered when predicates are “true”. Asymptotic features and interrelations of distances are studied. Predicate value distribution functions are found by empirical distribution functions, and a procedure is proposed for this purpose. An adequacy of obtained distribution functions is tested on the basis of the statistical 2 χ –criterion and a testing mechanism is discussed. A theorem, by which a simple procedure of measurement of Euclidean distances between distribution function parameters is substituted for a predicate closeness determination one, is proved for parametric distribution function families. The proposed distance measurement apparatus may be applied in expert systems when reasoning is created by analogy.

Intellect Sensing of Neural Network that Trained to Classify Complex Signals

An experimental comparison of information features used by neural network is performed. The sensing method was used. Suboptimal classifier agreeable to the gaussian model of the training data was used as a probe. Neural nets with architectures of perceptron and feedforward net with one hidden layer were used. The experiments were carried out with spatial ultrasonic data, which are used for car’s passenger safety system neural controller learning. In this paper we show that a neural network doesn’t fully make use of gaussian components, which are first two moment coefficients of probability distribution. On the contrary, the network can find more complicated regularities inside data vectors and thus shows better results than suboptimal classifier. The parallel connection of suboptimal classifier improves work of modular neural network whereas its connection to the network input improves the specialization effect during training.

Sequencing Jobs with Uncertain Processing Times and Minimizing the Weighted Total Flow Time

We consider an uncertain version of the scheduling problem to sequence set of jobs J on a single machine with minimizing the weighted total flow time, provided that processing time of a job can take on any real value from the given closed interval. It is assumed that job processing time is unknown random variable before the actual occurrence of this time, where probability distribution of such a variable between the given lower and upper bounds is unknown before scheduling. We develop the dominance relations on a set of jobs J. The necessary and sufficient conditions for a job domination may be tested in polynomial time of the number n = |J| of jobs. If there is no a domination within some subset of set J, heuristic procedure to minimize the weighted total flow time is used for sequencing the jobs from such a subset. The computational experiments for randomly generated single-machine scheduling problems with n ≤ 700 show that the developed dominance relations are quite helpful in minimizing the weighted total flow time of n jobs with uncertain processing times.