A multi-sensor-based distributed real-time measurement system for glacier deformation

Glacier disasters occur frequently in alpine regions around the world,but the current conventional geological disaster measurement technology cannot be directly used for glacier disaster measurement.Hence,in this study,a distributed multi-sensor measurement system for glacier deformation was established by integrating piezoelectric sensing,coded sensing,attitude sensing technology and wireless communication technology.The traditional Modbus protocol was optimized to solve the problem of data identification confusion of different acquisition nodes.Through indoor wireless transmission,adaptive performance analysis,error measurement experiment and landslide simulation experiment,the performance of the measurement system was analyzed and evaluated.Using unmanned aerial vehicle technology,the reliability and effectiveness of the measurement system were verified on the site of Galongla glacier in southeastern Tibet,China.The results show that the mean absolute percentage errors were only 1.13%and 2.09%for the displacement and temperature,respectively.The distributed glacier deformation real-time measurement system provides a new means for the assessment of the development process of glacier disasters and disaster prevention and mitigation.

Phase behavior of gas condensate in porous media using real-time computed tomography scanning

The phase behavior of gas condensate in reservoir formations differs from that in pressure-volume-temperature(PVT)cells because it is influenced by porous media in the reservoir formations.Sandstone was used as a sample to investigate the influence of porous media on the phase behavior of the gas condensate.The pore structure was first analyzed using computed tomography(CT)scanning,digital core technology,and a pore network model.The sandstone core sample was then saturated with gas condensate for the pressure depletion experiment.After each pressure-depletion state was stable,realtime CT scanning was performed on the sample.The scanning results of the sample were reconstructed into three-dimensional grayscale images,and the gas condensate and condensate liquid were segmented based on gray value discrepancy to dynamically characterize the phase behavior of the gas condensate in porous media.Pore network models of the condensate liquid ganglia under different pressures were built to calculate the characteristic parameters,including the average radius,coordination number,and tortuosity,and to analyze the changing mechanism caused by the phase behavior change of the gas condensate.Four types of condensate liquid(clustered,branched,membranous,and droplet ganglia)were then classified by shape factor and Euler number to investigate their morphological changes dynamically and elaborately.The results show that the dew point pressure of the gas condensate in porous media is 12.7 MPa,which is 0.7 MPa higher than 12.0 MPa in PVT cells.The average radius,volume,and coordination number of the condensate liquid ganglia increased when the system pressure was between the dew point pressure(12.7 MPa)and the pressure for the maximum liquid dropout,Pmax(10.0 MPa),and decreased when it was below Pmax.The volume proportion of clustered ganglia was the highest,followed by branched,membranous,and droplet ganglia.This study provides crucial experimental evidence for the phase behavior changing process of gas condensate in porous media during the depletion production of gas condensate reservoirs.

Scheduling transactions in mobile distributed real-time database systems

A DMVOCC-MVDA （distributed multiversion optimistic concurrency control with multiversion dynamic adjustment） protocol was presented to process mobile distributed real-time transaction in mobile broadcast environments. At the mobile hosts, all transactions perform local pre-validation. The local pre-validation process is carried out against the committed transactions at the server in the last broadcast cycle. Transactions that survive in local pre-validation must be submitted to the server for local final validation. The new protocol eliminates conflicts between mobile read-only and mobile update transactions, and resolves data conflicts flexibly by using multiversion dynamic adjustment of serialization order to avoid unnecessary restarts of transactions. Mobile read-only transactions can be committed with no-blocking, and respond time of mobile read-only transactions is greatly shortened. The tolerance of mobile transactions of disconnections from the broadcast channel is increased. In global validation mobile distributed transactions have to do check to ensure distributed serializability in all participants. The simulation results show that the new concurrency control protocol proposed offers better performance than other protocols in terms of miss rate, restart rate, commit rate. Under high work load （think time is ls） the miss rate of DMVOCC-MVDA is only 14.6%, is significantly lower than that of other protocols. The restart rate of DMVOCC-MVDA is only 32.3%, showing that DMVOCC-MVDA can effectively reduce the restart rate of mobile transactions. And the commit rate of DMVOCC-MVDA is up to 61.2%, which is obviously higher than that of other protocols.

