DSpace Collection: Volume 11 Number 4
http://hdl.handle.net/10525/834
The Collection's search engineSearch the Channelsearch
http://sci-gems.math.bas.bg/jspui/simple-search
The B-Terminal Busy Probability Prediction
http://hdl.handle.net/10525/900
Title: The B-Terminal Busy Probability Prediction<br/><br/>Authors: Poryazov, Stoyan<br/><br/>Abstract: 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.Spread Spectrum Watermarking Technique for Information System Securing
http://hdl.handle.net/10525/899
Title: Spread Spectrum Watermarking Technique for Information System Securing<br/><br/>Authors: Todorov, Todor<br/><br/>Abstract: In this paper we consider a computer information system and a way to realize the security of the data in it with digital watermarking. A technique for spread spectrum watermarking is presented and its realization with MathLAB 6.5 is shown.Information Modelling of Two-Dimensional Optical Parameters Measurement
http://hdl.handle.net/10525/898
Title: Information Modelling of Two-Dimensional Optical Parameters Measurement<br/><br/>Authors: Stoilov, Georgi; Mechkarov, Nikola; Sharlandjiev, Peter<br/><br/>Abstract: A method for measurement and visualization of the complex transmission coefficient of 2-D micro-objects is proposed. The method is based on calculation of the transmission coefficient from the diffraction pattern and the illumination aperture function for monochromatic light. A phase-stepping method was used for diffracted light phase determination.Extended Executive Information System (EEIS)
http://hdl.handle.net/10525/897
Title: Extended Executive Information System (EEIS)<br/><br/>Authors: Kovacheva, Todorka<br/><br/>Abstract: In the following paper a new class of executive information system is suggested. It is based on a selforganization in management and on a module modeling. The system is multifunctional and multidisciplinary. The structure elements of the system and the common features of the modules are discussed.Mathematical Packages for Teaching and Research in Internet – Application and Information Support
http://hdl.handle.net/10525/896
Title: Mathematical Packages for Teaching and Research in Internet – Application and Information Support<br/><br/>Authors: Kovacheva, Tsvetanka<br/><br/>Abstract: The paper considers the use and the information support of the most important mathematical Application Packages (AP), such as Maple, Matlab, Mathcad, Mathematica, Statistica and SPSS – mostly used during Calculus tuition in Universities. The main features of the packages and the information support in the sites of the producers are outlined, as well as their capacity for work in Internet, together with educational sites and literature related to them. The most important resources of the TeX system for preparation of mathematical articles and documents are presented.Realization of Open Addressing Hash Table in the Chained Allocated Memory
http://hdl.handle.net/10525/895
Title: Realization of Open Addressing Hash Table in the Chained Allocated Memory<br/><br/>Authors: Dyankova, Valentina; Hristova, Rositza<br/><br/>Abstract: In this article, we examine a realization of an open addressing hash table in the chained allocated memory, giving us the opportunity to decrease the number of linear probing when a given element has not been inserted in the table.Analysis of Security in Archiving
http://hdl.handle.net/10525/894
Title: Analysis of Security in Archiving<br/><br/>Authors: Polimirova-Nickolova, Dimitrina<br/><br/>Abstract: Some basic types of archiving programs are described in the paper in addition to their advantages and disadvantages with respect to the analysis of security in archiving. Analysis and appraisal are performed on the results obtained during the described experiments.About New Pattern Recognition Method for the Universal Program System “Recognition”
http://hdl.handle.net/10525/893
Title: About New Pattern Recognition Method for the Universal Program System “Recognition”<br/><br/>Authors: Dokukin, Alexander; Senko, Oleg<br/><br/>Abstract: In this work the new pattern recognition method based on the unification of algebraic and statistical approaches is described. The main point of the method is the voting procedure upon the statistically weighted regularities, which are linear separators in two-dimensional projections of feature space. The report contains brief description of the theoretical foundations of the method, description of its software realization and the results of series of experiments proving its usefulness in practical tasks.Methods for Solving Necessary Equivalences
http://hdl.handle.net/10525/892
Title: Methods for Solving Necessary Equivalences<br/><br/>Authors: Brown, Frank<br/><br/>Abstract: Nonmonotonic Logics such as Autoepistemic Logic, Reflective Logic, and Default Logic, are usually defined in terms of set-theoretic fixed-point equations defined over deductively closed sets of sentences of First Order Logic. Such systems may also be represented as necessary equivalences in a Modal Logic stronger than S5 with the added advantage that such representations may be generalized to allow quantified variables crossing modal scopes resulting in a Quantified Autoepistemic Logic, a Quantified Autoepistemic Kernel, a Quantified Reflective Logic, and a Quantified Default Logic. Quantifiers in all these generalizations obey all the normal laws of logic including both the Barcan formula and its converse. Herein, we address the problem of solving some necessary equivalences containing universal quantifiers over modal scopes. Solutions obtained by these methods are then compared to related results obtained in the literature by Circumscription in Second Order Logic since the disjunction of all the solutions of a necessary equivalence containing just normal defaults in these Quantified Logics, is equivalent to that system.On the Relationships Among Quantified Autoepistemic Logic, its Kernel, and Quantified Reflective Logic
http://hdl.handle.net/10525/891
Title: On the Relationships Among Quantified Autoepistemic Logic, its Kernel, and Quantified Reflective Logic<br/><br/>Authors: Brown, Frank<br/><br/>Abstract: A Quantified Autoepistemic Logic is axiomatized in a monotonic Modal Quantificational Logic whose modal laws are slightly stronger than S5. This Quantified Autoepistemic Logic obeys all the laws of First Order Logic and its L predicate obeys the laws of S5 Modal Logic in every fixed-point. It is proven that this Logic has a kernel not containing L such that L holds for a sentence if and only if that sentence is in the kernel. This result is important because it shows that L is superfluous thereby allowing the ori ginal equivalence to be simplified by eliminating L from it. It is also shown that the Kernel of Quantified Autoepistemic Logic is a generalization of Quantified Reflective Logic, which coincides with it in the propositional case.Representing "Recursive" Default Logic in Modal Logic
http://hdl.handle.net/10525/890
Title: Representing "Recursive" Default Logic in Modal Logic<br/><br/>Authors: Brown, Frank<br/><br/>Abstract: The "recursive" definition of Default Logic is shown to be representable in a monotonic Modal Quantificational Logic whose modal laws are stronger than S5. Specifically, it is proven that a set of sentences of First Order Logic is a fixed-point of the "recursive" fixed-point equation of Default Logic with an initial set of axioms and defaults if and only if the meaning of the fixed-point is logically equivalent to a particular modal functor of the meanings of that initial set of sentences and of the sentences in those defaults. This is important because the modal representation allows the use of powerful automatic deduction systems for Modal Logic and because unlike the original "recursive" definition of Default Logic, it is easily generalized to the case where quantified variables may be shared across the scope of the components of the defaults.General Aspects of Constructing an Autonomous Adaptive Agent
http://hdl.handle.net/10525/889
Title: General Aspects of Constructing an Autonomous Adaptive Agent<br/><br/>Authors: Pchelkin, Arthur<br/><br/>Abstract: There are a great deal of approaches in artificial intelligence, some of them also coming from biology and neirophysiology. In this paper we are making a review, discussing many of them, and arranging our discussion around the autonomous agent research. We highlight three aspect in our classification: type of abstraction applied for representing agent knowledge, the implementation of hypothesis processing mechanism, allowed degree of freedom in behaviour and self-organizing. Using this classification many approaches in artificial intelligence are evaluated. Then we summarize all discussed ideas and propose a series of general principles for building an autonomous adaptive agent.Adaptive Control and Multi-agent Interface for Infotelecommunication Systems of New Generation
http://hdl.handle.net/10525/888
Title: Adaptive Control and Multi-agent Interface for Infotelecommunication Systems of New Generation<br/><br/>Authors: Timofeev, Adil<br/><br/>Abstract: Problems for intellectualisation for man-machine interface and methods of self-organization for network control in multi-agent infotelecommunication systems have been discussed. Architecture and principles for construction of network and neural agents for telecommunication systems of new generation have been suggested. Methods for adaptive and multi-agent routing for information flows by requests of external agents-users of global telecommunication systems and computer networks have been described.Sensitivity and Bias within the Binary Signal Detection Theory, BSDT
http://hdl.handle.net/10525/887
Title: Sensitivity and Bias within the Binary Signal Detection Theory, BSDT<br/><br/>Authors: Gopych, Petro<br/><br/>Abstract: Similar to classic Signal Detection Theory (SDT), recent optimal Binary Signal Detection Theory (BSDT) and based on it Neural Network Assembly Memory Model (NNAMM) can successfully reproduce Receiver Operating Characteristic (ROC) curves although BSDT/NNAMM parameters (intensity of cue and neuron threshold) and classic SDT parameters (perception distance and response bias) are essentially different. In present work BSDT/NNAMM optimal likelihood and posterior probabilities are analytically analyzed and used to generate ROCs and modified (posterior) mROCs, optimal overall likelihood and posterior. It is shown that for the description of basic discrimination experiments in psychophysics within the BSDT a ‘neural space’ can be introduced where sensory stimuli as neural codes are represented and decision processes are defined, the BSDT’s isobias curves can simultaneously be interpreted as universal psychometric functions satisfying the Neyman-Pearson objective, the just noticeable difference (jnd) can be defined and interpreted as an atom of experience, and near-neutral values of biases are observers’ natural choice. The uniformity or no-priming hypotheses, concerning the ‘in-mind’ distribution of false-alarm probabilities during ROC or overall probability estimations, is introduced. The BSDT’s and classic SDT’s sensitivity, bias, their ROC and decision spaces are compared.Algorithm BIDIMS for Automated Systematization of Data Array. Case Study: Rediscovering Mendeleev’s Periodic Table of Chemical Elements
http://hdl.handle.net/10525/886
Title: Algorithm BIDIMS for Automated Systematization of Data Array. Case Study: Rediscovering Mendeleev’s Periodic Table of Chemical Elements<br/><br/>Authors: Zagoruiko, Andrey; Zagoruiko, Nikolay<br/><br/>Abstract: The method (algorithm BIDIMS) of multivariate objects display to bidimensional structure in which the sum of differences of objects properties and their nearest neighbors is minimal is being described. The basic regularities on the set of objects at this ordering become evident. Besides, such structures (tables) have high inductive opportunities: many latent properties of objects may be predicted on their coordinates in this table. Opportunities of a method are illustrated on an example of bidimentional ordering of chemical elements. The table received in result practically coincides with the periodic Mendeleev table.Multi-Domain Information Model
http://hdl.handle.net/10525/885
Title: Multi-Domain Information Model<br/><br/>Authors: Markov, Krassimir<br/><br/>Abstract: The Multi-Domain Information Model for organisation of the information bases is presented.