In the era of industrial evolution satellites are being viewed as swarm intelligence that do not relies on single system but multiple constellations collaborate autonomously. This has enhanced the potential of the GNSS system to contribute in the improved position, navigation and timing (PNT) services. However, Multipath (MP) and Non-line-of-sight (NLOS) receptions remain the prominent vulnerability for GNSS in harsh environments. The aim of this research is to investigate its impact of MP and NLOS on GNSS performance and then proposed a Received Signal Quality Monitoring (RSQM) algorithm. RSQM works twofold: Initially it performs a signal quality test based on fuzzy inference system. The input parameters are Carrier-to-Noise ratio (CNR), Range Residuals (RR) and Code-Carrier Divergence (CCD) and it computes the membership functions based on mamdani method and classify the signal quality as LOS, NLOS, weak NLOS, and strong NLOS. Secondly, it performs an adaptive navigation strategy to exclude/mask the affected range measurements, while considering the satellite geometry constraints (i.e., DOP≤2).. For this purpose, comprehensive research to quantify the multi-constellation GNSS receiver with four constellation configuration (GPS,BeiDou, GLONASS and Galileo) has been carried out in various operating environments. This RSQM based GNSS receiver has capability to identify signal quality and perform adaptive navigation accordingly to improve the navigation performance. The results suggest that GNSS performance in terms of position error is improved from 5.4m to 2.3m averagely in the complex urban environment. Accumulating RSQM with GNSS has great potential for future industrial revolution (Industry 5.0) making things automatic and sustainable like autonomous vehicle operation.

Wireless Sensor Networks (WSN) is designed to collect information across a large number of limited battery sensor nodes. Therefore, it is important to minimize the energy consumption of each node, which leads to the extension of the network life. Our goal is to design an intelligent WSN that collects as much information as possible to process it intelligently. To achieve this goal, an agent has been migrated to each node in order to process the information and to cooperate with these neighboring nodes while Mobile Agents (MA) can be used to reduce information between nodes and send those to the base station (Sink). This work proposes to use communication architecture for wireless sensor networks based on the Multi Agent System (MAS) to ensure optimal information collection. The collaboration of these agents generates a simple message that summarizes the important information in order to transmit it by a mobile agent. To reduce the size of the MA, the nodes of the network have been grouped into sector. As for each MA, we have established an optimal itinerary, consuming a minimum amount of energy with the data aggregation efficiency in a minimum time. Successive simulations in large scale wireless sensor networks through the SINALGO simulator show the performance of our proposal, in terms of energy consumption and package delivery rate.

This paper presents a novel approach to designing beam codebooks for downlink multiuser hybrid multiple input multiple output (MIMO) wireless communication systems, leveraging multi-agent reinforcement learning (MARL). The primary objective is to develop an environment-specific beam codebook composed of non-interfering beams, learned by cooperative agents within the MARL framework. Machine learning (ML) based beam codebook design for downlink communications have been based on channel state information (CSI) feedback or only reference signal received power (RSRP) consisting of an offline training and user clustering phase. In massive MIMO, the full CSI feedback data is of large size and is resource-intensive to process, making it challenging to implement efficiently. RSRP alone for a stand-alone base station is not a good marker of the position of a receiver. Hence, in this work, uplink CSI estimated at the base station along with feedback of RSRP and binary acknowledgment of the accuracy of received data is utilized to design the beamforming codebook at the base station. Simulations using sub-array antenna and ray-tracing channel demonstrate the proposed system’s ability to learn topography-aware beam codebook for arbitrary beams serving multiple user groups simultaneously. The proposed method extends beyond mono-lobe and fixed beam architectures by dynamically adapting arbitrary shaped beams to avoid inter-beam interference, enhancing overall system performance. This work leverages MARL’s potential in creating efficient beam codebooks for hybrid MIMO systems, paving the way for enhanced multiuser communication in future wireless networks.

In this work, we propose a self-supervised multi-agent system that meets the online learning of clustering tasks for video behavior recognition spatio-temporal tasks. Encoding visual behavioral actions as discrete temporal sequence(DTS). Real-time clustering recognition task in a multi-agent system for continuous model building, training, and correction. Finally, we implemented a fully decentralized multi-agent system and completed its feasibility verification in a surveillance video application scenario on vehicle path clustering.

Unmanned Aerial Vehicles (UAVs) have become increasingly important in various applications, including environmental monitoring, disaster response, and surveillance, due to their flexibility, efficiency, and ability to access hard-to-reach areas. Effective path planning for multiple UAVs exploring a target area is crucial for maximizing coverage and operational efficiency. This study presents a novel approach to optimizing collaborative navigation for UAVs using Multi-Agent Reinforcement Learning (MARL). To enhance the efficiency of this process, we introduce the Adaptive Dimensionality Reduction (ADR) framework, which includes Autoencoders (AEs) and Principal Component Analysis (PCA) for dimensionality reduction and feature extraction. The ADR framework significantly reduces computational complexity by simplifying high-dimensional state spaces while preserving crucial information. Additionally, we incorporate communication modules to facilitate inter-UAV coordination, further improving path planning efficiency. Our experimental results demonstrate that the proposed approach significantly enhances exploration performance and reduces computational complexity, showcasing the potential of combining MARL with ADR techniques for advanced UAV navigation in complex environments.

In recent years, the viability of employing multi-agent reinforcement learning technology for adaptive traffic signal control has been extensively validated. However, owing to restricted communication among agents and the partial observability of the traffic environment, the process of mapping road network states to actions encounters numerous challenges. To address this problem, this paper proposes a multi-agent deep reinforcement learning model with an emphasis on communication content (CMARL). The model decouples the complex relationships between multi-signal agents through centralized training and decentralized execution. Specifically, we first pass the traffic state through an improved deep neural network to achieve the extraction of high-dimensional semantic information and the learning of the communication matrix. Then the agents selectively interact with each other based on the learned communication matrix and generate the final state features. Finally, the features are inputted to the QMIX network to achieve the final action selection. We compare the CMARL model with 6 other baseline algorithms in real traffic networks. The results show that CMARL can significantly reduce vehicle congestion, and run stably in various scenarios.

This paper represents the first investigation into the consensus problem of linear time-varying multi-agent systems utilizing an event-triggered communication scheme. First, a general event-triggered consensus control scheme is proposed for a general category of linear time-varying multi-agent systems. Under some suitable assumptions, it is demonstrated that all agents’ states will converge exponentially, with Zeno behaviour being ruled out. Second, the consensus problem in a network of linear time-varying multi-agent systems with a spanning tree is investigated using the proposed control strategy. It demonstrates that the consensus issue for the specified system can be reformulated as a stabilization problem for an error system through a time-varying linear transformation. Then, the event-triggered consensus problem is just a special instance of the general event-triggered consensus problem mentioned above. Finally, to illustrate the efficacy of the event-triggered method proposed in this study, simulation results are shown.

Smart Internet of Vehicles (IoVs) combined with Artificial Intelligence (AI) will contribute to vehicle decision-making in the Intelligent Transportation System (ITS). Multi-Vehicle Pursuit games (MVP), a multi-vehicle cooperative ability to capture mobile targets, is becoming a hot research topic gradually. Although there are some achievements in the field of MVP in the open space environment, the urban area brings complicated road structures and restricted moving spaces as challenges to the resolution of MVP games. We define an Observation-constrained MVP (OMVP) problem in this paper and propose a Transformer-based Time and Team Reinforcement Learning scheme (T3OMVP) to address the problem. First, a new multi-vehicle pursuit model is constructed based on decentralized partially observed Markov decision processes (Dec-POMDP) to instantiate this problem. Second, by introducing and modifying the transformer-based observation sequence, QMIX is redefined to adapt to the complicated road structure, restricted moving spaces and constrained observations, so as to control vehicles to pursue the target combining the vehicle’s observations. Third, a multi-intersection urban environment is built to verify the proposed scheme. Extensive experimental results demonstrate that the proposed T3OMVP scheme achieves significant improvements relative to state-of-the-art QMIX approaches by 9.66%~106.25%. Code is available at https://github.com/pipihaiziguai/T3OMVP.

In Ultra-wideband (UWB)-based wireless ranging or distance measurement, differentiation between line-of-sight~(LOS), non-line-of-sight~(NLOS), and multi-path (MP) conditions are important for precise indoor localization. This is because the accuracy of the reported measured distance in UWB ranging systems is directly affected by the measurement conditions (LOS, NLOS or MP). However, the major contributions in literature only address the binary classification between LOS and NLOS in UWB ranging systems. The MP condition is usually ignored. In fact, the MP condition also has a significant impact on the ranging errors of the UWB compared to the direct LOS measurement results. Though, the magnitudes of the error contained in MP conditions are generally lower than completely blocked NLOS scenarios. This paper addresses machine learning techniques for identification of the mentioned three classes (LOS, NLOS, and MP) in the UWB indoor localization system using an experimental data-set. The data-set was collected in different conditions at different scenarios in indoor environments. Using the collected real measurement data, we compare three machine learning (ML) classifiers, i.e., support vector machine (SVM), random forest (RF) based on an ensemble learning method, and multilayer perceptron (MLP) based on a deep artificial neural network, in terms of their performance. The results show that applying ML methods in UWB ranging systems are effective in identification of the above-mentioned three classes. In specific, the overall accuracy reaches up to 91.9% in the best-case scenario and 72.9% in the worst-case scenario. Regarding the F1-score, it is 0.92 in the best-case and 0.69 in the worst-case scenario. For reproducible results and further exploration, we (will) provide the publicly accessible experimental research data discussed in this paper at PUB - Publications at Bielefeld University. The evaluations of the three classifiers are conducted using the open-source python machine learning library scikit-learn.

The enhanced multi-objective symbolic discretization for time series (eMODiTS) method employs a flexible discretization scheme using different value cuts for each non-equal time interval, which requires a computational cost for evaluating each objective function. Therefore, surrogate models were implemented to minimize this disadvantage. Nevertheless, each solution found by eMODiTS is a different-sized vector, so the surrogate model must be able to handle data sets under this characteristic. Consequently, this work's contribution lies in analyzing the surrogate models' implementation on the time series discretization, where each potential scheme is a real-number different-sized vector. For this reason, the surrogate model proposed was k-nearest Neighbors for regression with Dynamic Time Warping as a distance measure. Results suggest our proposal finds a suitable approximation to the final eMODiTS solutions with a functions evaluation reduction rate between 15% and 95%. However, according to Pareto front performance measures, the proposal Pareto front is competitive compared to the eMODiTS Pareto front, reaching an average Generational Distance (GD) between 0.0447 and 0.0536. Moreover, the average Hypervolume Ratio (HVR) ranges between 0.334 and 0.3891. Finally, our proposal compared against SAX-based methods presents a similar behavior regarding classification tasks and statistical tests.

In this paper, we unite concepts from Husserlian phenomenology, the active inference framework in theoretical biology, and category theory in mathematics to develop a comprehensive framework for understanding social action premised on shared goals. We begin with an overview of Husserlian phenomenology, focusing on aspects of inner time consciousness, namely, retention, primal impression, and protention. We then review active inference as a formal approach to modeling agent behavior, based on variational (approximate Bayesian) inference. Expanding upon Husserl’s model of time consciousness, we consider collective goal-directed behavior, emphasizing shared protentions among agents and their connection to the shared generative models of active inference. This integrated framework aims to formalize shared goals in terms of shared protentions, and to thereby shed light on the emergence of group intentionality. Building on this foundation, we incorporate mathematical tools from category theory; particularly, sheaf and topos theory, to furnish a mathematical image of individual and group interactions within a stochastic environment. Specifically, we employ morphisms between polynomial representations of individual agent models, allowing predictions not only of their own behaviors but also those of other agents and environmental responses. Sheaf and topos theory facilitate the construction of coherent agent worldviews and provides a way of representing consensus or shared understanding. We explore the emergence of shared protentions, bridging the phenomenology of temporal structure, multi-agent active inference systems, and category theory. Shared protentions are highlighted as pivotal for coordination and achieving common objectives. We conclude by acknowledging the intricacies stemming from stochastic systems and uncertainties in realizing shared goals.

Large-scale crowd phenomena are complex to model because the behaviour of pedestrians needs to be described at both strategic, tactical, and operational levels and is impacted by the density of the crowd. Microscopic models manage to mimic the dynamics at low densities, whereas mesoscopic models achieve better performances in dense situations. This paper proposes and evaluates a novel agent-based architecture to enable agents to dynamically change their operational model based on local density. The ability to combine microscopic and mesoscopic models for multi-scale simulation is studied through a use case of pedestrians at the Festival of Lights, Lyon, France. Pedestrian outflow data is extracted from video recordings of exiting crowds at the festival. The hybrid model is calibrated and validated using a genetic algorithm that optimizes the match between simulated and observed outflow data. Additionally, a local sensitivity analysis is then conducted to identify the most sensitive parameters in the model. Finally, the performance of the hybrid model is compared to different models in terms of density map and computation time. The results demonstrate that the hybrid model has the capacity to effectively simulate pedestrians across varied density scenarios while optimizing computational performance compared to other models.

