由DSP技术实现卡尔曼滤波算法初探

分析了现有机动目标数学模型及其卡尔曼滤波算法,并用数字信号处理器（ＤＳＰ）对１个实际算法进行了实验。实验结果表明,目标机动性能的提高将使坦克火控系统由于采用现行目标运动模型而产生较大的误差。因此,在火控系统中采用其他模型,如自适应模型等,势在必行。同时,对于跟踪精度高,实时计算量大的卡尔曼滤波算法,应用ＤＳＰ技术实现具有良好的发展前景     

旋转椭球体的瞬态电磁目标特性研究

本文针对旋转体金属目标,提出了改进的时域递推法,以计算其电磁脉冲响应特性,它将面上的二线问题降为一线问题,减少了计算量,以便于计算大尺寸目标。同时,用该方法计算了不同脉冲宽度激励下球的反射波形和不同长度棉球的反射波形,并讨论了它们的特性。     

舰艇主汽轮机盘车机构自动控制装置研制

采用单片计算机控制技术、数字电路技术、传感器技术,实现盘车机构自动控制;应用CMOS低功耗器件、大规模集成电路和硬软件相结合提高可靠性;有效地解决了弱电信号在舰艇机舱中的远距离传输抗干扰问题。     

基于多尺度稀疏字典的SAR图像目标识别方法

针对合成孔径雷达目标识别问题,提出一种基于多尺度稀疏字典的SAR图像目标识别方法。稀疏字典选择是稀疏表示中的关键问题之一,该方法利用小波多尺度分析构造过完备稀疏字典,将训练样本图像在小波解析域中进行小波多层分解,充分利用小波多尺度分析突出图像局部特征的特点,并和过完备稀疏表示有效结合组成级联字典。通过求解测试样本相应的稀疏系数矢量并根据系数矢量中对应训练样本类别的重构误差判定目标类型。实验结果表明,该方法在识别前无需对SAR图像进行预处理,具有良好的识别效果。     

Modified fictitious play

We describe a modification of Brown's fictitious play method for solving matrix (zero-sum two-person) games and apply it to both symmetric and general games. If the original game is not symmetric, the basic idea is to transform the given matrix game into an equivalent symmetric game (a game with a skew-symmetric matrix) and use the solution properties of symmetric games (the game value is zero and both players have the same optimal strategies). The fictitious play method is then applied to the enlarged skew-symmetric matrix with a modification that calls for the periodic restarting of the process. At restart, both players' strategies are made equal based on the following considerations: Select the maximizing or minimizing player's strategy that has a game value closest to zero. We show for both symmetric and general games, and for problems of varying sizes, that the modified fictitious play (MFP) procedure approximates the value of the game and optimal strategies in a greatly reduced number of iterations and in less computational time when compared to Brown's regular fictitious play (RFP) method. For example, for a randomly generated 50% dense skew-symmetric 100 × 100 matrix (symmetric game), with coefficients |a_ij| ≤ 100, it took RFP 2,652,227 iterations to reach a gap of 0.03118 between the lower and upper bounds for the game value in 70.71 s, whereas it took MFP 50,000 iterations to reach a gap of 0.03116 in 1.70 s. Improved results were also obtained for general games in which the MFP solves a much larger equivalent symmetric game. © 1996 John Wiley & Sons, Inc.     

聚乙烯/淀粉光-生物降解薄膜的降解性能及其对作物的影响

报道了聚乙烯/淀粉光-生物降解薄膜的光降解和生物降解性能及其对农作物的影响.结果显示,薄膜具有明显的降解作用,覆盖降解薄膜后,农作物的产量增加.     

民国时期东北海军的兴衰

东北海军是20是20年代在吉黑江防舰队基础上发展起来的一支地方性海军,全盛时期下辖3个舰队,26艘舰艇,总排水量近2万吨,兵力3万余人.这支舰队见证和经历了中国现代史上一系列重大事件:第二次直奉战争、北伐战争、中东路事件、九一八事变、全国抗日战争.她从诞生、发展到没落、消失的过程,折射了20世纪二三十年代中国历史发展的多样性与曲折性.     

How to deal with consumers who group to request a discount?

We investigate operations impacts of consumer‐initiated group buying (CGB), whereby consumers voluntarily form buying groups to negotiate bulk deals with retailers. This differs from regular purchasing whereby consumers visit retailers individually and pay posted prices. Upon the visit by group consumers, a retailer decides to forgo or satisfy their demand in its entirety. Turned down by a retailer, group consumers continue to visit other retailers. In the case where their group effort fails to conclude a deal, some group consumers switch to individual purchasing provided they receive a non‐negative utility by doing so. Even after a successful group event, the group consumers who forgo the event out of utility concern may switch to individual purchasing as well. Retailer competition, group size, and the chance that group consumers switch to individual purchasing upon unsatisfaction are crucial to how retailers adjust operations to deal with CGB. With retailer competition, the rise of CGB results in every consumer paying the same reduced price when group size is small but makes group consumers pay more than by purchasing individually when group size is large. This has mixed consequences on the profits for retailers in both absolute and relative terms.     

Two-agent scheduling with linear resource-dependent processing times

This paper considers a two-agent scheduling problem with linear resource-dependent processing times, in which each agent has a set of jobs that compete with that of the other agent for the use of a common processing machine, and each agent aims to minimize the weighted number of its tardy jobs. To meet the due date requirements of the jobs of the two agents, additional amounts of a common resource, which may be in discrete or continuous quantities, can be allocated to the processing of the jobs to compress their processing durations. The actual processing time of a job is a linear function of the amount of the resource allocated to it. The objective is to determine the optimal job sequence and resource allocation strategy so as to minimize the weighted number of tardy jobs of one agent, while keeping the weighted number of tardy jobs of the other agent, and the total resource consumption cost within their respective predetermined limits. It is shown that the problem is -hard in the ordinary sense, and there does not exist a polynomial-time approximation algorithm with performance ratio unless ; however it admits a relaxed fully polynomial time approximation scheme. A proximal bundle algorithm based on Lagrangian relaxation is also presented to solve the problem approximately. To speed up convergence and produce sharp bounds, enhancement strategies including the design of a Tabu search algorithm and integration of a Lagrangian recovery heuristic into the algorithm are devised. Extensive numerical studies are conducted to assess the effectiveness and efficiency of the proposed algorithms.     

泛函在射表逼近中的应用

运用泛函理论,对方差最小原则下射表逼近进行分析,给出了在给定基函数形式条件下的统一计算公式,并对最小二乘方法作了改进,消除系数矩阵的原理误差,给出了提高精度的方法。最后,提出了一个选择基函数的有效方法。