Enabling Safe Dynamic Component-Based Software Adaptation
Recomposable software enables a system to change its structure and behavior during execution, in response to a dynamic execution environment. This paper proposes an approach to ensure that such adaptations are safe with respect to system consistency. The proposed method takes into consideration dependency analysis for target components, specifically determining viable sequences of adaptive actions and those states in which an adaptive action may be applied safely. We demonstrate that the technique ensures safe adaptation (insertion, removal, and replacement of components) in response to changing external conditions in a wireless multicast video application.

title: Using temporal logic to specify adaptive program semantics
abstract: Computer software must dynamically adapt to changing conditions. In order to fully realize the benefit of dynamic adaptation, it must be performed correctly. The correctness of adaptation cannot be properly addressed without precisely specifying the requirements for adaptation. This paper introduces an approach to formally specifying adaptation requirements in temporal logic. We introduce A-LTL, an adaptation-based extension to linear temporal logic, and use this logic to specify three commonly used adaptation semantics. Composition techniques are developed and applied to A-LTL to construct the specification of an adaptive program. We introduce adaptation semantics graphs to visually represent the adaptation semantics, which can also be used to automatically generate specification for adaptive programs.

title: Towards Re-engineering Legacy Systems for Assured Dynamic Adaptation
abstract: Increasingly, software must adapt its behavior in response to changes in the supporting computing, communication infrastructure, and in the surrounding physical environment. Since most existing software was not designed to adapt, research on technique to make legacy software dynamically adaptive has gained increasing interest. Assurance is crucial for adaptive software to fulfill its intended purpose. Correctness is even more critical if it is to be applied in high assurance systems. This paper proposes a model-driven approach to introduce dynamic adaptation to non-adaptive legacy systems while maintaining assurance properties. An aspect-oriented technique is applied to achieve separation of concerns in the implementation.

title: Specifying real-time properties in autonomic systems
abstract: Increasingly, computer software must adapt dynamically to changing conditions. The correctness of adaptation cannot be rigorously addressed without precisely specifying the requirements for adaptation. In many situations, these requirements involve absolute time, in addition to a logical ordering of events. This paper introduces an approach to formally specifying such timing requirements for adaptive software. We introduce TA-LTL, a timed adaptation-based extension to linear temporal logic, and use this logic to specify three timing properties associated with the adaptation process: safety, liveness, and stability. A dynamic adaptation scenario involving interactive audio streaming software is used to illustrate the timed temporal logic.

title: Modular verification of dynamically adaptive systems
abstract: Cyber-physical systems increasingly rely on dynamically adaptive programs to respond to changes in their physical environment; examples include ecosystem monitoring and disaster relief systems. These systems are considered high-assurance since errors during execution could result in injury, loss of life, environmental impact, and/or financial loss. In order to facilitate the development and verification of dynamically adaptive systems, we separate functional concerns from adaptive concerns. Specifically, we model a dynamically adaptive program as a collection of (non-adaptive) steady-state programs and a set of adaptations that realize transitions among steady state programs in response to environmental changes. We use Linear Temporal Logic (LTL) to specify properties of the non-adaptive portions of the system, and we use A-LTL (an adapt-operator extension toLTL) to concisely specify properties that hold during the adaptation process. Model checking offers an attractive approach to automatically analyzing models for adherence to formal properties and thus providing assurance. However, currently, model checkers are unable to verify properties specified using A-LTL. Moreover, as the number of steady-state programs and adaptations increase, the verification costs (in terms of space and time) potentially become unwieldy. To address these issues, we propose a modular model checking approach to verifying that a formal model of an adaptive program satisfies its requirements specified in LTL and A-LTL, respectively.

title: Specifying adaptation semantics
abstract: Computer software must dynamically adapt to changing conditions. In order to fully realize the benefit of dynamic adaptation, it must be performed correctly. The correctness of adaptation cannot be properly addressed without precisely specifying the requirements for adaptation. This paper introduces an approach to formally specifying adaptation requirements in temporal logic. We introduce A-LTL, an adaptation-based extension to linear temporal logic, and use this logic to specify three commonly used adaptation semantics. Neighborhood composition and sequential composition techniques are developed and applied to A-LTL to construct the specification of an adaptive system. We introduce adaptation semantics graphs to visually present the adaptation semantics. Specifications for adaptive systems can be automatically generated from adaptation semantics graphs.

title: A Topic Modeling Approach and Its Integration into the Random Walk Framework for Academic Search
abstract: In this paper, we propose a unified topic modeling approach and its integration into the random walk framework for academic search. Specifically, we present a topic model for simultaneously modeling papers, authors, and publication venues. We combine the proposed topic model into the random walk framework. Experimental results show that our proposed approach for academic search significantly outperforms the baseline methods of using BM25 and language model, and those of using the existing topic models (including pLSI, LDA, and the AT model).

title: Spectral decomposition approach for transient analysis of multi-server discrete-time queues
abstract: Previous work by the authors  where the spectral decomposition method was used for the transient analysis of a single-server queue is generalized. For the arrival process a general discrete-time Markovian batch arrival process is assumed, where the batch size distribution of the arrivals in successive slots is governed by a N-state discrete-time Markov chain. It is shown that once the N eigenvalues of the probability generating matrix of the arrival process are obtained, the complete solution in the transform domain may be given. Using the complex analysis technique and Cauchy's integral formula, an efficient numerical method is presented for the calculation of a few performance measures. The numerical method is generalized to the situations where the superpositions of a number of independent arrival sources are fed to the queue. It is shown that the numerical complexity are fed to the queue. It is shown that the numerical complexity of obtaining the transient solution in this case can be substantially reduced by using an approach based on the Kronecker product.<<ETX>>

title: Dynamic Equivalents of Power System Based on Extended Two Particle Swarm Optimization
abstract: A novel methodology based on phaser measurement units (PMUs) for power system dynamic equivalents is presented. In this methodology the external system is reduced dynamically using the important quantities obtained by PMUs. An extended two particle swarm optimization (PSO) algorithm with the mutation operator is proposed to identify the parameters of the equivalent system. The proposed method is demonstrated and compared with the original system using the 10 machines 39 buses New England test system. The comparison shows that the proposed method can preserve the dynamic properties of the original system and has great value in engineering application.

title: An Automatic Voice Query System for Bank Based on Telephone Network
abstract: Automatic voice query system for bank by phone was a hi-tech product based on computer technology, electronic communication technology and speech synthesis technology. The hardware design of this system adopted modularization design scheme, which centered on SCM AT89C51, and controlled the phone transceiver chip MT8870 and voice chip ISD4004, realizing voice query for bank account by phone remote control. This paper mainly analyzed and designed several circuits such as ringing detection circuit, on-hook and off-hook control circuit, amplified-filter circuit, receiving circuit, voice circuit and the connection circuit between PC and SCM; it finally gave the realization process of the systempsilas software.

title: Model-Driven Adaptive Self-healing for Autonomic Computing
abstract: Self-healing is a vital property that an autonomic system must possess in order to provide robust performance and survivability. The promise of self-healing depends on other properties that the system should provide, which include self-monitoring and self-configuring. Autonomic systems further require self-healing behavior to adapt to changes in user needs, business goals, and environmental conditions such that self-healing decisions are made dynamically and adaptively according to the system context. In this paper, we propose a model-driven approach that leverages modeling techniques, reliability engineering methodologies, and aspect-oriented development to realize an adaptive self- healing paradigm for autonomic computing.