Computer Sciences Commons^™

Coenzyme Q1 Redox Metabolism During Passage Through The Rat Pulmonary Circulation And The Effect Of Hyperoxia, Said H. Audi, Marilyn P. Merker, Gary S. Krenz, Taniya Ahuja, David L. Roerig, Robert D. Bongard

Mathematics, Statistics and Computer Science Faculty Research and Publications

The objective was to evaluate the pulmonary disposition of the ubiquinone homolog coenzyme Q₁ (CoQ₁) on passage through lungs of normoxic (exposed to room air) and hyperoxic (exposed to 85% O₂ for 48 h) rats. CoQ₁ or its hydroquinone (CoQ₁H₂) was infused into the arterial inflow of isolated, perfused lungs, and the venous efflux rates of CoQ₁H₂ and CoQ₁ were measured. CoQ₁H₂ appeared in the venous effluent when CoQ₁ was infused, and CoQ₁ appeared when CoQ1H2 was infused. In normoxic lungs, CoQ …

A Model Based Fault Detection Scheme For Nonlinear Multivariable Discrete-Time Systems, Balaje T. Thumati, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, a novel robust scheme is developed for detecting faults in nonlinear discrete time multi-input and multi-output systems in contrast with the available schemes that are developed in continuous-time. Both state and output faults are addressed by considering separate time profiles. The faults, which could be incipient or abrupt, are modeled using input and output signals of the system. By using nonlinear estimation techniques, the discrete-time system is monitored online. Once a fault is detected, its dynamics are characterized using an online approximator. A stable parameter update law is developed for the online approximator scheme in discrete-time. The …

On The Assessment Of Pointcut Design In Evolving Aspect-Oriented Software, Raffi Khatchadourian, Phil Greenwood, Awais Rashid

Publications and Research

No abstract provided.

The Changing Usage Of A Mature Campus-Wide Wireless Network, Tristan Henderson, David Kotz, Ilya Abyzov

Dartmouth Scholarship

Wireless Local Area Networks (WLANs) are now commonplace on many academic and corporate campuses. As "Wi-Fi" technology becomes ubiquitous, it is increasingly important to understand trends in the usage of these networks. This paper analyzes an extensive network trace from a mature 802.11 WLAN, including more than 550 access points and 7000 users over seventeen weeks. We employ several measurement techniques, including syslog messages, telephone records, SNMP polling and tcpdump packet captures. This is the largest WLAN study to date, and the first to look at a mature WLAN. We compare this trace to a trace taken after the network's …

Near-Duplicate Keyframe Retrieval By Nonrigid Image Matching, Jianke Zhu, Steven C. H. Hoi, Michael R. Lyu, Shuicheng Yan

Research Collection School Of Computing and Information Systems

Near-duplicate image retrieval plays an important role in many real-world multimedia applications. Most previous approaches have some limitations. For example, conventional appearance-based methods may suffer from the illumination variations and occlusion issue, and local feature correspondence-based methods often do not consider local deformations and the spatial coherence between two point sets. In this paper, we propose a novel and effective Nonrigid Image Matching (NIM) approach to tackle the task of near-duplicate keyframe retrieval from real-world video corpora. In contrast to previous approaches, the NIM technique can recover an explicit mapping between two near-duplicate images with a few deformation parameters and …

Bayesian Tensor Approach For 3-D Face Modeling, Dacheng Tao, Mingli Song, Xuelong Li, Jialie Shen, Jimeng Sun, Xindong Wu, Christos Faloutsos, Stephen J. Maybank

Research Collection School Of Computing and Information Systems

Effectively modeling a collection of three-dimensional (3-D) faces is an important task in various applications, especially facial expression-driven ones, e.g., expression generation, retargeting, and synthesis. These 3-D faces naturally form a set of second-order tensors-one modality for identity and the other for expression. The number of these second-order tensors is three times of that of the vertices for 3-D face modeling. As for algorithms, Bayesian data modeling, which is a natural data analysis tool, has been widely applied with great success; however, it works only for vector data. Therefore, there is a gap between tensor-based representation and vector-based data analysis …

