Browsing by Title
-
Eidelman, Yuli; Milman, Vitali; Tsolomitis, Antonis (American Mathematical Society , 2004)[more][less]
-
Rudin, Walter (New York , 1991)[more][less]
-
Bachman, George; Narici, Lawrence (ACADEMIC PRESS , 1972)[more][less]
-
Clarke, Francis (Springer , 2013)[more][less]
-
Čukić, Ivan (Beograd , 2018)[more][less]
Abstract: There is a big class of problems that require software systems with asynchronously executed components. For example, distributed computations have the distributed nodes that process the data asynchronously to one anot- her, service-oriented architectures need to process separate requests asynchrono- usly, and multi-core and heterogeneous systems need to have multiple separa- te tasks running concurrently to best utilize the hardware. Even ordinary GUI applications need asynchronous components – the user interface needs to be re- sponsive at all times which means that no matter in what state the program is in, it needs to process and react to the input events coming from the user. The necessity of concurrency and asynchronous execution brings in the added com- plexity of the Inversion of Control (IoC) into the system, either through mes- sage passing or through event processing. IoC makes code difficult to develop and reason about, it increases component coupling and inhibits clean functional or object-oriented software design. In this dissertation, a method for solving the problems that IoC introduces is presented. It presents a way to model both synchronous and different types of asynchronous tasks with the continuation monad. The continuation monad serves as a primitive to build more complex control flow structures that mimic the control flow structures of the host programming language. It also allows for building more complex control structures specialized for parallelism, transactional execution, and for simulating functional programming idioms with asynchronous tasks through a generalization of the continuation monad that allows the asynchronous tasks to generate results one at a time. This allows for writing programming systems with asynchronously executed components by writing seemingly synchronous imperati- ve or functional code while leaving it up to the compiler to do all the heavy lifting and convert the written code to asynchronously executed set of tasks. Another benefit of the presented method is that it allows for easier automatic handling of the data lifetime without the need for garbage collection. This method has been successfully applied and tested in several Free/Libre Open Source Software and proprietary real-world software projects used by hun- dreds of millions of people around the world. In this dissertation, an example of a secure project management system is described which is based on a similar system implemented as a part of the KDE Plasma project. This dissertation also contains the important parts of the implementation of the AsynQt library which extends the Qt library, and its concurrency primitive – QFuture class – with functional reactive programming patterns based on the method proposed in this dissertation. URI: http://hdl.handle.net/123456789/4738 Files in this item: 1
ivan_cukic_phd.pdf ( 1.328Mb ) -
Brannon, R. M. (University of New Mexico, Albuquerque , 2003)[more][less]
-
Das, Shantanu (Springer , 2011)[more][less]
-
Tanović, Predrag (Montreal , 1994)[more][less]
Abstract: The thesis is a research about nonisolation properties of superstable types over finite domains in general. Two notions of nonisoltions, the notion of eventual-strong (i.e. esn) and the notion of internal are introduced. The thesis consists of three chapters. In Chapter 1 of the thesis the techniques of the stability theory which are used in Chapter 2 and Chapter 3 are overviewed. In Chapter 2 of the thesis NDFC theories are studied and the notions of dimension and U_α-rank through partial orders are developed. It is proved that if the theory T is strictly stable and the the order type of rationals cannot be embedded into the fundamental order of $T$ and there is no strictly stable group interpretable in T^eq, then the theory T has continuum non-isomorphic countable models. It is noted that strongly non-isolated types can be present due to the dimensional discontinuity property. In Chapter 3 of the thesis small superstable theories are studied. In the first part of that chapter the eventual-strong and internally nonisolated types are considered, and some properties were proved. The second part of Chapter 3 contains the proof of the following theorem: if the theory T is a complete, superstable theory, the generic type of every simple group definable in T^eq is orthogonal to all NENI types and sup{U(p)|pϵS(T)}≥ ω^ω holds, then the theory T has continuum non-isomorphic countable models. URI: http://hdl.handle.net/123456789/186 Files in this item: 1
phdPredragTanovic.pdf ( 2.221Mb ) -
Makowski, J.; Stumpf, H.; Hackl, K. (ELSEVIER , 2005)[more][less]
-
Bar-Meir, Genick (Minneapolis , 2006)[more][less]
URI: http://hdl.handle.net/123456789/3526 Files in this item: 1
Fundamentals_of_Compressible.pdf ( 3.210Mb ) -
Lomax, Harvard; Pulliam, H. Thomas; Zingg, W. David (NASA , 1999)[more][less]
-
Zucker, D. Robert; Biblarz, Oscar (JOHN WILEY & SONS, INC. , 2002)[more][less]
-
Watkins, S. David (WILEY , 2010)[more][less]
-
Walecka, D. John (World Scientific , 2000)[more][less]
-
Lewis, W. Roland; Nithiarasu, Perumal; Seetharamu, N. Kankanhalli (John Wiley & Sons, Ltd , 2004)[more][less]
-
Hastenes, David (Dordrecht , 1987)[more][less]
-
Bilimović, Anton (Beograd , 1961)[more][less]
-
Milisavljević, R. Slaviša (Belgrade , 2013)[more][less]
Abstract: The problem of the minimal mutual distances for two confocal elliptical orbits (local minima), in the literature known as the proximity calculation for minor planets and recognised recently as Minimal Orbit Intersection Distance – MOID, occupies a very important place in astronomical studies, not only because of the prediction of possible collisions of asteroids and other celestial bodies, but also because of the fact that by analysing the behaviour of asteroids during their encounters it is possible to determine their masses, changes of orbital elements and other important characteristics. Dealing with this problem in this thesis the author has analysed the distance function for two elliptical confocal orbits of minor planets combining analytical and numerical methods for proximity calculation. A survey of all relevant results in this field from the middle of the XIX century till our days indicates that the problem has been transformed from looking for a solution of two transcendental equations by applying various methods and approximations of long duration towards efficient and rapid solutions of vector equations of the system which describes the problem. In the thesis a simple and efficient analytic-numerical method has been developed, presented and applied. It finds out all the minima and maxima in the distance function and, indirectly, makes it possible to determine also the inflection points. The method is essentially based on Simovljevic’s (1974) graphical interpretation and on transcendental equations developed by Lazovic (1993). The present method has been examined on almost three million pairs of real elliptical asteroid orbits and its possibilities and the computation results have been compared to the algebraic solutions given by Gronchi (2005). The case of a pair of confocal orbits with four proximities found by Gronchi (2002), who applied the method of random samples and carried out numerous simulations with different values of orbital elements, gave the motivation to try here to find out such a pair among the real pairs of asteroid orbits. Thanks to the efficacy of the method developed in the thesis two such pairs have been found and their parameters are presented. In addition to the one meantioned above a further analysis of distance function through simulations including more than 20 million different pairs of asteroid orbits has resulted in several additional interesting solutions of the distance function. The results are given in the form of tables and plots showing the diversity of solutions for the distance function. URI: http://hdl.handle.net/123456789/2490 Files in this item: 1
phdSlavisaMilisavljevic.pdf ( 3.815Mb ) -
Miletić, Nevena (Beograd , 2019)[more][less]
-
Joksimović, Dušan (Beograd , 2015)[more][less]