Adaptive Flight-Control Design Using Neural-Network-Aided Optimal Nonlinear Dynamic Inversion

A neural-network-aided nonlinear dynamic inversion-based hybrid technique of model reference adaptive control flight-control system design is presented in this paper. Here, the gains of the nonlinear dynamic inversion-based flight-control system are dynamically selected in such a manner that the resulting controller mimics a single network, adaptive control, optimal nonlinear controller for state regulation. Traditional model reference adaptive control methods use a linearized reference model, and the presented control design method employs a nonlinear reference model to compute the nonlinear dynamic inversion gains. This innovation of designing the gain elements after synthesizing the single network adaptive controller maintains the advantages that an optimal controller offers, yet it retains a simple closed-form control expression in state feedback form, which can easily be modified for tracking problems without demanding any a priori knowledge of the reference signals. The strength of the technique is demonstrated by considering the longitudinal motion of a nonlinear aircraft system. An extended single network adaptive control/nonlinear dynamic inversion adaptive control design architecture is also presented, which adapts online to three failure conditions, namely, a thrust failure, an elevator failure, and an inaccuracy in the estimation of C-M alpha. Simulation results demonstrate that the presented adaptive flight controller generates a near-optimal response when compared to a traditional nonlinear dynamic inversion controller.

Iterated stochastic filters with additive updates for dynamic system identification: Annealing-type iterations and the filter bank

A nonlinear stochastic filtering scheme based on a Gaussian sum representation of the filtering density and an annealing-type iterative update, which is additive and uses an artificial diffusion parameter, is proposed. The additive nature of the update relieves the problem of weight collapse often encountered with filters employing weighted particle based empirical approximation to the filtering density. The proposed Monte Carlo filter bank conforms in structure to the parent nonlinear filtering (Kushner-Stratonovich) equation and possesses excellent mixing properties enabling adequate exploration of the phase space of the state vector. The performance of the filter bank, presently assessed against a few carefully chosen numerical examples, provide ample evidence of its remarkable performance in terms of filter convergence and estimation accuracy vis-a-vis most other competing filters especially in higher dimensional dynamic system identification problems including cases that may demand estimating relatively minor variations in the parameter values from their reference states. (C) 2014 Elsevier Ltd. All rights reserved.

Influence of dynamic operating conditions on the performance of metal hydride based solid sorption cooling systems

The performance of metal hydride based solid sorption cooling systems depends on the driving pressure differential, and the rate of hydrogen transfer between coupled metal hydride beds during cooling and regeneration processes. Conventionally, the mid-plateau pressure difference obtained from `static' equilibrium PCT data are used for the thermodynamic analysis. It is well known that the processes are `dynamic' because the pressure and temperature, and hence the concentration of the hydride beds, are continuously changing. Keeping this in mind, the pair of La0.9Ce0.1Ni5 - LaNi4.7Al0.3 metal hydrides suitable for solid sorption cooling systems were characterised using both static and dynamic methods. It was found that the PCT characteristics, and the resulting enthalpy (Delta H) and entropy (Delta S) values, were significantly different for static and dynamic modes of measurements. In the present study, the solid sorption metal hydride cooling system is analysed taking in to account the actual variation in the pressure difference (Delta P) and the dynamic enthalpy values. Compared to `static' property based analysis, significant decrease in the driving potentials and transferrable amounts of hydrogen, leading to decrease in cooling capacity by 57.8% and coefficient of performance by 31.9% are observed when dynamic PCT data at the flow rate of 80 ml/min are considered. Copyright 2014 (C) Hydrogen Energy Publications, LLC. Published by Elsevier Ltd. All rights reserved.

Trace Driven Dynamic Deadlock Detection and Reproduction

