Analyzing the Impact of Scene Transitions on Indoor Camera Localization through Scene Change Detection in Real-Time

Real-time indoor camera localization is a significant problem in indoor robot navigation and surveillance systems.The scene can change during the image sequence and plays a vital role in the localization performance of robotic applications in terms of accuracy and speed.This research proposed a real-time indoor camera localization system based on a recurrent neural network that detects scene change during the image sequence.An annotated image dataset trains the proposed system and predicts the camera pose in real-time.The system mainly improved the localization performance of indoor cameras by more accurately predicting the camera pose.It also recognizes the scene changes during the sequence and evaluates the effects of these changes.This system achieved high accuracy and real-time performance.The scene change detection process was performed using visual rhythm and the proposed recurrent deep architecture,which performed camera pose prediction and scene change impact evaluation.Overall,this study proposed a novel real-time localization system for indoor cameras that detects scene changes and shows how they affect localization performance.

Distributed localization for anchor-free sensor networks

Geographic location of nodes is very useful in a sensor network. Previous localization algorithms assume that there exist some anchor nodes in this kind of network, and then other nodes are estimated to create their coordinates. Once there are not anchors to be deployed, those localization algorithms will be invalidated. Many papers in this field focus on anchor-based solutions. The use of anchors introduces many limitations, since anchors require external equipments such as global position system, cause additional power consumption. A novel positioning algorithm is proposed to use a virtual coordinate system based on a new concept--virtual anchor. It is executed in a distributed fashion according to the connectivity of a node and the measured distances to its neighbors. Both the adjacent member information and the ranging distance result are combined to generate the estimated position of a network, one of which is independently adopted for localization previously. At the position refinement stage the intermediate estimation of a node begins to be evaluated on its reliability for position mutation; thus the positioning optimization process of the whole network is avoided falling into a local optimal solution. Simulation results prove that the algorithm can resolve the distributed localization problem for anchor-free sensor networks, and is superior to previous methods in terms of its positioning capability under a variety of circumstances.

Fast parallel factor decomposition technique for coherently distributed source localization

This paper links parallel factor（PARAFAC） analysis to the problem of nominal direction-of-arrival（DOA） estimation for coherently distributed（CD） sources and proposes a fast PARAFACbased algorithm by establishing the trilinear PARAFAC model.Relying on the uniqueness of the low-rank three-way array decomposition and the trilinear alternating least squares regression, the proposed algorithm achieves nominal DOA estimation and outperforms the conventional estimation of signal parameter via rotational technique CD（ESPRIT-CD） and propagator method CD（PM-CD）methods in terms of estimation accuracy. Furthermore, by means of the initialization via the propagator method, this paper accelerates the convergence procedure of the proposed algorithm with no estimation performance degradation. In addition, the proposed algorithm can be directly applied to the multiple-source scenario,where sources have different angular distribution shapes. Numerical simulation results corroborate the effectiveness and superiority of the proposed fast PARAFAC-based algorithm.

Distributed Plume Source Localization Using Hierarchical Sensor Networks

A hierarchical wireless sensor networks(WSN) was proposed to estimate the plume source location.Such WSN can be of tremendous help to emergency personnel trying to protect people from terrorist attacks or responding to an accident.The entire surveillant field is divided into several small sub-regions.In each sub-region,the localization algorithm based on the improved particle filter(IPF) was performed to estimate the location.Some improved methods such as weighted centroid,residual resampling were introduced to the IPF algorithm to increase the localization performance.This distributed estimation method eliminates many drawbacks inherent with the traditional centralized optimization method.Simulation results show that localization algorithm is efficient for estimating the plume source location.

Distributed Sensor Network Based on RFID System for Localization of Multiple Mobile Agents

This paper presents a distributed wireless sensor network for multiple mobile agents localization. Localization of mobile agents, such as mobile robots, humans, and moving objects, in an indoor space is essential for robot-robot interaction (RRI) and human-robot interaction (HRI). The standard localization system, which is based on sensors installed in the robot body, is not suitable for multiple agents. Therefore, the concept of sensor network, which uses wireless sensors distributed in a specified space, is used in this study. By analyzing related studies, two solutions are proposed for the localization of mobile agents including humans: a new hardware system and a new software algorithm. The first solution focuses on the architectural design of the wireless sensor network for multiple agent localization. A passive RFID system is used, and then the architecture of the sensor network is adapted to suit the target system. The second solution centers on a localization algorithm based on the sensor network. The proposed localization algorithm improves the accuracy in the multiple agent localization system. The algorithm uses the displacement conditions of the mobile agents and the recognition changes between the RFID tags and RFID reader. Through experiments using a real platform, the usefulness of the proposed system is verified.

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.

Localization of Distributed Fiber Sensor Employing a Sub-Ring

A simple distributed optical fiber sensing system used to monitor vibration signal has an additional sub-loop eoupled with main ring by a 3 dB coupler. This paper compares three outputting interfered beams, each of them travels in the sub-ring 0, 1, 2 times, separately. Using the simultaneous equations produced by those three outputs, we find the relation between the interference lights and vibration signal＇s characteristics, such as frequency, amplitude and position. Through simplifying and calculating, the vibration position can be obtained finally.

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.

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.

