Stable splitting scheme for general form of associated plasticity including different scales of space and time

An efficient implementation of the operator split procedure for boundary value solution with plastic flow computation is presented for a general form of associated plasticity model. We start with the general form of phenomenological model of plasticity where the yield criterion is not restricted to a simple (quadratic) form, and the elasticity tensor does not have constant entries. We then turn to the multi-scale model of plasticity which employs the fine scale representation of the plastic deformation along with the homogenization procedure for stress computation. We also visit the plasticity model with rate sensitive plastic response where plastic flow computation is carried out at fine scale in time. We proved herein the sufficient and necessary conditions for the proposed operator split procedure to converge, for any such general form of associated plasticity. Moreover, we presented a systematic manner for constructing the main ingredients for the plastic flow computation and the global Newton’s iteration, such as the consistent elastoplastic tangent.     

Virtual‐machine‐based heterogeneous checkpointing

Checkpointing an application is the act of saving the application's state during its execution on stable storage, so that if the application fails it can be restarted from the last saved state, thereby avoiding loss of the work that was already done. A heterogeneous checkpoint/restart mechanism allows one to restart an application on a possibly different hardware architecture and/or operating system than those in which the application was saved. This paper explores how to construct such a mechanism at the virtual machine level. That is, rather than dumping the entire state of the application process, the mechanism reported here dumps the state of the application as maintained by a virtual machine. During restart, the saved state is loaded into a new copy of the virtual machine, which continues running from there. The heterogeneous checkpoint/restart mechanism reported here was developed for the OCaml variant of ML. The paper reports on the main issues encountered in building such a mechanism and the design choices made, presents performance evaluations, and discusses some lessons and ideas for extending the work to native code OCaml and Java. Copyright © 2002 John Wiley & Sons, Ltd.     

On-line tuning strategy for model predictive controllers

This paper presents an intuitive on-line tuning strategy for linear model predictive control (MPC) algorithms. The tuning strategy is based on the linear approximation between the closed-loop predicted output and the MPC tuning parameters. By direct utilization of the sensitivity expressions for the closed-loop response with respect to the MPC tuning parameters, new values of the tuning parameters can be found to steer the MPC feedback response inside predefined time-domain performance specifications. Hence, the algorithm is cast as a simple constrained least squares optimization problem which has a straightforward solution. The simplicity of this strategy makes it more practical for on-line implementation. Effectiveness of the proposed strategy is tested on two simulated examples. One is a linear model for a three-product distillation column and the second is a non-linear model for a CSTR. The effectiveness of the proposed tuning method is compared to an exiting offline tuning method and showed superior performance.     

Minimal model generation for refined answering of generalized queries in disjunctive deductive databases

Generalized queries are defined as sets of clauses in implication form. They cover several tasks of practical importance for database maintenance such as answering positive queries, computing database completions and integrity constraints checking. We address the issue of answering generalized queries under the minimal model semantics for the class of disjunctive deductive databases (DDDBs). The advanced approach is based on having the query induce an order on the models returned by a sound and complete minimal model generating procedure. We consider answers that are true in all and those that are true in some minimal models of the theory. We address the issue of answering positive queries through the construction of the minimal model state of the DDDB, using a minimal model generating procedure. The refinements allowed by the procedure include isolating a minimal component of a disjunctive answer, the specification of possible updates to the theory to enable the derivability of certain queries and deciding the monotonicity properties of answers to different classes of queries.     

Wire antennas optimized using genetic algorithm

In this work, wire antennas are designed to jam GSM frequencies using genetic algorithms. These antennas are designed to block communication at 3-band GSM frequencies. They are planned to be mounted on a vehicle and therefore are modeled on a ground plane. Jammer antennas designed in this work are composed of wires, placed on two square dielectric frames, perpendicular to each other. Genetic optimization routines are developed on MATLAB environment for the designs carried out in this work. Electromagnetic simulation program called SuperNEC, which analyses antennas by the method of moments, is used to determine the antenna performances and is called by the developed GA routines. The purpose of the antenna optimization is to obtain low VSWR values and omni-directional radiation pattern near ground at θ = [70° 80° 90°] planes at all GSM frequencies, since the targets will be near ground for this application. Original and interesting antenna designs are obtained as the result of genetic optimization, and are presented in the paper.     

