Hybridization of Metaheuristics Based Energy Efficient Scheduling Algorithm for Multi-Core Systems

The developments of multi-core systems(MCS)have considerably improved the existing technologies in thefield of computer architecture.The MCS comprises several processors that are heterogeneous for resource capacities,working environments,topologies,and so on.The existing multi-core technology unlocks additional research opportunities for energy minimization by the use of effective task scheduling.At the same time,the task scheduling process is yet to be explored in the multi-core systems.This paper presents a new hybrid genetic algorithm(GA)with a krill herd(KH)based energy-efficient scheduling techni-que for multi-core systems(GAKH-SMCS).The goal of the GAKH-SMCS tech-nique is to derive scheduling tasks in such a way to achieve faster completion time and minimum energy dissipation.The GAKH-SMCS model involves a multi-objectivefitness function using four parameters such as makespan,processor utilization,speedup,and energy consumption to schedule tasks proficiently.The performance of the GAKH-SMCS model has been validated against two datasets namely random dataset and benchmark dataset.The experimental outcome ensured the effectiveness of the GAKH-SMCS model interms of makespan,pro-cessor utilization,speedup,and energy consumption.The overall simulation results depicted that the presented GAKH-SMCS model achieves energy effi-ciency by optimal task scheduling process in MCS.

Intelligent fitting global real-time task scheduling strategy for high-performance multi-core systems

With the development of high-performance computing,it is possible to solve large-scale computing problems.However,the irregularity and access characteristics of computing problems bring challenges to the realisation and performance optimisation.Improving the performance of a single core makes it challenging to maintain Moore's law,and multi-core processors emerge.A chip brings together multiple universal processor cores of equal status and has the same structure supported by an isomorphic multi-core processor.In high-performance computing,the granularity of computing tasks leads to the complexity of scheduling strategies.Satisfying high system performance,load balancing and processor fault tolerance at a minimum cost is the key to task scheduling in the high-performance field,especially in specific multi-core hardware architecture.In this study,global real-time task scheduling is implemented in a high-performance multi-core system.The system adopts the hybrid scheduling among clusters and the intelligent fitting within clusters to implement the global real-time task scheduling strategy.In the cluster scheduling policy,tasks are allowed to preempt the core with low priority,and the priority of tasks that access memory is dynamically improved,higher than that of all the tasks without memory access.An intelligent fitting method is also proposed.When the data read by the task is in the cache and the cache access ability value of the task is within a reasonable threshold,the priority of the task is promoted to the highest priority,pre-empting the core without the access memory task.The results show that the intelligently fitting global scheduling strategy for multi-core systems has better performance in the nuclear utilisation rate and task schedulability.

Prescribed Performance Tracking Control of Time-Delay Nonlinear Systems With Output Constraints

The problem of prescribed performance tracking control for unknown time-delay nonlinear systems subject to output constraints is dealt with in this paper. In contrast with related works, only the most fundamental requirements, i.e., boundedness and the local Lipschitz condition, are assumed for the allowable time delays. Moreover, we focus on the case where the reference is unknown beforehand, which renders the standard prescribed performance control designs under output constraints infeasible. To conquer these challenges, a novel robust prescribed performance control approach is put forward in this paper.Herein, a reverse tuning function is skillfully constructed and automatically generates a performance envelop for the tracking error. In addition, a unified performance analysis framework based on proof by contradiction and the barrier function is established to reveal the inherent robustness of the control system against the time delays. It turns out that the system output tracks the reference with a preassigned settling time and good accuracy,without constraint violations. A comparative simulation on a two-stage chemical reactor is carried out to illustrate the above theoretical findings.

Computational Experiments for Complex Social Systems:Experiment Design and Generative Explanation

Powered by advanced information technology,more and more complex systems are exhibiting characteristics of the cyber-physical-social systems(CPSS).In this context,computational experiments method has emerged as a novel approach for the design,analysis,management,control,and integration of CPSS,which can realize the causal analysis of complex systems by means of“algorithmization”of“counterfactuals”.However,because CPSS involve human and social factors(e.g.,autonomy,initiative,and sociality),it is difficult for traditional design of experiment(DOE)methods to achieve the generative explanation of system emergence.To address this challenge,this paper proposes an integrated approach to the design of computational experiments,incorporating three key modules:1)Descriptive module:Determining the influencing factors and response variables of the system by means of the modeling of an artificial society;2)Interpretative module:Selecting factorial experimental design solution to identify the relationship between influencing factors and macro phenomena;3)Predictive module:Building a meta-model that is equivalent to artificial society to explore its operating laws.Finally,a case study of crowd-sourcing platforms is presented to illustrate the application process and effectiveness of the proposed approach,which can reveal the social impact of algorithmic behavior on“rider race”.

