Bounds on the maximum numbers of clear two-factor interactions for 2^{(n_1 + n_2 ) - (k_1 + k_2 )} fractional factorial split-plot designs

Fractional factorial split-plot (FFSP) designs have an important value of investigation for their special structures. There are two types of factors in an FFSP design: the whole-plot (WP) factors and sub-plot (SP) factors, which can form three types of two-factor interactions: WP2fi, WS2fi and SP2fi. This paper considers FFSP designs with resolution III or IV under the clear effects criterion. It derives the upper and lower bounds on the maximum numbers of clear WP2fis and WS2fis for FFSP designs, and gives some methods for constructing the desired FFSP designs. It further examines the performance of the construction methods.     

Two inequalities involving Hadamard products of positive semi-definite Hermitian matrices

We extend two inequalities involving Hadamard products of positive definite Hermitian matrices to positive semi-definite Hermitian matrices. Simultaneously, we also show the sufficient conditions for equalities to hold. Moreover, some other matrix inequalities are also obtained. Our results and methods are different from those which are obtained by S. Liu in [J. Math. Anal. Appl. 243:458–463(2000)] and B.-Y. Wang et al. in [Lin. Alg. Appl. 302–303: 163–172(1999)].     

Complete ideals and singularities of space curves

We consider complete ideals supported on finite sequences of infinitely near points, in regular local rings with dimensions greater than two. We study properties of factorizations in Lipman special *-simple complete ideals. We relate it to a type of proximity, linear proximity, of the points, and give conditions in order to have unique factorization. Several examples are presented. Received: 2 February 2000 / in final form: 14 March 2001 / Published online: 18 January 2002     

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     

一种新型彩色三维光学成像系统

提出一种新型三维彩色光学数字成像系统。此系统利用投影结构光对现实世界中的物体进行数字化，同时得到对应的彩色纹理。详细介绍了系统的硬件设计和软件体系结构设计，得到物体彩色纹理的两种不同方法；直接获取和从编码条纹中提取，给出了用该系统得到的实验结果并简单评价了系统的性能。此系统在反求工程、影视制作、三维游戏制作、医学应用等方面有远大的应用前景。     

CMS physics overview

The principal physics goals of the Compact Muon Solenoid experiment under construction at the Large Hadron Collider at CERN in Geneva are reviewed. Procedures to search for the Standard Model Higgs boson, supersymmetric Higgses and other supersymmetric particles are described.     

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.