Direct acceleration of solid-density plasma bunch by ultraintense laser

The interaction of a petawatt laser with a small solid-density plasma bunch is studied by particle-in-cell simulation. It is shown that when irradiated by a laser of intensity >10(21) W/cm(2), a dense plasma bunch of micrometer size can be efficiently accelerated. The kinetic energy of the ions in the high-density region of the plasma bunch can exceed ten MeV at a density in the 10(23)-cm(-3) level. Having a flux density orders of magnitude higher than that of the traditional charged-particle pulses, the laser-accelerated plasma bunch can have a wide range of applications. In particular, such a dense energetic plasma bunch impinging on the compressed fuel in inertial fusion can significantly enhance the nuclear-reaction cross section and is thus a promising alternative for fast ignition.

Direct simulation of quantum dynamics in complex systems

Accurate simulation of quantum dynamics in complex systems poses a fundamental theoretical challenge with immediate application to problems in biological catalysis, charge transfer, and solar energy conversion. The varied length- and timescales that characterize these kinds of processes necessitate development of novel simulation methodology that can both accurately evolve the coupled quantum and classical degrees of freedom and also be easily applicable to large, complex systems. In the following dissertation, the problems of quantum dynamics in complex systems are explored through direct simulation using path-integral methods as well as application of state-of-the-art analytical rate theories.

Morphological variation with interspecific implications in a population of Sigara dorsalis (Leach) (Hemiptera Heteroptera: Corixidae), and a request for British specimens

Sigara dorsalis belongs to a very closely related group of six species forming the sub-genus Sigara sensu strictu. Each of the six species has a distinct allopatric geographical distribution in Europe. Studies were started on a series of populations in the north west Midlands of England. All the populations examined, except one, contained only males with the typical diagnostic features of S. dorsalis, albeit with considerable variation. One pond near Congleton, Cheshire situated in a permanent-ley pasture and apparently free from pollution contained typical S. dorsalis males but, in addition, many atypical individuals. From one sample of forty-six males, all possessed left parameres with the slight point on the dorsal surface characteristic of S. dorsalis. However, almost half possessed additional morphological features intermediate between S. dorsalis and S. striata.

Instability of solution of phase retrieval in direct diffraction phase-contrast imaging with partially coherent X-ray source

The theoretical model of direct diffraction phase-contrast imaging with partially coherent x-ray source is expressed by an operator of multiple integral. It is presented that the integral operator is linear. The problem of its phase retrieval is described by solving an operator equation of multiple integral. It is demonstrated that the solution of the phase retrieval is unstable. The numerical simulation is performed and the result validates that the solution of the phase retrieval is unstable.

Direct simulation of proton-coupled electron transfer reaction dynamics and mechanisms

Proton-coupled electron transfer (PCET) reactions are ubiquitous throughout chemistry and biology. However, challenges arise in both the the experimental and theoretical investigation of PCET reactions; the rare-event nature of the reactions and the coupling between quantum mechanical electron- and proton-transfer with the slower classical dynamics of the surrounding environment necessitates the development of robust simulation methodology. In the following dissertation, novel path-integral based methods are developed and employed for the direct simulation of the reaction dynamics and mechanisms of condensed-phase PCET.

Distributed Load Control in Multiphase Radial Networks

The current power grid is on the cusp of modernization due to the emergence of distributed generation and controllable loads, as well as renewable energy. On one hand, distributed and renewable generation is volatile and difficult to dispatch. On the other hand, controllable loads provide significant potential for compensating for the uncertainties. In a future grid where there are thousands or millions of controllable loads and a large portion of the generation comes from volatile sources like wind and solar, distributed control that shifts or reduces the power consumption of electric loads in a reliable and economic way would be highly valuable.

Load control needs to be conducted with network awareness. Otherwise, voltage violations and overloading of circuit devices are likely. To model these effects, network power flows and voltages have to be considered explicitly. However, the physical laws that determine power flows and voltages are nonlinear. Furthermore, while distributed generation and controllable loads are mostly located in distribution networks that are multiphase and radial, most of the power flow studies focus on single-phase networks.

