Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Design (3)
- Digital preservation (3)
- Search engines (3)
- Web archives (3)
- Clustering (2)
-
- OAI-ORE (2)
- Signature (2)
- URls (2)
- Web infrastucture (2)
- 3D (1)
- 404 errors (1)
- Access protocols (1)
- Accidents (1)
- Ad hoc networks (1)
- Agents (1)
- ArXiv (1)
- Architecture (1)
- Architecture software (1)
- Artificial (1)
- Artificial perception (1)
- Assertions (1)
- Assumption (1)
- Atom (1)
- Biometrics (1)
- Block matching (1)
- Bridging model (1)
- Broadcast (1)
- Classification (1)
- Collaborative filtering (1)
- Colombia (1)
- Publication
- Publication Type
Articles 1 - 22 of 22
Full-Text Articles in Physical Sciences and Mathematics
(Re-) Discovering Lost Web Pages, Martin Klein, Michael L. Nelson
(Re-) Discovering Lost Web Pages, Martin Klein, Michael L. Nelson
Computer Science Presentations
PDF of a powerpoint presentation from a Mathematics & Computer Science Seminar at Emory University, Atlanta, Georgia, October 2, 2009. Also available on Slideshare.
Section Abstracts: Computer Science
Section Abstracts: Computer Science
Virginia Journal of Science
Abstracts of the Computer Science for the 87th Annual Meeting of the Virginia Academy of Science, May 27-29, 2009, Virginia Commonwealth University, Richmond Virginia.
Synchronicity: Just-In-Time Discovery Of Lost Web Pages, Martin Klein, Michael L. Nelson
Synchronicity: Just-In-Time Discovery Of Lost Web Pages, Martin Klein, Michael L. Nelson
Computer Science Presentations
PDF of a powerpoint presentation from the National Digital Information Infrastructure and Preservation Program (NDIIPP) Partners Meeting, Washington D.C., June 24-25, 2009. Also available on Slideshare.
Using Timed-Release Cryptography To Mitigate The Preservation Risk Of Embargo Periods, Rabia Haq, Michael L. Nelson
Using Timed-Release Cryptography To Mitigate The Preservation Risk Of Embargo Periods, Rabia Haq, Michael L. Nelson
Computer Science Presentations
PDF of a powerpoint presentation from the 2009 ACM/IEEE Joint Conference on Digital Libraries, Austin, Texas, June 15-19, 2009. Also available on Slideshare.
Adding Escience Assets To The Data Web, Herbert H. Van De Sompel, Carl Lagoze, Michael L. Nelson, Simeon Warner, Robert Sanderson, Pete Johnston
Adding Escience Assets To The Data Web, Herbert H. Van De Sompel, Carl Lagoze, Michael L. Nelson, Simeon Warner, Robert Sanderson, Pete Johnston
Computer Science Faculty Publications
Aggregations of Web resources are increasingly important in scholarship as it adopts new methods that are data-centric, collaborative, and networked-based. The same notion of aggregations of resources is common to the mashed-up, socially networked information environment of Web 2.0. We present a mechanism to identify and describe aggregations of Web resources that has resulted from the Open Archives Initiative - Object Reuse and Exchange (OAI-ORE) project. The OAI-ORE specifications are based on the principles of the Architecture of the World Wide Web, the Semantic Web, and the Linked Data effort. Therefore, their incorporation into the cyberinfrastructure that supports eScholarship will …
Tree-D-Seek: A Framework For Retrieving Three-Dimensional Scenes, Saurav Mazumdar
Tree-D-Seek: A Framework For Retrieving Three-Dimensional Scenes, Saurav Mazumdar
Electrical & Computer Engineering Theses & Dissertations
In this dissertation, a strategy and framework for retrieving 3D scenes is proposed. The strategy is to retrieve 3D scenes based on a unified approach for indexing content from disparate information sources and information levels. The TREE-D-SEEK framework implements the proposed strategy for retrieving 3D scenes and is capable of indexing content from a variety of corpora at distinct information levels. A semantic annotation model for indexing 3D scenes in the TREE-D-SEEK framework is also proposed. The semantic annotation model is based on an ontology for rapid prototyping of 3D virtual worlds.
With ongoing improvements in computer hardware and 3D …
Algorithms For Vertex-Weighted Matching In Graphs, Mahantesh Halappanavar
Algorithms For Vertex-Weighted Matching In Graphs, Mahantesh Halappanavar
Computer Science Theses & Dissertations
A matching M in a graph is a subset of edges such that no two edges in M are incident on the same vertex. Matching is a fundamental combinatorial problem that has applications in many contexts: high-performance computing, bioinformatics, network switch design, web technologies, etc. Examples in the first context include sparse linear systems of equations, where matchings are used to place large matrix elements on or close to the diagonal, to compute the block triangular decomposition of sparse matrices, to construct sparse bases for the null space or column space of under-determined matrices, and to coarsen graphs in multi-level …
On The Role Of Assertions For Conceptual Modeling As Enablers Of Composable Simulation Solutions, Robert Dennis King
On The Role Of Assertions For Conceptual Modeling As Enablers Of Composable Simulation Solutions, Robert Dennis King
Computational Modeling & Simulation Engineering Theses & Dissertations
This research provides a much needed systematic review of the roles that assertions play in model composability and simulation interoperability. In doing so, this research contributes a partial solution to one of the problems of model composability and simulation interoperability—namely, why do simulation systems fail to achieve the maximum level of interoperability possible? It demonstrates the importance of the assertions that are made during model development and simulation implementation, particularly as they reflect the unique viewpoint of each developer or user. It hypothesizes that it is possible to detect composability conflicts by means of a four-step process developed by the …
A Method For Introducing Artificial Perception (Ap) To Improve Human Behavior Representation (Hbr) Using Agents In Synthetic Environments, Randall Bartholomew Garrett
A Method For Introducing Artificial Perception (Ap) To Improve Human Behavior Representation (Hbr) Using Agents In Synthetic Environments, Randall Bartholomew Garrett
Computational Modeling & Simulation Engineering Theses & Dissertations
While psychology has shown that perception is very important for the human decision process, agent perception has not been covered in sufficient detail within the agent directed simulation field. To contribute to such a solution, an open challenge lies in capturing the knowledge of human sciences, such as psychology, and making this knowledge usable for engineers. This dissertation addresses perception by describing an experimental method where agent perception simulates human perception. In particular, it presents engineering methods based on accepted psychological approaches resulting in a proof of concept. To prove the feasibility, an Artificial Perception (AP) meta-model is presented using …
Can't Find Your 404s?, Martin Klein, Frank Mccown, Joan Smith, Michael L. Nelson
Can't Find Your 404s?, Martin Klein, Frank Mccown, Joan Smith, Michael L. Nelson
Computer Science Presentations
PDF of a powerpoint presentation at the Santa Fe Complex, Santa Fe, New Mexico, March 13, 2009. Also available on Slideshare.
Everyone Is A Curator: Human-Assisted Preservation For Ore Aggregations, Frank Mccown, Michael L. Nelson, Herbert Van De Sompel
Everyone Is A Curator: Human-Assisted Preservation For Ore Aggregations, Frank Mccown, Michael L. Nelson, Herbert Van De Sompel
Computer Science Faculty Publications
The Open Archives Initiative (OAI) has recently created the Object Reuse and Exchange (ORE) project that defines Resource Maps (ReMs) for describing aggregations of web resources. These aggregations are susceptible to many of the same preservation challenges that face other web resources. In this paper, we investigate how the aggregations of web resources can be preserved outside of the typical repository environment and instead rely on the thousands of interactive users in the web community and the Web Infrastructure (the collection of web archives, search engines, and personal archiving services) to facilitate preservation. Inspired by Web 2.0 services such as …
Correlation Of Music Charts And Search Engine Rankings, Martin Klein, Olena Hunsicker, Michael Nelson
Correlation Of Music Charts And Search Engine Rankings, Martin Klein, Olena Hunsicker, Michael Nelson
Computer Science Faculty Publications
We investigate the question whether expert rankings of real-world entities correlate with search engine (SE) rankings of corresponding web resources. We compare Billboards "Hot 100 Airplay" music charts with SE rankings of associated web resources. Out of nine comparisons we found two strong, two moderate, two weak and one negative correlation. The remaining two comparisons were inconclusive.
Object Reuse And Exchange, Michael L. Nelson, Carl Lagoze, Herbert Van De Sompel, Pete Johnston, Robert Sanderson, Simeon Warner, Jürgen Sieck (Ed.), Michael A. Herzog (Ed.)
Object Reuse And Exchange, Michael L. Nelson, Carl Lagoze, Herbert Van De Sompel, Pete Johnston, Robert Sanderson, Simeon Warner, Jürgen Sieck (Ed.), Michael A. Herzog (Ed.)
Computer Science Faculty Publications
The Open Archives Object Reuse and Exchange (OAI-ORE) project defines standards for the description and exchange of aggregations of Web resources. The OAI-ORE abstract data model is conformant with the Architecture of the World Wide Web and leverages concepts from the Semantic Web, including RDF descriptions and Linked Data. In this paper we provide a brief review of a motivating example and its serialization in Atom.
Multicast Encryption Infrastructure For Security In Sensor Networks, Richard R. Brooks, Brijesh Pillai, Matthew Pirretti, Michele C. Weigle
Multicast Encryption Infrastructure For Security In Sensor Networks, Richard R. Brooks, Brijesh Pillai, Matthew Pirretti, Michele C. Weigle
Computer Science Faculty Publications
Designing secure sensor networks is difficult. We propose an approach that uses multicast communications and requires fewer encryptions than pairwise communications. The network is partitioned into multicast regions; each region is managed by a sensor node chosen to act as a keyserver. The keyservers solicit nodes in their neighborhood to join the local multicast tree. The keyserver generates a binary tree of keys to maintain communication within the multicast region using a shared key. Our approach supports a distributed key agreement protocol that identifies the compromised keys and supports membership changes with minimum system overhead. We evaluate the overhead of …
Evaluating Multicore Algorithms On The Unified Memory Model, John E. Savage, Mohammad Zubair
Evaluating Multicore Algorithms On The Unified Memory Model, John E. Savage, Mohammad Zubair
Computer Science Faculty Publications
One of the challenges to achieving good performance on multicore architectures is the effective utilization of the underlying memory hierarchy. While this is an issue for single-core architectures, it is a critical problem for multicore chips. In this paper, we formulate the unified multicore model (UMM) to help understand the fundamental limits on cache performance on these architectures. The UMM seamlessly handles different types of multiple-core processors with varying degrees of cache sharing at different levels. We demonstrate that our model can be used to study a variety of multicore architectures on a variety of applications. In particular, we use …
A Subspace Projection Methodology For Nonlinear Manifold Based Face Recognition, Praveen Sankaran
A Subspace Projection Methodology For Nonlinear Manifold Based Face Recognition, Praveen Sankaran
Electrical & Computer Engineering Theses & Dissertations
A novel feature extraction method that utilizes nonlinear mapping from the original data space to the feature space is presented in this dissertation. Feature extraction methods aim to find compact representations of data that are easy to classify. Measurements with similar values are grouped to same category, while those with differing values are deemed to be of separate categories. For most practical systems, the meaningful features of a pattern class lie in a low dimensional nonlinear constraint region (manifold) within the high dimensional data space. A learning algorithm to model this nonlinear region and to project patterns to this feature …
A Two-Population Insurgency In Colombia: Quasi-Predator-Prey Models - A Trend Towards Simplicity, John A. Adam, John A. Sokolowski, Catherine M. Banks
A Two-Population Insurgency In Colombia: Quasi-Predator-Prey Models - A Trend Towards Simplicity, John A. Adam, John A. Sokolowski, Catherine M. Banks
Mathematics & Statistics Faculty Publications
A sequence of analytic mathematical models has been developed in the context of the "low-level insurgency" in Colombia, from 1993 to the present. They are based on generalizations of the two-population "predator-prey" model commonly applied in ecological modeling, and interestingly, the less sophisticated models yield more insight into the problem than the more complicated ones, but the formalism is available to adapt the model "upwards" in the event that more data becomes available, or as the situation increases in complexity. Specifically, so-called "forcing terms" were included initially in the coupled differential equations to represent the effects of government policies towards …
Dynamic Adaptation Of Joint Transmission Power And Contention Window In Vanet, Danda B. Rawat, Gongjun Yan, Dimitrie C. Popescu, Michele C. Weigle, Stephan Olariu
Dynamic Adaptation Of Joint Transmission Power And Contention Window In Vanet, Danda B. Rawat, Gongjun Yan, Dimitrie C. Popescu, Michele C. Weigle, Stephan Olariu
Electrical & Computer Engineering Faculty Publications
In this paper, we propose an algorithm for joint adaptation of transmission power and contention window to improve the performance of vehicular network in a cross layer approach. The high mobility of vehicles in vehicular communication results in the change in topology of the Vehicular Ad-hoc Network (VANET) dynamically, and the communication link between two vehicles might remain active only for short duration of time. In order for VANET to make a connection for long time and to mitigate adverse effects due to high and fixed transmission power, the proposed algorithm adapts transmission power dynamically based on estimated local traffic …
Parameter Optimization For Image Denoising Based On Block Matching And 3d Collaborative Filtering, Ramu Pedada, Emin Kugu, Jiang Li, Zhanfeng Yue, Yuzhong Shen, Josien P.W. Pluim (Ed.), Benoit M. Dawant (Ed.)
Parameter Optimization For Image Denoising Based On Block Matching And 3d Collaborative Filtering, Ramu Pedada, Emin Kugu, Jiang Li, Zhanfeng Yue, Yuzhong Shen, Josien P.W. Pluim (Ed.), Benoit M. Dawant (Ed.)
Electrical & Computer Engineering Faculty Publications
Clinical MRI images are generally corrupted by random noise during acquisition with blurred subtle structure features. Many denoising methods have been proposed to remove noise from corrupted images at the expense of distorted structure features. Therefore, there is always compromise between removing noise and preserving structure information for denoising methods. For a specific denoising method, it is crucial to tune it so that the best tradeoff can be obtained. In this paper, we define several cost functions to assess the quality of noise removal and that of structure information preserved in the denoised image. Strength Pareto Evolutionary Algorithm 2 (SPEA2) …
Supporting Protocols For Structuring And Intelligent Information Dissemination In Vehicular Ad Hoc Networks, Filip Cuckov
Supporting Protocols For Structuring And Intelligent Information Dissemination In Vehicular Ad Hoc Networks, Filip Cuckov
Electrical & Computer Engineering Theses & Dissertations
The goal of this dissertation is the presentation of supporting protocols for structuring and intelligent data dissemination in vehicular ad hoc networks (VANETs). The protocols are intended to first introduce a structure in VANETs, and thus promote the spatial reuse of network resources. Segmenting a flat VANET in multiple cluster structures allows for more efficient use of the available bandwidth, which can effectively increase the capacity of the network. The cluster structures can also improve the scalability of the underlying communication protocols. The structuring and maintenance of the network introduces additional overhead. The aim is to provide a mechanism for …
High-Performance Broadcast And Multicast Protocols For Multi-Radio Multi-Channel Wireless Mesh Networks, Jun Wang
Electrical & Computer Engineering Theses & Dissertations
Recently, wireless mesh networks (WMNs) have attracted much attention. A vast amount of unicast, multicast and broadcast protocols has been developed for WMNs or mobile ad hoc networks (MANETs). First of all, broadcast and multicast in wireless networks are fundamentally different from the way in which wired networks function due to the well-known wireless broadcast/multicast advantage. Moreover, most broadcast and multicast protocols in wireless networks assume a single-radio single-channel and single-rate network model, or a generalized physical model, which does not take into account the impact of interference. This dissertation focuses on high-performance broadcast and multicast protocols designed for multi-radio …
Seasonal Adaptation Of Vegetation Color In Satellite Images For Flight Simulations, Yuzhong Shen, Jiang Li, Vamsi Mantena, Srinivas Jakkula
Seasonal Adaptation Of Vegetation Color In Satellite Images For Flight Simulations, Yuzhong Shen, Jiang Li, Vamsi Mantena, Srinivas Jakkula
Electrical & Computer Engineering Faculty Publications
Automatic vegetation identification plays an important role in many applications including remote sensing and high performance flight simulations. This paper proposes a novel method that identifies vegetative areas in satellite images and then alters vegetation color to simulate seasonal changes based on training image pairs. The proposed method first generates a vegetation map for pixels corresponding to vegetative areas, using ISODATA clustering and vegetation classification. The ISODATA algorithm determines the number of clusters automatically. We then apply morphological operations to the clustered images to smooth the boundaries between clusters and to fill holes inside clusters. Six features are then computed …