Dynamic analysis techniques have been proposed to detect potential deadlocks. Analyzing and comprehending each potential deadlock to determine whether the deadlock is feasible in a real execution requires significant programmer effort. Moreover, empirical evidence shows that existing analyses are quite imprecise. This imprecision of the analyses further void the manual effort invested in reasoning about non-existent defects. In this paper, we address the problems of imprecision of existing analyses and the subsequent manual effort necessary to reason about deadlocks. We propose a novel approach for deadlock detection by designing a dynamic analysis that intelligently leverages execution traces. To reduce the manual effort, we replay the program by making the execution follow a schedule derived based on the observed trace. For a real deadlock, its feasibility is automatically verified if the replay causes the execution to deadlock. We have implemented our approach as part of WOLF and have analyzed many large (upto 160KLoC) Java programs. Our experimental results show that we are able to identify 74% of the reported defects as true (or false) positives automatically leaving very few defects for manual analysis. The overhead of our approach is negligible making it a compelling tool for practical adoption.

Effects of temperature and clay content on water absorption characteristics of modified MMT clay/cyclic olefin copolymer nanocomposite films: Permeability, dynamic mechanical properties and the encapsulated organic device performance

In the present study, amino-silane modified layered organosilicates were used to reinforce cyclic olefin copolymer to enhance the thermal, mechanical and moisture impermeable barrier properties. The optimum clay loading (4%) in the nanocomposite increases the thermal stability of the film while further loading decreases film stability. Water absorption behavior at 62 degrees C was carried out and compared with the behavior at room temperature and 48 degrees C. The stiffness of the matrix increases with clay content and the recorded strain to failure for the composite films was lower than the neat film. Dynamic mechanical analysis show higher storage modulus and low loss modulus for 2.5-4 wt% clay loading. Calcium degradation test and device encapsulation also show the evidence of optimum clay loading of 4 wt% for improved low water vapor transmission rates compared to other nanocomposite films. (C) 2014 Elsevier Ltd. All rights reserved.

A Distributed TDMA Slot Scheduling Algorithm for Spatially Correlated Contention in WSNs

In WSNs the communication traffic is often time and space correlated, where multiple nodes in a proximity start transmitting simultaneously. Such a situation is known as spatially correlated contention. The random access method to resolve such contention suffers from high collision rate, whereas the traditional distributed TDMA scheduling techniques primarily try to improve the network capacity by reducing the schedule length. Usually, the situation of spatially correlated contention persists only for a short duration, and therefore generating an optimal or suboptimal schedule is not very useful. Additionally, if an algorithm takes very long time to schedule, it will not only introduce additional delay in the data transfer but also consume more energy. In this paper, we present a distributed TDMA slot scheduling (DTSS) algorithm, which considerably reduces the time required to perform scheduling, while restricting the schedule length to the maximum degree of interference graph. The DTSS algorithm supports unicast, multicast, and broadcast scheduling, simultaneously without any modification in the protocol. We have analyzed the protocol for average case performance and also simulated it using Castalia simulator to evaluate its runtime performance. Both analytical and simulation results show that our protocol is able to considerably reduce the time required for scheduling.

Bayesian parameter identification in dynamic state space models using modified measurement equations

When Markov chain Monte Carlo (MCMC) samplers are used in problems of system parameter identification, one would face computational difficulties in dealing with large amount of measurement data and (or) low levels of measurement noise. Such exigencies are likely to occur in problems of parameter identification in dynamical systems when amount of vibratory measurement data and number of parameters to be identified could be large. In such cases, the posterior probability density function of the system parameters tends to have regions of narrow supports and a finite length MCMC chain is unlikely to cover pertinent regions. The present study proposes strategies based on modification of measurement equations and subsequent corrections, to alleviate this difficulty. This involves artificial enhancement of measurement noise, assimilation of transformed packets of measurements, and a global iteration strategy to improve the choice of prior models. Illustrative examples cover laboratory studies on a time variant dynamical system and a bending-torsion coupled, geometrically non-linear building frame under earthquake support motions. (C) 2015 Elsevier Ltd. All rights reserved.

Low Complexity Power and Scheduling Policies for Wireless Networks to Provide Quality of Service

We consider optimal power allocation policies for a single server, multiuser system. The power is consumed in transmission of data only. The transmission channel may experience multipath fading. We obtain very efficient, low computational complexity algorithms which minimize power and ensure stability of the data queues. We also obtain policies when the users may have mean delay constraints. If the power required is a linear function of rate then we exploit linearity and obtain linear programs with low complexity.

