Experience with Applying Formal Methods to Protocol Specification and System Architecture

In the last three years or so we at Enterprise Platforms Group at Intel Corporation have been applying formal methods to various problems that arose during the process of defining platform architectures for Intel's processor families. In this paper we give an overview of some of the problems we have worked on, the results we have obtained, and the lessons we have learned. The last topic is addressed mainly from the perspective of platform architects.     

A four-bias three-layer graphene-based THz absorber

Wave absorbers are considered to be fundamental building blocks for the manipulation of light. Almost all optical systems exploit absorbers to realize some functions. A highly tunable wide-band THz absorber is presented herein. Utilizing a dual-bias scheme with a single graphene layer leads to greater freedom to control the absorption response, while a conventional periodic array of graphene ribbons and a layer of graphene sheet are also exploited. Also, a circuit model representation for all the constituent parts of the proposed absorber is developed with an evolved design methodology. According to the simulation results, wide-band absorption from 3.5 to 6 THz is achieved.

     

Extracting Optimal Policies of Hydropower Multi-Reservoir Systems Utilizing Enhanced Differential Evolution Algorithm

Deriving the optimal policies of hydropower multi-reservoir systems is a nonlinear and high-dimensional problem which makes it difficult to achieve the global or near global optimal solution. In order to optimally solve the problem effectively, development of optimization methods with the purpose of optimizing reservoir operation is indispensable as well as inevitable. This paper introduces an enhanced differential evolution (EDE) algorithm to enhance the exploration and exploitation abilities of the original differential evolution (DE) algorithm. The EDE algorithm is first applied to minimize two benchmark functions (Ackley and Shifted Schwefel). In addition, a real world two-reservoir hydropower optimization problem and a large scale benchmark problem, namely ten-reservoir problem, were considered to indicate the effectiveness of the EDE. The performance of the EDE was compared with the original DE to solve the three optimization problems. The results demonstrate that the EDE would have a powerful global ability and faster convergence than the original DE to solve the two benchmark functions. In the 10-reservoir optimization problem, the EDE proved to be much more functional to reach optimal or near optimal solution and to be effective in terms of convergence rate, standard deviation, the best, average and worst values of objective function than the original DE. Also, In the case of two-reservoir system, the best values of the objective function obtained 93.86 and 101.09 for EDE and DE respectively. Based on the results, it can be stated that the most important reason to improve the performance of the EDE algorithm is the promotion of local and global search abilities of the DE algorithm using the number of novel operators. Also, the results of these three problems corroborated the superior performance, the high efficiency and robustness of the EDE to optimize complex and large scale multi-reservoir operation problems.     

On the stability issues of switched singular time‐delay systems with slow switching based on average dwell‐time

The issue of exponential stability analysis of continuous‐time switched singular systems consisting of a family of stable and unstable subsystems with time‐varying delay is investigated in this paper. It is very difficult to analyze the stability of such systems because of the existence of time‐delay and unstable subsystems. In this regard, on the basis of the free‐weighting matrix approach, by constructing the new Lyapunov‐like Krasovskii functional, and using the average dwell‐time approach, delay‐dependent sufficient conditions are derived and formulated in terms of LMIs to check the exponential stability of such systems. This paper also highlights the relationship between the average dwell‐time of the switched singular time‐delay system, its stability, exponential convergence rate of differential states, and algebraic states. Finally, a numerical example is given to confirm the analytical results and illustrate the effectiveness of the proposed strategy. Copyright © 2012 John Wiley & Sons, Ltd.     

Conceptual aspects of geometric quantum computation

Geometric quantum computation is the idea that geometric phases can be used to implement quantum gates, i.e., the basic elements of the Boolean network that forms a quantum computer. Although originally thought to be limited to adiabatic evolution, controlled by slowly changing parameters, this form of quantum computation can as well be realized at high speed by using nonadiabatic schemes. Recent advances in quantum gate technology have allowed for experimental demonstrations of different types of geometric gates in adiabatic and nonadiabatic evolution. Here, we address some conceptual issues that arise in the realizations of geometric gates. We examine the appearance of dynamical phases in quantum evolution and point out that not all dynamical phases need to be compensated for in geometric quantum computation. We delineate the relation between Abelian and non-Abelian geometric gates and find an explicit physical example where the two types of gates coincide. We identify differences and similarities between adiabatic and nonadiabatic realizations of quantum computation based on non-Abelian geometric phases.     

Safe Autonomous Agent Formation Operations Via Obstacle Collision Avoidance

In this paper, we consider the problem of flocking and shape‐orientation control of multi‐agent systems with inter‐agent and obstacle collision avoidance. We first consider the problem of forcing a set of autonomous agents to form a desired formation shape and orientation while avoiding inter‐agent collision and collision with convex obstacles, and following a trajectory known to only one of the agents, namely the leader of the formation. Then we build upon the solution given to this problem and solve the problem of guaranteeing obstacle collision avoidance by changing the size and the orientation of the formation. Changing the size and the orientation of the formation is helpful when the agents want to go through a narrow passage while the existing size or orientation of the formation does not allow this. We also propose collision avoidance algorithms that temporarily change the shape of the formation to avoid collision with stationary or moving nonconvex obstacles. Simulation results are presented to show the performance of the proposed control laws.     

Short‐Time Linear Quadratic Form Technique for Estimating Fast‐Varying Parameters in Feedback Loops

The precision of a closed‐loop controller system designed for an uncertain plant depends strongly upon the maximum extent to which it is possible to track the trend of time‐varying parameters of the plant. The aim of this study is to describe a new parameter estimation algorithm that is able to follow fast‐varying parameters in closed‐loop systems. The short‐time linear quadratic form (STLQF) estimation algorithm introduced in this paper is a technique for tracking time‐varying parameters based on short‐time analysis of the regressing variables in order to minimize locally a linear quadratic form cost function. The established cost function produces a linear combination of errors with several delays. To meet this objective, mathematical development of the STLQF estimation algorithm is described. To implement the STLQF algorithm, the algorithm is applied to a planar mobile robot with fast‐varying parameters of inertia and viscous and coulomb frictions. Next, performance of the proposed algorithm is assessed against noise effects and variation in the type of parameters.     

A single-phase p-type ac–ac converter with reduced components count and high boost factor

This paper proposes a new single-phase direct step-up ac–ac converter by modifying the p-type impedance source. It provides a high boost factor as well as high efficiency, while only six parts are required to design it, involving just two bidirectional power switches. A safe commutation method has been applied to power switches to make the converter snubber-free and high efficient. Input and output harmonic filters are no longer required since input and output currents variate continuously with small ripple and low total harmonic distortion (THD). The proposed topology only modulates the output voltage amplitude, not the phase and frequency, so the output frequency is identical to the input frequency and constant. Thus, it can be utilized in step-up conversion applications, like inductive power transmission from low ac voltage sources. Input and output have the same ground, which is a good protective feature. In this paper, the operating principle of the converter is demonstrated. Experimental results have been represented to evaluate the performance of the converter. For this purpose, an experimental prototype has been fabricated. Results are investigated and compared with other previous step-up ac–ac converters. Results confirm the theory, operating principle, and performance of the converter.