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.
Dynamic specification mining extracts candidate specifications from logs of execution traces. Existing algorithms differ in the kinds of traces they take as input and in the kinds of candidate specification they present as output. One challenge common to all approaches relates to the faithfulness of the mining results: how can we be confident that the extracted specifications faithfully characterize...
This paper presents the data mining system model based on Web services to solve the problems such as the deficiency of expansibility and the high cost. Simultaneously the model is better to adapt to the variability and dynamics of customers' requests. According to the strong encapsulation and extensibility in Web Services, the model is more flexible and it enhances the performance greatly. Through...
Various real-life datasets can be viewed as a set of records consisting of attributes explaining the records and set of measures evaluating the records. In this paper, we address the problem of automatically discovering interesting subsets from such a dataset, such that the discovered interesting subsets have significantly different characteristics of performance than the rest of the dataset. We present...
Mining maximal frequent itemsets is to find maximal subsets that appear frequently in datasets, there were many algorithms to effectively solve MFI. Ant colony optimization (ACO) is a new method to solve MFI. However, there are two bottlenecks in which the ACO algorithm takes too much time and solves imprecisely for MFI. A dynamic ACO algorithm with Max-Min Ant System and association graph is proposed...
MapReduce has become an important distributed processing model for large-scale data-intensive applications like data mining and web indexing. Hadoop-an open-source implementation of MapReduce is widely used for short jobs requiring low response time. The current Hadoop implementation assumes that computing nodes in a cluster are homogeneous in nature. Data locality has not been taken into account...
Latency problems are characterized by their focus on minimizing total waiting time for all clients. We consider periodic latency problems: an extension of standard latency problems. In a periodic latency problem each client has to be visited regularly. More precisely, given is a server traveling at unit speed, and a set of clients with their positions. To each client a periodicity is associated that...
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...
Load balancing among application layer peer-to-peer (P2P) networks is critical for its effectiveness but, are considered to be the most important development for next-generation Internet infrastructure. Most structured P2P systems rely on ID-space partitioning schemes to solve the load imbalance problem and have been known to result in an imbalance factor of ?? (log N) in the zone sizes. Two important...
The size of grid systems has increased substantially in the last decades. Resource discovery in grid systems is a fundamental task which provides searching and locating necessary resources for a given process. Various different approaches are proposed in literature for this problem. Grid resource discovery using Web services is an important approach which has resulted in many tools to become de facto...
Exclusion Basis Systems (EBS) is a combinatorial formulation of the group key management problem in wireless sensor networks. A simple method for optimizing key assignment based on EBS is presented, which significantly reduce the time overhead by avoiding the back tracing process. The proposed method requires O(n) time complexity to find an optimal key assignment while the earlier schemes of different...
As the streaming media files growing larger and larger in size, it inevitably aggravates the network congestion and user perceive latency, to settle problem lots of caching algorithms have been applied in video-on-demand (VOD)system. However, different algorithm is correspondence to an unique caching replacement policy, which limits its applications and the effects are not very satisfied, so in VOD...
The server mirroring method has extensively used as the technology for contents delivery networks. Several mirror servers that serve same contents are located in a network, and an access is navigated to one of the mirror servers based on the delay time and the load balance. The location of the mirror servers with high reliability against a failure and small delay times of accesses is important. In...
To ensure Quality of Service (QoS) for data centers, it is critical to enforce a fair share of storage resources between competing users. Interposed schedulers are one of the most practical methods for performance isolation. Most fair queuing-based proportional sharing algorithms for existing interposed scheduler are variants of counterparts designed for network routers and may result in breaking...
Intensive and extensive development of computer networks generates the problem of providing a suitably high level of network survivability. A lot of research has been done in this area in recent years, including studies associated with the use of a modern tool called p-cycles. p-Cycles not only provide a high level of protection, but also achieve it at a quite low cost. Until now, p-cycles have been...
In this paper, we study the impact of task reallocations/migrations on a grid platform, composed of parallel resources, each supervised by a batch scheduler. Results of simulations using real life traces show that gains of 40% can be attained on the average waiting time of jobs even if tasks are initially mapped by a meta-scheduler on the cluster giving the best completion time.
In order to deal with the complicated network video data, the work focuses on the technologies of multilayer semantic mining and proxy cache for streaming media. Semantic mining method based on network parameter is presented. Quadratic regression popularity prediction model is introduced to analyze current popularity of streaming media. And then cache replacement strategy based on semantic mining...
This work focuses on the problem of survivable network design with simultaneous unicast and anycast flows. The motivation for this problem is twofold. First, in recent years we can observe an increasing popularity of network services using anycast flows (e.g. content delivery networks (CDN), domain name service (DNS), peer-to-peer (P2P)) systems. Second, current users require reliable network services,...
The work done in this research attempts to improve the load balancer of OpenMosix. Interestingly trivial changes made to any load balancing algorithm can produce dramatic results. The parameters that effect the load balancing algorithm are first evaluated with the default configurations and then modifications have been made to the /proc file-system dynamically to optimize it in OM. A stronger system...
In this paper we study combinatorial segment visibility, and show how to compute and maintain it as the observer moves in the plane. There are n non-overlapping convex objects in the plane, and we have a segment observer among them. We first consider static case of the problem, in which the observer and objects are static, and then we study dynamic case of the problem, in which the observer can move...
With the increasing prevalence of large scale cloud computing environments, how to place requested applications into available computing servers regarding to energy consumption has become an essential research problem, but existing application placement approaches are still not effective for live applications with dynamic characters. In this paper, we proposed a novel approach named EnaCloud, which...
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.