干扰效果在线评估参数筛选与特征表示方法

针对利用雷达侦察信号进行干扰效果在线评估时参数冗余、信号变化程度判别不清的问题,提出雷达干扰效果在线评估参数筛选与特征表示方法。对多功能海上雷达信号,利用信息熵筛选剧烈变化参数,通过盒维数和皮尔逊相关系数提取信号变化特征,结合支持向量机实现对未知威胁的干扰效果在线评估。仿真实验表明,当信号参数偏离误差小于10%时,新方法的评估准确率高于92%,显著提高了雷达干扰效果在线评估的可靠性。     

自动导引车系统的有色时延PN-有向图建模

基于有色时延Petri网理论、有向图理论、PN的合成和简化技术,结合烟草行业的卷接包车间为典型实例对自动导引车系统(AGVS)进行分析,构造了AGVS的有色时延Petri网-有向图模型,包括适合于仿真软件开发的AGVS有色时延Petri网模型,适合于路径优化研究的AGVS有向图模型和从有向图模型得到有色时延Petri网模型的转换算法。利用该模型成功的开发了AGVS仿真软件系统AGVSim。     

STL模型的立体显示及其多屏拼接

介绍了基于微机的多通道STL模型交互式立体显示系统。首先由程序提取STL文件三角形面片以及向量坐标信息,进行数据冗余处理和顶点向量的光滑处理,并通过OpenGL生成可视化的STL三维实体模型。利用偏振光叠加的方法实现立体显示功能,提出了以网络同步功能为基础的多通道多屏拼接方案,开发了基于SpaceBall的交互功能,实现对STL模型的位置及姿态进行控制。作为低成本的虚拟现实系统,该系统方案可应用于多种领域。     

集成范例推理系统的研究

首先研究了与范例推理相集成的多种技术,并着重研究了基于范例推理和规则推理的集成方法,以及基于范例推理和归纳技术的集成方法,以此来充分利用范例推理、规则推理和归纳学习技术的各自优势,提高智能系统求解问题的能力。     

Robust stability test for 2-D continuous-discrete systems with interval parameters

It is revealed that the dynamic stability of 2-D recursive continuous-discrete systems with interval parameters involves the problem of robust Hurwitz-Schur stability of bivariate polynomials family. It is proved that the Hurwitz-Schur stability of the denominator polynomials of the systems is necessary and sufficient for the asymptotic stability of the 2-D hybrid systems. The 2-D hybrid transformation, i. e. 2-D Laplace-Z transformation, has been proposed to solve the stability analysis of the 2-D continuous-discrete systems, to get the 2-D hybrid transfer functions of the systems. The edge test for the Hurwitz-Schur stability of interval bivariate polynomials is introduced. The Hurwitz-Schur stability of the interval family of 2-D polynomials can be guaranteed by the stability of its finite edge polynomials of the family. An algorithm about the stability test of edge polynomials is given.     

Atomic and efficient e-cash transaction protocol

Atomicity is necessary for reliable and secure electronic commerce transaction and to guarantee the participants' interests. An atomic and efficient e-cash (electronic cash) transaction protocol based on the classical e-cash scheme is presented. The delivery of digital goods is incorporated into the process of payment in the protocol. Apart from ensuring all three levels of atomicity, the novel protocol features high efficiency and practicability with unfavorable strong assumption removed. Furthermore, the proposed protocol provides non-repudiation proofs for any future disputes. At last, analysis of the atomicity and efficiency is illustrated.     

GROUP SIZE AND PARALLELISM EFFECTS IN TASKS WITHHETEROGENEOUS LEVELS OF DIFFICULTY：A STOCHASTIC ORDER APPROACH

We consider tasks where in order to perform them it is sufficient that one member of a group will know how to do it. We are interested in the effect of task difficulty, and variability of that difficulty, on group performance, and in particular on the marginal contribution of an additional number to the performance of groups of different size. We explore the implications of various stochastic orders over task difficulty and variability. Some intuitive conjectures are shown to be false.     

GROUP-BUYING ONLINE AUCTION AND OPTIMAL INVENTORY POLICY IN UNCERTAIN MARKET

In this paper we consider a group-buying online auction (GBA) model for a monopolistic manufacturer selling novel products in the uncertain market. Firstly, we introduce the bidder's dominant strategy, after which we optimize the GBA price curve and the production volume together. Finally, we compare the GBA with the traditional posted pricing mechanism and find that the GBA is highly probable to be advantageous over the posted pricing mechanism in some appropriate market environments.     

AUTOMATIC DECISION-MAKING： NEURAL FIRING AND RESPONSE

1. Introduction This is the fourth exposition on theAnalytic Hierarchy Process. It is true thatmany decisions we make subconsciously ariseout of our physical and biological needs andderive from the pressure to survive physically.We also make subconsciou…     

THE PERIODIC CAPACITATED ARC ROUTING PROBLEM LINEAR PROGRAMMING MODEL, METAHEURISTIC AND LOWER BOUNDS

1. Introduction The Capacitated Arc Routing Problem(CARP) is defined on an undirected network inwhich a fleet of identical vehicles with limitedcapacity is based at a depot node. Each edge hasa non-negative traversal cost and can betraversed any number…