Many complex behaviours in biological systems emerge from large populations of interacting molecules or cells, generating functions that go beyond the capabilities of the individual parts. Such collective phenomena are of great interest to bioengineers due to their robustness and scalability. However, engineering emergent collective functions is difficult because they arise as a consequence of complex multi-level feedback, which often spans multiple length-scales. Here, we present a perspective on how some of these challenges could be overcome by using multi-agent modelling as a design framework within synthetic biology. Using case studies covering the construction of synthetic ecologies to biological computation and synthetic cellularity, we show how multi-agent modelling can capture the core features of complex multi-scale systems and provide novel insights into the underlying mechanisms which guide emergent functionalities across scales. The ability to unravel design rules underpinning these behaviours offers a means to take synthetic biology beyond single molecules or cells and towards the creation of systems with functions that can only emerge from collectives at multiple scales.

This paper proposes a multi-terminal adaptive collaborative operation method to solve the problem of unstable internal force tracking in clamping and handling unknown objects by multi-terminal robots. In the proposed method, the internal command force changes the complex internal force control problem into an internal force tracking problem from multi-slave to master. Moreover, we develop an algorithm for multi-slave setups to estimate object stiffness and motion uncertainty in the direction of the internal command force according to Lyapunov theory. Finally, the impedance control generates a reference trajectory for the multi-slave to maintain the desired internal force and track the master’s motion. Several experiments are conducted on a self-made robot equipped. The experimental results show that the oscillation amplitude of each slave end is less than 1 mm, the directional oscillation amplitude is less than 1 degree during the tracking of the desired commanded internal force. For objects with low stiffness, the error of the commanded internal force is less than 1 N (6%) per slave. The error in tracking the commanded internal force for objects with high stiffness is less than 2 N (8%). The results prove the feasibility and effectiveness of the proposed method.

Constructing the fundamental principles of intelligence and consciousness has become a significant scientific challenge. The literature indicates that current theories of intelligence and consciousness have yet to provide comprehensive answers regarding the unified structure, objectives, and significance of the entities generating intelligence and consciousness, the driving forces, the relationship between intelligence and consciousness, and the distinctions between different types of consciousness.This study extends von Neumann architecture to establish Standard Agent Model as an axiom, proposing that any system (agent) possesses five essential capabilities: Information input, output, storage, creation, and control over the use of these capabilities. By taking the maximum and minimum values for each of these five capabilities, two extreme states and two types of intelligence forces of the agent are derived. Inspired by the principles of flight, the above elements are combined to establish the “Flight Model (FM)” of intelligence and consciousness. Intelligence is defined as the agent’s ability to utilize the five capabilities comprehensively to evolve between the two extreme states under the influence of intelligence forces. Consciousness is defined as the agent’s ability to control the use of intelligence under the influence of the two types of intelligence forces. Based on the relationship between control and being controlled, consciousness is further subdivided into self-consciousness, other-consciousness, mix consciousness, and unconsciousness.This study evaluates the intelligence levels and self-awareness of various agents based on the FM theoretical framework through designed experiments. The results show that current artificial intelligence systems exhibit intelligence close to adult human levels but have not yet demonstrated self-consciousness. This study constructs a theoretical system of intelligence and consciousness, providing a theoretical basis for determining the timeline for achieving AGI and addressing AI self-consciousness issues.

In order to make full use of the complementarity of existing navigation systems to improve the navigation and positioning accuracy, this paper investigates the visual/INS integrated navigation system based on the factor graph optimization (FGO) algorithm. In the traditional visual/INS integrated navigation system, there is often the problem of image blurring due to the rapid change of light and shadow captured by the vision sensor and the attitude change of the carrier, which leads to the decrease of the positioning accuracy of the combined navigation system. Therefore, this paper firstly introduces Retinex algorithm and BID algorithm to carry out the design of image de-blurring method; then implements the visual/INS integrated navigation algorithm based on the factor graph optimization method; finally, the experimental scheme is designed, comparative experiments are carried out, and the researched method is verified by using the public dataset. The experimental results show that the combined navigation algorithm realized in this paper has high accuracy, and its positioning accuracy is improved by 40% compared with visual positioning.

This paper investigates a Local Strategy-Driven Multi-Agent Deep Deterministic Policy Gradient (LSD-MADDPG) method for demand-side energy management systems (EMS) in smart communities. Addressing critical challenges in EMS solutions such as data overhead, single-point failures, nonstationary environments, and scalability, the proposed LSD-MADDPG effectively harmonizes individual building needs with entire community energy management goals. By leveraging and sharing only strategic information among agents, the proposed approach demonstrates to optimize the EMS decision-making processes, while enhancing training efficiency and safeguarding data privacy - a critical concern in the community setting. The proposed LSD-MADDPG has proven to be capable of reducing energy costs and flattening community demand curve by coordinating indoor temperature control and electric vehicle charging schedules across multiple buildings. Comparative case studies reveal that LSD-MADDPG excels in both cooperative and competitive settings, aligning individual buildings’ energy management actions with overall community goals in a fair manner, highlighting its potential for future smart community energy management advancements.

This paper addresses the critical issue of trust in Artificial Intelligence systems, especially when users might find it challenging to comprehend the internal decision-making processes of such systems. A relevant topic of research in this respect is Theory of Mind, which involves attempting to understand these systems as if they possessed beliefs, desires, and intentions. We focus on the latter: intentions, and we examine how producing explanations based on them can improve \emph{understandability} while allowing for a better interpretation of how they align with human values. We also review some existing methods for identifying intentions in AI systems and we conclude with a discussion on possible future directions in this line of research.

Machine learning offers advanced tools for efficient management of radio resources in modern wireless networks. In this study, we leverage a multi-agent deep reinforcement learning (DRL) approach, specifically the Parameterized Deep Q-Network (DQN), to address the challenging problem of power allocation and user association in massive multiple-input multiple-output (M-MIMO) communication networks. Our approach tackles a multi-objective optimization problem aiming to maximize network utility while meeting stringent quality of service requirements in M-MIMO networks. To address the non-convex and nonlinear nature of this problem, we introduce a novel multi-agent DQN framework. This framework defines a large action space, state space, and reward functions, enabling us to learn a near-optimal policy. Simulation results demonstrate the superiority of our Parameterized Deep DQN (PD-DQN) approach when compared to traditional DQN and RL methods. Specifically, we show that our approach outperforms traditional DQN methods in terms of convergence speed and final performance. Additionally, our approach shows 72.2 % and 108.5 % improvement over DQN methods and RL method respectively in handling large-scale multi-agent problems in M-MIMO networks.

The rationalization and modeling of an electric discharge in a fluid require the knowledge of electron swarm parameters. In this work, transport coefficients of alcohols, including methanol, ethanol, propanol, and butanol are reported. The electron energy distribution function, mean energy, reduced mobility, and diffusion coefficient, are calculated using the two-term expansion of the electron Boltzmann equation in the frame of BOLSIG+ and the Monte Carlo collision code METHES. For such, experimental and theoretical values of the electron-alcohol collision cross-section, covering a range of electron impact energy from 1 eV to 1000 eV, are employed. A temperature of 300K, reduced fields E/N between $1-10^4$ Td (1Td = $10^{-21}~\rm Vm^2$), and Plasma density of $10^{19}~\rm m^{-3}$ were used in simulations. The calculated coefficients are compared with data available from previous studies.

In this study we present a hybrid approach of ACO with fuzzy logic and clustering methods to solve multi-objective path planning problems in case of swarm USVs. This study aims to enhance the performance of ACO algorithm by integrating fuzzy logic in order to cope with the multiple contradicting objectives and generate quality solutions by in parallel identifying the mission areas of each USV to reach the desired targets. The objectives that are taken into account are the minimization of traveled distance and energy consumption, and the maximization of path smoothness. A comparative evaluation is conducted among ACO and fuzzy inference systems, Mamdani (ACO-M) and Takagi–Sugeno–Kang (ACO-TSK). The results showed that depending on the needs of the application, each methodology can contribute respectively. ACO-M generates better paths but ACO-TSK presents higher computation efficiency.

Robotic odor source localization (OSL) is a technology that enables mobile robots or autonomous vehicles to find an odor source in unknown environments. An effective navigation algorithm that guides the robot to approach the odor source is the key to successfully locating the odor source. While traditional OSL approaches primarily utilize an Olfaction-only strategy, guiding robots to find the odor source by tracing emitted odor plumes, our work introduces a fusion navigation algorithm that combines both vision and olfaction-based techniques. This hybrid approach addresses challenges such as turbulent airflow, which disrupts olfaction sensing, and physical obstacles inside the search area, which may impede vision detection. In this work, we propose a hierarchical control mechanism that dynamically shifts the robot’s search behavior among four strategies: crosswind maneuver, Obstacle-avoid Navigation, Vision-based Navigation, and Olfaction-based Navigation. Our methodology includes a custom-trained deep-learning model for visual target detection and a moth-inspired algorithm for Olfaction-based navigation. To assess the effectiveness of our approach, we implemented the proposed algorithm on a mobile robot in a search environment with obstacles. Experimental results demonstrate that our Vision and Olfaction Fusion algorithm significantly outperforms Vision-only and Olfaction-only methods, reducing average search time by 54% and 30%, respectively.

This study assesses the impact of incorporating an adaptive learning mechanism into an agent-based model (ABMS) simulating behavior on a university campus during the course of a pandemic outbreak, with a particular case on the COVID-19 pandemic. The aim is to reduce overcrowding and infections on campus through the use of Reinforcement Learning (RL). Our findings indicate that RL is a viable approach for effectively representing agents’ behavior within this context. The results reveal specific temporal patterns of overcrowding violations. While our study successfully mitigated campus crowding, it had limited influence on altering the course of the epidemic. This highlights the necessity for comprehensive epidemic control strategies that consider the role of individual decision-making influenced by adaptive learning, along with the implementation of targeted interventions. This research significantly contributes to our understanding of adaptive learning within complex systems and offers valuable insights for shaping future public health policies in similar community settings. Future research directions encompass exploring various parameter settings and updating representations of the disease’s natural history.

The multi-UAV target search problem is crucial in the field of autonomous Unmanned Aerial Vehicle (UAV) decision-making. The algorithm design of Multi-agent Reinforcement Learning (MARL) methods has become integral to research on multi-UAV target search, due to its adaptability to the rapid online decision-making required by UAVs in complex, uncertain environments. In non-cooperative target search scenarios, targets may have the ability to escape, complicating UAVs' search efforts and hindering the convergence of the MARL algorithm training. This paper investigates the multi-UAV target search problem in scenarios involving static obstacles and dynamic escape targets, modeling the problem within the framework of Decentralized Partially Observable Markov Decision Process. Based on this model, a Spatio-Temporal Efficient Exploration network and a Global Convolutional Local Ascent mechanism are proposed. Subsequently,we introduce a Multi-UAV Escape Target Search Algorithm Based on MAPPO(ETS-MAPPO) for addressing the escape target search difficulty problem. Simulation results demonstrate that the ETS-MAPPO algorithm outperforms five classical MARL algorithms in terms of the number of target searches,the area coverage rate, and other metrics.

In this study, we introduce and advanced multi-feature selection technique for bacterial classifi-cation employing the Salp Swarm Algorithm (SSA). We enhance SSA’s effectiveness by incorpo-rating the Opposition-Based Learning (OBL) strategy and the Local Search (LSA) algorithm. The proposed technique encompasses three key stages, streamlining the automated categorization of bacteria based on their distinctive features. The research adopts a multi-feature selection approach bolstered by an enhanced iteration of the Salp Swarm Algorithm (SSA). Enhancements include the utilization of Opposition-Based-Learning (OBL) to increase population diversity during search and Local Search Algorithms (LSA) to tackle local optimization challenges. The ISSA algorithm is designed to optimize the multi-feature selection by increasing the number of selected feature and improving classification accuracy. This study compares its performance with several other algo-rithms across ten distinct test datasets. The comparison results show that ISSA has better perfor-mance in terms of classification accuracy on 3 datasets consisting of 19 features, with a value reaching 73.75%. Additionally, ISSA excels in determining the optimal feature count and producing a better-fit value with a classification error rate of 0,249. Thus, the ISSA technique is expected to make a significant contribution to solving feature selection problems in bacterial analysis

