振动时效原理与机械式激振器锁相调速系统

本文介绍了振动时效（ＶＳＲ）技术原理和采用双闭环数字锁相调速系统，用于ＶＳＲ技术的机械式激振器直流电机调速单元，显著提高了在强烈振动状态下，具有谐振型负荷的直流电机的稳频精度，其精度在０．１Ｈｚ以上。     

多Agent系统中数据并发控制研究

多Agent系统是基于依赖关系进行协作和通信，而依赖关系又取决于数据的存取。文章从数据的并发性原理出发，讨论了在多Agent系统中三种可能引起的数据不一致的情况，并提出了解决的方法，以及用此方法可能引起的问题。     

人字门运行阻力原型观测及研究

三峡工程永久船闸，是目前世界上水头最高，技术规模最大的梯级船闸。其第一级上闸首人字门的淹没水深达３５米。在与三峡船闸人字门技术规划相近的葛洲坝１，２号船闸上，对闸门的应力状态与运行阻力进行了原型观测研究，取得第一性研究资料，将有助于三峡枢纽船闸人字阂门运转问题的研究。原型观测结果表明，人字门项枢锚杆在无水工况下受力最大，且Ａ杆受力状态较Ｂ杆复杂，受各种因素影响也远比Ｂ杆大，在设计，制造及运行管理中     

CMOS中PASSWORD的清除

本文介绍微机ＣＭＯＳ被加锁后的几种解锁方法     

免供电电子锁系统的设计与实现

提出一种免供电的电子锁系统,其核心部件包括电子锁具、电子钥匙及管理器,电子锁具应用用户开门转动手柄所产生的能量经内部整流电路,储能电路以供给后端的电子控制系统,完全实现电能自供,解决外接电源及干电池供电电子锁中诸多问题,解除电子锁进一步广泛应用的瓶颈。又因该电子锁系统还具有高安全性和高易用性等特点,具有良好的应用前景。     

基于AT89c51单片机的电子密码锁的设计

基于AT89c51单片机的电子密码锁,采用24C04A存储单元、1602LCD液晶模块,通过密码输入来控制芯片工作,完成开锁、闭锁、修改密码等任务的电子产品。它具有保密性高,成本低、功耗低、操作简单,使用灵活性好。安全系数高等优点。     

飞机售票系统中的数据共享和并发访问

本语文研制了一个收音机售标系统,用封锁机制对并发访问进行控制;整个应用系统采用ＳＱＬ Ｓｅｒｖｅｒ数据库平台、客户机／服务器系统结构和ＰｏｗｅｒＢｕｉｌｄｅｒ６．０开发工具。     

Efficient consolidation-aware VCPU scheduling on multicore virtualization platform

Multicore processors are widely used in today’s computer systems. Multicore virtualization technology provides an elastic solution to more efficiently utilize the multicore system. However, the Lock Holder Preemption (LHP) problem in the virtualized multicore systems causes significant CPU cycles wastes, which hurt virtual machine (VM) performance and reduces response latency. The system consolidates more VMs, the LHP problem becomes worse. In this paper, we propose an efficient consolidation-aware vCPU (CVS) scheduling scheme on multicore virtualization platform. Based on vCPU over-commitment rate, the CVS scheduling scheme adaptively selects one algorithm among three vCPU scheduling algorithms: co-scheduling, yield-to-head, and yield-to-tail based on the vCPU over-commitment rate because the actions of vCPU scheduling are split into many single steps such as scheduling vCPUs simultaneously or inserting one vCPU into the run-queue from the head or tail. The CVS scheme can effectively improve VM performance in the low, middle, and high VM consolidation scenarios. Using real-life parallel benchmarks, our experimental results show that the proposed CVS scheme improves the overall system performance while the optimization overhead remains low.     

A Combinatorial Benders׳ decomposition for the lock scheduling problem

The Lock Scheduling Problem (LSP) is a combinatorial optimization problem that represents a real challenge for many harbours and waterway operators. The LSP consists of three strongly interconnected subproblems: scheduling lockages, assigning ships to chambers, and positioning the ships inside the chambers. These should be interpreted respectively as a scheduling, an assignment, and a packing problem. By combining the first two problems into a master problem and using the packing problem as a subproblem, a decomposition is achieved that can be solved efficiently by a Combinatorial Benders׳ approach. The master problem is solved first, thereby sequencing the ships into a number of lockages. Next, for each lockage, a packing subproblem is checked for feasibility, possibly returning a number of combinatorial inequalities (cuts) to the master problem. The result is an exact approach to the LSP. Experiments are conducted on a set of instances that were generated in correspondence with real world data. The results indicate that the decomposition approach significantly outperforms other exact approaches presented in the literature, in terms of solution quality and computation time.