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.
The longest common subsequence problem is a classical string problem that aims at computing a common subsequence having the highest possible length from a given set of strings. This problem is one of the most studied computational problems in bioinformatics and computational biology. The problem is NP-hard for more than two input strings and the existing exact solutions are impractical for large input...
Affordances encode the relationships between the robot and environment, in terms of actions that the robot is able to perform. The essence is that each object is perceived by its affordances (graspable, moveable, etc), instead of its properties (color, size, etc). Previous work mainly associates an affordance to a primitive or reactive action of single robot, and the whole task is finished after that...
Cloud computing has become popular due to its attractive features. The load on the cloud is increasing tremendously with the development of new applications. Load balancing is an important part of cloud computing environment which ensures that all devices or processors perform same amount of work in equal amount of time. Different models and algorithms for load balancing in cloud computing has been...
In this paper we modeled the distribution of a single type of products, which are distributed from two depots and use N-vehicles. This problem can be modeled using Capacitated Vehicle Routing Problems (CVRP), and the common algorithm to solve that model is Clarke and Wright Saving Algorithm (CWSA). The needed computational time for finding the nearly global optimum of CWSA grows exponentially with...
This paper presents an iterative Takagi Sugeno Fuzzy Model (TSFM) identification. Interval Type-2 Recursive Fuzzy C-Means (IT2RFCM) clustering algorithm has been used to classify the data space to obtain premise variable parameters and Weighted Recursive Least Square (WRLS) technique has been used to determine consequence parameters of each linear model. IT2RFCM clustering algorithm has been obtained...
Clustering is grouping similar data items, features, observations etc. In to cluster. Clustering Problem has been addressed many times as it is one of the important step in data analysis in various application areas. This paper presents an overview of message passing data clustering technique with a goal of providing useful concepts which can be accessible to the community of clustering practitioners...
In this paper we propose a novel method to improve seam carving based on the method meta-heuristic algorithms combining simulated annealing (SA) and genetic algorithm (GA). SA is a single solution method which searches locally while GA belongs to population based algorithms that globally search to find the best answer. By this strategy, both speed and quality of the seam carving method can be increased...
Network packet classification is the central building block for important services such as QoS routing and firewalling. Accordingly, a wide range of classification schemes has been proposed, each with its own specific set of characteristics. But while novel algorithms keep being developed at a high pace, there barely exists tool support for proper benchmarking, which makes it hard for researchers...
Social network sites are becoming great through millions of users and information have been gathered from the users. This information have equal advantages to their friends and spammers. Twitter is one of the most popular social networks that, users can send short textual messages namely tweet. Researches have shown that this network is subject to spammer's invasion more than other social networks...
One of the most important issues in dynamic networks is to prove the correctness of distributed algorithms. This issue has been widely studied in the literature. Nevertheless, we note a lack of consensus about the development and proof of these algorithms. Moreover, the proofs which have been presented are usually done manually. In this paper, we introduce a formal pattern based on evolving graphs...
In Distributed Virtualized Environment, service components on a dependable service path will be selected to implement service composition. Searching for the optimal dependable service path is the key to implement dependability assurance, which is a Multi-Constrained Optimal Path problem. However, the existing algorithms have disadvantages of high complexity and low performance, and lacking the consideration...
This paper deals with application of swarm intelligence based algorithms to solve optimal active power dispatch problem in an efficient manner. In this paper well established artificial intelligent algorithms viz cuckoo search (CS) method; Particle swarm optimization (PSO) and Modified PSO are used to solve a multi-objective optimal power flow (OPF) problem. Some modifications in PSO are carried to...
Multi-label classification in social network environments is becoming a key area of data mining research in recent years. Given some nodes' labels (i.e., the sources), the task is to infer some other nodes' labels (i.e., the targets) in the same network. Relational classification methods, which leverage the correlation of labels between linked instances, have been shown to outperform traditional classifiers...
Because of data uncertainty and time and space limitations in clustering process, clustering uncertain data stream becomes a very challenging task. A lot of processing algorithms has been proposed continuously. This paper reviews clustering algorithms of uncertain data stream and dissects the advantages and disadvantages of these algorithms for future development.
Aiming at the deficiencies of ant colony clustering algorithms in distance measure, convergence rate, similarity clustering, and other aspects, WALF algorithm is presented as an improvement to the LF algorithm. Using weighted hybrid distance as distance measure, and introducing the adaptive mechanism during the process of clustering, ant colonies can adjust the radius of neighborhoods dynamically...
The CFG recognition problem is: given a context-free grammar G and a string w of length n, decide if w can be obtained from G. This is the most basic parsing question and is a core computer science problem. Valiant's parser from 1975 solves the problem in O(nO) time, where ? < 2:373 is the matrix multiplication exponent. Dozens of parsing algorithms have been proposed over the years, yet Valiant's...
Automatic Modulation Classification (AMC) can be used in automatically identifying and classifying the modulation of communication devices. With the application of digital technique, AMC is developed towards higher frequency, which makes a lower probability of correct classification (PCC) at the conventional method. It is necessary for relay-communication to automatically classify the modulation of...
The classification of the most used load balancing algorithms in distributed systems (including cloud technology, cluster systems, grid systems) is described. Comparative analysis of types of the load balancing algorithms is conducted in accordance with the classification, the advantages and drawbacks of each type of the algorithms are shown. Performance indicators characterizing each algorithm are...
The determination of various resource affinities of processes is an important parameter for making effective scheduling decisions by the schedulers in any operating systems kernel. The resource affinities of a set of processes may be dynamic in nature based on application logic and execution environments. This paper proposes a novel probabilistic estimation model and corresponding classifier algorithm...
The placement of relay nodes is one of the critical need of wireless sensor networks when connectivity, lifetime, fault tolerance like factors are desired in the network. In this study, we review the node placement techniques based on two broad categories, i.e. algorithm based and approximation based solutions and provide an overall view of this study by summarizing previous achievements. A taxonomy...
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.