A Cooperative Distributed System for Real-Time Route Guidance

This paper describes a cooperative decentralized architecture for reactive real-time route guidance. The architecture is cooperative in the sense that it allows adjacent local controllers to exchange information regarding the traffic conditions in their territories. A set of local decision rules and associated heuristic functions to support the cooperative architecture are specified. A protocol governing the knowledge exchange among local adjacent controllers is developed. A simulation-assignment modeling framework is used for assessing the effectiveness of this cooperative architecture under various levels of controller knowledge and network traffic congestion. The cooperative decentralized system is tested under various scenarios of knowledge and cooperation and network traffic demand levels. The cooperative system is compared against the shortest path algorithm as a benchmark.

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.

Cd Distribution and Subcellular Localization in Leaf and Its Effects on Growth of Soybean(Glycine max) Seedlings

In order to investigate Cd accumulation, subcellular distribution, and local-ization in soybean seedlings leaves, soybean seedlings were cultivated in solution containing different concentrations of Cd. The results showed that most Cd associ-ated with the cellwal s and soluble fractions, and a minor part of Cd presented in mitochondria fractions, nuclear and chloroplast fractions, especial y exposure to high Cd concentrations. Under 20.00 mg/L Cd stress, Cd subcellular distribution fol owed a sequence as： soluble fractions （55.00%）＆gt;cellwal s （30.0%）＆gt;mitochondria fractions （8.21%）＆gt;nuclear and chloroplast fractions （6.79%）. Deposited Cd black particles were observed in cellwal s, chloroplasts, nuclei, and vacuoles through electrical microscope slice. This fact indicated that the cellwal s of soybean leaves were the first protecting organel es from Cd toxicity, and the cellwal s and soluble fractions were the main place for Cd storage. Due to Cd accumulated in the organel es, the intercellular space was enlarged and the subcellular structure was damaged, especial y for the chloroplasts.

Q-Learning-Assisted Meta-Heuristics for Scheduling Distributed Hybrid Flow Shop Problems

The flow shop scheduling problem is important for the manufacturing industry.Effective flow shop scheduling can bring great benefits to the industry.However,there are few types of research on Distributed Hybrid Flow Shop Problems(DHFSP)by learning assisted meta-heuristics.This work addresses a DHFSP with minimizing the maximum completion time(Makespan).First,a mathematical model is developed for the concerned DHFSP.Second,four Q-learning-assisted meta-heuristics,e.g.,genetic algorithm(GA),artificial bee colony algorithm(ABC),particle swarm optimization(PSO),and differential evolution(DE),are proposed.According to the nature of DHFSP,six local search operations are designed for finding high-quality solutions in local space.Instead of randomselection,Q-learning assists meta-heuristics in choosing the appropriate local search operations during iterations.Finally,based on 60 cases,comprehensive numerical experiments are conducted to assess the effectiveness of the proposed algorithms.The experimental results and discussions prove that using Q-learning to select appropriate local search operations is more effective than the random strategy.To verify the competitiveness of the Q-learning assistedmeta-heuristics,they are compared with the improved iterated greedy algorithm(IIG),which is also for solving DHFSP.The Friedman test is executed on the results by five algorithms.It is concluded that the performance of four Q-learning-assisted meta-heuristics are better than IIG,and the Q-learning-assisted PSO shows the best competitiveness.

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.

A Distributed Optimal Scheme Based on Local QoS for Web Service Composition

The goal of web service composition is to choose an optimal scheme according to Quantity of Service （QoS） which selects instances in a distributed network. The networks are clustered with some web services such as ontologies, algorithms and rule engines with similar function and interfaces. In this scheme, web services acted as candidate service construct a distributed model which can＇t obtain the global services＇ information. The model is utilized to choose instances according to local QoS information in the progress of service composition. Some QoS matrixes are used to record and compare the instance paths and then choose a better one. Simulation result has proven that our ~pproach has a tradeoff between efficiency and ~quality.

Locally Minimum Storage Regenerating Codes in Distributed Cloud Storage Systems

In distributed cloud storage systems, inevitably there exist multiple node failures at the same time. The existing methods of regenerating codes, including minimum storage regenerating(MSR) codes and minimum bandwidth regenerating(MBR) codes, are mainly to repair one single or several failed nodes, unable to meet the repair need of distributed cloud storage systems. In this paper, we present locally minimum storage regenerating(LMSR) codes to recover multiple failed nodes at the same time. Specifically, the nodes in distributed cloud storage systems are divided into multiple local groups, and in each local group(4, 2) or(5, 3) MSR codes are constructed. Moreover, the grouping method of storage nodes and the repairing process of failed nodes in local groups are studied. Theoretical analysis shows that LMSR codes can achieve the same storage overhead as MSR codes. Furthermore, we verify by means of simulation that, compared with MSR codes, LMSR codes can reduce the repair bandwidth and disk I/O overhead effectively.

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.