UAVNs (unmanned aerial vehicle networks) may become vulnerable to threats and attacks due to their characteristic features such as high mobility, highly dynamic network topology, and open-air wireless environments. Since previous work has focused on classical and metaheuristic-based approaches, none of these approaches have a self-adaptive approach. In this article, we examine the challenges of cyber detection methods to secure UAVNs and review exiting security schemes proposed in the current literature. Furthermore, we propose an agent-based self-protective method (ASP-UAVN) for UAVNs that is based on the Human Immune System (HIS). In ASP-UAS, the safest route from the source UAV to the destination UAV is chosen according to a self-protective system. In this method, a multi-agent system using an Artificial Immune System (AIS) is employed to detect the attacking UAV and choose the safest route. In the proposed ASP-UAVN, the route request packet (RREQ) is initially transmitted from the source UAV to the destination UAV to detect the existing routes. Then, once the route reply packet (RREP) is received, a self-protective method using agents and the knowledge base is employed to choose the safest route and detect the attacking UAVs. The method is evaluated here via extensive simulations carried out in the NS-3 environment. The experimental results of four scenarios demonstrated that the ASP-UAS increases the Packet Delivery Rate (PDR) by more than 17.4, 20.8, and 25.91%, and detection rate by more than 17.2, 23.1, and 29.3%, and decreases the Packet Loss Rate (PLR) by more than 14.4, 16.8, and 20.21%, the false-positive and false-negative rate by more than 16.5, 25.3, and 31.21% those of SUAS-HIS, SFA and BRUIDS methods, respectively.

This article focuses on the leader-following consensus of fuzzy fractional order singular perturbation multi-agent systems (FOSPMASs) with order in 0,2. By employing the T-S fuzzy modeling approach, a fuzzy FOSPMAS is constructed. Subsequently, a fuzzy observer-based controller is designed and the error system corresponding to each agent is derived. Through a series of equivalent transformations, the error system is decomposed into fuzzy singular fractional order systems (SFOSs). According to the admissibility of SFOSs, the consensus conditions of the fuzzy FOSPMAS are obtained based on linear matrix inequalities (LMIs) without equality constraint. Finally, the effectiveness of the criteria is verified through an RLC circuit model.

This investigation explores a novel path-planning and optimization strategy for multiple cooperative robotic agents, applied in a fully observable and dynamically changing obstacle field. Current dynamic path planning strategies employ static algorithms operating over incremental time-steps. We propose a cooperative multi-agent (CMA) based algorithm, based on natural flocking of animals, using vector operations. It is preferred over more common graph search algorithms like A* as it can be easily applied for dynamic environments. CMA algorithm executes obstacle avoidance using static potential fields around obstacles, that scale based on relative motion. Optimization strategies including interpolation and Bezier curves are applied to the algorithm. To validate effectiveness, CMA algorithm is compared with A* using static obstacles due to lack of equivalent algorithms for dynamic environments. CMA performed comparably to A* with difference ranging from -0.2% to 1.3%. CMA algorithm is applied experimentally to achieve comparable performance, with an error range of -0.5% to 5.2%. These errors are attributed to the limitations of the Kinect V1 sensor used for obstacle detection. The algorithm was finally implemented in a 3D simulated space, indicating that it is possible to apply with drones. This algorithm shows promise for application in warehouse and inventory automation, especially when the workspace is observable.

For the emerging autonomous swarm technology, from the perspective of systems science and systems engineering, there must be some novel elements and methods to aggregate multiple systems into a group, which distinguish with the general components with specific functions, and we expect to provide the presentation of their existence in the swarm development processes. The inspiration of our methodology origins from the integration of swarm ontology, multi-paradigm modeling, multi-agent system, cyber-physical system, etc. Therefore, we choose the model-driven technology as a framework to acquire an approach of model representation across the multiple levels of abstraction and composition. The autonomous strategic mechanism is defined and formed in parallel with ConOps analysis and systems design, so as to effectively solve the cognitive problem of emergence caused by the nonlinear causation among individual and whole behaviors. This approach highlights to use the MBSE processes and their artifacts to embed the meso mechanism to integrate the operational and the functional, and which means to connect the macro and micro aspects in formalism and so to become a whole with its expected goals, and then to verify and validate within a L-V-C simulation environment.

Remote distributed generation control and demand response is nowadays a basic need, especially for the Distributed Network Operators (DNOs). The integration of Renewable Energy Sources (RES) with stochastic production characteristics into the grid in conjunction with the newly appeared stochastic demand consumers (i.e., electric vehicles) hardens the ef-forts of the DNOs to keep the grid’s operation within safe limits and prevent cascading black-outs while staying in compliance with the SAIDI and SAIFI indices during maintenance and re-pair operations. Taking also under consideration the aging of the existing grid infrastructure, making it year by year more prone to failure, it is yet of great significance for the DNOs to have access to real-time feedback from grid’s infrastructure, fast, with low-cost upgrade interventions, easily deployed on the field and with fast response potential, in order to be able to perform real-time grid management (RTGM). In this article, we describe the architecture, development and deployment of a hybrid real-time control system of distributed generation (DG) units, which has the potential to be applied easily to DNO’s substations, RES plants and consumers (i.e. electric vehicles’ charging stations), that combines a low-cost minimum intervention into the electricity grid and its components and eliminates all communication interoperability problems between the different vendors’ installed electrical equipment.

An adaptive operation strategy for on-demand control of DMFC system is proposed as an alternative method to enhance the voltage stability. Based on a single-cell DMFC stack, a newly simplified semi-empirical model is developed from the uniform-designed experimental results to describe the I-V relationship. Integrated with this model, the multi-objective optimization method is utilized to develop an adaptive operation strategy. Although the voltage instability is frequently encountered in unoptimized operations, the voltage deviation is successfully decreased to a required level by adaptive operations with operational adjustments. Moreover, the adaptive operations are also found to be able to extend the range of operating current density or to decrease the voltage deviation according to ones requirements. Numerical simulations are implemented to investigate the underlying mechanisms of the proposed adaptive operation strategy, and experimental adaptive operations are also performed on another DMFC system to validate the adaptive operation strategy. Preliminary experimental study shows a rapid response of DMFC system to the operational adjustment, which further validates the effectiveness and feasibility of the adaptive operation strategy in practical applications. The proposed strategy contributes to a guideline for the better control of output voltage from operating DMFC systems.

：Non-Euclidean data, such as social networks, and citation relationships between documents, has node information and structural information. Graph Convolutional Network(GCN) can automatically learn node features and association information between nodes. The core ideology of the graph convolutional network is to aggregate node information by using edge information, thereby generating a new node feature. In the process of updating node features, there are two core influencing factors. One is the number of neighboring nodes of the central node, the other is the contribution of the neighboring nodes to the central node. Due to the previous GCN methods not simultaneously considering the numbers and different contributions of neighboring nodes to the central node, we design the Adaptive Attention Mechanism(AAM). To further enhance the representational capability of the model, we utilize Multi-Head Graph Convolution(MHGC). Finally, we adopt cross-entropy(CE) loss function to describe the difference between the predicted results of node categories and the ground truth (GT). Combined with backpropagation, this ultimately achieves accurate node classification. Based on AAM, MHGC and CE, we contrive the novel Graph Adaptive Attention Network (GAAN). Experiments show that the classification accuracy has achieved outstanding performances on Cora, Citeseer and Pubmed datasets.

The glucose-insulin regulatory system and its glucose oscillations is a recurring theme in the literature because of its impact on human lives, mostly the ones affected by diabetes mellitus. Several approaches were proposed, from mathematical to data-based models, with the aim of modeling the glucose oscillation curve. Having such a curve, it is possible to predict, when injecting insulin in type 1 diabetes (T1D) individuals. However, the literature presents prediction horizons no longer than 6 hours, which could be a problem considering their sleeping time. This work presents Tesseratus, a model that adopts a multi-agent approach to combine machine learning and mathematical modeling to predict the glucose oscillation up to 8 hours. Tesseratus uses the pharmacokinetics of insulins and data collected from T1D individuals. Its outcome can support endocrinologists while prescripting daily treatment for T1D individuals, and provide personalized recommendations for such individuals, to keep their glucose concentration in the ideal range. Tesseratus brings pioneering results for prediction horizons of 8 hours for nighttime, in an experiment with seven real T1D individuals. It is our claim that Tesseratus will be a reference for classification of glucose prediction model, supporting the mitigation of short- and long-term complications in the T1D individuals.

This paper extends the concept of weighted graphs to matrix weighted graphs. The consensus algorithms dictate that all agents reach consensus when the weighted graph is connected. However, it is not always the case for matrix weighted graphs. The conditions leading to different types of consensus have been extensively analysed based on the properties of matrix-weighted Laplacians and graph theoretic methods. However, in practice, there is concern on how to pick matrix-weights to achieve some desired consensus, or how the change of elements in matrix weights affects the consensus algorithm. By selecting the elements in the matrix weights, different clusters may be possible. In this paper, we map the roles of the elements of the matrix weights in the systems consensus algorithm. We explore the choice of matrix weights to achieve different types of consensus and clustering. Our results are demonstrated on a network of three agents where each agent has three states.

There exist numerous high-dimensional problems in the real world which cannot be solved through the common traditional methods. The metaheuristic algorithms have been developed as successful techniques for solving a variety of complex and difficult optimization problems. Notwithstanding their advantages, these algorithms may turn out to have weak points such as lower population diversity and lower convergence rate when facing complex high-dimensional problems. An appropriate approach to solve such problems is to apply multi-agent systems along with the metaheuristic algorithms. The present paper proposes a new approach based on the multi-agent systems and the concept of agent, which is named Multi-Agent Metaheuristic (MAMH) method. In the proposed approach, several basic and powerful metaheuristic algorithms, including Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Artificial Bee Colony (ABC), Firefly Algorithm (FA), Bat Algorithm (BA), Flower Pollination Algorithm (FPA), Gray Wolf Optimizer (GWO), Whale Optimization Algorithm (WOA), Crow Search Algorithm (CSA), Farmland Fertility Algorithm (FFA), are considered as separate agents each of which sought to achieve its own goals while competing and cooperating with others to achieve the common goals. In overall, the proposed method was tested on 32 complex benchmark functions, the results of which indicated effectiveness and powerfulness of the proposed method for solving the high-dimensional optimization problems. In addition, in this paper, the binary version of the proposed approach, called Binary MAMH (BMAMH), was executed on the spam email dataset. According to the results, the proposed method exhibited a higher precision in detection of the spam emails compared to other metaheuristic algorithms and methods.

In this study, we examine the relationship of bank level lending and borrowing decisions and the risk preferences on the dynamics of the interbank lending We develop an agent-based model that incorporates individual bank decisions using the temporal difference reinforcement learning algorithm with empirical data of 6600 S. banks. The model can successfully replicate the key characteristics of interbank lending and borrowing relationships documented in the recent literatur A key finding of this study is that risk preferences at individual bank level can lead to unique interbank market structures which are suggestive of the capacity that the market responds to surprising

The anti-money laundering (AML) process has failed both in identifying suspicious cases in due time as in assisting the AML analysts in decision making. Starting from a new generic anti-fraud approach, this article presents the main aspects related to the development of a multi-agent system that goes beyond the capture of suspicious transactions, seeking to assist the human expert in the analysis of suspicious behaviour. First, a transactional behavioural profile of clients is obtained in a data mining process. A set of rules, obtained through data mining over a real database, in conjunction with specific rules based on legal aspects and in the expertise of the AML analysts make up the agents' knowledge base. The cases for which the system was unable to suggest a decision are flagged as requiring more detailed analysis. The system analysed 6 months of real transactions and indicated several suspicious profiles, a set of these suspects was investigated by the AML analysts who proved the suspicion of several cases, including some that had not been identified by the systems in execution.

Pepper leaf segmentation plays a crucial role in monitoring pepper leaf diseases in various backgrounds and ensuring the healthy growth of peppers. However, existing transformer-based segmentation methods suffer from computational inefficiency, excessive parameterization, and limited utilization of edge information. To tackle these challenges, we propose an adaptive multi-scale MLP framework, named AMS-MLP, which combines the multi-path aggregation module (MPAM) and the multi-scale context relation mask module (MCRD) to refine the object boundaries in pepper leaf segmentation. AMS-MLP consists of an encoder-based network, an adaptive multi-scale MLP (AM-MLP) module, and a decoder network. In the encoder network, the MPAM module effectively fuses five-scale features to generate a single-channel mask, improving the accuracy of pepper leaf boundary extraction. The AM-MLP module divides the input features into two branches: the global multi-scale MLP branch captures long-range dependencies between image information, while the local multi-scale MLP branch focuses on extracting local feature maps. Adaptive attention mechanism is designed to dynamically adjust the weights of global and local features. The decoder network incorporates the MCRD module into the convolutional layer, enhancing the extraction of boundary features. To verify the performance of the proposed method, we conducted extensive experiments on three pepper leaf datasets with different backgrounds. The results demonstrate mIoU scores of 97.39%, 96.91%, and 97.91%, as well as F1 scores of 98.29%, 97.86%, and 98.51%, respectively. Comparative analysis with U-Net and state-of-the-art models reveals that the proposed method dramatically improves the accuracy and efficiency of pepper leaf image segmentation.

