Construction of 2Ⅲ^[m-（m-k）] Designs with the Maximum Number of Clear Two-factor Interactions

It is useful to know the maximum number of clear two-factor interactions in a_Ⅲ~(m-(m-k))design.This paper provides a method to construct a 2_Ⅲ~(m-(m-k))design with the maximum number of clear two-factorinteractions.And it is proved that the resulting designs have more clear two-factor interactions than thoseconstructed by Tang et al.Moreover,the designs constructed are shown to have concise grid representations.     

New general guidance method in constrained optimal control,part 2: Application to space shuttle guidance

The application and the performance of the neighboring optimal feedback scheme presented in Part 1 of this paper is demonstrated for the heating-constrained cross-range maximization problem of a space-shuttle-orbiter-type vehicle. This problem contains five state variables, two control variables, and a state variable inequality constraint of order zero.This research was supported in part by the Deutsche Forschungsgemeinschaft under the Schwerpunktprogramm Anwendungsbezogene Optimierung und Steuerung.The authors wish to express their sincere and grateful appreciation to Professor Roland Bulirsch who encouraged this work.     

Diagrams,orientations, and varieties

One of the central problems in the theory of ordered sets is to describe the orientations of the covering graph of an ordered set. We show that the particular operation called inversion, together with the classical constructions of retraction and product, provide a context for the classification of all such orientations. AMS subject classifications (1980). 06A10, 05C75, 05C20.     

On the cover time of random walks on graphs

This article deals with random walks on arbitrary graphs. We consider the cover time of finite graphs. That is, we study the expected time needed for a random walk on a finite graph to visit every vertex at least once. We establish an upper bound ofO(n ²) for the expectation of the cover time for regular (or nearly regular) graphs. We prove a lower bound of (n logn) for the expected cover time for trees. We present examples showing all our bounds to be tight.Mike Saks was supported by NSF-DMS87-03541 and by AFOSR-0271. Jeff Kahn was supported by MCS-83-01867 and by AFOSR-0271.     

Optimum gas chromatographic conditions in wall-coated capillary columns. Extended and simplified forms of the Golay-equation

Band broadening in capillary columns is satisfactorily described by the Golay-equation extended to situations of appreciable pressure drop by Giddings. In practice, however, several simplifications are often made. The effect of these simplifications on the calculated values of the minimum plate height and optimum carrier gas velocity are treated systematically.     

二组分混合物的最小流化特性 Ⅰ.混合/分离状态与最小流化空隙率

分析了二组分混合物的３种混合／分离状态及在完全混合时发生连续相转变的极限组成。提出一个判别非等密度体系混合／分离状态的法则与确定混合物空隙率简易可行的随意松散堆积方法。     

STUDIES ON TUNG OIL COATED REGENERATED CELLULOSE FILMS WITH WATERRESISTANCE

Regenerated cellulose films with water-resistance were obtained by an improved method ofpreparing cellulose cuoxam solution from pulps of agricultural wastes (linters, wheat straw, reedand Bamao). Experimental results showed that the mechanical properties of both the dry. and wetfilms were excellent. Data from IR, SEM and tensile strength measurements implied that thesignificant improvement of water-resistance of the films was due to the cohesion between the thinTung oil covers with hydrophobicity and the regenerated cellulose films. The films werecompletely biodegraded after being buried in soil for 100 days. The transmittance of the filmsderived from linter and reed in visible band range were 80-90%.     

Properties of a genetic algorithm extended by a random self-learning operator and asymmetric mutations: A convergence study for a task of powder-pattern indexing

Genetic algorithms represent a powerful global-optimisation tool applicable in solving tasks of high complexity in science, technology, medicine, communication, etc. The usual genetic-algorithm calculation scheme is extended here by introduction of a quadratic self-learning operator, which performs a partial local search for randomly selected representatives of the population. This operator is aimed as a minor deterministic contribution to the (stochastic) genetic search. The population representing the trial solutions is split into two equal subpopulations allowed to exhibit different mutation rates (so called asymmetric mutation). The convergence is studied in detail exploiting a crystallographic-test example of indexing of powder diffraction data of orthorhombic lithium copper oxide, varying such parameters as mutation rates and the learning rate. It is shown through the averaged (over the subpopulation) fitness behaviour, how the genetic diversity in the population depends on the mutation rate of the given subpopulation. Conditions and algorithm parameter values favourable for convergence in the framework of proposed approach are discussed using the results for the mentioned example. Further data are studied with a somewhat modified algorithm using periodically varying mutation rates and a problem-specific operator. The chance of finding the global optimum and the convergence speed are observed to be strongly influenced by the effective mutation level and on the self-learning level. The optimal values of these two parameters are about 6 and 5%, respectively. The periodic changes of mutation rate are found to improve the explorative abilities of the algorithm. The results of the study confirm that the applied methodology leads to improvement of the classical genetic algorithm and, therefore, it is expected to be helpful in constructing of algorithms permitting to solve similar tasks of higher complexity.     

绿色供应链中消费者信用支付策略研究

本文考虑了一个由单一供应商和单一电商平台组成的绿色供应链,分析了三种不同支付策略(立即支付策略、分期付款策略以及最低还款策略)对供应链成员最优决策和利润的影响。研究表明:(1)免息期敏感系数对绿色营销水平和供应链成员利润均有正向影响。(2)信用支付会使产品产生溢价现象。但在一定条件下,信用支付策略可同时提高供应链成员利润和绿色营销水平,实现经济绩效和环境绩效的双赢。(3)手续费率较高时,若信用期限系数较小,立即支付策略最优;若信用期限系数适中,分期付款策略最优;否则最低还款策略最优。手续费率较低且信用期较小时,最低还款策略最优,否则立即支付策略最优。在此基础上,针对两种信用支付模型设计了成本分担和收益共享的组合契约,实现了供应链协调。     

Covering with blocks in the non-symmetric case

Considering an infinite string of i.i.d. random letters drawn from a finite alphabet we define the cover timeW _n as the number of random letters needed until each pattern of lenghtn appears at least once as a substring. Sharp weak and a.s. limit results onW _n are known in the symmetric case, i.e., when the random letters are uniformly distributed over the alphabet. In this paper we determine the limit distribution ofW _n in the nonsymmetric case asn. Generalizations in terms of point processes are also proved.Dedicated to Endre Csáki on his 60th birthday.