Digital Commons Network^™

Dynamic Coalition Formation Under Uncertainty, Daylon J. Hooper, Gilbert L. Peterson, Brett J. Borghetti

Faculty Publications

Coalition formation algorithms are generally not applicable to real-world robotic collectives since they lack mechanisms to handle uncertainty. Those mechanisms that do address uncertainty either deflect it by soliciting information from others or apply reinforcement learning to select an agent type from within a set. This paper presents a coalition formation mechanism that directly addresses uncertainty while allowing the agent types to fall outside of a known set. The agent types are captured through a novel agent modeling technique that handles uncertainty through a belief-based evaluation mechanism. This technique allows for uncertainty in environmental data, agent type, coalition value, and …

Provost's Ezine October 2009, Division Of Academic Affairs

RIT Digital Archives

The Provost's eZine is a monthly electronic newsletter that shares information to the campus community about events and accomplishments in the division of Academic Affairs.

A Service Choice Model For Optimizing Taxi Service Delivery, Shih-Fen Cheng, Xin Qu

Research Collection School Of Computing and Information Systems

Taxi service has undergone radical revamp in recent years. In particular, significant investments in communication system and GPS devices have improved quality of taxi services through better dispatches. In this paper, we propose to leverage on such infrastructure and build a service choice model that helps individual drivers in deciding whether to serve a specific taxi stand or not. We demonstrate the value of our model by applying it to a real-world scenario. We also highlight interesting new potential approaches that could significantly improve the quality of taxi services.

Continuous Monitoring Of Spatial Queries In Wireless Broadcast Environments, Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Papadias

Research Collection School Of Computing and Information Systems

Wireless data broadcast is a promising technique for information dissemination that leverages the computational capabilities of the mobile devices in order to enhance the scalability of the system. Under this environment, the data are continuously broadcast by the server, interleaved with some indexing information for query processing. Clients may then tune in the broadcast channel and process their queries locally without contacting the server. Previous work on spatial query processing for wireless broadcast systems has only considered snapshot queries over static data. In this paper, we propose an air indexing framework that 1) outperforms the existing (i.e., snapshot) techniques in …

Sharing Mobile Multimedia Annotations To Support Inquiry-Based Learning Using Mobitop, Khasfariyati Razikin, Dion Hoe-Lian Goh, Yin-Leng Theng, Quang Minh Nguyen, Thi Nhu Quynh Kim, Ee Peng Lim, Chew-Hung Chang, Kalyani Chatterjea, Aixin Sun

Research Collection School Of Computing and Information Systems

Mobile devices used in educational settings are usually employed within a collaborative learning activity in which learning takes place in the form of social interactions between team members while performing a shared task. We introduce MobiTOP (Mobile Tagging of Objects and People), a geospatial digital library system which allows users to contribute and share multimedia annotations via mobile devices. A key feature of MobiTOP that is well suited for collaborative learning is that annotations are hierarchical, allowing annotations to be annotated by other users to an arbitrary depth. A group of student-teachers involved in an inquiry-based learning activity in geography …

Semantics-Preserving Bag-Of-Words Models For Efficient Image Annotation, Lei Wu, Steven C. H. Hoi, Nenghai Yu

Research Collection School Of Computing and Information Systems

The Bag-of-Words (BoW) model is a promising image representation for annotation. One critical limitation of existing BoW models is the semantic loss during the codebook generation process, in which BoW simply clusters visual words in Euclidian space. However, distance between two visual words in Euclidean space does not necessarily reflect the semantic distance between the two concepts, due to the semantic gap between low-level features and high-level semantics. In this paper, we propose a novel scheme for learning a codebook such that semantically related features will be mapped to the same visual word. In particular, we consider the distance between …

Lsuhsc Facilities Daily Update: October 2009, Lsuhsc Property And Facilities Management

LSUHSC Facilities Daily Updates: 2009

LSUHSC Dailly Facilities Updates from October 2009. These updates describe damage and a timeline of repairs at the LSU Health Sciences Center - New Orleans campus due to Hurricane Katrina which made landfall August 29, 2005.

Lsuhsc Facilities Biweekly Update: October 2009, Lsuhsc Property And Facilities Management

LSUHSC Facilities Biweekly Updates: 2009

LSUHSC Facilities Biweekly Updates from October 9 and 23, 2009. Original document for October 23 is misdated as "October 9. 2009".

These updates describe damage and a timeline of repairs at the LSU Health Sciences Center - New Orleans campus due to Hurricane Katrina which made landfall August 29, 2005.

