The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Finding meaningful patterns is one of the most investigated fields of computational biology. Generalized Center String (GCS) problem is one of the problems that were established and Bpriori Algorithms have been proposed to solve GCS. In this paper we present parallel Bpriori Algorithms based on existing approaches. These algorithms are SIMD on Cube-Connected network, where the size of alphabet set...
We propose a probabilistic, non-intrusive method for quality assessment of speech that takes into consideration the bounded character of the preference scores. The quality ratings are modeled as iid Beta random variables, whose mean and precision are parametrized directly in terms of the signal features. Maximum likelihood estimation is used to learn the model parameters in view of a training database...
The problem of finding the Constrained Longest Common Subsequence (CLCS) for three sequences is a problem with many applications. In this paper a novel algorithm to compute the CLCS is proposed. The most important features of the proposed algorithm are: i) This algorithm is able to find a set of possible CLCS solutions instead of simply returning the length of the CLCS. ii) The algorithm is based...
In order to alleviate the lack of trust in P2P environment, a malicious node attacks and so on, through the expansion of Josang subjective logic thought, proposed a extended subjective logic based on extended P2P trust model ESL-TM. In order to describe the complexity of trust relationships more effectively, positive and negative trust value are used to replace positive and negative events used in...
In this paper, we study the problem of finding optimal mappings for several independent but concurrent workflow applications, in order to optimize performance-related criteria together with energy consumption. Each application consists in a linear chain graph with several stages, and processes successive data sets in pipeline mode, from the first to the last stage. We study the problem complexity...
Agent-based modeling and simulation (ABMS) offers a promising approach to deal with complexities of open complex systems. This article proposed an approach of agent-based modeling and simulation enhanced with pattern-oriented modeling strategy for open complex systems. An agent-based meta-model and its relevant model structure provided a unifying model basis of pattern-oriented agent-based modeling...
Fault diagnosis approaches can generally be categorized into spectrum-based fault localization (SFL, correlating failures with abstractions of program traces), and model-based diagnosis (MBD, logic reasoning over a behavioral model). Although MBD approaches are inherently more accurate than SFL, their high computational complexity prohibits application to large programs. We present a framework to...
Gillespie's stochastic simulation algorithm (SSA) has been a conventional method for stochastic modeling and simulation of biochemical systems. However, as a population-based algorithm it faces the challenge of combinatorial complexity in many biochemical models where species may present with multiple states. To solve this problem, the rules-based modeling was proposed by Hlavacek's group and the...
RVM enables sparse classification and regression functions to be obtained by linearly-weighting a small number of fixed basis functions from a large dictionary of potential candidates.TOA on RVM has O(M3) time and O(M2) space complexity, where M is the training set size. It is thus computationally infeasible on very large data sets. We propose CBA . it decomposed large datasets to subdata blocks by...
In Direct Sum problems |8|, one tries to show that for a given computational model, the complexity of computing a collection F = {f1(x1),hellip f1(x1)} of finite functions on independent inputs is approximately the sum of their individual complexities. In this paper, by contrast, we study the diversity of ways in which the joint computational complexity can behave when all the fi are evaluated on...
This paper presents a continuous simulation-based model for mixed traffic flow between motor and non-motor vehicles at intersections in major cities in China. Not like in developed countries, conflict points and rule-less of mixed flow in intersection, which greatly impaired the traffic capacity, is the major traffic issues at the intersections in China, Therefore, we introduce a conflict-point detection...
The ODP reference model is one of a number of specification frameworks which are based on the definition of a set of viewpoints that are coupled together by the definition of correspondences between terms. Wherever a correspondence is declared, any real world entity that is represented by a term in one viewpoint must also satisfy the requirements placed by the occurrence of the corresponding term...
In order to accomplish high performance on grid workflow, grid resource management system needs a smart and swift resource allocation middleware. In this paper, we study the economy driven resource allocation problem based on market model of grid resource management architectures. We model the problem as the multiple choice knapsack problem (MCKP) and design the resource allocation optimization algorithm...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.