This thesis focuses on distributed load control in multiphase radial distribution networks. In particular, we first study distributed load control without considering network constraints, and then consider network-aware distributed load control.

Distributed implementation of load control is the main challenge if network constraints can be ignored. In this case, we first ignore the uncertainties in renewable generation and load arrivals, and propose a distributed load control algorithm, Algorithm 1, that optimally schedules the deferrable loads to shape the net electricity demand. Deferrable loads refer to loads whose total energy consumption is fixed, but energy usage can be shifted over time in response to network conditions. Algorithm 1 is a distributed gradient decent algorithm, and empirically converges to optimal deferrable load schedules within 15 iterations.

We then extend Algorithm 1 to a real-time setup where deferrable loads arrive over time, and only imprecise predictions about future renewable generation and load are available at the time of decision making. The real-time algorithm Algorithm 2 is based on model-predictive control: Algorithm 2 uses updated predictions on renewable generation as the true values, and computes a pseudo load to simulate future deferrable load. The pseudo load consumes 0 power at the current time step, and its total energy consumption equals the expectation of future deferrable load total energy request.

Network constraints, e.g., transformer loading constraints and voltage regulation constraints, bring significant challenge to the load control problem since power flows and voltages are governed by nonlinear physical laws. Remarkably, distribution networks are usually multiphase and radial. Two approaches are explored to overcome this challenge: one based on convex relaxation and the other that seeks a locally optimal load schedule.

To explore the convex relaxation approach, a novel but equivalent power flow model, the branch flow model, is developed, and a semidefinite programming relaxation, called BFM-SDP, is obtained using the branch flow model. BFM-SDP is mathematically equivalent to a standard convex relaxation proposed in the literature, but numerically is much more stable. Empirical studies show that BFM-SDP is numerically exact for the IEEE 13-, 34-, 37-, 123-bus networks and a real-world 2065-bus network, while the standard convex relaxation is numerically exact for only two of these networks.

Theoretical guarantees on the exactness of convex relaxations are provided for two types of networks: single-phase radial alternative-current (AC) networks, and single-phase mesh direct-current (DC) networks. In particular, for single-phase radial AC networks, we prove that a second-order cone program (SOCP) relaxation is exact if voltage upper bounds are not binding; we also modify the optimal load control problem so that its SOCP relaxation is always exact. For single-phase mesh DC networks, we prove that an SOCP relaxation is exact if 1) voltage upper bounds are not binding, or 2) voltage upper bounds are uniform and power injection lower bounds are strictly negative; we also modify the optimal load control problem so that its SOCP relaxation is always exact.

To seek a locally optimal load schedule, a distributed gradient-decent algorithm, Algorithm 9, is proposed. The suboptimality gap of the algorithm is rigorously characterized and close to 0 for practical networks. Furthermore, unlike the convex relaxation approach, Algorithm 9 ensures a feasible solution. The gradients used in Algorithm 9 are estimated based on a linear approximation of the power flow, which is derived with the following assumptions: 1) line losses are negligible; and 2) voltages are reasonably balanced. Both assumptions are satisfied in practical distribution networks. Empirical results show that Algorithm 9 obtains 70+ times speed up over the convex relaxation approach, at the cost of a suboptimality within numerical precision.

MODIFIED DIRECT TWOS-COMPLEMENT PARALLEL ARRAY MULTIPLICATION ALGORITHM FOR COMPLEX MATRIX OPERATION

A direct twos-complement parallel array multiplication algorithm is introduced and modified for digital optical numerical computation. The modified version overcomes the problems encountered in the conventional optical twos-complement algorithm. In the array, all the summands are generated in parallel, and the relevant summands having the same weights are added simultaneously without carries, resulting in the product expressed in a mixed twos-complement system. In a two-stage array, complex multiplication is possible with using four real subarrays. Furthermore, with a three-stage array architecture, complex matrix operation is straightforwardly accomplished. In the experiment, parallel two-stage array complex multiplication with liquid-crystal panels is demonstrated.