No description available.

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Civil Engineering, 1980 / Bibliography: leaves 441-455. / by Peter Douglas Hall. / Ph. D. / Ph. D. Massachusetts Institute of Technology, Department of Civil Engineering

Although different authors mean different thing by the term "digital libraries," one common thread is that they include or are built around collections of digital objects. Digital libraries also provide services to large communities, one of which is almost always search. Digital library collections, however, have several characteristic features that make search difficult. They are typically very large. They typically involve many different kinds of objects, including but not limited to books, e-published documents, images, and hypertexts, and often including items as esoteric as subtitled videos, simulations, and entire scientific databases. Even within a category, these objects may have widely different formats and internal structure. Furthermore, they are typically in complex relationships with each other and with such non-library objects as persons, institutions, and events. Relationships are a common feature of traditional libraries in the form of "See / See also" pointers, hierarchical relationships among categories, and relations between bibliographic and non-bibliographic objects such as having an author or being on a subject. Binary relations (typically in the form of directed links) are a common representational tool in computer science for structures from trees and graphs to semantic networks. And in recent years the World-Wide Web has made the construct of linked information objects commonplace for millions. Despite this, relationships have rarely been given "first-class" treatment in digital library collections or software. MARIAN is a digital library system designed and built to store, search over, and retrieve large numbers of diverse objects in a network of relationships. It is designed to run efficiently over large collections of digital library objects. It addresses the problem of object diversity through a system of classes unified by common abilities including searching and presentation. Divergent internal structure is exposed and interpreted using a simple and powerful graphical representation, and varied format through a unified system of presentation. Most importantly, MARIAN collections are designed to specifically include relations in the form of an extensible collection of different sorts of links. This thesis presents MARIAN and argues that it is both effective and efficient. MARIAN is effective in that it provides new and useful functionality to digital library end-users, and in that it makes constructing, modifying, and combining collections easy for library builders and maintainers. MARIAN is efficient since it works from an abstract presentation of search over networked collections to define on the one hand common operations required to implement a broad class of search engines, and on the other performance standards for those operations. Although some operations involve a high minimum cost under the most general assumptions, lower costs can be achieved when additional constraints are present. In particular, it is argued that the statistics of digital library collections can be exploited to obtain significant savings. MARIAN is designed to do exactly that, and in evidence from early versions appears to succeed. In conclusion, MARIAN presents a powerful and flexible platform for retrieval on large, diverse collections of networked information, significantly extending the representation and search capabilities of digital libraries. / Ph. D.

Robbins' problem is an optimal stopping problem where one seeks to minimize the expected rank of their observations among all observations. We examine random walk analogs to Robbins' problem in both discrete and continuous time. In discrete time, we consider full information and relative ranks versions of this problem. For three step walks, we give the optimal stopping rule and the expected rank for both versions. We also give asymptotic upper bounds for the expected rank in discrete time. Finally, we give upper and lower bounds for the expected rank in continuous time, and we show that the expected rank in the continuous time problem is at least as large as the normalized asymptotic expected rank in the full information discrete time version.

This doctoral thesis consists of five research articles on the general topic of optimal decision making under uncertainty in a Bayesian framework. The papers are preceded by three introductory chapters. Papers I and II are dedicated to the problem of finding an optimal stopping strategy to liquidate an asset with unknown drift. In Paper I, the price is modelled by the classical Black-Scholes model with unknown drift. The first passage time of the posterior mean below a monotone boundary is shown to be optimal. The boundary is characterised as the unique solution to a nonlinear integral equation. Paper II solves the same optimal liquidation problem, but in a more general model with stochastic regime-switching volatility. An optimal liquidation strategy and various structural properties of the problem are determined. In Paper III, the problem of sequentially testing the sign of the drift of an arithmetic Brownian motion with the 0-1 loss function and a constant cost of observation per unit of time is studied from a Bayesian perspective. Optimal decision strategies for arbitrary prior distributions are determined and investigated. The strategies consist of two monotone stopping boundaries, which we characterise in terms of integral equations. In Paper IV, the problem of stopping a Brownian bridge with an unknown pinning point to maximise the expected value at the stopping time is studied. Besides a few general properties established, structural properties of an optimal strategy are shown to be sensitive to the prior. A general condition for a one-sided optimal stopping region is provided. Paper V deals with the problem of detecting a drift change of a Brownian motion under various extensions of the classical Wiener disorder problem. Monotonicity properties of the solution with respect to various model parameters are studied. Also, effects of a possible misspecification of the underlying model are explored.