A dynamic crash recovery scheme for distributed real-time database systems

Recovery performance in the event of failures is very important for distributed real-time database systems. This paper presents a time-cognizant logging-based crash recovery scheme （TCLCRS） that aims at distributed real-time databases, which adopts a main memory database as its ground support. In our scheme, each site maintains a real-time log for local transactions and the subtransactions, which execute at the site, and execte local checkpointing independently. Log records are stored in non-volatile high- speed store, which is divided into four different partitions based on transaction classes. During restart recovery after a site crash, partitioned crash recovery strategy is adopted to ensure that the site can be brought up before the entire local secondary database is reloaded in main memory. The partitioned crash recovery strategy not only guarantees the internal consistency to be recovered, but also guarantee the temporal consistency and recovery of the sates of physical world influenced by uncommitted transactions. Combined with two- phase commit protocol, TCLCRS can guarantee failure atomicity of distributed real-time transactions.

Transmission Considerations with QoS Support to Deliver Real-Time Distributed Speech Recognition Applications

Distributed speech recognition (DSR) applications have certain QoS (Quality of service) requirements in terms of latency, packet loss rate, etc. To deliver quality guaranteed DSR application over wirelined or wireless links, some QoS mechanisms should be provided. We put forward a RTP/RSVP transmission scheme with DSR-specific payload and QoS parameters by modifying the present WAP protocol stack. The simulation result shows that this scheme will provide adequate network bandwidth to keep the real-time transport of DSR data over either wirelined or wireless channels.

Quasi Serializable Concurrency Control in Distributed Real-Time Database Systems

This paper formally defines and analyses the new notion of correctness called quasi serializability, and then outlines corresponding concurrency control protocol QDHP for distributed real-time databases. Finally, through a series of simulation studies, it shows that using the new concurrency control protocol the performance of distributed real-time databases can be much improved.

Assigning Real-Time Tasks in Environmentally Powered Distributed Systems

Harvesting energy for execution from the environment (e.g., solar, wind energy) has recently emerged as a feasible solution for low-cost and low-power distributed systems. When real-time responsiveness of a given application has to be guaranteed, the recharge rate of obtaining energy inevitably affects the task scheduling. This paper extends our previous works in?[1] [2] to explore the real-time task assignment problem on an energy-harvesting distributed system. The solution using Ant Colony Optimization (ACO) and several significant improvements are presented. Simulations compare the performance of the approaches, which demonstrate the solutions effectiveness and efficiency.

Trusted Data Acquisition Mechanism for Cloud Resource Scheduling Based on Distributed Agents

Goud computing is a new paradigm in which dynamic and virtualized computing resources are provided as services over the Internet. However, because cloud resource is open and dynamically configured, resource allocation and scheduling are extremely important challenges in cloud infrastructure. Based on distributed agents, this paper presents trusted data acquisition mechanism for efficient scheduling cloud resources to satisfy various user requests. Our mechanism defines, collects and analyzes multiple key trust targets of cloud service resources based on historical information of servers in a cloud data center. As a result, using our trust computing mechanism, cloud providers can utilize their resources efficiently and also provide highly trusted resources and services to many users.

Building Distributed Web GIS: A Mobile Agent Based Approach

The diversity of GISs and the wide spread availability of WWW have led to an increasing amount of research on integrating a variety of heterogeneous and autonomous GISs in a cooperative environment to construct a new generation of GIS characterizing in open architecture, distributed computation, interoperability, and extensibility. Our on going research project MADGIS (Mobile Agent based Distributed Geographic Information System) is reported, in which we propose the architecture of MADGIS to meet the requirements of integrating distributed GIS applications under Internet environment. We first describe the architecture of MADGIS, and detailed discussions focusing on the structure of client site, server site and mobile agent in MADGIS. Then we explore key techniques for MADGIS implementation.

