Postcard distributed by M. Molling & Co., Hannover, to commemorate the 100th anniversary of Friedrich Schiller's death.

Addressed to Therese Gottschalk nee Molling, postmarked 25 April 1905 and mailed from Hannover to Hildesheim, most likely while Therese was visiting her Meyerhof grandparents

Postcard distributed by M. Molling & Co. to commemorate the 100th anniversary of Friedrich Schiller's death; Hannover, Germany. Advertisements

Addressed to Therese Gottschalk nee Molling, postmarked 25 April 1905 and mailed from Hannover to Hildesheim, most likely while Therese was visiting her Meyerhof grandparents

The extent of population genetic subdivision differs among four co-distributed shark species in the Indo-Australian archipelago

Background: The territorial fishing zones of Australia and Indonesia are contiguous to the north of Australia in the Timor and Arafura Seas and in the Indian Ocean to the north of Christmas Island. The area surrounding the shared boundary consists of a variety of bio-diverse marine habitats including shallow continental shelf waters, oceanic trenches and numerous offshore islands. Both countries exploit a variety of fisheries species, including whaler (Carcharhinus spp.) and hammerhead sharks (Sphyrna spp.). Despite their differences in social and financial arrangements, the two countries are motivated to develop complementary co-management practices to achieve resource sustainability. An essential starting point is knowledge of the degree of population subdivision, and hence fisheries stock status, in exploited species. Results: Populations of four commercially harvested shark species (Carcharhinus obscurus, Carcharhinus sorrah, Prionace glauca, Sphyrna lewini) were sampled from northern Australia and central Indonesia. Neutral genetic markers (mitochondrial DNA control region sequence and allelic variation at co-dominant microsatellite loci) revealed genetic subdivision between Australian and Indonesian populations of C. sorrah. Further research is needed to address the possibility of genetic subdivision among C. obscurus populations. There was no evidence of genetic subdivision for P. glauca and S. lewini populations, but the sampling represented a relatively small part of their distributional range. For these species, more detailed analyses of population genetic structure is recommended in the future. Conclusion: Cooperative management between Australia and Indonesia is the best option at present for P. glauca and S. lewini, while C. sorrah and C. obscurus should be managed independently. On-going research on these and other exploited shark and ray species is strongly recommended. Biological and ecological similarity between species may not be a predictor of population genetic structure, so species-specific studies are recommended to provide new data to assist with sustainable fisheries management.

Performance Study of a Centralized Concurrency Control Algorithm for Distributed Database Systems using SIMULA

The stimulation technique has gained much importance in the performance studies of Concurrency Control (CC) algorithms for distributed database systems. However, details regarding the simulation methodology and implementation are seldom mentioned in the literature. One objective of this paper is to elaborate the simulation methodology using SIMULA. Detailed studies have been carried out on a centralised CC algorithm and its modified version. The results compare well with a previously reported study on these algorithms. Here, additional results concerning the update intensiveness of transactions and the degree of conflict are obtained. The degree of conflict is quantitatively measured and it is seen to be a useful performance index. Regression analysis has been carried out on the results, and an optimisation study using the regression model has been performed to minimise the response time. Such a study may prove useful for the design of distributed database systems.

Distributed Scheduling for Multi-Hop Wireless Networks

We study the performance of greedy scheduling in multihop wireless networks where the objective is aggregate utility maximization. Following standard approaches, we consider the dual of the original optimization problem. Optimal scheduling requires selecting independent sets of maximum aggregate price, but this problem is known to be NP-hard. We propose and evaluate a simple greedy heuristic. We suggest how the greedy heuristic can be implemented in a distributed manner. We evaluate an analytical bound in detail, for the special case of a line graph and also provide a loose bound on the greedy heuristic for the case of an arbitrary graph.

Two Tools for Interprocess Communication in Distributed Data-Flow Systems

Abstract is not available.

Implementation of CSP-S for description of distributed algorithms

The implementation of CSP-S (a subset of CSP)—a high level language for distributed programming—is presented in this paper. The language CSP-S features a parallel command, communication by message passing and the use of guarded command. The implementation consists of a compiler translating the CSP-S constructs into intermediate language. The execution is carried out by a scheduler which creates an illusion of concurrency. Using the CSP-S language constructs, distributed algorithms are written, executed and tested with the compiler designed.

Worst-Case Asymmetric Distributed Source Coding