With much more challenging scenarios encountered in engineering, traditional quadrotors couldn’t accomplish all desired missions perfectly. Task-driven based reconfigurable quadrotors have more latent capacity in environment with dense obstacles and narrow corridors. The translational reconfigurable quadrotors and rotational reconfigurable quadrotors are proposed in this presentation, assumptions, mathematical models and related motion control laws are given subsequently, in order to cope with hazard missions, model reference adaptive control laws are proposed, sufficient numerical simulations demonstrate the validity of the proposed control laws.

This paper presents a multi-swarm PSO algorithm for the Quadratic Assignment Problem (QAP) implemented on the OpenCL platform. Our work was motivated by results of time efficiency tests performed for single-swarm algorithm implementation that showed clearly that the benefits of a parallel execution platform can be fully exploited provided the processed population is large. The described algorithm can be executed in two modes: with independent swarms or with migration. We discuss the algorithm construction as well as we report results of tests performed on several problem instances from the QAPLIB library. During the experiments the algorithm was configured to process large populations. This allowed us to collect statistical data related to values of goal function reached by individual particles. We use them to demonstrate on two test cases that although single particles seem to behave chaotically during the optimization process, when the whole population is analyzed, the probability that a particle will select a near-optimal solution grows.

With the large-scale application of Internet of Things (IoT) in the medical field, eHealthcare has attracted wide attention. With the help of IoT devices, eHealthcare allows doctors to monitor patients’ health conditions and make recommendations accordingly. The addition of cloud computing greatly saves Healthcare Center’s (HC) computing resources. In order to provide privacy and fine-grained access control, Attribute-b ased encryption (ABE) is widely favored. HC usually operates multiple medical institutions in different regions, and each medical institution can be regarded as a attribute authority. Therefor, multi-authority (MA) ABE is usually concerned to encrypt the patient data. However for existing MA-ABE algorithms, the ciphertext is long and the efficiency of encryption and decryption is low. These problems will greatly increase the computing burden of patients and seriously affect the efficiency of data transmission. Hence we propose a decentralized key-policy MA-ABE in eHealthcare. The proposed algorithm can achieve decentralization, that is, it does not need central authority. Meanwhile, compared with existing MA-ABE algorithms, the length of ciphertext generated by our algorithm is shorter, and the efficiency of encryption and decryption is significantly improved. With the help of Java Pairing Based Cryptography, we carried out the experiments which show that our algorithm can effectively reduce the time required for encryption and decryption.

With the every passing day, the demand for data traffic is increasing and this demand forces the research community not only to look for alternating spectrum for communication but also urges the radio frequency planners to use the existing spectrum smartly. Cell size is shrinking with the every upcoming communication generation which makes the base station placement planning complex and cumbersome. In order to make the next-generation cost-effective, it is important to design the network in such a way which utilizes minimum number of base stations while ensure coverage and quality of service. This paper aims at develop a new approach using hybrid metaheuristic and metamodel applied in multi-transmitter placement planning (MTPP) problem. We apply radial basis function (RBF) metamodel to assist particle swarm optimizer (PSO) in a constrained simulation-optimization (SO) of MTPP to mitigate the associated computational burden of optimization procedure. We evaluate the effectiveness and applicability of proposed algorithm in a case study by simulating MTPP model with two, three, four and five transmitters.

The utilization of Artificial Intelligence (AI) in biotechnology is widespread, addressing challenges such as elucidating disease pathophysiology and novel therapeutic approaches. AI plays a critical role in tasks such as drug manufacturing, chemical analysis, RNA and DNA sequencing, and enzyme studies by automating processes and expediting data collection and analysis. AI has particularly transformed the analysis of omics data for researchers, providing tools to handle complex and multifaceted datasets effectively. Through AI, integrative analysis of multi-omics data can be conducted in efficient ways. This article discusses the application of multi-omics and AI technologies in studying various diseases related to infection (COVID-19), mutation (cancer), and senescence (alopecia) to understand their pathophysiology. The applications of AI were performed as the aspect of the diagnosis, prognosis, and treatment for each disease. We introduce AI-driven analysis of pathophysiology can overcome traditional limitations in pathology, with diverse features showing potential in defining the causes of diseases, and potentially enhancing primary omics data in the distinguish the subtype of diseases. In this context, integrated approaches using multi-omics data and AI technology could provide fresh biological insights by comprehending the molecular mechanism of diseases and is instrumental in advancing precision medicine. We anticipate that the rapidly advancing AI-based multi-omics data analysis will significantly contribute to promoting healthy longevity.

Fast convergence routing is an important issue for LEO constellation network, due to its dynamical topology changing and time varying transmission requests. Most of existing research focus on the OSPF routing algorithm, which cannot handle the frequently links state changing of network. In this paper, we propose a Fast-Convergence Reinforcement Learning Satellite Routing Algorithm (FRL-SR) for LEO satellite networks, in which the satellite gets the network links status fast and adjusts its routing strategy. In FRL-SR, each satellite node is regarded as an agent. The agent selects the port for packet forwarding according to its own routing policy. When the satellite network state changes, agent would send ’hello’ packets to the neighbor node to update the neighbor node’s routing policy. Compared with traditional reinforcement learning, FRL-SR can perceive network information faster, and then converge faster. Also, FRL-SR can mask the dynamics of satellite network topology and adaptively adjust the forwarding strategy according to the link state. Various simulation is constructed, the results show that the proposed FRL-SR algorithm out performance the Dijkstra algorithm in performance of average delay, packet arriving ratio, network load balance.

The Internet of Things (IoT) is an emerging technology that aims to enable the interconnection of a large number of smart devices and heterogeneous networks. Ad hoc networks play an important role in the designing of IoT-enabled platforms due to their efficient, flexible, low-cost, and dynamic infrastructures. These networks utilize the available resources efficiently to maintain the Quality of Service (QoS) in a multi-hop communication. However, in a multi-hop communication, the relay nodes can be malicious, thus requiring a secured and reliable data transmission. In this paper, we propose a QoS-aware secured communication scheme for IoT-based networks (QoS-IoT). In QoS-IoT, a Sybil attack detection mechanism is used for the identification of Sybil nodes and their forged identities in multi-hop communication. %by high-power and mobile nodes. After Sybil nodes detection, an optimal contention window (CW) is selected for QoS provisioning, i.e., to achieve per-flow fairness and efficient utilization of the available bandwidth. In a multi-hop communication, the MAC layer protocols do not perform well in terms of fairness and throughput, especially when the nodes generate a large amount of data. It is because the MAC layer has no capability of providing QoS to prioritized or forwarding flows. We evaluate the performance of QoS-IoT in terms of Sybil attack detection, fairness, throughput, and buffer utilization. The simulation results show that the proposed scheme outperforms the existing schemes and significantly enhances the performance of the network with a large volume of data. Moreover, the proposed scheme is resilient against Sybil attack.

Visual Sensor Networks (VSNs) have been the focus of numerous studies, emphasizing the quality of the information they generate. The primary goal of these networks is to capture data from an area, extract the pertinent information from the visual scene, and facilitate communication. However, the presence of objects in the study area can impacted the network's efficiency, linking the quality of acquired data directly to the positioning of the cameras. Strategically positioning multiple cameras in a potentially complex area, while ensuring effective communication between nodes, presents a challenging issue in VSNs applications. This paper introduces a specific method to enhance the deployment of visual sensors in indoor environments. The research addresses the theme of multi-objective optimization of VSN deployment, integrating various criteria: maximizing overall visual coverage, maximizing the observation of zones of interest, maximizing observation redundancy of zones of interest and ensuring communication connectivity for data transfers. To tackle this problem, we simulate the observed environment incorporating cameras, obstacles, and considering zones of interest. Camera positioning is performed while considering visual constraints and the scene's characteristics. The quality of positioning is evaluated based on the defined objective functions. Initially, a comparative study is conducted with a state-of-the-art approach, integrating the first three objective functions. Subsequently, we incorporate the fourth objective function to ensure data transfers. The proposed method demonstrates efficient camera network deployments in indoor areas, considering global coverage and observation redundancy. In contrast to the state-of-the-art, these results are achieved in areas with visual obstacles while ensuring communication connectivity between the different cameras.

In this paper, we present a multi-task model that predicts disparities and confidence levels in deep stereo matching simultaneously. We do this by combining its successful model for each separate task and obtaining a multitask model that can be trained with a proposed loss function. We show the advantages of this model compared to training and predicting disparity and confidence sequentially. This method enables an improvement of 15% to 30% in the area under the curve (AUC) metric when trained parallel rather than sequential. In addition, the effect of weighting the components in the loss function on the stereo and confidence performance is investigated. By improving the confidence estimate, the practicality of stereo estimators for creating distance images is increased.

Fine-tuning is an important technique in transfer learning that has achieved significant success in tasks that lack training data. However, as it is difficult to extract effective features for single-source domain fine-tuning when the data distribution difference between the source and the target domain is large, we propose a transfer learning framework based on multi-source domain called adaptive multi-source domain collaborative fine-tuning to address this issue. This approach utilizes multiple source domain models for collaborative fine-tuning, thereby improving the model's feature extraction capability in the target task. Specifically, this approach employs an adaptive multi-source domain layer selection strategy to customize appropriate layer fine-tuning schemes for the target task among multiple source domain models. The objective is to extract more efficient features. Furthermore, a novel multi-source domain collaborative loss function is designed to facilitate the precise extraction of target data features by each source domain model. Simultaneously, it works towards minimizing the output difference among various source domain models, thereby enhancing the adaptability of the source domain model to the target data. In order to validate the effectiveness of the proposed the adaptive multi-source domain collaborative fine-tuning framework, it is analyzed and compared with the most widely used fine-tuning methods by applying them to seven publicly available visual categorization datasets commonly employed in transfer learning. Experimental results demonstrate that, in comparison with the existing fine-tuning approaches, our method not only enhances the accuracy of feature extraction in the model but also provides precise layer fine-tuning schemes for the target task, resulting in state-of-the-art performance.

With the development of deep learning, several Graph Neural Networks (GNN)-based approaches have been utilized for text classification. However, GNNs encounter challenges in capturing contextual text information within a document sequence. To address this, a novel text classification model RB-GAT is proposed by combining RoBERTa-BiGRU embedding and a multi-head Graph ATtention Network (GAT). First, the pre-trained RoBERTa model is exploited to learn word and text embeddings in different contexts. Second, the Bidirectional Gated Recurrent Unit (BiGRU) is employed to capture long-term dependencies and bidirectional sentence information from the text context. Next, the multi-head graph attention network is applied to analyze this information, which serves as a node feature for the document. Finally, the classification results are generated through a Softmax layer. Experimental results on three benchmark datasets demonstrate that our method can achieve an accuracy of 71.48%, 98.45%, and 80.32% on Ohsumed, R8, and MR, which is superior to the existing nine text classification approaches.

The adoption of algorithms based on Artificial Intelligence (AI) has been rapidly increasing during the last years. However, some aspects of AI techniques are under heavy scrutiny. For instance, in many use cases, it is not clear whether the decisions of an algorithm are well-informed and conforming to human understanding. Having ways to address these concerns is crucial in many domains, especially whenever humans and intelligent (physical or virtual) agents must cooperate in a shared environment. In this paper, we introduce an application of an explainability method based on the creation of a Policy Graph (PG) based on discrete predicates that represent and explain a trained agent’s behaviour in a multi-agent cooperative environment. We show that from these policy graphs, policies for surrogate interpretable agents can be automatically generated. These policies can be used to measure the reliability of the explanations enabled by the PGs, through a fair behavioural comparison between the original opaque agent and the surrogate one. The contributions of this paper represent the first application of policy graphs in the context of explaining agent behaviour in collaborative multi-agent scenarios and presents experimental results that sets this kind of scenario apart from previous application in single-agent scenarios: when requiring collaborative behaviour, predicates that allow representing observations about the other agents are crucial to replicate the opaque agent’s behaviour and increase the reliability of explanations.

For the task planning problem of the command and control architecture, the existing algorithms have problems such as low efficiency and poor re-planning quality under abnormal conditions. Based on the requirements of the current accusation architecture, this paper constructs a distributed command and control architecture model based on multi-agents, which makes use of the superiority of multi-agents in dealing with complex tasks. The concept of MultiAgents-HTN is proposed under the framework. The original hierarchical task network planning algorithm is optimized, the multi-agent collaboration framework is redefined, and the coordination mechanism of local conflict is designed. Taking the classical resource scheduling problem as the experimental background, the comparison between the proposed algorithm and the classical HTN algorithm is carried out. The experimental results show that the proposed algorithm has higher quality and higher efficiency than the existing algorithm, and the space anomaly is heavy during processing. The planning is more efficient, and the time is more complicated and superior in dealing with the same problem, with good convergence and adaptability. The conclusion proves that the distributed command and control architecture proposed in this paper has high practicability in related fields and can solve the problem of distributed command and control architecture in multi-agent environment.