Performance of OFDM Systems With Best-m Feedback, Scheduling, and Delays for Uniformly Correlated Subchannels

Contemporary cellular standards, such as Long Term Evolution (LTE) and LTE-Advanced, employ orthogonal frequency-division multiplexing (OFDM) and use frequency-domain scheduling and rate adaptation. In conjunction with feedback reduction schemes, high downlink spectral efficiencies are achieved while limiting the uplink feedback overhead. One such important scheme that has been adopted by these standards is best-m feedback, in which every user feeds back its m largest subchannel (SC) power gains and their corresponding indices. We analyze the single cell average throughput of an OFDM system with uniformly correlated SC gains that employs best-m feedback and discrete rate adaptation. Our model incorporates three schedulers that cover a wide range of the throughput versus fairness tradeoff and feedback delay. We show that, for small m, correlation significantly reduces average throughput with best-m feedback. This result is pertinent as even in typical dispersive channels, correlation is high. We observe that the schedulers exhibit varied sensitivities to correlation and feedback delay. The analysis also leads to insightful expressions for the average throughput in the asymptotic regime of a large number of users.

An Implementation of Partitioned Scheduling Scheme for Hard Real-Time Tasks in Multicore Linux with Fair Share for Linux Tasks

The correctness of a hard real-time system depends its ability to meet all its deadlines. Existing real-time systems use either a pure real-time scheduler or a real-time scheduler embedded as a real-time scheduling class in the scheduler of an operating system (OS). Existing implementations of schedulers in multicore systems that support real-time and non-real-time tasks, permit the execution of non-real-time tasks in all the cores with priorities lower than those of real-time tasks, but interrupts and softirqs associated with these non-real-time tasks can execute in any core with priorities higher than those of real-time tasks. As a result, the execution overhead of real-time tasks is quite large in these systems, which, in turn, affects their runtime. In order that the hard real-time tasks can be executed in such systems with minimal interference from other Linux tasks, we propose, in this paper, an integrated scheduler architecture, called SchedISA, which aims to considerably reduce the execution overhead of real-time tasks in these systems. In order to test the efficacy of the proposed scheduler, we implemented partitioned earliest deadline first (P-EDF) scheduling algorithm in SchedISA on Linux kernel, version 3.8, and conducted experiments on Intel core i7 processor with eight logical cores. We compared the execution overhead of real-time tasks in the above implementation of SchedISA with that in SCHED_DEADLINE's P-EDF implementation, which concurrently executes real-time and non-real-time tasks in Linux OS in all the cores. The experimental results show that the execution overhead of real-time tasks in the above implementation of SchedISA is considerably less than that in SCHED_DEADLINE. We believe that, with further refinement of SchedISA, the execution overhead of real-time tasks in SchedISA can be reduced to a predictable maximum, making it suitable for scheduling hard real-time tasks without affecting the CPU share of Linux tasks.

Spatio-temporal correlations in aqueous systems: computational studies of static and dynamic heterogeneity by 2D-IR spectroscopy

