Formation of Si-nanoparticles in a microwave reactor: Comparison between experiments and modelling

The formation and growth of silicon-nanoparticles from silane in a microwave reactor was investigated. Experiments were performed for the following conditions: precursor concentration 380–2530 ppm, pressures of 20–30 mbar, microwave powers 120–300 W. The formed particles were examined in-situ with a particle mass spectrometer. Additionally, particles were collected on grids and analyzed by transmission electron microscopy, X-ray diffraction, and by determining the specific surface area by BET. The particle size was found to be in the range of 5–8 nm in diameter. A simple model was used to simulate the particle formation processes taking place inside the reactor. The microwave energy coupled into the reactor flow was treated as a spatially distributed energy source resulting in a local temperature increase. The particles were assumed to have a monodisperse size distribution. To allow an approximation of their shape they were characterized by their volume and surface area. The model takes nucleation, convection, coagulation, and coalescence into account. The fluid flow inside the microwave reactor was simulated with the commercial CFD-code Fluent.     

Suppressing decoherence of quantum algorithms by jump codes

The stabilizing properties of one-error correcting jump codes are explored under the realistic non-ideal condition of finite recovery times. For this purpose the quantum algorithm of the tent-map is decomposed into a universal set of Hamiltonian quantum gates which ensure perfect correction of spontaneous decay processes under ideal circumstances even if they occur during a gate operation. An entanglement gate is presented which is capable of entangling any two logical qubits of different one-error correcting code spaces. With the help of this gate simultaneous spontaneous decay processes affecting physical qubits of different code spaces can be corrected and decoherence can be suppressed significantly.     

Receiving beam patterns in the horizontal plane of a harbor porpoise (Phocoena phocoena)

Receiving beam patterns of a harbor porpoise were measured in the horizontal plane, using narrow-band frequency modulated signals with center frequencies of 16, 64, and 100 kHz. Total signal duration was 1000 ms, including a 200 ms rise time and 300 ms fall time. The harbor porpoise was trained to participate in a psychophysical test and stationed itself horizontally in a specific direction in the center of a 16-m-diameter circle consisting of 16 equally-spaced underwater transducers. The animal's head and the transducers were in the same horizontal plane, 1.5 m below the water surface. The go/no-go response paradigm was used; the animal left the listening station when it heard a sound signal. The method of constants was applied. For each transducer the 50% detection threshold amplitude was determined in 16 trials per amplitude, for each of the three frequencies. The beam patterns were not symmetrical with respect to the midline of the animal's body, but had a deflection of 3-7 degrees to the right. The receiving beam pattern narrowed with increasing frequency. Assuming that the pattern is rotation-symmetrical according to an average of the horizontal beam pattern halves, the receiving directivity indices are 4.3 at 16 kHz, 6.0 at 64 kHz, and 11.7 dB at 100 kHz. The receiving directivity indices of the porpoise were lower than those measured for bottlenose dolphins. This means that harbor porpoises have wider receiving beam patterns than bottlenose dolphins for the same frequencies. Directivity of hearing improves the signal-to-noise ratio and thus is a tool for a better detection of certain signals in a given ambient noise condition.     

Effect of spermine and DNase on DNA release from bacteriophage T5

Bacterial viruses (bacteriophages) consist of nucleic acid protected by a protein envelope called capsid. At the start of infection, the phage genome is translocated into the bacterial cytoplasm. In vitro (and also in vivo), this DNA release can be triggered by binding a specific receptor protein to the phage tail. The force responsible for the release arises from energy stored in the capsid due to strong confinement of the DNA. We show that this force can be modified by adding molecules like spermine that affect DNA conformation. The tetravalent cation spermine can reduce the pressure inside the capsid and induce condensation of the released DNA. We examine the effect of spermine on DNA ejection from phage T5 by using light scattering and gel electrophoresis to measure the amount of DNA remaining in the capsid at the end of ejection. We discuss the results in terms of free energy minimization and we demonstrate that the presence of a DNA condensate outside the phage generates an additional force pulling passively on the DNA remaining inside the capsid.     

Impedance spectroscopy study of the sintering of yttria-stabilized zirconia/magnesia composites

