Luminescence centers in porous silicon

Photoluminescence studies on porous silicon show that there are luminescence centers present in the surface states. By taking photoluminescence spectra of porous silicon with respect to temperature, a distinct peak can be observed in the temperature range 100–150 K. Both linear and nonlinear relationships were observed between excitation laser power and the photoluminescence intensity within this temperature range. In addition, there was a tendency for the photoluminescence peak to red shift at low temperature as well as at low excitation power. This is interpreted as indicating that the lower energy transition becomes dominant at low temperature and excitation power. The presence of these luminescence centers can be explained in terms of porous silicon as a mixture of silicon clusters and wires in which quantum confinement along with surface passivation would cause a mixing of andX band structure between the surface states and the bulk. This mixing would allow the formation of luminescence centers.     

Clumping Data in 2-Way Tables: A User-Orientated Perspective

Following a critique of existing algorithms, an algorithm is presented which will re-organize a 2-way data table to bring like rows together, and like columns together. Extensions of the method are described, and justified, to accommodate distances measured in modular arithmetic, and with bipolar columns/rows, as in repertory grid analysis. One value of the algorithms is that the user can see relationships in the tables without the data in the cells themselves ever having been transformed. Thus, users will continue to feel they own their data.     

Refining the Diffusion Approximation for the <Emphasis Type="Italic">GI</Emphasis><Superscript><Emphasis Type="Italic">x</Emphasis></Superscript><Emphasis Type="Italic">/G/c</Emphasis> Queue

This paper deals with the GI ^x /G/c queueing system in a steady state. We refine a diffusion approximation method incorporating the constraint of traffic conservation for general queueing systems. An approximate expression for the distribution of the number of customers is obtained. Numerical results are presented to show that the refined model provides improved performance.     

A law of the iterated logarithm for processes with independent increments

ＡＬＡＷＯＦＴＨＥＩＴＥＲＡＴＥＤＬＯＧＡＲＩＴＨＭＦＯＲＰＲＯＣＥＳＳＥＳＷＩＴＨＩＮＤＥＰＥＮＤＥＮＴＩＮＣＲＥＭＥＮＴＳＷＡＮＧＪＩＡＧＡＮＧ（汪嘉冈）（ＥａｓｔＣｈｉｎａＵｎｉｖｅｒｓｉｔｙｏｆＳｃｉｅｎｃｅ＆Ｔｅｃｈｎｏｌｏｇｙ,Ｓｈａｎｇ...     

Massively time-parallel,approximate simulation of loss queueing systems

A time-parallel simulation obtains parallelism by partitioning the time domain of the simulation. An approximate time-parallel simulation algorithm named GG1K is developed for acyclic networks of loss FCFSG/G/1/K queues. The GG1K algorithm requires two phases. In the first phase, a similar system (i.e. aG/G/1/ queue) is simulated using the GLM algorithm. Then the resultant trajectory is transformed into an approximateG/G/1/K trajectory in the second phase. The closeness of the approximation is investigated theoretically and experimentally. Our results show that the approximation is highly accurate except whenK is very small (e.g. 5) in certain models. The algorithm exploits unbounded parallelism and can achieve near-linear speedup when the number of arrivals simulated is sufficiently large.