Abstract:This article presents a new concept of providing service quality with a level required by customers as outcome of an agent system decision making. Decisions are based on network state information and customer requirements concerning transmission quality with accepted costs of transmission. The proposed mechanism, which is called Pay&Require, combines features of decentralized routing systems in computer networks and the newly implemented concept of centralized control determined as SDN (Software-Defined Networking).
Abstract:The following article presents the application of the Max-Plus Linear System (MPLS) method in the synthesis of different IT process control structures, taking place in the systems belonging to the class of Discrete Event Systems (DES). Modelling and analysis of these systems are based on the state equations, expressed in MPLS categories and classical principles of control theory, adapted for them. MPLS is based on max-plus algebra formalism and is supported with graphical representation in the form of Timed Event Graph (TEG), which is the special case of Timed Petri Nets (TPN). The article contains an overview of the theoretical work on discrete control processes, with a particular focus on the synthesis of control signals in the open control to obtain the desired output system. A practical example has been used for distributed computational process and data transmission for the system controlling selected technological process. Numerical results are presented.
Abstract:Straw tube detectors operating as drift detectors are commonly used in nuclear and particle physics experiments. The straw tubes are arranged in layers and placed in areas both with and without magnetic field. In order to resolve the 3D coordinates of a track, the straws are placed in multiple overlapping layers at varying angles of inclination. By measuring the drift time and then converting it to the drift distance, a position resolution per straw can be achieved. Knowing the geometry of the detector, the position of hit straws and the drift distances, it is possible to determine the tracks of the moving particles. In the paper we present the algorithm for the 3D track reconstruction in areas without magnetic field by using vertical and skewed straws. The algorithm has been prepared for the Forward Tracker in the PANDA experiment.
Abstract:This paper proposes a method of comparing the short texts using the Levenshtein distance algorithm and thesaurus for analysing terms enclosed in texts instead of popular methods exploiting the grammatical variations glossary. The tested texts contain a variety of nouns and verbs together with grammatical or orthographical mistakes. Based on the proposed new algorithm the similarity of such texts will be estimated. The described technique is compared with methods: Cosine distances, distance Dice and Jaccard distance constructed on the term frequency method. The proposition is competitive against well-known algorithms of stemming and lemmatization.
Abstract:The main goal of the presented paper are numerical experiments of the convergence of the adaptation algorithm  developed by the author based on remeshing, which form the proof of the concept for the presented algorithm. The main feature of the considered algorithm is an application of the mesh generator to the adaptation with a mesh size function . The proposed method uses a sequence of meshes obtained by successive modification of the mesh size function. The rate of the convergence is obtained numerically considering a known solution. The analysis of the unknown solution was restricted to the assessment of some properties of the strict solution.
Abstract:For a metrizable space X, concepts of metric convergence in measure and of functional convergence in measure of sequences of measurable mappings taking their values in X are introduced and applied to a comparison of compactifications of X.
Abstract:We give an example of a finite matrix with the property that expanding its language with a constant changes its finite axiomatization property: in the language with one binary operation the tautologies of the matrix are finitely axiomatizable while in the expanded language they are not. The constant we add is not definable in the original language.The deductive system generated by this matrix is not algebraizable.
Abstract:In this paper we consider derivatives which are binary options of asset-or-nothing type with a payoff function depending on a parameter. The payoff is modelled on the payoff of catastrophe bonds. We examine the influence of the derivative on returns on shares. For this purpose two portfolios are compared: one consisting of stocks and a second additionally containing the derivative. Using the Black-Scholes model we derive an explicit formula for the standard deviation of the returns on the investment portfolios. Numerical examples show that the derivative reduces the volatility of returns on shares. For typical values of stock price volatility we indicate the value of the parameter appearing in the payoff for which the volatility of returns on shares reaches a minimum. All numerical calculations were made with MAPLE.
Abstract:We provide a self-contained discussion of the notions of δ-primeness and δ-semiprimeness for associative rings, possibly without identity. Some of the facts and properties presented in the article seem less known and quite difficult to find in standard reference sources.
Abstract:In this paper we introduce some linear positive operators of the Baskakov-Durrmeyer type in the space of uniformly continuous and bounded functions of several variables. The theorem on the degree of the convergence is established. Moreover, we give the Voronovskaya type formula for these operators.