We present information theoretic search strategies for single and multi-robot teams to localize the source of biochemical contaminants in turbulent flows. The robots synthesize the information provided by sporadic and intermittent sensor readings to optimize their exploration strategy. By leveraging the spatio-temporal sensing capabilities of a mobile sensing network, our strategies result in control actions that maximize the information gained by the team while optimizing the time spent localizing the position of the biochemical source. By leveraging the team's ability to obtain simultaneous measurements at different locations, we show how a multi-robot team is able to speed up the search process resulting in a collaborative information theoretic search strategy. We validate our proposed strategies in both simulations and experiments.

Earth observation satellites can capture images of specific areas in Earth's orbit based on user requirements. Despite the high demand for satellite imagery, satellites remain a scarce resource. When there are many observation tasks that are large and dense, they may interfere with each other due to satellite mobility. To address this issue, a multi-satellite scheduling algorithm based on a task merging mechanism has been proposed. This paper proposes a two-stage approach to the problem: task merging phase and merging task scheduling phase. The task merging phase introduces two methods based on Mean Shift and Complete Graph to generate the merging task set. In the merging task scheduling phase, a multi-satellite scheduling algorithm based on merging tasks is employed to solve the problem. Finally, certain measurement experiments suggest the effectiveness of the algorithm.

Device to Device (D2D) is a pivotal technology in the next generation of communication, allowing for direct task offloading between mobile devices (MDs) to improve the efficient utilization of idle resources. This paper proposes a novel algorithm for dynamic task offloading between active MDs and idle MDs in the D2D-MEC (Mobile Edge Computing) system by deploying multi-agent deep reinforcement learning (DRL) to minimize the long-term average delay of delay-sensitive tasks under deadline constraints. Our core innovation is a dynamic partitioning scheme for idle and active devices in the D2D-MEC system, accounting for stochastic task arrivals and multi-time-slot task execution, which has been insufficiently addressed in existing literature. We adopt a queue-based system to formulate a dynamic task offloading optimization problem. To address the challenges of large action space and coupling of actions across time slots, we model the problem as a Markov Decision Process (MDP) and perform the multi-agent DRL through Multi-Agent Proximal Policy Optimization (MAPPO). We employ a centralized training with decentralized execution (CTDE) framework to enable each MD to make offloading decisions solely based on its local system state. Extensive simulations demonstrate the efficiency and fast convergence of our algorithm. In comparison with the existing sub-optimal results deploying single-agent DRL, our algorithm reduces the average task completion delay by 11.0% and the ratio of dropped tasks by 17.0%.

Scaling the operation is the single greatest challenge in every enterprise. The more complex the enterprise, the greater the challenge. Scaling in healthcare has been a consistent challenge, with the need to meet clinical endpoints with less staff, increased costs of resources, regulatory oversight, and the goal of improving access to care. The article explores the emerging paradigm of multi-agent AI systems in healthcare, representing a significant leap beyond traditional Large Language Models. We comprehensively analyze the potential of these systems to revolutionize patient care, streamline administrative processes, and support complex clinical decision-making. The paper describes a hypothetical sepsis management system comprising seven specialized AI agents, each handling specific aspects of patient care, from data collection and diagnosis to treatment recommendations and resource management. We also examine applications in chronic disease management and hospital patient flow optimization. The technical implementation of these systems is discussed, including the use of advanced Large Language Models, inter-agent quality control measures, implementing guardrails, self-reflection, integration with Electronic Health Records, and the importance of explainable AI for decision transparency. In addition to describing the promising potential benefits, such as enhanced diagnostic accuracy and personalized treatment plans, we address significant challenges, including data quality assurance, workflow integration, and ethical considerations. We conclude the article by highlighting future directions, such as integrating IoT devices and developing more sophisticated natural language interfaces. Our work underscores the transformative potential of multi-agent AI systems in healthcare while emphasizing the need for rigorous validation, ethical oversight, and a patient-centered approach in their development and implementation.

In this paper, a distributed algorithm is proposed to solve a consensus convex optimization problem. It is a Jacobi-proximal alternating direction method of multipliers with a damping parameter $\gamma$ in the iteration of multiplier. Compared with existing algorithms, it has the following nice properties: (1) The restriction on proximal matrix is relaxed substantively, thus alleviating the weight of the proximal term. Therefore, the algorithm has a faster convergence speed. (2) The convergence analysis of the algorithm is established for any damping parameter $\gamma\in(0,2]$, which is larger ones in the literature. In addition, some numerical experiments and an application to a logistic regression problem are provided to validate the effectiveness and the characteristics of the proposed algorithm.

Blade Health Monitoring (BHM) is often necessary in power plants and in aviation to prevent excessive blade vibration and cracks. This article proposes a network of blade tip timing sensors operated in a distributed BHM system. A number of cooperating agents is implemented in smart conditioning units which can autonomously operate in an adverse environment and communicate with other nodes via a serial interface. The project uses special versions of reduced instruction set chips that are able to operate near the hot section of the engine. Due to the limited number of types of microprocessors available in the extended temperature range grading, it was necessary to fully utilize the limited hardware resources and implement preemptive multitasking. For this purpose, a custom operating system and communication protocol were designed. The protocol hosts the middle layer which hides the implementation of the distributed system. The presented architecture ensures the sufficient computational capacity in individual nodes of the network operated in adverse conditions. It is scalable and resistant to transmission errors.

Tsallis entropy has been widely used in image thresholding because of its non-extensive properties. The non-extensive parameter q contained in this entropy plays an important role in various adaptive algorithms and has been successfully applied in bi-level image thresholding. In this paper, the relationships between parameter q and pixels’ long-range correlations have been further studied within multi-threshold image segmentation. It is found that the pixels’ correlations are remarkable and stable for images generated by a known physical principle, such as infrared images and medical CT images. And the corresponding non-extensive parameter q can be evaluated by using self-adaptive Tsallis entropy algorithm. The results of this algorithm are compared with those of Shannon entropy algorithm and the original Tsallis entropy algorithm, in terms of quantitative image quality evaluation metrics PSNR (Peak Signal-to-Noise Ratio) and SSIM (Structural Similarity). Furthermore, we observed that for image series with the same background, the q values determined by the adaptive algorithm are consistently kept in a narrow range. Therefore, similar or identical scenes during imaging would produce similar strength of long-range correlations, which provides potential applications for unsupervised image processing.

In this study, we present a federated learning approach that combines a multi-branch network and the Oort client selection algorithm to improve the performance of federated learning systems. This method successfully addresses the significant issue of non-iid data, a challenge not adequately tackled by the commonly used MFedAvg method. Additionally, one of the key innovations of this research is the introduction of uniformity, a metric that quantifies the disparity in training time amongst participants in a federated learning setup. This novel concept not only aids in identifying stragglers but also provides valuable insights into assessing the fairness and efficiency of the system. Experimental results underscore the merits of the integrated multi-branch network with the Oort client selection algorithm and highlight the crucial role of uniformity in designing and evaluating federated learning systems.

In this paper, a multi-patch weakly singular isogeometric boundary element method (WSIGABEM) for two-dimensional elastostatics is proposed. Since the method based on the weakly singular boundary integral equation, the quadrature techniques, dedicated for the weakly singular and regular integrals, are applied in the method. A new formula for the generation of collocation points is suggested to take the full advantage of the multi-patch technique. The generated collo-cation points are essentially inside the patches without any correction. If the boundary conditions are assumed to be continuous in every patch, no collocation point lies on the discontinuous boundaries, thus simplifying the implementation. The multi-patch WSIGABEM is verified by the simple examples with analytical solutions. The feature of the present multi-patch WSIGABEM is investigated by the comparison with the traditional IGABEM. Furthermore, the combination of the present multi-patch WSIGABEM and the particle swarm optimization algorithm results in a shape optimization method in two-dimensional elastostatics. By changing some specific control points and their weights, the shape optimizations of the fillet corner, the spanner and the arch bridge are verified to be effective.

The strong couplings among ecological, economic, social and technological processes explains the complexification of human-made systems, and phenomena such as globalization, climate change, the increased urbanization and inequality of human societies, the power of information, and the COVID-19 syndemics. Among complexification’s essential features are non-decomposability, asynchronous behavior, components with many degrees of freedom, increased likelihood of catastrophic events, irreversibility, nonlinear phase spaces with immense combinatorial sizes, and the impossibility of long-term, detailed prediction. Sustainability for complex systems implies enough efficiency to explore and exploit their dynamic phase spaces and enough flexibility to coevolve with their environments. This in turn means solving intractable nonlinear semi-structured dynamic multi-objective optimization problems, with conflicting, incommensurable, non-cooperative objectives and purposes, under dynamic uncertainty, restricted access to materials, energy and information, and a given time horizon, aiming at enhancing the co-evolutionary power of the Biosphere and its human subsystems. Giving the high-stakes, the need for effective, efficient, diverse solutions, their local-global, present-future effects, and their unforeseen short, medium and long-term impacts, achieving sustainable complex systems implies the need for Sustainability-designed Universal Intelligent Agents, harnessing the strong functional coupling between human, artificial and nonhuman biological intelligence in a no-zero-sum game to achieve sustainability.

Unmanned delivery technology using unmanned aerial vehicles (UAVs) has the potential to solve issues such as traffic congestion and labor shortages. We investigated a method to construct a route between the source and destination nodes in a wireless multi-hop network by installing a radio terminal in each house. If the relay functions of all nodes in the network are in operation, the number of control messages for route construction increases, and the message relay forwarding load of each node increases. Keeping all node pairs multi-hop connectivity, we establish a method to operate the relay function with as few nodes as possible. End nodes that have not activated the relay function connect to the relay node with the closest physical distance. In this paper, we propose methods for selecting nodes to operate the relay function. Specifically, one method is based on random selection, another method is based on the number of adjacent nodes, and a third method is based on the Multipoint Relay (MPR) of the Optimized Link State Routing Protocol (OLSR). For each method, we evaluate whether the route construction is available, the number of relay nodes, the total distance of constructed routes, and the distance in population-dense regions. We clarify the characteristics of each method, and the method based on MPR is the best for constructing a network suitable for UAV navigation routes. In addition, the smaller the number of relay nodes, the more unexpected collisions on the links due to route conflicts. We clarify the minimum node density required to apply the MPR method which reduces the number of relay nodes suppressing route conflicts.

This paper investigates the leader-following H∞ consensus of fractional-order multi-agent systems (FOMASs) under input saturation via the output feedback. Based on the bounded real lemma for FOSs, the sufficient conditions of H∞ consensus for FOMASs are provided in α∈0,1 and 1,2, respectively. Furthermore, the iterative linear matrix inequalities (ILMIs) approaches are applied for solving quadratic matrix inequalities (QMIs). The ILMI algorithms show a method to derive initial values and transform QMIs into LMIs. Mathematical tools are employed to transform the input saturation issue into optimal solution of LMIs for estimating stable regions. The ILMI algorithms avoid the conditional constraints on matrix variables during the LMIs construction and reduce conservatism. The approach does not disassemble the entire MASs by transformations to the Laplacian matrix, instead adopting a holistic analytical perspective to obtain gain matrices. In the end, numerical examples are conducted to validate the efficiency of the approach.

In this paper, we propose, implement, and test two novel downlink LTE scheduling algorithms. The implementation and testing of these algorithms were in Matlab, and they are based on the use of Reinforcement Learning, more specifically, the Qlearning technique for scheduling two types of users. The first algorithm is called a Collaborative scheduling algorithm, and the second algorithm is called a Competitive scheduling algorithm. The first type of the scheduled users is the Primary Users, and they are the licensed subscribers that pay for their service. The second type of the scheduled users is the Secondary Users, and they could be unlicensed subscribers that dont pay for their service, device to device communications, or sensors. Each user whether it is a primary or secondary is considered as an agent. In the Collaborative scheduling algorithm, the primary user agents will collaborate in order to make a joint scheduling decision about allocating the resource blocks to each one of them, then the secondary user agents will compete among themselves to use the remaining resource blocks. In the Competitive scheduling algorithm, the primary user agents will compete among themselves over the available resources, then the secondary user agents will compete among themselves over the remaining resources. Experimental results show that both scheduling algorithms converged to almost ninety percent utilization of the spectrum, and provided fair shares of the spectrum among users.

