Planning,monitoring and replanning techniques for handling abnormity in HTN-based planning and execution

A framework that integrates planning,monitoring and replanning techniques is proposed.It can devise the best solution based on the current state according to specific objectives and properly deal with the influence of abnormity on the plan execution.The framework consists of three parts:the hierarchical task network(HTN)planner based on Monte Carlo tree search(MCTS),hybrid plan monitoring based on forward and backward and norm-based replanning method selection.The HTN planner based on MCTS selects the optimal method for HTN compound task through pre-exploration.Based on specific objectives,it can identify the best solution to the current problem.The hybrid plan monitoring has the capability to detect the influence of abnormity on the effect of an executed action and the premise of an unexecuted action,thus trigger the replanning.The norm-based replanning selection method can measure the difference between the expected state and the actual state,and then select the best replanning algorithm.The experimental results reveal that our method can effectively deal with the influence of abnormity on the implementation of the plan and achieve the target task in an optimal way.

The Trade-Off Between Performance and Security of Virtualized Trusted Execution Environment on Android

Nowadays,with the significant growth of the mobile market,security issues on the Android Operation System have also become an urgent matter.Trusted execution environment(TEE)technologies are considered an option for satisfying the inviolable property by taking advantage of hardware security.However,for Android,TEE technologies still contain restrictions and limitations.The first issue is that non-original equipment manufacturer developers have limited access to the functionality of hardware-based TEE.Another issue of hardware-based TEE is the cross-platform problem.Since every mobile device supports different TEE vendors,it becomes an obstacle for developers to migrate their trusted applications to other Android devices.A software-based TEE solution is a potential approach that allows developers to customize,package and deliver the product efficiently.Motivated by that idea,this paper introduces a VTEE model,a software-based TEE solution,on Android devices.This research contributes to the analysis of the feasibility of using a virtualized TEE on Android devices by considering two metrics:computing performance and security.The experiment shows that the VTEE model can host other software-based TEE services and deliver various cryptography TEE functions on theAndroid environment.The security evaluation shows that adding the VTEE model to the existing Android does not addmore security issues to the traditional design.Overall,this paper shows applicable solutions to adjust the balance between computing performance and security.

Development of a distributed and integratable manufacturing execution system framework

Using remote method invocation (RMI) and a distributed object-oriented technique, this paper presents a systematic approach to developing a manufacturing execution system (MES) framework, which is open, modularized, distributed, configurable, interoperable and maintainable. Moreover, the design patterns for the framework .are developed and a variety of functional components are designed by inheriting appropriate patterns. And then an application is constructed by invoking corresponding methods of related components. An MES system implementing the framework and design patterns can be facilely integrated with other manufacturing applications, such as enterprise resource planning (ERP) and floor control system (FCS) .

Optimization of RDF link traversal based query execution

Aiming at the problem that only some types of SPARQL （ simple protocal and resource description framework query language） queries can be answered by using the current resource description framework link traversal based query execution （RDF-LTE） approach, this paper discusses how the execution order of the triple pattern affects the query results and cost based on concrete SPARQL queries, and analyzes two properties of the web of linked data, missing backward links and missing contingency solution. Then three heuristic principles for logic query plan optimization, namely, the filtered basic graph pattern （FBGP） principle, the triple pattern chain principle and the seed URIs principle, are proposed. The three principles contribute to decrease the intermediate solutions and increase the types of queries that can be answered. The effectiveness and feasibility of the proposed approach is evaluated. The experimental results show that more query results can be returned with less cost, thus enabling users to develop the full potential of the web of linked data.

Method for test case selection and execution of web application regression testing

In order to improve the efficiency of regression testing in web application,the control flow graph and the greedy algorithm are adopted.This paper considers a web page as a basic unit and introduces a test case selection method for web application regression testing based on the control flow graph.This method is safe enough to the test case selection.On the base of features of request sequence in web application,the minimization technique and the priority of test cases are taken into consideration in the process of execution of test cases in regression testing for web application.The improved greedy algorithm is also raised resulting in optimization of execution of test cases.The experiments indicate that the number of test cases which need to be retested is reduced,and the efficiency of execution of test cases is also improved.

ARCHITECTURE OF MANUFACTURING EXECUTION SYSTEM IN THE EXTENDED ENTERPRISE