Local heterogeneity is ubiquitous in natural aqueous systems. It can be caused locally by external biomolecular subsystems like proteins, DNA, micelles and reverse micelles, nanoscopic materials etc., but can also be intrinsic to the thermodynamic nature of the aqueous solution itself (like binary mixtures or at the gas-liquid interface). The altered dynamics of water in the presence of such diverse surfaces has attracted considerable attention in recent years. As these interfaces are quite narrow, only a few molecular layers thick, they are hard to study by conventional methods. The recent development of two dimensional infra-red (2D-IR) spectroscopy allows us to estimate length and time scales of such dynamics fairly accurately. In this work, we present a series of interesting studies employing two dimensional infra-red spectroscopy (2D-IR) to investigate (i) the heterogeneous dynamics of water inside reverse micelles of varying sizes, (ii) supercritical water near the Widom line that is known to exhibit pronounced density fluctuations and also study (iii) the collective and local polarization fluctuation of water molecules in the presence of several different proteins. The spatio-temporal correlation of confined water molecules inside reverse micelles of varying sizes is well captured through the spectral diffusion of corresponding 2D-IR spectra. In the case of supercritical water also, we observe a strong signature of dynamic heterogeneity from the elongated nature of the 2D-IR spectra. In this case the relaxation is ultrafast. We find remarkable agreement between the different tools employed to study the relaxation of density heterogeneity. For aqueous protein solutions, we find that the calculated dielectric constant of the respective systems unanimously shows a noticeable increment compared to that of neat water. However, the `effective' dielectric constant for successive layers shows significant variation, with the layer adjacent to the protein having a much lower value. Relaxation is also slowest at the surface. We find that the dielectric constant achieves the bulk value at distances more than 3 nm from the surface of the protein.

Direct measurements of growing amorphous order and non-monotonic dynamic correlations in a colloidal glass-former

The transformation of flowing liquids into rigid glasses is thought to involve increasingly cooperative relaxation dynamics as the temperature approaches that of the glass transition. However, the precise nature of this motion is unclear, and a complete understanding of vitrification thus remains elusive. Of the numerous theoretical perspectives(1-4) devised to explain the process, random first-order theory (RFOT; refs 2,5) is a well-developed thermodynamic approach, which predicts a change in the shape of relaxing regions as the temperature is lowered. However, the existence of an underlying `ideal' glass transition predicted by RFOT remains debatable, largely because the key microscopic predictions concerning the growth of amorphous order and the nature of dynamic correlations lack experimental verification. Here, using holographic optical tweezers, we freeze a wall of particles in a two-dimensional colloidal glass-forming liquid and provide direct evidence for growing amorphous order in the form of a static point-to-set length. We uncover the non-monotonic dependence of dynamic correlations on area fraction and show that this non-monotonicity follows directly from the change in morphology and internal structure of cooperatively rearranging regions(6,7). Our findings support RFOT and thereby constitute a crucial step in distinguishing between competing theories of glass formation.

Prediction of Queue Waiting Times for Metascheduling on Parallel Batch Systems

Prediction of queue waiting times of jobs submitted to production parallel batch systems is important to provide overall estimates to users and can also help meta-schedulers make scheduling decisions. In this work, we have developed a framework for predicting ranges of queue waiting times for jobs by employing multi-class classification of similar jobs in history. Our hierarchical prediction strategy first predicts the point wait time of a job using dynamic k-Nearest Neighbor (kNN) method. It then performs a multi-class classification using Support Vector Machines (SVMs) among all the classes of the jobs. The probabilities given by the SVM for the class predicted using k-NN and its neighboring classes are used to provide a set of ranges of predicted wait times with probabilities. We have used these predictions and probabilities in a meta-scheduling strategy that distributes jobs to different queues/sites in a multi-queue/grid environment for minimizing wait times of the jobs. Experiments with different production supercomputer job traces show that our prediction strategies can give correct predictions for about 77-87% of the jobs, and also result in about 12% improved accuracy when compared to the next best existing method. Experiments with our meta-scheduling strategy using different production and synthetic job traces for various system sizes, partitioning schemes and different workloads, show that the meta-scheduling strategy gives much improved performance when compared to existing scheduling policies by reducing the overall average queue waiting times of the jobs by about 47%.

Dynamic compression behavior of reactive spark plasma sintered ultrafine grained (Hf, Zr)B-2-SiC composites

This paper reports the dynamic compression behavior of ultrafine grained (Hf, Zr)B-2-SiC composites, sintered using reactive spark plasma sintering at 1600 degrees C for 10 min. Dynamic strength of similar to 2.3 GPa has been measured using Split Hopkinson Pressure Bar (SHPB) tests in a reproducible manner at strain rates of 800-1300 s(-1). A comparison with competing boride based armor ceramics, in reference to the spectrum of properties evaluated, establishes the potential of (Hf, Zr)B-2-SiC composites for armor applications. (C) 2015 Elsevier Ltd and Techna Group S.r.l. All rights reserved.