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 efficiency of a random search strategy in complex networks is measured with the mean first passage time. We formulate a problem of adding a set of k links between the two subsets of the vertex set that optimally reduce the mean first passage time between the sets. We propose two greedy algorithms that approximately solve the problem and we compare their performance against several standard link...
Community detection has been one of the key research topics in the analysis of networked data, which is a powerful tool for understanding organizational structures of complex networks. One major challenge in community detection is to analyze community structures for streaming networks in real-time in which changes arrive sequentially and frequently. The existing incremental algorithms are often designed...
The incremental conductance (INC) algorithm is one of the most extensive maximum power point tracking (MPPT) techniques for photovoltaic (PV) system to make full utilization of solar energy. However, the conventional INC algorithm can't track the MPP for PV systems effectively in rapidly changing atmospheric conditions. A novel region partition MPPT algorithm based on variable step-size INC is proposed...
The performance of parallel simulations of large agent-based models (ABMs) distributed across multiple CPUs is strongly dependent on the distribution of the agents among the processors. In this paper, we introduce an algorithm that uses community structure to distribute the agents among processors, thereby reducing the communication overhead. In particular, we compare three distribution schemes (initial-LPA,...
The flood of real time social data, generated by various social media applications and sensors, is enabling researchers to gain critical insights into important social modeling and analysis problems such as the evolution of social relationships and analysis of emergent social processes. However, current computational tools have to address the grand challenge of analyzing large and dynamic social networks...
In this paper we consider the problem of coordinating the motion of a group of Automated Guided Vehicles (AGVs) utilized in industrial environments for logistics operations. In particular, we consider a hierarchical coordination strategy, where the environment is partitioned into sectors: coordination on the top layer defines the sequence of sectors to be traveled, while coordination on the bottom...
This paper proposes an algorithm to perform an online fuzzy system construction was called FsXCS (Fuzzy Strength-Based XCS). FsXCS is the extended XCS system combining XCS with fuzzy logic theory to tackle the multi-step continuous input-output problems. Indeed, XCS is a great attention discrete-valued system considering from the rule generalization system. However, it becomes more difficult when...
With increasing data clouds in different geographical areas, the availability of a datacenter and the cost of using the datacenter are two concerned factors of clouds users. The present research aims to present a method using K-means clustering and NSGA-II multi-objective algorithm to maximize availability and minimizes cost in selecting a datacenter. The proposed approach was applied to some real...
An important application field of swarm intelligence algorithms is fuzzy rule acquisition. However, their limitations are showed in two aspects. On one hand, it takes a long process to create fuzzy rules during the iterations; on the other, the swarm intelligence algorithms obtain local optimal solution at times. To overcome these disadvantages, a dynamic hybrid swarm intelligence approach is proposed...
An island partitioning method based on cloud adaptive genetic algorithm is proposed. The traditional genetic algorithm is modified by making use of the trait of cloud theory, which shows both randomness and a tendency of stability. The traditional crossover operator is replaced by cloud crossover operator, aiming at improving global searching ability and avoiding falling into local minimums. The concept...
This paper presents a novel discrete-time decentralized control law for the Voronoi-based self-deployment of a Multi-Agent dynamical system. The basic control objective is to let the agents deploy into a bounded convex polyhedral region and maximize the coverage quality by computing locally the control action for each agent. The Voronoi tessellation algorithm is employed to partition dynamically the...
Initialization is an extremely important part of the mixture estimation process. There exists a series of initialization approaches in the literature concerning the mixture initialization. However, the majority of them is directed at initialization of the expectation-maximization algorithm widely used in this area. This paper focuses on the initialization of the mixture estimation with normal components...
Horizontal and vertical partitioning can increase the performance of the database and simplify data management. However traditional partitioning techniques can't deal with stream queries efficiently. In this paper we present WSPS: a workload-driven stream partitioning system to solve the above problembytheintegrationofpartitioningtechnologyandstreaming framework. We construct a dynamic data model,...
Finding communities or clusters in social networks is a famous topic in social network analysis. Most algorithms are limited to static snapshots so they cannot handle dynamics within the underlying graph. In this paper, we present a modification of the Lou-vain community detection method to handle changes in the graph without rerunning the full algorithm. Also, we adapted the Louvain greedy approach...
This paper proposes two parallel hybrid heuristics aiming for the reduction of the average bandwidth of sparse matrices, process used in systems of equations preconditioning. Based on a direct processing of the matrix, the first method combines a heuristic inspired from the laws of physics, with a greedy selection of rows/columns to be interchanged. The second one improves the previous heuristic through...
Introducing methods that can work out the problem of noisy image segmentation is necessary for real-world vision problems. This paper proposes a new computational algorithm for segmentation of gray images contaminated with impulse noise. We have used Fuzzy C-Means (FCM) in fusion with Particle Swarm Optimization (PSO) to define a new similarity metric based on combining different intensity-based neighborhood...
Dynamic community detection has been of great significance on analyzing network structure and community evolution. Among state-of-the-art methods, incremental algorithms based on modularity have been used widely, for the fully utilization of both current and historical information. Unfortunately, they are difficult to uncover small community due to problem called “resolution limit” and also sensitive...
Community and cluster detection is a popular field of social network analysis. Most algorithms focus on static graphs or series of snapshots. In this paper we present an hierarchical algorithm, which detects communities in dynamic graphs. The method is based on the shortest paths to high-connected nodes, so called hubs. Due to local message passing, we can update the clustering results with low computational...
Influence maximization specifies a set of nodes that maximizes the influences in social networks. The influence maximization problem due to its importance in targeted marketing has been explored by many researchers. All proposed algorithms are not scalable and are too time consuming for large-scale social network. In this paper, an efficient and fast algorithm called ComPath+ is proposed for influence...
Tag collision is a very important issue in RFID system. In order to improve the identification efficiency of the system, this paper proposes a collision avoidance anti-collision algorithm based on subset partition (CABSP). The CABSP narrows the identification range and reduces the probability of tag collision by splitting tag subsets. On this basis, the process of tag identification is divided into...
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.