Computation Tree Logic Model Checking of Multi-Agent Systems Based on Fuzzy Epistemic Interpreted Systems

Model checking is an automated formal verification method to verify whether epistemic multi-agent systems adhere to property specifications.Although there is an extensive literature on qualitative properties such as safety and liveness,there is still a lack of quantitative and uncertain property verifications for these systems.In uncertain environments,agents must make judicious decisions based on subjective epistemic.To verify epistemic and measurable properties in multi-agent systems,this paper extends fuzzy computation tree logic by introducing epistemic modalities and proposing a new Fuzzy Computation Tree Logic of Knowledge(FCTLK).We represent fuzzy multi-agent systems as distributed knowledge bases with fuzzy epistemic interpreted systems.In addition,we provide a transformation algorithm from fuzzy epistemic interpreted systems to fuzzy Kripke structures,as well as transformation rules from FCTLK formulas to Fuzzy Computation Tree Logic(FCTL)formulas.Accordingly,we transform the FCTLK model checking problem into the FCTL model checking.This enables the verification of FCTLK formulas by using the fuzzy model checking algorithm of FCTL without additional computational overheads.Finally,we present correctness proofs and complexity analyses of the proposed algorithms.Additionally,we further illustrate the practical application of our approach through an example of a train control system.

Anomalous time-reversal symmetric non-Hermitian systems

The conditions for the emergence of the non-Hermitian skin effect, as a unique physical response of non-Hermitian systems, have now become one of the hot research topics. In this paper, we study the novel physical responses of nonHermitian systems with anomalous time-reversal symmetry, in both one dimension and two dimensions. Specifically, we focus on whether the systems will exhibit a non-Hermitian skin effect. We employ the theory of generalized Brillouin zone and also numerical methods to show that the anomalous time-reversal symmetry can prevent the skin effect in onedimensional non-Hermitian systems, but is unable to exert the same effectiveness in two-dimensional cases.

Conventional Geothermal Systems and Unconventional Geothermal Developments: An Overview

This paper provides an overview of conventional geothermal systems and unconventional geothermal developments as a common reference is needed for discussions between energy professionals. Conventional geothermal systems have the heat, permeability and fluid, requiring only drilling down to °C, normal heat flow or decaying radiogenic granite as heat sources, and used in district heating. Medium-temperature (MT) 100°C - 190°C, and high-temperature (HT) 190°C - 374°C resources are mostly at plate boundaries, with volcanic intrusive heat source, used mostly for electricity generation. Single well capacities are °C - 500°C) and a range of depths (1 m to 20 Km), but lack permeability or fluid, thus requiring stimulations for heat extraction by conduction. HVAC is 1 - 2 m deep and shallow geothermal down to 500 m in wells, both capturing °C, with °C are either advanced by geothermal developers at <7 Km depth (Enhanced Geothermal Systems (EGS), drilling below brittle-ductile transition zones and under geothermal fields), or by the Oil & Gas industry (Advanced Geothermal Systems, heat recovery from hydrocarbon wells or reservoirs, Superhot Rock Geothermal, and millimeter-wave drilling down to 20 Km). Their primary aim is electricity generation, relying on closed-loops, but EGS uses fractures for heat exchange with earthquake risks during fracking. Unconventional approaches could be everywhere, with shallow geothermal already functional. The deeper and hotter unconventional alternatives are still experimental, overcoming costs and technological challenges to become fully commercial. Meanwhile, the conventional geothermal resources remain the most proven opportunities for investments and development.

Numerical simulation for the initial state of avalanche in polydisperse particle systems

Numerical simulation is employed to investigate the initial state of avalanche in polydisperse particle systems.Nucleation and propagation processes are illustrated for pentadisperse and triadisperse particle systems,respectively.In these processes,particles involved in the avalanche grow slowly in the early stage and explosively in the later stage,which is clearly different from the continuous and steady growth trend in the monodisperse system.By examining the avalanche propagation,the number growth of particles involved in the avalanche and the slope of the number growth,the initial state can be divided into three stages:T1(nucleation stage),T2(propagation stage),T3(overall avalanche stage).We focus on the characteristics of the avalanche in the T2 stage,and find that propagation distances increase almost linearly in both axial and radial directions in polydisperse systems.We also consider the distribution characteristics of the average coordination number and average velocity for the moving particles.The results support that the polydisperse particle systems are more stable in the T2 stage.

Quantum discord and its dynamics for multipartite systems

Quantum discord, one of the famous quantum correlations, has been recently generalized to multipartite systems by Radhakrishnan et al. Here we give analytical solutions of the quantum discord for a family of N-qubit quantum states. For the bipartite system, we derive a zero quantum discord which will remain unchanged under the phase damping channel. For multiparitite systems, it is found that the quantum discord can be classified into three categories and the quantum discord for odd-partite systems can exhibit freezing under the phase damping channel, while the freezing does not exist in the even-partite systems.