A Study Of Early Stage Game Design And Prototyping, Brien Colwell, Richard C. Davis, James A. Landay

Research Collection School Of Computing and Information Systems

Computer games and simulations can be valuable teaching and communication tools, and they are a powerful form of self-expression. Unfortunately, creating games requires programming, and programming requires time and skill. Some tools facilitate game creation to motivate novice programmers, but programming is still necessary. Other systems require less programming, but they are narrowly focused. To enable faster, simpler, and more expressive tools for professionals and amateurs, we have explored the processes and tools used in the early stages of game and simulation design. Interviews with educators clarified the uses of simulations in the classroom, while interviews with professional game designers …

Accelerating Near-Duplicate Video Matching By Combining Visual Similarity And Alignment Distortion, Hung-Khoon Tan, Xiao Wu, Chong-Wah Ngo, Wan-Lei Zhao

Research Collection School Of Computing and Information Systems

In this paper, we investigate a novel approach to accelerate the matching of two video clips by exploiting the temporal coherence property inherent in the keyframe sequence of a video. Motivated by the fact that keyframe correspondences between near-duplicate videos typically follow certain spatial arrangements, such property could be employed to guide the alignment of two keyframe sequences. We set the alignment problem as an integer quadratic programming problem, where the cost function takes into account both the visual similarity of the corresponding keyframes as well as the alignment distortion among the set of correspondences. The set of keyframe-pairs found …

Window Queries Over Data Streams, Jin Li

Dissertations and Theses

Evaluating queries over data streams has become an appealing way to support various stream-processing applications. Window queries are commonly used in many stream applications. In a window query, certain query operators, especially blocking operators and stateful operators, appear in their windowed versions. Previous research work in evaluating window queries typically requires ordered streams and this order requirement limits the implementations of window operators and also carries performance penalties. This thesis presents efficient and flexible algorithms for evaluating window queries. We first present a new data model for streams, progressing streams, that separates stream progress from physical-arrival order. Then, we …

Comparison Of Online Social Relations In Volume Vs Interaction: A Case Study Of Cyworld, Hyunwoo Chun, Haewoon Kwak, Young-Ho Eom, Yong-Yeol Ahn, Sue Moon, Hawoong. Jeong

Research Collection School Of Computing and Information Systems

Online social networking services are among the most popular Internet services according to Alexa.com and have become a key feature in many Internet services. Users interact through various features of online social networking services: making friend relationships, sharing their photos, and writing comments. These friend relationships are expected to become a key to many other features in web services, such as recommendation engines, security measures, online search, and personalization issues. However, we have very limited knowledge on how much interaction actually takes place over friend relationships declared online. A friend relationship only marks the beginning of online interaction.Does the interaction …

Recursive Pattern Based Hybrid Supervised Training, Kiruthika Ramanathan, Sheng Uei Guan

Research Collection School Of Computing and Information Systems

We propose, theorize and implement the Recursive Pattern-based Hybrid Supervised (RPHS) learning algorithm. The algorithm makes use of the concept of pseudo global optimal solutions to evolve a set of neural networks, each of which can solve correctly a subset of patterns. The pattern-based algorithm uses the topology of training and validation data patterns to find a set of pseudo-optima, each learning a subset of patterns. It is therefore well adapted to the pattern set provided. We begin by showing that finding a set of local optimal solutions is theoretically equivalent, and more efficient, to finding a single global optimum …

Fusing Semantics, Observability, Reliability And Diversity Of Concept Detectors For Video Search, Xiao-Yong Wei, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Effective utilization of semantic concept detectors for large-scale video search has recently become a topic of intensive studies. One of main challenges is the selection and fusion of appropriate detectors, which considers not only semantics but also the reliability of detectors, observability and diversity of detectors in target video domains. In this paper, we present a novel fusion technique which considers different aspects of detectors for query answering. In addition to utilizing detectors for bridging the semantic gap of user queries and multimedia data, we also address the issue of "observability gap" among detectors which could not be directly inferred …

