不等式约束优化问题的一个势函数

基于Carroll(1961)建立的罚函数，本文给出了不等式约束优化问题的一个势函数，并且讨论了该函数的性质．最后证明了在此基础上建立的对偶算法具有Q-线性收敛性．     

基于BP神经网络的企业未来获利能力智能综合评价

分析了相关分析——多指标综合评价法在确定企业未来获利能力方面的优点和不足 ;并在其基础上提出了基于 BP神经网络的多指标综合评价法 ;仿真试验证明了基于 BP神经网络的多指标综合评价法的有效性     

人工神经网络在SARS疫情分析与预测中的应用

讨论人工神经网络在 SARS疫情分析与预测中的应用 .采用三层结构的反向传播网络 ( Backpropagation network,简称 BP网络 ) ,对 SARS在中国的传播与流行趋势及控制策略建立了网络模型 .并利用实际数据拟合参数 ,针对北京、山西的疫情进行了计算仿真 .结果表明 ,该网络模型算法收敛速度较快 ,预测精度很高     

纯量反馈系统同时强镇定的充分条件

一个稳定的补偿器可同时镇定n个对象(同时强镇定)等价于一个补偿器(不一定稳定)同时镇定n 1个对象(同时镇定)．两个以上对象的同时强镇定和三个以上对象的伺时镇定是线性系统中一个急待解决的公开问题．文中所作的基本假定是所有的对象具有相同的简单不稳定零点，在此条件下给出了n个对象同时强镇定的一个充分条件．当仅有一个不稳定零点时．容易检验是否同时强镇定，否则仅需确定n个对象的不稳定零点并且判定由不稳定零点导出一个相应矩阵是正定的，就能判定n个对象同时强镇定．因此是一个易于检验的充分条件．文章同时给出了n个对象同时强镇定的算法，丰富了同时强镇定的充分条件．     

Semideterministic Global Optimization Method: Application to a Control Problem of the Burgers Equation

This paper has two objectives. We introduce a new global optimization algorithm reformulating optimization problems in terms of boundary-value problems. Then, we apply this algorithm to a pointwise control problem of the viscous Burgers equation, where the control weight coefficient is progressively decreased. The results are compared with those obtained with a genetic algorithm and an LM-BFGS algorithm in order to check the efficiency of our method and the necessity of using global optimization techniques.     

Simplified analytic solutions and a novel fast algorithm for Yb-doped double-clad fiber lasers

In this paper, continuous wave Yb³⁺-doped double-clad fiber lasers (DCFLs) with linear-cavity are investigated theoretically and numerically using the rate equations. Under the steady state conditions, the simplified analytic solutions of Yb³⁺-doped DCFLs under considering the scattering loss are deduced in the strongly pump condition. Compared with the known analytic solutions in published literatures, our analytic solutions are more accurate, especially, at higher reflectivity of output mirror. In addition, a fast and stable algorithm based on the Newton-Raphson method is proposed to simulate numerically Yb³⁺-doped DCFLs. The results by simplified analytic solutions are in good agreement with those by the numerical simulation. Moreover, we have performed the optimization of an Yb³⁺-doped DCFL using the simplified analytic solutions and the numerical simulations, respectively.     

On solving energy-dependent partitioned eigenvalue problem by genetic algorithm: The case of real symmetric Hamiltonian matrices

An energy-dependent partitioning scheme is explored for extracting a small number of eigenvalues of a real symmetric matrix with the help of genetic algorithm. The proposed method is tested with matrices of different sizes (30 × 30 to 1000 × 1000). Comparison is made with Löwdin’s strategy for solving the problem. The relative advantages and disadvantages of the GA-based method are analyzed     

Pushing Squares Around

We study dynamic self-reconfiguration of modular metamorphic systems. We guarantee the feasibility of motion planning in a rectangular model consisting of square modules that are allowed to slide along or rotate about one another. That is, we show that any two connected configurations of the same number of modules can be transformed into each other by a sequence of moves so that all intermediate configurations are connected. This settles a conjecture formulated in [6].     

Parking Capacity and Pricing in Park'n Ride Trips: A Continuous Equilibrium Network Design Problem

In this paper we consider the problem of designing parking facilities for park'n ride trips. We present a new continuous equilibrium network design problem to decide the capacity and fare of these parking lots at a tactical level. We assume that the parking facilities have already been located and other topological decisions have already been taken.The modeling approach proposed is mathematical programming with equilibrium constraints. In the outer optimization problem, a central Authority evaluates the performance of the transport network for each network design decision. In the inner problem a multimodal traffic assignment with combined modes, formulated as a variational inequality problem, generates the share demand for modes of transportation, and for parking facilities as a function of the design variables of the parking lots. The objective is to make optimal parking investment and pricing decisions in order to minimize the total travel cost in a subnetwork of the multimodal transportation system.We present a new development in model formulation based on the use of generalized parking link cost as a design variable.The bilevel model is solved by a simulated annealing algorithm applied to the continuous and non-negative design decision variables. Numerical tests are reported in order to illustrate the use of the model, and the ability of the approach to solve applications of moderate size.