The Principles of Eliminating Pulsating Torque in Current Source Inverter Induction Motor Systems

The problem of reducing the pulsating torque in current source inverter induction motor systems is investigated. Two typical approaches presented in recent publications are analyzed by making clear 1) the correlation among the current harmonics and the torque harmonics, and 2) the conceptual contradiction existing between these two approaches. By synthesizing the analyzed results, fundamental principles for treating the current harmonics and torque harmonics are established. In addition, the method for evaluating the degree of torque ripple is described, along with a proposed criterion for torque ripple content. By applying this criterion to these two approaches, objective estimates of degree of torque pulsations, which were unfeasible so far, are now made possible.     

改性硅气凝胶/聚甲基丙烯酸甲酯乳液的制备与性能研究

采用HMDS(六甲基二硅氮烷)改性硅气凝胶,通过乳液聚合法,将改性硅气凝胶与甲基丙烯酸甲酯(MMA)进行聚合,制得改性硅气凝胶/聚甲基丙烯酸甲酯复合乳液,并且讨论了硅气凝胶的表面状态,以及改性气凝胶质量分数对复合乳液性能的影响。结果表明:HMDS可成功修饰于硅气凝胶表面,将改性硅气凝胶与PMMA乳液体系复合,乳液综合性能呈现较为显著的变化。HMDS修饰的硅气凝胶有助于降低乳液的导热系数,加入3%HMDS修饰的硅气凝胶可以使成膜后的乳液具有较低的导热系数。     

Time domain analysis of the weighted distributed order rheological model

This paper presents the fundamental solution and relevant properties of the weighted distributed order rheological model in the time domain. Based on the construction of distributed order damper and the idea of distributed order element networks, this paper studies the weighted distributed order operator of the rheological model, a generalization of distributed order linear rheological model. The inverse Laplace transform on weighted distributed order operators of rheological model has been obtained by cutting the complex plane and computing the complex path integral along the Hankel path, which leads to the asymptotic property and boundary discussions. The relaxation response to weighted distributed order rheological model is analyzed, and it is closely related to many physical phenomena. A number of novel characteristics of weighted distributed order rheological model, such as power-law decay and intermediate phenomenon, have been discovered as well. And meanwhile several illustrated examples play important role in validating these results.     

Ginzburg-Landau Analysis on the Superconductivity in TlNi<Subscript>2</Subscript>Se<Subscript>2</Subscript>

Based on a two-band isotropic Ginzburg-Landau theory, we study the magnetic properties of the recently observed superconducting crystal TlNi₂Se₂. Our exact solution of upper critical field reproduces the experimental data in a broad temperature range. It directly underlies the multi-gap superconductivity in this crystal. We also show that the effective mass of the electron for one band is about 20m _e while that of the other band is only 0.6m _e. This semi-heavy-fermion feature can qualitatively explain the experimental value of the Kadowaki-Woods ratio in TlNi₂Se₂.     

Design and implementation of a trusted monitoring framework for cloud platforms

Virtualization is a pillar technology in cloud computing for multiplexing computing resources on a single cloud platform for multiple cloud tenants. Monitoring the behavior of virtual machines (VMs) on a cloud platform is a critical requirement for cloud tenants. Existing monitoring mechanisms on virtualized platforms either takes a complete VM as the monitoring granularity, such that they cannot capture the malicious behaviors within individual VMs, or they focus on specific monitoring functions that cannot be used for heterogeneous VMs concurrently running on a single cloud node. Furthermore, the existing monitoring mechanisms have made an assumption that the privileged domain is trusted to act as expected, which causes the cloud tenants’ concern about security because the privileged domain in fact could not act as the tenants’ expectation. We design a trusted monitoring framework, which provides a chain of trust that excludes the untrusted privileged domain, by deploying an independent guest domain for the monitoring purpose, as well as utilizing the trusted computing technology to ensure the integrity of the monitoring environment. Moreover, the feature of fine-grained and general monitoring is also provided. We have implemented the proposed monitoring framework on Xen, and integrated it into OpenNebula. Our experimental results show that it can offer expected functionality, and bring moderate performance overhead.     

Flubber: Two-level disk scheduling in virtualized environment

