Traffic Offered Behaviour Regarding Target QOS Parameters in Network Dimensioning

We consider a model of overall telecommunication network with virtual circuits switching, in stationary state, with Poisson input flow, repeated calls, limited number of homogeneous terminals and 8 types of losses. One of the main problems of network dimensioning/redimensioning is estimation of traffic offered in network because it reflects on finding of necessary number of circuit switching lines on the basis of the consideration of detailed users manners and target Quality of Service (QoS). In this paper we investigate the behaviour of the traffic offered in a network regarding QoS variables: “probability of blocked switching” and “probability of finding B-terminals busy”. Numerical dependencies are shown graphically. A network dimensioning task (NDT) is formulated, solvability of the NDT and the necessary conditions for analytical solution are researched as well. International Journal "Information Technologies and Knowledge" Vol.2 / 2008 174 The received results make the network dimensioning/redimensioning, based on QoS requirements easily, due to clearer understanding of important variables behaviour. The described approach is applicable directly for every (virtual) circuit switching telecommunication system e.g. GSM, PSTN, ISDN and BISDN. For packet - switching networks, at various layers, proposed approach may be used as a comparison basis and when they work in circuit switching mode (e.g. VoIP).

Almost Separable Data Aggregation by Layers of Formal Neurons

Information extraction or knowledge discovery from large data sets should be linked to data aggregation process. Data aggregation process can result in a new data representation with decreased number of objects of a given set. A deterministic approach to separable data aggregation means a lesser number of objects without mixing of objects from different categories. A statistical approach is less restrictive and allows for almost separable data aggregation with a low level of mixing of objects from different categories. Layers of formal neurons can be designed for the purpose of data aggregation both in the case of deterministic and statistical approach. The proposed designing method is based on minimization of the of the convex and piecewise linear (CPL) criterion functions.

About Homogeneous Spaces and Conditions of Completeness of Spaces

Александър В. Архангелски, Митрофан М. Чобан, Екатерина П. Михайлова - Въведени са понятията o-хомогенно пространство, lo-хомогенно пространство, do-хомогенно пространство и co-хомогенно пространство. Показано е, че ако lo-хомогенно пространство X има отворено подпространство, което е q-пълно, то и самото X е q-пълно. Показано е, че ако lo-хомогенно пространство X съдържа навсякъде гъсто екстремално несвързано подпространство, тогава X е екстремално несвързано.

About Homogeneous Spaces and the Baire Property in Remainders

Александър В. Архангелски, Митрофан М. Чобан, Екатерина П. Михайлова - В съобщението е продължено изследването на понятията o-хомогенно пространство, lo-хомогенно пространство, do-хомогенно пространство и co-хомогенно пространство. Показано е, че ако co-хомогенното пространство X съдържа Gδ -гъсто Московско подпространство, тогава X е Московско пространство.

Some Inequalities of the Uniform Ergodicity and Strong Stability of Homogeneous Markov Chains

2000 Mathematics Subject Classification: 60J45, 60K25

Lp Microlocal Supercritical Markov Branching Processes with Non-Homogeneous Poisson Immigration

2010 Mathematics Subject Classification: 60J80.

On the approximation by convolution operators in homogeneous Banach spaces on R^d

AMS Subject Classification 2010: 41A25, 41A35, 41A40, 41A63, 41A65, 42A38, 42A85, 42B10, 42B20

On the Approximation by Convolution Operators in Homogeneous Banach Spaces of Periodic Functions

AMS Subject Classification 2010: 41A25, 41A27, 41A35, 41A36, 41A40, 42Al6, 42A85.