Modeling Video Hyperlinks With Hypergraph For Web Video Reranking, Hung-Khoon Tan, Chong-Wah Ngo, Xiao Wu

Research Collection School Of Computing and Information Systems

In this paper, we investigate a novel approach of exploiting visual-duplicates for web video reranking using hypergraph. Current graph-based reranking approaches consider mainly the pair-wise linking of keyframes and ignore reliability issues that are inherent in such representation. We exploit higher order relation to overcome the issues of missing links in visual-duplicate keyframes and in addition identify the latent relationships among keyframes. Based on hypergraph, we consider two groups of video threads: visual near-duplicate threads and story threads, to hyperlink web videos and describe the higher order information existing in video content. To facilitate reranking using random walk algorithm, the …

Output Regularized Metric Learning With Side Information, Wei Liu, Steven C. H. Hoi, Jianzhuang Liu

Research Collection School Of Computing and Information Systems

Distance metric learning has been widely investigated in machine learning and information retrieval. In this paper, we study a particular content-based image retrieval application of learning distance metrics from historical relevance feedback log data, which leads to a novel scenario called collaborative image retrieval. The log data provide the side information expressed as relevance judgements between image pairs. Exploiting the side information as well as inherent neighborhood structures among examples, we design a convex regularizer upon which a novel distance metric learning approach, named output regularized metric learning, is presented to tackle collaborative image retrieval. Different from previous distance metric …

Remote Attestation On Program Execution, Liang Gu, Xuhua Ding, Robert H. Deng, Bing Xie, Hong Mei

Research Collection School Of Computing and Information Systems

Remote attestation provides the basis for one platform to establish trusts on another. In this paper, we consider the problem of attesting the correctness of program executions. We propose to measure the target program and all the objects it depends on, with an assumption that the Secure Kernel and the Trusted Platform Module provide a secure execution environment through process separation. The attestation of the target program begins with a program analysis on the source code or the binary code in order to find out the relevant executables and data objects. Whenever such a data object is accessed or a …

Event Detection With Common User Interests, Meishan Hu, Aixin Sun, Ee Peng Lim

Research Collection School Of Computing and Information Systems

In this paper, we aim at detecting events of common user interests from huge volume of user-generated content. The degree of interest from common users in an event is evidenced by a significant surge of event-related queries issued to search for documents (e.g., news articles, blog posts) relevant to the event. Taking the stream of queries from users and the stream of documents as input, our proposed framework seamlessly integrates the two streams into a single stream of query profiles. A query profile is a set of documents matching a query at a given time. With the single stream of …

Specification Mining Of Symbolic Scenario-Based Models, David Lo, Shahar Maoz

Research Collection School Of Computing and Information Systems

Many dynamic analysis approaches to specification mining, which extract behavioral models from execution traces, do not consider object identities. This limits their power when used to analyze traces of general object oriented programs. In this work we present a novel specification mining approach that considers object identities, and, moreover, generalizes from specifications involving concrete objects to their symbolic class-level abstractions. Our approach uses data mining methods to extract significant scenario-based specifications in the form of Damm and Harel's live sequence charts (LSC), a formal and expressive extension of classic sequence diagrams. We guarantee that all mined symbolic LSCs are significant …

Specifying And Verifying Sensor Networks: An Experiment Of Formal Methods, Jin Song Dong, Jing Sun, Jun Sun, Kenji Taguchi, Xian Zhang

Research Collection School Of Computing and Information Systems

With the development of sensor technology and electronic miniaturization, wireless sensor networks have shown a wide range of promising applications as well as challenges. Early stage sensor network analysis is critical, which allows us to reveal design errors before sensor deployment. Due to their distinguishable features, system specification and verification of sensor networks are highly non-trivial tasks. On the other hand, numerous formal theories and analysis tools have been developed in formal methods community, which may offer a systematic method for formal analysis of sensor networks. This paper presents our attempt on applying formal methods to sensor network specification/verification. An …

Understanding Evolution In Technology Ecosystems, Gediminas Adomavicius, Jesse Bockstedt, Alok Gupta, Robert J. Kauffman

