Space-resolved spectral diagnosis of line-shaped laser-produced magnesium plasmas

Space-resolved spectra of line-shaped laser-produced magnesium plasmas in the normal direction of the target have been obtained using a pinhole crystal spectrograph. These spectra are treated by a spectrum analyzing code for obtaining the true spectra and fine structures of overlapped lines. The spatial distributions of electron temperature and density along the normal direction of the target surface have been obtained with different spectral diagnostic techniques. Especially, the electron density plateaus beyond the critical surface in line-shaped magnesium plasmas have been obtained with a fitting technique applied to the Stark-broadened Ly-alpha wings of hydrogenic ions. The difference of plasma parameters between those obtained by different diagnostic techniques is discussed. Other phenomena, such as plasma satellites, population inversion, etc., which are observed in magnesium plasmas, are also presented.

Near dipole-dipole effects on the propagation of few-cycle pulse in a dense two-level medium

The propagation behaviors, which include the carrier-envelope phase, the area evolution and the solitary pulse number of few-cycle pulses in a dense two-level medium, are investigated based on full-wave Maxwell-Bloch equations by taking Lorentz local field correction (LFC) into account. Several novel features are found: the difference of the carrier-envelope phase between the cases with and without LFC can go up to pi at some location; although the area of ultrashort solitary pulses is lager than 2 pi, the area of the effective Rabi frequency, which equals to that the Rabi frequency pluses the product of the strength of the near dipole-dipole (NDD) interaction and the polarization, is consistent with the standard area theorem and keeps 2 pi; the large area pulse penetrating into the medium produces several solitary pulses as usual, but the number of solitary pulses changes at certain condition. (C) 2005 Optical Society of America.

Dense, efficient chip-to-chip communication at the extremes of computing

The scalability of CMOS technology has driven computation into a diverse range of applications across the power consumption, performance and size spectra. Communication is a necessary adjunct to computation, and whether this is to push data from node-to-node in a high-performance computing cluster or from the receiver of wireless link to a neural stimulator in a biomedical implant, interconnect can take up a significant portion of the overall system power budget. Although a single interconnect methodology cannot address such a broad range of systems efficiently, there are a number of key design concepts that enable good interconnect design in the age of highly-scaled CMOS: an emphasis on highly-digital approaches to solving ‘analog’ problems, hardware sharing between links as well as between different functions (such as equalization and synchronization) in the same link, and adaptive hardware that changes its operating parameters to mitigate not only variation in the fabrication of the link, but also link conditions that change over time. These concepts are demonstrated through the use of two design examples, at the extremes of the power and performance spectra.

A novel all-digital clock and data recovery technique for high-performance, high density interconnect has been developed. Two independently adjustable clock phases are generated from a delay line calibrated to 2 UI. One clock phase is placed in the middle of the eye to recover the data, while the other is swept across the delay line. The samples produced by the two clocks are compared to generate eye information, which is used to determine the best phase for data recovery. The functions of the two clocks are swapped after the data phase is updated; this ping-pong action allows an infinite delay range without the use of a PLL or DLL. The scheme's generalized sampling and retiming architecture is used in a sharing technique that saves power and area in high-density interconnect. The eye information generated is also useful for tuning an adaptive equalizer, circumventing the need for dedicated adaptation hardware.

On the other side of the performance/power spectra, a capacitive proximity interconnect has been developed to support 3D integration of biomedical implants. In order to integrate more functionality while staying within size limits, implant electronics can be embedded onto a foldable parylene (‘origami’) substrate. Many of the ICs in an origami implant will be placed face-to-face with each other, so wireless proximity interconnect can be used to increase communication density while decreasing implant size, as well as facilitate a modular approach to implant design, where pre-fabricated parylene-and-IC modules are assembled together on-demand to make custom implants. Such an interconnect needs to be able to sense and adapt to changes in alignment. The proposed array uses a TDC-like structure to realize both communication and alignment sensing within the same set of plates, increasing communication density and eliminating the need to infer link quality from a separate alignment block. In order to distinguish the communication plates from the nearby ground plane, a stimulus is applied to the transmitter plate, which is rectified at the receiver to bias a delay generation block. This delay is in turn converted into a digital word using a TDC, providing alignment information.

Exchange energy shifts under dense plasma conditions

