the automatic composition of semantic Web services is one of the challenging areas of the semantic Web services research. Mathematical semantic Web services are very useful in practice, however only a small number of ...
详细信息
the automatic composition of semantic Web services is one of the challenging areas of the semantic Web services research. Mathematical semantic Web services are very useful in practice, however only a small number of related research results are reported. In this paper, we will show a dynamic, automated composition method for mathematical semantic Web services, using intelligent agents. the paper is focused on solving a kind of mathematical puzzle, called "the countdown problem". In addition, we will show a static, manual composition method for Web services.
Service oriented architectures draw heavily on techniques for reusing and assembling off-the-shelf software components. While powerful, this programming practice is not without a cost: the software architect must ensu...
详细信息
Service oriented architectures draw heavily on techniques for reusing and assembling off-the-shelf software components. While powerful, this programming practice is not without a cost: the software architect must ensure that the off-the-shelf components interact safely and in ways that conform withthe specification. We develop a new theory for adaptable service composition. the theory provides an effective framework for analyzing the conformance of contract-based service compositions, and for enforcing their compliance, in a uniform, formally elegant setting.
In this paper we address several problems regarding content distribution (broadcast) and communication optimization and scheduling for some restricted classes of graphs (trees, intersecting cliques). For the broadcast...
详细信息
In this paper we address several problems regarding content distribution (broadcast) and communication optimization and scheduling for some restricted classes of graphs (trees, intersecting cliques). For the broadcast problem in trees we introduce some new extensions and present some new algorithmic results for determining optimal offline broadcast strategies. the communication scheduling problems are also addressed from an offline algorithmic perspective, considering mutual exclusion constraints or geometric aspects.
the obtainment of a quality software architecture that fulfils the design principles and addresses the stakeholders9; concerns is an ongoing problem. In this paper, we present an approach to construct modular softw...
详细信息
the obtainment of a quality software architecture that fulfils the design principles and addresses the stakeholders' concerns is an ongoing problem. In this paper, we present an approach to construct modular software architectures based on the stakeholders' concerns and the domain ontology of the informational system where the software system will operate. the approach uses the Model-View-Controller architectural pattern and fulfils new additional design rules. We applied the approach in the design and implementation of the software architecture of a system that provides the selection criteria of the subjects in the clinical trials.
Change points in time series appear due to variations in the data generation process. We consider the problem of modeling time series generated by dynamic processes, and we focus on finding the change points using a s...
详细信息
Change points in time series appear due to variations in the data generation process. We consider the problem of modeling time series generated by dynamic processes, and we focus on finding the change points using a specially tailored genetic algorithm. the algorithm employs a new representation, described in detail in the paper. Suitable genetic operators are also defined and explained. the results obtained on computer generated time series provide evidence that the approach can be used for change point detection, and has good potential for time series modeling.
We give graph-theoretic formalization of origami, the art of paper folding. Starting from the abstract origami system, we model origami construction as are write sequence of abstract origami9;s. To reason about the...
详细信息
We give graph-theoretic formalization of origami, the art of paper folding. Starting from the abstract origami system, we model origami construction as are write sequence of abstract origami's. To reason about the entire origami construction for the computational purposes, we define a labeled hypergraph for origami and give the abstraction of origami fold as a set of algebraic graph rewrite rules. We give detailed description of the fold operation in terms of graph rewriting. the graph-theoretic formalism enables us to reason in two separate domains of discourse, i.e. pure combinatoric domain and geometrical domain R 2 .
Landscape analysis of fitness functions is an important topic. this paper makes an attempt to characterize the search problems associated withthe fitness functions used in search-based testing, employing the followin...
详细信息
Landscape analysis of fitness functions is an important topic. this paper makes an attempt to characterize the search problems associated withthe fitness functions used in search-based testing, employing the following measures: diameter, autocorrelation and fitness distance correlation. In a previous work, a general form of objective functions for structural search-based software testing was tailored for state-based testing. A comparison is performed in this paper between the general fitness functions and some problem-specific fitness functions, taking into account their performance with different search methods.
the aim of this paper is to develop a MATLAB function for one dimensional numerical integration based on adaptive algorithms and Gauss-Lobatto-Kronrod formulas. Using Maple, we find a triple of formulas, and then we u...
详细信息
the aim of this paper is to develop a MATLAB function for one dimensional numerical integration based on adaptive algorithms and Gauss-Lobatto-Kronrod formulas. Using Maple, we find a triple of formulas, and then we use it to code ananalogous of MATLAB quadl function with a higher degree of exactness. Finally, some examples and tests which compare our function and quadl are given. Our function is a good alternative to quadl when the accuracy and reliability requirements are hard.
the graphical modeling and visualization of the virtual geographical space require high power computation and distributed massive spatial databases. the paper presents a few experiments on the solutions supported by t...
详细信息
the graphical modeling and visualization of the virtual geographical space require high power computation and distributed massive spatial databases. the paper presents a few experiments on the solutions supported by the Chromium graphics cluster to provide fast distributed processing and remote visualization. the performance is evaluated for various cluster configurations and spatial data models. the research concerns as well with accessing the cluster based processing by Web applications through grid and Web services.
We designed a new SVM for microRNA identification, whose novelty consist in the fact that many of its features incorporate the base-pairing probabilities provided by McCaskill9;s algorithm. Comparisons with other S...
详细信息
We designed a new SVM for microRNA identification, whose novelty consist in the fact that many of its features incorporate the base-pairing probabilities provided by McCaskill's algorithm. Comparisons with other SVMs for microRNA identification prove that our SVM obtains competitive results. One of the advantages of our approach is that it makes no use of so-called normalised features which are based on sequence shuffling, which is a sensitive issue from the biological point of view. this also makes our approach much less time consuming.
暂无评论