In the present study, the sintering of (ZrO₂:8 mol%Y₂O₃)_1 ? m–(MgO)_m, YSZ–mMg composites, with m in the 0–30 mol% range, has been investigated by impedance spectroscopy (IS), dilatometry, and X-ray diffraction. Impedance diagrams were collected at 400 °C after heating the green compacts up to a selected sintering temperature, which was increased stepwise from 800 to 1400 °C. The combined experimental results revealed that the samples can be separated in two categories: below and above the solubility limit of MgO in the YSZ (m ~ 10). Moreover, important microstructural features associated with both the sintering process and solid solution formation of YSZ–mMgO samples were correlated to the electrical properties inferred by IS.     

The multiple-scale transport equation in one space dimension

This study examines the behavior of the one-dimensional non-homogeneous transport equation of the form u_t= u_x+f, «1. The solution consists of behavior which changes on two different time scales, one rapid and one slow. This time scale behavior is known. Additionally, however, we find here that because of the presence of the non-homogeneous forcing termf, and large wave speed 1/, there is a component of the solution which will vary only on a very large spatial scale. This large space-scale solution persists throughout all time, even after the source term of the solution has been shut off. The analysis of this large spacescale behavior is the focus of this paper. Numerical experiments highlight some of our results. These results have applications in fields such as meteorology, and other areas where multiple time scales are of interest.This work was supported in part by NSF grant NSF-DMS93-21728.     

Existence and fractional regularity of solutions for a doubly nonlinear differential inclusion

This article considers the issues of existence and regularity of solutions to the following doubly nonlinear differential inclusion $$\omega_t+\alpha (\omega_t)-\Delta \omega-\Delta_p{\omega} \ni f$$ where α is a maximal monotone operator in ${\mathbb{R}^2}$ and Δ _p denotes the p-Laplacian with p > 2. The investigation on fractional regularity is based on the Galerkin method combined with a suitable basis for W ^1,p , which we exhibit as a preliminary result. This approach also allows the obtaining of estimates in the so-called Nikolskii spaces, since it balances the interplay between the maximal monotone operator with the appearing higher order nonlinear terms.     

On Multi-threaded Metrical Task Systems

Traditionally, on-line problems have been studied under the assumption that there is a unique sequence of requests that must be served. This approach is common to most general models of on-line computation, such as Metrical Task Systems. However, there exist on-line problems in which the requests are organized in more than one independent thread. In this more general framework, at every moment the first unserved request of each thread is available. Therefore, apart from deciding how to serve a request, at each stage it is necessary to decide which request to serve among several possibilities.In this paper we introduce Multi-threaded Metrical Task Systems, that is, the generalization of Metrical Task Systems to the case in which there are many threads of tasks. We study the problem from a competitive analysis point of view, proving lower and upper bounds on the competitiveness of on-line algorithms. We consider finite and infinite sequences of tasks, as well as deterministic and randomized algorithms. In this work we present the first steps towards a more general framework for on-line problems which is not restricted to a sequential flow of information.     

The Symplectic Camel and the Uncertainty Principle: The Tip of an Iceberg?

We show that the strong form of Heisenberg’s inequalities due to Robertson and Schrödinger can be formally derived using only classical considerations. This is achieved using a statistical tool known as the “minimum volume ellipsoid” together with the notion of symplectic capacity, which we view as a topological measure of uncertainty invariant under Hamiltonian dynamics. This invariant provides a right measurement tool to define what “quantum scale” is. We take the opportunity to discuss the principle of the symplectic camel, which is at the origin of the definition of symplectic capacities, and which provides an interesting link between classical and quantum physics.     

Ray shooting and intersection searching amidst fat convex polyhedra in 3-space

We present a data structure for ray-shooting queries in a set of convex fat polyhedra of total complexity n in . The data structure uses O(n^2+ε) storage and preprocessing time, and queries can be answered in O(log²n) time. A trade-off between storage and query time is also possible: for any m with n<m<n², we can construct a structure that uses O(m^1+ε) storage and preprocessing time such that queries take time.We also describe a data structure for simplex intersection queries in a set of n convex fat constant-complexity polyhedra in . For any m with n<m<n³, we can construct a structure that uses O(m^1+ε) storage and preprocessing time such that all polyhedra intersecting a query simplex can be reported in O((n/m^1/3)logn+k) time, where k is the number of answers.