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 the shortest path between two places is a well known problem in road traveling. While most of the work done up to this moment is focused on algorithmics, efficiently managing the information has received significantly less attention. Nevertheless, real world problems like road map routing present a challenge due to the impact that the immense size of the map has over the temporal complexity...
Load balance is a crucial issue for data-intensive computing on cloud platforms, because a load balanced cluster can significantly improve the completion time of data-intensive jobs. In this paper, we present an improved replica placement policy for Hadoop Distributed File System (HDFS), which is specifically designed for heterogeneous clusters. The HDFS replica placement policy cannot generate balanced...
Density based methods have been shown to be an effective approach for clustering non-stationary data streams. The number of clusters does not need to be known a priori and density methods are robust to noise and changes in the statistical properties of the data. However, most density approaches require sensitive, data dependent parameters. These parameters greatly affect the clustering performance...
The power and procurement cost of bandwidth in system-wide networks has forced a steady drop in the byte/flop ratio. This trend of computation becoming faster relative to the network is expected to hold. In this paper, we explore how cost-oriented task placement enables reducing the cost of system-wide networks by enabling high performance even on tapered topologies where more bandwidth is provisioned...
Coordination schemes for multi-agent surveillance missions typically require ideal data transfer between spatially separated agents, an assumption that is too restrictive for many realistic missions. This paper develops dynamic coverage control algorithms that only require unplanned and sporadic exchanges between mobile agents and a central base station. In particular, the proposed schemes are designed...
Social networks are usually analyzed and mined without taking into account the presence of missing values. In this article, we consider dynamic networks represented by sequences of graphs that change over time and we study the robustness and the accuracy of the community detection algorithms in presence of missing edges. We assume that the network evolution can provide a complementary information...
In this paper, we focus on energy efficient virtual network embedding in federated (multi-domain) software defined networks (SDN), where a top (high-level) SDN controller manages the other SDN controllers, each of which is responsible the network management of its own domain. We propose a heuristic algorithm that performs virtual network embedding by aiming to minimize the total energy consumption...
Over the past decade, there has been a dramatic increase in the availability of large and dynamic social network datasets. Conducting social network analysis (SNA) on these networks is critical for understanding underlying social phenomena. However, continuously evolving graph structures require massive recomputations and conducting SNA is infeasible if the computations have to be restarted for every...
Vehicle routing problem (VRP) involves minimizing total route length while visiting each customer location exactly once. In capacitated vehicle routing problem the nodal demand of the vehicle need to be satisfied. For large scale problem use of clustering approach can improve the solution. In this paper an effective modified partition clustering approach has been proposed. The main purpose of proposed...
This article explores the order batching problem (OBP), in warehouse of e-commerce companies. Based on the real E-commence warehouse case, we present a valid tabu search(TS) algorithm to determine how to group the orders in batches, with a greed-based seed heuristic method generating its initial solution. In tabu search, a modified combined picker routing algorithm for the multiple-cross-aisle picker...
FPGAs play a crucial role in the space of customizable accelerators over the next few years. A chief limiting factor is that FPGA CAD tools are cumbersome and time-consuming to most application developers. Routing is the most complex step in FPGA design flow and NP-complete problem. The PathFinder routing algorithm is in dominant use in FPGA CAD research. However, PathFinder is sequential in nature...
Similarity search is an essential operation in many applications. Given a collection of set records and a query, the exact set similarity search aims at finding all the records that are similar to the query from the collection. Existing methods adopt a filter-and-verify framework, which make use of inverted indexes. However, as the complexity of verification is rather low for setbased similarity metrics,...
Modern large-scale computing deployments consist of complex applications running over machine clusters. An important issue there is the offering of elasticity, i.e., the dynamic allocation of resources to applications to meet fluctuating workload demands. Threshold based approaches are typically employed, yet they are difficult to configure and optimize. Approaches based on reinforcement learning...
Existing parallel SPARQL query optimizers assume hash-based data partitioning and adopt plan enumeration algorithms with unnecessarily high complexity. Therefore, they cannot easily accommodate other partitioning methods and only consider an unnecessarily limited plan space. To address these problems, we first define a generic RDF data partitioning model to capture the common structure of various...
Block partition structure has been recognized as a crucial module in video coding scheme. Recently, a quadtree plus binary tree (QTBT) block partition structure has been proposed in the Joint Video Exploration Team (JVET) development. Compared to the quadtree structure in HEVC, QTBT can achieve better coding performance with hugely increased encoding complexity. Here, we propose an effective QTBT...
In this paper, we propose a strategy to solve the load imbalance problem at MapReduce stage that caused from using the default partition algorithm of Hadoop platform. Through using multiple partitioning technique, this proposed strategy can refine the tasks and balance the inputs of reduce stage in the map phase. Furthermore, this proposed strategy can fully employ idle nodes to balance the high load...
Nowadays, social network sites, such as Facebook and Twitter, have tremendous number of users in their repositories. Having this huge amount of data requires analyzing them to get statistics about the users and their interests. In this paper, we propose a new algorithm that clusters the nodes in social networks into communities based on their geodesic location and the similarity between their interests...
One of the traditional ways for detecting dynamic communities is to find the communities at each interval through the static community detection algorithms. However, it usually leads to high computation complexity. In this paper, a novel algorithm based on the MapReduce model and the label propagation progress with the strategy of incremental related vertices is proposed, which is called PLPIRV (Parallel...
In recent years, clustering has become a hotspot in the field of data mining, as one of the key technologies of getting data distribution and observing the characteristics of class. However, some clustering algorithms depend on the selection of initial clustering centers, and the clustering results easily fall into local optimal. To solve the above problem, the paper integrates differential evolution...
Graph pattern mining is an important part of the emerging social network science, and the research of the maximum clique problem is one of the most important research branches. In the big data environment, the mass of nodes and complexity of edges in the graph set a higher requirement on the speed and accuracy of the maximum clique (MCP) study. In this paper, we present a parallel graph partitioning...
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.