Constructing Invariant Fairness Measures for Surfaces

The paper proposes a rational method to derive fairness measures for surfaces. It works in cases where isophotes, reflection lines, planar intersection curves, or other curves are used to judge the fairness of the surface. The surface fairness measure is derived by demanding that all the given curves should be fair with respect to an appropriate curve fairness measure. The method is applied to the field of ship hull design where the curves are plane intersections. The method is extended to the case where one considers, not the fairness of one curve, but the fairness of a one parameter family of curves. Six basic third order invariants by which the fairing measures can be expressed are defined. Furthermore, the geometry of a plane intersection curve is studied, and the variation of the total, the normal, and the geodesic curvature and the geodesic torsion is determined.     

一维光学格子孤子的传输特性及控制研究

利用解析和数值方法研究了在具有横向折射率周期性调制的克尔型非线性介质中光学格子孤子的传输，得到了孤子参数的演化方程以及格子孤子的形成和稳定传输的条件.结果表明：当光束的入射角小于某临界角度时，光束可被类似波导形式的路径俘获而稳定传输，该临界角随折射率调制周期、调制深度的增加而增大，且光束越窄临界值越大.此外，线性空间啁啾虽然对光束传输的中心位置没有任何影响，但会导致光束发散从而破坏格子孤子的形成和稳定传输，对此提出了采用特定功率取值来补偿啁啾作用从而形成格子孤子的方案. 关键词： 光孤子 光学格子 光传输 矩方法     

幂格

本文引入了幂格的概念并讨论了其相关性质。     

Development of a Simulation Model for Solid Objects Suspended in a Fluctuating Fluid

We introduce a new scheme for the future application of Real-coded Lattice Gas (RLG) to the numerical simulation of suspended solid objects in a fluctuating fluid environment. The reproduction of Brownian motion for a single solid object is verified through the Gaussian distribution of its displacements. The effectiveness of the solid–solid interaction model is also confirmed in an N-body simulation.     

平行机半在线排序问题研究(Ⅰ)

对半在线平行机排序问题的研究进展作了详细综述和进一步探讨。文章给出半在线排序问题的背景、定义、分类和求解。介绍它们定义和在不同机器环境和目标函数下半在线排序问题分类，以及第一类半在线模型的近似算法的设计及其竞争比分析。     

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.     

Comparison of two models for managing reliability growth during product design

Relying on reliability growth testing to improve system designis neither usually effective nor efficient. Instead it is importantto design in reliability. This requires models to estimate reliabilitygrowth in the design that can be used to assess whether goalreliability will be achieved within the target timescale forthe design process. Many models have been developed for analysisof reliability growth on test, but there has been much lessattention given to reliability growth in design. This paperdescribes and compares two models: one motivated by the practicalengineering process; the other by extending the reasoning ofstatistical reliability growth modelling. Both models are referencedin the recently revised edition of international standard IEC61164. However, there has been no reported evaluation of theirproperties. Therefore, this paper explores the commonalitiesand differences between these models through an assessment oftheir logic and their application to an industrial example.Recommendations are given for the use of reliability growthmodels to aid management of the design process and to informproduct development.     

Analysis of a 2D “liquid”plasma lattice

Adustyplasmacanbedefinedasacomplicatedplasmacontainingsmallsolidmattercalleddustgrainsordustparticles,whichareusuallychargednegatively,duetoelectronshighermobilitythanion,bycollectingelectronsandionsfromthebackgroundplasma.Theuniverseisfilledwithdustyplasmassuchasplanetaryrings,comettails,andnebulae.Also,inindustrialplasmaprocessing,particulatessuspendedinplasmaarethemajorcontaminationinsemiconductormanufacture.Studiesondustyplasmahavebeenextendedtofar-flungtopicssuchaswaves,instabilities,stro…     

Construction algorithms for polynomial lattice rules for multivariate integration

We introduce a new construction algorithm for digital nets for integration in certain weighted tensor product Hilbert spaces. The first weighted Hilbert space we consider is based on Walsh functions. Dick and Pillichshammer calculated the worst-case error for integration using digital nets for this space. Here we extend this result to a special construction method for digital nets based on polynomials over finite fields. This result allows us to find polynomials which yield a small worst-case error by computer search. We prove an upper bound on the worst-case error for digital nets obtained by such a search algorithm which shows that the convergence rate is best possible and that strong tractability holds under some condition on the weights.

We extend the results for the weighted Hilbert space based on Walsh functions to weighted Sobolev spaces. In this case we use randomly digitally shifted digital nets. The construction principle is the same as before, only the worst-case error is slightly different. Again digital nets obtained from our search algorithm yield a worst-case error achieving the optimal rate of convergence and as before strong tractability holds under some condition on the weights. These results show that such a construction of digital nets yields the until now best known results of this kind and that our construction methods are comparable to the construction methods known for lattice rules.

We conclude the article with numerical results comparing the expected worst-case error for randomly digitally shifted digital nets with those for randomly shifted lattice rules.

     

Order restricted randomized designs for control versus treatment comparison

We develop a method of randomizing units to treatments that relies on subjective judgement or on possible coarse modeling to produce restrictions on the randomization. The procedure thus fits within the general framework of ranked set sampling. However, instead of selecting a single unit from each set for full measurement, all units within a set are used. The units within a set are assigned to different treatments. Such an assignment translates the positive dependence among units within a set into a reduction in variation of contrasting features of the treatments. A test for treatment versus control comparison, with controlled familywise error rate, is developed along with the associated confidence intervals. The new procedure is shown to be superior to corresponding procedures based on completely randomized or ranked set sample designs. The superiority appears both in asymptotic relative efficiency and in power for finite sample sizes. Importantly, this test does not rely on perfect rankings; rather, the information in the data on the quality of rankings is exploited to maintain the level of the test when rankings are imperfect. The asymptotic relative efficiency of the test is not affected by estimation of the quality of rankings, and the finite sample performance is only mildly affected.