Computer Sciences Commons^™

Sexual Interactions: Why We Should Talk About Sex In Hci, Johanna Brewer, Joseph Jofish Kaye, Amanda Williams, Susan Wyche

Computer Science: Faculty Publications

Within the CHI community there is growing interest in moving beyond cognition and expanding into the social, emotional, and bodily aspects of the human-computer experience. Sex lies at the intersection of these concerns, and indeed outside of HCI, has become a central topic for anthropology, behavioral sciences, and other areas of intellectual inquiry. Examining sex and themes related to it has benefited these disciplines and we intend to understand how it can contribute to HCI. There is a tendency to desexualize technology, despite the presence of sex and sexuality in a variety of interactions, including the use of the internet …

Implicit Online Learning With Kernels, Li Cheng, S. V. N. Vishwanathan, Dale Schuurmans, Shaojun Wang, Terry Caelli

Kno.e.sis Publications

We present two new algorithms for online learning in reproducing kernel Hilbert spaces. Our first algorithm, ILK (implicit online learning with kernels), employs a new, implicit update technique that can be applied to a wide variety of convex loss functions. We then introduce a bounded memory version, SILK (sparse ILK), that maintains a compact representation of the predictor without compromising solution quality, even in non-stationary environments. We prove loss bounds and analyze the convergence rate of both. Experimental evidence shows that our proposed algorithms outperform current methods on synthetic and real data.

Formal Analysis And Systematic Construction Of Two-Factor Authentication Scheme, Guomin Yang, Duncan S. Wong, Huaxiong Wang, Xiaotie Deng

Research Collection School Of Computing and Information Systems

One of the most commonly used two-factor authentication mechanisms is based on smart card and user’s password. Throughout the years, there have been many schemes proposed, but most of them have already been found flawed due to the lack of formal security analysis. On the cryptanalysis of this type of schemes, in this paper, we further review two recently proposed schemes and show that their security claims are invalid. To address the current issue, we propose a new and simplified property set and a formal adversarial model for analyzing the security of this type of schemes. We believe that the …

Plans As Products Of Learning, Samin Karim, Budhitama Subagdja, Liz Sonenberg

Research Collection School Of Computing and Information Systems

This paper presents motivations and current related work in the field of plan learning. Additionally, two approaches that achieve plan learning are presented. The two presented approaches are centred on the BDI framework of agency and have particular focus on plans, which, alongside goals, are the means to fulfil intentions in most pragmatic and theoretical realisations of the BDI framework. The first approach is a hybrid architecture that combines a BDI plan extractor and executor with a generic low-level learner. The second approach uses hypotheses to suggest incremental refinements of a priori plans. Both approaches achieve plan generation that is …

Continuous Monitoring Of Knn Queries In Wireless Sensor Networks, Yuxia Yao, Xueyan Tang, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Wireless sensor networks have been widely used for civilian and military applications, such as environmental monitoring and vehicle tracking. In these applications, continuous query processing is often required and their efficient evaluation is a critical requirement to be met. Due to the limited power supply for sensor nodes, energy efficiency is a major performance measure in such query evaluation. In this paper, we focus on continuous kNN query processing. We observe that the centralized data storage and monitoring schemes do not favor energy efficiency. We therefore propose a localized scheme to monitor long running nearest neighbor queries in sensor networks. …

Cheating To Get Better Roommates In A Random Stable Matching, Chien-Chung Huang

Computer Science Technical Reports

This paper addresses strategies for the stable roommates problem, assuming that a stable matching is chosen at random. We investigate how a cheating man should permute his preference list so that he has a higher-ranking roommate probabilistically. In the first part of the paper, we identify a necessary condition for creating a new stable roommate for the cheating man. This condition precludes any possibility of his getting a new roommate ranking higher than all his stable roommates when everyone is truthful. Generalizing to the case that multiple men collude, we derive another impossibility result: given any stable matching in which …

Use Of Remote Sensing Applications And Its Implications To The Society, Stefan Robila

Department of Computer Science Faculty Scholarship and Creative Works

Remote sensing, i.e. the technology that allows measuring object's properties from a distance, is currently undergoing tremendous advances in both precision and areas of applicability. Our study provides an overview of the recent developments in RS applications and their implications to the society. This was approached from three distinct directions, all with significant influence on the human's perception of the technology. First, we discuss how disaster prevention, reaction, and recovery can be supported by remote sensing. Next, we look at the popular view of remote sensing, as illustrated by media and commercial applications. Finally, we discuss legal implication of sensing …

Evaluating Next Cell Predictors With Extensive Wi-Fi Mobility Data, Libo Song, David Kotz, Ravi Jain, Xiaoning He

Dartmouth Scholarship