MULTI-AGENT APPROACH FOR DISTRIBUTED FLEXIBLE MANUFACTURING SYSTEMS

This paper presents a multi agent model for the realization of the tasks dispatched in a distributed flexible manufacturing system.Agent behavior is described in terms of its capabilities and related environment.According to task execution forms,two kinds of task allocation methods are used and the proper communication mechanisms and negotiation mechanisms are involved to guarantee a high performance and high reliability for a DFMS.

Distributed optimization of electricity-Gas-Heat integrated energy system with multi-agent deep reinforcement learning

The coordinated optimization problem of the electricity-gas-heat integrated energy system(IES)has the characteristics of strong coupling,non-convexity,and nonlinearity.The centralized optimization method has a high cost of communication and complex modeling.Meanwhile,the traditional numerical iterative solution cannot deal with uncertainty and solution efficiency,which is difficult to apply online.For the coordinated optimization problem of the electricity-gas-heat IES in this study,we constructed a model for the distributed IES with a dynamic distribution factor and transformed the centralized optimization problem into a distributed optimization problem in the multi-agent reinforcement learning environment using multi-agent deep deterministic policy gradient.Introducing the dynamic distribution factor allows the system to consider the impact of changes in real-time supply and demand on system optimization,dynamically coordinating different energy sources for complementary utilization and effectively improving the system economy.Compared with centralized optimization,the distributed model with multiple decision centers can achieve similar results while easing the pressure on system communication.The proposed method considers the dual uncertainty of renewable energy and load in the training.Compared with the traditional iterative solution method,it can better cope with uncertainty and realize real-time decision making of the system,which is conducive to the online application.Finally,we verify the effectiveness of the proposed method using an example of an IES coupled with three energy hub agents.

A Mobile Agent-Based Prototype of HeterogeneousDistributed Virtual Environment Systems

Mobile agents provide a new method for the distributed computation. This paper presents the advantages of using mobile agents in a distributed virtual environment (DVE) system, and describes the architecture of heterogeneous computer's distributed virtual environment system (HCWES) designed to populate some mobile agents as well as stationary agents. Finally, the paper introduces how heterogeneous computer network communication is to be realized.

Optimization in the Migration Problem of Mobile Agents in Distributed Information Retrieval Systems

In this paper, we employ genetic algorithms to solve the migration problem (MP). We propose a new encoding scheme to represent trees, which is composed of two parts: the pre-ordered traversal sequence of tree vertices and the children number sequence of corresponding tree vertices. The proposed encoding scheme has the advantages of simplicity for encoding and decoding, ease for GA operations, and better equilibrium between exploration and exploitation. It is also adaptive in that, with few restrictions on the length of code, it can be freely lengthened or shortened according to the characteristics of the problem space. Furthermore, the encoding scheme is highly applicable to the degree-constrained minimum spanning tree problem because it also contains the degree information of each node. The simulation results demonstrate the higher performance of our algorithm, with fast convergence to the optima or sub-optima on various problem sizes. Comparing with the binary string encoding of vertices, when the problem size is large, our algorithm runs remarkably faster with comparable search capability. Key words distributed information retrieval - mobile agents - migration problem - genetic algorithms CLC number TP 301. 6 Foundation item: Supported by the National Natural Science Foundation of China (90104005), the Natural Science Foundation of Hubei Province and the Hong Kong Polytechnic University under the grant G-YD63Biography: He Yan-xiang (1952-), male, Professor, research direction: distributed and parallel processing, multi-agent systems, data mining and e-business.

Determining hepatitis C virus genotype distribution among high-risk groups in Iran using real-time PCR

AIM: To assess hepatitis C virus (HCV) genotype patterns among high-risk Iranian groups, using real-time RT-PCR.

Distributed Human Resource Redistribution System Based on Agent and Ontology

