基于任务驱动的外训图像处理课程教学实践

从军校外训教学特点出发,结合课程设计,介绍了任务驱动教学法在外训Photoshop课程中的具体运用。在任务驱动教学法的理论依据、案例的设计、案例教学的实施等方面作了研究,在如何将理论与实践相结合进行设计上,进行了尝试并取得较好效果。     

基于虚拟化的云计算平台的内存管理研究

虚拟化技术使云计算能够统一管理计算资源、提高资源利用率。主要研究虚拟机的内存虚拟化方式以及虚拟机内存调整技术。虚拟机内存资源在灵活的调制机制下可弹性变化,为提高云计算的扩展性提供重要的技术支持,提高系统整体性能。     

基于微课的翻转课堂教学实践

本文以C语言程序设计课程中的递归程序教学为例,论述了基于微课开展翻转课堂教学的教学设计及实施方法。     

面向协作的组织结构设计的集成模拟研究

基于计算组织理论,采用了多Agent模拟和离散事件模拟的集成方法,以组织成员间的协作关系为出发点,分析了不同的协作模式对组织效率的影响,讨论了在这些协作模式下沟通机制和激励机制的作用,得到了一些对组织结构设计有意义的结论。     

二氰基取代的四硫富瓦烯硫杂冠醚衍生物的合成及性质研究

在甲苯溶液中,在亚磷酸三乙酯存在下,采取高度稀释的方法,使4,5-二氰基-1,3-二硫杂环戊二烯-2-酮分别和多缩硫杂冠醚进行交叉偶联反应,成功地得到了不对称的2,3-二氰基四硫富瓦烯衍生物。用1HNMR、MSI、R和EA表征了其结构,并用循环伏安法研究了它们的电化学性质,用1HNMR初步评价了衍生物对钠离子的配合性能。     

一种CMOS1／2Mbps3．3V1553B收发器的设计与实现

1553B总线是一种广泛用于航天、航空以及军事领域内的通用数字总线。但随着应用系统的技术发展,原有1Mb—ps传输速率的收发器已经不能满足使用需求,因此文中提出一种2Mbps的收发器系统结构,并兼容1Mbps的传输速率。该收发器采用0．35μmsingle—polyCMOS工艺实现,流片测试结果表明,在1Mbps速率下,该收发器完全满足1553B总线协议要求。在2Mbps速率下,收发器的传输误码率小于10^-12在3．3V工作电压下,收发器静态功耗为17mA。     

嵌入式火控软件时间性能测试

嵌入式实时操作系统是能在确定的时间内执行计算或处理功能并能对外部事件做出响应的系统,由此可见时间逻辑会影响软件系统的正确性,时间指标一般指任务切换、完成时间和中断响应时间。根据这些特点,文中简要介绍了静态分析方法,着重介绍了一种利用8253可编程间隔定时器进行插装的实时动态检测时间指标的方法。此方法在嵌入式火控系统软件时间性能指标的测试中得到了充分利用,取得很好的应用效果,同时也介绍了此方法的局限性,便于在其他测试项目中更充分的运用。     

Construction of a key-dependent message secure symmetric encryption scheme in the ideal cipher model

Key-dependent message （KDM） security is an important security issue that has attracted much research in recent years. In this paper, we present a new construction of the symmetric encryption scheme in the the ideal cipher model （ICM）; we prove that our scheme is KDM secure against active attacks with respect to arbitrary polynomialtime challenge functions. Our main idea is to introduce a universal hash function （UHF） h as a random value for each encrypfion, and then use s = h（sk） as the key of the ideal cipher F, where sk is the private key of our symmetric encryption scheme. Although many other schemes that are secure against KDM attacks have already been proposed, in both the ideal standard models, the much more significance of our paper is the simplicity in which we implement KDM security against active attacks.     

Optimal binary codes and binary construction of quantum codes

This paper discusses optimal binary codes and pure binary quantum codes created using Steane construction. First, a local search algorithm for a special subclass of quasi-cyclic codes is proposed, then five binary quasi-cyclic codes are built. Second, three classical construction methods are generalized for new codes from old such that they are suitable for constructing binary self-orthogonal codes, and 62 binary codes and six subcode chains of obtained self-orthogonal codes are designed. Third, six pure binary quantum codes are constructed from the code pairs obtained through Steane construction. There are 66 good binary codes that include 12 optimal linear codes, 45 known optimal linear codes, and nine known optimal self-orthogonal codes. The six pure binary quantum codes all achieve the performance of their additive counterparts constructed by quaternary construction and thus are known optimal codes.     

A new parallel lattice reduction algorithm for BKZ reduced bases

In order to implement the original BKZ algorithm in parallel,we describe it in terms of parallelism and give its parallel implementation scheme.Then we analyze the efficiency of algorithm’s parallel implementation and show that the speedup factor of BKZ algorithm in parallel is extremely low.Therefore we present a new parallel lattice reduction algorithm suitable for multiprocessor computer architecture.The new algorithm can obtain a BKZ reduced basis and the parallel speedup is effective.Also with the practical results,although the computational complexity increases compared with the original BKZ algorithm,we still indicate that the new algorithm performs well in parallel and the time cost in parallel is less.At the same time,we show that the length of the shortest vector is smaller.