增程式电动汽车动力总成参数匹配设计

增程式电动汽车作为一种新型节能环保型汽车,是传统内燃机汽车向纯电动汽车过渡的一种车型;根据动力传动系统的设计原则和设计目标,基于铃木奥拓燃油汽车改装设计了增程式电动汽车的动力传动系统的参数匹配方法,根据电动汽车基本参数及其控制目标,对动力总成系统的关键零部件进行了匹配设计;匹配结果表明:电动机的额度电压为60 V,最高转速为4 000 r/min,额定功率为8 kW,额定转矩为40.43 N·m,峰值功率为11 kW,最大扭矩为80.86 N·m;增程器采用马勒增程器和两缸直列四冲程发动机;动力电池组采用磷酸铁锂子电池,单组额定容量为80 Ah、总电压为96 V;对于指导增程式电动汽车的开发、提高汽车性能和安全性,以及对于电动汽车底盘集成控制系统的开发都具有重要的工程应用意义。     

Tracking of a third-order maneuvering target under an arbitrary topology

We explore the tracking problem of a maneuvering target. Tracking agents with third-order kinematics can communicate with each other via wireless network. The communication network topology is arbitrary rather than switches among several fixed topologies. The information sharing and interaction among agents are position, velocity, and acceleration. Some sufficient conditions of tracking strategy have been proposed. Finally, a numerical example is employed to demonstrate the effectiveness of proposed tracking strategy.     

A constrained min‐max algorithm for rival models of the same economic system

There are well established rival theories about the economy. These have, in turn, led to the development of rival models purporting to represent the economic system. The models are large systems of discrete-time nonlinear dynamic equations. Observed data of the real system does not, in general, provide sufficient information for statistical methods to invalidate all but one of the rival models. In such a circumstance, there is uncertainty about which model to use in the formulation of policy. Prudent policy design would suggest that a model-based policy should take into account all the rival models. This is achieved as a pooling of the models. The pooling that yields the policy which is robust to model choice is formulated as a constrained min-max problem. The minimization is over the decision variables and the maximization is over the rival models. Only equality constraints are considered.A successive quadratic programming algorithm is discussed for the solution of the min-max problem. The algorithm uses a stepsize strategy based on a differentiable penalty function for the constraints. Two alternative quadratic subproblems can be used. One is a quadratic min-max and the other a quadratic programming problem. The objective function of either subproblem includes a linear term which is dependent on the penalty function. The penalty parameter is determined at every iteration, using a strategy that ensures a descent property as well as the boundedness of the penalty term. The boundedness follows since the strategy is always satisfied for finite values of the parameter which needs to be increased a finite number of times.The global and local convergence of the algorithm is established. The conditions, involving projected Hessian approximations, are discussed under which the algorithm achieves unit stepsizes and subsequently Q-superlinear convergence.     

On existence of undominated pure strategy Nash equilibria in anonymous nonatomic games: a generalization

In this paper, we generalize the exitence result for pure strategy Nash equilibria in anonymous nonatomic games. By working directly on integrals of pure strategies, we also generalize, for the same class of games, the existence result for undominated pure strategy Nash equilibria even though, in general, the set of pure strategy Nash equilibria may fail to be weakly compact. Received August 2001     

企业合作联盟成员位次竞争战略的Shapley值分析

针对Yanowitz和Bruckstein的二值字图像后处理算法存在的问题，提出了一种新的基于灰度期望值的后处理算法。实验结果表明，该算法能自动选取阈值、运算速度快、处理效果好，具有良好的噪声适应性。     

外企与国企培训战略对比

人才培训战略是企业人力资源战略的基础。本通过外资企业与国内企业的培训战略对比，并对国内企业中人才培训存在的不足与缺点进行了分析与探讨。     

Parameter choice by discrepancy principles for ill-posed problems leading to optimal convergence rates

Schock (Ref. 1) considered a general a posteriori parameter choice strategy for the Tikhonov regularization of the ill-posed operator equationTx=y which provides nearly the optimal rate of convergence if the minimal-norm least-squares solution belongs to the range of the operator (T ^* T) ^v , o<v1. Recently, Nair (Ref. 2) improved the result of Schock and also provided the optimal rate ifv=1. In this note, we further improve the result and show in particular that the optimal rate can be achieved for 1/2v1.The final version of this work was written while M. T. Nair was a Visiting Fellow at the Centre for Mathematics and Its Applications, Australian National University, Canberra, Australia. The work of S. George was supported by a Senior Research Fellowship from CSIR, India.     

多层网络级联失效的预防和恢复策略概述

现实生活中,与国计民生密切相关的基础设施网络大多不是独立存在的,而是彼此之间相互联系或依赖的,于是用于研究这些系统的多层网络模型随之产生.多层网络中的节点在失效或者遭受攻击后会因"层内"和"层间"的相互作用而产生级联效应,从而使得失效能够在网络层内和层间反复传播并使得失效规模逐步放大.因此,多层网络比单个网络更加脆弱.多层网络级联失效产生的影响和损失往往是非常巨大的,所以对多层网络级联失效的预防和恢复的研究具有重大意义.就多层网络级联失效的预防而言,主要包含故障检测,保护重要节点,改变网络耦合机制和节点备份等策略.就多层网络发生级联失效后的恢复策略而言,主要包含共同边界节点恢复、空闲连边恢复、加边恢复、重要节点优先恢复、更改拓扑结构、局域攻击修复、自适应边修复等策略.     

Effects of information asymmetry on cooperation in the prisoners＇ dilemma game

Effects of inforination asymmetry on cooperation in the prisoners＇ dilemma game are investigated. The amplitude A is introduced to describe the degree of information asymmetry. It is found that there exists an optimal value of amplitude Aopt at which the fraction of cooperation reaches its maximal value. The reason lies in that cooperators on the two-dimensional grid form large clusters at Aopt. In addition, the theoretical analysis in terms of the mean- field theory is used to understand this kind of phenomenon. It is confirmed that the information asymmetry plays an important role in the dynamics of the dilemma games of spatial prisoners.     

Identification of the zeroth-order coefficient and fractional order in a time-fractional reaction-diffusion-wave equation

In this paper, we investigate an inverse problem of recovering the zeroth-order coefficient and fractional order simultaneously in a time-fractional reaction-diffusion-wave equation by using boundary measurement data from both of uniqueness and numerical method. We prove the uniqueness of the considered inverse problem and the Lipschitz continuity of the forward operator. Then the inverse problem is formulated into a variational problem by the Tikhonov-type regularization. Based on the continuity of the forward operator, we prove that the minimizer of the Tikhonov-type functional exists and converges to the exact solution under an a priori choice of regularization parameter. The steepest descent method combined with Nesterov acceleration is adopted to solve the variational problem. Three numerical examples are presented to support the efficiency and rationality of our proposed method.