量测误差的时间序列分析方法

针对工程实践中实际量测误差大多并非纯白噪声特点,运用概率统计学的一个分支——时间序列分析中提供的动态数据处理的方法,采用多种的参数估计算法来对量测误差进行拟合和仿真,给出了实验室仿真过程中需叠加的量测误差的新生成办法。所用方法可以推广到对其它数据序列的处理。     

一种计算任意形状封闭区域面积的新方法

在图像模式识别中 ,面积是很重要的特征。提出一种计算面积的新方法 ,利用Freeman链码矢量分析 ,对边界像素标注综合处理 ,再进行边界像素坐标加权求和计算 ,求得目标面积 ;该方法与原有计算面积的方法相比 ,该方法实现简单 ,计算量小 ,结果准确     

Inventory cost impact of order processing priorities based on demand uncertainty

We evaluate an approach to decrease inventory costs at retail inventory locations that share a production facility. The retail locations sell the same product but differ in the variance of retail demand. Inventory policies at retail locations generate replenishment orders for the production facility. The production facility carries no finished goods inventory. Thus, production lead time for an order is the sojourn time in a single server queueing system. This lead time affects inventory costs at retail locations. We examine the impact of moving from a First Come First Served (FCFS) production rule for orders arriving at the production facility to a rule in which we provide non‐preemptive priority (PR) to orders from retail locations with higher demand uncertainty. We provide three approximations for the ratio of inventory costs under PR and FCFS and use them to identify conditions under which PR decreases retail inventory costs over FCFS. We then use a Direct Approach to establish conditions when PR decreases retail inventory costs over FCFS. We extend the results to orders from locations that differ in the mean and variance of demand uncertainty. The analysis suggests that tailoring lead times to product demand characteristics may decrease system inventory costs. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 376–390, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10016     

银河仿真工作站实时通信技术的研究与实现

对银河仿真工作站与共享内存实时网络的实时通信技术进行了研究 ,介绍了银河仿真工作站与实时网通信的应用程序接口API,并且描述了一个在YHSIM仿真程序中实现与实时网通信的例子 ,最后给出了实验结果。实验证明 ,该技术能有效地用于大规模复杂系统的半实物仿真     

超高分辨率图像实时显示系统设计

自行设计的超高分辨率图像实时显示系统由图形系统处理机、超高分辨率显示器组成 ,其核心是图形系统处理机 ,显示分辨率为 2 0 4 8× 2 0 4 8,逐行扫描 ,每像素 8位 ,图像输入速率最高 2 4 0MB/s ,可同时显示n (n =8,4 ,2 ,1)个CCD相机的实时图像数据 ,并能进行n抽m (n =8,4 ,2 ,1;m =8,4 ,2 ,1;n≥m)处理。采用的主要技术有 :图像输入双重缓冲抽样复合拼接技术 ,单帧存图形图像共体技术 ,视频双重并串转换技术等。该系统可用于卫星地面站、航测、医学成像及其他传感器的高分辨率图像的实时显示     

基于TDOA的双基无源定位方案

多站时差定位是一种较精确的定位方法,通过处理3个或3个以上测量站采集的信号到达时间来对辐射源定位.论述了多站时差无源定位的基本原理,提出了一种基于陆空平台相结合的TDOA(Time Difference Of Arrival)双基无源定位方案.主要论述了时差双基无源定位的基本原理,以及观测站与空中目标的同步、地面观测站的选择、误差校正等主要问题的实现方案,并给出了参与对目标视察定位的地面观测站的选择算法.此方案定位算法及定位精度仍在研究阶段.     

抗通信时延的分布式固定时间收敛协同制导律

为使得多枚导弹在存在通信时延的情况下有效完成对机动目标的同时攻击,提出了一种抗通信时延的固定时间收敛分布式协同制导律。该制导律基于固定时间控制技术框架,实现了稳定时间边界不依赖于多导弹系统初始状态,提升了多导弹系统控制效率;采用一种快速非奇异终端滑模和虚拟领弹共同主导的方法,可实现制导律具有对抗通信时延的鲁棒性;利用了李雅普诺夫稳定性理论证明了固定时间内的一致性。仿真结果表明,存在通信时延的情况下,基于所设计的分布式协同制导律,多枚导弹能够有效地完成对目标的同时攻击。     

发射波束域MIMO-STAP雷达发射接收联合设计方法

研究了信号相关杂波背景下机载多输入多输出(multiple-input multiple-output,MIMO)雷达发射波束形成和接收滤波器的联合设计问题,建立了机载MIMO雷达发射波束域空时自适应处理(space-time adaptive processing, STAP)信号模型。为了提升杂波环境下目标的检测性能,通过最大化输出信干噪比构建了发射波束形成和接收滤波器的联合设计问题;然后,设计了一种新的基于优化最小化(majorization-minimization,MM)框架的迭代优化算法来解决联合设计问题。该算法通过合理寻找目标函数的下界可以有效提升算法的收敛速度并降低算法的运行时间。此外,与传统的相控阵雷达和MIMO雷达相比,优化后的发射波束形成和接收滤波器可以显著提升输出信干噪比,仿真实验验证了所提方法的有效性。     

辅助任务增强的中文跨域NL2SQL算法

自然语言到结构化查询语言(natural language to structured query language,NL2SQL)任务旨在将自然语言询问转化为数据库可执行的结构化查询语言(structured query language,SQL) 语句。本文提出了一种辅助任务增强的中文跨域 NL2SQL 算法,其核心思想是通过在解码阶段添加辅助任务以结合原始模型来进行多任务训练,提升模型的准确率。辅助任务的设计是通过将数据库模式建模成图,预测自然语言询问与数据库模式图中的节点的依赖关系,显式地建模自然语言询问和数据库模式之间的依赖关系。针对特定的自然语言询问,通过辅助任务的提升,模型能够更好地识别数据库模式中哪些表/列对预测目标 SQL 更有效。在中文 NL2SQL 数据集 DuSQL 上的实验结果表明,添加辅助任务后的算法相对于原始模型取得了更好的效果,能够更好地处理跨域 NL2SQL 任务。     

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.