Dynamic non-minimum phase compensation for SISO nonlinear, affine in the input systems

Non-minimum phase difficulties prevent the use of input-output feedback linearization. To avoid this problem earlier work proposed the use of synthetic outputs in order to place zeros in prescribed locations under a condition of static equivalence. The objective here is also to introduce a synthetic output but this is defined through the use of perturbations aimed at yielding maximum relative degree. Resetting of the initial conditions allows design freedom for closing the gap between the behaviour of the synthetic and actual output.     

Scheduling in distributed systems: A cloud computing perspective

Scheduling is essentially a decision-making process that enables resource sharing among a number of activities by determining their execution order on the set of available resources. The emergence of distributed systems brought new challenges on scheduling in computer systems, including clusters, grids, and more recently clouds. On the other hand, the plethora of research makes it hard for both newcomers researchers to understand the relationship among different scheduling problems and strategies proposed in the literature, which hampers the identification of new and relevant research avenues. In this paper we introduce a classification of the scheduling problem in distributed systems by presenting a taxonomy that incorporates recent developments, especially those in cloud computing. We review the scheduling literature to corroborate the taxonomy and analyze the interest in different branches of the proposed taxonomy. Finally, we identify relevant future directions in scheduling for distributed systems.     

Input-to-state stability of switched systems and switching adaptive control

In this paper we prove that a switched nonlinear system has several useful input-to-state stable (ISS)-type properties under average dwell-time switching signals if each constituent dynamical system is ISS. This extends available results for switched linear systems. We apply our result to stabilization of uncertain nonlinear systems via switching supervisory control, and show that the plant states can be kept bounded in the presence of bounded disturbances when the candidate controllers provide ISS properties with respect to the estimation errors. Detailed illustrative examples are included.     

Optimal control of switching systems

This paper considers an optimal control problem for a switching system. For solving this problem we do not make any assumptions about the number of switches nor about the mode sequence, they are determined by the solution of the problem. The switching system is embedded into a larger family of systems and the optimization problem is formulated for the latter. It is shown that the set of trajectories of the switching system is dense in the set of trajectories of the embedded system. The relationship between the two sets of trajectories (1) motivates the shift of focus from the original problem to the more general one and (2) underlies the engineering relevance of the study of the second problem. Sufficient and necessary conditions for optimality are formulated for the second optimization problem. If they exist, bang-bang-type solutions of the embedded optimal control problem are solutions of the original problem. Otherwise, suboptimal solutions are obtained via the Chattering Lemma.     

Modal synthesis of multivariable systems with observers of specified order

The problem of pole assignment in multivariable linear systems with observers of a given order v is considered. By way of a simple proof, a very general result is established which constitutes an extension of all theorems known in the literature on pole assignment via observers. On its basis, an efficient design algorithm is worked out.     

A notion of passivity for switched systems with state-dependent switching

A passivity concept for switched systems with state-dependent switching is presented. Each subsystem has a storage function to describe the “energy” stored in the subsystem. The passivity property of a switched system is given in terms of multiple storage functions. Each storage function is allowed to grow on the “switched on” time sequence but the total growth is bounded by a certain function. Stability is inferred from passivity and asymptotic stability is achieved under further assumptions of a detectivity property of a local form and boundedness of the total change of some storage function on its inactive intervals. A state-dependent switching law that renders the system passive is also designed.     

云计算数据服务主动安全防御系统探讨

随着云计算数据服务的快速发展和应用,大大地改变了人们的工作、学习和生活模式。云计算数据服务带来极大便利的同时,也给人们带来了潜在的威胁,因此需要构建网络安全主动防御系统,提高网络安全性能。文章详细地分析了云计算数据服务面临的安全威胁,阐述了云计算服务平台主动安全防御系统及采用的技术,提高了云计算数据服务平台的安全性能。     

Strong feedback cyclization for systems over rings

For nonnecessarily reachable systems over a commutative ring R, we define a strong form of feedback cyclization (FC). With this natural generalization of the FC property we obtain a feedback reduced form for systems over strong FC rings (i.e. rings for which every system verifies the FC property). In the particular case of reachable single input systems, this gives the usual control canonical form of Bumby et al. [Remarks on the pole-shifting problem over rings, J. Pure Appl. Algebra 20 (1981) 113–127]. Also it is proved that a commutative ring with 1 in its stable range has the strong FC property if and only if it has the UCU property, which is the natural parallel form of the result given by Brewer et al. [Pole assignability in polynomial rings, power series rings and Prüfer domains, J. Algebra 106 (1987) 265–286] for the reachable case. Many classes of rings which were known to be FC rings are in fact strong FC rings, but there are FC rings which are not strong FC rings.     

