非保守动力学系统的Noether定理的一个证明

本文直接从动力学系统的Lagrange函数在无穷小变换下的变换性质出发,得到了完整非保守和非完整非保守的Noether定理。本文的方法具有优越性。     

高加载率条件下LY12铝合金损伤断裂现象的研究

 本文以球形实体中含有一球形空穴为基本单元，通过分析单元的受力状态，推导出了一个韧性介质空穴增长模型。模型中考虑了介质的硬化，应变率效应，同时还考虑了惯性效应。在考虑空穴成核效应时，采用了热激活成核机制。对LY12铝合金进行了二维层裂实验，采用本文提出的动态损伤模型，借助于二维Lagrange弹塑性流动有限差分程序对二维层裂实验进行了数值模拟，计算结果与实验吻合较好。     

Choice of optimal search strategy

The problem of searching the extremum of a scalar function of a vector argument is considered. It is assumed that a finite set of algorithms, each of which is capable of finding the extremum, is specified. Every algorithm is characterized by a given number of operators each of which is identified with the state of the system. Each algorithm is defined by a transition probability matrix over the possible states (operators) and a corresponding matrix of the respective changes in the value of the function toward the extremal point.A procedure is given for selecting an optimal sequence of algorithms which maximizes the total expected change in the value of the function toward the optimum.     

A note on weighted buddy systems for dynamic storage allocation

In this paper we first show that the Shen and Peterson System [1] is a combination of two Fibonacci buddy systems [2, 3]. Then we present a generalized Shen and Peterson system. The generalized system has more flexibility in the generation of fixed size blocks. For the generalized system, the algorithm for the determination of the buddy of any released block is easier than that of the Shen and Peterson system.     

A dynamic solution concept for abstract games

Several solution concepts have been defined for abstract games. Some of these are the core, due to Gillies and Shapley, the Von Neumann-Morgenstern stable sets, and the subsolutions due to Roth. These solution concepts are rather static in nature. In this paper, we propose a new solution concept for abstract games, called the dynamic solution, that reflects the dynamic aspects of negotiation among the players. Some properties of the dynamic solution are studied. Also, the dynamic solution of abstract games arising fromn-person cooperative games in characteristic function form is investigated.This research was supported by the Office of Naval Research under Contract No. N00014-75-C-0678, by the National Science Foundation under Grants Nos. MPS-75-02024 and MCS-77-03984 at Cornell University, by the United States Army under Contract No. DAAG-29-75-C-0024, and by the National Science Foundation under Grant No. MCS-75-17385-A01 at the University of Wisconsin. The author is grateful to Professor W. F. Lucas under whose guidance the research was conducted.     

An optimal choice problem for a set of checking procedures

An item having a known initial failure probability is to be controlled by some out of a finite set of possible checks. Every check costs a certain amount of money, and budget constraints must be met. A check is characterized by the probabilities of three events: (i) letting a workable item pass, (ii) overlooking a failure if one is present, (iii) introducing a failure into a workable item. We show how any subset of checks to be employed is ordered optimally, and how the optimal subsequence of checks depends on the initial failure probability and oil the budget constraint.     

激光散射及光电子技术对液晶特性的测试

激光散射和光电子技术是目前测试液晶特性最先进和可靠的手段。此技术通过静态光散射和动态光散射两种测试方法，测得液晶的分子量、浊度系数、相关长度、相变温度、展矩和扭矩等许多物理参数，因此可判断液晶的类型，了解液晶的结构、形态，相转移及动态变形的过程，为液晶在许多领域的应用提供可靠的理论依据。     

A dynamic programming algorithm for dynamic lot size models with piecewise linear costs

We propose a new algorithm for dynamic lot size models (LSM) in which production and inventory cost functions are only assumed to be piecewise linear. In particular, there are no assumptions of convexity, concavity or monotonicity. Arbitrary capacities on both production and inventory may occur, and backlogging is allowed. Thus the algorithm addresses most variants of the LSM appearing in the literature. Computational experience shows it to be very effective on NP-hard versions of the problem. For example, 48 period capacitated problems with production costs defined by eight linear segments are solvable in less than 2.5 minutes of Vax 8600 cpu time.