Research Collection School Of Computing and Information Systems

The current environment of information technology can be a complex place for analysts and firms to navigate, especially when making decisions about new product development, technology investment, and technology planning. Many industry analysts recognize that it is difficult, if not impossible, to accurately predict future technological advances. However, successful firms need to understand the nature of technological change and evolution in order to accurately forecast and take advantage of investment and market opportunities. For example, although RFID has been in the news for the past decade as the potential distribution and retail "killer technology", uncertainties about its future technical capabilities, …

Resource-Aware Video Multicasting Via Access Gateways In Wireless Mesh Networks, Wanqing Tu, Cormac J. Sreenan, Chun Tung Chou, Archan Misra

Research Collection School Of Computing and Information Systems

This paper studies video multicasting in large scale areas using wireless mesh networks. The focus is on the use of Internet access gateways that allow a choice of alternative routes to avoid potentially lengthy multi-hop wireless paths with low capacity. A set of heuristic-based algorithms are described that together aim to maximize network capacity: the two-tier integrated architecture algorithm, the weighted gateway uploading algorithm, the link-controlled routing tree algorithm, and the alternative channel assignment algorithm. These algorithms use different approaches to arrange multicast group members into a clustered and two-tier integrated architecture in which network protocols can make use of …

Impacts Of Information And Communication Technologies On Country Development: Accounting For Area Interrelationships, Robert J. Kauffman, Ajay Kumar

Research Collection School Of Computing and Information Systems

Single-item composite indices gauge ICT readiness at the country level but do not represent the direct impact of ICTs on a country's development. This paper describes a new approach to measuring the macrolevel impacts of ICTs across a range of development areas. The indirect effects of one area on others is taken into consideration by a simultaneous equation model that permits the inclusion of multiple development areas. The model is applied to data pertaining to four development areas in 64 countries: trade flows, agricultural productivity, R&D, and quality of life. ICT readiness is found to have a positive association with …

Using Timed-Release Cryptography To Mitigate Preservation Risk Of Embargo Periods, Rabia Haq

Computer Science Theses & Dissertations

This research defines Time-Locked Embargo, a framework designed to mitigate the Preservation Risk Interval: the preservation risk associated with embargoed scholarly material. Due to temporary access restrictions, embargoed data cannot be distributed freely and thus preserved via data refreshing during the embargo time interval. A solution to mitigate the risk of data loss has been developed by suggesting a data dissemination framework that allows data refreshing of encrypted instances of embargoed content in an open, unrestricted scholarly community. This framework has been developed by exploiting implementations of existing technologies to"time-lock" data using Timed-Release Cryptology (TRC) so that it can be …

An Agent-Based Combat Simulation Framework In Support Of Effect-Based And Net-Centric Evaluation, Robert Joseph Bowen

Computational Modeling & Simulation Engineering Theses & Dissertations

The use of information technologies (IT) and information networks has proliferated in industry as a method to achieve competitive advantage. The U.S. Military and its allies, in recent years, have employed IT to improve the way they conduct operations, speed decision making, and increase the span of control of commanders. This has resulted in a fundamental shift in the way military commanders employ combat units today. These (Information Age) forces no longer have to be able to see each other or even communicate directly in order to synchronize maneuvers. Dispersion is now favored over mass, relying on the IT network …

Engineering Management Framework In Support Of Modeling & Simulation Application For Domain Specific Procurement, Thomas Guy Litwin

Engineering Management & Systems Engineering Theses & Dissertations

A strategic process is desirable for project-based organizations in order for them to be efficient and effective when developing Modeling & Simulation (M&S) systems. This thesis proposes an overarching process that combines traditional M&S and Engineering Management methodologies in a new framework to support M&S organizations during the procurement process.

This thesis proposes both a Strategic Project Management Process (SPMP) and a systems engineering process for M&S federation development projects. The systems engineering process utilizes the artifacts of Model Driven Architecture (MDA) to support building M&S federations driven by operational requirements. Detailed research of this systems engineering process revealed a …

