Adaptive Event-Triggered Time-Varying Output Group Formation Containment Control of Heterogeneous Multiagent Systems

In this paper,a class of time-varying output group formation containment control problem of general linear hetero-geneous multiagent systems(MASs)is investigated under directed topology.The MAS is composed of a number of tracking leaders,formation leaders and followers,where two different types of leaders are used to provide reference trajectories for movement and to achieve certain formations,respectively.Firstly,compen-sators are designed whose states are estimations of tracking lead-ers,based on which,a controller is developed for each formation leader to accomplish the expected formation.Secondly,two event-triggered compensators are proposed for each follower to evalu-ate the state and formation information of the formation leaders in the same group,respectively.Subsequently,a control protocol is designed for each follower,utilizing the output information,to guide the output towards the convex hull generated by the forma-tion leaders within the group.Next,the triggering sequence in this paper is decomposed into two sequences,and the inter-event intervals of these two triggering conditions are provided to rule out the Zeno behavior.Finally,a numerical simulation is intro-duced to confirm the validity of the proposed results.

Lyapunov-Based Output Containment Control of Heterogeneous Multi-Agent Systems With Markovian Switching Topologies and Distributed Delays

This paper considers the mean square output containment control problem for heterogeneous multi-agent systems(MASs)with randomly switching topologies and nonuniform distributed delays.By modeling the switching topologies as a continuous-time Markov process and taking the distributed delays into consideration,a novel distributed containment observer is proposed to estimate the convex hull spanned by the leaders'states.A novel distributed output feedback containment controller is then designed without using the prior knowledge of distributed delays.By constructing a novel switching Lyapunov functional,the output containment control problem is then solved in the sense of mean square under an easily-verifiable sufficient condition.Finally,two numerical examples are given to show the effectiveness of the proposed controller.

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.

Systemic immune-inflammation index combined with pediatric appendicitis score in assessing the severity and prognosis for paediatric appendicitis

BACKGROUND Pediatric appendicitis is a common cause of abdominal pain in children and is recognized as a significant surgical emergency.A prompt and accurate diagnosis is essential to prevent complications such as perforation and peritonitis.AIM To investigate the predictive value of the systemic immune-inflammation index(SII)combined with the pediatric appendicitis score(PAS)for the assessment of disease severity and surgical outcomes in children aged 5 years and older with appendicitis.METHODS Clinical data of 104 children diagnosed with acute appendicitis were analyzed.The participants were categorized into the acute appendicitis group and chronic appendicitis group based on disease presentation and further stratified into the good prognosis group and poor prognosis group based on prognosis.The SII and PAS were measured,and a joint model using the combined SII and PAS was constructed to predict disease severity and surgical outcomes.RESULTS Significant differences were observed in the SII and PAS parameters between the acute appendicitis group and chronic appendicitis group.Correlation analysis showed associations among the SII,PAS,and disease severity,with the combined SII and PAS model demonstrating significant predictive value for assessing disease severity[aera under the curve(AUC)=0.914]and predicting surgical outcomes(AUC=0.857)in children aged 5 years and older with appendicitis.CONCLUSION The study findings support the potential of integrating the SII with the PAS for assessing disease severity and predicting surgical outcomes in pediatric appendicitis,indicating the clinical utility of the combined SII and PAS model in guiding clinical decision-making and optimizing surgical management strategies for pediatric patients with appendicitis.

Distributed Adaptive Output Consensus of Unknown Heterogeneous Non-Minimum Phase Multi-Agent Systems

This article addresses the leader-following output consensus problem of heterogeneous linear multi-agent systems with unknown agent parameters under directed graphs.The dynamics of followers are allowed to be non-minimum phase with unknown arbitrary individual relative degrees.This is contrary to many existing works on distributed adaptive control schemes where agent dynamics are required to be minimum phase and often of the same relative degree.A distributed adaptive pole placement control scheme is developed,which consists of a distributed observer and an adaptive pole placement control law.It is shown that under the proposed distributed adaptive control scheme,all signals in the closed-loop system are bounded and the outputs of all the followers track the output of the leader asymptotically.The effectiveness of the proposed scheme is demonstrated by one practical example and one numerical example.