Smooth switching LPV controller design for LPV systems

This paper presents a method to design a smooth switching gain-scheduled linear parameter varying (LPV) controller for LPV systems. The moving region of the gain-scheduling variables is divided into a specified number of local subregions as well as subregions for the smooth controller switching, and one gain-scheduled LPV controller is assigned to each of the local subregions. For each switching subregion, a function interpolating two local LPV controllers associated with its neighborhood subregions is designed to satisfy the constraint of smooth transition of controller system matrices. The smooth switching controller design problem amounts to solving a feasibility problem which involves nonlinear matrix inequalities. To find a solution to the feasibility problem, an iterative descent algorithm which solves a series of convex optimization problems is proposed. The usefulness of the proposed controller design method is demonstrated with a control example of a flexible ball-screw drive system.     

H-infinity control for switched and impulsive singular systems

A new model of dynamical systems is proposed which consists of singular systems with impulsive effects, i.e., switched and impulsive singular systems （SISS）. By using the switched Lyapunov functions method, a sufficient condition for the solvability of the H-infinity control problem for SISSs is given which generalizes the H-infinity control theory for singular systems to switched singular systems with impulsive effects. Then the sufficient condition of solvablity of the H-infinity control problem is presented in terms of linear matrix inequalities. Finally, the effectiveness of the developed aooroach for switched and imoulsive singular svstems is illustrated by a numerical example.     

A unified method for optimal arbitrary pole placement

We consider the classic problem of pole placement by state feedback. We offer an eigenstructure assignment algorithm to obtain a novel parametric form for the pole-placing feedback matrix that can deliver any set of desired closed-loop eigenvalues, with any desired multiplicities. This parametric formula is then exploited to introduce an unconstrained nonlinear optimisation algorithm to obtain a feedback matrix that delivers the desired pole placement with optimal robustness and minimum gain. Lastly we compare the performance of our method against several others from the recent literature.     

Online optimization for scheduling preemptable tasks on IaaS cloud systems

In Infrastructure-as-a-Service (IaaS) cloud computing, computational resources are provided to remote users in the form of leases. For a cloud user, he/she can request multiple cloud services simultaneously. In this case, parallel processing in the cloud system can improve the performance. When applying parallel processing in cloud computing, it is necessary to implement a mechanism to allocate resource and schedule the execution order of tasks. Furthermore, a resource optimization mechanism with preemptable task execution can increase the utilization of clouds. In this paper, we propose two online dynamic resource allocation algorithms for the IaaS cloud system with preemptable tasks. Our algorithms adjust the resource allocation dynamically based on the updated information of the actual task executions. And the experimental results show that our algorithms can significantly improve the performance in the situation where resource contention is fierce.     

以云计算为导向的计算机操作系统教学研究

计算机操作系统作为计算机类各专业基础课程,其教学内容应密切结合新技术。云计算是当前应用最广泛的技术,并有着广泛的发展空间。本文介绍了云计算的概念和对计算机操作系统教学的影响,并分析了现有计算机操作系统教学纲要,然后,进一步说明了云计算中的关键技术并分析与计算机操作系统教学的联系,最后,重点从处理机管理、内存管理和I/O设备管理三个方面系统阐述了云计算对计算机操作系统教学的导向,作为对该门课程教学的初步研究。     

An imperialist competitive algorithm for virtual machine placement in cloud computing

Abstract

Cloud computing, the recently emerged revolution in IT industry, is empowered by virtualisation technology. In this paradigm, the user’s applications run over some virtual machines (VMs). The process of selecting proper physical machines to host these virtual machines is called virtual machine placement. It plays an important role on resource utilisation and power efficiency of cloud computing environment. In this paper, we propose an imperialist competitive-based algorithm for the virtual machine placement problem called ICA-VMPLC. The base optimisation algorithm is chosen to be ICA because of its ease in neighbourhood movement, good convergence rate and suitable terminology. The proposed algorithm investigates search space in a unique manner to efficiently obtain optimal placement solution that simultaneously minimises power consumption and total resource wastage. Its final solution performance is compared with several existing methods such as grouping genetic and ant colony-based algorithms as well as bin packing heuristic. The simulation results show that the proposed method is superior to other tested algorithms in terms of power consumption, resource wastage, CPU usage efficiency and memory usage efficiency.     

