应用组策略部署和管理软件

随着信息化的普及,如何高效地管理网络内部微机的软件显得比较重要。主要讨论如何应用组策略来部署和管理软件。其中包括如何实现对域中成员的软件自动安装问题、对软件的自动升级问题、对软件的自动删除问题以及如何限制软件的运行等等。     

基于OpenCL的MD5破解算法

在基于GPU的异构平台上,采用开放计算语言(OpenCL)实现破解算法,利用分轮生成攻击密码、图形渲染管线加速存取以及多密码并行等方法对算法进行优化,在Intel四核CPU Q8230(2.3 GHz)和一片NVIDIA GT200组成的平台上进行实验。实验结果表明,在相同CPU平台上该算法能够获得高于破解软件John the ripper 17倍的破解速度。     

基于GPU的位并行多模式串匹配研究

图形处理器(GPU)具有较强的单一运算能力及高度并行的体系结构。根据上述特点,选择基于位并行技术的多模式串匹配算法M-BNDM,将其移植到GPU上加以实现和优化。通过对需要处理的数据进行预处理,将串匹配的过程简化为更适合CUDA计算数据的位操作。对基于CUDA架构的并行串匹配算法的性能影响因子进行分析。实验结果表明,与同等CPU算法相比,该算法能够获得约十几倍的加速比。     

基于Tesla平台的快速反投影运算

反投影运算是锥束CT图像重建算法中运算量最大,最耗时的部分,是制约重建速度的瓶颈。为此,在计算统一设备架构模型下,应用体素驱动法实现基于Tesla平台的反投影(BP)并行运算,并对BP运算上的访存和数学指令进行优化。实际CT数据的重建结果表明,该方法的运算速度是CPU串行程序的198倍,效率高且易于实现。     

一种高逼真度的控制显示组件仿真方法

为增强飞行员对控制显示组件(CDU)的直观感受,提高CDU仿真的逼真度,基于嵌入式PC104 CPU和8255可编程设备接口卡,设计仿真键盘硬件电路和键盘码扫描程序,实现对CDU键盘的高逼真硬件仿真。利用面向对象仿真技术,创建出CDU仿真页面,有效解决了页面系统繁重的生成与管理问题。仿真实验结果表明,该方法能够逼真地实现对飞行计算航路数据和性能参数的输入与显示。     

CAN总线网络层协议栈开发测试

对ISO15765协议进行分析,依据协议在基于MC9S12DP512芯片的整车控制器上完成CAN网络层协议栈的开发,给出开发过程。在VC环境下开发测试程序,对协议栈进行测试。结果表明,实现的CAN网络层协议栈符合ISO15765协议的规定,可满足车辆故障诊断系统等具体应用中系统对CAN网络层通信的需求。     

整车控制器BootLoader的设计与实现

针对传统BDM工具下载或升级应用程序比较麻烦的问题,采用CCP在线更新应用程序,设计一种基于CAN总线的专用BootLoader。介绍BootLoader的设计及CCP在整车控制器端和PC端的实现。实车实验结果证明,BootLoader能够正确引导程序的运行,准确、方便地实现应用程序的下载和升级。     

基于CUDA的3G视频清晰度评估方法

针对传统视频清晰度评估方法实时性较差的问题,利用统一计算架构(CUDA)高度并行性的特点,提出一种基于CUDA的3G视频清晰度评估方法。实验结果表明,与传统的视频清晰度评估方法相比,该方法能在保证准确评估视频清晰度的同时缩短算法的执行时间,计算速度约是传统串行算法的30倍。     

On optimization of finite-difference time-domain (FDTD) computation on heterogeneous and GPU clusters

A model for the computational cost of the finite-difference time-domain (FDTD) method irrespective of implementation details or the application domain is given. The model is used to formalize the problem of optimal distribution of computational load to an arbitrary set of resources across a heterogeneous cluster. We show that the problem can be formulated as a minimax optimization problem and derive analytic lower bounds for the computational cost. The work provides insight into optimal design of FDTD parallel software. Our formulation of the load distribution problem takes simultaneously into account the computational and communication costs. We demonstrate that significant performance gains, as much as 75%, can be achieved by proper load distribution.     

Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic

This paper presents a new algorithm for the dynamic multi-level capacitated lot sizing problem with setup carry-overs (MLCLSP-L). The MLCLSP-L is a big-bucket model that allows the production of any number of products within a period, but it incorporates partial sequencing of the production orders in the sense that the first and the last products produced in a period are determined by the model. We solve a model which is applicable to general bill-of-material structures and which includes minimum lead times of one period and multi-period setup carry-overs. Our algorithm solves a series of mixed-integer linear programs in an iterative so-called fix-and-optimize approach. In each instance of these mixed-integer linear programs a large number of binary setup variables is fixed whereas only a small subset of these variables is optimized, together with the complete set of the inventory and lot size variables. A numerical study shows that the algorithm provides high-quality results and that the computational effort is moderate.