The variation of the energy interval between the intercombination line ( 1s2p(P-3(1))-> 1s(2)) and the resonance line ( 1s2p(P-1(1))-> 1s(2)) of He-like aluminium with plasma density and temperature is investigated. Since such energy interval is equivalent to the exchange energy of the state 1s2p(P-3(1)), we consider the dependence of this energy shift on the plasma environment. It was found that the shifts of exchange energy increase ( decrease) with the increase of electron density ( electron temperature), and the shifts of exchange energy become more sensitive to the electron density as the electron temperature decreases, i. e. in the strongly coupled plasma regime. An approximately linear relation is found between the shifts of exchange energy and the electron density. The results show that dense plasma effects are very important for the simulation of the spectral fine structure. The relative shifts between the intercombination ( 1s2p(P-3(1))-> 1s(2)) and the resonance line ( 1s2p(P-1(1))-> 1s(2)) are discussed for diagnostic applications.

Few-cycle relativistic solitons in plasmas

A set of exact one-dimensional solutions to coupled nonlinear equations describing the propagation of a relativistic ultrashort circularly polarized laser pulse in a cold collisionless and bounded plasma where electrons have an initial velocity in the laser propagating direction is presented. The solutions investigated here are in the form of quickly moving envelop solitons at a propagation velocity comparable to the light speed. The features of solitons in both underdense and overdense plasmas with electrons having different given initial velocities in the laser propagating direction are described. It is found that the amplitude of solitons is larger and soliton width shorter in plasmas where electrons have a larger initial velocity. In overdense plasmas, soliton duration is shorter, the amplitude higher than that in underdense plasmas where electrons have the same initial velocity.

Robot navigation in dense crowds : statistical models and experimental studies of human robot cooperation

This thesis explores the problem of mobile robot navigation in dense human crowds. We begin by considering a fundamental impediment to classical motion planning algorithms called the freezing robot problem: once the environment surpasses a certain level of complexity, the planner decides that all forward paths are unsafe, and the robot freezes in place (or performs unnecessary maneuvers) to avoid collisions. Since a feasible path typically exists, this behavior is suboptimal. Existing approaches have focused on reducing predictive uncertainty by employing higher fidelity individual dynamics models or heuristically limiting the individual predictive covariance to prevent overcautious navigation. We demonstrate that both the individual prediction and the individual predictive uncertainty have little to do with this undesirable navigation behavior. Additionally, we provide evidence that dynamic agents are able to navigate in dense crowds by engaging in joint collision avoidance, cooperatively making room to create feasible trajectories. We accordingly develop interacting Gaussian processes, a prediction density that captures cooperative collision avoidance, and a "multiple goal" extension that models the goal driven nature of human decision making. Navigation naturally emerges as a statistic of this distribution.

Most importantly, we empirically validate our models in the Chandler dining hall at Caltech during peak hours, and in the process, carry out the first extensive quantitative study of robot navigation in dense human crowds (collecting data on 488 runs). The multiple goal interacting Gaussian processes algorithm performs comparably with human teleoperators in crowd densities nearing 1 person/m², while a state of the art noncooperative planner exhibits unsafe behavior more than 3 times as often as the multiple goal extension, and twice as often as the basic interacting Gaussian process approach. Furthermore, a reactive planner based on the widely used dynamic window approach proves insufficient for crowd densities above 0.55 people/m². We also show that our noncooperative planner or our reactive planner capture the salient characteristics of nearly any dynamic navigation algorithm. For inclusive validation purposes, we show that either our non-interacting planner or our reactive planner captures the salient characteristics of nearly any existing dynamic navigation algorithm. Based on these experimental results and theoretical observations, we conclude that a cooperation model is critical for safe and efficient robot navigation in dense human crowds.

Finally, we produce a large database of ground truth pedestrian crowd data. We make this ground truth database publicly available for further scientific study of crowd prediction models, learning from demonstration algorithms, and human robot interaction models in general.

Interactions of a femtosecond intense laser with rare gas clusters in a dense jet\

