特定温度下的费米体系反演

基于Tikhonov正则化方法的思想,提出了一个费米体系反演的数值方法。给出了一个正则算子的构成方法,克服了凭经验选择正则参数的缺点。证明了收敛性,并给出了误差估计。而且,应用该算法对费米体系反演进行了研究,对计算机给出的实验结果进行了讨论。     

A—紧1—集压缩映象场的广义度理论

定义了A-紧1-集压缩映象场的广义度,扩展了1984年张庆雍建立的半紧1-集压缩映射的不动点指数理论。     

Bent函数序列及其在扩频通信中的应用

Bent 函数序列有良好的相关特性,在扩频通信中有着广阔的应用前景。本文首先介绍了 Bent 函数序列及其在码分多址(CDMA)和跳频多址(FHMA)中的应用,然后推导了Bent 函数序列的产生电路,并举例说明了它们的产生和实现。     

集值广义(S)_+型映射之一致极限的广义度理论及其应用

本文构造了集值(S)+型映射之一致极限的广义度,所得结果统一并加强了文献〔1～4〕的相应结果。运用拓扑度方法获得了一些新的满值性定理与某些新的不动点定理。     

实时仿真计算机系统的若干问题

本文比较了实时仿真计算机系统中配备A/D、D/A变换器的两种方案。分析了几种检索算法,并且提出了一种新的全并行检索方法——映象检索。文中论述了仿真计算任务的特点及其并行性的开发。本文在分析了AD-10的缺点之后指出,纯异构型仿真专用多处理机的局限性较大,不能充分开发仿真计算任务的并行性。较好的结构形式应是以同构型多处理机为核心。     

具有有限深度环缝的导电屏上单极天线的辐射特性

单极天线安装在理想导电平面屏上,屏上刻有有限深度的环形缝。将单极天线上电流及缝和自由空间交界处的等效磁流作为未知函数,建立了一对耦合积分方程。从方程得到电流和磁流的数值解。从这些电流和磁流计算了输入阻抗和辐射方向图。     

最小、最大广义最优停止规则的特征

设(X_n,F_n)_1~∞是适应的报酬序列,(γ_n)是相应的snell 包,(A_n)是(γ_n)的Doob-Meyer 分解中零初值的可料增过程。本文继J.Klass 的研究证明了σ_1=inf{K≥1:X_k≥γ_k}是最小半最优的且是最大严格正则的广义规则,而K_0=sup{n≥0:A_n=0}<∞是最大正则的广义规则,从而得出了广义最优规则唯一性的另一表述。     

地表反射对干扰站影响最小化方法

地表反射引起的波瓣分裂效应对UHF波段雷达干扰站干扰性能会产生严重影响,必须研究改善的方法.首先讨论了多路径传输理论并在此基础上建立了考虑地表反射的干扰方程模型;其次提出了单波瓣覆盖和零点填平两种改善波瓣分裂效应的方法;最后通过仿真实验验证了两种方法的有效性.     

Exponential size neighborhoods for makespan minimization scheduling

We investigate the quality of local search heuristics for the scheduling problem of minimizing the makespan on identical parallel machines. We study exponential size neighborhoods (whose size grows exponentially with the input length) that can be searched in polynomial time, and we derive worst‐case approximation guarantees for the local optima of such neighborhoods. The so‐called split neighborhood splits a feasible schedule into two layers, and then recombines the two layers by finding a perfect matching. We show that the makespan of every local optimum for split is at most a factor of 2 away from the globally optimal makespan. We then combine the split neighborhood with two neighborhoods from the literature. The combination of split with the jump neighborhood only marginally improves the approximation guarantee, whereas the combination with the lexicographic‐jump neighborhood decreases the approximation guarantee from 2 to 3/2. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

On the optimal detection of an underwater intruder in a channel using unmanned underwater vehicles

Given a number of patrollers that are required to detect an intruder in a channel, the channel patrol problem consists of determining the periodic trajectories that the patrollers must trace out so as to maximized the probability of detection of the intruder. We formulate this problem as an optimal control problem. We assume that the patrollers' sensors are imperfect and that their motions are subject to turn‐rate constraints, and that the intruder travels straight down a channel with constant speed. Using discretization of time and space, we approximate the optimal control problem with a large‐scale nonlinear programming problem which we solve to obtain an approximately stationary solution and a corresponding optimized trajectory for each patroller. In numerical tests for one, two, and three underwater patrollers, an underwater intruder, different trajectory constraints, several intruder speeds and other specific parameter choices, we obtain new insight—not easily obtained using simply geometric calculations—into efficient patrol trajectory design under certain conditions for multiple patrollers in a narrow channel where interaction between the patrollers is unavoidable due to their limited turn rate.© 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011