新型伺服控制系统的建模仿真与分析

分析了伺服控制系统的工作原理,提出一种新型伺服控制系统建模方法。在Matlab/Simulink环境下采用模块化的方法构建了系统的仿真模型,系统采用双闭环控制,并对该模型进行了仿真。仿真结果表明,该系统具有良好的动态和静态特性,验证了该方法的有效性,为实际伺服控制系统的设计和调速提供了新的方法。     

基于PXI总线的高精度惯导姿态数据采集卡设计

为了满足惯导故障监测诊断系统实时高精度地采集惯导姿态数据的需要,研制了基于PXI总线的高精度惯导姿态数据采集卡。该数据采集卡能多块卡同步对惯导航向、纵摇和横摇数据进行采集。每块卡对正余弦多极旋转变压器粗精通道信号进行同步A/D转换后,利用软件对A/D转换后的数字量进行粗精组合,得到高精度的角度量供后续分析处理。介绍了采集卡PXI总线接口的硬件设计及双通道多极旋转变压器粗精组合模糊位软件消除方法。     

MEMS传感器在汽车性能测试中的应用

针对目前用于检测汽车制动性能与机动车方向盘转向力-转向角的仪器存在体积庞大、安装复杂、连线繁多、操作技术要求高等特点,提出了采用MEMS型加速度传感器和陀螺传感器为核心检测元件制成的汽车制动性能测试仪器。该测试仪具有便携化、智能化等优点,针对性地解决了以上困扰,为MEMS传感器的应用扩展了新领域。     

基于VxWorks的RapidIO-IP设计与实现

在研究RapidIO互连标准和TCP/IP协议的基础上,设计RapidIO-IP架构,分析VxWorks操作系统中END的工作原理和SBC8641D平台上RapidIO总线的工作机制,对基于RapidIO的END驱动需要实现的几个关键技术进行攻克,成功实现了RapidIO-IP,为RapidIO协议在嵌入式系统中的应用奠定了基础。     

网格计算中费用约束的最优时间调度算法

在网格资源处理速度和资源价格异构的网格环境下,讨论基于用户费用约束的最优时间调度问题,提出一种相应的调度算法,将该任务调度问题转化为线性规划问题,采用单纯形算法获得近似最优解,从而获得费用约束下资源的最优执行时间以及该任务的最小完成时间。仿真结果表明,该算法的性能优于其他同类算法。     

基于分子信标和S1核酸酶检测锌离子的研究

S1核酸酶是能够特异性切割核酸单链的核酸酶,对锌离子有很强的依赖性,基于这一特性,发展了一种基于分子信标和S1核酸酶的锌离子检测新方法.结果表明该方法操作简单,不需要昂贵仪器,不涉及复杂的离子载体合成,对锌离子的检测下限为120μmol/L.     

动态网站自动生成器关键技术研究

该文对动态网站自动生成器进行了研究与分析。通过对动态网站的系统体系结构进行研究,针对三层软件架构下的动态网站设计出相应的代码生成器,并对其中系统实现的关键技术进行分析。     

基于Struts的图书管理系统

该文介绍了基于struts框架的图书管理系统的设计与实现,从图书的入库到图书查询浏览、借阅和归还,管理员对用户的权限管理,形成一个整体的图书管理和用户管理模式。     

Optimal Sorting Algorithms for a Simplified 2D Array with Reconfigurable Pipelined Bus System

In recent years, many researchers have investigated optical interconnections as parallel computing. Optical interconnections are attractive due to their high bandwidth and concurrent access to the bus in a pipelined fashion. The Linear Array with Reconfigurable Pipelined Bus System (LARPBS) model is a powerful optical bus system that combines both the advantages of optical buses and reconfiguration. To increase the scalability of the LARPBS model, we propose a two-dimensional extension: a simplified two-dimensional Array with Reconfigurable Pipelined Bus System (2D ARPBS). While achieving better scalability, we show the effectiveness of this newly proposed model by designing two novel optimal sorting algorithms on this model. The first sorting algorithm is an extension of Leighton's seven-phase columnsort algorithm that eliminates the restriction of sorting only an r times s array, where r ge s^2 , and sorts an n times n array in O(log n) time. The second one is an optimal multiway mergesort algorithm that uses a novel processor efficient two-way mergesort algorithm and a novel multiway merge scheme to sort n^2 items in O(log n) time. Using an optimal sorting algorithm Pipelined Mergesort designed for the LARPBS model as a building block, we extend our research on parallel sorting on the LARPBS to a more scalable 2D ARPBS model and achieve optimality in both sorting algorithms.     

Anonymizing bipartite graph data using safe groupings

Private data often come in the form of associations between entities, such as customers and products bought from a pharmacy, which are naturally represented in the form of a large, sparse bipartite graph. As with tabular data, it is desirable to be able to publish anonymized versions of such data, to allow others to perform ad hoc analysis of aggregate graph properties. However, existing tabular anonymization techniques do not give useful or meaningful results when applied to graphs: small changes or masking of the edge structure can radically change aggregate graph properties. We introduce a new family of anonymizations for bipartite graph data, called (k, ℓ)-groupings. These groupings preserve the underlying graph structure perfectly, and instead anonymize the mapping from entities to nodes of the graph. We identify a class of “safe” (k, ℓ)-groupings that have provable guarantees to resist a variety of attacks, and show how to find such safe groupings. We perform experiments on real bipartite graph data to study the utility of the anonymized version, and the impact of publishing alternate groupings of the same graph data. Our experiments demonstrate that (k, ℓ)-groupings offer strong tradeoffs between privacy and utility.