QoS-aware service composition is a bi-objectivetask for the generation of a business process: to fulfill functional goals and to optimize the QoS criteria. Planning algorithms are frequently used for the generation of...
详细信息
QoS-aware service composition is a bi-objectivetask for the generation of a business process: to fulfill functional goals and to optimize the QoS criteria. Planning algorithms are frequently used for the generation of a business process to achieve functional goals. In this paper, we use a planning algorithm, GraphPlan, and a graph search algorithm, Dijkstra's algorithm, to achieve both functional goals and QoS optimization at the same time. Firstly, we analyze graph reachability in the planning graph built by Graphplan *** advantage of graph reachability, we propose an approach of using Graphplan technique combined with Dijkstra's algorithm to solve QoS-aware service composition problem. The experiments show our approach is able to findthe optimal solution for different QoS criteria. Moreover, our approach reduces the possibilities of combinatorial explosion to a large degree when exploring the graph for the optimal path.
A novel method combining the nuclear norm minimization (NNM) and continuous-time (CT) subspace identification method (CSIM) is proposed to identify the CT Hammerstein model with little priori information. The nuclear ...
详细信息
The number of malware has sharply increased over years, and it caused various damages on computing systems and data. In this paper, we propose techniques to detect malware variants. Malware authors usually reuse malwa...
详细信息
In case of safety-critical embedded systems, software must have high availability to provide non-stop and reliable service. Therefore, we want to measure the availability of our system. However, using past methods, it...
详细信息
ISBN:
(纸本)9781479974276
In case of safety-critical embedded systems, software must have high availability to provide non-stop and reliable service. Therefore, we want to measure the availability of our system. However, using past methods, it takes a long time to measure availability because of irregular occurrence of faults. In this paper, we present SYNCEYE, which is a kind of fast availability measurement tool. To get the availability in a short period, SYNCEYE only measures MTTR (or downtime) using a fault injector. And then, it just calculates the availability with the heuristic MTTF (or uptime) such as 13.89 hours for achieving 99.999% availability goal. It helps us to decide a direction of optimization of the embedded systems.
Moving Target Defense (MTD) changes the attack surface of a system that confuses intruders to thwart attacks. Various MTD techniques are developed to enhance the security of a networked system, but the effectiveness o...
详细信息
Moving Target Defense (MTD) changes the attack surface of a system that confuses intruders to thwart attacks. Various MTD techniques are developed to enhance the security of a networked system, but the effectiveness of these techniques is not well assessed. Security models (e.g., Attack Graphs (AGs)) provide formal methods of assessing security, but modeling the MTD techniques in security models has not been studied. In this paper, we incorporate the MTD techniques in security modeling and analysis using a scalable security model, namely Hierarchical Attack Representation Models (HARMs), to assess the effectiveness of the MTD techniques. In addition, we use importance measures (IMs) for scalable security analysis and deploying the MTD techniques in an effective manner. The performance comparison between the HARM and the AG is given. Also, we compare the performance of using the IMs and the exhaustive search method in simulations.
Reversible logic transforms logic signal in a way that allows the original input signals to be recovered from the produced outputs, has attracted great attention because of its application in many areas. Traditional s...
详细信息
ISBN:
(纸本)9781479934331
Reversible logic transforms logic signal in a way that allows the original input signals to be recovered from the produced outputs, has attracted great attention because of its application in many areas. Traditional silicon computers consume much more power compared to computing systems based on Deoxyribonucleic Acid (DNA). In addition, DNA-based logic gates are stable and reusable. In this paper, we propose a new approach for designing DNA-based reversible adder/subtractor circuit;it's possible to perform addition and subtraction operations using single circuit representation. We first merge the properties of addition and subtraction operations. Then, we demonstrate reversible DNA-based addition and subtraction operations. Our proposed DNA-based reversible addition/subtraction circuit is faster than the conventional one due to parallelism and replication properties of DNA strands. It also requires less space because of compactness of DNA strands. In addition, the DNA-based adder/subtractor circuit needs low power as the formation of DNAs consumes a small amount of energy. Finally, the comparative results show that the proposed DNA-based system requires m+3.2~n DNA signals, but in existing system, it requires m.2~n, where m is the size of extra tags and n is the total number of bits. Besides, the run time complexity of proposed system has O(1) while the existing system has O(mln_2n).
In this paper, we tackle a novel problem of mining contrast subspaces. Given a set of multidimensional objects in two classes C+ and C - and a query object o, we want to find top-k subspaces S that maximize the ratio ...
详细信息
Question and answer archives have become useful information resources with increase of community based question and answer service. For effective question and answering system, it is important to find semantically sim...
详细信息
Question and answer archives have become useful information resources with increase of community based question and answer service. For effective question and answering system, it is important to find semantically similar questions and retrieve its answer from the archive for user's question. In this paper, we propose a weighted combination of retrieval models for question and answer archives. In contrast to well-known translation based language model, the proposed model reflects significance of each word in user's question by giving variant weight to the word depending on its part-of-speech. In experiment, our model improves performance considerably when compared to conventional ones.
The present idea is a fast indexing technique that builds an indexing structure based on multi-level key ranges typically for large data storage systems. It is explained based on the B + -tree and designed to reside i...
详细信息
The present idea is a fast indexing technique that builds an indexing structure based on multi-level key ranges typically for large data storage systems. It is explained based on the B + -tree and designed to reside in main memory. Point searches and range searches are helped by early termination of searches for non-existent data. Range searches can be processed depth-first or breath-first. One group of multiple searches can be processed with one pass on the indexing structure to minimize total cost. Implementation options and strategies are explained to show the flexibility of this technology for easy adaption and high efficiency. This indexing structure can be tuned to speed up queries directed at popular ranges of index or index ranges of particular interest to the user.
暂无评论