Singularities in cascade models of the Euler equation

The formation of singularities in the three-dimensional Euler equation is investigated. This is done by restricting the number of Fourier modes to a set which allows only for local interactions in wave number space. Starting from an initial large-scale energy distribution, the energy rushes towards smaller scales, forming a universal front independent of initial conditions. The front results in a singularity of the vorticity in finite time, and has scaling form as function of the time difference from the singularity. Using a simplified model, we compute the values of the exponents and the shape of the front analytically. The results are in good agreement with numerical simulations.     

FEM study of palladium and molybdenum clusters on an alumina covered field emitter

Palladium and molybdenum polycrystalline layers (clusters) have been deposited in a stainless steel UHV system onto a layer of alumina (Al₂O₃). This layer has been prepared by high temperature oxidation of an aluminium layer. The interaction of this system with nitrogen has been investigated at room temperature by an FEM technique. Under these conditions nitrogen spillover from molybdenum to palladium has been observed.     

Hydroxyl ion conduction in ytterbium-doped strontium cerate at T<580 K in H2O/air atmosphere

Open circuit voltage (OCV) measurements in H₂O/air concentration cells at T<580 K using Yb-doped SrCeO₃ electrolyte indicate that under these conditions, protons are transported through the electrolyte as -ve ions, possibly as hydroxyl (OH⁻) ions. The H⁺ ionic transport, which is generally reported, becomes the dominant mode for H₂O/air concentration cells at temperatures greater than 750 K or when H₂O/air electrodes are replaced by H₂/Ar, and the anomalous OCV sign disappears. The combination of low temperature and the presence of hydrogen and oxygen as provided by the H₂O/air system appears to be necessary for the postulated hydroxyl ion electrode reactions to take place. In addition to OCV measurements, results from impedance spectroscopy are used to provide evidence in support of the suggested hydroxyl ion mode of protonic transport under the specified conditions. These findings are directly relevant in the development of novel humidity sensors in the temperature range 450–580K and is reported in a separate paper in this conference. Paper presented at the 3rd Euroconference on Solid State Ionics, Teulada, Sardinia, Italy, Sept. 15–22, 1996     

A study of density in electron-cyclotron-resonance plasma

A theory is developed for the density profile of low temperature plasmas confined by applied magnetic field and an experiment of the electron-cyclotron-resonance (ECR) plasma is conducted to compare the theoretical prediction and experimental measurements. Due to a large electron mobility along the magnetic field, electrons move quickly out of the system, leaving ions behind and building a space charge potential, which leads to the ambipolar diffusion of ions. In a steady-state condition, the plasma generation by ionization of neutral molecules is in balance with plasma loss due to the diffusion, leading to the electron temperature equation, which is expressed in terms of the plasma size, chamber pressure, and the ionization energy and cross section of neutrals. The power balance condition leads to the plasma density equation, which is also expressed in terms of the electron temperature, the input microwave power and the chamber pressure. It is shown that the plasma density increases, reaches its peak and decreases, as the chamber pressure increases from a small value (0.1 mTorr). These simple expressions of electron temperature and density provide a scaling law of ECR plasma in terms of system parameters. After carrying out an experimental observation, it is concluded that the theoretical predictions of the electron temperature and plasma density agree remarkably well with experimental data     

Searching for losers

We investigate the following process: N people select b losers by flipping coins. The 0-party continues until there are less than b losers; then the 1-party has to find the other losers by the same process. The average time for this process is about long₂ N, but this result requires rather advanced methods. Furthermore, the average size of a binary tree associated to this process and the average number of coin flippings are computed. The method used in this article can be used to give asympotical solutions of a special type of bivariate recurrences. © 1993 John Wiley & Sons, Inc.     

3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects

We present a new data structure for a set of n convex simply-shaped fat objects in the plane, and use it to obtain efficient and rather simple solutions to several problems including (i) vertical ray shooting—preprocess a set of n non-intersecting convex simply-shaped flat objects in 3-space, whose xy-projections are fat, for efficient vertical ray shooting queries, (ii) point enclosure—preprocess a set C of n convex simply-shaped fat objects in the plane, so that the k objects containing a query point p can be reported efficiently, (iii) bounded-size range searching— preprocess a set C of n convex fat polygons, so that the k objects intersecting a “not-too-large” query polygon can be reported efficiently, and (iv) bounded-size segment shooting—preprocess a set C as in (iii), so that the first object (if exists) hit by a “not-too-long” oriented query segment can be found efficiently. For the first three problems we construct data structures of size O(λ_s(n)log³n), where s is the maximum number of intersections between the boundaries of the (xy-projections) of any pair of objects, and λ_s(n) is the maximum length of (n, s) Davenport-Schinzel sequences. The data structure for the fourth problem is of size O(λ_s(n)log²n). The query time in the first problem is O(log⁴n), the query time in the second and third problems is O(log³n + klog²n), and the query time in the fourth problem is O(log³n).

We also present a simple algorithm for computing a depth order for a set as in (i), that is based on the solution to the vertical ray shooting problem. (A depth order for , if exists, is a linear order of , such that, if K₁, K₂ and K₁ lies vertically above K₂, then K₁ precedes K₂.) Unlike the algorithm of Agarwal et al. (1995) that might output a false order when a depth order does not exist, the new algorithm is able to determine whether such an order exists, and it is often more efficient in practical situations than the former algorithm.