We generalize the theory of stochastic impulse control of jump diffusions introduced by Oksendal and Sulem (2004) with milder assumptions. In particular, we assume that the original process is affected by the interventions. We also generalize the optimal central bank intervention problem including market reaction introduced by Moreno (2007), allowing the exchange rate dynamic to follow a jump diffusion process. We furthermore generalize the approximation theory of stochastic impulse control problems by a sequence of iterated optimal stopping problems which is also introduced in Oksendal and Sulem (2004). We develop new results which allow us to reduce a given impulse control problem to a sequence of iterated optimal stopping problems even though the original process is affected by interventions. / by Sandun C. Perera. / Thesis (Ph.D.)--Florida Atlantic University, 2009. / Includes bibliography. / Electronic reproduction. Boca Raton, Fla., 2009. Mode of access: World Wide Web.

The paper deals with the problem of finding an optimal one-time rebalancing strategy for the Bachelier model, and makes some remarks for the similar problem within Black-Scholes model. The problem is studied on finite time interval under mean-square criterion of optimality. The methods of the paper are based on the results for optimal stopping problem and standard mean-square criterion. The solution of the problem, considered in the paper, let us interpret how and - that is more important for us -when investor should rebalance the portfolio, if he wants to hedge it in the best way.

Στην διπλωματική εργασία γίνεται μελέτη της κωδικοποίησης καναλιού, μελέτη των προβλημάτων που εισάγει το κανάλι, μελετώνται σε βάθος οι turbo κωδικοποιητές και διάφορα κριτήρια τερματισμού, γίνεται μελέτη της επίδρασης της πεπερασμένης ακρίβειας σε turbo συστήματα και προτείνονται αρχιτεκτονικές για την υλοποίηση των turbo αποκωδικοποιητών. / In this thesis we study the problem of channel coding, particularly we study turbo coding and termination criteria. Moreover we study the impact of fix point arithmetic on early stopping iterative turbo decoders and we proposed architectures for the implementation of turbo decoders in hardware.

Les processus markoviens déterministes par morceaux (PMDM) ont été introduits dans la littérature par M.H.A. Davis en tant que classe générale de modèles stochastiques non-diffusifs. Les PMDM sont des processus hybrides caractérisés par des trajectoires déterministes entrecoupées de sauts aléatoires. Dans cette thèse, nous développons des méthodes numériques adaptées aux PMDM en nous basant sur la quantification d'une chaîne de Markov sous-jacente au PMDM. Nous abordons successivement trois problèmes : l'approximation d'espérances de fonctionnelles d'un PMDM, l'approximation des moments et de la distribution d'un temps de sortie et le problème de l'arrêt optimal partiellement observé. Dans cette dernière partie, nous abordons également la question du filtrage d'un PMDM et établissons l'équation de programmation dynamique du problème d'arrêt optimal. Nous prouvons la convergence de toutes nos méthodes (avec le plus souvent des bornes de la vitesse de convergence) et les illustrons par des exemples numériques. / Piecewise-deterministic Markov processes (PDMP’s) have been introduced by M.H.A. Davis as a general class of non-diffusive stochastic models. PDMP’s are hybrid Markov processes involving deterministic motion punctuated by random jumps. In this thesis, we develop numerical methods that are designed to fit PDMP's structure and that are based on the quantization of an underlying Markov chain. We deal with three issues : the approximation of expectations of functional of a PDMP, the approximation of the moments and of the distribution of an exit time and the partially observed optimal stopping problem. In the latter one, we also tackle the filtering of a PDMP and we establish the dynamic programming equation of the optimal stopping problem. We prove the convergence of all our methods (most of the time, we also obtain a bound for the speed of convergence) and illustrate them with numerical examples.

This diploma thesis is engaged in analysis of braking process of vehicles, especially heavy utility vehicles, with regard to their instantaneous weight. This thesis features survey and division of braking systems and function of brakes including schemes and descriptions. Also there is introduce of some systems improving vehicle properties. Furthermore this work puts mind to possibilities of examination of brakes, measurement of braking distance and braking retardation namely in brake test rooms or by outdoor driving tests including descriptions of particular methods and equipment. There is also mention about legislative requirements for braking distance and braking retardation. The conclusion of this thesis compares numerically predicted braking distance and real braking distance measured for factual vehicle during outdoor driving test