We consider the asymmetric distributed source coding problem, where the recipient interactively communicates with N correlated informants to gather their data. We are mainly interested in minimizing the worst-case number of informant bits required for successful data-gathering at recipient, but we are also concerned with minimizing the number of rounds as well as the number of recipient bits. We provide two algorithms, one that optimally minimizes the number of informant bits and other that trades-off the number of informant bits to efficiently reduce the number of rounds and number of recipient bits.

Postcard distributed by M. Molling & Co., Hannover, to commemorate the 100th anniversary of Friedrich Schiller's death.

Addressed to Therese Gottschalk nee Molling, postmarked 25 April 1905 and mailed from Hannover to Hildesheim, most likely while Therese was visiting her Meyerhof grandparents

Postcard distributed by M. Molling & Co. to commemorate the 100th anniversary of Friedrich Schiller's death; Hannover, Germany. Advertisements

Addressed to Therese Gottschalk nee Molling, postmarked 25 April 1905 and mailed from Hannover to Hildesheim, most likely while Therese was visiting her Meyerhof grandparents

Documents regarding number of recipients and amount of cash distributed; Juedische Winterhilfe der Juedische Gemeinde; Berlin Jewish Institutions

"25851 Personen betreute die Juedische Winterhilfe mit Regelleistungen. 2300 Barbeihilfen im Werte von 54000 Mark wurden an Betreute gezahlt"

Dissipativeness and Stability of a Class of Distributed Parameter Systems

Input-output stability of linear-distributed parameter systems of arbitrary order and type in the presence of a distributed controller is analyzed by extending the concept of dissipativeness, with certain modifications, to such systems. The approach is applicable to systems with homogeneous or homogenizable boundary conditions. It also helps in generating a Liapunov functional to assess asymptotic stability of the system.

Topological Quantum Computation - An Analysis of an Anyon Model Based on Quantum Double Symmetries

There exists various suggestions for building a functional and a fault-tolerant large-scale quantum computer. Topological quantum computation is a more exotic suggestion, which makes use of the properties of quasiparticles manifest only in certain two-dimensional systems. These so called anyons exhibit topological degrees of freedom, which, in principle, can be used to execute quantum computation with intrinsic fault-tolerance. This feature is the main incentive to study topological quantum computation. The objective of this thesis is to provide an accessible introduction to the theory. In this thesis one has considered the theory of anyons arising in two-dimensional quantum mechanical systems, which are described by gauge theories based on so called quantum double symmetries. The quasiparticles are shown to exhibit interactions and carry quantum numbers, which are both of topological nature. Particularly, it is found that the addition of the quantum numbers is not unique, but that the fusion of the quasiparticles is described by a non-trivial fusion algebra. It is discussed how this property can be used to encode quantum information in a manner which is intrinsically protected from decoherence and how one could, in principle, perform quantum computation by braiding the quasiparticles. As an example of the presented general discussion, the particle spectrum and the fusion algebra of an anyon model based on the gauge group S_3 are explicitly derived. The fusion algebra is found to branch into multiple proper subalgebras and the simplest one of them is chosen as a model for an illustrative demonstration. The different steps of a topological quantum computation are outlined and the computational power of the model is assessed. It turns out that the chosen model is not universal for quantum computation. However, because the objective was a demonstration of the theory with explicit calculations, none of the other more complicated fusion subalgebras were considered. Studying their applicability for quantum computation could be a topic of further research.

Analysis and computation of the oil film thickness between the piston ring and cylinder liner of an internal combustion engine

A study of the essential features of piston rings in the cylinder liner of an internal combustion engine reveals that the lubrication problem posed by it is basically that of a slider bearing. According to steady-flow-hydrodynamics, viz. Image the oil film thickness becomes zero at the dead centre positions as the velocity, U = 0. In practice, however, such a phenomenon cannot be supported by consideration of the wear rates of pistion rings and cylinder liners. This can be explained by including the “squeeze” action term in the

Data distribution and task scheduling for distributed computing of all-to-all comparison problems

This research studied distributed computing of all-to-all comparison problems with big data sets. The thesis formalised the problem, and developed a high-performance and scalable computing framework with a programming model, data distribution strategies and task scheduling policies to solve the problem. The study considered storage usage, data locality and load balancing for performance improvement in solving the problem. The research outcomes can be applied in bioinformatics, biometrics and data mining and other domains in which all-to-all comparisons are a typical computing pattern.