Program Dependence Net and On-demand Slicing for Property Verification of Concurrent System and Software

When checking concurrent software using a finite-state model, we face a formidable state explosion problem. One solution to this problem is dependence-based program slicing, whose use can effectively reduce verification time. It is orthogonal to other model-checking reduction techniques. However, when slicing concurrent programs for model checking, there are conversions between multiple irreplaceable models, and dependencies need to be found for variables irrelevant to the verified property, which results in redundant computation. To resolve this issue, we propose a Program Dependence Net (PDNet) based on Petri net theory. It is a unified model that combines a control-flow structure with dependencies to avoid conversions. For reduction, we present a PDNet slicing method to capture the relevant variables' dependencies when needed. PDNet in verifying linear temporal logic and its on-demand slicing can be used to significantly reduce computation cost. We implement a model-checking tool based on PDNet and its on-demand slicing, and validate the advantages of our proposed methods.Comment: 17 pages, 3 figure

UDP-YOLO: High Efficiency and Real-Time Performance of Autonomous Driving Technology

In recent years, autonomous driving technology has gradually appeared in our field of vision. It senses the surrounding environment by using radar, laser, ultrasound, GPS, computer vision and other technologies, and then identifies obstacles and various signboards, and plans a suitable path to control the driving of vehicles. However, some problems occur when this technology is applied in foggy environment, such as the low probability of recognizing objects, or the fact that some objects cannot be recognized because the fog's fuzzy degree makes the planned path wrong. In view of this defect, and considering that automatic driving technology needs to respond quickly to objects when driving, this paper extends the prior defogging algorithm of dark channel, and proposes UDP-YOLO network to apply it to automatic driving technology. This paper is mainly divided into two parts: 1. Image processing: firstly, the data set is discriminated whether there is fog or not, then the fogged data set is defogged by defogging algorithm, and finally, the defogged data set is subjected to adaptive brightness enhancement; 2. Target detection: UDP-YOLO network proposed in this paper is used to detect the defogged data set. Through the observation results, it is found that the performance of the model proposed in this paper has been greatly improved while balancing the speed

An adaptive multilevel indexing method for disaster service discovery

With the globe facing various scales of natural disasters then and there, disaster recovery is one among the hottest research areas and the rescue and recovery services can be highly benefitted with the advancements of information and communications technology (ICT). Enhanced rescue effect can be achieved through the dynamic networking of people, systems and procedures. A seamless integration of these elements along with the service-oriented systems can satisfy the mission objectives with the maximum effect. In disaster management systems, services from multiple sources are usually integrated and composed into a usable format in order to effectively drive the decision-making process. Therefore, a novel service indexing method is required to effectively discover desirable services from the large-scale disaster service repositories, comprising a huge number of services. With this in mind, this paper presents a novel multilevel indexing algorithm based on the equivalence theory in order to achieve effective service discovery in large-scale disaster service repositories. The performance and efficiency of the proposed model have been evaluated by both theoretical analysis and practical experiments. The experimental results proved that the proposed algorithm is more efficient for service discovery and composition than existing inverted index methods

GAOM: Genetic Algorithm Based Ontology Matching

In this paper a genetic algorithm-based optimization procedure for ontology matching problem is presented as a feature-matching process. First, from a global view, we model the problem of ontology matching as an optimization problem of a mapping between two compared ontologies, and every ontology has its associated feature sets. Second, as a powerful heuristic search strategy, genetic algorithm is employed for the ontology matching problem. Given a certain mapping as optimizing object for GA, fitness function is defined as a global similarity measure function between two ontologies based on feature sets. Finally, a set of experiments are conducted to analysis and evaluate the performance of GA in solving ontology matching problem