The development of microarray-based high-throughput gene expression has led to the hope that this technology could provide an efficient cancer diagnosis and classification platform. A major problem in these gene expre...
详细信息
In today's Web environment, many enterprises decide to implement and publish their applications on the Internet using Web services technology. In many cases, a single service is not sufficient to fulfill the user&...
详细信息
In today's Web environment, many enterprises decide to implement and publish their applications on the Internet using Web services technology. In many cases, a single service is not sufficient to fulfill the user's request. To solve this problem, services should be combined together. Therefore, composition of Web services is one of the recent critical issues. A number of approaches have been presented, to tackle this problem. In this paper, we categorize these approaches into four categories (workflow-based, AI-planning based, syntactic-based, and semantic-based). Then, we compare these approaches based on some criteria (like QoS, scalability, and correctness). Investigation of that classification will help researchers who are working on service composition to deliver more applicable solutions.
The multiobjective Quadratic Assignment Problem (mQAP) is considered as one of the hardest optimization problems but with many real-world applications. Since it may not be possible to simply weight the importance of e...
详细信息
Since many organizations recently decide to implement and publish their applications over Internet, the number of Web services has dramatically increased. In many cases, a single service is not sufficient to respond t...
详细信息
Since many organizations recently decide to implement and publish their applications over Internet, the number of Web services has dramatically increased. In many cases, a single service is not sufficient to respond to the user’s request. In order to tackle this problem, services have to be combined together. Therefore, composition of Web services is one of the recent critical issues. Several approaches have been presented, to tackle this problem. In this paper, we classify these approaches into four categories namely Workflow-based, AI-planning based, Syntactic-based, and Ontology-based. Then, we describe and compare these approaches using some criteria (like QoS, scalability, and correctness). The overall results indicate that some AI-planning and Ontology based approaches like HTN-DL and WSMO satisfy most of the criteria.
Web services are the preferred standards-based way to realize service oriented architecture (SOA) computing. A problem that has become one of the recent critical issues is automated composition of Web services. A numb...
详细信息
Web services are the preferred standards-based way to realize service oriented architecture (SOA) computing. A problem that has become one of the recent critical issues is automated composition of Web services. A number of approaches have been proposed to resolve the problem. However, discovery and composition of Web services have been neglected by majority of those approaches. In this paper, we propose an approach called AIMO, based on AI-planning and Web service modeling ontology (WSMO), which are adapted and extended to tackle the mentioned problem. Moreover, we propose a translator to provide interaction between WSMO and AI-planning. We start with presenting the AIMO architecture which shows all components of the proposed approach. Finally, a simple case study is designed to test some components of AIMO. The preliminary results of the test demonstrate that our approach provides an applicable solution.
In this paper we focus on the notion of robust matrix root-clustering analysis in a union of regions that are possibly disjoint and non symmetric. Indeed this work aims at computing a bound on the size of the uncertai...
详细信息
In this paper we focus on the notion of robust matrix root-clustering analysis in a union of regions that are possibly disjoint and non symmetric. Indeed this work aims at computing a bound on the size of the uncertainty domain preserving matrix D u -stability. A Linear Fractional Transform (LFT) uncertainty is considered. To reduce conservatism, a new approach, based on some generalized S-procedure, is addressed. In the case where the studied matrices depend afflnely on the uncertain parameters or when the studied matrices are subject to polytopic uncertainty, it is known that recently developed L.M.J conditions are effective to assess the robust performance in a less conservative fashion. This paper further extends the preceding results and propose a unified way to obtain new L.M.J conditions even in the case of rational parameter dependence. Some conservatism induced by some techniques encountered in the literature is here reduced .
This paper introduces a novel particle swarm optimization algorithm based on the concept of black holes in physics, called random black hole particle swarm optimization (RBH-PSO) for the first time. In each dimension ...
详细信息
ISBN:
(纸本)9781424423101
This paper introduces a novel particle swarm optimization algorithm based on the concept of black holes in physics, called random black hole particle swarm optimization (RBH-PSO) for the first time. In each dimension of a particle, we randomly generate a black hole located nearest to the best particle of the swarm in current generation and then randomly pull particles of the swarm into the black hole with a probability p. By this mechanism of random black hole, we can give all the particles another interesting direction to converge as well as another chance to fly out of local minima when a premature convergence happens. Several experiments on fifteen benchmark test functions are conducted to demonstrate that the proposed RBH-PSO algorithm is able to speedup the evolution process distinctly and improve the performance of global optimizer greatly. Finally, an actual application of the proposed algorithm to spam detection is conducted then compared to other three current methods.
Image segmentation is process of partitioning a digital image into multiple sets ofpixels called *** this paper,the technique of image segmentation used focused on color image since the output of pattern must be in **...
详细信息
Image segmentation is process of partitioning a digital image into multiple sets ofpixels called *** this paper,the technique of image segmentation used focused on color image since the output of pattern must be in *** present the implementation of block segmentation as a technique to convert a color image into cross stitch *** segmentation is used by considering the characteristic of cross stitch pattern itself.
This paper presents a method of ontology-based sentiment classification to classify and analyse online product reviews of consumers. We implement and experiment with a support vector machines text classification appro...
详细信息
This paper presents a method of ontology-based sentiment classification to classify and analyse online product reviews of consumers. We implement and experiment with a support vector machines text classification approach based on a lexical variable ontology. After testing, it could be demonstrated that the proposed method can provide more effectiveness for sentiment classification based on text content.
Ambiguity is a major problem of software errors because much of the requirements specification is written in a natural language format. Therefore, it is hard to identify consistencies because this format is too ambigu...
详细信息
ISBN:
(纸本)9781424439027
Ambiguity is a major problem of software errors because much of the requirements specification is written in a natural language format. Therefore, it is hard to identify consistencies because this format is too ambiguous for specification purposes. This paper aims to propose a method for handling requirement specification documents which have a similar content to each other through a hierarchical text classification. The method consists of two main processes of classification: heavy classification and light classification. The heavy classification is to classify the requirement specification documents having similar content together. Meanwhile, light classification is to elaborate specification requirement documents by using the Euclidean distance. Finally, slimming down the number of requirements specification through hierarchical text classification classifying may yield a specification which is easier to understand. That means the proposed method is more effective for reducing and handling in the requirements specification.
暂无评论