Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences Commons™

Open Access. Powered by Scholars. Published by Universities.®

2009

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 541 - 570 of 1345

Full-Text Articles in Computer Sciences

An Ontological Representation Of Time Series Observations On The Semantic Sensor Web, Cory Andrew Henson, Holger Neuhaus, Amit P. Sheth, Krishnaprasad Thirunarayan, Rajkumar Buyya Jun 2009

An Ontological Representation Of Time Series Observations On The Semantic Sensor Web, Cory Andrew Henson, Holger Neuhaus, Amit P. Sheth, Krishnaprasad Thirunarayan, Rajkumar Buyya

Kno.e.sis Publications

Time series observations are a common method of collecting sensor data. The Open Geospatial Consortium (OGC) Sensor Web Enablement (SWE) provides a standard representation for time series observations within the Observations and Measurements language, and therefore is in heavy use on the Sensor Web. By providing a common model, Observations and Measurements (O&M) facilitates syntax-level integration, but lacks the ability to facilitate semantic-level integration. This inability can cause problems with interoperability between disparate sensor networks that may have subtle variations in their sensing methods. An ontological representation of time series observations could provide a more expressive model and resolve problems …


Surface Reconstruction Through Time, Leeann T. Brash Jun 2009

Surface Reconstruction Through Time, Leeann T. Brash

Dartmouth College Master’s Theses

Surface reconstruction is an area of computational geometry that has been progressing rapidly over the last decade. Current algorithms and their implementations can reconstruct surfaces from a variety of input and the accuracy and precision improve with each new development. These all make use of various heuristics to achieve a reconstruction. Much of this work consists of reconstructing a still object from point samples taken from the object's surface. We examine reconstructing an n-dimensional object and its motion by treating time as an (n + 1)st axis. Our input consists of (n-1)-dimensional scans taken over time and at di?erent positions …


Free, Source-Code-Available, Or Proprietary: An Ethically Charged, Context-Sensitive Choice, Marty J. Wolf, Keith W. Miller, Frances Grodzinsky Jun 2009

Free, Source-Code-Available, Or Proprietary: An Ethically Charged, Context-Sensitive Choice, Marty J. Wolf, Keith W. Miller, Frances Grodzinsky

School of Computer Science & Engineering Faculty Publications

We demonstrate that different categories of software raise different ethical concerns with respect to whether software ought to be Free Software or Proprietary Software. We outline the ethical tension between Free Software and Proprietary Software that stems from the two kinds of licenses. For some categories of software we develop support for normative statements regarding the software development landscape. We claim that as society's use of software changes, the ethical analysis for that category of software must necessarily be repeated. Finally, we make a utilitarian argument that the software development environment should encourage both Free Software and Proprietary Software to …


Information Sharing And Strategic Signaling In Supply Chains, Robert J. Kauffman, Hamid Mohtadi Jun 2009

Information Sharing And Strategic Signaling In Supply Chains, Robert J. Kauffman, Hamid Mohtadi

Research Collection School Of Computing and Information Systems

Information sharing in procurement occurs in rich and varied industry contexts in which managerial decisions are made and organizational strategy is formulated. We explore how information sharing ought to work in procurement contexts that involve investments in inter-organizational information systems (IOS) and collaborative planning, forecasting and replenishment (CPFR) practices. How and under what circumstances does a firm that plays the role of a supply chain buyer decide to share information on key variables, such as point-of-sale consumer demand data with its supplier, up the supply chain? This is a key issue that crosses the boundary between supply chain management and …


Circular Nonlinear Subdivision Schemes For Curve Design, Jian-Ao Lian, Yonghui Wang, Yonggao Yang Jun 2009

Circular Nonlinear Subdivision Schemes For Curve Design, Jian-Ao Lian, Yonghui Wang, Yonggao Yang

Applications and Applied Mathematics: An International Journal (AAM)

