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...     

BSLPSDN: Base station location privacy via software-defined networking (SDN) in wireless sensor networks

Base station's location privacy in a wireless sensor network (WSN) is critical for information security and operational availability of the network. A key part of securing the base station from potential compromise is to secure the information about its physical location. This paper proposes a technique called base station location privacy via software-defined networking (SDN) in wireless sensor networks (BSLPSDN). The inspiration comes from the architecture of SDN, where the control plane is separated from the data plane, and where control plane decides the policy for the data plane. BSLPSDN uses three categories of nodes, namely, a main controller to instruct the overall operations, a dedicated node to buffer and forward data, and lastly, a common node to sense and forward the packet. We employ three kinds of nodes to collaborate and achieve stealth for the base station and thus protecting it against the traffic-analysis attacks. Different traits of the WSN including energy status and traffic density can actively be monitored by BSLPSDN, which positively affects the energy goals, expected life of the network, load on common nodes, and the possibility of creating diversion in the wake of an attack on the base station. We incorporated multiple experiments to analyze and evaluate the performance of our proposed algorithm. We use single controller with multiple sensor nodes and multiple controllers with multiple sensor nodes to show the level of anonymity of BS. Experiments show that providing BS anonymity via multiple controllers is the best method both in terms of energy and privacy.     

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...     

Autonomous Magnetic Microrobots by Navigating Gates for Multiple Biomolecules Delivery

The precise delivery of biofunctionalized matters is of great interest from the fundamental and applied viewpoints. In spite of significant progress achieved during the last decade, a parallel and automated isolation and manipulation of rare analyte, and their simultaneous on‐chip separation and trapping, still remain challenging. Here, a universal micromagnet junction for self‐navigating gates of microrobotic particles to deliver the biomolecules to specific sites using a remote magnetic field is described. In the proposed concept, the nonmagnetic gap between the lithographically defined donor and acceptor micromagnets creates a crucial energy barrier to restrict particle gating. It is shown that by carefully designing the geometry of the junctions, it becomes possible to deliver multiple protein‐functionalized carriers in high resolution, as well as MCF‐7 and THP‐1 cells from the mixture, with high fidelity and trap them in individual apartments. Integration of such junctions with magnetophoretic circuitry elements could lead to novel platforms without retrieving for the synchronous digital manipulation of particles/biomolecules in microfluidic multiplex arrays for next‐generation biochips.