Recently, a significant number of parallel and distributed algorithms have been proposed to mine frequent patterns (FP) from large and/or distributed databases. Among them parallelization of the FP-growth algorithms u...
详细信息
ISBN:
(纸本)9781424446001
Recently, a significant number of parallel and distributed algorithms have been proposed to mine frequent patterns (FP) from large and/or distributed databases. Among them parallelization of the FP-growth algorithms using the FP-tree has been proved to be highly efficient. However, the FP-tree-based techniques suffer from two major limitations such as multiple database scans requirement (i.e., high I/O cost) and high inter-processor communications cost (during the mining phase). therefore, we propose a novel tree structure, called PP-tree (Parallel Pattern tree) that significantly reduces the I/O cost by capturing the database contents with a single scan and facilitates the efficient FP-growth mining on it with reduced inter-processor communication overhead. Our parallel algorithm works independently at each local site and locally generates global frequent patterns which are merged at the final stage. the experimental results reflect that parallel and distributed FP mining with PP-tree outperforms other state-of-the-art algorithms.
Technology is now everywhere;integrated into our everyday objects and activities. Mobile computers and devices are now widely affordable and powerful enough. Because of that, developments of mobile applications become...
详细信息
ISBN:
(纸本)9780982148907
Technology is now everywhere;integrated into our everyday objects and activities. Mobile computers and devices are now widely affordable and powerful enough. Because of that, developments of mobile applications become a phenomenon today. Mobile applications could be used both to connect people with each other, and to link them with crucial data from almost anywhere in mobile manner. Since mobile devices come in a variety of purposes and properties and in different communication mechanisms, a portable software platform and a flexible and extensible networking supports need to be considered. Java, specifically Java Micro Edition (JME), is particularly an attractive development environment that suits the purpose. this paper discusses a research project of a Java-based smart mobile application. the application, a client/server based application, is designed using JME. It allows the built application to be deployed on any client devices and access to a large variety of network services on the server side. the open source database.
Digital garments or smart clothes with noninvasive smart sensors handling vital signs are expected to be key elements for our health management in the future. A wellness wear system is an integrated system including s...
详细信息
ISBN:
(纸本)9781424450138
Digital garments or smart clothes with noninvasive smart sensors handling vital signs are expected to be key elements for our health management in the future. A wellness wear system is an integrated system including such smart clothes with sensors acquiring bio-signals, digital yarns transmitting those signals, integrated circuits and microprocessors for digital signal processing, wired and wireless communication, and application software systems providing various medical services based on vital signs acquired. this paper is centered around software aspects for health management in the wellness wear system, introducing a related project launched recently. As a very first and important step for it, we in this paper propose a service framework for software applications as parts of a wellness wear system that provides users with various medical services primarily using vital signs obtained from smart clothes.
In modern health care, use of web based ERR (Electronic Health Record) system has increased remarkably because of its world-wide accessibility and the facility of the collaborative work among multiple users. Major dra...
详细信息
ISBN:
(纸本)9781424450138
In modern health care, use of web based ERR (Electronic Health Record) system has increased remarkably because of its world-wide accessibility and the facility of the collaborative work among multiple users. Major drawbacks of such centralized web based system are link failure and low or no fault tolerance. In an unreliable network, it is very commonplace that service is unavailable due to connection failure. the problem motivates us to devise a decentralized system that would work seamlessly in unreliable Internet infrastructure. In this paper, we have presented such an e-healthcare system (named iMedikD) which supports both local and centralized access where hospitalwise responsibility is delegated among multiple peripheral servers. therefore, by lowering the dependency over the external links the system is able to keep the peripheral services running uninterrupted. Only in case of remote referral, peripheral servers communicate through external links to web based servers with a view to minimize bandwidth utilization.
Fast convergence in IGP is very important for widespread deployment of real time applications. Many efforts, such as fast hello and fast flooding, have been proposed to reduce the convergence time in IGP However, thes...
详细信息
ISBN:
(纸本)9781424446001
Fast convergence in IGP is very important for widespread deployment of real time applications. Many efforts, such as fast hello and fast flooding, have been proposed to reduce the convergence time in IGP However, these solutions need to consume a large amount of CPU and memory resources in routers. Furthermore, they require collaboration of two neighbor routers. In this paper, we analyze the limitations in traditional Open Shortest Path First (OSPF), which causes slow (or not so fast) convergence based on failure data collected in real ISP networks. To address these issues, we propose a distributed OSPF (DOSPF) scheme to schedule routing computation through self-adaptively adjusting SPT waiting time. We analyze the convergence performance with DOSPF with Petri net. We then build a simulation tool to with routing trace in China Education and Research NETwork 2(CERNET2) to evaluate our DOSPF scheme. Our simulations show that DOSPF can effectively improve the IGP convergence performance.
In the last decade, the evolution of distributedcomputing has shifted from cluster computing to Grid computing. Although bidding provides a useful means of resource allocation for this novel computing paradigm, there...
详细信息
In this paper we study the performance of a distributed search engine from a data caching point of view We compare and combine two different approaches to achieve better hit rates: (a) send the queries to the node whi...
详细信息
ISBN:
(纸本)9781424446001
In this paper we study the performance of a distributed search engine from a data caching point of view We compare and combine two different approaches to achieve better hit rates: (a) send the queries to the node which currently has the related data in its local memory (cache-aware load balancing), and (b) send the cached contents to the node where a query is being currently processed (cooperative caching). Furthermore, we study the best scheduling points in the query computation in which they can be reassigned to another node, and how this reassignation should be performed. Our analysis is guided by statistical tools on a real question answering system for several query distributions, which are typically found in query logs.
A key problem in executing performance critical applications on distributedcomputing environments (e.g. the Grid) is the selection of resources for execution. A lot of research related to "automatic resource sel...
详细信息
ISBN:
(纸本)9781424446001
A key problem in executing performance critical applications on distributedcomputing environments (e.g. the Grid) is the selection of resources for execution. A lot of research related to "automatic resource selection" has been made to allocate the best-effort resources on behalf of users to optimize the execution performance. However most of current approaches are based on the static principle (i.e. resource selection is performed prior to execution) and need detailed application-specific information. In the paper, we introduce a lightweight approach for automatic resource selection/configuration. this approach is based on a simple control theory: the application continuously reports performance values to the middleware Application Agent (AA), which relies on the reported values to decide how to dynamically reconfigure the execution environment during the execution to ensure users' performance requirements (e.g. execution deadline, running N iteration per second). We divide the research into two paradigms: neglecting network latency and considering network latency. For the first paradigm, we use a linear prediction with Kalman filter to find the expected RC to satisfy certain performance requirement. For the second, we let AA probe possible RCs and rollback the bad RCs, to look for a local optimized RC that can provide applications highest performance.
the proceedings contain 96 papers. the topics discussed include: evaluation of coordinated grid scheduling strategies;online metatask scheduling heuristics for a bidding-based distributed system;graph-based task repli...
ISBN:
(纸本)9780769537382
the proceedings contain 96 papers. the topics discussed include: evaluation of coordinated grid scheduling strategies;online metatask scheduling heuristics for a bidding-based distributed system;graph-based task replication for workflow applications;evaluating provider reliability in grid resource brokering;a streaming intrusion detection system for grid computing environments;resource leasing and the art of suspending virtual machines;performance evaluation of unified parallel C collective communications;a simple performance model for multithreaded applications executing on non-uniform memory access computers;decoupling as a foundation for large scale parallel computing;fast parallel expectation maximization for Gaussian mixture models on GPUs using CUDA;and a hybrid system with hidden Markov models and Gaussian mixture models for myocardial infarction classification with 12-lead ECGs.
We parse the sentences in three parallel error corpora using a generative, probabilistic parser and compare the parse probabilities of the most likely analyses for each grammatical sentence and its closely related ung...
详细信息
暂无评论