Canonical Modules of Semigroup Rings and a Conjecture of Reiner

We prove that the homotopy types of two naturally defined simplicial complexes are related in the following way: one is homotopy equivalent to a multiple suspension of the canonical Alexander dual of the other. These simplicial complexes arise in free resolutions of semigroup rings and modules. The relation between their homotopy types was conjectured by Reiner, and was suggested by a homological consequence of a result due independently to Danilov and Stanley on canonical modules of normal semigroup rings. Our proof is purely topological, and gives an alternative proof of their result. We also prove a generalization of a result of Hochster saying that these rings are Cohen—Macaulay, and indicate a new proof of Ehrhart's reciprocity law for rational polytopes. Received October 3, 2000, and in revised form April 2, 2001, and May 10, 2001. Online publication November 7, 2001.     

Two modifications of the least cost per period heuristic for dynamic lot-sizing

This paper proposes two constructive heuristics for the well-known single-level uncapacitated dynamic lot-sizing problem. The proposed heuristics, called net least period cost (nLPC) and nLPC(i), are developed by modifying the average period cost concept from Silver and Meal's heuristic, commonly known as least period cost (LPC). An improved tie-breaking stopping rule and a locally optimal decision rule are proposed in the second heuristic to enhance performance. We test the effectiveness of the proposed heuristics by using 20 benchmarking test problems frequently used in the literature. Furthermore, we perform a large-scale simulation study involving three factors, 50 experimental conditions, and 100?000 randomly generated problems to evaluate the proposed heuristics against LPC and six other well-known constructive heuristics in the literature. The simulation results show that both nLPC and nLPC(i) produce average holding and setup costs lower than or equal to those of LPC in every one of the 50 experimental conditions. The proposed heuristics also outperform each of the six other heuristics evaluated in all experimental conditions, without an increase in computational requirements. Lastly, considering that both nLPC and nLPC(i) are fairly simple for practitioners to understand and that lot-sizing heuristics have been commonly used in practice, there should be a very good chance for practical applications of the proposed heuristics.     

重写系统和的合流性

在实际应用中,常常使用多个重写系统。本文主要讨论重写系统和的合流性,并给出了一个重写系统和具有合流性的充分条件。     

Fuzzy convex sets in median algebras

The fuzzification of convex sets in median algebras is considered, and some of their properties are investigated. A characterization of finite valued fuzzy convex set is given.     

Some new results on superimposed codes

A (w,r) cover‐free family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A (w,r) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as the concept of key distribution pattern. In the present paper, we give some new results on superimposed codes. First we construct superimposed codes from super‐simple designs which give us results better than superimposed codes constructed by other known methods. Next we prove the uniqueness of the (1,2) superimposed code of size 9 × 12, the (2,2) superimposed code of size 14 × 8, and the (2,3) superimposed code of size 30 × 10. Finally, we improve numerical values of upper bounds for the asymptotic rate of some (w,r) superimposed codes. © 2004 Wiley Periodicals, Inc.     

A fast method to measure the thickness of removed layer from etching of SSNTD based on EDXRF

Solid state nuclear track detectors are commonly used for measurements of concentrations of radon gas and/or radon progeny. All these measurements depend critically on the thickness of the removed layer during etching. However, the thickness of removed layer calculated using the etching period does not necessarily provide a sufficiently accurate measure of the thickness. For example, the bulk etch rate depends on the strength of stirring during etching for the LR 115 detector. We propose here to measure the thickness of the removed layer by using energy-dispersive X-ray fluorescence spectrometry. In the present work, a reference silver nitrate pellet is placed beneath the LR 115 detector, and the fluorescence X-ray intensity for silver is then measured. We have found a linear relationship between the X-ray intensity and the thickness of the removed layer for LR 115 detector. This provides a fast method to measure the thickness of removed layer from etching of LR 115 detector. However, this method was found to be inapplicable for the CR-39 detector. Therefore, alternative methods have yet to be explored for the CR-39 detector.     

Bounds to optimal burn‐in and optimal work size

Burn‐in is a widely used method to improve the quality of products or systems after they have been produced. In this paper, we consider the problem of determining the optimal burn‐in time and optimal work size maximizing the long‐run average amount of work saved per time unit in the computer applications. Assuming that the underlying lifetime distribution of the computer has an initially decreasing or/and eventually increasing failure rate function, an upper bound for the optimal burn‐in time is derived for each fixed work size and a uniform (with respect to the burn‐in time) upper bound for the optimal work size is also obtained. Furthermore, it is shown that a non‐trivial lower bound for the optimal burn‐in time can be derived if the underlying lifetime distribution has a large initial failure rate. Copyright © 2005 John Wiley & Sons, Ltd.     

Low Cost, High Efficiency, Gain Flattened L Band EDFA Using FBGs as C Band Seed Generators

A low cost, coolerless 980nm diode pumped, gain flattened L band EDFA with fast transient control, high pump efficiency and gain clamping effect was realized by using FBGs as C band seed generators.