The extended enterprise is formed according to the philosophy of dispersednetworked manufacturing. Manufacturing execution system (MES) can close the information gap whichexists between device control system and production information management system. The functions andthe web-based architecture of the MES in the extended enterprise are introduced. Using thecooperating system models of object-oriented and distributed agents and CORBA, all objects keep touniform interface standards and are easily inserted to object request broker. The utilization ofdistributed MES in extended enterprise can adapt fast change of manufacturing environment andresource. It also can improve the independent management capability of manufacturing cell and theenterprise response capability to global economic competition.

Material-flow Modeling Technology and Its Application in Manufacturing Execution Systems of Petrochemical Industry

The management and control of material flow forms the core of manufacturing execution systems （MES） in the petrochemical industry. The bottleneck in the application of MES is the ability to match the material-flow model with the production processes. A dynamic material-flow model is proposed in this paper after an analysis of the material-flow characteristics of the production process in a petrochemical industry. The main material-flow events are described, including the movement, storage, shifting, recycling, and elimination of the materials. The spatial and temporal characters of the material-flow events are described, and the material-flow model is constructed. The dynamic material-flow model introduced herein is the basis for other subsystems in the MES. In addition, it is the subsystem with the least scale in MES. The dynamic-modeling method of material flow has been applied in the development of the SinoMES model. It helps the petrochemical plant to manage the entire flow information related to tanks and equipments from the aspects of measurement, storage, movement, and the remaining balance of the material. As a result, it matches the production process by error elimination and data reconciliation. In addition, it facilitates the integration of application modules into the MES and guarantees the potential development of SinoMES in future applications.

Event-driven process execution model for process virtual machine

Current orchestration and choreography process engines only serve with dedicate process languages.To solve these problems,an Event-driven Process Execution Model(EPEM) was developed.Formalization and mapping principles of the model were presented to guarantee the correctness and efficiency for process transformation.As a case study,the EPEM descriptions of Web Services Business Process Execution Language(WS-BPEL) were represented and a Process Virtual Machine(PVM)-OncePVM was implemented in compliance with the EPEM.

Tension leg platform project execution

The first floating platform concept design work for South China Sea is undergoing in DMAR's office now. This tension leg platform has potential to become the first advanced floating production platform project. Project execution is always a challenge for floating system. This paper focuses on the critical elements of project execution for tension leg platform,and studies potential implications to future oil and gas exploration in South China Sea. There are many factors affecting successful execution of floating system project,including technical issues, engineering management,interface management,etc. There are also failure examples of project execution in the industry. The author has participated 28 large detailed projects and has gained extensive experience on floating projects,with ample hands-on project experiences. A detailed tension leg platform project study example and discussions in depth are presented for future project execution in China deepwater development.

A model for mold collaborative manufacturing execution system based on Web Service

Mold manufacturing Extended Enterprise （EE） has the following characteristics： distributed in locality, tight cooperation and frequent information exchange. It needs a collaborative, highly efficient, reliable and intelligent manufacturing management system. The background of the Collaborative Manufacturing is introduced. A mold Collaborative Manufacturing Execution System （c-MES） is proposed. The feature of Web Service platform is analyzed. The necessity and feasibility of importing the Web Service to mold c-MES are discussed. Based on Web Service, the model of mold c-MES is built. Every module＇ s function is described in detail, including the functions it supplies and the mechanism of information interaction among them. The feasibility of mold c-MES model is validated by a real mold manufacturing case.

Reliable Estimation of Execution Time of MapReduce Program

As data volume grows, many enterprises are considering using MapReduce for its simplicity. However, how to evaluate the performance improvement before deployment is still an issue. Current researches of MapReduce performance are mainly based on monitoring and simulation, and lack mathematical models. In this paper, we present a simple but powerful performance model for the prediction of the execution time of a MapReduce program with limited resources. We study each component of MapReduce framework, and analyze the relation between the overall performance and the number of mappers and reducers based on our model. Two typical MapReduce programs are evaluated in a small cluster with 13 nodes. Experimental results show that the mathematical performance model can estimate the execution time of MapReduce programs reliably. According to our model, number of mappers and reducers can be tuned to form a better execution pipeline and lead to better performance. The model also points out potential bottlenecks of the framework and future improvement.

Modeling of Agile Manufacturing Execution Systems with an Agent-based Approach