Accounting For Differences Among Patients In The Fda Approval Process, Mark Van Der Laan, Anup Malani, Oliver Van Der Bembom

Public Law and Legal Theory Working Papers

The FDA employs an average-patient standard when reviewing drugs: it approves a drug only if the average patient (in clinical trials) does better on the drug than on control. It is common, however, for different patients to respond differently to a drug. Therefore, the average-patient standard can result in approval of a drug with significant negative effects for certain patient subgroups (false positives) and disapproval of drugs with significant positive effects for other patient subgroups (false negatives). Drug companies have a financial incentive to avoid false negatives. After their clinical trials reveal that their drug does not benefit the average …

Localizing Volumetric Motion For Action Recognition In Realistic Videos, Xiao Wu, Chong-Wah Ngo, Jintao Li, Yongdong Zhang

Research Collection School Of Computing and Information Systems

This paper presents a novel motion localization approach for recognizing actions and events in real videos. Examples include StandUp and Kiss in Hollywood movies. The challenge can be attributed to the large visual and motion variations imposed by realistic action poses. Previous works mainly focus on learning from descriptors of cuboids around space time interest points (STIP) to characterize actions. The size, shape and space-time position of cuboids are fixed without considering the underlying motion dynamics. This often results in large set of fragmentized cuboids which fail to capture long-term dynamic properties of realistic actions. This paper proposes the detection …

Towards Google Challenge: Combining Contextual And Social Information For Web Video Categorization, Xiao Wu, Wan-Lei Zhao, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Web video categorization is a fundamental task for web video search. In this paper, we explore the Google challenge from a new perspective by combing contextual and social information under the scenario of social web. The semantic meaning of text (title and tags), video relevance from related videos, and user interest induced from user videos, are integrated to robustly determine the video category. Experiments on YouTube videos demonstrate the effectiveness of the proposed solution. The performance reaches 60% improvement compared to the traditional text based classifiers.

Distribution-Based Concept Selection For Concept-Based Video Retrieval, Juan Cao, Hongfang Jing, Chong-Wah Ngo, Yongdong Zhang

Research Collection School Of Computing and Information Systems

Query-to-concept mapping plays one of the keys to concept-based video retrieval. Conventional approaches try to find concepts that are likely to co-occur in the relevant shots from the lexical or statistical aspects. However, the high probability of co-occurrence alone cannot ensure its effectiveness to distinguish the relevant shots from the irrelevant ones. In this paper, we propose distribution-based concept selection (DBCS) for query-to-concept mapping by analyzing concept score distributions of within and between relevant and irrelevant sets. In view of the imbalance between relevant and irrelevant examples, two variants of DBCS are proposed respectively by considering the two-sided and onesided …

Semantic Context Transfer Across Heterogeneous Sources For Domain Adaptive Video Search, Yu-Gang Jiang, Chong-Wah Ngo, Shih-Fu Chang

Research Collection School Of Computing and Information Systems

Automatic video search based on semantic concept detectors has recently received significant attention. Since the number of available detectors is much smaller than the size of human vocabulary, one major challenge is to select appropriate detectors to response user queries. In this paper, we propose a novel approach that leverages heterogeneous knowledge sources for domain adaptive video search. First, instead of utilizing WordNet as most existing works, we exploit the context information associated with Flickr images to estimate query-detector similarity. The resulting measurement, named Flickr context similarity (FCS), reflects the co-occurrence statistics of words in image context rather than textual …

Scalable Detection Of Partial Near-Duplicate Videos By Visual-Temporal Consistency, Hung-Khoon Tan, Chong-Wah Ngo, Richang Hong, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Following the exponential growth of social media, there now exist huge repositories of videos online. Among the huge volumes of videos, there exist large numbers of near-duplicate videos. Most existing techniques either focus on the fast retrieval of full copies or near-duplicates, or consider localization in a heuristic manner. This paper considers the scalable detection and localization of partial near-duplicate videos by jointly considering visual similarity and temporal consistency. Temporal constraints are embedded into a network structure as directed edges. Through the structure, partial alignment is novelly converted into a network flow problem where highly efficient solutions exist. To precisely …

Domain Adaptive Semantic Diffusion For Large Scale Context-Based Video Annotation, Yu-Gang Jiang, Jun Wang, Shih-Fu Chang, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Learning to cope with domain change has been known as a challenging problem in many real-world applications. This paper proposes a novel and efficient approach, named domain adaptive semantic diffusion (DASD), to exploit semantic context while considering the domain-shift-of-context for large scale video concept annotation. Starting with a large set of concept detectors, the proposed DASD refines the initial annotation results using graph diffusion technique, which preserves the consistency and smoothness of the annotation over a semantic graph. Different from the existing graph learning methods which capture relations among data samples, the semantic graph treats concepts as nodes and the …

