Thesis (doctoral)--Universität Erlangen-Nürnberg.

Thesis (doctoral)--Philipp-Universität zu Marburg.

Thesis (doctoral)--Universität Marburg.

This study seeks to understand how agencies with strict land use requirements and plan formulate and translate land use objectives into budgets and spending priorities. Characteristics such as legislation, policy and management body structure were examined alongside various influences to determine the extent to which these decision processes are impacted and provide insight into how such influences may be usefully levered and potentially transferred to other situations. In particular, the research was focussed on some of the "drivers" to the budgeting and land use prioritising processes. It is often argued that objectives are established in the annual business or corporate plan for the area and the budget follows this. However the intention of the research is to show that finances do indeed affect achieving the objectives but not in a direct cost manner. The research is primarily qualitative given the nature of what was being evaluated; the discrepancy between the offici al view of what should be, and what is taking place from the decision makers view was brought to light through a study of the intervening processes. This study strongly suggests that, although the organisational structures and administrative processes have substantially changed and evolved over the past twenty years resulting in today's Parks Canada and Scottish Natural Heritage, the tools used by these agencies to translate land use objectives into budgets and spending priorities have not. As a result, external influences that could be anticipated and planned for are excluded along with recognition of any potential benefits these influences could bring. Further, efforts to facilitate collaborative management have had only limited successes due on the most part to the constituent authorities using these antiquated tools and the lack of a meaningful evaluation process to measure the success of collaborative management efforts. That is budgeting and planning/resource allocation processes do not reward or encourage collaboration and may, in fact, inhibit such efforts at a management level.

Thesis (doctoral)--Erasmus Universiteit Rotterdam, 2006. / Includes bibliographical references (leaves 356-367). Also available online (PDF file) by a subscription to the set or by purchasing the individual file.

Thesis (doctoral)--Erasmus Universiteit Rotterdam, 2006. / Includes bibliographical references (leaves 356-367).

Cēgə Trouhèst is a three-movement work of about thirteen minutes duration. The text by the composer provides a vehicle for aural stimulation only. Cēgə Trouhèst is a continuum of resonances embellished by melodic and rhythmic passages. These embellishments along with other devices and the choice of instrumentation all contribute to the development of the varied timbres. The first two movements introduce the material to be employed in the third, which continues the idea of change exhibited in the text by modification and extraction. Timbre is the most important aspect of this work. It is exploited homophonically, contrapuntally, and through instrumental/vocal interchange and timbre modification of a single tone.

No description available.

No description available.

The study of shared memory concurrency is extensive. There exist many state-of-the-art strategies for dealing with fundamental concurrency problems, such as race conditions or deadlocks, to leverage massive performance boosts out of modern multiprocessors. With the introduction of blockchain technology as a popular financial tool, we observe many decades-old concurrency problems re-emerge within the context of decentralized networks. These challenges introduce additional constraints, such as the lack of hardware atomic instructions like Compare-And-Swap, or the potential for malicious clients to join the network. In this dissertation, we propose key algorithms which adapt knowledge from the domain of shared memory concurrency to solve emerging concurrency problems in decentralized networks. We propose three key algorithms which further the state of the art in decentralized networks. (1) We present Hash-Mark-Set, a concurrent algorithm for providing a read-uncommitted view of the blockchain state, enabling a higher success rate in transaction use cases where state changes frequently in relation to the block interval. (2) We propose Proof of Descriptor, a descriptor based consensus mechanism for decentralized networks. Proof of Descriptor utilizes well-known techniques from shared memory concurrent programming to create an efficient and scalable algorithm for blockchain consensus. (3) We propose a descriptor-based algorithm for concurrent execution of smart contracts that efficiently captures the concurrent execution as a graph of descriptors, enabling validators to analyze the concurrent execution and verify its results through re-execution.