Agile manufacturing execution systems (AMES) are used to help manufacturers optimize shop floor production in an agile way. And the modeling of AMES is the key issue of realizing AMES. This paper presents an agent-based approach to AMES modeling. Firstly, the characteristics of AMES and its requirements on modeling are discussed. Secondly, a comparative analysis of modeling methods is carried out, and AMES modeling using an agent-based approach is put forward. Agent-based modeling method not only inherit the favorable features of traditional object-oriented modeling method such as data encapsulation, modularity and so on, but also has the ability to construct intelligent, rational and autonomous agent which can cooperate together to realize the goal of agile operation. A general agent architecture used in AMES modeling is described. Under this architecture, an agent can be divided into domain-independent components and domain-specific components which helps solve problems such as information overload, incomplete information handling and soft decision-making. Furthermore, an AMES model using four types of agents, i.e., interface agent, information agent, resource agent and management agent, is established. Thirdly, a snapshot of AMES model is provided in the case study. Especially, an agent-based cooperating process of task scheduling in AMES is illustrated in detail. Finally, the advantages and disadvantages of this modeling approach are discussed as well.

An Optimized Resource Scheduling Strategy for Hadoop Speculative Execution Based on Non-cooperative Game Schemes

Hadoop is a well-known parallel computing system for distributed computing and large-scale data processes.“Straggling”tasks,however,have a serious impact on task allocation and scheduling in a Hadoop system.Speculative Execution(SE)is an efficient method of processing“Straggling”Tasks by monitoring real-time running status of tasks and then selectively backing up“Stragglers”in another node to increase the chance to complete the entire mission early.Present speculative execution strategies meet challenges on misjudgement of“Straggling”tasks and improper selection of backup nodes,which leads to inefficient implementation of speculative executive processes.This paper has proposed an Optimized Resource Scheduling strategy for Speculative Execution(ORSE)by introducing non-cooperative game schemes.The ORSE transforms the resource scheduling of backup tasks into a multi-party non-cooperative game problem,where the tasks are regarded as game participants,whilst total task execution time of the entire cluster as the utility function.In that case,the most benefit strategy can be implemented in each computing node when the game reaches a Nash equilibrium point,i.e.,the final resource scheduling scheme to be obtained.The strategy has been implemented in Hadoop-2.x.Experimental results depict that the ORSE can maintain the efficiency of speculative executive processes and improve fault-tolerant and computation performance under the circumstances of Normal Load,Busy Load and Busy Load with Skewed Data.

SecMVX:Analysis on the Vulnerability of Multi-Variant Execution

As an active defenses technique,multivariant execution(MVX)can detect attacks by monitoring the consistency of heterogeneous variants with parallel execution.Compared with patch-style passive defense,MVX can defend against known and even unknown vulnerability-based attacks without relying on attack feature information.However,variants generated with software diversity technologies will introduce new vulnerabilities when they execute in parallel.First,we analyze the security of MVX theory from the perspective of formal description.Then we summarize the general forms and techniques for attacks against MVX,and analyze the new vulnerabilities arising from the combination of variant generation technologies.We propose SecMVX,a secure MVX architecture and variant generation technology.Experimental evaluations based on CVEs and SPEC 2006 benchmark show that SecMVX introduces 11.29%of the average time overhead,and avoids vulnerabilities caused by the improper combination of variant generation technologies while keeping the defensive ability of MVX.

IMPROVED EXECUTION METHOD OF TENTACLE ALGORITHM FOR INTELLIGENT VEHICLE

In order to solve some deficiencies in tentacle execution, an improved execution method of tentacle algo- rithm is presented. The method uses a short trajectory to match the curvature between the path of vehicle and ten- tacle, rather than computing a whole steady state. To control vehicle motion via wheel force and steering angle, two parameters should be discretized under certain area and these discrete values can form 18 5〈 20 groups. Then the curvature between the trajectory and tentacle should be matched, and the corresponding group of wheel force and steering angle can be found. The flow chart of the improved execution method is given, and simulation is per- formed on a platform named ＂pro-sivic＂. The simulation results show that the improved method can maintain the advantage of the tentacle algorithm in terms of computation speed, and avoid the errors such as endless loop and data overflow, which proves the method more efficient.

A Trading Execution Model Based on Mean Field Games and Optimal Control