A study on the interactions of high intensity (similar to 10(16) W/cm(2)) femtosecond laser pulses with rare gas clusters in a dense jet is performed. Energy absorption by Ar and Xe clusters is measured and it can be as high as 90%. Very energetic ions produced in the laser interaction with a dense cluster jet are detected by time-of-flight spectrometry and the maximum ion energy of Xe is up to 1.3 MeV. The average ion energies are found to increase with increasing cluster size and get saturated gradually. The average ion energies also show a strong directionality and the average ion energy in the direction parallel to the laser polarization vector is 40% higher than that perpendicular to it. The findings are discussed in terms of a model of charge-dependent ion acceleration.

等离子体效应对类氦氖Kα线系电偶极辐射的影响

采用离子球模型，通过自洽求解Boltzmann方程和Poisson方程，得到类氦氖离子Kα线系的两条电偶极辐射光谱能量随等离子体环境的漂移．结果显示，Kα线系电偶极谱线随等离子体电子密度增大发生红移，红移量与等离子体电子密度有近似的正比关系；随着等离子体电子温度的降低，光谱红移对等离子体电子密度的敏感性增大。另外，所研究的两条谱线间的能量间隔随等离子体电子密度的增大而减小，减小量随等离子体电子密度的变化也呈现出近似的线性规律。值得注意的是，类氦氖Kα线系中两条电偶极谱线分别为互组合线与共振谱线，而其能量差

Completions of epsilon-dense partial Latin squares

A classical question in combinatorics is the following: given a partial Latin square $P$, when can we complete $P$ to a Latin square $L$? In this paper, we investigate the class of textbf{$epsilon$-dense partial Latin squares}: partial Latin squares in which each symbol, row, and column contains no more than $epsilon n$-many nonblank cells. Based on a conjecture of Nash-Williams, Daykin and H"aggkvist conjectured that all $frac{1}{4}$-dense partial Latin squares are completable. In this paper, we will discuss the proof methods and results used in previous attempts to resolve this conjecture, introduce a novel technique derived from a paper by Jacobson and Matthews on generating random Latin squares, and use this novel technique to study $ epsilon$-dense partial Latin squares that contain no more than $delta n^2$ filled cells in total.

In Chapter 2, we construct completions for all $ epsilon$-dense partial Latin squares containing no more than $delta n^2$ filled cells in total, given that $epsilon < frac{1}{12}, delta < frac{ left(1-12epsilonright)^{2}}{10409}$. In particular, we show that all $9.8 cdot 10^{-5}$-dense partial Latin squares are completable. In Chapter 4, we augment these results by roughly a factor of two using some probabilistic techniques. These results improve prior work by Gustavsson, which required $epsilon = delta leq 10^{-7}$, as well as Chetwynd and H"aggkvist, which required $epsilon = delta = 10^{-5}$, $n$ even and greater than $10^7$.

If we omit the probabilistic techniques noted above, we further show that such completions can always be found in polynomial time. This contrasts a result of Colbourn, which states that completing arbitrary partial Latin squares is an NP-complete task. In Chapter 3, we strengthen Colbourn's result to the claim that completing an arbitrary $left(frac{1}{2} + epsilonright)$-dense partial Latin square is NP-complete, for any $epsilon > 0$.

Colbourn's result hinges heavily on a connection between triangulations of tripartite graphs and Latin squares. Motivated by this, we use our results on Latin squares to prove that any tripartite graph $G = (V_1, V_2, V_3)$ such that begin{itemize} item $|V_1| = |V_2| = |V_3| = n$, item For every vertex $v in V_i$, $deg_+(v) = deg_-(v) geq (1- epsilon)n,$ and item $|E(G)| > (1 - delta)cdot 3n^2$ end{itemize} admits a triangulation, if $epsilon < frac{1}{132}$, $delta < frac{(1 -132epsilon)^2 }{83272}$. In particular, this holds when $epsilon = delta=1.197 cdot 10^{-5}$.

This strengthens results of Gustavsson, which requires $epsilon = delta = 10^{-7}$.

In an unrelated vein, Chapter 6 explores the class of textbf{quasirandom graphs}, a notion first introduced by Chung, Graham and Wilson cite{chung1989quasi} in 1989. Roughly speaking, a sequence of graphs is called "quasirandom"' if it has a number of properties possessed by the random graph, all of which turn out to be equivalent. In this chapter, we study possible extensions of these results to random $k$-edge colorings, and create an analogue of Chung, Graham and Wilson's result for such colorings.