35137686
An Optimal Iterative Learning Scheme for Dynamic Neural Network Modelling
In this paper, iterative learning control is presented to a dynamic neural network modelling process for nonlinear (stochastic) dynamical systems. When (B-spline) neural networks are used to model a nonlinear dynamical functional such as the output stochastic distributions in the repetitive processes or the batch processes, the parameters in the basis functions will be tuned using the generalized iterative learning control (GILC) scheme. The GILC scheme differs from the classical model-based ILC laws, with no dynamical input-output differential or difference equations given a prior. For the “model free” GILC problem, we propose an optimal design algorithm for the learning operators by introducing an augmented difference model in state space. A sufficient and necessary solvable condition can be given where a robust optimization solution with an LMI-based design algorithm can be provided.
18375552
Novel Parameter Identification by Using a High-Gain Observer With Application to a Gas Turbine Engine
In this study, a novel identification technique, that is high-gain observer-based identification approach, is proposed for systems with bounded process and measurement noises. For system parameters with abnormal changes, an adaptive change detection and parameter identification algorithm is next presented. The presented technique and algorithm are finally applied to the parameter identification of the gas turbine engine by using the recorded input data from the engine test-bed. The identified parameters and the response curves are desirable. The simulations have proved the effectiveness of the proposed procedure compared with the previous identification approach.
8670131
An Intelligent Mill Load Switching Control of the Pulverizing System for an Alumina Sintering Process
This paper proposes an intelligent switching control strategy for the pulverizing system for an alumina sintering process. The control strategy consists of a coordinating controller, a proportional-integral (PI) controller, a rule-based reasoning controller and a switching mechanism. The practical application to a pulverizing system in an alumina sintering process has shown that when the hot air temperature is low and varies frequently, this control strategy ensures that the mill load and the temperature of the mill outlet are both within their required ranges, and also controls the mill load at the level corresponding to the maximum mill output. Moreover, it has been observed that the proposed control strategy can avoid the fault operating condition and effectively reduce the unit energy consumption.
17487000
Advances in stochastic distribution control
Stochastic distribution control systems aims at the controller design so as to realize a shape control of the distributions of certain random variables in the process. Once the probability density functions (PDFs) of these variables are used to describe their distributions, the control task is to obtain control signals so that the output PFDs of the system are made to follow their target PDFs. In this paper, a survey of the recent developments on the research of stochastic distribution control systems will be made.
7971167
Robust minimum entropy tracking control with guaranteed stability for nonlinear stochastic systems under modeling errors
In this paper, robust minimum entropy tracking control problem is considered for nonlinear stochastic systems. The controlled systems are described by nonlinear non-Gaussian difference equations with the un-modeled uncertainty and modeling error, as well as time delays. Entropy is adopted to characterize the uncertainty of the tracking error. The nonlinear multi-step-ahead predictive cost function is used and the relationship between the probability density functions of the input and the tracking error via the uncertain mapping is established. With these formulations, the cost function can be bounded as a nonlinear functional of the control input and the known bounds of the errors. Explicit design algorithms are presented for the robust suboptimal controller and further for the stabilization controllers. The Renyi's entropy has also been used to simplify the cost function. Simulations are given to demonstrate the effectiveness of the proposed control algorithm.
781332
Minimum entropy control of nonlinear ARMA systems over a communication network
In this paper, the entropy concept has been utilized to characterize the uncertainty of the tracking error for nonlinear ARMA stochastic systems over a communication network, where time delays in the communication channels are of random nature. A recursive optimization solution has been developed. In addition, an alternative algorithm is also proposed based on the probability density function of the tracking error, which is estimated by a neural network. Finally, a simulation example is given to illustrate the efficiency and feasibility of the proposed approach.
6672981
Control Flow Optimization Via Dynamic Reconvergence Prediction
This paper presents a novel microarchitecture technique for accurately predicting control flow reconvergence dynamically. A reconvergence point is the earliest dynamic instruction in the program where we can expect program paths to reconverge regardless of the outcome or target of the current branch. Thus, even if the immediate control flow after a branch is uncertain, execution following the reconvergence point is certain. This paper proposes a novel hardware re-convergence predictor which is both implementable and accurate, with a 4KB predictor achieving more than 95% accuracy for SPEC INT, and larger implementations achieving greater than 99% accuracy. The information provided from reconvergence prediction can increase the effectiveness of a range of previously proposed performance optimizations, including speculative multithreading, control independence, and squash reuse. This paper also demonstrates a new technique that takes advantage of the dynamic reconvergence prediction information in order to predict a wrong path excursion ahead of branch resolution. On average, 34% of wrong path fetches are eliminated.
3155100
Sequencer virtualization
The Multiple Instruction Stream Processor (MISP) architecture introduces the sequencer as a new class of architectural resource, and provides a minimalist user-level MIMD instruction set extension for application programs to directly control execution of concurrent instruction streams on these sequencers. As with classic architectural resources, namely, registers and memory, the sequencer architectural resource can be subject to virtualization. This paper details the idea of Sequencer Virtualization (SV), a foundational architectural support to decouple architectural virtual sequencers from physical sequencers. SV enables more efficient utilization of sequencer resources at the microarchitectural level while maintaining a consistent programming interface at the architectural level. To evaluate the key tradeoffs for SV, we conduct extensive experiments by implementing a prototype SV system using a custom firmware on a large-scale multiprocessor system. Using the prototype SV system, we demonstrate that SV improves efficiency in sequencer utilization while incurring little performance overhead. In particular, for a set of real multithreaded workloads, SV can significantly improve sequencer utilization, achieving an average of 32% better wall-clock performance than MISP without SV support in a multi-programming environment.
29603719
On quadrilaterals in a graph
Abstract Let G be a graph of order 4k, where k is a positive integer. Suppose that the minimum degree of G is at least 2k. We show that G contains k−1 quadrilaterals and a subgraph of order 4 with at least 4 edges such that all of them are mutually vertex-disjoint.
7096747
A Performance Study of Secure Data Mining on the Cell Processor
This paper examines the potential of the Cell processor as a platform for secure data mining on the future volunteer computing systems. Volunteer computing platforms have the potential to provide massive computing power. However, privacy and security concerns prevent using volunteer computing for data mining of sensitive data. The Cell processor comes with a hardware security feature. The secure volunteer data mining can be achieved by using this hardware security feature. In this paper, we present a general security scheme for the volunteer computing, and a secure parallelized K-Means clustering algorithm for the Cell processor. We also evaluate the performance of the algorithm on the Cell secure system simulator. Evaluation results indicate that the proposed secure data clustering outperforms a non-secure clustering algorithm on the general purpose CPU, but incurs a huge performance overhead introduced by the decryption process of the Cell security features.
10264666
Processor Performance Modeling using Symbolic Simulation
We propose a method of analytically characterizing processor performance as a function of circuit latencies. In our approach, we modify traditional simulation to use variables instead of fixed latencies for the internal functional units. The simulation engine then algebraically computes execution times, and the result is a mathematical equation which characterizes the performance space across numerous processor configurations. We discuss the computational complexity issues of this approach and show that instruction chunking and simple equation redundancy checking can make this approach feasible-we can model a large multi-dimensional design space with thousands to millions of design parameter combinations for about 10times the simulation time of a single conventional simulation run. We demonstrate our approach by exploring two different machines: a traditional MlPS-style in-order pipeline and the Intel Graphics Media Accelerator X3000.