A computer system for human resource （HR） redistribution system is presented to solve the balance problem of the ＂surplus resources＂ and ＂surplus tasks＂ among a group of project units. The system architecture is designed in a compositional manner using the elements of agent technology and knowledge technology. A combination of generic agent models, ontology and knowledge provides an effective approach to address the dynamic, distributed and knowledge-intensive characters of the HR management. In the system, the broker agent acting as intermediary provides matchmaking services to the domain agents, and the individual domain agents communicate directly with each other. The HR ontology provides the semantic match of the surplus task and the surplus resource. Finally, an application example is presented to illustrate the achieved solution for a concrete scenario. This novel way offers a comprehensive HR exchange solution and is snitablc for both intra-organizational and inter-organizational HR management.

A Hierarchy Distributed-Agents Model for Network Risk Evaluation Based on Deep Learning

Deep Learning presents a critical capability to be geared into environments being constantly changed and ongoing learning dynamic,which is especially relevant in Network Intrusion Detection.In this paper,as enlightened by the theory of Deep Learning Neural Networks,Hierarchy Distributed-Agents Model for Network Risk Evaluation,a newly developed model,is proposed.The architecture taken on by the distributed-agents model are given,as well as the approach of analyzing network intrusion detection using Deep Learning,the mechanism of sharing hyper-parameters to improve the efficiency of learning is presented,and the hierarchical evaluative framework for Network Risk Evaluation of the proposed model is built.Furthermore,to examine the proposed model,a series of experiments were conducted in terms of NSLKDD datasets.The proposed model was able to differentiate between normal and abnormal network activities with an accuracy of 97.60%on NSL-KDD datasets.As the results acquired from the experiment indicate,the model developed in this paper is characterized by high-speed and high-accuracy processing which shall offer a preferable solution with regard to the Risk Evaluation in Network.

Hierarchical Distributed Control Design for Multi-agent Systems Using Approximate Simulation

在这份报纸，我们基于近似模拟为多代理人系统考虑一个层次控制图案。到还原剂复杂性，我们首先构造一个简单抽象系统指导代理人，然后，我们讨论在抽象系统和多重代理人之间的模拟关系。在这个抽象系统的帮助下，分布式的层次控制被建议完成一项协作任务。由普通 Lyapunov 功能的优点，我们与考虑到模拟功能交换多代理人拓扑学分析集体行为。

Leader-following formation control of multi-agent networks based on distributed observers

To investigate the leader-following formation control, in this paper we present the design problem of control protocols and distributed observers under which the agents can achieve and maintain the desired formation from any initial states, while the velocity converges to that of the virtual leader whose velocity cannot be measured by agents in real time. The two cases of switching topologies without communication delay and fixed topology with time-varying communication delay are both considered for multi-agent networks. By using the Lyapunov stability theory, the issue of stability is analysed for multi-agent systems with switching topologies. Then, by considering the time-varying communication delay, the sufficient condition is proposed for the multi-agent systems with fixed topology. Finally, two numerical examples are given to illustrate the effectiveness of the proposed leader-following formation control protocols.

Real-time Operation Optimization in Active Distribution Networks Based on Multi-agent Deep Reinforcement Learning

The increasing integration of intermittent renewable energy sources(RESs)poses great challenges to active distribution networks(ADNs),such as frequent voltage fluctuations.This paper proposes a novel ADN strategy based on multiagent deep reinforcement learning(MADRL),which harnesses the regulating function of switch state transitions for the realtime voltage regulation and loss minimization.After deploying the calculated optimal switch topologies,the distribution network operator will dynamically adjust the distributed energy resources(DERs)to enhance the operation performance of ADNs based on the policies trained by the MADRL algorithm.Owing to the model-free characteristics and the generalization of deep reinforcement learning,the proposed strategy can still achieve optimization objectives even when applied to similar but unseen environments.Additionally,integrating parameter sharing(PS)and prioritized experience replay(PER)mechanisms substantially improves the strategic performance and scalability.This framework has been tested on modified IEEE 33-bus,IEEE 118-bus,and three-phase unbalanced 123-bus systems.The results demonstrate the significant real-time regulation capabilities of the proposed strategy.