Die Geschichte der Staaten des Ernestinischen Hauses Sachsen : des Grossherzogthums Weimar-Eisenach, und der Herzogthümer Altenburg, Meiningen-Hildburghausen-Saalfeld, und Coburg-Gotha /

Bound with the author's Die Geschichte des Königreiches Sachsen. Dresden : P. G. Hilscher, 1826.

La Saxe galante : ou Histoire des amours d'Auguste I, roi de Pologne.

Title page printed in red.

Itinéraire général des postes et relais : à l'usage des personnes qui voyagent sur le continent européen : comprenant la France, les Pays-Bays, l'Allemagne, l'Autriche, le Danemarck, l'Espagne, l'Italie, le Portugal, la Prusse, la Saxe, la Suède, la Russie, la Turquie d'Europe, etc., etc. : suivi des routes principales de la Suisse.

Goldsmiths'-Kress no. 23594.

Histoire de Maurice, comte de Saxe, duc de Courlande et de Sémigalle, maréchal général des camps & armées de Sa Majesté très chrétienne;

Mode of access: Internet.

Comédies de la princesse Amélie de Saxe.

La fiancée de la résidence.--L'oncle.--La fiancée du prince.

Memoirs of a young Greek lady; or, Madame Pauline Adelaide Alexandre Panam, versus His Most Serene Highness the reigning Prince of Saxe-Cobourg.

Translated by W. H. Ireland.

Bau- und Kunstdenkmäler Thüringens. Im Auftrage der Regierungen von Sachsen-Weimar-Eisenach, Sachsen-Meiningen-Hildburghausen, Sachsen-Altenburg, Sachsen-Coburg und Gotha Schwarzburg-Rudolstadt, Reuss älterer Linie und Reuss jüngerer Linie.

Heft 34 bearb. von P. Lehfeldt und G. Voss.

Manual of structural welding practice; Saxe system welded connection units for welded assembly.

Published in 1940 under title: Saxe welded erection system; in 1948: Manual of recommended practice.

Letters addressed to H.R.H. the Grand Duke of Saxe Coburg and Gotha, on the theory of probabilities, as applied to the moral and political sciences /

Translation of Lettres à S.A.R. le duc régnant de Saxe-Coburg et Gotha, sur la théorie des probabilités, appliquée aux sciences morales et politiques.

The poetical works of John Godfrey Saxe.

Illustrations wanting.

A new method for quantifying the contribution of different critical agents on railway bridge deterioration

Railway Bridges deteriorate over time due to different critical factors including, flood, wind, earthquake, collision, and environment factors, such as corrosion, wear, termite attack, etc. In current practice, the contributions of the critical factors, towards the deterioration of railway bridges, which show their criticalities, are not appropriately taken into account. In this paper, a new method for quantifying the criticality of these factors will be introduced. The available knowledge as well as risk analyses conducted in different Australian standards and developed for bridge-design will be adopted. The analytic hierarchy process (AHP) is utilized for prioritising the factors. The method is used for synthetic rating of railway bridges developed by the authors of this paper. Enhancing the reliability of predicting the vulnerability of railway bridges to the critical factors, will be the significant achievement of this research.

Incorporating complex train paths to an analysis of absolute capacity

Railways are an important mode of transportation. They are however large and complex and their construction, management and operation is time consuming and costly. Evidently planning the current and future activities is vital. Part of that planning process is an analysis of capacity. To determine what volume of traffic can be achieved over time, a variety of railway capacity analysis techniques have been created. A generic analytical approach that incorporates more complex train paths however has yet to be provided. This article provides such an approach. This article extends a mathematical model for determining the theoretical capacity of a railway network. The main contribution of this paper is the modelling of more complex train paths whereby each section can be visited many times in the course of a train’s journey. Three variant models are formulated and then demonstrated in a case study. This article’s numerical investigations have successively shown the applicability of the proposed models and how they may be used to gain insights into system performance.

Parallel mesh partitioning on distributed memory systems

The problem of deriving parallel mesh partitioning algorithms for mapping unstructured meshes to parallel computers is discussed in this chapter. In itself this raises a paradox - we seek to find a high quality partition of the mesh, but to compute it in parallel we require a partition of the mesh. In fact, we overcome this difficulty by deriving an optimisation strategy which can find a high quality partition even if the quality of the initial partition is very poor and then use a crude distribution scheme for the initial partition. The basis of this strategy is to use a multilevel approach combined with local refinement algorithms. Three such refinement algorithms are outlined and some example results presented which show that they can produce very high global quality partitions, very rapidly. The results are also compared with a similar multilevel serial partitioner and shown to be almost identical in quality. Finally we consider the impact of the initial partition on the results and demonstrate that the final partition quality is, modulo a certain amount of noise, independent of the initial partition.

Dynamic mesh partitioning and load-balancing for parallel computational mechanics codes

In this Chapter we discuss the load-balancing issues arising in parallel mesh based computational mechanics codes for which the processor loading changes during the run. We briefly touch on geometric repartitioning ideas and then focus on different ways of using a graph both to solve the load-balancing problem and the optimisation problem, both locally and globally. We also briefly discuss whether repartitioning is always valid. Sample illustrative results are presented and we conclude that repartitioning is an attractive option if the load changes are not too dramatic and that there is a certain trade-off between partition quality and volume of data that the underlying application needs to migrate.

JOSTLE: multilevel graph partitioning software: an overview

In this chapter we look at JOSTLE, the multilevel graph-partitioning software package, and highlight some of the key research issues that it addresses. We first outline the core algorithms and place it in the context of the multilevel refinement paradigm. We then look at issues relating to its use as a tool for parallel processing and, in particular, partitioning in parallel. Since its first release in 1995, JOSTLE has been used for many mesh-based parallel scientific computing applications and so we also outline some enhancements such as multiphase mesh-partitioning, heterogeneous mapping and partitioning to optimise subdomain shape