The essence of cross-modal generation and retrieval modeling for image-text interactions lies in semantic consistency. Among these, cross-modal representation alignment serves as the foundational requirement for achieving cross-modal semantic consistency. The crux of our proposed method entails the collaborative training of an image captioning model(referred to as the ’captioner’) and a pair of contrastive encoders for image-text matching(referred to as the ’concoder’). This synergistic approach yields concurrent enhancements in concoder’s performance, captioner’s proficiency, and cross-modal semantic coherence. We coin the proposed method as ‘ReCap’. To begin, we initialize the concoder through knowledge distillation from a pre-trained model. During the training process, we use the output of the initialized concoder as input to a residual attention network, jointly training it with the captioner to achieve semantic consistency. Subsequently, we iteratively update the concoder during the image-text momentum encoding phase using the residual attention network, creating a closed-loop for semantic consistency resolution. Upon completion of training, the concoder and captioner modules can be used independently to perform tasks related to cross-modal retrieval and cross-modal generation of text and images. In order to substantiate the efficacy of our proposed method, we initially conducted empirical experiments encompassing image-text retrieval and image captioning tasks, employing a widely recognized benchmark dataset, MSCOCO. Subsequently, we assessed the fine-grained cross-modal alignment performance of the concoder through an image classification task on the iNaturalist 2018 dataset. The achieved performance metrics notably surpassed those achieved by several incumbent state-of-the-art models, thus validating the proficiency of our method. Finally, motivated by the practical requirements of handling the nature conservation image data, we performed caption annotation for the iNaturalist 2018 dataset. Subsequently, we trained the ReCap on this annotated data. Experimental results demonstrate that our proposed method can maintain semantic consistency between cross-modal retrieval and image caption generation for species with similar visual features but distinct semantics. This achievement signifies a meaningful exploration in the field of cross-modal semantic consistency representation, holding significant practical value in the domain of biological research.

The concept and policies of multiple early cancer detection (MCED) have gained significant attention from governments worldwide in recent years. In the era of burgeoning artificial intelligence (AI) technology, the integration of MCED with AI has become a prevailing trend, giving rise to a plethora of MCED AI products. However, due to the heterogeneity of both the detection targets and the AI technologies, the overall diversity of MCED AI products remains considerable. The types of detection targets encompass protein biomarkers, cell-free DNA, or combinations of these biomarkers. In the development of AI models, different model training approaches are employed, including datasets of case-control researches or real-world cancer screening datasets. Various validation techniques, such as cross-validation, location-wise validation, and time-wise validation are used. All of the factors show significant impacts on the predictive efficacy of MCED AIs. After the completion of AI model development, deploying the MCED AIs in clinical practice presents numerous challenges, including presenting the predictive reports, identifying the potential locations and types of tumor, and addressing cancer-related information such as clinical follow-up and treatment. This study reviews several mature MCED AI products currently available in the market, detecting their composing factors from serum biomarkers detection, MCED AIs training/validation, and the clinical application. The review illuminates the challenges encountered by existing MCED AI products across these stages, offering insights into the continued development and obstacles within the field of MCED AI.

Advances in early detection of Breast cancer and treatment improvements have significant-ly increased survival rates. Traditional screening methods, including mammography, MRI, ultrasound, and biopsies, while effective, often come with high costs and risks. Recently, thermal imaging has gained attention due to its minimal risks compared to mammography, although it is not widely adopted as a primary detection tool since it depends on identifying skin temperature changes and lesions. The advent of machine learning (ML) and deep learning (DL) has enhanced the effectiveness of breast cancer detection and diagnosis using this technology. In this study a novel methodology for developing an interpretable computer-aided diagnosis (CAD) system for breast cancer detection, leveraging explaina-ble Artificial Intelligence (XAI) throughout its various phases. To achieve these goals, we proposed a new multi-objective optimization approach named Hybrid Particle Swarm Optimization algorithm (HPSO) and Hybrid spider Monkey Optimization algorithm (HSMO). These algorithms simultaneously combine the continuous and binary representations of PSO and SMO to effectively manage trade-offs between Accuracy, feature selection and hyperparameter tuning. We evaluate several CAD models and investigate the impact of handcrafted methods such as Local Binary Patterns (LBP), Histogram of Oriented Gradients (HOG), Gabor filters, and edge detection. We further shedding light on the effect of feature selection and optimization on feature attribution and model decision-making processes using the SHapley Additive exPlanations (SHAP) framework, with a particular emphasis on cancer classification using the DMR-IR dataset. The results of our experiments demonstrate in all trials that the performance of the model is improved. Also with HSMO our models achieved a high accuracy of 98.27% and F1- score of 98.15% while selecting only 25.78% of the HOG features. This approach not only boosts the performance of CAD models but also ensures comprehensive interpretability. This method emerges as a promising and transparent tool for early breast cancer diagnosis.

A single paragraph of about 200 words maximum. For research articles, abstracts should give a pertinent overview of the work. We strongly encourage authors to use the following style of structured abstracts, but without headings: (1) Background: Place the question addressed in a broad context and highlight the purpose of the study; (2) Methods: briefly describe the main methods or treatments applied; (3) Results: summarize the article’s main findings; (4) Conclusions: indicate the main conclusions or interpretations. The abstract should be an objective representation of the article and it must not contain results that are not presented and substantiated in the main text and should not exaggerate the main conclusions. This study presents a comprehensive literature review on the convergence of affective computing, interactive installation art, multi-dimensional sensory stimulation, and artificial intelligence (AI) in measuring emotional responses. It addresses the problem of understanding emotional response and measurement in the context of interactive installation art under artificial intelligence (AI). The study aims to fill the existing research gaps by examining three key aspects: sensory stimulation, multi-dimensional interactions, and engagement, which have been identified as significant contributors to profound emotional responses in interactive installation art. The study proposed approach involves conducting a process analysis of emotional responses to interactive installation art, aiming to develop a conceptual framework that explores the variables influencing emotional responses. The study will formulate hypotheses that make specific predictions about the relationships between sensory stimulation, multi-dimensional interactions, engagement, and emotional responses. By employing the ASSURE model combined with experimental design, the research methodology ensures a systematic and comprehensive study implementation. The implications of this project lie in advancing the understanding of emotional experiences in interactive installation art under AI, providing insights into the underlying mechanisms that drive these experiences. The contributions of this research include bridging the identified research gaps, refining theoretical frameworks, and guiding the design of more impactful and emotionally resonant interactive artworks. Ultimately, this research aims to contribute to the broader field of human-computer interaction and enhance the development of immersive and emotionally engaging interactive installations.

Disassembly is a pivotal technology to enable the circularity of electric vehicle batteries by applying circular economy strategies that extend the life cycle of their components, like remanufacturing and repurposing, or by using efficient recycling to reintegrate the gained materials in producing new battery systems. This paper aims to develop a multi-method self-configuring simulation model for investigating disassembly scenarios while considering the battery design as well as the configuration and layout of the disassembly station. We demonstrate the developed model in a case study using a battery of Mercedes-Benz and the automated disassembly station of the project DeMoBat at Fraunhofer IPA. Furthermore, we introduce two disassembly scenarios, the component-oriented and the accessibility-oriented disassembly, and compare them using the simulation model to determine several indicators, such as the frequency of tool change, the number and distribution of robot routes, the tool utilization, and the disassembly time.

This article introduces a new method for modelling and verifying the execution of timed security protocols (TSP) and their time-dependent security properties. The method, which is both novel and reliable, uses an extension of interpreted systems, accessible semantics in multi-agent systems, and timed interpreted systems (TIS) with dense time semantics to model TSP executions. We enhance the models of TSPs by incorporating delays and varying lifetimes to capture real-life aspects of protocol executions. To illustrate the method, we model a timed version of the Needham-Schroeder Public Key Authentication Protocol. We have also developed a new SMT-based bounded model checking reachability algorithm for the proposed structures and implemented it with the tool. The method comprises a new procedure for modelling TSP executions, a translation of TSP into TIS, and a translation of TIS's reachability problem into the SMT problem. The paper also includes thorough experimental results for nine protocols modelled by TIS and discusses the findings in detail.

The paper proposed a modification of the GeoSER(D) model previously developed by us by detailing the age structure of the population, personal schedule on weekdays and working days, and individual health characteristics of the agents, this made it possible to build a more realistic model of the functioning of the city and its residents. The developed model made it possible to simulate the spread of 3 types of the strain of the COVID-19 virus, and to analyze the adequacy of this model in the case of unhindered spread of the virus among city residents. The paper showed that SARS COV 2 spreads mainly from contacts in workplaces and transport, and schoolchildren and preschool children are the consequence, not the initiator of the epidemic. Fluctuations in the dynamics of various indicators of the spread of SARS COV 2 associated with the difference in the daily schedule on weekdays and weekends. It has been shown that people's daily schedules strongly influence the spread of SARS COV 2. For the more contagious "rapid" strains of SARS COV 2 (omicron), immunocompetent people become a significant source of infection. For the less contagious "slow strains" (alpha) of SARS COV 2, the most active source of infection is immunocompromised individuals (pregnant women). The more contagious – "fast" strain of the SARS COV 2 virus (omicron) spreads faster in public transport. For less contagious – "slow" strains of the virus (alpha), the greatest infection occurs due to work and educational contacts.

This paper presents control algorithms enabling autonomous heterogeneous trucks to drive in platoons. Heterogeneous trucks imply that the hardware information (e.g., truck length, break, accelerator, or engine) of a truck may be distinct from that of another truck. We define a platoon as a collection of trucks where a manually driven truck (leader truck) is followed by several automatically controlled following trucks. The proposed approach is to make every autonomous truck keep following the leader's trajectory while maintaining a designated distance from its predecessor truck. As far as we know, this paper is unique in developing both lateral maneuver and speed control considering a platoon of heterogeneous trucks. The efficiency of the proposed approach is verified using simulations.

The central goal of few-shot scene classification is to learn a model that can generalize well to a novel scene category (UNSEEN) from only one or a few labeled examples. Recent works in the remote sensing (RS) community tackle this challenge by developing algorithms in a meta-learning manner. However, most prior approaches have either focused on rapidly optimizing a meta-learner or aimed at finding good similarity metrics while overlooking the embedding power. Here we propose a novel Task-Adaptive Embedding Learning (TAEL) framework that complements the existing methods by giving full play to feature embedding’s dual roles in few-shot scene classification - representing images and constructing classifiers in the embedding space. First, we design a lightweight network that enriches the diversity and expressive capacity of embeddings by dynamically fusing information from multiple kernels. Second, we present a task-adaptive strategy that helps to generate more discriminative representations by transforming the universal embeddings into task-specific embeddings via a self-attention mechanism. We evaluate our model in the standard few-shot learning setting on two challenging datasets: NWPU-RESISC4 and RSD46-WHU. Experimental results demonstrate that, on all tasks, our method achieves state-of-the-art performance by a significant margin.

This paper describes a proposed fractional filter-based multi-scale underwater and hazy image enhancement algorithm. The proposed system combines a modified global contrast operator with fractional order-based multi-scale filters used to generate several images, which are fused based on entropy and standard deviation. The multi-scale-global enhancement technique enables fully adaptive and controlled colour correction and contrast enhancement without over exposure of highlights when processing hazy and underwater images. This in addition to illumination/reflectance estimation coupled with global and local contrast enhancement. The proposed algorithm is also compared with the most recent available state-of-the-art multi-scale fusion de-hazing algorithm. Experimental comparisons indicate that the proposed approach yields better edge and contrast enhancement results without halo effect, colour degradation and is faster and more adaptive than all other algorithms from the literature.

Differential Evolution (DE) is an evolutionary algorithm that has become increasingly popular due to its effectiveness and efficiency. However, its adaptation for multi-objective optimization requires further investigation. To address this issue, a novel algorithm called ILSDEMO has been proposed, which incorporates indicator-based selection and local search into a self-adaptive DE. ILSDEMO employs an archive population to store non-dominated solutions, generating an initial population uniformly distributed over the feasible solution space using orthogonal design. Additionally, two variants of DE are used to expedite convergence, while q-Gaussian mutation is utilized to exploit better trial individuals. The k-nearest neighbor rule is used to eliminate crowded solutions, and indicator-based selection is employed to generate a new parent population without diversity preservation. The performance of ILSDEMO was investigated on the test instances from the ZDT series and DTLZ series in terms of the selected indicators. The results suggest that ILSDEMO accurately and evenly approximates the true Pareto front compared to NSGAII, IBEA, and DEMO.

