Random variate genration is an important tool in statistical computing. Many programms for simulation or statistical computing (e.g. R) provide a collection of random variate generators for many standard distributions. However, as statistical modeling has become more sophisticated there is demand for larger classes of distributions. Adding generators for newly required distribution seems not to be the solution to this problem. Instead so called automatic (or black-box) methods have been developed in the last decade for sampling from fairly large classes of distributions with a single piece of code. For such algorithms a data about the distributions must be given; typically the density function (or probability mass function), and (maybe) the (approximate) location of the mode. In this contribution we show how such algorithms work and suggest an interface for R as an example of a statistical library. (author's abstract) / Series: Preprint Series / Department of Applied Statistics and Data Processing

Spanwise nonuniformity effects are modeled in the cross-sectional analysis of beam theory. This modeling adheres to an established numerical framework on cross-sectional analysis of uniform beams with arbitrary cross-sections. This framework is based on two concepts: decomposition of the rotation tensor and the variational-asymptotic method. Allowance of arbitrary materials and geometries in the cross-section is from discretization of the warping field by finite elements. By this approach, dimensional reduction from three-dimensional elasticity is performed rigorously and the sectional strain energy is derived to be asymptotically-correct. Elastic stiffness matrices are derived for inputs into the global beam analysis. Recovery relations for the displacement, stress, and strain fields are also derived with care to be consistent with the energy. Spanwise nonuniformity effects appear in the form of pointwise and sectionwise derivatives, which are approximated by finite differences. The formulation also accounts for the effects of spanwise variations in initial twist and/or curvature. A linearly tapered isotropic strip is analyzed to demonstrate spanwise nonuniformity effects on the cross-sectional analysis. The analysis is performed analytically by the variational-asymptotic method. Results from beam theory are validated against solutions from plane stress elasticity. These results demonstrate that spanwise nonuniformity effects become significant as the rate at which the cross-sections vary increases. The modeling of transverse shear modes of deformation is accomplished by transforming the strain energy into generalized Timoshenko form. Approximations in this transformation procedure from previous works, when applied to uniform beams, are identified. The approximations are not used in the present work so as to retain more accuracy. Comparison of present results with those previously published shows that these approximations sometimes change the results measurably and thus are inappropriate. Static and dynamic results, from the global beam analysis, are calculated to show the differences between using stiffness constants from previous works and the present work. As a form of validation of the transformation procedure, calculations from the global beam analysis of initially twisted isotropic beams from using curvilinear coordinate axes featuring twist are shown to be equivalent to calculations using Cartesian coordinates.

This thesis describes and evaluates a number of approaches and algorithms for nonuniform correction (NUC) and suppression of fixed pattern noise in a image sequence. The main task for this thesis work was to create a general NUC for infrared focal plane arrays. To create a radiometrically correct NUC, reference based methods using polynomial approximation are used instead of the more common scene based methods which creates a cosmetic NUC. The pixels that can not be adjusted to give a correct value for the incomming radiation are defined as dead. Four separate methods of identifying dead pixels are used to find these pixels. Both the scene sequence and calibration data are used in these identifying methods. The algorithms and methods have all been tested by using real image sequences. A graphical user interface using the presented algorithms has been created in Matlab to simplify the correction of image sequences. An implementation to convert the corrected values from the images to radiance and temperature is also performed.

Multi-agent systems are extensively used in several applications. An important class of applications involves the optimal spatial distribution of a group of mobile robots on a given area, where the optimality refers to the assignment of subregions to the robots, in such a way that a suitable coverage metric is maximized. Typically the coverage metric encodes a risk distribution defined on the area, and a measure of the performance of individual robots with respect to points inside the region of interest. The coverage metric will be maximized when the set of mobile robots configure themselves as the centroids of the Voronoi tessellation dictated by the risk density. In this work we advance on this result by considering a generalized area control problem in which the coverage metric is non-autonomous, that coverage metric is time varying independently of the states of the robots. This generalization is motivated by the study of coverage control problems in which the coordinated motion of a set of mobile robots accounts for the kinematics of objects penetrating from the outside. Asymptotic convergence and optimality of the non-autonmous system are studied by means of Barbalat's Lemma, and connections with the kinematics of the moving intruders is established. Several numerical simulation results are used to illustrate theoretical predictions.

In this paper we study the error behavior of the well known fast Fourier transform for nonequispaced data (NFFT) with respect to the L2-norm. We compare the arising errors for different window functions and show that the accuracy of the algorithm can be significantly improved by modifying the shape of the window function. Based on the considered error estimates for different window functions we are able to state an easy and efficient method to tune the involved parameters automatically. The numerical examples show that the optimal parameters depend on the given Fourier coefficients, which are assumed not to be of a random structure or roughly of the same magnitude but rather subject to a certain decrease.

Motion planning consists of finding a feasible path of an object between an initial state and a goal state, and commonly constitutes a sub-system of a larger autonomous system. Motion planners that utilize sampling-based algorithms create an implicit representation of the search space via sampling said search space. Autonomous systems that rely on real-time motion planning benefit from the ability of these algorithms to quickly compute paths that are optimal or near optimal. For sampling-based motion planning algorithms, the sampling strategy greatly affects the convergence speed of finding these paths, i.e., how the sampling distribution is shaped within the search space. In baseline approaches, the samples may be drawn with uniform probability over this space. This thesis project explores a learning-based approach that can utilize experience from previous successful motion plans to provide useful information in novel planning scenarios, as a means of improvement over conventional motion planning methods. Specifically, the focus has been on learning the sampling distributions in both the state space and the control space of an autonomous ground vehicle. The innovatory parts of this work consist of (i) learning the control space sampling distributions, and (ii) learning said distributions for a tractor-trailer system. At the core of the method is an artificial neural network consisting of a conditional variational autoencoder. This artificial neural network is capable of learning suitable sampling distributions in both the state space and control space of a vehicle in different planning scenarios. The method is tested in four different environments and for two kinds of vehicles. Evaluation is partly done by comparison of results with a conventional motion planning algorithm. These evaluations indicates that the artificial neural network can produce valuable information in novel planning scenarios. Future work, primarily on how the artificial neural network may be applied to motion planning algorithms, is necessary to draw further conclusions. / Rörelseplanering består av att hitta en genomförbar bana för ett objekt mellan ett initialtillstånd och ett måltillstånd, och utgör vanligtvis ett delsystem av ett större autonomt system. Rörelseplanerare som använder provtagningssbaserade algoritmer skapar en implicit representation av sökutrymmet via provtagning av sökutrymmet. Autonoma system som förlitar sig på rörelseplanering i realtid drar nytta av dessa algoritmers förmåga att snabbt beräkna banor som är optimala eller nästan optimala. För provtagningssbaserade rörelseplaneringsalgoritmer påverkar provtagningsstrategin i hög grad konvergenshastigheten för att hitta dessa vägar, dvs. hur provtagningsfördelningen är formad inom sökutrymmet. I standardmetoder kan stickproven dras med jämn sannolikhet över detta utrymme. Detta examensarbete utforskar en lärande-baserat metod som kan utnyttja erfarenheter från tidigare lyckade rörelseplaner för att tillhandahålla användbar information i nya planeringsscenarier, som ett medel för förbättring jämfört med konventionella rörelseplaneringsmetoder. Specifikt har fokus legat på att lära sig provtagningssfördelningarna i både tillståndsrummet och styrsignals-rummet för ett autonomt markfordon. De nyskapande delarna av detta arbete består av att (i) lära sig kontrollutrymmessamplingsfördelningarna, och (ii) inlärning av nämnda provtagningsfördelningarna för ett traktor-släpsystem. Kärnan i metoden är ett artificiellt neuralt nätverk bestående av en conditional variational autoencoder. Detta artificiella neurala nätverk är kapabelt att lära sig lämpliga provtagningsfördelningar i både tillståndsrummet och kontrollrummet för ett fordon i olika planeringsscenarier. Metoden testas i fyra olika miljöer och för två olika av fordon. Utvärdering görs delvis genom jämförelse av resultat med en konventionell rörelseplaneringsalgoritm. Dessa utvärderingar tyder på att det artificiella neurala nätverket kan producera värdefull information i nya planeringsscenarier. Mer forskning, i första hand med hur det artificiella neurala nätverket kan tillämpas på rörelseplaneringsalgoritmer, är nödvändigt för att dra ytterligare slutsatser.

<p dir="ltr">Post-tensioned concrete is a popular structural system in modern bridge design, allowing for longer bridge spans and the construction of curved, spliced, and segmental girders. When designed and constructed properly, post-tensioned concrete can offer improved durability over reinforced concrete as it is more resistant to cracking. However, corrosion of prestressing strands can compromise the integrity of post-tensioned construction. Grouting has been the primary method of providing corrosion protection to the prestressing strands. However, grouting of tendons presents numerous limitations and results in multiple problems in practice. As a result, there has been increased interest in the use of unbonded tendons. Corrosion protection can still be achieved in unbonded tendons through the use of flexible fillers such as grease and microcrystalline wax. Limited research has been conducted on unbonded tendons, and no known research exists regarding the behavior of unbonded tendons subject to torsion. The objective of this research was to investigate the torsional behavior and strength of unbonded post-tensioned bridge girders. The scope of work included testing six specimens to investigate the difference in behavior between bonded and unbonded tendons as well as the influence of internal versus external ducts. The influence of transverse reinforcement was also considered.</p>

L'étude des excitations magnétiques de faible amplitude existant dans des films minces à aimantation non uniforme dans la gamme des hautes fréquences, typiquement entre quelques dizaines de MHz et quelques dizaines de GHz, constitue le sujet de ce mémoire. Le cas idéal de films magnétiques possédant une anisotropie perpendiculaire et présentant une configuration d'équilibre de l'aimantation sous forme de rubans parallèles et périodiques est étudié en détail. Dans le cas de films à forte anisotropie perpendiculaire, les spectres théoriques de susceptibilité dynamique calculés à l'aide de modèles analytiques puis, à partir de simulations numériques 2D de micromagnétisme dynamique, font apparaître des excitations localisées soit à l'intérieur des domaines magnétiques soit à l'intérieur des parois magnétiques. Ces résultats ont été comparés de façon satisfaisante avec des résultats expérimentaux issus de mesures de résonance ferromagnétique réalisées sur des films monocristallins de grenats ferrimagnétiques. Toutefois, les largeurs de raie expérimentales associées aux excitations de parois excèdent celles calculées en utilisant le terme dissipatif de Gilbert. Dans le cas de films à faible anisotropie perpendiculaire, les spectres théoriques de susceptibilité dynamique présentent de multiples excitations magnétiques liées à la forte hétérogénéité des configurations d'équilibre de l'aimantation de type rubans faibles. Les analyses modales effectuées à partir des simulations micromagnétiques dynamiques indiquent l'existence de modes de surface et de volume localisés dans différentes régions de spins à l'intérieur du film. L'influence de différents paramètres (anisotropie perpendiculaire, épaisseur du film, champ magnétique statique) sur les principales caractéristiques des spectres (nombre de résonances, fréquences de résonance, intensités et largeurs de raie) est ensuite étudiée. Ces simulations micromagnétiques dynamiques permettent d'interpréter des spectres expérimentaux complexes de perméabilité dynamique mesurés sur des films ferromagnétiques amorphes. Quelques perspectives concernant la dynamique de l'aimantation de faible amplitude dans différents objets magnétiques sont ensuite présentées.

<p>In large multiprocessors, the access to shared memory is often nonuniform, and may vary as much as ten times for some distributed shared-memory architectures (DSMs). This dissertation identifies another important nonuniform property of DSM systems: <i>nonuniform communication architecture</i>, NUCA. High-end hardware-coherent machines built from large nodes, or from chip multiprocessors, are typical NUCA systems, since they have a lower penalty for reading recently written data from a neighbor's cache than from a remote cache. This dissertation identifies <i>node affinity</i> as an important property for scalable general-purpose locks. Several software-based hierarchical lock implementations exploiting NUCAs are presented and evaluated. NUCA-aware locks are shown to be almost twice as efficient for contended critical sections compared to traditional lock implementations.</p><p>The shared-memory “illusion”' provided by some large DSM systems may be implemented using either hardware, software or a combination thereof. A software-based implementation can enable cheap cluster hardware to be used, but typically suffers from poor and unpredictable performance characteristics.</p><p>This dissertation advocates a new software-hardware trade-off design point based on a new combination of techniques. The two low-level techniques, fine-grain deterministic coherence and synchronous protocol execution, as well as profile-guided protocol flexibility, are evaluated in isolation as well as in a combined setting using all-software implementations. Finally, a minimum of hardware trap support is suggested to further improve the performance of coherence protocols across cluster nodes. It is shown that all these techniques combined could result in a fairly stable performance on par with hardware-based coherence.</p>

The aim of this paper is to investigate the known nonuniform version of Esseen's inequality in the Lp-metric, to get a numerical bound for the appearing constant L. For a long time the results given by several authors constate the impossibility of a nonuniform estimation in the most interesting case δ=1, because the effect L=L(δ)=O(1/(1-δ)), δ->1-0, was observed, where 2+δ, 0<δ<1, is the order of the assumed moments of the considered independent random variables X_k, k=1,2,...,n. Again making use of the method of conjugated distributions, we improve the well-known technique to show in the most interesting case δ=1 the finiteness of the absolute constant L and to prove L=L(1)=<127,74*7,31^(1/p), p>1. In the case 0<δ<1 we only give the analytical structure of L but omit numerical calculations. Finally an example on normal approximation of sums of l_2-valued random elements demonstrates the application of the nonuniform mean central limit bounds obtained here. / Das Anliegen dieses Artikels besteht in der Untersuchung einer bekannten Variante der Esseen'schen Ungleichung in Form einer ungleichmäßigen Fehlerabschätzung in der Lp-Metrik mit dem Ziel, eine numerische Abschätzung für die auftretende absolute Konstante L zu erhalten. Längere Zeit erweckten die Ergebnisse, die von verschiedenen Autoren angegeben wurden, den Eindruck, dass die ungleichmäßige Fehlerabschätzung im interessantesten Fall δ=1 nicht möglich wäre, weil auf Grund der geführten Beweisschritte der Einfluss von δ auf L in der Form L=L(δ)=O(1/(1-δ)), δ->1-0, beobachtet wurde, wobei 2+δ, 0<δ<1, die Ordnung der vorausgesetzten Momente der betrachteten unabhängigen Zufallsgrößen X_k, k=1,2,...,n, angibt. Erneut wird die Methode der konjugierten Verteilungen angewendet und die gut bekannte Beweistechnik verbessert, um im interessantesten Fall δ=1 die Endlichkeit der absoluten Konstanten L nachzuweisen und um zu zeigen, dass L=L(1)=<127,74*7,31^(1/p), p>1, gilt. Im Fall 0<δ<1 wird nur die analytische Struktur von L herausgearbeitet, jedoch ohne numerische Berechnungen. Schließlich wird mit einem Beispiel zur Normalapproximation von Summen l_2-wertigen Zufallselementen die Anwendung der gewichteten Fehlerabschätzung im globalen zentralen Grenzwertsatz demonstriert.