Analysis and Design of Time-Delay Impulsive Systems Subject to Actuator Saturation

This paper investigates the exponential stability and performance analysis of nonlinear time-delay impulsive systems subject to actuator saturation. When continuous dynamics is unstable, under some conditions, it is shown that the system can be stabilized by a class of saturated delayed-impulses regardless of the length of input delays. Conversely, when the system is originally stable, it is shown that under some conditions, the system is robust with respect to sufficient small delayed-impulses. Moreover, the design problem of the controller with the goal of obtaining a maximized estimate of the domain of attraction is formulated via a convex optimization problem. Three examples are provided to demonstrate the validity of the main results.

Enhancing Security and Privacy in Distributed Face Recognition Systems through Blockchain and GAN Technologies

The use of privacy-enhanced facial recognition has increased in response to growing concerns about data securityand privacy in the digital age. This trend is spurred by rising demand for face recognition technology in a varietyof industries, including access control, law enforcement, surveillance, and internet communication. However,the growing usage of face recognition technology has created serious concerns about data monitoring and userprivacy preferences, especially in context-aware systems. In response to these problems, this study provides a novelframework that integrates sophisticated approaches such as Generative Adversarial Networks (GANs), Blockchain,and distributed computing to solve privacy concerns while maintaining exact face recognition. The framework’spainstaking design and execution strive to strike a compromise between precise face recognition and protectingpersonal data integrity in an increasingly interconnected environment. Using cutting-edge tools like Dlib for faceanalysis,Ray Cluster for distributed computing, and Blockchain for decentralized identity verification, the proposedsystem provides scalable and secure facial analysis while protecting user privacy. The study’s contributions includethe creation of a sustainable and scalable solution for privacy-aware face recognition, the implementation of flexibleprivacy computing approaches based on Blockchain networks, and the demonstration of higher performanceover previous methods. Specifically, the proposed StyleGAN model has an outstanding accuracy rate of 93.84%while processing high-resolution images from the CelebA-HQ dataset, beating other evaluated models such asProgressive GAN 90.27%, CycleGAN 89.80%, and MGAN 80.80%. With improvements in accuracy, speed, andprivacy protection, the framework has great promise for practical use in a variety of fields that need face recognitiontechnology. This study paves the way for future research in privacy-enhanced face recognition systems, emphasizingthe significance of using cutting-edge technology to meet rising privacy issues in digital identity.

Observer-based dynamic event-triggered control for distributed parameter systems over mobile sensor-plus-actuator networks

We develop a policy of observer-based dynamic event-triggered state feedback control for distributed parameter systems over a mobile sensor-plus-actuator network.It is assumed that the mobile sensing devices that provide spatially averaged state measurements can be used to improve state estimation in the network.For the purpose of decreasing the update frequency of controller and unnecessary sampled data transmission, an efficient dynamic event-triggered control policy is constructed.In an event-triggered system, when an error signal exceeds a specified time-varying threshold, it indicates the occurrence of a typical event.The global asymptotic stability of the event-triggered closed-loop system and the boundedness of the minimum inter-event time can be guaranteed.Based on the linear quadratic optimal regulator, the actuator selects the optimal displacement only when an event occurs.A simulation example is finally used to verify that the effectiveness of such a control strategy can enhance the system performance.

Designing Proportional-Integral Consensus Protocols for Second-Order Multi-Agent Systems Using Delayed and Memorized State Information

This paper is concerned with consensus of a secondorder linear time-invariant multi-agent system in the situation that there exists a communication delay among the agents in the network.A proportional-integral consensus protocol is designed by using delayed and memorized state information.Under the proportional-integral consensus protocol,the consensus problem of the multi-agent system is transformed into the problem of asymptotic stability of the corresponding linear time-invariant time-delay system.Note that the location of the eigenvalues of the corresponding characteristic function of the linear time-invariant time-delay system not only determines the stability of the system,but also plays a critical role in the dynamic performance of the system.In this paper,based on recent results on the distribution of roots of quasi-polynomials,several necessary conditions for Hurwitz stability for a class of quasi-polynomials are first derived.Then allowable regions of consensus protocol parameters are estimated.Some necessary and sufficient conditions for determining effective protocol parameters are provided.The designed protocol can achieve consensus and improve the dynamic performance of the second-order multi-agent system.Moreover,the effects of delays on consensus of systems of harmonic oscillators/double integrators under proportional-integral consensus protocols are investigated.Furthermore,some results on proportional-integral consensus are derived for a class of high-order linear time-invariant multi-agent systems.

A PID Tuning Approach for Inertial Systems Performance Optimization

