ART1: Similarity Measures

This paper concerns with the ART1 (Adaptive Resonance Theory 1) in Neural Network. Important features of ART1 are similarity measure (criterion), vigilance parameter (), and their function to classify the input patterns. Experimental results show that the similarity measure as designed originally does not increase the number of categories with the increased value of but decreases, too. This is against the claim of stability-plasticity dilemma. A number of researchers have considered this and suggested alternative similarity measures. Here, we propose a new similarity criterion which eliminates this problem and also possesses the property of lowest list presentations needed for self stabilization of the network. We compare the results of different similarity criteria experimentally and present them in graphs. Analysis of the network under noisy environment is also carried out.     

嵌入式软件跟踪调试技术的研究与设计

针对在嵌入式实时操作系统环境下高低优先级任务切换过程引起的跟踪信息乱序和丢失问题,对跟踪信息嵌套缓存机制和解析机制进行了设计,提出了物理缓存管理机制与递归调用解析机制相结合、备份缓存管理机制与普通查询解析机制相结合的两种跟踪方案,解决了跟踪信息乱序和丢失问题,提高了跟踪系统的运行效率。     

Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime

In 1976, Coffman and Sethi conjectured that a natural extension of LPT list scheduling to the bicriteria scheduling problem of minimizing makespan over flowtime-optimal schedules, called the LD algorithm, has a simple worst-case performance bound: \(\frac{5m-2}{4m-1}\), where m is the number of machines. We study the structure of potential minimal counterexamples to this conjecture, provide some new tools and techniques for the analysis of such algorithms, and prove that to verify the conjecture, it suffices to analyze the following case: for every \(m \ge 4\), \(n \in \{4m, 5m\}\), where n is the number of jobs.     

基于符号模拟和约束逻辑编程的RTL级Verilog谓词抽象方法

利用人工智能最新研究成果--约束逻辑编程对Verilog描述进行谓词抽象,并与目前基于SAT的方法进行了比较.首先通过符号模拟建立Verilog的形式化模型,然后结合要抽象的谓词,将谓词抽象问题转化为约束逻辑编程问题并进行求解.该方法的优点是在计算抽象系统时,不需要像基于SAT的方法那样将字级约束打散成位级约束,求解效率显著提高;提供了一个统一的框架用于描述各种约束.实验结果表明,与基于SAT的抽象技术相比,基于约束逻辑编程的抽象方法的求解速度有显著提高.     

层次结构文档下支持权限管理的实时协同技术研究

针对传统实时协同系统中各站点之间无约束操作的缺点,提出采用权限分工的方式来支持不同团队之间的文档管理。给出了支持权限管理的层次结构文档的形式化定义,描述了用户角色设置过程,定义了权限及权限操作格式,讨论了站点ID的设置及初始化过程,并提出采用改进的地址空间转换算法来保证权限操作在各分布式站点的正确执行。分析了改进算法的效率提升,并通过其在Co-AutoCAD中的应用证实了策略的有效性。     

民机驾驶舱布局流程设计及应用

为减少民机驾驶舱设计迭代次数,提高设计质量和效率,提出了一种民机驾驶舱布局的设计流程。结合适航要求和人机工效分析方法,对飞行员眼位、人体尺寸、内部视界和外部视界、飞行员坐姿、座椅和脚蹬调节行程、中控台尺寸及其它关键部件位置进行了分析和研究。最后,应用提出的民机驾驶舱布局流程进行了公务机驾驶舱布局设计。结果表明,设计的民机驾驶舱布局流程能够快速实现预期设计目标,提高了设计效率,对民机驾驶舱设计具有指导意义。     

基于发布/订阅模型的中间件实时拓展

基于发布/订阅模型的卫星数据模型中间件不具备实时性。为此,给出一种对其进行实时拓展的服务软件总体框架。提出将任务的中间件优先级映射到本地节点优先级的线性均匀分布动态映射算法。引入超周期思想,在静态优先级可抢占调度算法下,对优先级任意的硬实时周期和非周期混合任务进行可调度性分析。采用恢复块技术对其进行冗余备份以解决服务软件单点故障。分析结果表明,该框架基本可以满足实时系统的要求。     

RTL验证框架--HRV

设计并实现了一个RTL覆盖率驱动的验证框架HRV,它集成了自主开发的基于程序切片技术的设计抽取器、基于VCD文件的代码覆盖率分析器以及基于路径和基于断言的模拟矢量自动生成方法．实验结果表明,HRV通过集成多种验证工具,提高了模拟验证效率,加速了错误检测和错误定位．     

一种基于线性反馈移位寄存器的轻量级强PUF 设计

物理不可克隆函数(PUF),是一种新型硬件安全原语,可以用FPGA 和ASIC 实现, 避免芯片被过度制造和非法克隆。PUF 可以用于安全密钥生成和芯片认证,强PUF 是其中一种 重要的分类,强PUF 具有极大的CRP 空间,适用于设备实体的安全认证。经典的以仲裁器PUF 为代表的强PUF 设计面积开销大,唯一性不够理想,难以在一些资源集约的场景,如嵌入式系 统和物联网(IoT)设备中应用。为了减小硬件开销,提出了一种新型轻量级强PUF 设计,该设计 利用线性反馈移位寄存器对弱PUF 的输出响应进行混淆以获得大量的输出响应,结构简单,易 于实现。在28 nm 的FPGA 上实现并评估了该PUF 设计。实验结果表明,该PUF 的随机性为 49.8%,唯一性为50.25%,硬件开销很小。     

A hybrid algorithm for constrained portfolio selection problems

Since Markowitz’s seminal work on the mean-variance model in modern portfolio theory, many studies have been conducted on computational techniques and recently meta-heuristics for portfolio selection problems. In this work, we propose and investigate a new hybrid algorithm integrating the population based incremental learning and differential evolution algorithms for the portfolio selection problem. We consider the extended mean-variance model with practical trading constraints including the cardinality, floor and ceiling constraints. The proposed hybrid algorithm adopts a partially guided mutation and an elitist strategy to promote the quality of solution. The performance of the proposed hybrid algorithm has been evaluated on the extended benchmark datasets in the OR Library. The computational results demonstrate that the proposed hybrid algorithm is not only effective but also efficient in solving the mean-variance model with real world constraints.