Nash Equilibria,Variational Inequalities,and Dynamical Systems

In this paper, we introduce some relationships between Nash equilibria, variational equilibria, and dynamical equilibria for noncooperative games.     

Analysis of Static Simulated Annealing Algorithms

Generalized hill climbing (GHC) algorithms provide a framework for modeling local search algorithms to address intractable discrete optimization problems. This paper introduces a measure for determining the expected number of iterations to visit a predetermined objective function level, given that an inferior objective function level has been reached in a finite number of iterations. A variation of simulated annealing (SA), termed static simulated annealing (S²A), is analyzed using this measure. S²A uses a fixed cooling schedule during the algorithm execution. Though S²A is probably nonconvergent, its finite-time performance can be assessed using the finite-time performance measure defined in this paper.     

结构在地震作用下的损伤评估方法

建筑结构应该能够承受一定地震运动的作用，同时也应该允许其产生一定的损伤。对于结构在地震作用下的损伤评估有多种的方法。本文将分别对从累积损伤方面、变形方面、变形和累积损伤的总和方面、刚度退化方面得到的损伤模型的特点进行评述。     

The Cross-Entropy Method for Continuous Multi-Extremal Optimization

In recent years, the cross-entropy method has been successfully applied to a wide range of discrete optimization tasks. In this paper we consider the cross-entropy method in the context of continuous optimization. We demonstrate the effectiveness of the cross-entropy method for solving difficult continuous multi-extremal optimization problems, including those with non-linear constraints.      

Cyclic cohomology and algebra extensions

We construct a spectral sequence to study cyclic cohomology for an extension A = R/I of algebras. When R is a free algebra we describe the cyclic cohomology of A in terms of traces defined on R or powers of I. Explicit cyclic cocycles representing the cyclic cohomology class belonging to the trace are constructed as analogues of Chern character and Chern-Simons forms.Dedicated to Alexander Grothendieck     

Study of Multistage Project Risk Identification-Assessment Process Based on Objective Orientation

Risk management of projects is about the real time ev aluation and making of decisions proactively in order to maximize the probabilit y of achieving or surpassing the targets set for project objectives. Project objective generally includes three elements: time, cost, quality. Risk occurrin g in the projects will affect these three factors to some various degrees in the end. There are different emphases in each stage and integrated balanced goals b etween the three factors. A large complex engineering ...     

总延误问题顺时安排法的性能比

给定一组工件的加工时间与工期，要求确定这些工件在一台机器上的加．工排列，使相应的总延误达到最小，这就是总延误问题．该问题在近年已被证明是NP困难的．由Wilkermn和Irwin（1971），林勋（1983）等所研究的顺时安排法能得到相邻交换意义下的局部解．在本文中，我们进一步证明该算法能得到前移邻域意义下的局部解，并确定了该算法的性能比．     

现场获取声压－残余声强指数的方法

本文讨论了在现场获取声压－残余声强指数的技术，用实验验证了该技术具有予期的工程精度．     

Generalized indices of operators inB(H)

A generalized dimension is further developed. Here subtraction and addition of two generalized dimensions are defined, so that the operations: ∞ ± n = ∞, ∞ + ∞ = ∞, which used to play an inflexible role, are refined and moreover, ∞ - ∞, which used to be meaningless, is done in sense. Then generalized index for semi-Fred-holm operators is developed to wholeB(H), i.e. all of bounded linear operators in Hilbert spaceH. Theorem 2.2 is proved with an example, which is in contradiction to a known proposition for semi-Fredholm operators in form, practically a refined result of the known proposition. Then, it is proved thatB(H) is the union of countably many disjoint arewise connected sets over all the generalized dimensions ofB(H). Project supported by the National Natural Science Foundation of China     

Corrections of proofs for Hansen and Mélot's two theorems

The Randi? index R(G) of a (chemical) graph G is also called connectivity index. Hansen and Mélot [Variable neighborhood search for extremal graphs 6: analyzing bounds for the connectivity index, J. Chem. Inf. Comput. Sci. 43 (2003) 1-14] in their paper, characterized the chemical trees of given order and number of pendent vertices which have the minimum and maximum Randi? index, respectively. In this note, we point out the mistakes in the proofs of their results Theorems 8 and 10, while we still believe that the two theorems are true, and then we give their corrected proofs.