Cumulant-based inverse filters for blind deconvolution

Blind deconvolution of linear time-invariant (LTI) systems has received wide attention in various fields such as data communication and image processing. Blind deconvolution is concerned with the estimation of a desired input signal from a given set of measurements. This paper presents a technique for reconstructing the desired input from only the available corrupted data. The estimator is given in terms of an autoregressive moving average (ARMA) innovation model. This technique is based on higher order statistics (HOS) of a non-Gaussian output sequence in the presence of additive Gaussian or non-Gaussian noise. The algorithm solves a set of overdetermined linear equations using third-order cumulants of the given non-Gaussian measurements in the presence of additive Gaussian or non-Gaussian noise. The inverse filter is a finite impulse response (FIR) filter. Simulation results are provided to show the effectiveness of this method and compare it with a recently developed algorithm based on maximizing the magnitude of the kurtosis of estimate of the input excitation.     

Communication—Processor Tradeoffs in a Limited Resources PRAM

We consider a simple restriction of the PRAM model (called PPRAM), where the input is arbitrarily partitioned between a fixed set of p processors and the shared memory is restricted to m cells. This model allows for investigation of the tradeoffs/ bottlenecks with respect to the communication bandwidth (modeled by the shared memory size m ) and the number of processors p . The model is quite simple and allows the design of optimal algorithms without losing the effect of communication bottlenecks. We have focused on the PPRAM complexity of problems that have $\tilde{O}$ (n) sequential solutions (where n is the input size), and where m ≤ p ≤ n . We show essentially tight time bounds (up to logarithmic factors) for several problems in this model such as summing, Boolean threshold, routing, integer sorting, list reversal and k -selection. We get typically two sorts of complexity behaviors for these problems: One type is $\tilde{O}$ (n/p + p/m) , which means that the time scales with the number of processors and with memory size (in appropriate ranges) but not with both. The other is $\tilde{O}$ (n/m) , which means that the running time does not scale with p and reflects a communication bottleneck (as long as m < p ). We are not aware of any problem whose complexity scales with both p and m (e.g. $O(n/\sqrt{m \cdot p})$ ). This might explain why in actual implementations one often fails to get p -scalability for p close to n .     

Enhancing speed of SIMON: A light-weight-cryptographic algorithm for IoT applications

Multimedia Tools and Applications - Multimedia communication is revolutionizing all major spheres of human life. The advent of IoT and its applications in many fields like sensing, healthcare and...     

Selection of optimal denoising-based regularization hyper-parameters for performance improvement in a sensor validation model

Multilayered auto-associative neural architectures have widely been used in empirical sensor modeling. Typically, such empirical sensor models are used in sensor calibration and fault monitoring systems. However, simultaneous optimization of related performance metrics, i.e., auto-sensitivity, cross-sensitivity, and fault-detectability, is not a trivial task. Learning procedures for parametric and other relevant non-parametric empirical models are sensitive to optimization and regularization methods. Therefore, there is a need for active learning strategies that can better exploit the underlying statistical structure among input sensors and are simple to regularize and fine-tune. To this end, we investigated the greedy layer-wise learning strategy and denoising-based regularization procedure for sensor model optimization. We further explored the effects of denoising-based regularization hyper-parameters such as noise-type and noise-level on sensor model performance and suggested optimal settings through rigorous experimentation. A visualization procedure was introduced to obtain insight into the internal semantics of the learned model. These visualizations allowed us to suggest an implicit noise-generating process for efficient regularization in higher-order layers. We found that the greedy-learning procedure improved the overall robustness of the sensor model. To keep experimentation unbiased and immune to noise-related artifacts in real sensors, the sensor data were sampled from simulators of a nuclear steam supply system of a pressurized water reactor and a Tennessee Eastman chemical process. Finally, we compared the performance of an optimally regularized sensor model with auto-associative neural network, auto-associative kernel regression, and fuzzy similarity-based sensor models.