Modern compilers use machine learning to find from their prior experience useful heuristics for new programs encountered in order to accelerate the optimization process. However, prior experience might not be applicab...
详细信息
Modern compilers use machine learning to find from their prior experience useful heuristics for new programs encountered in order to accelerate the optimization process. However, prior experience might not be applicable for outlier programs with unfamiliar code features. This paper presents a Reverse K-nearest neighbor (RKNN) algorithm based approach for outlier detection. The compiler can therefore launch a search within an optimization space when outlier programs are encountered, or directly apply its experience to non-outliers. Preliminary experimental results demonstrate the effectiveness of the approach.
The generating rule method is presented for incompatible and incomplete information of test data based on Bayesian theory. Firstly, the rule's conditional probability is calculated when the certainty (reliability)...
详细信息
The road to a successful introduction of vehicular communications has to pass through the analysis of potential security threats and the design of robust security architecture able to cope with these threats. Ad hoc n...
详细信息
ISBN:
(纸本)9781424479573
The road to a successful introduction of vehicular communications has to pass through the analysis of potential security threats and the design of robust security architecture able to cope with these threats. Ad hoc networks are a new wireless networking paradigm for mobile hosts. In this paper, we designed a framework of intelligent transport system. The main task of the road condition information transferring module is deal with the information exchange of the car inside, car to car and car to road. Vehicular networks are likely to become the most relevant form of mobile ad hoc networks. In the ITS of this paper, we concern the security issues of VANETs from some aspects and provide the appropriate solving measures. To make sure the ITS can be used under the security pattern.
In this work, a framework of multimedia retrieval system basing on the MPEG-7 standard as information schema will be proposed. It provides a content-based retrieval method which uses MPEG-7 Metadata description. T...
详细信息
ISBN:
(纸本)9781424479573
In this work, a framework of multimedia retrieval system basing on the MPEG-7 standard as information schema will be proposed. It provides a content-based retrieval method which uses MPEG-7 Metadata description. The high efficient of multimedia retrieval as well as the data management is an important issue. Tending to query the multimedia data, the previous text-based retrieval system is too difficult for users to specify the data they want. So it is necessary to query multimedia itself or metadata based document Our retrieval system can accept multimedia examples or metadata-based documents. The annotation and feature extraction of multimedia data will be discussed in this paper, and the organization of source multimedia data as well as other data structure for managing and storing will be discussed too. At the end a new method of metadata representation is proposed.
Thread migration is an effective technique for fault resilience and load balancing in high performance computing. However, flexible thread migration is not easy to achieve. In this paper, we present an approach to cre...
详细信息
Thread migration is an effective technique for fault resilience and load balancing in high performance computing. However, flexible thread migration is not easy to achieve. In this paper, we present an approach to creating migratory threads dynamically at application level. The targets must be executable source files. Compared to the static ones, the number of threads created during migration with the new scheme is independent from the context. Various thread cases are considered for migration. Thread state is handled at application level. Variables are saved in structures in C language for speedy state construction. In order to solve the inability of traditional methods in tracking the created threads, a tree of active function calls is used to record the callback. The preprocessor of the proposed one is written in YACC for accuracy and programmability. The migration enabling process is transparent to programmers with the help of the preprocess. The experimental results have demonstrated the effectiveness of this approach.
According to the Internet of Services vision, composite services are created by composing services to complex business processes. The relationships between services in a composition are defined by Service Level Agreem...
详细信息
According to the Internet of Services vision, composite services are created by composing services to complex business processes. The relationships between services in a composition are defined by Service Level Agreements (SLAs). Managing composite SLAs is a complex task which is currently performed manually. In this paper we present an approach for automating the management of composite SLAs by exploiting the explicit knowledge about dependencies between composed services. We define a formal model for representing a set of dependencies. A set of algorithms exploits this information to automate tasks of composite SLA management. These tasks are the validation of SLAs during negotiation, the evaluation of SLA renegotiation requests and the evaluation of SLA violations with regard to their effects on other services. We have validated our approach based on a logistics scenario. We present results with respect to performance and a set of test cases demonstrating the added value of dependency information based automated SLA management.
In complex service-oriented business processes the composed services depend on other services to contribute to the common goal. These dependencies have to be considered when service compositions should be changed. Inf...
ISBN:
(纸本)9789898425201
In complex service-oriented business processes the composed services depend on other services to contribute to the common goal. These dependencies have to be considered when service compositions should be changed. Information about dependencies is only implicitly available from service level agreements and process descriptions. In this paper we present a semi-automatic approach to analyze service dependencies and capture information about them explicitly in a dependency model. Furthermore, we describe a system architecture which covers the whole process of dependency analysis, dependency model creation and provisioning. It has been implemented based on a healthcare scenario.
This paper deals with the partial target coverage (PTC) problem in wireless sensor networks with the objective of optimizing network lifetime. We first build a linear programming formulation, which takes total time a ...
详细信息
This paper deals with the partial target coverage (PTC) problem in wireless sensor networks with the objective of optimizing network lifetime. We first build a linear programming formulation, which takes total time a sensor spends on covering some targets into consideration, in order to obtain a lifetime upper bound. Then, based on the information of this formulation, we develop a sensor assignment algorithm to seek an optimal time table meeting the lifetime upper bound. A formal proof of optimality is given. We compare the proposed algorithm with a state-of-the-art algorithm: column generation approach and show that the proposed algorithm significantly outperforms in terms of computational time. Experiments have been conducted to study the effect of network parameters on network lifetime and interesting insights have been offered.
The paper is devoted to intelligent matching ontological subgraphs to concepts. The problem is considered from the point of view of rough set theory. An accuracy of approximation determines how far in a semantic space...
详细信息
The paper is devoted to intelligent matching ontological subgraphs to concepts. The problem is considered from the point of view of rough set theory. An accuracy of approximation determines how far in a semantic space it is from a given ontological subgraph to a given concept. The approach presented in the paper can be applied to intelligent searching of a bibliographical data base for abstracts semantically close to the given concepts (keywords).
暂无评论