SLA guarantees for cloud services

Quality-of-service and SLA guarantees are among the major challenges of cloud-based services. In this paper we first present a new cloud model called SLAaaS — SLA aware Service. SLAaaS considers QoS levels and SLA as first class citizens of cloud-based services. This model is orthogonal to other SaaS, PaaS, and IaaS cloud models, and may apply to any of them. More specifically we make three contributions: (i) we provide a novel domain specific language that allows to describe QoS-oriented SLA associated with cloud services; (ii) we present a general control-theoretic approach for managing cloud service SLA; (iii) we apply the proposed language and control approach to guarantee SLA in various case studies, ranging from cloud-based MapReduce service, to locking service, and higher-level e-commerce service; these case studies successfully illustrate SLA management with different QoS aspects of cloud services such as performance, dependability, financial energetic costs.     

云计算环境下基于MapReduce并行的Apriori算法优化研究

根据MapReduce模型并行运行实现的特点,针对可扩展性差的传统Apriori的特点和传统Apriori算法,采用了＂云＂强大的廉价计算处理方式和关联规则挖掘算法,改进提高Apriori算法的运算效率。通过改进在云计算环境下MapReduce编程框架,并且结合验证MR-Apriori算法的实验为基础,这对传统意义上的Apriori算法在数据挖掘过程中所出现的客观问题进行处理,从而真正意义上的完成了本文研究的基于MapReduce并行的Apriori算法的扩展性提升的目标,并且表明了元计算技术结合关联规则挖掘算法的可能性。     

E-mc2: A formal framework for energy modelling in cloud computing

Due to energy crisis of the last years, energy waste and sustainability have been brought both into public attention, and under industry and scientific scrutiny. Thus, obtaining high-performance at a reduced cost in cloud environments as reached a turning point where computing power is no longer the most important concern. However, the emphasis is shifting to manage energy efficiently, whereas providing techniques for measuring energy requirements in cloud systems becomes of capital importance.Currently there are different methods for measuring energy consumption in computer systems. The first consists in using power meter devices, which measure the aggregated power use of a machine. Another method involves directly instrumenting the motherboard with multimeters in order to obtain each power connector’s voltage and current, thus obtaining real-time power consumption. These techniques provide a very accurate results, but they are not suitable for large-scale environments. On the contrary, simulation techniques provide good scalability for performing experiments of energy consumption in cloud environments. In this paper we propose E-mc², a formal framework integrated into the iCanCloud simulation platform for modelling the energy requirements in cloud computing systems.     

Bumpless switching control for switched systems with partial actuator failures

This study is concerned with the bumpless transfer problem for switched systems with partial actuator failures, in order to obtain smooth system performance output transition. Taking into account that the system requires a controller switching from current sub-controller to a fault-tolerant sub-controller after actuator fault. And bumpless transfer for control input cannot be traditionally designed when the actuator fault occurs, while performance smoothing can be considered and it is actually the ultimate goal of bumpless transfer. Specifically, the actuator fault model is firstly established and partial actuator fault is considered. Then, the system performance output signal is deemed as the main design variable of bumpless transfer, and closed-loop control systems both previous and after controller switching are constructed. Moreover, by using model matching thought and the adaptive sliding mode control technique, a bumpless transfer compensator design strategy is given to drive the performance output variable (after controller switching) to track the one of reference model. At last, simulation results of numeric and application examples demonstrate the effectiveness of the proposed bumpless transfer strategy.     

Design of two-layer switching rule for stabilization of switched linear systems with mismatched switching

A two-layer switching architecture and a two-layer switching rule for stabilization of switched linear control systems are proposed, under which the mismatched switching between switched systems and their candidate hybrid controllers can be allowed. In the low layer, a state-dependent switching rule with a dwell time constraint to exponentially stabilize switched linear systems is given; in the high layer, supervisory conditions on the mismatched switching frequency and the mismatched switching ratio are presented, under which the closed-loop switched system is still exponentially stable in case of the candidate controller switches delay with respect to the subsystems. Different from the traditional switching rule, the two-layer switching architecture and switching rule have robustness, which in some extend permit mismatched switching between switched subsystems and their candidate controllers.