Simulation of Cyber-Physical Systems of Systems： Some Research Areas-Computational Understanding, Awareness, and Wisdom

After a brief emphasis about the interconnected world, including Cyber-Physical Systems of Systems, the increasing importance of the decision-making by autonomous, quasi-autonomous, and autonomic systems is emphasised. Promising roles of computational understanding, computational awareness, and computational wisdom for better autonomous decision-making are outlined. The contributions of simulation-based approaches are listed.

Encoding-Decoding-Based Control and Filtering of Networked Systems： Insights, Developments and Opportunities

In order to make the information transmission more efficient and reliable in a digital communication channel with limited capacity, various encoding-decoding techniques have been proposed and widely applied in many branches of the signal processing including digital communications, data compression,information encryption, etc. Recently, due to its promising application potentials in the networked systems(NSs), the analysis and synthesis issues of the NSs under various encoding-decoding schemes have stirred some research attention. However, because of the network-enhanced complexity caused by the limited network resources, it poses new challenges to the design of suitable encoding-decoding procedures to meet certain control or filtering performance for the NSs. In this survey paper, our aim is to present a comprehensive review of the encoding-decodingbased control and filtering problems for different types of NSs.First, some basic introduction with respect to the coding-decoding mechanism is presented in terms of its engineering insights,specific properties and theoretical formulations. Then, the recent representative research progress in the design of the encodingdecoding protocols for various control and filtering problems is discussed. Some possible further research topics are finally outlined for the encoding-decoding-based NSs.

IoT-based Smart and Complex Systems：A Guest Editorial Report

THE Industrial Revolution starting from about 1760 and ending at around 1840 has been viewed as the first Industrial Revolution.It features with the replacement of human and animal muscle power with steam and mechanical power.Human income per capita had taken 800 years to double by

STAHL CraneSystems：专家之选——斯泰尔新型SC环链葫芦

2012年6月8日，斯泰尔起重设备贸易（上海）有限公司在上海举行了内容丰富精彩的“斯泰尔客户日”活动，该活动由新品发布会和新品展示环节组成。就在一年前的这一天，斯泰尔上海刚刚举行了新办公楼乔迁典礼；恰好一年后，其以上海为总部向全球正式首发了公司最新产品——STAHL Crane Systems SC系列环链葫芦，并由此开启了新产品全球巡回推广的序幕。

3D SYSTEMS：新起点 新征程

2015年是3D打印技术持续火爆的一年，在过去的两年中．3D打印市场呈现了百花齐放百家争鸣的态势，无论是全球市场还是中国市场，都对3D打印的快速发展给予了高度的关注。

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.

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.

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.

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.

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.

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.

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.

A Distributionally Robust Optimization Scheduling Model for Regional Integrated Energy Systems Considering Hot Dry Rock Co-Generation

Hot dry rock(HDR)is rich in reserve,widely distributed,green,low-carbon,and has broad development potential and prospects.In this paper,a distributionally robust optimization(DRO)scheduling model for a regionally integrated energy system(RIES)considering HDR co-generation is proposed.First,the HDR-enhanced geothermal system(HDR-EGS)is introduced into the RIES.HDR-EGS realizes the thermoelectric decoupling of combined heat and power(CHP)through coordinated operation with the regional power grid and the regional heat grid,which enhances the system wind power(WP)feed-in space.Secondly,peak-hour loads are shifted using price demand response guidance in the context of time-of-day pricing.Finally,the optimization objective is established to minimize the total cost in the RIES scheduling cycle and construct a DRO scheduling model for RIES with HDR-EGS.By simulating a real small-scale RIES,the results show that HDR-EGS can effectively promote WP consumption and reduce the operating cost of the system.

Finite-time Prescribed Performance Time-Varying Formation Control for Second-Order Multi-Agent Systems With Non-Strict Feedback Based on a Neural Network Observer

This paper studies the problem of time-varying formation control with finite-time prescribed performance for nonstrict feedback second-order multi-agent systems with unmeasured states and unknown nonlinearities.To eliminate nonlinearities,neural networks are applied to approximate the inherent dynamics of the system.In addition,due to the limitations of the actual working conditions,each follower agent can only obtain the locally measurable partial state information of the leader agent.To address this problem,a neural network state observer based on the leader state information is designed.Then,a finite-time prescribed performance adaptive output feedback control strategy is proposed by restricting the sliding mode surface to a prescribed region,which ensures that the closed-loop system has practical finite-time stability and that formation errors of the multi-agent systems converge to the prescribed performance bound in finite time.Finally,a numerical simulation is provided to demonstrate the practicality and effectiveness of the developed algorithm.

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.

Fixed-Time Antidisturbance Consensus Tracking for Nonlinear Multiagent Systems With Matching and Mismatching Disturbances

In this paper,fixed-time consensus tracking for mul-tiagent systems(MASs)with dynamics in the form of strict feed-back affine nonlinearity is addressed.A fixed-time antidistur-bance consensus tracking protocol is proposed,which consists of a distributed fixed-time observer,a fixed-time disturbance observer,a nonsmooth antidisturbance backstepping controller,and the fixed-time stability analysis is conducted by using the Lyapunov theory correspondingly.This paper includes three main improvements.First,a distributed fixed-time observer is developed for each follower to obtain an estimate of the leader’s output by utilizing the topology of the communication network.Second,a fixed-time disturbance observer is given to estimate the lumped disturbances for feedforward compensation.Finally,a nonsmooth antidisturbance backstepping tracking controller with feedforward compensation for lumped disturbances is designed.In order to mitigate the“explosion of complexity”in the tradi-tional backstepping approach,we have implemented a modified nonsmooth command filter to enhance the performance of the closed-loop system.The simulation results show that the pro-posed method is effective.

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.

A Novel High-Efficiency Transaction Verification Scheme for Blockchain Systems

Blockchain can realize the reliable storage of a large amount of data that is chronologically related and verifiable within the system.This technology has been widely used and has developed rapidly in big data systems across various fields.An increasing number of users are participating in application systems that use blockchain as their underlying architecture.As the number of transactions and the capital involved in blockchain grow,ensuring information security becomes imperative.Addressing the verification of transactional information security and privacy has emerged as a critical challenge.Blockchain-based verification methods can effectively eliminate the need for centralized third-party organizations.However,the efficiency of nodes in storing and verifying blockchain data faces unprecedented challenges.To address this issue,this paper introduces an efficient verification scheme for transaction security.Initially,it presents a node evaluation module to estimate the activity level of user nodes participating in transactions,accompanied by a probabilistic analysis for all transactions.Subsequently,this paper optimizes the conventional transaction organization form,introduces a heterogeneous Merkle tree storage structure,and designs algorithms for constructing these heterogeneous trees.Theoretical analyses and simulation experiments conclusively demonstrate the superior performance of this scheme.When verifying the same number of transactions,the heterogeneous Merkle tree transmits less data and is more efficient than traditional methods.The findings indicate that the heterogeneous Merkle tree structure is suitable for various blockchain applications,including the Internet of Things.This scheme can markedly enhance the efficiency of information verification and bolster the security of distributed systems.