加肋圆柱壳在轴压作用下的屈曲和后屈曲

本文讨论完善和非完善的,纵向加肋和正交加肋圆柱壳在轴压作用下的屈曲和后屈曲性态.依据文[1]提供的圆柱薄壳屈曲的边界层理论及其分析方法,给出了加肋圆柱壳在轴压作用下的屈曲和后屈曲理论分析.本文同时讨论肋骨与壳板材料不同时对加肋圆柱壳屈曲和后屈曲性态的影响.     

A search technique for global optimization in a chaotic environment

We describe a new algorithm which uses the trajectories of a discrete dynamical system to sample the domain of an unconstrained objective function in search of global minima. The algorithm is unusually adept at avoiding nonoptimal local minima and successfully converging to a global minimum. Trajectories generated by the algorithm for objective functions with many local minima exhibit chaotic behavior, in the sense that they are extremely sensitive to changes in initial conditions and system parameters. In this context, chaos seems to have a beneficial effect: failure to converge to a global minimum from a given initial point can often be rectified by making arbitrarily small changes in the system parameters.     

Simulated annealing with noisy or imprecise energy measurements

The annealing algorithm (Ref. 1) is modified to allow for noisy or imprecise measurements of the energy cost function. This is important when the energy cannot be measured exactly or when it is computationally expensive to do so. Under suitable conditions on the noise/imprecision, it is shown that the modified algorithm exhibits the same convergence in probability to the globally minimum energy states as the annealing algorithm (Ref. 2). Since the annealing algorithm will typically enter and exit the minimum energy states infinitely often with probability one, the minimum energy state visited by the annealing algorithm is usually tracked. The effect of using noisy or imprecise energy measurements on tracking the minimum energy state visited by the modified algorithms is examined.The research reported here has been supported under Contracts AFOSR-85-0227, DAAG-29-84-K-0005, and DAAL-03-86-K-0171 and a Purdue Research Initiation Grant.     

Kthe-Bochner空间的凸性(英文)

本文利用Kothe函数空间的性质以及Kothe函数空间与Kothe-Bochner空间的关系,讨论了Kothe-Bochner空间E(X)的凸性,主要结果如下: (a)给出E(X)的端点的充分条件,得到了E(X)严格凸的判据,相应地推广了Lp(μ,X) 以及Lφ(X)的结果; (b)讨论了E(X)的弱局部一致凸和局部完全k-凸; (c)刻画了E(X)的强凸,给出了F(X)强凸的充要条件．     

Adaptive Algorithm for Constrained Least-Squares Problems

This paper is concerned with the implementation and testing of an algorithm for solving constrained least-squares problems. The algorithm is an adaptation to the least-squares case of sequential quadratic programming (SQP) trust-region methods for solving general constrained optimization problems. At each iteration, our local quadratic subproblem includes the use of the Gauss–Newton approximation but also encompasses a structured secant approximation along with tests of when to use this approximation. This method has been tested on a selection of standard problems. The results indicate that, for least-squares problems, the approach taken here is a viable alternative to standard general optimization methods such as the Byrd–Omojokun trust-region method and the Powell damped BFGS line search method.     

Global Phase Time and Wave Function for the Kantowski-Sachs Anisotropic Universe

A consistent quantization with a clear notion of time and evolution is given for the anisotropic Kantowski–Sachs cosmological model. It is shown that a suitable coordinate choice allows to obtain a solution of the Wheeler–DeWitt equation in the form of definite energy states, and that the results can be associated to two disjoint equivalent theories, one for each sheet of the constraint surface.     

A primer on perfect simulation for spatial point processes

This primer provides a self-contained exposition of the case where spatial birth-and-death processes are used for perfect simulation of locally stable point processes. Particularly, a simple dominating coupling from the past (CFTP) algorithm and the CFTP algorithms introduced in [13], [14], and [5] are studied. Some empirical results for the algorithms are discussed. Received: 30 June 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