Location is an important feature for many applications, and wireless networks can better serve their clients by anticipating client mobility. As a result, many location predictors have been proposed in the literature, though few have been evaluated with empirical evidence. This paper reports on the results of the first extensive empirical evaluation of location predictors, using a two-year trace of the mobility patterns of over 6,000 users on Dartmouth's campus-wide Wi-Fi wireless network. The surprising results provide critical evidence for anyone designing or using mobility predictors. \par We implemented and compared the prediction accuracy of several location predictors drawn from …

Development And Implementation Of Optimized Energy-Delay Sub-Network Routing Protocol For Wireless Sensor Networks, James W. Fonda, Maciej Zawodniok, S. Jagannathan, Steve E. Watkins

Electrical and Computer Engineering Faculty Research & Creative Works

The development and implementation of the optimized energy-delay sub-network routing (OEDSR) protocol for wireless sensor networks (WSN) is presented. This on demand routing protocol minimizes a novel link cost factor which is defined using available energy, end-to-end (E2E) delay and distance from a node to the base station (BS), along with clustering, to effectively route information to the BS. Initially, the nodes are either in idle or sleep mode, but once an event is detected, the nodes near the event become active and start forming sub-networks. Formation of the inactive network into a sub-network saves energy because only a portion …

On The Lower Bound Of Local Optimums In K-Means Algorithms, Zhenjie Zhang, Bing Tian Dai, Anthony K.H. Tung

Research Collection School Of Computing and Information Systems

No abstract provided.

Rapid Identification Of Column Heterogeneity, Bing Tian Dai, Nick Koudas, Beng Chin Ooi, Divesh Srivastava, Suresh Venkatasubramanian

Research Collection School Of Computing and Information Systems

No abstract provided.

Towards Effective Content-Based Music Retrieval With Multiple Acoustic Feature Composition, Jialie Shen, John Shepherd, Ngu Ahh

Research Collection School Of Computing and Information Systems

In this paper, we present a new approach to constructing music descriptors to support efficient content-based music retrieval and classification. The system applies multiple musical properties combined with a hybrid architecture based on principal component analysis (PCA) and a multilayer perceptron neural network. This architecture enables straightforward incorporation of multiple musical feature vectors, based on properties such as timbral texture, pitch, and rhythm structure, into a single low-dimensioned vector that is more effective for classification than the larger individual feature vectors. The use of supervised training enables incorporation of human musical perception that further enhances the classification process. We compare …

An Experimental Study On U-Commerce Adoption: Impact Of Personalization And Privacy Concerns, H. Sheng, Fiona Fui-Hoon Nah, Keng Siau

Research Collection School Of Computing and Information Systems

Ubiquitous commerce (u-commerce) represents "anytime, anywhere" commerce. U-commerce can provide a high level of personalization, which can bring significant benefits to customers. However, privacy is a major concern to customers and an obstacle to the adoption of u-commerce. This research examines how personalization and context can impact customers' privacy concerns as well as intention to adopt u-commerce applications. As u-commerce is new and emerging, we used the scenario-based approach to operationalize personalization and context in an experimental study. The experimental results show that the effects of personalization on customers' privacy concerns and adoption intention are situation dependent.

Identifying Difficulties In Learning Uml, Keng Siau, Poi-Peng Loo

Research Collection School Of Computing and Information Systems

Despite its recognition as a standard object-oriented modeling language, Unified Modeling Language (UML) has been criticized for such deficiencies as semantic inconsistencies, vagueness, and conflicting notations. the relationship between these deficiencies and the difficulties in the learning process is the focus of this study. A concept mapping technique is used to unveil the learning difficulties and suggestions for alleviating them are provided.

Clique Percolation For Finding Naturally Cohesive And Overlapping Document Clusters, Wei Gao, Kam-Fai Wong, Yunqing Xia, Ruifeng Xu

Research Collection School Of Computing and Information Systems

Techniques for find document clusters mostly depend on models that impose strong explicit and/or implicit priori assumptions. As a consequence, the clustering effects tend to be unnatural and stray away from the intrinsic grouping natures of a document collection. We apply a novel graph-theoretic technique called Clique Percolation Method (CPM) for document clustering. In this method, a process of enumerating highly cohesive maximal document cliques is performed in a random graph, where those strongly adjacent cliques are mingled to form naturally overlapping clusters. Our clustering results can unveil the inherent structural connections of the underlying data. Experiments show that CPM …

Gridfields: Model-Driven Data Transformation In The Physical Sciences, Bill Howe

Dissertations and Theses

Scientists' ability to generate and store simulation results is outpacing their ability to analyze them via ad hoc programs. We observe that these programs exhibit an algebraic structure that can be used to facilitate reasoning and improve performance. In this dissertation, we present a formal data model that exposes this algebraic structure, then implement the model, evaluate it, and use it to express, optimize, and reason about data transformations in a variety of scientific domains.

