In the most abstract definition of its operational semantics, the declarative and concurrent programming language CHR is trivially non-terminating for a significant class of programs. Common refinements of this definition, in closing the gap to real-world implementations, compromise on declarativity and/or concurrency. Building on recent work and the notion of persistent constraints, we introduce an operational semantics avoiding trivial non-termination without compromising on its essential features.

A deterministic cycle scheduling of partitions at the operating system level is supposed for a multiprocessor system. In this paper, we propose a tool for generating such schedules. We use constraint based programming and develop methods and concepts for a combined interactive and automatic partition scheduling system. This paper is also devoted to basic methods and techniques for modeling and solving this partition scheduling problem. Initial application of our partition scheduling tool has proved successful and demonstrated the suitability of the methods used.

The difference-list technique is described in literature as effective method for extending lists to the right without using calls of append/3. There exist some proposals for automatic transformation of list programs into differencelist programs. However, we are interested in construction of difference-list programs by the programmer, avoiding the need of a transformation step. In [GG09] it was demonstrated, how left-recursive procedures with a dangling call of append/3 can be transformed into right-recursion using the unfolding technique. For simplification of writing difference-list programs using a new cons/2 procedure was introduced. In the present paper, we investigate how efficieny is influenced using cons/2. We measure the efficiency of procedures using accumulator technique, cons/2, DCG’s, and difference lists and compute the resulting speedup in respect to the simple procedure definition using append/3. Four Prolog systems were investigated and we found different behaviour concerning the speedup by difference lists. A result of our investigations is, that an often advice given in the literature for avoiding calls append/3 could not be confirmed in this strong formulation.

Thesis (M.S.)--Naval Postgraduate School, 2002. / Thesis advisor(s):Gordon Bradley, Saverio Manago. Includes bibliographical references (p. 87). Also available online.

Diss.--European Business School, 2009. / Includes bibliographical references.

Thesis (Ph. D.)--Ohio State University, 1971. / Includes bibliographical references (leaves 181-193). Available online via OhioLINK's ETD Center.

Thesis--Ph. D., University of Hong Kong, 1983.

Thesis (Ph. D.)--University of Hong Kong, 1988.

Thesis (M. Phil.)--University of Hong Kong, 1988.

Spin degrees of freedom have been extensively explored in the context of quantum information processing. Many proposals of quantum computation architectures use spins as carriers of quantum of information. A central problem is to efficiently generate quantum entanglement between spin qubits which proves to be a crucial resource for quantum information tasks. On the other hand, uncontrollable spin degrees of freedom in the environment of spin qubits are the major causes of errors at low temperature, for example, the lattice nuclear spins hyperfine coupled to single electron spin qubit localized in semiconductor nano-structures. An outstanding problem for scalable quantum computation is to suppress the collective fluctuations from such spin baths so that the coherence time of the spin qubit can be improved. With these two motivations, the problems of suppressing collective spin fluctuations and generating entanglement in various spin ensembles are addressed in this thesis. In the first half of the thesis, two approaches are introduced for suppressing the collective fluctuations in the nuclear spin bath so that the quantum coherence time of electron spin qubit in semiconductor quantum dots can be improved. The first approach works for a coupled double dot system. A theory for the interaction with the nuclear spins is developed when the two-electron singlet state is in resonance with one of the triplet state in moderate external magnetic field. At this resonance condition, the nuclear-electron flip-flop process caused by the hyperfine interaction can lead to a feedback mechanism, which can be used to suppress the nuclear hyperfine field. The second approach works for a single dot system. It is shown that strong pumping of the nuclear spins in dynamic nuclear polarization processes can saturate the nuclear spin bath towards the collective “dark states”. In such dark states, the transverse nuclear field fluctuation can be substantially suppressed compared to the value at thermal equilibrium. Two physical schemes are proposed to realize the nuclear dark states for suppression of the nuclear field fluctuations. In the second half of the thesis, schemes are presented for generating large scale quantum entanglement in two types of spin qubit systems. For atomic spin qubits in optical lattices, schemes are proposed on how to prepare pure spin coherent state (SCS) with low collective spin by incoherent pumping with collective spin raising and lowering operations. Such SCS realize networks of mutually entangled spins which can be idea resources for the quantum telecloning algorithm. For donor nuclear spin qubits in silicon architecture, proposals are shown on how to deterministic prepare Dicke states which constitute an important class of multipartite entangled states. Our scheme is capable of preparing both symmetric and asymmetric Dicke states which form a complete basis set of the spin Hilbert space. The required controls are in situ to the prototype Kane’s quantum computer. The preparation is robust because each desired Dicke state is the steady state under designed pumping process. The schemes presented here also make possible the construction of decoherence free subspaces where quantum information is protected from collective noises. / published_or_final_version / Physics / Doctoral / Doctor of Philosophy