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.     

Your comments matter: incorporating viewers’ comments for ranking online video content using bibliometrics

ABSTRACT

The quality of user-generated content over World Wide Web media is a matter of serious concern for both creators and users. To measure the quality of content, webometric techniques are commonly used. In recent times, bibliometric techniques have been introduced to good effect for evaluation of the quality of user-generated content, which were originally used for scholarly data. However, the application of bibliometric techniques to evaluate the quality of YouTube content is limited to h-index and g-index considering only views. This paper advocates for and demonstrates the adaptation of existing Bibliometric indices including h-index, g-index and M-index exploiting both views and comments and proposes three indices h_vc, g_vc and m_vc for YouTube video channel ranking. The empirical results prove that the proposed indices using views along with the comments outperform the existing approaches on a real-world dataset of YouTube.     

An improved formalism for quantum computation based on geometric algebra—case study: Grover’s search algorithm

The Grover search algorithm is one of the two key algorithms in the field of quantum computing, and hence it is desirable to represent it in the simplest and most intuitive formalism possible. We show firstly, that Clifford’s geometric algebra, provides a significantly simpler representation than the conventional bra-ket notation, and secondly, that the basis defined by the states of maximum and minimum weight in the Grover search space, allows a simple visualization of the Grover search analogous to the precession of a spin- ${\frac{1}{2}}$ particle. Using this formalism we efficiently solve the exact search problem, as well as easily representing more general search situations. We do not claim the development of an improved algorithm, but show in a tutorial paper that geometric algebra provides extremely compact and elegant expressions with improved clarity for the Grover search algorithm. Being a key algorithm in quantum computing and one of the most studied, it forms an ideal basis for a tutorial on how to elucidate quantum operations in terms of geometric algebra—this is then of interest in extending the applicability of geometric algebra to more complicated problems in fields of quantum computing, quantum decision theory, and quantum information.     

Architecture of Integrated Data Clustering Machine

Data clustering is a significant information retrieval technique in today’s data intensive society. Over the last few decades a vast variety of huge number of data clustering algorithms have been designed and implemented for all most all data types. The quality of results of cluster analysis mainly depends on the clustering algorithm used in the analysis. Architecture of a versatile, less user dependent, dynamic and scalable data clustering machine is presented. The machine selects for analysis, the best av...     

Extended Kalman filter based speeds estimation of series-connected five-phase two-motor drive system

The multi-phase machines enables independent control of a few number of machines that are connected in series in a particular manner, and the supply is fed from a single voltage source inverter (VSI). The idea was first implemented for a five-phase series-connected two-motor drive system, but is now applicable to any number of phases. The number of series-connected machines is a function of the phase number of VSI. Variable speed induction motor drives without mechanical speed sensors at the motor shaft have the attractions of low cost and high reliability. To replace the sensor, information of the rotor speed is extracted from measured stator currents and voltages at motor terminals. Open-loop estimators or closed-loop observers are used for this purpose. They differ with respect to accuracy, robustness, and sensitivity against model parameter variations. This paper analyses operation of an EKF-based sensorless control of vector controlled series-connected two-motor five-phase drive system with current control in the stationary reference frame. Results, obtained with fixed voltage and fixed frequency supply fed and hysteresis current control, is presented for various operating conditions on the basis of simulation. The purpose of this paper is to report first time, the simulation results on a sensorless control of a five-phase two-motor series-connected drive system using EKF estimator.     

DeepClassRooms: a deep learning based digital twin framework for on-campus class rooms

Neural Computing and Applications - A lot of different methods are being opted for improving the educational standards through monitoring of the classrooms. The developed world uses Smart...     

Investigating the effect of varying block size on power and energy consumption of GPU kernels

The Journal of Supercomputing - Power consumption is likely to remain a significant concern for exascale performance in the foreseeable future. In addition, graphics processing units (GPUs) have...     

The Double Edge Sword Based Distributed Executor Service

Scalability is one of the most important quality attribute of software-intensive systems, because it maintains an effective performance parallel to the large fluctuating and sometimes unpredictable workload. In order to achieve scalability, thread pool system (TPS) (which is also known as executor service) has been used extensively as a middleware service in software-intensive systems. TPS optimization is a challenging problem that determines the optimal size of thread pool dynamically on runtime. In case of distributed-TPS (DTPS), another issue is the load balancing b/w available set of TPSs running at backend servers. Existing DTPSs are overloaded either due to an inappropriate TPS optimization strategy at backend servers or improper load balancing scheme that cannot quickly recover an overload. Consequently, the performance of software-intensive system is suffered. Thus, in this paper, we propose a new DTPS that follows the collaborative round robin load balancing that has the effect of a double-edge sword. On the one hand, it effectively performs the load balancing (in case of overload situation) among available TPSs by a fast overload recovery procedure that decelerates the load on the overloaded TPSs up to their capacities and shifts the remaining load towards other gracefully running TPSs. And on the other hand, its robust load deceleration technique which is applied to an overloaded TPS sets an appropriate upper bound of thread pool size, because the pool size in each TPS is kept equal to the request rate on it, hence dynamically optimizes TPS. We evaluated the results of the proposed system against state of the art DTPSs by a client-server based simulator and found that our system outperformed by sustaining smaller response times.     

Query-oriented topical influential users detection for top-k trending topics in twitter

Applied Intelligence - Online Social Networks (OSNs) have become inevitable for any new methodology both for viral promoting applications and instructing the creation of inciting information and...     

Evaluating Six Sigma failure rate for inverse Gaussian cycle times

Six Sigma is a quality philosophy and methodology that aims to achieve operational excellence and delighted customers. The cost of poor quality depends on the sigma quality level and its corresponding failure rate. Six Sigma provides a well-defined target of 3.4 defects per million. This failure rate is commonly evaluated under the assumption that the process is normally distributed and its specifications are two-sided. However, these assumptions may lead to implementation of quality-improvement strategies that are based on inaccurate evaluations of quality costs and profits. This paper defines the relationship between failure rate and sigma quality level for inverse Gaussian processes. The inverse Gaussian distribution has considerable applications in describing cycle times, product life, employee service times, and so on. We show that for these processes attaining Six Sigma target failure rate requires higher quality efforts than for normal processes. A generic model is presented to characterise cycle times in manufacturing systems. In this model, the asymptotic production is described by a drifted Brownian motion, and the cycle time is evaluated by using the first passage time theory of a Wiener process to a boundary. The proposed method estimates the right efforts required to reach Six Sigma goals.