Simulation results are defined over a logical grid structure that allows a continuous domain to be represented discretely in the computer. Existing approaches for manipulating …

A Fuzzy Logic Controller For Autonomous Wheeled Vehicles, Mohamed Trabia, Linda Z. Shi, Neil Eugene Hodge

Mechanical Engineering Faculty Research

Autonomous vehicles have potential applications in many fields, such as replacing humans in hazardous environments, conducting military missions, and performing routine tasks for industry. Driving ground vehicles is an area where human performance has proven to be reliable. Drivers typically respond quickly to sudden changes in their environment. While other control techniques may be used to control a vehicle, fuzzy logic has certain advantages in this area; one of them is its ability to incorporate human knowledge and experience, via language, into relationships among the given quantities. Fuzzy logic controllers for autonomous vehicles have been successfully applied to address various …

Moving Object Tracking: Seeking Extensible Solutions, Jeremy Pack

Undergraduate Honors Capstone Projects

Moving object tracking is a difficult field with no "best" solution. The documents contained here detail software that was developed in order to perform tracking of objects that are in the line of sight of multiple cameras. Some of the software developed is already in use by the US Army Dugway Proving Ground. Other software represents prototype or early development code. This software was written by Jeremy Pack, who was the lead programmer, and Luke Andrew at the Space Dynamics Laboratory in Logan, Utah.

Generating Paraphrases With Greater Variation Using Syntactic Phrases, Rebecca Diane Madsen

Theses and Dissertations

Given a sentence, a paraphrase generation system produces a sentence that says the same thing but usually in a different way. The paraphrase generation problem can be formulated in the machine translation paradigm; instead of translation of English to a foreign language, the system translates an English sentence (for example) to another English sentence. Quirk et al. (2004) demonstrated this approach to generate almost 90% acceptable paraphrases. However, most of the sentences had little variation from the original input sentence. Leveraging syntactic information, this thesis project presents an approach that successfully generated more varied paraphrase sentences than the approach of …

Finding A Length-Constrained Maximum-Sum Or Maximum-Density Subtree And Its Application To Logistics, Hoong Chuin Lau, Trung Hieu Ngo, Bao Nguyen Nguyen

Research Collection School Of Computing and Information Systems

We study the problem of finding a length-constrained maximum-density path in a tree with weight and length on each edge. This problem was proposed in [R.R. Lin, W.H. Kuo, K.M. Chao, Finding a length-constrained maximum-density path in a tree, Journal of Combinatorial Optimization 9 (2005) 147–156] and solved in O(nU) time when the edge lengths are positive integers, where n is the number of nodes in the tree and U is the length upper bound of the path. We present an algorithm that runs in O(nlog2n) time for the generalized case when the edge lengths are positive real numbers, which …

Measuring Qualities Of Articles Contributed By Online Communities, Ee Peng Lim, Ba-Quy Vuong, Hady W. Lauw, Aixin Sun

Research Collection School Of Computing and Information Systems

Using open source Web editing software (e.g., wiki), online community users can now easily edit, review and publish articles collaboratively. While much useful knowledge can be derived from these articles, content users and critics are often concerned about their qualities. In this paper, we develop two models, namely basic model and peer review model, for measuring the qualities of these articles and the authorities of their contributors. We represent collaboratively edited articles and their contributors in a bipartite graph. While the basic model measures an article's quality using both the authorities of contributors and the amount of contribution from each …

Reputation Stretching In Online Auctions, Jianqing Chen, Mei Lin, Andrew B. Whinston

Research Collection School Of Computing and Information Systems

Reputation systems are ubiquitously employed in the online marketplaces to provide information on users’ abilities and trustworthiness. We focus particularly on the problem of reputation stretching, the extension of an established reputation into a new market. By examining various factors—market size, the expected performance in the expanding market, and the risk of performance in the expanding market—we characterize conditions that affect bidder’s stretching decision in the expanding market. Moreover, we analyze both the short-term and the long-term expanding cases, and obtain contrasting results in the two settings.

Supply Chain Information Sharing In A Macro Prediction Market, Zhiling Guo, Fang Fang, Andrew B. Whinston

Research Collection School Of Computing and Information Systems

This paper aims to address supply chain partners' incentives for information sharing from an information systems design perspective. Specifically, we consider a supply chain characterized by N geographically distributed retailers who order a homogeneous product from one manufacturer. Each retailer's demand risk consists of two parts: a systematic risk part that affects all retailers and an idiosyncratic risk part that only has a local effect. We propose a macro prediction market to effectively elicit and aggregate useful information about systematic demand risk. We show that such information can be used to achieve accurate demand forecast sharing and better channel coordination …

Set-Based Cascading Approaches For Magnetic Resonance (Mr) Image Segmentation (Scamis), Jiang Liu, Tze-Yun Leong, Kin Ban Chee, Boon Pin Tan, Borys Shuter, Shih Chang Wang

