Tail asymptotics for the fundamental period in the MAP/G/1 queue

This paper studies the tail behavior of the fundamental period in the MAP/G/1 queue. We prove that if the service time distribution has a regularly varying tail, then the fundamental period distribution in the MAP/G/1 queue has also regularly varying tail, and vice versa, by finding an explicit expression for the asymptotics of the tail of the fundamental period in terms of the tail of the service time distribution. Our main result with the matrix analytic proof is a natural extension of the result in (de Meyer and Teugels, J. Appl. Probab. 17: 802–813, 1980) on the M/G/1 queue where techniques rely heavily on analytic expressions of relevant functions. I.-S. Wee’s research was supported by the Korea Research Foundation Grant KRF 2003-070-00008.     

Investigation of cold fusion in heavy water

An investigation of cold fusion of deuterium was performed by electrolyzing heavy water in a cell containing a palladium cathode while monitoring levels of tritium and neutron-capture gamma rays. No activity was detected that would indicate a sustained fusion reaction had taken place. Activities that were observed can be attributed to electrolytic enrichment and a normal cosmic-ray induced background.     

Photoemission studies of oxygen adsorbed on a LiAl(1 1 0) alloy surface: Role of Li segregation

We investigated that the effect of the number of segregated Li atoms on the rate of oxidation on a LiAl alloy surface. Oxygen molecules adsorbed on the LiAl alloy react with the surface atoms to form stable oxides. The segregated Li atoms at reconstructed surfaces (c(2×2) and (2×1)) enhance the oxidation rate and form stable LiAlO_x and Li₂O. The degree of enhancement of oxidation by segregated Li atoms varies as a function of O₂ exposure and annealing temperature, where the latter is directly related to the mode of surface reconstruction by Li segregation.     

Dielectrophoretically aligned GaN nanowire rectifiers

We demonstrate GaN nanowire (NW) current rectifiers which were formed by assembling n-GaN nanowires on a patterned p-Si substrate by means of alternating current (ac) dielectrophoresis. The dielectrophoresis was accomplished at a frequency of 10 kHz with three different ac bias voltages (5, 10, and 15 V_p–p), indicating that the number of aligned GaN nanowires increased with increasing ac bias voltage. The n-GaN NW/p-Si diodes showed well-defined current rectifying behavior with a forward voltage drop of 1.2–1.5 V at a current density of 200 A/cm². We observed that the GaN NW diode functioned well as a half-wave rectifier. PACS 71.20.Nr; 73.40.Cg; 73.40.Ei; 73.40.Kp     

A Hybrid Multiobjective Evolutionary Algorithm for Solving Vehicle Routing Problem with Time Windows

Vehicle routing problem with time windows (VRPTW) involves the routing of a set of vehicles with limited capacity from a central depot to a set of geographically dispersed customers with known demands and predefined time windows. The problem is solved by optimizing routes for the vehicles so as to meet all given constraints as well as to minimize the objectives of traveling distance and number of vehicles. This paper proposes a hybrid multiobjective evolutionary algorithm (HMOEA) that incorporates various heuristics for local exploitation in the evolutionary search and the concept of Pareto's optimality for solving multiobjective optimization in VRPTW. The proposed HMOEA is featured with specialized genetic operators and variable-length chromosome representation to accommodate the sequence-oriented optimization in VRPTW. Unlike existing VRPTW approaches that often aggregate multiple criteria and constraints into a compromise function, the proposed HMOEA optimizes all routing constraints and objectives simultaneously, which improves the routing solutions in many aspects, such as lower routing cost, wider scattering area and better convergence trace. The HMOEA is applied to solve the benchmark Solomon's 56 VRPTW 100-customer instances, which yields 20 routing solutions better than or competitive as compared to the best solutions published in literature.     

Iterative solutions for low lying excited states of a class of SchrSdinger equation

The convergent iterative procedure for solving the groundstate Schr?dinger equation is extended to derive the excitation energy and the wavefunction of the low-lying excited states. The method is applied to the one-dimensional quartic potential problem. The results show that the iterative solution converges rapidly when the coupling g is not too small.     

Dispersion Compensation in Externally Modulated Transmission System Using Chirped Fiber Grating

We present an externally modulated NTSC AM-VSB erbium-doped fiber amplifier (EDFA)-repeated system in the 1550 nm region which uses a chirped fiber grating (CFG) as a dispersion compensation device. In contrast to the conventional externally modulated fiber optical CATV systems, either with or without dispersion compensation fiber (DCF), good performances of carrier-to-noise ratio (CNR) ≥50 dB, composite second order (CSO) ≥74 dB, and composite triple beat (CTB) ≥65 dB were achieved for the full channel band after a 100-km single-mode fiber (SMF) transmission.     

Design and Experimental Characterization of Low‐Volume PM10/2.5/1.0 Trichotomous Sampler Inlet

This paper presents the development and laboratory evaluation of a PM10/2.5/1.0 trichotomous sampling inlet that consists of two main parts: a previously designed PM10 size‐selective inlet part and a PM2.5/1.0 two‐stage virtual impactor, which was newly fabricated and attached serially to the PM10 size selective inlet part. Particles are collected in three locations through the trichotomous sampling inlet to provide for not only particle concentration measurements of PM10, PM2.5 and PM1.0, but also those of PM2.5–10 and PM1.0–2.5.     

A Lagrangean heuristic algorithm for disassembly scheduling with capacity constraints

This paper considers the problem of determining the disassembly schedule (quantity and timing) of products in order to satisfy the demand of their parts or components over a finite planning horizon. The objective is to minimize the sum of set-up, disassembly operation, and inventory holding costs. As an extension of the uncapacitated versions of the problem, we consider the resource capacity restrictions over the planning horizon. An integer program is suggested to describe the problem mathematically, and to solve the problem, a heuristic is developed using a Lagrangean relaxation technique together with a method to find a good feasible solution while considering the trade-offs among different costs. The effectiveness of the algorithm is tested on a number of randomly generated problems and the test results show that the heuristic suggested in this paper can give near optimal solutions within a short amount of computation time.