Soil temperature is a fundamental parameter in water resources and engineering. A cost-effective model which can forecast soil temperature accurately is extensively needed. Recently, many studies have applied artificial intelligence (AI) at both surface and underground levels for soil temperature prediction. However, there is no comprehensive and detailed assessment of the performance of different AI approaches in soil temperature estimation, and primarily limited atmospheric variables are used as input data for AI models. In the present study, great varieties of various land and atmospheric variables are applied to evaluate the performance of a wide range of AI methods on soil temperature prediction. Herein, thirteen approaches, from classic regressions to well-established methods of random forest and gradient boosting to advanced AI techniques like multi-layer perceptron and deep learning are taken into account. The results show that AI is a promising approach in climate parameter forecast and deep learning demonstrates the best performance among other models. It has the highest R-squared ranging from 0.957 to 0.980, the lowest NRMSE ranging from 2.237% to 3.287% and the lowest MAE, ranging from 0.510 to 0.743 in predicting soil temperature. The prediction is repeated for different sizes of data, and prediction outcomes confirm the conclusion mentioned above.

In this paper, modelling, simulation and verification of multi-agent manufacturing system with application of bio-inspired techniques are addressed. To this end, the new solution of abstract architecture for control and coordination decentralized systems - CODESA is suggested. Centralized architecture suffers from various problems, such as rigidity, scalability, low fault-tolerance or very limited flexibility, agility, energy efficiency and productivity. Prime is concrete application of CODESA in manufacturing domain. The undesirable characteristics of emergent behaviour are the problem to achieve optimization and impossibility to predict future states of the system. CODESA-Prime has been tested by simulations for automatic guided vehicle (AGV) systems guided by magnetic tape in Ella Software Platform.

Mucilage from Coccinia grandis was extracted, isolated by maceration technique and precipitated, accordingly. The mucilage was evaluated for its physicochemical, binding, and disintegrant properties in tablets using paracetamol as a model drug. The crucial physicochemical properties such as flow properties, solubility, swelling index, loss on drying, viscosity, pH, microbial load, cytotoxicity were evaluated and the compatibility was analysed using sophisticated instrumental methods (TGA, DTA, DSC, and FTIR). The binding properties of the mucilage were used at three different concentrations and compared with starch and PVP as standard binders. The disintegrant properties of mucilage were used at two different concentrations and compared with standard disintegrants MCCP, SSG, and CCS. The wet granulation technique was used for the preparation of granules and was evaluated for the flow properties. The tablets were punched and evaluated for their hardness, friability, assay, disintegration time, in vitro dissolution profiles. In vitro cytotoxicity study of the mucilage was performed in human embryonic kidney (HEK) cell line using cytotoxic assay by MTT method. The outcome of the study indicated that the mucilage had good performance when compared with starch and PVP. Further, the mucilage acts as a good disintegrant than MCCP, SSG and CCS to paracetamol tablets. Moreover, the in vitro cytotoxicity evaluation results demonstrated that the mucilage is non-cytotoxic to human cells and is safe.

Drone and aerial remote sensing images are widely used, but their imaging environment is complex and prone to image blurring. Existing CNN deblurring algorithms usually use multi-scale fusion to extract features in order to make full use of aerial remote sensing blurred image information, but images with different degrees of blurring use the same weights, leading to increasing errors in the feature fusion process layer by layer. Based on the physical properties of image blurring, this paper proposes an adaptive multi-scale fusion blind deblurred generative adversarial network (AMD-GAN), which innovatively applies the degree of image blurring to guide the adjustment of the weights of multi-scale fusion, effectively suppressing the errors in the multi-scale fusion process and enhancing the interpretability of the feature layer. The research work in this paper reveals the necessity and effectiveness of a priori information on image blurring levels in image deblurring tasks. By studying and exploring the image blurring levels, the network model focuses more on the basic physical features of image blurring. Meanwhile, this paper proposes an image blurring degree description model, which can effectively represent the blurring degree of aerial remote sensing images. The comparison experiments show that the algorithm in this paper can effectively recover images with different degrees of blur, obtain high-quality images with clear texture details, outperform the comparison algorithm in both qualitative and quantitative evaluation, and can effectively improve the object detection performance of aerial remote sensing blurred images. Moreover, the average PSNR of this paper's algorithm tested on the publicly available dataset RealBlur-R reached 41.02dB, surpassing the latest SOTA algorithm.

Ever-increasing need for improving the livability of a city and improve outcomes for its residents, over the last decade, the adoption of technology to develop urbanised societies around the world has given rise to the need for developing smart cities. The speed at which the world population is growing, the use of Internet of Things in smart cities have really advanced the quality of life. One significant area of concern within the smart city framework is waste management. If the waste within a city is not adequately managed, then it leads to issues in the health of the citizens. Additionally, the waste management has such a high impact on the environmental footprint, hence the need to have a smart way of managing waste is of critical importance. Through our research, we analyse the challenges of waste management within a city to understand the impact of the problem on to the citizens and overall city operations. We then investigate ways in which we can solve these problems using the emerging technologies, such as the Internet of Things, to collect valuable data of large volumes arriving at an astronomical rate, then apply multi-agent deep reinforcement learning algorithms to harness the power of big data to extract meaningful information and actionable insights. We ingest data generated by our Internet of Things into our algorithm for three main purposes including providing the notifications to an external system, for example, a map navigation engine out of the scope for this project but a future extension for route optimisation and waste vehicle tracking; extracting and reporting the actionable insights from the underlying data; and consuming the extracted data for predictive forecasting to draw out the unknown patterns of waste fill levels within various geographical locations and again send out triggers and notification to external systems for example a waste collection authority who can efficiently schedule the waste collection vehicles and optimise the route. To achieve the above mentioned outcomes, we propose a framework that is agnostic of the hardware that it connects to and can effectively interface with a wide variety of hardware keeping a level of abstraction in the architecture.

This study explores fault-tolerant consensus in leader-following heterogeneous multi-agent systems, focusing on actuator failures in uncrewed aerial vehicles (UAVs) and uncrewed ground vehicles (UGVs). An optimization-based fault-tolerant consensus algorithm is proposed. The algorithm utilizes the Euler-Lagrange formula to ensure system consistency under actuator failures, with the Lyapunov stability theory proving the asymptotic stability of the consistency error. The algorithm is applied to heterogeneous multi-agent systems of UAVs and UGVs to derive optimal fault-tolerant consensus control laws for each vehicle type. Simulation experiments give evidence for the feasibility of the proposed control strategy.

The radio spectrum is a scarce and extremely valuable resource that demands careful real-time monitoring and dynamic resource allocation. Dynamic spectrum access (DSA) is a new paradigm for managing the radio spectrum, which requires AI/ML driven algorithms for optimum performance under rapidly changing channel conditions and possible cyber-attacks in the electromagnetic domain. Fast sensing across multiple directions using array processors, with subsequent AI/ML based algorithms for sensing and perception of the waveforms that are measured from the environment is critical for providing decision support in DSA. As part of directional and wideband spectrum perception, the ability to finely channelize wideband inputs using efficient Fourier analysis is much needed. However, a fine-grain fast Fourier transform (FFT) across a large number of directions is computationally intensive and leads to high chip area and power consumption. We address this issue by exploiting recently proposed approximate discrete Fourier transforms (ADFT) which has its own sparse factorization for real-time implementation at low complexity and power consumption. The ADFT is used to create a wideband multi-beam RF digital beamformer and temporal spectrum-based attention unit which monitors 32~discrete directions across 32~sub-bands in real-time using a multiplierless algorithm having low computational complexity. The output of this spectral attention unit is applied as a decision variable to an intelligent receiver that adapts its center frequency and frequency resolution via FFT channelizers that are custom-built for real-time monitoring at high resolution. This two-step process allows the fine-gain FFT to be applied only to directions and bands of interest as determined by the ADFT based low-complexity 2D spacetime attention unit. The fine-grain FFT provides a spectral signature that can find future use cases in neural network engines for achieving modulation recognition, IoT device identification, and RFI identification. Beamforming and spectral channelization algorithms, digital computer architecture, and early prototypes using a 32-element fully digital multichannel receiver and field programmable gate array (FPGA)-based high-speed software defined radio (SDR) is provided.

The PLM concept implies the use of heterogeneous information resources at different stages of the product life cycle, the joint work of which allows you to effectively solve the problems of product quality and various costs. According to the principle of isomorphism of regularities of complex systems, an effective PLM system must have these regularities. Unfortunately, this principle is not often fundamental when designing PLM systems. The purpose of the work is to show, using a simple example, the principles of development, operation and use of an educational multi-agent PLM system, the main purpose of which is to study and research these regularities in the life cycle of a special threaded connection. The multi-agent approach to the development of a PLM system provides the necessary prerequisites for the emergence of system-wide regularities in it. The parallel work of agents is implemented using the actor model and the Ray Python-package. Agents for the logical inference of knowledge base facts, CAD/FEA/CAM/SCADA agents, agents for optimization by various methods, and other agents have been developed. Open source software was used to develop the system. Each agent has relatively simple behavior, implemented by its rule function, and can interact with other agents. The system can work in interactive mode with the user or in automatic mode according to a simple algorithm: the rule functions of all agents are executed until at least one of them returns a value other than None. Examples of the operation of the system are given and such system-wide regularities as emergence, historicity and self-organization are demonstrated in it.

The option of decarbonizing urban freight transport using Battery Electric Vehicle (BEV) seems promising.However, there is currently a strong debate whether Fuel Cell Electric Vehicle (FCEV) might be the bettersolution. The question arises as to how a fleet of FCEV influences the operating cost, the Greenhouse Gas(GHG) emissions and primary energy demand in comparison to BEVs and to Internal Combustion EngineVehicle (ICEV). To investigate this, we simulate the urban food retailing as a representative share of urbanfreight transport using a multi-agent transport simulation software. Synthetic routes as well as fleet size andcomposition are determined by solving a Vehicle Routing Problem (VRP). We compute the operating costsusing a total cost of ownership (Total Cost of Ownership (TCO)) analysis and the use phase emissions as wellas primary energy demand using the Well To Wheel (WTW) approach. While a change to BEV results in 17 -23% higher costs compared to ICEV, using FCEVs leads to 22 - 57% higher costs. Assuming today’s electricitymix, we show a GHG emission reduction of 25% compared to the ICEV base case when using BEV. Currenthydrogen production leads to a GHG reduction of 33% when using FCEV which however cannot be scaled tolarger fleets. Using current electricity in electrolysis will increase GHG emission by 60% compared to the basecase. Assuming 100% renewable electricity for charging and hydrogen production, the reduction from FCEVsrises to 73% and from BEV to 92%. The primary energy requirement for BEV is in all cases lower and forhigher compared to the base case. We conclude that while FCEV have a slightly higher GHG savings potentialwith current hydrogen, BEV are the favored technology for urban freight transport from an economic andecological point of view, considering the increasing shares of renewable energies in the grid mix.

The abundant mechanical vibration energy in bridge road environment can be converted into electric energy by using the piezoelectric energy harvest technology, which could be an efficient way to provide energy required by the wireless sensor network in the bridge condition monitoring system. An autonomous energy harvesting system has been designed based on cantilever beams for sensing and acquiring the bridge vibration energy. After the analysis of the dynamic properties of the piezoelectric cantilever beam in the energy conversion, three kinds of interface circuits were compared through simulation and experimental results. It was shown that the VD interface circuit has less power loss. Furthermore, the proposed closed loop control method based on the VD circuit was simple, adaptive, and self-powered, which is suitable for the road energy harvesting application. Finally, the energy harvesting system based on VD circuit was realized with harvested power of around 0.8mW.

Respiratory infections are usually characterized by mucus hypersecretion. This condition may worsen and prolong symptoms and signs. Mucoactive agents include different molecules with different mechanisms of action. Sobrerol is a monoterpene able to fluidify mucus, increase mucociliary clearance, and exert antioxidant activity. Sobrerol is available in various formulations (granules, syrup, nebulized, and suppository). Sobrerol has been on the market for over 50 years. Several studies investigated its efficacy and safety in acute and chronic respiratory diseases characterized by mucus hyperproduction. Seven pediatric studies have been conducted with favorable outcomes. Recently, regulatory agencies reduced the treatment duration to three days. Therefore, a future study will test the hypothesis that a combination of oral and topical sobrerol could benefit children and adults with frequent respiratory infections. The rationale considers that mucus accumulation could be a risk factor for increased susceptibility to have infections.

(R)-(+)-3,5-Dinitro-N-(1-phenylethyl)benzothioamide 1 is a potential chiral solvating agent (CSA) for the spectral resolution of enantiomers by 1H NMR spectroscopy. The single enantiomer of 1 was synthesized from commercially (R)-(+)-a-methylbenzylamine 2 in two-steps with 85% yield.