Emerging Trends in Social Networking Systems and Generation Gap with Neutrosophic Crisp Soft Mapping

This paper aims to introduce the novel concept of neutrosophic crisp soft set(NCSS),including various types of neutrosophic crisp soft sets(NCSSs)and their fundamental operations.We define NCS-mapping and its inverse NCS-mapping between two NCS-classes.We develop a robust mathematical modeling with the help of NCS-mapping to analyze the emerging trends in social networking systems(SNSs)for our various generations.We investigate the advantages,disadvantages,and natural aspects of SNSs for five generations.With the changing of the generations,it is analyzed that emerging trends and the benefits of SNSs are increasing day by day.The suggested modeling with NCS-mapping is applicable in solving various decision-making problems.

An Efficient Memory Management for Mobile Operating Systems Based on Prediction of Relaunch Distance

Recently,various mobile apps have included more features to improve user convenience.Mobile operating systems load as many apps into memory for faster app launching and execution.The least recently used(LRU)-based termination of cached apps is a widely adopted approach when free space of the main memory is running low.However,the LRUbased cached app termination does not distinguish between frequently or infrequently used apps.The app launch performance degrades if LRU terminates frequently used apps.Recent studies have suggested the potential of using users’app usage patterns to predict the next app launch and address the limitations of the current least recently used(LRU)approach.However,existing methods only focus on predicting the probability of the next launch and do not consider how soon the app will launch again.In this paper,we present a new approach for predicting future app launches by utilizing the relaunch distance.We define the relaunch distance as the interval between two consecutive launches of an app and propose a memory management based on app relaunch prediction(M2ARP).M2ARP utilizes past app usage patterns to predict the relaunch distance.It uses the predicted relaunch distance to determine which apps are least likely to be launched soon and terminate them to improve the efficiency of the main memory.

Consensus of Second-order Multi-agent Systems with Nonsymmetric Interconnection and Heterogeneous Delays

In this paper, a consensus algorithm of multi-agent second-order dynamical systems with nonsymmetric interconnection and heterogeneous delays is studied. With the hypothesis of directed weighted topology graph with a globally reachable node, decentralized consensus condition is obtained by applying generalized Nyquist criterion. For the systems with both communication and input delays, it is shown that the consensus condition is dependent on input delays but independent of communication delays.

Consensus of heterogeneous multi-agent systems based on sampled data with a small sampling delay

In this paper, consensus problems of heterogeneous multi-agent systems based on sampled data with a small sampling delay are considered. First, a consensus protocol based on sampled data with a small sampling delay for heterogeneous multi-agent systems is proposed. Then, the algebra graph theory, the matrix method, the stability theory of linear systems, and some other techniques are employed to derive the necessary and sufficient conditions guaranteeing heterogeneous multi-agent systems to asymptotically achieve the stationary consensus. Finally, simulations are performed to demonstrate the correctness of the theoretical results.

Containment control for heterogeneous multi-agent systems with time delay via an output regulation approach

This paper presents the containment analysis and design of heterogeneous linear multi-agent systems(MAS)with time-delay under the output regulation.The leaders are treated as exosystems and an modified output regulation error is designed,which can deal with more than one leader in containment control,then the containment problem will be turned into an output regulation problem.A novel analysis framework of the output regulation is proposed to design a dynamic state feedback control law for containment error and distributed observer when the agents cannot receive external system signal,which guarantees the convergence of all follower agents to the dynamic convex hull spanned by the leaders.The system stability for time-delay containment is proved by the output regulation method instead of the Lyapunov method.Finally,a numerical example is given to illustrate the validity of the theoretical results.

Generation of optimal persistent formations for heterogeneous multi-agent systems with a leader constraint

