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.
In order to realize the objective and synthetic evaluation of the feasibility in Low-carbon (LC) project, the paper constructs the knowledge representation system(i.e. attribute value of information system), applies the reduction and the mining rules of the Rough Set Theory, at same the time computing dynamic weight, subjective weight, objective weight are combined with Analytic Hierarchy Process...
Recently, pattern matching with flexible gap constraints has attracted extensive attention especially in biological sequence analysis and mining patterns from sequences. An issue is to search Maximal Pattern Matching with Gaps and the One-Off Condition (MPMGOOC). Firstly, we introduce the concept of MPMGOOC. In order to solve the problem, we propose some special concepts of Nettree which is different...
Measurement methods have significant meaning for user's trust to software trustworthiness. Data mining is one of technologies through which measurement methods and tools can collect trustworthiness data to calculate software trustworthiness. In this paper, a Measurement Method based on Data Mining (MMDM) is proposed, trying to improve correctness of conclusion made by user toward provider's service...
The thesis proposes a hybrid intrusion detection model based on the parallel genetic algorithm and the rough set theory. Due to the difficult for the status of intrusion detection rules. This model, taking the advantage of rough set's streamline the edge to data and genetic algorithm's high parallelism, succeeds in introducing the genetic-rough set theory to the instrusion detection. The application...
This paper proposes a new method to cluster law texts based on referential relation of laws. We extract law entities (an entity represents a law) and their referential relation from law texts. Then SimRank algorithm is applied to calculate law entity's similarity through referential relation and law clustering is carried out based on the SimRank similarity. This is the first time to apply SimRank...
Currently, a large number of clustering algorithms are available for data mining. But it will be difficult for people who to a large extent know little about data mining to select an appropriate clustering algorithm. In order to solve this problem, in this paper, we first comprehensively analyze a number of clustering algorithms, then summarize their evaluation criteria and apply the so-called fuzzy...
The normalized least-mean-fourth (XE-NLMF) algorithm has a faster convergence rate and lower misalignment performance than the normalized least-mean-squares (NLMS) algorithm in sub-Gaussian noise environments. However, the XE-NLMF algorithm shows convergence performance degradation in highly correlated input signals. To overcome the problem, we propose an XE-NLMF algorithm with variable data-reusing...
Motivated by the growing demand of accuracy and low computational time in optimizing functions in various fields of engineering, an approach has been presented using the technique of parallel computing. The parallelization has been carried out on one of the simplest and flexible optimization algorithms, namely the particle swarm optimization (PSO) algorithm. PSO is a stochastic population global optimizer...
Swarm Intelligence (SI) is an innovative distributed intelligent paradigm whereby the collective behaviors of unsophisticated individuals interacting locally with their environment cause coherent functional global patterns to emerge. Although the swarm algorithms have exhibited good performance across a wide range of application problems, it is difficult to analyze the convergence. We discuss the...
Combined with the characteristics of network security audit system, paper introduced the idea of dynamic programming to pattern-matching algorithm, and gave the best dynamic matching algorithm, that is, by solving for matching pairs of local sub-problem, and for the number of different rules, (deleted) to find the best combination for the pattern-matching algorithms, then to achieve the strategy of...
This paper addresses an unrelated parallel machine problem with machine and job sequence dependent setup times. The objective function considered is a linear combination of the total completion time and the total number of resources assigned. Due to the combinatorial complexity of this problem, we propose an algorithm based on the GRASP metaheuristic, in which the basic parameter that defines the...
Hyper-heuristics are increasingly used in function and combinatorial optimization. Rather than attempt to solve a problem using a fixed heuristic, a hyper-heuristic approach attempts to find a combination of heuristics that solve a problem (and in turn may be directly suitable for a class of problem instances). Hyper-heuristics have been little explored in data mining. Here we apply a hyper-heuristic...
Detecting the point in time where a dynamic fitness landscape changes is vital for a considerable number of diversity management schemes that used in evolutionary algorithms employed for solving dynamic optimization problems. Here, we introduce a change detector based on principles of artificial immune systems, namely a negative selection algorithm. We show in numerical experiments that such an immunological...
Pattern theorem in financial time-series is one of the most important technical analysis methods in financial prediction. Recent researches have achieved big progresses in identifying and recognizing time-series patterns. And most of the recent works on time-series deal with this task by using static approaches and mainly focus on the recognition accuracy, but considering that recognition of patterns...
The Hybrid CDN-P2P architecture, or HCDN, which combines the complementary advantages of CDN and P2P networks, has been proposed to reduce the deployment cost and to improve the quality of service in file sharing and video streaming applications. A replica placement algorithm (RPA) decides where to replicate the specific data. Existing RPAs for pure CDN do not work efficiently in the HCDN architecture...
We present a distributed on-line algorithm for detecting conjunctive stable predicates in dynamic systems. The algorithm consists of a virtual network topology to maintain the causality relationships between distributed events and protocols to check the verification of the predicates over consistent global states. A lazy detection protocol has been developed to minimize the number of messages for...
In this paper we present an empirical, comparative performance, analysis of fourteen variants of Differential Evolution (DE) and Dynamic Differential Evolution (DDE) algorithms to solve unconstrained global optimization problems. The aim is to compare DDE, which employs a dynamic evolution mechanism, against DE and to identify the competitive variants which perform reasonably well on problems with...
This paper proposes an affine projection algorithm (APA) using the inner product between input vectors. The existing APAs have fast convergence rate but large steady-state estimation errors. In order to reduce the estimation errors, the proposed algorithm adjusts the number of the input vectors by grouping of the input vectors. The grouping process uses the angle between a current input vector and...
Currently, the field of wireless sensor networks (WSNs) is becoming increasingly important and a challenging research area. Advancements in sensor networks enable a wide range of environmental monitoring and object tracking applications. Moreover, multihop routing in WSN is affected by new nodes constantly entering or leaving the network. Therefore, nature based self-organized and independent mechanisms...
This paper proposes a new Propositional Satisfiability Problem (SAT) solver which combined the Failed Literal Detection(FLD), one of the advanced forward reasoning technologies and Davis Putnam Logemann and Loveland(DPLL). This SAT solver utilizes double testing of FLD, First, apply Symmetric Extended Unit Propagation(SEUP) to find the failed literal deeply and conjecture more connotative relations...
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.