Two new families of nonlinear 3-point subdivision schemes for curve design are introduced. The first family is ternary interpolatory and the second family is binary approximation. All these new schemes are circular-invariant, meaning that new vertices are generated from local circles formed by three consecutive old vertices. As consequences of the nonlinear schemes, two new families of linear subdivision schemes for curve design are established. The 3-point linear binary schemes, which are corner-cutting depending on the choices of the tension parameter, are natural extensions of the Lane-Riesenfeld schemes. The four families of both nonlinear and linear subdivision schemes are implemented …


Computer Science Research Funding: How Much Is Too Little?, Elihu Zimet, Stuart Starr, Clifford Lau, Anup Ghosh Jun 2009

Computer Science Research Funding: How Much Is Too Little?, Elihu Zimet, Stuart Starr, Clifford Lau, Anup Ghosh

Defense and Technology Papers

This papers summarizes and analyzes the findings of a study of the historical and planned level of Department of Defense (DOD) funding in computer science (CS) research from the 2001–2011 DOD records, and formulates key findings and recommendations.


Software Quality Attribute Measurement And Analysis Based On Class Diagram Metrics, Dalia Rizk Jun 2009

Software Quality Attribute Measurement And Analysis Based On Class Diagram Metrics, Dalia Rizk

Archived Theses and Dissertations

Software quality measurement lies at the heart of the quality engineering process. Quality measurement for object-oriented artifacts has become the key for ensuring high quality software. Both researchers and practitioners are interested in measuring software product quality for improvement. It has recently become more important to consider the quality of products at the early phases, especially at the design level to ensure that the coding and testing would be conducted more quickly and accurately. The research work on measuring quality at the design level progressed in a number of steps. The first step was to discover the correct set of …


P-Code: A New Raid-6 Code With Optimal Properties, Chao Jin, Hong Jiang, Dan Feng, Lei Tian Jun 2009

P-Code: A New Raid-6 Code With Optimal Properties, Chao Jin, Hong Jiang, Dan Feng, Lei Tian

School of Computing: Conference and Workshop Papers

RAID-6 significantly outperforms the other RAID levels in disk-failure tolerance due to its ability to tolerate arbitrary two concurrent disk failures in a disk array. The underlying parity array codes have a significant impact on RAID-6’s performance. In this paper, we propose a new XOR-based RAID-6 code, called the Partition Code (P-Code). P-Code is a very simple and flexible vertical code, making it easy to understand and implement. It works on a group of (prime – 1) or (prime) disks, and its coding scheme is based on an equal partition of a specified two-integer-tuple set. P-Code has the following properties: …


Interference-Aware Routing Protocol In Multi-Radio Wireless Mesh Networks, Byoungheon Shin, Yangwoo Ko, Jisun An, Dongman Lee Jun 2009

Interference-Aware Routing Protocol In Multi-Radio Wireless Mesh Networks, Byoungheon Shin, Yangwoo Ko, Jisun An, Dongman Lee

Research Collection School Of Computing and Information Systems

Utilization of multiple radio interfaces increases throughput of wireless networks. Existing work proposes a multi-radio routing protocol exploiting link quality and channel diversity of a path. While an established path is deteriorated by interferences incurred by any changes in a network, and existing work does not detect the deterioration. In this paper, we propose an interference-aware multi-radio routing protocol detecting and resolving dynamic path deterioration in wireless mesh networks.


Developing Systems For Cyber Situational Awareness, James. S. Okolica, J. Todd Mcdonald, Gilbert L. Peterson, Robert F. Mills, Michael W. Haas Jun 2009

Developing Systems For Cyber Situational Awareness, James. S. Okolica, J. Todd Mcdonald, Gilbert L. Peterson, Robert F. Mills, Michael W. Haas

Faculty Publications

In both military and commercial settings, the awareness of Cyber attacks and the effect of those attacks on the mission space of an organization has become a targeted information goal for leaders and commanders at all levels. We present in this paper a defining framework to understand situational awareness (SA)—especially as it pertains to the Cyber domain—and propose a methodology for populating the cognitive domain model for this realm based on adversarial knowledge involved with Cyber attacks. We conclude with considerations for developing Cyber SA systems of the future.