A Wireless Body Area Sensor Network (WBASN) is combination of numerous sense nodes, positioned onto/close or inside a person body. Wireless Body Area Sensor Networks (WBASN) is a developing automation trend that exploits wireless sensor nodes to put instantaneous wearable well-being of ill person to improve individual’s existence. The sensor nodes might be used outwardly to observe abundant health parameters (like heart activity, blood pressure and cholesterol) of an ill person at a vital site within hospital. Hence the goal of WBASN is much crucial, enhancing the lifetime of nodes is compulsory to sustain many issues such as utility and efficiency. It is essential to evaluate time that when the first node will die it we want to refresh or change the battery reason is that loss of crucial information is not tolerable. The lifetime is termed as the time interval when a first node dies out due to battery exhaustion. In our proposed protocol life time of a network is the main concern as well other protocol related issues such as throughput, path loss, and residual energy. Bio-sensors are used for deployment on human body. Poisson distribution and equilibrium model techniques have been used for attaining the required results. Multi-hop network topology and random network node deployment used to achieve minimum energy consumption and longer network lifetime.

Alkenyl Succinic Anhydride (ASA) is a sizing agent used in papermaking to increase the water repellency of paper. Almost 60 years after the introduction of the chemical in papermaking, scientists still have differing views on how ASA interacts with cellulose. Several experiments were conducted to bring more clarity to the ASA sizing mechanism, especially on the contentious question of ASA-cellulose covalent bonding or the esterification reaction between ASA and cellulose during papermaking. Herein, research papers and patents, including experiments and results, from the1960’s to 2020 were reviewed. Our investigation revealed that the ester bond formation between ASA and cellulose is insignificant and is not a prerequisite for sizing effectiveness; the main ASA related material found in sized paper is hydrolyzed ASA or both hydrolyzed ASA and ASA salt. In addition, ASA emulsion stability and ASA emulsion retention are important for sizing efficiency improvement.

The production of public goods is a necessary condition for the survival of the species but it comes at the expense of individual growth. In a prototype bacterial colony, we model the role of quorum sensing as a resource redistribution mechanism. Two types of bacterial colonies are analyzed, one made up of a single strain and one made up of two different strains. Based on a recent series of experimental data present in the literature, we analyze two types of strains with different extinction times: strains that consume available resources very quickly, therefore becoming extinct quickly, and strains that consume resources slowly and die due to aging. We show that the proposed quorum sensing model describes the main experimental result, namely that coexistence favors the survival of both strains. Furthermore, the production of public goods is maximized when both types of individuals have the maximum proliferation output. Finally, we highlight the role played by so-called dormant cells in the duration of survival time. These cells are of particular interest, because their ability to counteract different types of stress (e.g. the use of antibiotics) still constitutes a challenge.

A significant number and range of challenges besetting sustainability can be traced to the actions and interactions of multiple autonomous agents (people mostly) and the entities they create (e.g., institutions, policies, social network) in the corresponding social-environmental systems (SES). To address these challenges, we need to understand decisions made and actions taken by agents, the outcomes of their actions, including the feedbacks on the corresponding agents and environment. The science of Agent-based Complex Systems—ACS science—has a significant potential to handle such challenges. The advantages of ACS science for sustainability are addressed by way of identifying the key elements and challenges in sustainability science, the generic features of ACS, and the key advances and challenges in modeling ACS. Artificial intelligence and data science promise to improve understanding of agents’ behaviors, detect SES structures, and formulate SES mechanisms.

Exercise-based cardiac rehabilitation requires patients to perform a set of certain prescribed exercises a specific number of times. Local muscular endurance (LME) exercises are an important part of the rehabilitation program. Automatic exercise recognition and repetition counting, from wearable sensor data is an important technology to enable patients to perform exercises independently in remote settings, e.g. their own home. In this paper we first report on a comparison of traditional approaches to exercise recognition and repetition counting, corresponding to supervised machine learning and peak detection from inertial sensing signals respectively, with more recent machine learning approaches, specifically Convolutional Neural Networks (CNNs). We investigated two different types of CNN: one using the AlexNet architecture, the other using time-series array. We found that the performance of CNN based approaches were better than the traditional approaches. For exercise recognition task, we found that the AlexNet based single CNN model outperformed other methods with an overall 97.18% F1-score measure. For exercise repetition counting , again the AlexNet architecture based single CNN model outperformed other methods by correctly counting repetitions in 90% of the performed exercise sets within an error of ±1. To the best of our knowledge, our approach of using a single CNN method for both recognition and repetition counting is novel. In addition to reporting our findings, we also make the dataset we created, the INSIGHT-LME dataset, publicly available to encourage further research.

Manufacturing systems need to meet I4.0 guidelines to deal with uncertainty in scenarios of turbulent demand for products. The engineering concepts to define the service’s resources to manufacture the products will be more flexible, ensuring the possibility of re-planning in operation. These can follow the engineering paradigm based on capabilities. The virtualization of industry components and assets achieves the RAMI 4.0 guidelines and (I4.0C), which describes the Asset Administration Shell (AAS). However, AAS are passive components that provide information about I4.0 assets. The proposal of specific paradigms is exposed for managing these components, as is the case of multi-agent systems (MAS) that attribute intelligence to objects. The implementation of resource coalitions with evolutionary architectures (EAS) applies cooperation and capabilities’ association. Therefore, this work focuses on designing a method for modeling the asset administration shell (AAS) as virtual elements orchestrating intelligent agents (MAS) that attribute cooperation and negotiation through contracts to coalitions based on the engineering capabilities concept. The systematic method suggested in this work is partitioned for the composition of objects, AAS elements, and activities that guarantee the relationship between entities. Finally, Production Flow Schema (PFS) refinements are applied to generate the final Petri net models (PN) and validate them with Snoopy simulations. The results achieved demonstrate the validation of the procedure, eliminating interlocking and enabling liveliness to integrate elements behavior.

Bedbug (Cimex spp.) are a nuisance public-health pest that is on the rise globally, particularly in crowded cities such as Hong Kong. To investigate the health impacts of bedbug infestations among bedbug victims, online surveys were distributed in Hong Kong between June 2019 to July 2020. Data on sociodemographics, self-rated health, average hours of sleep per day, and details of bedbug infestation were collected. Bivariate and multivariable analysis were performed using logistic regression. The survey identified 422 bedbug victims; among them, 223 (52.9%) experienced ≥5 bites in the past month, most bites occurred on the arms (n=202, 47.8%) and legs (n=215, 51%), and the most common reaction to bites were itchiness (n=322, 76.3%), redness, and swelling of the skin (n=246, 58.1%), and difficulties sleeping or restlessness (n=125, 29.6%). Bites usually occurred during sleep (n=230, 54.5%). For impact on daily life in the past month, most bedbug victims reported moderate to severe impact on mental and emotional health (n=223, 52.8%) and sleeping quality (n=239, 56.6%). Lower self-rated health (aOR<1) was independently associated with impact to physical appearance (p=0.008), spending money on medication or doctor consultation (p=0.04), number of bites in the past month (p=0.023), and irregular time of bites (p=0.003). Lower average hours of sleep per day (aOR<1) was independently associated with impact on mental and emotional health (p=0.016). This study brings attention to the neglected issue of bedbug infestation by considering bedbugs as an infectious agent instead of a vector and providing empirical evidence describing its health impacts.

We evaluated performance of two American surveillance systems for monitoring the spread of antimicrobial-resistant (AMR) gonorrhea: the Gonococcal Isolate Surveillance Project (GISP) and the enhanced Gonococcal Isolate Surveillance Project (eGISP) which includes the non-urethral isolates in addition to the urethral ones utilized in the original surveillance system. A continuous-time agent-based model of gonorrhea transmission among the US men who have sex with men (MSM) population was developed and used for this purpose. The model accounts for susceptible and resistant strains of N. gonorrhoeae, symptomatic and asymptomatic infection and different transmission routes. Overall, eGISP system outperforms the original GISP system and allows to obtain a higher accuracy using a significantly lower number of isolates. Most of time, the original surveillance system determines the moment of switch to a new antibiotic later than necessary which leads to additional gonorrhea cases and spread of the resistance. Informing the gonorrhea treatment guidelines by eGISP estimates instead of the currently used GISP estimates would result in reduction of 622 (95% uncertainty interval: -4,009, 9,099) gonorrhea cases in the simulated cohort of 10,000 US MSM over a 25-year period without reduction in the lifespan of the current first-line antibiotic.

Biopolymer gels have gained tremendous potential for therapeutic applications due to their biocompatibility, biodegradability, and ability to adsorb and bind biological fluids, making them attractive for drug delivery and therapy. The versatility of biopolymer gels in theranostic backgrounds, with a focus on integrating imaging features and facilitating real-time monitoring of drug delivery. Different methods of delivery are explored imaging agents into biopolymer gels, including encapsulation, surface functionalization, nanoparticle encapsulation and layer-by-layer assembly techniques. Integration of Agents and Real-Time Monitoring Drug Delivery We summarize the synthesis methods, general properties, and mechanisms of biopolymer gels functionality, demonstrating their broad applications as multimodal systems for imaging-based therapeutics. These techniques not only enable multiple imaging but also provide signal enhancement and imaging a targeted facilitates, increasing the diagnostic accuracy and therapeutic efficacy. In addition, current techniques for incorporating imaging agents into biopolymer gels are discussed, and their role in precise drug delivery and monitoring.

Oral mucositis (OM) is one of the common adverse events associated with cancer treatment that decreases quality of life and affects treatment outcome. However, the medications used to manage OM are generally only palliative, and our knowledge of the syndrome is limited. The etiology of the syndrome is thought to be complex and multifactorial. We investigated the trends and characteristics of OM and estimated molecular initiating events (MIEs) associated with the development of the syndrome using FDA Adverse Event Reporting System. The study of trends and characteristics suggested that OM is significantly more likely to occur in females and nonelderly patients and is likely to be induced by protein kinase inhibitors such as afatinib and everolimus. Next, we used Toxicity Predictor, an in-house quantitative structure–activity relationship system, to estimate OM-associated MIEs. The results revealed that agonist activity of human pregnane X receptor, thyroid-stimulating hormone-releasing hormone receptor, and androgen receptor may be associated with OM development. Our study findings are expected to help avoid the risk of OM induction during the drug discovery process and clinical use of antineoplastic agents.

Interferon-gamma (IFN-γ) is an important cytokine in host defense against tuberculosis infection. In some cases, administration of IFN-γ during tuberculosis infection can promote faster cure. In the present work, we have shown that in a mouse model, human interferon-gamma, exhibits some anti-tuberculosis activity, especially in combination with isoniazid.

Effective detection of isopropyl methylfluorophosphonate (GB, sarin), a type of organophosphine poisoning agent, is an urgent issue to be addressed in maintaining public safety. In this research, a gas-sensitive film material defined as poly (4-hydroxy-4,4-bis trifluoromethyl) - butyl-1-enyl) - si-loxane (SXFA) with the structure of hexafluoroisopropyl (HFIP) functional group was synthesized by using methyl vinylpropyl dichlorosilane and hexafluoroacetone trihydrate as initial materials. Synthesis process products were characterized by FTIR. SXFA was prepared on a 200 MHz shear surface wave delay line with spin coating method for GB detected. Detection limit of ＜ 0.1 mg/m3 was obtained through conditional experiments. Meanwhile, we also obtained the maximum re-sponse of 2.168 mV at 0.1 mg/m3 concentration, which indicting a much lower detection limit of SAW-SXFA sensor. Additionally, the maximum response standard deviation of 0.11 mV with a co-efficient of variation of 0.01, as well as the maximum recovery standard deviation of 0.22 mV with a coefficient of variation of 0.02 were also obtained through 5 repeated experiments. Results showed that the SAW-SXFA sensor has strong selectivity and reproducibility, good selectivity, positive detection ability, high sensitivity, and fast alarm performance for sarin detection.

Gadolinium-based contrast agents (GBCA) are complexes, highly stable in vivo, used in Magnetic Resonance Imaging (MRI), administered in patients and then eliminated via renal, passing through wastewater treatment plants (WWTP) before being discarded in the receiving medium, without apparent removal. In this study, it was studied if different exposure periods to several environmental parameters (solar radiation, different salinities, temperatures and pH) will influence the stability of these complexes, namely, the Gd-DOTA. Gd-DOTA solutions were processed in a seaFAST-pico saline matrix pre-concentration and elimination system and Gd concentrations were determined by ICP-MS. Results showed that the complex remained stable in fresh, brackish and saline water environments, even when exposed to extreme temperatures (40ºC) or slightly acidic to basic conditions (6-10), for an exposure period of 96h. A small increase in the free Gd concentration was observed after 18 days when exposed to pH<4, in all tested salinities (0, 18 and 36 PSU), with a degradation increase of up to 29%, after 5 weeks of exposure in freshwater. When exposed to direct solar radiation a low Gd-DOTA degradation (4%) was observed after 24h at salinity 18 PSU and remained constant until the end of the exposure period (96h), while the remaining salinities showed negligible values.