In this study, we consider the generation of optimal persistent formations for heterogeneous multi-agent systems, with the leader constraint that only specific agents can act as leaders. We analyze three modes to control the optimal persistent formations in two-dimensional space, thereby establishing a model for their constrained generation. Then, we propose an algorithm for generating the optimal persistent formation for heterogeneous multi-agent systems with a leader constraint （LC-HMAS-OPFGA）, which is the exact solution algorithm of the model, and we theoretically prove its validity. This algorithm includes two kernel sub-algorithms, which are optimal persistent graph generating algorithm based on a minimum cost arborescence and the shortest path （MCA-SP-OPGGA）, and the optimal persistent graph adjusting algorithm based on the shortest path （SP-OPGAA）. Under a given agent formation shape and leader constraint, LC-HMAS-OPFGA first generates the network topology and its optimal rigid graph corresponding to this formation shape. Then, LC-HMAS- OPFGA uses MCA-SP-OPGGA to direct the optimal rigid graph to generate the optimal persistent graph. Finally, LC- HMAS-OPFGA uses SP-OPGAA to adjust the optimal persistent graph until it satisfies the leader constraint. We also demonstrate the algorithm, LC-HMAS-OPFGA, with an example and verify its effectiveness.

Spatial snowdrift game in heterogeneous agent systems with co-evolutionary strategies and updating rules

We propose an evolutionary snowdrift game model for heterogeneous systems with two types of agents, in which the inner-directed agents adopt the memory-based updating rule while the copycat-like ones take the unconditional imitation rule; moreover, each＇agent can change his type to adopt another updating rule once the number he sequentially loses the game at is beyond his upper limit of tolerance. The cooperative behaviors of such heterogeneous systems are then investigated by Monte Carlo simulations. The numerical results show the equilibrium cooperation frequency and composition as functions of the cost-to-benefit ratio r are both of plateau structures with discontinuous steplike jumps, and the number of plateaux varies non-monotonically with the upper limit of tolerance VT as well as the initial composition of agents faO. Besides, the quantities of the cooperation frequency and composition are dependent crucially on the system parameters including VT, faO, and r. One intriguing observation is that when the upper limit of tolerance is small, the cooperation frequency will be abnormally enhanced with the increase of the cost-to-benefit ratio in the range of 0 〈 r 〈 1/4. We then probe into the relative cooperation frequencies of either type of agents, which are also of plateau structures dependent on the system parameters. Our results may be helpful to understand the cooperative behaviors of heterogenous agent systems.

On Multi-Granulation Rough Sets with Its Applications

Recently,much interest has been given tomulti-granulation rough sets (MGRS), and various types ofMGRSmodelshave been developed from different viewpoints. In this paper, we introduce two techniques for the classificationof MGRS. Firstly, we generate multi-topologies from multi-relations defined in the universe. Hence, a novelapproximation space is established by leveraging the underlying topological structure. The characteristics of thenewly proposed approximation space are discussed.We introduce an algorithmfor the reduction ofmulti-relations.Secondly, a new approach for the classification ofMGRS based on neighborhood concepts is introduced. Finally, areal-life application from medical records is introduced via our approach to the classification of MGRS.

基于System Generator的卷积加速结构设计与实现

为解决卷积神经网络中卷积运算耗时长、运算复杂的问题,针对卷积运算的并行性特征,提出一种基于分块的流水线加速方法,并基于该方法在System Generator上进行了电路设计。通过在FPGA(Field-programmable Gate Array)上进行实验验证,该设计模型能正确输出卷积运算结果;在结构和输入数据相同的情况下,该设计模型在计算速度上相比于普通CPU最高可加速258倍,相比于服务器级CPU提高了近40倍,具有良好的加速效果。

About the Thermodynamics and Aging of Self-Organizing Systems