First Acm Sigmm International Workshop On Social Media (Wsm'09), Suzanne Boll, Steven C. H. Hoi, Jiebo Luo, Rong Jin, Dong Xu, Irwin King

Research Collection School Of Computing and Information Systems

No abstract provided.

Parallel Sets In The Real World: Three Case Studies, Robert Kosara, Caroline Ziemkiewicz, F. Joseph Iii Mako, Tin Seong Kam

Research Collection School Of Computing and Information Systems

Parallel Sets are a visualization technique for categorical data. We recently released an implementation to the public in an effort to make our research useful to real users. This paper presents three case studies of Parallel Sets in use with real data.

Mining Quantified Temporal Rules: Formalism, Algorithms, And Evaluation, David Lo, Ganesan Ramalingam, Venkatesh-Prasad Ranganath, Kapil Vaswani

Research Collection School Of Computing and Information Systems

Libraries usually impose constraints on how clients should use them. Often these constraints are not well-documented. In this paper, we address the problem of recovering such constraints automatically, a problem referred to as specification mining. Given some client programs that use a given library, we identify constraints on the library usage that are (almost) satisfied by the given set of clients.The class of rules we target for mining combines simple binary temporal operators with state predicates (involving equality constraints) and quantification. This is a simple yet expressive subclass of temporal properties that allows us to capture many common API usage …

Secure Mobile Agents With Designated Hosts, Qi Zhang, Yi Mu, Minji Zhang, Robert H. Deng

Research Collection School Of Computing and Information Systems

Mobile agents often travel in a hostile environment where their security and privacy could be compromised by any party including remote hosts in which agents visit and get services. It was proposed in the literature that the host visited by an agent should jointly sign a service agreement with the agent's home, where a proxy-signing model was deployed and every host in the agent system can sign. We observe that this actually poses a serious problem in that a host that should be excluded from an underlying agent network could also send a signed service agreement. In order to solve …

A Surprise Triggered Adaptive And Reactive (Star) Framework For Online Adaptation In Non-Stationary Environments, Truong-Huy Dinh Nguyen, Tze-Yun Leong

Research Collection School Of Computing and Information Systems

We consider the task of developing an adaptive autonomous agent that can interact with non-stationary environments. Traditional learning approaches such as Reinforcement Learning assume stationary characteristics over the course of the problem, and are therefore unable to learn the dynamically changing settings correctly. We introduce a novel adaptive framework that can detect dynamic changes due to non-stationary elements. The Surprise Triggered Adaptive and Reactive (STAR) framework is inspired by human adaptability in dealing with daily life changes. An agent adopting the STAR framework consists primarily of two components, Adapter and Reactor. The Reactor chooses suitable actions based on predictions made …

Unsupervised Face Alignment By Robust Nonrigid Mapping, Jianke Zhu, Luc Van Gool, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

We propose a novel approach to unsupervised facial image alignment. Differently from previous approaches, that are confined to affine transformations on either the entire face or separate patches, we extract a nonrigid mapping between facial images. Based on a regularized face model, we frame unsupervised face alignment into the Lucas-Kanade image registration approach. We propose a robust optimization scheme to handle appearance variations. The method is fully automatic and can cope with pose variations and expressions, all in an unsupervised manner. Experiments on a large set of images showed that the approach is effective.

Streaming 3d Meshes Using Spectral Geometry Images, Ying He, Boon Seng Chew, Dayong Wang, Steven C. H. Hoi, Lap Pui Chau

Research Collection School Of Computing and Information Systems

The transmission of 3D models in the form of Geometry Images (GI) is an emerging and appealing concept due to the reduction in complexity from R3 to image space and wide availability of mature image processing tools and standards. However, geometry images often suffer from the artifacts and error during compression and transmission. Thus, there is a need to address the artifact reduction, error resilience and protection of such data information during the transmission across an error prone network. In this paper, we introduce a new concept, called Spectral Geometry Images (SGI), which naturally combines the powerful spectral analysis with …

Fault-Tolerance And Recovery In Wireless Sensor Networks, Kevin M. Somervill

Electrical & Computer Engineering Theses & Dissertations

The topic of Wireless Sensor Networks (WSNs) has gained considerable attention in the research community due to the variety of applications and interesting challenges in developing and deploying such networks. The typical WSN is significantly energy constrained and often deployed in harsh or even hostile environments, resulting in sensor nodes that are prone to failure. Failing nodes alter the topology of the network resulting in segmented routing paths and lost messages, ultimately reducing network efficiency. These issues spur the desire to develop energy-efficient, Fault-Tolerant (FT) algorithms that enable the network to persist in spite of the failed nodes. This work …

Fy2010 Salaries Over $50,000 For Part-Time And Temporary Employees, Clemson University

Salary Reports

No abstract provided.

Water Bathing Alters The Speed–Accuracy Trade-Off Of Escape Flights In European Starlings, Bo Brilot, L Asher, M Bateson

School of Biological and Marine Sciences

Birds of most species regularly bathe in water, but the function of this behaviour is unknown. We tested the hypothesis that water bathing is important in feather maintenance, and hence should enhance flight performance. We manipulated European starlings', Sturnus vulgaris, access to bathing water in a 2 × 2 design: birds were housed in aviaries either with or without water baths for a minimum of 3 days (long-term access) before being caught and placed in individual cages either with or without water baths for a further 24 h (short-term access). We subsequently assessed the speed and accuracy of escape flights …

Uav Intelligent Path Planning For Wilderness Search And Rescue, Michael A. Goodrich, Lanny Lin

Faculty Publications

In the priority search phase of Wilderness Search and Rescue, a probability distribution map is created. Areas with higher probabilities are searched first in order to find the missing person in the shortest expected time. When using a UAV to support search, the onboard video camera should cover as much of the important areas as possible within a set time. We explore several algorithms (with and without set destination) and describe some novel techniques in solving this problem and compare their performances against typical WiSAR scenarios. This problem is NP-hard, but our algorithms yield high quality solutions that approximate the …

Livecut: Learning-Based Interactive Video Segmentation By Evaluation Of Multiple Propagated Cues, Bryan S. Morse, Brian L. Price, Scott Cohen

Faculty Publications

Video sequences contain many cues that may be used to segment objects in them, such as color, gradient, color adjacency, shape, temporal coherence, camera and object motion, and easily-trackable points. This paper introduces LIVEcut, a novel method for interactively selecting objects in video sequences by extracting and leveraging as much of this information as possible. Using a graph-cut optimization framework, LIVEcut propagates the selection forward frame by frame, allowing the user to correct any mistakes along the way if needed. Enhanced methods of extracting many of the features are provided. In order to use the most accurate information from the …

Versatile Reactive Navigation, Robert P. Burton, Luther A. Tychonievich, Louis P. Tychonievich

Faculty Publications

Most autonomous mobile agents operate in a highly constrained environment. Despite significant research, existing solutions are limited in their ability to handle heterogeneous constraints within highly dynamic or uncertain environments. This paper presents a novel maneuver selection technique suited for both 2D and 3D environments with highly dynamic maneuvering constraints and multiple mobile obstacles. Agents may have any arbitrary set of nonholonomic control variables; maneuvers can be constrained by a broad class of function inequalities, including time-dependent constraints involving nonlinear relationships between controlled and agent-state variables. The resulting algorithm has been implemented to run in real time using only a …

Deep Rationality: The Evolutionary Economics Of Decision Making, Douglas T. Kenrick, Vladas Griskevicius, Jill M. Sundie, Norman P. Li, Jessica Yexin Li, Steven L. Neuberg

Research Collection School of Social Sciences

What is a “rational” decision? Economists traditionally viewed rationality as maximizing expected satisfaction. This view has been useful in modeling basic microeconomic concepts, but falls short in accounting for many everyday human decisions. It leaves unanswered why some things reliably make people more satisfied than others, and why people frequently act to make others happy at a cost to themselves. Drawing on an evolutionary perspective, we propose that people make decisions according to a set of principles that may not appear to make sense at the superficial level, but that demonstrate rationality at a deeper evolutionary level. By this, we …

Rc-Chord: Resource Clustering In A Large-Scale Hierarchical Peer-To-Peer System, Daniel R. Karrels, Gilbert L. Peterson, Barry E. Mullins

Faculty Publications

Conducting data fusion and Command and Control (C2) in large-scale systems requires more than the presently available Peer-to-Peer (P2P) technologies provide. Resource Clustered Chord (RC-Chord) is an extension to the Chord protocol that incorporates elements of a hierarchical peer-to-peer architecture to facilitate coalition formation algorithms in large-scale systems. Each cluster in this hierarchy represents a particular resource available for allocation, and RC-Chord provides the capabilities to locate agents of a particular resource. This approach improves upon other strategies by including support for abundant resources, or those resources that most or all agents in the system possess. This scenario exists in …