Research Collection School Of Computing and Information Systems

This paper introduces Set-based Cascading Approach for Medical Image Segmentation (SCAMIS), a new methodology for segmentation of medical imaging by integrating a number of algorithms. Existing approaches typically adopt the pipeline methodology. Although these methods provide promising results, the results generated are still susceptible to over-segmentation and leaking. In our methodology, we describe how set operations can be utilized to better overcome these problems. To evaluate the effectiveness of this approach, Magnetic Resonance Images taken from a teaching hospital research programme have been utilised, to reflect the real world quality needed for testing in patient datasets. A comparison between the …

Cosign: A Parallel Algorithm For Coordinated Traffic Signal Control, Shih-Fen Cheng, Marina A. Epelman, Robert L. Smith

Research Collection School Of Computing and Information Systems

The problem of finding optimal coordinated signal timing plans for a large number of traffic signals is a challenging problem because of the exponential growth in the number of joint timing plans that need to be explored as the network size grows. In this paper, the game-theoretic paradigm of fictitious play to iteratively search for a coordinated signal timing plan is employed, which improves a system-wide performance criterion for a traffic network. The algorithm is robustly scalable to realistic-size networks modeled with high-fidelity simulations. Results of a case study for the city of Troy, MI, where there are 75 signalized …

Dynamic Multi-Linked Negotiations In Multi-Echelon Production Scheduling Networks, Hoong Chuin Lau, Guan Li Soh, Wee Chong Wan

Research Collection School Of Computing and Information Systems

In this paper, we are concerned with scheduling resources in a multi-tier production/logistics system for multi-indenture goods. Unlike classical production scheduling problems, the problem we study is concerned with local utilities which are private. We present an agent model and investigate an efficient scheme for handling multi-linked agent negotiations. With this scheme we attempt to overcome the drawbacks of sequential negotiations and negotiation parameter settings. Our approach is based on embedding a credit-based negotiation protocol within a local search scheduling algorithm. We demonstrate the computational efficiency and effectiveness of the approach in solving a real-life dynamic production scheduling problem which …

Online Advertising By The Comparison Challenge Approach, Jae Wong Lee, Jae Kyu Lee

Research Collection School Of Computing and Information Systems

To enhance the effectiveness of online comparisons from a manufacturer's point of view, we develop a framework for the comparison challenge approach. To develop the comparison challenge framework, we analyze 12 factors that determine the characteristics of comparison and propose models of valuable comparison challenges using the CompareMe and CompareThem strategies. We demonstrate the approaches with the example of PC selection. To help plan the comparison challenges, we formulate a mathematical programming model that maximizes the total value of comparison under the constraints of comparison opportunity and budgetary limitation. The model is applied to eight comparison scenarios, and its performance …

Designing Web Sites For Customer Loyalty Across Business Domains: A Multilevel Analysis, S. Mithas, Narayanasamy Ramasubbu, M. S. Krishnan, C. Fornell

Research Collection School Of Computing and Information Systems

Web Sites are important components of Internet strategy for organizations. This paper develops a theoretical model for understanding the effect of Web site design elements on customer loyalty to a Web site. We show the relevance of the business domain of a Web site to gain a contextual understanding of relative importance of Web site design elements. We use a hierarchical linear modeling approach to model multilevel and cross-level interactions that have not been explicitly considered in previous research. By analyzing, data on more than 12,000 online customer surveys for 43 Web sites in several business domains, we find that …

Query-Based Watermarking For Xml Data, Xuan Zhou, Hwee Hwa Pang, Kian-Lee Tan

Research Collection School Of Computing and Information Systems

As increasing amount of XML data is exchanged over the internet, copyright protection of this type of data is becoming an important requirement for many applications. In this paper, we introduce a rights protection scheme for XML data based on digital watermarking. One of the main challenges for watermarking XML data is that the data could be easily reorganized by an adversary in an attempt to destroy any embedded watermark. To overcome it, we propose a query-based watermarking scheme, which creates queries to identify available watermarking capacity, such that watermarks could be recovered from reorganized data through query rewriting. The …

Towards Effective Content-Based Music Retrieval With Multiple Acoustic Feature Combination, Jialie Shen, John Shepherd, Ann H. H. Ngu

Research Collection School Of Computing and Information Systems

In this paper, we present a new approach to constructing music descriptors to support efficient content-based music retrieval and classification. The system applies multiple musical properties combined with a hybrid architecture based on principal component analysis (PCA) and a multilayer perceptron neural network. This architecture enables straightforward incorporation of multiple musical feature vectors, based on properties such as timbral texture, pitch, and rhythm structure, into a single low-dimensioned vector that is more effective for classification than the larger individual feature vectors. The use of supervised training enables incorporation of human musical perception that further enhances the classification process. We compare …