We know that the total daily energy dissipation increases in complex organisms like the humans. It’s very probable that this increase in total energy dissipation is related to the progressive increase in mass. But we also know that day by day the dissipation of energy per unit mass decreases in these organisms. We intend to verify if this decrease is only an expression of the second law of thermodynamics, or if it is related to the increase in mass that occurs in these organisms. For this, we set ourselves the following objectives: verify the correlation between total energy dissipation and the evolution of body mass, and verify the correlation between the dissipation of energy per unit of mass and the evolution of body mass. As a result of the data analysis, we found a high degree of correlation between total energy dissipation and the evolution of body mass. And we also found a high correlation between the energy dissipated per unit of mass and the evolution of body mass. We can conclude that self-organization produces not only an increase in mass, but also a decline in energy dissipation per unit mass beyond what is expected by the second law of thermodynamics.

A Secure Key Management Scheme for Heterogeneous Secure Vehicular Communication Systems

Intelligent transportation system （ITS） is proposed as the most effective way to improve road safety and traffic efficiency. However, the future of ITS for large scale transportation infrastructures deployment highly depends on the security level of vehicular communication systems （VCS）. Security applications in VCS are fulfilled through secured group broadcast. Therefore, secure key management schemes are considered as a critical research topic for network security. In this paper, we propose a framework for providing secure key management within heterogeneous network. The seeurity managers （SMs） play a key role in the framework by retrieving the vehicle departnre infi^rmation, encapsulating block to transport keys and then executing rekeying to vehicles within the same security domain. The first part of this framework is a novel Group Key Management （GKM） scheme basing on leaving probability （LP） of vehicles to depart current VCS region. Vehicle＇s LP factor is introduced into GKM scheme to achieve a more effieient rekeying scheme and less rekeying costs. The second component of the framework using the blockchain concept to simplify the distributed key management in heterogeneous VCS domains. Extensive simulations and analysis are provided to show the effectiveness and effieiency of the proposed framework： Our GKM results demonstrate that probability-based BR reduees rekeying eost compared to the benchmark scheme, while the blockchain deereases the time eost of key transmission over heterogeneous net-works.

Integrating XML with CORBA-Based Multidatabase Systems

In this paper, we first introduce the architecture for a CORBA-based multidatabase system and then give an approach of schema mapping between XML and relational database system. Finally, we investigate the ability to apply the integration of XML with CORBA-based multidatabase systems. This integration extends the ability of a CORBA-based multidatabase system to implement data sharing and interoperability. Key words heterogeneity - XML - schema mapping - multidatabase systems CLC number TP311. 13 Foundation item: Supported by the National Key Technologies R&D Program of China(2002BA103A04)Biography: LI Rui-xuan(1974-), male, Ph. D candidate, research interests: heterogeneous information integration.

Vehicle Operating, Accident and User Time Costs in Pavement Management Systems： Approach for Portuguese Conditions

This paper presents a description and analysis of the most important models to predict each of the Road User Costs components （Vehicle Operating Costs, Accident Costs and Value of Time） and proposes a model for estimating RUC components suitable for the Portuguese road network. These results are part of a research which aimed to obtain a Road User Cost Model to be used as a tool in road management systems. This model is different from other models by the fact that it includes a simple formulation that allows calibration and calculation of cost parameters, for any year, in a simple and fast way, providing trustworthy results. The required data is already available in Portuguese institutions, allowing periodic revision of cost parameters to insure accuracy.

Finite-time consensus of heterogeneous multi-agent systems

We investigate the finite-time consensus problem for heterogeneous multi-agent systems composed of first-order and second-order agents.A novel continuous nonlinear distributed consensus protocol is constructed,and finite-time consensus criteria are obtained for the heterogeneous multi-agent systems.Compared with the existing results,the stationary and kinetic consensuses of the heterogeneous multi-agent systems can be achieved in a finite time respectively.Moreover,the leader can be a first-order or a second-order integrator agent.Finally,some simulation examples are employed to verify the efficiency of the theoretical results.