1000 resultados para Warm Dense Matter
Resumo:
The density distribution of inhomogeneous dense deuterium-tritium plasmas in laser fusion is revealed by the energy loss of fast protons going through the plasma. In our simulation of a plasma density diagnostics, the fast protons used for the diagnostics may be generated in the laser-plasma interaction. Dividing a two-dimensional area into grids and knowing the initial and final energies of the protons, we can obtain a large linear and ill-posed equation set. for the densities of all grids, which is solved with the Tikhonov regularization method. We find that the accuracy of the set plan with four proton sources is better than those of the set plans with less than four proton sources. Also we have done the density reconstruction especially. for four proton sources with and without assuming circularly symmetrical density distribution, and find that the accuracy is better for the reconstruction assuming circular symmetry. The error is about 9% when no noise is added to the final energy for the reconstruction of four proton sources assuming circular symmetry. The accuracies for different random noises to final proton energies with four proton sources are also calculated.
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
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/m2, 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/m2. 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.
Resumo:
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.
Resumo:
Generally, wetlands are thought to perform water purification functions, removing contaminants as water flows through sediment and vegetation. This paradigm was challenged when Grant et al. (2001) reported that Talbert Salt Marsh (Figure 1.) increased fecal indicator bacteria (FIB) output to coastal waters, contributing to poor coastal water quality. Like most southern California wetlands, Talbert Salt Marsh has been severely degraded. It is a small (10 ha), restored wetland, only 1/100th its original size, and located at the base of a highly urbanized watershed. Is it reasonable to expect that this or any severely altered wetland will perform the same water purification benefits as a natural wetland? To determine how a more pristine southern California coastal wetland attenuated bacterial contaminants, we investigated FIB concentrations entering and exiting Carpinteria Salt Marsh (Figure 2.), a 93 ha, moderate-sized, relatively natural wetland.(PDF contains 4 pages)
Resumo:
This thesis addresses whether it is possible to build a robust memory device for quantum information. Many schemes for fault-tolerant quantum information processing have been developed so far, one of which, called topological quantum computation, makes use of degrees of freedom that are inherently insensitive to local errors. However, this scheme is not so reliable against thermal errors. Other fault-tolerant schemes achieve better reliability through active error correction, but incur a substantial overhead cost. Thus, it is of practical importance and theoretical interest to design and assess fault-tolerant schemes that work well at finite temperature without active error correction.
In this thesis, a three-dimensional gapped lattice spin model is found which demonstrates for the first time that a reliable quantum memory at finite temperature is possible, at least to some extent. When quantum information is encoded into a highly entangled ground state of this model and subjected to thermal errors, the errors remain easily correctable for a long time without any active intervention, because a macroscopic energy barrier keeps the errors well localized. As a result, stored quantum information can be retrieved faithfully for a memory time which grows exponentially with the square of the inverse temperature. In contrast, for previously known types of topological quantum storage in three or fewer spatial dimensions the memory time scales exponentially with the inverse temperature, rather than its square.
This spin model exhibits a previously unexpected topological quantum order, in which ground states are locally indistinguishable, pointlike excitations are immobile, and the immobility is not affected by small perturbations of the Hamiltonian. The degeneracy of the ground state, though also insensitive to perturbations, is a complicated number-theoretic function of the system size, and the system bifurcates into multiple noninteracting copies of itself under real-space renormalization group transformations. The degeneracy, the excitations, and the renormalization group flow can be analyzed using a framework that exploits the spin model's symmetry and some associated free resolutions of modules over polynomial algebras.
Resumo:
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.
Resumo:
By solving numerically the full Maxwell-Bloch equations without the slowly varying envelope approximation and the rotating-wave approximation, we investigate the effects of Lorentz local field correction (LFC) on the propagation properties of few-cycle laser pulse in a dense A-type three-level atomic medium. We find that: when the area of the input pulse is larger, split of pulse occurs and the number of the sub-pulses with LFC is larger than that without LFC; at the same distance, the time interval between the first sub-pulse and the second sub-pulse in the case without LFC is longer than that with LFC, the time of pulse appearing in the case without LFC is later than that in the case with LFC, and the two phenomena are more obvious with propagation distance increasing; time evolution rules of the populations of levels vertical bar 1 >, vertical bar 2 > and vertical bar 3 > in the two cases with and without LFC are much different. When the area of the input pulse is smaller, effects of LFC on time evolutions of the pulse and populations are remarkably smaller than those in the case of larger area pulse. (c) 2008 Elsevier B.V. All rights reserved.
Resumo:
The propagation of the fast muon population mainly due to collisional effect in a dense deuterium-tritium (DT for short) mixture is investigated and analysed within the framework of the relativistic Fokker-Planck equation. Without the approximation that the muons propagate straightly in the DT mixture, the muon penetration length, the straggling length, and the mean transverse dispersion radius are calculated for different initial energies, and especially for different densities of the densely compressed DT mixture in our suggested muon-driven fast ignition (FI). Unlike laser-driven FI requiring super-high temperature, muons can catalyze DT fusion at lower temperatures and may generate an ignition sparkle before the self-heating fusion follows. Our calculation is important for the feasibility and the experimental study of muon-driven FI.
Resumo:
In the first part I perform Hartree-Fock calculations to show that quantum dots (i.e., two-dimensional systems of up to twenty interacting electrons in an external parabolic potential) undergo a gradual transition to a spin-polarized Wigner crystal with increasing magnetic field strength. The phase diagram and ground state energies have been determined. I tried to improve the ground state of the Wigner crystal by introducing a Jastrow ansatz for the wave function and performing a variational Monte Carlo calculation. The existence of so called magic numbers was also investigated. Finally, I also calculated the heat capacity associated with the rotational degree of freedom of deformed many-body states and suggest an experimental method to detect Wigner crystals.
The second part of the thesis investigates infinite nuclear matter on a cubic lattice. The exact thermal formalism describes nucleons with a Hamiltonian that accommodates on-site and next-neighbor parts of the central, spin-exchange and isospin-exchange interaction. Using auxiliary field Monte Carlo methods, I show that energy and basic saturation properties of nuclear matter can be reproduced. A first order phase transition from an uncorrelated Fermi gas to a clustered system is observed by computing mechanical and thermodynamical quantities such as compressibility, heat capacity, entropy and grand potential. The structure of the clusters is investigated with the help two-body correlations. I compare symmetry energy and first sound velocities with literature and find reasonable agreement. I also calculate the energy of pure neutron matter and search for a similar phase transition, but the survey is restricted by the infamous Monte Carlo sign problem. Also, a regularization scheme to extract potential parameters from scattering lengths and effective ranges is investigated.