In the practice of control the industrial processes, proportional-integral-derivative controller remains pivotal due to its simple structure and system performance-oriented tuning process. In this paper are presented two approaches for synthesis the proportional-integral-derivative controller to the models of objects with inertia, that offer the procedure of system performance optimization based on maximum stability degree criterion. The proposed algorithms of system performance optimization were elaborated for model of objects with inertia second and third order and offer simple analytical expressions for tuning the PID controller. Validation and verification are conducted through computer simulations using MATLAB, demonstrating successful performance optimization and showcasing the effectiveness PID controllers’ tuning. The proposed approaches contribute insights to the field of control, offering a pathway for optimizing the performance of second and third-order inertial systems through robust controller synthesis.

Interpolated Bumpless Transfer Control for Asynchronously Switched Linear Systems

This paper revisits the problem of bumpless transfer control(BTC) for discrete-time nondeterministic switched linear systems. The general case of asynchronous switching is considered for the first time in the field of BTC for switched systems. A new approach called interpolated bumpless transfer control(IBTC) is proposed, where the bumpless transfer controllers are formulated with the combination of the two adjacent modedependent controller gains, and are interpolated for finite steps once the switching is detected. In contrast with the existing approaches, IBTC does not necessarily run through the full interval of subsystems, as well as possesses the time-varying controller gains(with more flexibility and less conservatism) achieved from a control synthesis allowing for the stability and other performance of the whole switched system. Sufficient conditions ensuring stability and H_(∞) performance of the underlying system by IBTC are developed, and numerical examples verify the theoretical findings.

Reinforcement learning based adaptive control for uncertain mechanical systems with asymptotic tracking

This paper mainly focuses on the development of a learning-based controller for a class of uncertain mechanical systems modeled by the Euler-Lagrange formulation.The considered system can depict the behavior of a large class of engineering systems,such as vehicular systems,robot manipulators and satellites.All these systems are often characterized by highly nonlinear characteristics,heavy modeling uncertainties and unknown perturbations,therefore,accurate-model-based nonlinear control approaches become unavailable.Motivated by the challenge,a reinforcement learning(RL)adaptive control methodology based on the actor-critic framework is investigated to compensate the uncertain mechanical dynamics.The approximation inaccuracies caused by RL and the exogenous unknown disturbances are circumvented via a continuous robust integral of the sign of the error(RISE)control approach.Different from a classical RISE control law,a tanh(·)function is utilized instead of a sign(·)function to acquire a more smooth control signal.The developed controller requires very little prior knowledge of the dynamic model,is robust to unknown dynamics and exogenous disturbances,and can achieve asymptotic output tracking.Eventually,co-simulations through ADAMS and MATLAB/Simulink on a three degrees-of-freedom(3-DOF)manipulator and experiments on a real-time electromechanical servo system are performed to verify the performance of the proposed approach.

Hyperbolic Tangent Function-Based Protocols for Global/Semi-Global Finite-Time Consensus of Multi-Agent Systems

This paper investigates the problem of global/semi-global finite-time consensus for integrator-type multi-agent sys-tems.New hyperbolic tangent function-based protocols are pro-posed to achieve global and semi-global finite-time consensus for both single-integrator and double-integrator multi-agent systems with leaderless undirected and leader-following directed commu-nication topologies.These new protocols not only provide an explicit upper-bound estimate for the settling time,but also have a user-prescribed bounded control level.In addition,compared to some existing results based on the saturation function,the pro-posed approach considerably simplifies the protocol design and the stability analysis.Illustrative examples and an application demonstrate the effectiveness of the proposed protocols.

Computing large deviation prefactors of stochastic dynamical systems based on machine learning

We present a large deviation theory that characterizes the exponential estimate for rare events in stochastic dynamical systems in the limit of weak noise.We aim to consider a next-to-leading-order approximation for more accurate calculation of the mean exit time by computing large deviation prefactors with the aid of machine learning.More specifically,we design a neural network framework to compute quasipotential,most probable paths and prefactors based on the orthogonal decomposition of a vector field.We corroborate the higher effectiveness and accuracy of our algorithm with two toy models.Numerical experiments demonstrate its powerful functionality in exploring the internal mechanism of rare events triggered by weak random fluctuations.

Research on Multi-Core Processor Analysis for WCET Estimation

Real-time system timing analysis is crucial for estimating the worst-case execution time(WCET)of a program.To achieve this,static or dynamic analysis methods are used,along with targeted modeling of the actual hardware system.This literature review focuses on calculating WCET for multi-core processors,providing a survey of traditional methods used for static and dynamic analysis and highlighting the major challenges that arise from different program execution scenarios on multi-core platforms.This paper outlines the strengths and weaknesses of current methodologies and offers insights into prospective areas of research on multi-core analysis.By presenting a comprehensive analysis of the current state of research on multi-core processor analysis for WCET estimation,this review aims to serve as a valuable resource for researchers and practitioners in the field.