Large set of P3‐decompositions

Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λK_n into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P₃,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008     

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.     

非傍轴平顶高斯光束M2因子两种定义的比较研究

基于功率密度的二阶矩方法,推导出了非傍轴平顶高斯(FG)光束束宽和远场发散角的解析表达式·研究表明,当w0/λ→0时,远场发散角趋于渐近值θmax=63.435°,与阶数无关·使用非傍轴高斯光束代替傍轴高斯光束作为理想光束,研究了非傍轴FG光束的M2因子,并与传统定义的M2因子作了比较·在非傍轴范畴,非傍轴FG光束的M2因子不仅与阶数N有关,而且与w0/λ有关·按照定义,当w0/λ→0时,非傍轴FG光束的M2因子不等于0,对阶数N=1,2,3时,M2因子分别趋于0.913,0.882和0.886·当N→∞时,M2因子取最小值M2min=0.816·     

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.     

Sobolev-Hardy不等式与临界双重调和问题

该文讨论一类带有奇异系数的双重调和方程{△^2u-μu/|x|^s=f(x,u),x∈Ω,u=δu/δv=0,x∈δΩ，这里Ω包含R^N是包含0的有界光滑区域，u∈H0^2(Ω），μ∈R是参数，0≤s≤2,△^2=△△表示双重拉普拉斯算子，当f(x,u)=u^p,p=2N/N-4时，上述问题就是一个临界双重调和问题，该文运用Sobolev-Hardy不等式和变分方法，得到它的解的存在性的一些结果。