We present a trading execution model that describes the behaviour of a big trader and of a multitude of retail traders operating on the shares of a risky asset. The retail traders are modeled as a population of “conservative” investors that: 1) behave in a similar way, 2) try to avoid abrupt changes in their trading strategies, 3) want to limit the risk due to the fact of having open positions on the asset shares, 4) in the long run want to have a given position on the asset shares. The big trader wants to maximize the revenue resulting from the action of buying or selling a (large) block of asset shares in a given time interval. The behaviour of the retail traders and of the big trader is modeled using respectively a mean field game model and an optimal control problem. These models are coupled by the asset share price dynamic equation. The trading execution strategy adopted by the retail traders is obtained solving the mean field game model. This strategy is used to formulate the optimal control problem that determines the behaviour of the big trader. The previous mathematical models are solved using the dynamic programming principle. In some special cases explicit solutions of the previous models are found. An extensive numerical study of the trading execution model proposed is presented. The interested reader is referred to the website: http://www.econ.univpm.it/recchioni/finance/w19 to find material including animations, an interactive application and an app that helps the understanding of the paper. A general reference to the work of the authors and of their coauthors in mathematical finance is the website:?http://www.econ.univpm.it/recchioni/finance.

Specifying the Global Execution Context of Computer-Mediated Tasks: A Visual Notation and a Supporting Tool

This paper presents the notion of the global execution context of a task as a representational construct for analysing complexity in software evolution. Based on this notion a visual notation and a supporting tool are presented to support specification of a system’s global execution context. A system’s global execution context is conceived as an evolving network of use scenarios depicted by nodes and links designating semantic relationships between scenarios. A node represents either a base or a growth scenario. Directed links characterize the transition from one node to another by means of semantic scenario relationships. Each growth scenario is generated following a critique (or screening) of one or more base or reference scenarios. Subsequently, representative growth scenarios are compiled and consolidated in the global execution context graph. The paper describes the stages of this process, presents the tool designed to facilitate the construction of the global execution context graph and elaborates on recent practice and experience.

Detecting Bank Conflict of GPU Programs Using Symbolic Execution—Case Study

GPU (Graphics Processing Unit) is used in various areas. Therefore, the demand for the verification of GPU programs is increasing. In this paper, we suggest the method to detect bank conflict by using symbolic execution. Bank conflict is one of the bugs happening in GPU and it leads the performance of programs lower. Bank conflict happens when some processing units in GPU access the same shared memory. Symbolic execution is the method to analysis programs with symbolic values. By using it, we can detect bank conflict on GPU programs which use many threads. We implement a prototype of the detector for bank conflict and evaluate it with some GPU programs. The result states that we can detect bank conflict on the programs with no loop regardless of the number of threads.

Cross the chasm from the immediate execution of death penalty to the death sentence with a reprieve --- Interpretation of the ＂not to execute immediately＂

Retaining the death penalty and strict restricting the application of the death penalty is now a basic criminal policy in China, and from the judicial level, the key to the restriction of the death penalty is to study what lenient sentencing discretion the criminal has to constitute ＂not to execute immediately＂ when he has reached the standard of the immediate execution of the death penalty, to cross the chasm from the immediate execution of the death penalty to the death sentence with a reprieve. The basic process of the sentencing is to establish a baseline punishment on the basis of the social harmfulness of the activities of the criminal, and then measure the profits and losses according to the offender＇s personal danger. Therefore, although the social harmfulness of the activities of the criminal reaches the standard of the ＂most heinous crimes＂, due to the existence of the fault of the victim, active compensation for the victim, and the motives of the small blames and other lenient sentencing discretions, the criminal＇s danger has not reached the degree of ＂flagrance＂. Apply the death sentence with a two-year reprieve and even the life imprisonment generally. If there are some strict sentencing discretions, such as ＂the crime means is extremely cruel＂, carefully consider the use of the immediate execution of the death penalty. Under the circumstances of the concurrence of the sentencing, carry on the overall consideration based on the comprehensive measurement of various circumstances of the sentencing.

A New Speculative Execution Algorithm Based on C4.5 Decision Tree for Hadoop

As a distributed computing platform, Hadoop provides an effective way to handle big data. In Hadoop, the completion time of job will be delayed by a straggler. Although the definitive cause of the straggler is hard to detect, speculative execution is usually used for dealing with this problem, by simply backing up those stragglers on alternative nodes. In this paper, we design a new Speculative Execution algorithm based on C4.5 Decision Tree, SECDT, for Hadoop. In SECDT, we speculate completion time of stragglers and also of backup tasks, based on a kind of decision tree method: C4.5 decision tree. After we speculate the completion time, we compare the completion time of stragglers and of the backup tasks, calculating their differential value, and selecting the straggler with the maximum differential value to start the backup task.Experiment result shows that the SECDT can predict execution time more accurately than other speculative execution methods, hence reduce the job completion time.