Book•
Data Structures and Algorithms in Java
23 Jan 1998-
TL;DR: This book incorporates the object-oriented design paradigm, using Java as the implementation language while also providing the fundamental intuition and analysis of each data structure studied.
Abstract: From the Publisher:
Using the power of technology to go beyond the borders of the printed page, Goodrich and Tamassia have created a book that is conceptually elegant and innovative. It incorporates the object-oriented design paradigm, using Java as the implementation language while also providing the fundamental intuition and analysis of each data structure studied.
Citations
More filters
06 Jun 2010
TL;DR: A model for processing large graphs that has been designed for efficient, scalable and fault-tolerant implementation on clusters of thousands of commodity computers, and its implied synchronicity makes reasoning about programs easier.
Abstract: Many practical computing problems concern large graphs. Standard examples include the Web graph and various social networks. The scale of these graphs - in some cases billions of vertices, trillions of edges - poses challenges to their efficient processing. In this paper we present a computational model suitable for this task. Programs are expressed as a sequence of iterations, in each of which a vertex can receive messages sent in the previous iteration, send messages to other vertices, and modify its own state and that of its outgoing edges or mutate graph topology. This vertex-centric approach is flexible enough to express a broad set of algorithms. The model has been designed for efficient, scalable and fault-tolerant implementation on clusters of thousands of commodity computers, and its implied synchronicity makes reasoning about programs easier. Distribution-related details are hidden behind an abstract API. The result is a framework for processing large graphs that is expressive and easy to program.
3,840 citations
Cites methods from "Data Structures and Algorithms in J..."
...3. Using a single-computer graph algorithm library, such as BGL [43], LEDA [35], NetworkX [25], JDSL [ 20 ], Stanford GraphBase [29], or FGL [16], limiting the scale of problems that can be addressed....
[...]
TL;DR: The proposed home energy control system's design that provides intelligent services for users is introduced and its implementation using a real environment is demonstrated.
Abstract: Today, organizations use IEEE802.15.4 and ZigBee to effectively deliver solutions for a variety of areas including consumer electronic device control, energy management and efficiency home and commercial building automation as well as industrial plant management. The Smart home energy network has gained widespread attentions due to its flexible integration into everyday life. This next generation green home system transparently unifies various home appliances, smart sensors and wireless communication technologies. The green home energy network gradually forms a complex system to process various tasks. Developing this trend, we suggest a new Smart Home Energy Management System (SHEMS) based on an IEEE802.15.4 and ZigBee (we call it as a "ZigBee sensor network"). The proposed smart home energy management system divides and assigns various home network tasks to appropriate components. It can integrate diversified physical sensing information and control various consumer home devices, with the support of active sensor networks having both sensor and actuator components. We develop a new routing protocol DMPR (Disjoint Multi Path based Routing) to improve the performance of our ZigBee sensor networks. This paper introduces the proposed home energy control system's design that provides intelligent services for users. We demonstrate its implementation using a real environment.
562 citations
Cites methods from "Data Structures and Algorithms in J..."
...We also develop a new topology viewer program to show the established smart node topology in our smart home system [ 12 ]....
[...]
...It is equipped with a low power microprocessor and a narrow-band RF device that can support physical-layer functionalities of IEEE 802.15.4 [ 12 ]....
[...]
TL;DR: A generic geographic knowledge discovery approach for exploring the motion of moving point objects, the prime modelling construct to represent GPS tracked animals, people, or vehicles, based on the concept of geospatial lifelines is presented.
Abstract: Technological advances in position‐aware devices are leading to a wealth of data documenting motion. The integration of spatio‐temporal data‐mining techniques in GIScience is an important research field to overcome the limitations of static Geographic Information Systems with respect to the emerging volumes of data describing dynamics. This paper presents a generic geographic knowledge discovery approach for exploring the motion of moving point objects, the prime modelling construct to represent GPS tracked animals, people, or vehicles. The approach is based on the concept of geospatial lifelines and presents a formalism for describing different types of lifeline patterns that are generalizable for many application domains. Such lifeline patterns allow the identification and quantification of remarkable individual motion behaviour, events of distinct group motion behaviour, so as to relate the motion of individuals to groups. An application prototype featuring novel data‐mining algorithms has been impleme...
278 citations
TL;DR: In this article, the geomorphological integrity of multiscale terrain models rendered from a TLS survey of the braided River Feshie, Scotland is analyzed using a new, computationally efficient geospatial toolkit.
Abstract: [1] Recent advances in technology have revolutionized the acquisition of topographic data, offering new perspectives on the structure and morphology of the Earth's surface. These developments have had a profound impact on the practice of river science, creating a step change in the dimensionality, resolution, and precision of fluvial terrain models. The emergence of “hyperscale” survey methods, including structure from motion photogrammetry and terrestrial laser scanning (TLS), now presents the opportunity to acquire 3-D point cloud data that capture grain-scale detail over reach-scale extents. Translating these data into geomorphologically relevant products is, however, not straightforward. Unlike traditional survey methods, TLS acquires observations rapidly and automatically, but unselectively. This results in considerable “noise” associated with backscatter from vegetation and other artifacts. Moreover, the large data volumes are difficult to visualize; require very high capacity storage; and are not incorporated readily into GIS and simulation models. In this paper we analyze the geomorphological integrity of multiscale terrain models rendered from a TLS survey of the braided River Feshie, Scotland. These raster terrain models are generated using a new, computationally efficient geospatial toolkit: the topographic point cloud analysis toolkit (ToPCAT). This performs an intelligent decimation of point cloud data into a set of 2.5-D terrain models that retain information on the high-frequency subgrid topography, as the moments of the locally detrended elevation distribution. The results quantify the degree of terrain generalization inherent in conventional fluvial DEMs and illustrate how subgrid topographic statistics can be used to map the spatial pattern of particle size, grain roughness, and sedimentary facies at the reach scale.
245 citations
TL;DR: A generalized algorithm for the construction of VOs for Search DAGs is developed, and it is proved that the VOs thus constructed are secure, and that they are efficient to compute and verify.
Abstract: Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is important to provide mechanisms which allow clients to trust the results from on-line queries. Authentic publication allows untrusted publishers to answer securely queries from clients on behalf of trusted off-line data owners. Publishers validate answers using hard-to-forge verification objects VOs), which clients can check efficiently. This approach provides greater scalability, by making it easy to add more publishers, and better security, since on-line publishers do not need to be trusted.To make authentic publication attractive, it is important for the VOs to be small, efficient to compute, and efficient to verify. This has lead researchers to develop independently several different schemes for efficient VO computation based on specific data structures. Our goal is to develop a unifying framework for these disparate results, leading to a generalized security result. In this paper we characterize a broad class of data structures which we call Search DAGs, and we develop a generalized algorithm for the construction of VOs for Search DAGs. We prove that the VOs thus constructed are secure, and that they are efficient to compute and verify. We demonstrate how this approach easily captures existing work on simple structures such as binary trees, multi-dimensional range trees, tries, and skip lists. Once these are shown to be Search DAGs, the requisite security and efficiency results immediately follow from our general theorems. Going further, we also use Search DAGs to produce and prove the security of authenticated versions of two complex data models for efficient multi-dimensional range searches. This allows efficient VOs to be computed (size O(log N + T)) for typical one- and two-dimensional range queries, where the query answer is of size T and the database is of size N. We also show I/O-efficient schemes to construct the VOs. For a system with disk blocks of size B, we answer one-dimensional and three-sided range queries and compute the VOs with O(logB N + T/B) I/O operations using linear size data structures.
243 citations