While virtualization enables multiple virtual machines (VMs)—with multiple operating systems and applications—to run within a physical server, it also complicates resource allocations trying to guarantee Quality of Service (QoS) requirements of the diverse applications running within these VMs. As QoS is crucial in the cloud, considerable research efforts have been directed towards CPU, memory and network allocations to provide effective QoS to VMs, but little attention has been devoted to disk resource allocation.This paper presents the design and implementation of Flubber, a two-level scheduling framework that decouples throughput and latency allocation to provide QoS guarantees to VMs while maintaining high disk utilization. The high-level throughput control regulates the pending requests from the VMs with an adaptive credit-rate controller, in order to meet the throughput requirements of different VMs and ensure performance isolation. Meanwhile, the low-level latency control, by the virtue of the batch and delay earliest deadline first mechanism (BD-EDF), re-orders all pending requests from VMs based on their deadlines, and batches them to disk devices taking into account the locality of accesses across VMs. We have implemented Flubber and made extensive evaluations on a Xen-based host. The results show that Flubber can simultaneously meet the different service requirements of VMs while improving the efficiency of the physical disk. The results also show improvement of up to 25% in the VM performance over state-of-art approaches: for example, in contract to the default Xen disk I/O scheduler—Completely Fair Queueing (CFQ)—besides achieving the desired QoS of each VM, Flubber speeds up the sequential and random reads by 17% and 25%, respectively, due to the efficient physical disk utilization.     

Adapting grid computing environments dependable with virtual machines: design, implementation, and evaluations

Due to its potential, using virtual machines in grid computing is attracting increasing attention. Most of the researches focus on how to create or destroy a virtual execution environments for different kinds of applications, while the policy of managing the virtual environments is not widely discussed. This paper proposes the design, implementation, and evaluation of an adaptive and dependable virtual execution environment for grid computing, ADVE, which focuses on the policy of managing virtual machines in grid environments. To build a dependable virtual execution environments for grid applications, ADVE provides an set of adaptive policies managing virtual machine, such as when to create and destroy a new virtual execution environment, when to migrate applications from one virtual execution environment to a new virtual execution environment. We conduct experiments over a cluster to evaluate the performance of ADVE, and the experimental results show that ADVE can improve the throughput and the reliability of grid resources with the adaptive management of virtual machines.     

统一混沌系统的混合同步在图像加密中的应用

研究参数已知的统一混沌系统的混合同步现象,在这种同步模式中,系统的一部分状态正相同步,而其它状态反相同步,设计了一个简单的单向线性反馈控制器,提出实现混合同步的充分条件.采用近似熵算法对耦合的混沌同步系统的复杂性研究结果表明,与单一混沌系统相比,本文实现的同步系统具有较高的复杂度.最后,基于该同步系统实现了一个图像加密方案,加密方案采用典型的图像加密框架,混乱阶段采用2D标准映射方案,扩散阶段采用像素的位置信息进行像素值替换,仿真实验结果与安全性分析表明,该算法加密效果良好,安全性较高.     

网络度相关及其传播特征研究

现实世界网络的连接具有多种相关性,其对网络拓扑结构、动态行为特征等都有重要影响.针对网络中节点之间的度值相关性,提出一种基于给定网络或度序列构造具有极大和极小连续匹配系数网络的方法——最大加权覆盖,并利用匹配系数分析了网络结构与度相关性之间的关系.在此基础上,基于连续匹配系数网络,通过仿真及理论推导研究了度相关特征对病毒传播速度、传播阈值和稳态感染率的影响.发现异配网络会加速病毒的传播,而传播速度对同配网络具有更高的敏感性.此外,从免疫策略角度的研究表明,以大度值为目标的免疫策略对异配网络具有更好的免疫效果,而在实际病毒防御中,应该根据有效传播率、匹配系数、免疫目标等综合考虑.     

一种基于点路结合的骨干网P2P缓存部署方法

P2P应用的广泛流行给ISP骨干网络带来了前所未有的流量压力,P2P缓存(peer-to-peer caching)技术是目前缓解这种流量压力的最有效手段之一,缓存部署方法对P2P缓存系统的运行效率有重要影响.已有缓存部署方法分为两类:基于骨干节点的部署方法(node-based cache deployment,NCD)和基于骨干链路的部署方法(link-based cache deployment,LCD).在不同的P2P流量分布情形下,NCD与LCD各有优劣,但是,这两类方法未能充分发挥缓存的性能.提出一种基于点路结合的骨干网P2P缓存部署方法(node-Link based cache deployment,NLCD),根据缓存部署过程中P2P流量分布和缓存存储状态的动态变化,灵活选择骨干节点或骨干链路作为部署位置.建立了以网络负载最小化为目标的缓存部署模型,基于该模型将P2P缓存部署问题建模为一个最优化问题,由于流量分布和缓存状态会在部署过程中不断变化,不具有最优子结构性质.证明了该最优化问题为NP完全问题,并设计了一种启发式贪婪算法进行求解.实验结果表明,针对典型的H&S型、Ladder型骨干网络拓扑,使用NLCD的平均链路使用率比使用LCD低5％～15％,比使用NCD低7％～30％.