Short Tm3+-doped fiber lasers with watt-level output near 2 μm

High-power operation of diode-pumped fiber lasers at wavelength near 2μm are demonstrated with short length of heavily Tm3 -doped silica glass fibers. With 7-cm long fiber, a laser at near 2 μm is obtained with the threshold of 135 mW, maximum output power of 1.09 W, and slope efficiency of 9.6% with respect to the launched power from a laser diode at 790 nm. The output stability of this fiber laser is within 5%.The dependence of the performance of fiber lasers on the operation temperature and cavity configuration parameters is also investigated.     

Testifying experiment of the multi-pulse phenomena of capillary discharge soft-X-ray laser

In a capillary discharge experiment for the neon-like argon lasing, we have proposed an experimental scheme to verify that the multi-spike of X-ray diode (XRD) signal is a multi-pulse laser or is a reflection of the laser pulse in the XRD.The ceramic capillary has an inner diameter of 3mm and a length of 200mm.At the gas pressure of 28Pa and discharge current of 27kA, stable lasing has been realized.The experimental results prove that the multi-spike of XRD signal is a reflection of the electromagnetic signal produced by the laser pulse in the XRD.The improved electrocircuit scheme of the XRD to minimize the reflection phenomena is also found.     

Effect of interdiffusion of In and Al atoms on excitonic states in In<Subscript>x</Subscript>Ga<Subscript>1−x</Subscript>As/Al<Subscript>y</Subscript>Ga<Subscript>1−y</Subscript>As quantum dots

The effect of interdiffusion of aluminum and indium atoms on the exciton emission energy and binding energy in In_xGa_1?xAs/Al_yGa_1?yAs quantum dots is studied. It is shown that the emission energy increases monotonically with increasing diffusion length, while the binding energy has a maximum.     

Design of the low energy beam transport line for the China spallation neutron source

The design of the China Spallation Neutron Source (CSNS) low-energy beam transport (LEBT) line, which locates between the ion source and the radio-frequency quadrupole (RFQ), has been completed with the TRACE3D code. The design aims at perfect matching, primary chopping, a small emittance growth and sufficient space for beam diagnostics. The line consists of three solenoids, three vacuum chambers, two steering magnets and a pre-chopper. The total length of LEBT is about 1.74 m. This LEBT is designed to transfer 20 mA of H-pulsed beam from the ion source to the RFQ. An induction cavity is adopted as the pre-chopper.The electrostatic octupole steerer is discussed as a candidate. A four-quadrant aperture for beam scraping and beam position monitoring is designed.     

Morphological study of atherosclerotic plaque and its application in vulnerability evaluation

The relationships between the morphological characteristics and the vulnerability of atherosclerotic plaque were analyzed theoretically and several suggestions were proposed to evaluate the plaque vulnerability. Validated by animal experiments and clinical studies, the theoretical results were confirmed. Supported by the National Natural Science Foundation of China (Grant Nos. 10302016 and 60402023), the National Basic Research Program of China (973 Program)(Grant No. 2006CB503803), and the National Hi-Tech Research and Development Program of China (863 Program) (Grant No. 2007AA02Z448)     

Filling Length in Finitely Presentable Groups

We study the filling length function for a finite presentation of a group , and interpret this function as an optimal bound on the length of the boundary loop as a van Kampen diagram is collapsed to the basepoint using a combinatorial notion of a null-homotopy. We prove that filling length is well behaved under change of presentation of . We look at 'AD-pairs' (f,g) for a finite presentation : that is, an isoperimetric function f and an isodiametric function g that can be realised simultaneously. We prove that the filling length admits a bound of the form [g+1][log (f+1)+1] whenever (f,g) is an AD-pair for . Further we show that (up to multiplicative constants) if is an isoperimetric function ( ) for a finite presentation then ( ) is an AD-pair. Also we prove that for all finite presentations filling length is bounded by an exponential of an isodiametric function.Partially supported by NSF grant DMS-9800158Supported by EPSRC Award No. 98001683 and Corpus Christi College, Oxford.     

Exact Buffer Overflow Calculations for Queues via Martingales

Let _n be the first time a queueing process like the queue length or workload exceeds a level n. For the M/M/1 queue length process, the mean _n and the Laplace transform e^-sn is derived in closed form using a martingale introduced in Kella and Whitt (1992). For workload processes and more general systems like MAP/PH/1, we use a Markov additive extension given in Asmussen and Kella (2000) to derive sets of linear equations determining the same quantities. Numerical illustrations are presented in the framework of M/M/1 and MMPP/M/1 with an application to performance evaluation of telecommunication systems with long-range dependent properties in the packet arrival process. Different approximations that are obtained from asymptotic theory are compared with exact numerical results.     

A Communication Multiplexer Problem: Two Alternating Queues with Dependent Randomly-Timed Gated Regime

Two random traffic streams are competing for the service time of a single server (multiplexer). The streams form two queues, primary (queue 1) and secondary (queue 0). The primary queue is served exhaustively, after which the server switches over to queue 0. The duration of time the server resides in the secondary queue is determined by the dynamic evolution in queue 1. If there is an arrival to queue 1 while the server is still working in queue 0, the latter is immediately gated, and the server completes service there only to the gated jobs, upon which it switches back to the primary queue. We formulate this system as a two-queue polling model with a single alternating server and with randomly-timed gated (RTG) service discipline in queue 0, where the timer there depends on the arrival stream to the primary queue. We derive Laplace–Stieltjes transforms and generating functions for various key variables and calculate numerous performance measures such as mean queue sizes at polling instants and at an arbitrary moment, mean busy period duration and mean cycle time length, expected number of messages transmitted during a busy period and mean waiting times. Finally, we present graphs of numerical results comparing the mean waiting times in the two queues as functions of the relative loads, showing the effect of the RTG regime.     

Lower Bounds on the State Complexity of Geometric Goppa Codes

We reinterpret the state space dimension equations for geometric Goppa codes. An easy consequence is that if deg then the state complexity of is equal to the Wolf bound. For deg , we use Clifford's theorem to give a simple lower bound on the state complexity of . We then derive two further lower bounds on the state space dimensions of in terms of the gonality sequence of . (The gonality sequence is known for many of the function fields of interest for defining geometric Goppa codes.) One of the gonality bounds uses previous results on the generalised weight hierarchy of and one follows in a straightforward way from first principles; often they are equal. For Hermitian codes both gonality bounds are equal to the DLP lower bound on state space dimensions. We conclude by using these results to calculate the DLP lower bound on state complexity for Hermitian codes.     

On Generating Discrete Orthogonal Bivariate Polynomials

In this paper we present an algorithm for recursively generating orthogonal bivariate polynomials on a discrete set S ². For this purpose we employ commuting pairs of real symmetric matrices H, K ^n×n to obtain, in a certain sense, a two dimensional Hermitian Lanczos method. The resulting algorithm relies on a recurrence having a slowly growing length. Practical implementation issues an applications are considered. The method can be generalized to compute orthogonal polynomials depending on an arbitrary number of variables.