The Development Of Genetic Algorithm For The Prediction Of Ship Motion From Wave Radar Data, Sumanth Tirumala Vangipuram

Electrical & Computer Engineering Theses & Dissertations

Genetic Algorithms represent a model of natural process based on the Darwinian principle of evolution. Genetic algorithms are used to solve optimization problems by generating a set of possible solutions and determining which of these solutions most closely match the desired result. The Genetic Algorithm (GA) initially generates a random set of possible solutions, or populations, determines which members of the population are most desirable, and calculates better solutions by implementing genetic operations such as reproduction, cloning, and mutation. Problems where the evaluation of a solution is computationally simple enable the GA to search a vast search space. One of …

Enhancement Of Unusual Color In Aerial Video Sequences For Assisting Wilderness Search And Rescue, Bryan S. Morse, Nathan D. Rasmussen, Daniel Thornton

Faculty Publications

The use of aerial video for search and surveillance has been popularized by the increased use of camera-equipped unmanned aerial vehicles. For many search applications, objects may also be missed by observers due to their small size, brief visibility, or the inherent monotony of the scene. This paper presents a novel method for automatically emphasizing unusually colored objects to improve their detectability. We use a hue histogram and a local saliency measure to find unusually colored objects, then boost the saturation of these objects while desaturating more common colors, thus drawing the observer’s attention and facilitating video search.

Hop-By-Hop Multicast Transport For Mobile Ad Hoc Wireless Networks, Manoj Pandey, Daniel Zappala

Faculty Publications

Multicast transport is a challenging problem because the source must provide congestion control and reliability for a tree, rather than a single path. This problem is made even more difficult in mobile ad hoc networks due to problems caused by contention, spatial reuse, and mobility. In this paper, we design a hop-by-hop multicast transport protocol, which pushes transport functionality into the core of the network. Although this requires per-flow state, a hop-by-hop approach simplifies congestion control, enables local recovery of lost packets, and provides low delay and efficient use of wireless capacity. We use a simulation study to demonstrate the …

Scalable Multicast Routing For Ad Hoc Networks, Manoj Pandey, Daniel Zappala

Faculty Publications

Routing in a mobile ad hoc network is challenging because nodes can move at any time, invalidating a previously-discovered route. Multicast routing is even more challenging, because a source needs to maintain a route to potentially many group members simultaneously. Providing scalable solutions to this problem typically requires building a hierarchy or an overlay network to reduce the cost of route discovery and maintenance. In this paper, we show that a much simpler alternative is possible, by using source specific semantics and relying on the unicast routing protocol to find all routes. This separation of concerns enables the multicast routing …

An Effective Approach To 3d Deformable Surface Tracking, Jianke Zhu, Steven C. H. Hoi, Zenglin Xu, Michael R. Lyu

Research Collection School Of Computing and Information Systems

The key challenge with 3D deformable surface tracking arises from the difficulty in estimating a large number of 3D shape parameters from noisy observations. A recent state-of-the-art approach attacks this problem by formulating it as a Second Order Cone Programming (SOCP) feasibility problem. The main drawback of this solution is the high computational cost. In this paper, we first reformulate the problem into an unconstrained quadratic optimization problem. Instead of handling a large set of complicated SOCP constraints, our new formulation can be solved very efficiently by resolving a set of sparse linear equations. Based on the new framework, a …

Representative Entry Selection For Profiling Blogs, Jinfeng Zhuang, Steven C. H. Hoi, Aixin Sun, Rong Jin

Research Collection School Of Computing and Information Systems

Many applications on blog search and mining often meet the challenge of handling huge volume of blog data, in which one single blog could contain hundreds or even thousands of entries. We investigate novel techniques for profiling blogs by selecting a subset of representative entries for each blog. We propose two principles for guiding the entry selection task: representativeness and diversity. Further, we formulate the entry selection task into a combinatorial optimization problem and propose a greedy yet effective algorithm for finding a good approximate solution by exploiting the theory of submodular functions. We suggest blog classification for judging the …