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.
Recently, due to the popularity of Web 2.0, considerable attention has been paid to the opinion leader discovery in social network. By identifying the opinion leaders, companies or governments can manipulate the selling or guiding public opinion, respectively. Additionally, detecting the influential comments is able to understand the source and trend of public opinion formation. However, mining opinion...
In this paper, an Aggregation-Division Model (ADM) is proposed to simulate the clustering characteristics of nodes in cyberspace and to describe the dynamic evolution process of the community system structure. Based on Cluster-Cluster Aggregation (CCA) model, using the random walk and collision of discrete single particle to simulate the communication and relationship establishment of nodes in social...
Wireless Sensor Network (WSN) consists of small nodes with sensing, computation, and communications capabilities. Sensor node senses the data and sends data to the base station for further processing. These sensor nodes mainly rely upon batteries for energy, which get drained at a quicker rate due to the computation and communication and this decreases the lifetime of the network. In order to solve...
Hierarchical graphs propose an important class of graphs for modeling many real applications in software and information visualization. Actually, the ability to construct area-efficient drawings is essential in many practical visualization applications. In this paper, we consider the problem of the drawing area needed to draw a hierarchical graph in the grid. We applied practical analysis in order...
The need for power-aware computing has become increasingly apparent. Common power-aware platforms have placed the burden of optimizing energy consumption on the programmer. In many cases this is a complex task which requires more time from the programmer than is acceptable. Hence, auto-tuning for power-aware computing has been proposed to alleviate the programmer from this task. Previous research...
Because of their unique design, web-sever clusters have gained much attention and have become increasingly popular for handling requests. When handling large amounts of complex data, load-balancing is a crucial necessity. This paper proposes the implementation of real time monitoring status of tasks and dynamic dispatch strategy in web-sever cluster systems. It devises the multiple priority queues...
In this work we have studied, evaluated and proposed different swarm intelligence techniques for mining information from loosely structured medical textual records with no apriori knowledge. In the paper we depict the process of mining a large dataset of ∼50,000–120,000 records × 20 attributes in database tables, originating from the hospital information system (thanks go to the University Hospital...
Focusing on the application of mixed data fuzzy clustering in network monitoring, based on a dynamic growth and delete self-organizing maps model (DGDSOM), an algorithm of fuzzy dynamic growth and delete self-organizing maps (FDGDSOM) is proposed. This algorithm introduces the triggering system and designs the triggering module, and makes the intelligent judgment and decision according to the real-time...
The computer algorithm and its improvement of traditional forest fire model based on cellular automata are discussed in this paper. By optimizing algorithm of the model, dynamic updating the tree cluster, introducing the breadth-first search (BFS) algorithm and optimizing the internal memory using, the running time of the model is greatly shorten, and the occupation of internal memory is obviously...
At present analyzing mass data in network by data mining technology in order to detect intrusion has become focus of anomaly detection research. In order to improve quality of intrusion detection, an improved anomaly detection algorithm is proposed in this paper. Firstly the training data set is converted to the standard unit features metric space, then the improved algorithm is used to divide the...
Heterogeneous computing systems require an efficient way of distributing tasks across processing nodes. The tasks have to be mapped to the processors which execute them in the shortest time possible, while keeping the processors at a similar load. Tests have shown that, in most cases, the genetic algorithm produces the best solution among all the mapping heuristics. This paper presents a Genetic Algorithm...
Immune Genetic Algorithm-based Load Balancing (IGALB) was proposed to improve the efficiency of search quality and the poor performance of local search in the Simple Genetic Algorithm-based Load Balancing (SGALB). This algorithm ensured the diversity of population and overcame the SGALB premature convergence by carrying out the affinity and concentration calculations. Meanwhile under certain conditions...
In this paper, a parallel computational model and algorithm based on space decomposition is constructed and implemented, which supports the dynamically resource allocation under cluster environment. The major aim is to explore the new space decomposition scheme that can solve computation intensive problem. The fast multipole method (FMM) is an algorithm for rapid evaluation of the potential and force...
Recursive dual-net (RDN) is a newly proposed interconnection network for massive parallel computers. The RDN is based on recursive dual-construction of a symmetric base-network. A k-level dual-construction for k >; 0 creates a network containing (2n0)2k /2 nodes with node-degree d0 + k, where n0 and d0 are the number of nodes and the node-degree of the base network, respectively. The RDN is node...
Finding out the longest common subsequences (LCS) is one of the most important problems of Bioengineering. But there is still not excellent algorithm for computing all of the longest common subsequences (ALCS). An existing fast algorithm for LCS was studied and improved in this paper. We combined the algorithm with MPI cluster and computed all the longest common subsequences of two random generate...
Computer forensics is the traces collection and processing, which is the offender to remain in the computer or network system, and as a legally binding evidence in the proceedings available to the court, so that suspects would be brought to justice. It mainly includes data protection, data collection, data analysis, the evidence presented in such processes. the data analysis is the key to computer...
With numerous news available on the Web every day, the needs for effective news ranking algorithms to satisfy users' requirements are continuously increasing. Though it has attracted lots of interests in the commercial world, little academic research has been done about news ranking. In this paper, we introduce a virtual graph model to describe the properties of news. Based on the model, we propose...
Clustering, an important technique of data mining, groups similar objects together and identifies the cluster number to which each object of the domain being studied belongs to. In this paper we propose a clustering algorithm which produces quite accurate clusters using the bottom up approach of hierarchical clustering technique of data with categorical attributes. A similarity measure has been proposed...
The shortcomings of existing intelligent optimization algorithms are easy to produce premature convergence, easy to fall into local optimal equilibrium states, and poor efficiency at evolutionary late stage. In order to overcome the above shortcomings, a variety of new strategies and approaches were put forward by researchers in various countries. Although the orthogonal design has been applied to...
The offline components of CluStream clustering algorithm based on distance, and it is difficult to find non-spherical character of the cluster. This paper proposes a data streams clustering algorithm based on grid and particle swarm optimization, the algorithm based on two-tier structure of CluStream clustering algorithm. The grid feature vector to represent a snapshot, the grid density, and grid...
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.