Urban rapid transit network capacity expansion

This paper examines a multi-period capacity expansion problem for rapid transit network design. The capacity expansion is realized through the location of train alignments and stations in an urban traffic context by selecting the time periods. The model maximizes the public transportation demand using a limited budget and designing lines for each period. The location problem incorporates the user decisions about mode and route. The network capacity expansion is a long-term planning problem because the network is built over several periods, in which the data (demand, resource price, etc.) are changing like the real problem changes. This complex problem cannot be solved by branch and bound, and for this reason, a heuristic approach has been defined in order to solve it. Both methods have been experimented in test networks.     

On the number of registers needed to evaluate arithmetic expressions

The question of how many temporary storage registers are needed to evaluate compiled arithmetic and masking expressions is discussed. It is assumed that any combination of left-to-right, right-to-left, top-to-bottom, and bottom-to-top techniques may be used to evaluate an expression, but that no factoring or re-arranging of the expression may occur. On this basis, the maximum number of registers needed to evaluate nonparenthesized expressions isN+1, withN the number of dyadic operator precedence levels. For parenthesized expressions with a maximum ofK nested parenthetical subexpressions, the maximum number of registers needed is (K+1)N+1.     

Optimal shape design for systems governed by variational inequalities,part 1: Existence theory for the elliptic case

Some general existence results for optimal shape design problems for systems governed by elliptic variational inequalities are established by the mapping method and variational convergence theory. Then, an existence theorem is given for the optimal shape for an electrochemical machining problem, in which the cost functional is not lower semicontinuous, by extending the general results to this case. Furthermore, this problem is approximated by a set of optimal shape design problems which have more smooth cost functionals and are easier to handle computationally.The authors with to express their sincere thanks to the reviewers for supplying additional references and for their valuable comments, which made the paper more readable.     

Design of axisymmetric sandwich plates for alternative loads

The minimal-weight design of sandwich plates whose rigidplastic face sheets obey the Tresca yield condition and which are subjected to two alternative loads is systematically determined by the method of stress variation. It is shown that, when the loads are unidirectional, the general solution for a certain class of edge conditions consists of five fundamentally different designs. The totality of optimal design solutions is depicted in the form of a design chart. A comprehensive example is presented to illustrate the method.This paper is based in part upon a dissertation submitted by the first author to The University of Iowa in partial fulfillment of requirements for the PhD Degree.     

New algorithms for constrained minimax optimization

A constrained minimax problem is converted to minimization of a sequence of unconstrained and continuously differentiable functions in a manner similar to Morrison's method for constrained optimization. One can thus apply any efficient gradient minimization technique to do the unconstrained minimization at each step of the sequence. Based on this approach, two algorithms are proposed, where the first one is simpler to program, and the second one is faster in general. To show the efficiency of the algorithms even for unconstrained problems, examples are taken to compare the two algorithms with recent methods in the literature. It is found that the second algorithm converges faster with respect to the other methods. Several constrained examples are also tried and the results are presented.     

基于Buchadhl象差系数和解析偏导数的光学优化设计

本文以基于 Buchadhl 象差系数得到的点列图为目标函数,只需追迹少许光线就可得到近似点列图,大大减少了计算量;同时采用了目标函数对结构参数偏导数解析求导原理并应用于光学自动设计,这样得到的解析偏导数不仅不存在原理误差,同时极大地减少了求得所需的时间;最后给出了使用 DFP-BFGS 优化方法设计一个双高斯物镜的实例.     

Non-dynamical stochastic resonance: Theory and experiments with white and various coloured noises

Summary We describe the simplest system which shows stochastic resonance. A linear(ized) theory for white and (almost) arbitrarily coloured noise is presented. The presented new system has new, unique properties which originate from itsnon-dynamical character; for example, the strength and phase shift of periodic response of the system is independent of the frequency. Experiments have been carried out with the following noise processes: (physical) white noise, (physical) Lorentzian noise and (physical) 1/f noise. With a small extension of the system, its linear-response regime can be significantly increased. As the system is similar to some simple models of neurones, the new results might have not only physical but also biological importance. Paper presented at the International Workshop “Fluctuations in Physics and Biology: Stochastic Resonance, Signal Processing and Related Phenomena”, Elba, 5–10 June 1994.     

机械结构的模糊优化设计

本文阐述了机械结构模糊优化设计的必要性及方法，并以用于５５千瓦风力发电机组的ＮＧＷ９２型行星齿轮传动为例，说明这一现代设计方法的实施及优良设计特性。     

光学设计的发展

本文概述了光学设计所处的历史发展阶段,对智能化光学设计给出了定性的描述,指出了目前光学设计要解决的问题以及发展方向。     

Orientational sampling and rigid-body minimization in molecular docking revisited: On-the-fly optimization and degeneracy removal

Summary Strategies for computational association of molecular components entail a compromise between configurational exploration and accurate evaluation. Following the work of Meng et al. [Proteins, 17 (1993) 266], we investigate issues related to sampling and optimization in molecular docking within the context of the DOCK program. An extensive analysis of diverse sampling conditions for six receptor-ligand complexes has enabled us to evaluate the tractability and utility of on-the-fly force-field score minimization, as well as the method for configurational exploration. We find that the sampling scheme in DOCK is extremely robust in its ability to produce configurations near to those experimentally observed. Furthermore, despite the heavy resource demands of refinement, the incorporation of a rigid-body, grid-based simplex minimizer directly into the docking process results in a docking strategy that is more efficient at retrieving experimentally observed configurations than docking in the absence of optimization. We investigate the capacity for further performance enhancement by implementing a degeneracy checking protocol aimed at circumventing redundant optimizations of geometrically similar orientations. Finally, we present methods that assist in the selection of sampling levels appropriate to desired result quality and available computational resources.