Deamon: Energy-Efficient Sensor Monitoring, Minho Shin, Patrick Tsang, David Kotz, Cory Cornelius Jun 2009

Deamon: Energy-Efficient Sensor Monitoring, Minho Shin, Patrick Tsang, David Kotz, Cory Cornelius

Dartmouth Scholarship

In people-centric opportunistic sensing, people offer their mobile nodes (such as smart phones) as platforms for collecting sensor data. A sensing application distributes sensing `tasks,' which specify what sensor data to collect and under what conditions to report the data back to the application. To perform a task, mobile nodes may use on-board sensors, a body-area network of personal sensors, or sensors from neighboring nodes that volunteer to contribute their sensing resources. In all three cases, continuous sensor monitoring can drain a node's battery. \par We propose DEAMON (Distributed Energy-Aware MONitoring), an energy-efficient distributed algorithm for long-term sensor monitoring. Our …


Nonrigid Shape Recovery By Gaussian Process Regression, Jianke Zhu, Steven C. H. Hoi, Michael R. Liu Jun 2009

Nonrigid Shape Recovery By Gaussian Process Regression, Jianke Zhu, Steven C. H. Hoi, Michael R. Liu

Research Collection School Of Computing and Information Systems

Most state-of-the-art nonrigid shape recovery methods usually use explicit deformable mesh models to regularize surface deformation and constrain the search space. These triangulated mesh models heavily relying on the quadratic regularization term are difficult to accurately capture large deformations, such as severe bending. In this paper, we propose a novel Gaussian process regression approach to the nonrigid shape recovery problem, which does not require to involve a predefined triangulated mesh model. By taking advantage of our novel Gaussian process regression formulation together with a robust coarse-to-fine optimization scheme, the proposed method is fully automatic and is able to handle large …


Mferio: The Design And Evaluation Of A Peer-To-Peer Mobile Payment System, Rajesh Krishna Balan, Narayanasamy Ramasubbu, Komsit Prakobphol, Nicolas Christin, Jason Hong Jun 2009

Mferio: The Design And Evaluation Of A Peer-To-Peer Mobile Payment System, Rajesh Krishna Balan, Narayanasamy Ramasubbu, Komsit Prakobphol, Nicolas Christin, Jason Hong

Research Collection School Of Computing and Information Systems

In this paper, we present the design and evaluation of a near-field communication-based mobile p2p payment application, called mFe-rio, that is designed to replace cash-based transactions. We first identify design criteria that payment systems should satisfy and then explain how mFerio, relative to those criteria, improves on the limitations of cash-based systems. We next describe mFerio's implementation and user interface design, focusing on the balance between usability and security. Finally, we present the results of a two-phase user study, involving a total of 104 people, that shows that mFerio has low cognitive load and is also fast, accurate, and easy …


Adaptive In-Network Processing For Bandwidth And Energy Constrained Mission-Oriented Multi-Hop Wireless Networks, Sharanya Eswaran, Matthew Johnson, Archan Misra, Thomas La Porta Jun 2009

Adaptive In-Network Processing For Bandwidth And Energy Constrained Mission-Oriented Multi-Hop Wireless Networks, Sharanya Eswaran, Matthew Johnson, Archan Misra, Thomas La Porta

Research Collection School Of Computing and Information Systems

In-network processing, involving operations such as filtering, compression and fusion, is widely used in sensor networks to reduce the communication overhead. In many tactical and stream-oriented wireless network applications, both link bandwidth and node energy are critically constrained resources and in-network processing itself imposes non-negligible computing cost. In this work, we have developed a unified and distributed closed-loop control framework that computes both a) the optimal level of sensor stream compression performed by a forwarding node, and b) the best set of nodes where the stream processing operators should be deployed. Our framework extends the Network Utility Maximization (NUM) paradigm, …


Intentional Learning Agent Architecture, Budhitama Subagdja, Liz Sonenberg, Iyad Rahwan Jun 2009

Intentional Learning Agent Architecture, Budhitama Subagdja, Liz Sonenberg, Iyad Rahwan

Research Collection School Of Computing and Information Systems

Dealing with changing situations is a major issue in building agent systems. When the time is limited, knowledge is unreliable, and resources are scarce, the issue becomes more challenging. The BDI (Belief-Desire-Intention) agent architecture provides a model for building agents that addresses that issue. The model can be used to build intentional agents that are able to reason based on explicit mental attitudes, while behaving reactively in changing circumstances. However, despite the reactive and deliberative features, a classical BDI agent is not capable of learning. Plans as recipes that guide the activities of the agent are assumed to be static. …


Simplenpkl: Simple Non-Parametric Kernel Learning, Jinfeng Zhuang, Ivor Tsang, Steven C. H. Hoi Jun 2009

Simplenpkl: Simple Non-Parametric Kernel Learning, Jinfeng Zhuang, Ivor Tsang, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity of standard interior-point SDP solvers could be as high as O(n6.5). Such intensive computation cost prohibits NPK learning applicable to real applications, even for data sets of moderate size. In this paper, we propose an efficient approach to NPK learning from side information, referred to as SimpleNPKL, which can efficiently learn non-parametric kernels from large sets of pairwise constraints. In particular, we show that the proposed SimpleNPKL with linear loss has a closed-form solution that can …


Applying Sanitizable Signature To Web-Service-Enabled Business Processes: Going Beyond Integrity Protection, Kar Way Tan, Robert H. Deng Jun 2009

Applying Sanitizable Signature To Web-Service-Enabled Business Processes: Going Beyond Integrity Protection, Kar Way Tan, Robert H. Deng

Research Collection School Of Computing and Information Systems

This paper studies the scenario where data in business documents is aggregated by different entities via the use of web services in streamlined business processes. The documents are transported within the Simple Object Access Protocol (SOAP) messages and travel through multiple intermediary entities, each potentially makes changes to the data in the documents. The WS-Security provides integrity protection by allowing portions of a SOAP message to be signed using eXtensible Markup Language (XML) signature scheme. This method however, has not considered the situation where a portion of data may be modified by another entity, therefore a need to allow the …


A Revisit Of Generative Model For Automatic Image Annotation Using Markov Random Fields, Yu Xiang, Xiangdong Zhou, Tat-Seng Chua, Chong-Wah Ngo Jun 2009

A Revisit Of Generative Model For Automatic Image Annotation Using Markov Random Fields, Yu Xiang, Xiangdong Zhou, Tat-Seng Chua, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Much research effort on Automatic Image Annotation (AIA) has been focused on Generative Model, due to its well formed theory and competitive performance as compared with many well designed and sophisticated methods. However, when considering semantic context for annotation, the model suffers from the weak learning ability. This is mainly due to the lack of parameter setting and appropriate learning strategy for characterizing the semantic context in the traditional generative model. In this paper, we present a new approach based on Multiple Markov Random Fields (MRF) for semantic context modeling and learning. Differing from previous MRF related AIA approach, we …


Super-Resolution Via Recapture And Bayesian Effect Modeling, Bryan S. Morse, Kevin Seppi, Neil Toronto, Dan A. Ventura Jun 2009

Super-Resolution Via Recapture And Bayesian Effect Modeling, Bryan S. Morse, Kevin Seppi, Neil Toronto, Dan A. Ventura

Faculty Publications

This paper presents Bayesian edge inference (BEI), a single-frame super-resolution method explicitly grounded in Bayesian inference that addresses issues common to existing methods. Though the best give excellent results at modest magnification factors, they suffer from gradient stepping and boundary coherence problems by factors of 4x. Central to BEI is a causal framework that allows image capture and recapture to be modeled differently, a principled way of undoing downsampling blur, and a technique for incorporating Markov random field potentials arbitrarily into Bayesian networks. Besides addressing gradient and boundary issues, BEI is shown to be competitive with existing methods on published …


Non-Redundant Sequential Rules - Theory And Algorithm, David Lo, Siau-Cheng Khoo, Limsoon Wong Jun 2009

Non-Redundant Sequential Rules - Theory And Algorithm, David Lo, Siau-Cheng Khoo, Limsoon Wong

Research Collection School Of Computing and Information Systems

A sequential rule expresses a relationship between two series of events happening one after another. Sequential rules are potentially useful for analyzing data in sequential format, ranging from purchase histories, network logs and program execution traces. In this work, we investigate and propose a syntactic characterization of a non-redundant set of sequential rules built upon past work on compact set of representative patterns. A rule is redundant if it can be inferred from another rule having the same support and confidence. When using the set of mined rules as a composite filter, replacing a full set of rules with a …


Architectural Dualities In Complex Systems: Components, Interfaces, Technologies And Organizations, C. Jason Woodard, Joel West Jun 2009

Architectural Dualities In Complex Systems: Components, Interfaces, Technologies And Organizations, C. Jason Woodard, Joel West

Research Collection School Of Computing and Information Systems

Research on technological innovation and product development has long recognized the importance of product architecture, and many scholars have explored its relationship to the organizational structure of the product development process. Product architecture, in turn, has long encompassed both the allocation of functionality to components and the pattern of linkages between them. In this paper, we forge new connections among these established ideas by examining them as two pairs of dual relationships. First, we draw attention to the duality between components and interfaces. While innovation and product development researchers have historically emphasized the partitioning of products and systems into components, …


Store And Forward Routing For Sparse Pico-Satellite Sensor Networks With Data-Mules, Trevor Joseph Koritza Jun 2009

Store And Forward Routing For Sparse Pico-Satellite Sensor Networks With Data-Mules, Trevor Joseph Koritza

Master's Theses

Satellites are playing an increasingly important role in collecting scientific information, providing communication services, and revolutionizing navigation. Until recently satellites were large and very expensive, creating a high barrier to entry that only large corporations and government agencies could overcome. In the past few years the CubeSat project at California Polytechnic University in San Luis Obispo (Cal Poly) has worked to refine the design and launching of small, lightweight, and less expensive satellites called pico-satellites, opening space up to a wider audience. Now that Cal Poly has the launch logistics and hardware under control, a new problem has arisen. These …


Energetic Path Finding Across Massive Terrain Data, Andrew N. Tsui Jun 2009

Energetic Path Finding Across Massive Terrain Data, Andrew N. Tsui

Master's Theses

Before there were airplanes, cars, trains, boats, or bicycles, the primary means of transportation was on foot. Unfortunately, many of the trails used by ancient travelers have long since been abandoned. We present a software tool which can help visualize and predict where these forgotten trails might lie through the use of a human-centered cost metric. By comparing the paths generated by our software with known historical trails, we demonstrate how the tool can indicate likely trails used by ancient travelers. In addition, this new tool provides novel visualizations to better help the user understand alternate paths, effect of terrain, …


Applying Computational Models Of Spatial Prepositions To Visually Situated Dialog, John D. Kelleher, Fintan Costello Jun 2009

Applying Computational Models Of Spatial Prepositions To Visually Situated Dialog, John D. Kelleher, Fintan Costello

Articles

This article describes the application of computational models of spatial prepositions to visually situated dialog systems. In these dialogs, spatial prepositions are important because people often use them to refer to entities in the visual context of a dialog. We first describe a generic architecture for a visually situated dialog system and highlight the interactions between the spatial cognition module, which provides the interface to the models of prepositional semantics, and the other components in the architecture. Following this, we present two new computational models of topological and projective spatial prepositions. The main novelty within these models is the fact …


Predictive Decoding Of Neural Data, Yaroslav O. Halchenko May 2009

Predictive Decoding Of Neural Data, Yaroslav O. Halchenko

Dissertations

In the last five decades the number of techniques available for non-invasive functional imaging has increased dramatically. Researchers today can choose from a variety of imaging modalities that include EEG, MEG, PET, SPECT, MRI, and fMRI.

This doctoral dissertation offers a methodology for the reliable analysis of neural data at different levels of investigation. By using statistical learning algorithms the proposed approach allows single-trial analysis of various neural data by decoding them into variables of interest. Unbiased testing of the decoder on new samples of the data provides a generalization assessment of decoding performance reliability. Through consecutive analysis of the …


Autonomous Migration Of Vertual Machines For Maximizing Resource Utilization, Hyung Won Choi May 2009

Autonomous Migration Of Vertual Machines For Maximizing Resource Utilization, Hyung Won Choi

Dissertations

Virtualization of computing resources enables multiple virtual machines to run on a physical machine. When many virtual machines are deployed on a cluster of PCs, some physical machines will inevitably experience overload while others are under-utilized over time due to varying computational demands. This computational imbalance across the cluster undermines the very purpose of maximizing resource utilization through virtualization. To solve this imbalance problem, virtual machine migration has been introduced, where a virtual machine on a heavily loaded physical machine is selected and moved to a lightly loaded physical machine. The selection of the source virtual machine and the destination …


A Bioinformatics Framework For Rna Structure Mining, Motif Discovery And Polyadenylation Analysis, Mugdha Khaladkar May 2009

A Bioinformatics Framework For Rna Structure Mining, Motif Discovery And Polyadenylation Analysis, Mugdha Khaladkar

Dissertations

The RNA molecules play various important roles in the cell and their functionality depends not only on the sequence information but to a large extent on their structure. The development of computational and predictive approaches to study RNA molecules is extremely valuable. In this research, a tool named RADAR was developed that provides a multitude of functionality for RNA data analysis and research. It aligns structure annotated RNA sequences so that both the sequence as well as structure information is taken into consideration. This tool is capable of performing pair-wise structure alignment, multiple structure alignment, database search and clustering. In …


Road-Based Routing In Vehicular Ad Hoc Networks, Josiane Nzouonta-Domgang May 2009

Road-Based Routing In Vehicular Ad Hoc Networks, Josiane Nzouonta-Domgang

Dissertations

Vehicular ad hoc networks (VANETs) can provide scalable and cost-effective solutions for applications such as traffic safety, dynamic route planning, and context-aware advertisement using short-range wireless communication. To function properly, these applications require efficient routing protocols. However, existing mobile ad hoc network routing and forwarding approaches have limited performance in VANETs. This dissertation shows that routing protocols which account for VANET-specific characteristics in their designs, such as high density and constrained mobility, can provide good performance for a large spectrum of applications.

This work proposes a novel class of routing protocols as well as three forwarding optimizations for VANETs. The …


Enterprise Information Technology Organizational Flexibility : Managing Uncertainty And Change, Karen Prast Patten May 2009

Enterprise Information Technology Organizational Flexibility : Managing Uncertainty And Change, Karen Prast Patten

Dissertations

Chief Information Officers (CIOs) lead enterprise information technology organizations (EITOs) in today's dynamic competitive business environment. CIOs deal with external and internal environmental changes, changing internal customer needs, and rapidly changing technology. New models for the organization include flexibility and suggest that CIOs should create and manage an enterprise IT organization that is more flexible in order to manage change and prepare for uncertainty, but they do not define what is meant by flexibility.

The first objective of this exploratory and ethnographic research study was to understand how uncertainty and unexpected change are currently managed by CIOs. The second was …


Leadership In Partially Distributed Teams, Linda Plotnick May 2009

Leadership In Partially Distributed Teams, Linda Plotnick

Dissertations

Inter-organizational collaboration is becoming more common. When organizations collaborate they often do so in partially distributed teams (PDTs). A PDT is a hybrid team that has at least one collocated subteam and at least two subteams that are geographically distributed and communicate primarily through electronic media. While PDTs share many characteristics with both traditionally collocated and fully distributed teams, they also have unique characteristics and issues.

This dissertation reports on a field study of PDTs conducted over two semesters with student participants, This research was conducted as part of a larger series of studies investigating PDTs, In these studies, participants …