New FIR laser lines and frequency measurements for optically pumped CD3OH

Twenty new cw FIR laser lines in CD₃OH, optically pumped by a CO₂ laser, are reported. The frequencies of 39 of the stronger laser lines were measured relative to stabilized CO₂ lasers with a fractional uncertainty, as determined by the reproducibility of the FIR frequency itself, of 2 parts in 10⁷.Contribution of the U.S. Government, not subject to copyright.     

On the stability of Riemannian manifold with parallel spinors

Inspired by the recent work [HHM03], we prove two stability results for compact Riemannian manifolds with nonzero parallel spinors. Our first result says that Ricci flat metrics which also admit nonzero parallel spinors are stable (in the direction of changes in conformal structures) as the critical points of the total scalar curvature functional. Our second result, which is a local version of the first one, shows that any metric of positive scalar curvature cannot lie too close to a metric with nonzero parallel spinor. We also prove a rigidity result for special holonomy metrics. In the case of SU(m) holonomy, the rigidity result implies that scalar flat deformations of Calabi-Yau metric must be Calabi-Yau. Finally we explore the connection with a positive mass theorem of [D03], which presents another approach to proving these stability and rigidity results. Dedicated to Jeff Cheeger for his sixtieth birthday     

Amplifiers and Lasers in PCF Configurations

In this paper we will present an overview of the use of photonic crystal fibers as fiber amplifiers. We will describe the basic concepts of optical amplification, and how to do numerical modelling of such components. We will then identify advantages and disadvantages of amplifiers based on PCF technology compared to conventional fibers, and then go into greater detail on some of these specific applications, such as low pump power amplifiers, and high-power double-clad amplifiers and lasers.     

Analysis of queueing policies in QoS switches

It is widely accepted that next-generation networks will provide guaranteed services, in contrast to the “best effort” approach today. We study and analyze queueing policies for network switches that support the QoS (Quality of Service) feature. One realization of the QoS feature is that packets are not necessarily all equal, with some having higher priorities than the others. We model this situation by assigning an intrinsic value to each packet. In this paper we are concerned with three different queueing policies: the nonpreemptive model, the FIFO preemptive model, and the bounded delay model. We concentrate on the situation where the incoming traffic overloads the queue, resulting in packet loss. The objective is to maximize the total value of packets transmitted by the queueing policy. The difficulty lies in the unpredictable nature of the future packet arrivals. We analyze the performance of the online queueing policies via competitive analysis, providing upper and lower bounds for the competitive ratios. We develop practical yet sophisticated online algorithms (queueing policies) for the three queueing models. The algorithms in many cases have provably optimal worst-case bounds. For the nonpreemptive model, we devise an optimal online algorithm for the common 2-value model. We provide a tight logarithmic bound for the general nonpreemptive model. For the FIFO preemptive model, we improve the general lower bound to 1.414, while showing a tight bound of 1.434 for the special case of queue size 2. We prove that the bounded delay model with uniform delay 2 is equivalent to a modified FIFO preemptive model with queue size 2. We then give improved upper and lower bounds on the 2-uniform bounded delay model. We also show an improved lower bound of 1.618 for the 2-variable bounded delay model, matching the previously known upper bound.     

An Efficient Numerical Model for Planar Spiral Inductor On-Chip

In this paper, a very useful numerical technique has been developed for analyzing the transient characteristics of a planar-spiral inductor on-chip. A locally conformal technique and an alternating-direction implicit scheme are applied to the finite-difference time-domain method. A formulation for solving three dimensional Maxwell’s equations is proposed. Using the proposed method, various parameters of the planar-spiral inductors have been analyzed and an equivalent circuit, which includes frequency-independent circuit elements, has been introduced. Highly computational efficiency is implemented. Numerical results show excellent agreement with the measured data over a wide frequency range.     

Rain Attenuation at 103 GHz in Millimeter Wave Ranges

We have conducted a millimeter wave propagation experiment at 103 GHz (2.9 mm) on a propagation path of 390 m. The results were compared with the rain attenuation calculations from the Marshall-Palmer, Best, Joss-Thomas-Waldvogel and Weibull distributions for raindrop-size. It has been shown that the Weibull distribution has a good agreement with the experiments.     

Circular perfect graphs

For 1 ≤ d ≤ k, let K_k/d be the graph with vertices 0, 1, …, k ? 1, in which i ～j if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χ_c(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to K_k/d. The circular clique number ω_c(G) of G is the maximum of those k/d for which K_k/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χ_c(H) = ω_c(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, N_G[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, N_G[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P₅ (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph K_k/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005