Delay-dependent anti-windup synthesis for stability of constrained state delay systems using pole-constraints

This paper proposes the design of anti-windup compensator gain for stability of actuator input constrained state delay systems using constrained pole-position of the closed-loop. Based on Delay-Dependent Lyapunov-Krasovskii functionals and local sector conditions, a new LMI characterization is derived that ensures closed-loop asymptotic stability of constrained state delay systems while accounting upper bound fixed state delay and largest lower bound of the system’s pole-position in the formulation of anti-windup gain. Besides, at saturation, the method significantly nullifies the inherent slow dynamics present in the system. It is shown in the comparative numerical examples that the LMI formulation draws stability with improved time-domain performance.     

Studying re-opened bugs in open source software

Bug fixing accounts for a large amount of the software maintenance resources. Generally, bugs are reported, fixed, verified and closed. However, in some cases bugs have to be re-opened. Re-opened bugs increase maintenance costs, degrade the overall user-perceived quality of the software and lead to unnecessary rework by busy practitioners. In this paper, we study and predict re-opened bugs through a case study on three large open source projects—namely Eclipse, Apache and OpenOffice. We structure our study along four dimensions: (1) the work habits dimension (e.g., the weekday on which the bug was initially closed), (2) the bug report dimension (e.g., the component in which the bug was found) (3) the bug fix dimension (e.g., the amount of time it took to perform the initial fix) and (4) the team dimension (e.g., the experience of the bug fixer). We build decision trees using the aforementioned factors that aim to predict re-opened bugs. We perform top node analysis to determine which factors are the most important indicators of whether or not a bug will be re-opened. Our study shows that the comment text and last status of the bug when it is initially closed are the most important factors related to whether or not a bug will be re-opened. Using a combination of these dimensions, we can build explainable prediction models that can achieve a precision between 52.1–78.6 % and a recall in the range of 70.5–94.1 % when predicting whether a bug will be re-opened. We find that the factors that best indicate which bugs might be re-opened vary based on the project. The comment text is the most important factor for the Eclipse and OpenOffice projects, while the last status is the most important one for Apache. These factors should be closely examined in order to reduce maintenance cost due to re-opened bugs.     

A greedy gradient-simulated annealing selection hyper-heuristic

Educational timetabling problem is a challenging real world problem which has been of interest to many researchers and practitioners. There are many variants of this problem which mainly require scheduling of events and resources under various constraints. In this study, a curriculum based course timetabling problem at Yeditepe University is described and an iterative selection hyper-heuristic is presented as a solution method. A selection hyper-heuristic as a high level methodology operates on the space formed by a fixed set of low level heuristics which operate directly on the space of solutions. The move acceptance and heuristic selection methods are the main components of a selection hyper-heuristic. The proposed hyper-heuristic in this study combines a simulated annealing move acceptance method with a learning heuristic selection method and manages a set of low level constraint oriented heuristics. A key goal in hyper-heuristic research is to build low cost methods which are general and can be reused on unseen problem instances as well as other problem domains desirably with no additional human expert intervention. Hence, the proposed method is additionally applied to a high school timetabling problem, as well as six other problem domains from a hyper-heuristic benchmark to test its level of generality. The empirical results show that our easy-to-implement hyper-heuristic is effective in solving the Yeditepe course timetabling problem. Moreover, being sufficiently general, it delivers a reasonable performance across different problem domains.     

Three-qubit Grover’s algorithm using superconducting quantum interference devices in cavity-QED

We present a scheme for the implementation of three-qubit Grover’s algorithm using four-level superconducting quantum interference devices (SQUIDs) coupled to a superconducting resonator. The scheme is based on resonant, off-resonant interaction of the cavity field with SQUIDs and application of classical microwave pulses. We show that adjustment of SQUID level spacings during the gate operations, adiabatic passage, and second-order detuning are not required that leads to faster implementation. We also show that the marked state can be searched with high fidelity even in the presence of unwanted off-resonant interactions, level decay, and cavity dissipation.     

Amplitudes distribution over two copies of small quantum subsystems

We propose a new formulation of quantum algorithm which allows to distribute amplitudes over two copies of small quantum subsystems. The new method gives a fixed number of copies and applied to the control of multi-qubit system. The analysis for the amount of error due to the distribution process has been presented for a system of 10 qubits with a small quantum subsystems to be copied. The present scheme provides a new way to distribute amplitudes over small quantum subsystems.     

Optisim: A System Simulation Methodology for Optically Interconnected HPC Systems

Although CAD tools have significantly assisted electronic system simulation, the system-level optoelectronics modeling field has lagged behind due to a lack of simulation methodologies and tools. Optisim, a system-level modeling and simulation methodology of optical interconnects for HPC systems, can provide computer architects, designers, and researchers with a highly optimized, efficient, and accurate discrete-event environment to test various HPC systems.     

Data aggregation and routing in Wireless Sensor Networks: Optimal and heuristic algorithms

A fundamental challenge in the design of Wireless Sensor Networks (WSNs) is to maximize their lifetimes especially when they have a limited and non-replenishable energy supply. To extend the network lifetime, power management and energy-efficient communication techniques at all layers become necessary. In this paper, we present solutions for the data gathering and routing problem with in-network aggregation in WSNs. Our objective is to maximize the network lifetime by utilizing data aggregation and in-network processing techniques. We particularly focus on the joint problem of optimal data routing with data aggregation en route such that the above mentioned objective is achieved. We present Grid-based Routing and Aggregator Selection Scheme (GRASS), a scheme for WSNs that can achieve low energy dissipation and low latency without sacrificing quality. GRASS embodies optimal (exact) as well as heuristic approaches to find the minimum number of aggregation points while routing data to the Base-Station (BS) such that the network lifetime is maximized. Our results show that, when compared to other schemes, GRASS improves system lifetime with acceptable levels of latency in data aggregation and without sacrificing data quality.     

Natural convection mass transfer inside cylindrical cavities of different orientation

Rates of free convection mass transfer inside cylindrical cavities were studied by measuring the limiting current for the cathodic deposition of copper from acidified copper sulphate solution using a cylindrical anode placed inside the cavity. Variables studied were cavity orientation (vertical with upward facing opening, vertical with downward facing opening and horizontal), physical properties of the solution and cavity dimensions (diameter and depth). For vertical cavities with upward facing openings the data were correlated by the equation Sh = 0.257 (Sc × Gr)^0.33 For horizontal cavities the data were correlated by the equation Sh = 0.139 (Sc × Gr)^0.33 For vertical cavities with downward facing openings the data were correlated by the equation Sh = 0.187 (Sc × Gr)^0.297 A comparison between the present data and the data obtained from other cavity geometries was made to shed light on the role of cavity geometry in thermosyphon design.List of symbols a, b constants - A cavity area - C copper sulphate bulk concentration - C _p specific heat - D diffusivity - d cavity diameter - F Faraday constant - g acceleration due to gravity - h heat transfer coefficient - I _L limiting current - k thermal conductivity - K mass transfer coefficient - L cavity depth - L _c characteristic length calculated from Equation 3 - Z number of electrons involved in the reaction - Gr Grashof number (gL _c ³/²/_i) - Nu Nusselt number (hL _c/k - Pr Prandtl number (C _pµ/k) - Sc Schmidt number (/D) - Sh Sherwood number (KL _c/D) - Ra Rayleigh number (Sc × Gr) or (Pr × Gr) Greek letters µ dynamic viscosity of the electrolyte - kinematic viscosity of the electrolyte - density of the electrolyte - _i interfacial density - density difference between the bulk solution and interfacial solution