Generating Synonyms Based On Query Log Data,
2010
Singapore Management University
Generating Synonyms Based On Query Log Data, Stelios Paparizos, Tao Cheng, Hady W. Lauw
Research Collection School Of Computing and Information Systems
An approach is described for generating synonyms to supplement at least one information item, such as, in one case, a set of related items. The approach can involve an expansion phase, a clean-up phase, and a reduction phase. In the expansion phase, the approach identifies, for each related item, a set of initial synonym candidates. In the clean-up phase, the approach removes noise from the set of initial synonym candidates (if such noise exists), to provide a set of filtered synonym candidate items. In the reduction phase, the approach ranks and applies a threshold (or thresholds) to the set of …
Algorithms For Constrained K-Nearest Neighbor Queries Over Moving Object Trajectories,
2010
Singapore Management University
Algorithms For Constrained K-Nearest Neighbor Queries Over Moving Object Trajectories, Yunjun Gao, Baihua Zheng, Gencai Chen, Qing Li, Chun Chen
Research Collection School Of Computing and Information Systems
An important query for spatio-temporal databases is to find nearest trajectories of moving objects. Existing work on this topic focuses on the closest trajectories in the whole data space. In this paper, we introduce and solve constrained k-nearest neighbor (CkNN) queries and historical continuous CkNN (HCCkNN) queries on R-tree-like structures storing historical information about moving object trajectories. Given a trajectory set D, a query object (point or trajectory) q, a temporal extent T, and a constrained region CR, (i) a CkNN query over trajectories retrieves from D within T, the k (≥ 1) trajectories that lie closest to q and …
Tredd—A Database For Tandem Repeats Over The Edit Distance,
2010
CUNY Brooklyn College
Tredd—A Database For Tandem Repeats Over The Edit Distance, Dina Sokol, Firat Atagun
Publications and Research
A ‘tandem repeat’ in DNA is a sequence of two or more contiguous, approximate copies of a pattern of nucleotides. Tandem repeats are common in the genomes of both eukaryotic and prokaryotic organisms. They are significant markers for human identity testing, disease diagnosis, sequence homology and population studies. In this article, we describe a new database, TRedD, which contains the tandem repeats found in the human genome. The database is publicly available online, and the software for locating the repeats is also freely available. The definition of tandem repeats used by TRedD is a new and innovative definition based upon …
Multi-Objective Constraint Satisfaction For Mobile Robot Area Defense,
2010
Air Force Institute of Technology
Multi-Objective Constraint Satisfaction For Mobile Robot Area Defense, Kenneth W. Mayo
Theses and Dissertations
In developing multi-robot cooperative systems, there are often competing objectives that need to be met. For example in automating area defense systems, multiple robots must work together to explore the entire area, and maintain consistent communications to alert the other agents and ensure trust in the system. This research presents an algorithm that tasks robots to meet the two specific goals of exploration and communication maintenance in an uncoordinated environment reducing the need for a user to pre-balance the objectives. This multi-objective problem is defined as a constraint satisfaction problem solved using the Non-dominated Sorting Genetic Algorithm II (NSGA-II). Both …
Local Coordination Under Bounded Rationality: Coase Meets Simon, Finds Hayek,
2010
Singapore Management University
Local Coordination Under Bounded Rationality: Coase Meets Simon, Finds Hayek, C. Jason Woodard
Research Collection School Of Computing and Information Systems
This paper explores strategic behavior in a network of firms using an agent-based model. The model exhibits a tension between economic efficiency and the stability of the network in the face of incentives to change its configuration. This tension is to be expected because the conditions of the Coase theorem are violated: the boundedly rational firms in the model lack the ability to discover efficient network configurations or achieve them through collective action. In computational experiments, as predicted by theory, firms frequently became locked into inefficient outcomes or endless cycles of mutual frustration. However, simple institutional innovations such as property …
Bay Audio Repair Website & Data Management Application,
2010
California Polytechnic State University - San Luis Obispo
Bay Audio Repair Website & Data Management Application, Michael Shelley
Computer Science and Software Engineering
The goal of this senior project was to build a website and software application to receive and manage audio equipment repair requests for a small startup company called Bay Audio Repair (BAR). Furthermore, it allowed me to gain experience in web development and software engineering practices, specifically requirements gathering, design and implementation. The website provides an online interface for BAR’s customers to request repairs and the application allows BAR employees to update the progress of a repair. Several technologies were used in the system’s construction: HTML, XML, PHP, and C#.
Information-Quality Aware Routing In Event-Driven Sensor Networks,
2010
Singapore Management University
Information-Quality Aware Routing In Event-Driven Sensor Networks, Hwee Xian Tan, Mun-Choon Chan, Wendong Xiao, Peng-Yong Kong, Chen-Khong Tham
Research Collection School Of Computing and Information Systems
Upon the occurrence of a phenomenon of interest in a wireless sensor network, multiple sensors may be activated, leading to data implosion and redundancy. Data aggregation and/or fusion techniques exploit spatio-temporal correlation among sensory data to reduce traffic load and mitigate congestion. However, this is often at the expense of loss in Information Quality (IQ) of data that is collected at the fusion center. In this work, we address the problem of finding the least-cost routing tree that satisfies a given IQ constraint. We note that the optimal least-cost routing solution is a variation of the classical NP-hard Steiner tree …
Homophily In The Digital World: A Livejournal Case Study,
2010
Singapore Management University
Homophily In The Digital World: A Livejournal Case Study, Hady W. Lauw, John C. Shafer, Rakesh Agrawal, Alexandros Ntoulas
Research Collection School Of Computing and Information Systems
Are two users more likely to be friends if they share common interests? Are two users more likely to share common interests if they're friends? The authors study the phenomenon of homophily in the digital world by answering these central questions. Unlike the physical world, the digital world doesn't impose any geographic or organizational constraints on friendships. So, although online friends might share common interests, a priori there's no reason to believe that two users with common interests are more likely to be friends. Using data from LiveJournal, the authors show that the answer to both questions is yes.
Creating An Immersive Game World With Evolutionary Fuzzy Cognitive Maps,
2010
Singapore Management University
Creating An Immersive Game World With Evolutionary Fuzzy Cognitive Maps, Yundong Cai, Ah-Hwee Tan, Zhiqi Shen, Boyang Li
Research Collection School Of Computing and Information Systems
An increasing number of serious games have been developed to enhance the user experiences in education and training. In order to bridge the gap of game experiences in the virtual environment and in the real life, it is crucial to generate believable characters and contexts in real-time. However, the variables to be simulated for a large-scale serious game are numerous. These variables are involved in complex causal relationships and their values change over time. In view that world modeling has not been well addressed with conventional models, this paper uses a computational model Evolutionary Fuzzy Cognitive Map (EFCM) to model …
A Self-Organizing Neural Architecture Integrating Desire, Intention And Reinforcement Learning,
2010
Singapore Management University
A Self-Organizing Neural Architecture Integrating Desire, Intention And Reinforcement Learning, Ah-Hwee Tan, Yu-Hong Feng, Yew-Soon Ong
Research Collection School Of Computing and Information Systems
This paper presents a self-organizing neural architecture that integrates the features of belief, desire, and intention (BDI) systems with reinforcement learning. Based on fusion Adaptive Resonance Theory (fusion ART), the proposed architecture provides a unified treatment for both intentional and reactive cognitive functionalities. Operating with a sense-act-learn paradigm, the low level reactive module is a fusion ART network that learns action and value policies across the sensory, motor, and feedback channels. During performance, the actions executed by the reactive module are tracked by a high level intention module (also a fusion ART network) that learns to associate sequences of actions …
Symphony: A Platform For Search-Driven Applications,
2010
Microsoft Research
Symphony: A Platform For Search-Driven Applications, John C. Shafer, Rakesh Agrawal, Hady W. Lauw
Research Collection School Of Computing and Information Systems
We present the design of Symphony, a platform that enables non-developers to build and deploy a new class of search-driven applications that combine their data and domain expertise with content from search engines and other web services. The Symphony prototype has been built on top of Microsoft's Bing infrastructure. While Symphony naturally makes use of the customization capabilities exposed by Bing, its distinguishing feature is the capability it provides to the application creator to combine their proprietary data and domain expertise with content obtained from Bing. They can also integrate specialized data obtained from web services to enhance the richness …
Preference Queries In Large Multi-Cost Transportation Networks,
2010
Singapore Management University
Preference Queries In Large Multi-Cost Transportation Networks, Kyriakos Mouratidis, Yimin Lin, Man Lung Yiu
Research Collection School Of Computing and Information Systems
Research on spatial network databases has so far considered that there is a single cost value associated with each road segment of the network. In most real-world situations, however, there may exist multiple cost types involved in transportation decision making. For example, the different costs of a road segment could be its Euclidean length, the driving time, the walking time, possible toll fee, etc. The relative significance of these cost types may vary from user to user. In this paper we consider such multi-cost transportation networks (MCN), where each edge (road segment) is associated with multiple cost values. We formulate …
Efficient Verification Of Shortest Path Search Via Authenticated Hints,
2010
Hong Kong Polytechnic University
Efficient Verification Of Shortest Path Search Via Authenticated Hints, Man Lung Yiu, Yimin Lin, Kyriakos Mouratidis
Research Collection School Of Computing and Information Systems
Shortest path search in transportation networks is unarguably one of the most important online search services nowadays (e.g., Google Maps, MapQuest, etc), with applications spanning logistics, spatial optimization, or everyday driving decisions. Often times, the owner of the road network data (e.g., a transport authority) provides its database to third-party query services, which are responsible for answering shortest path queries posed by their clients. The issue arising here is that a query service might be returning sub-optimal paths either purposely (in order to serve its own purposes like computational savings or commercial reasons) or because it has been compromised by …
Top-K Aggregation Queries Over Large Networks,
2010
University of California at Santa Barbara, USA
Top-K Aggregation Queries Over Large Networks, Xifeng Yan, Bin He, Feida Zhu, Jiawei Han
Research Collection School Of Computing and Information Systems
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional associations in biological pathways. In these domains, there is a need to perform aggregation operations on large-scale networks. Unfortunately the existing implementation of aggregation operations on relational databases does not guarantee superior performance in network space, especially when it involves edge traversals and joins of gigantic tables. In this paper, we investigate the neighborhood aggregation queries: Find nodes that have top-k highest aggregate values over their h-hop neighbors. While these basic queries are common in …
Differentiating Knowledge Processes In Organisational Learning: A Case Of “Two Solitudes”,
2010
Singapore Management University
Differentiating Knowledge Processes In Organisational Learning: A Case Of “Two Solitudes”, Siu Loon Hoe, Steven Mcshane
Research Collection School Of Computing and Information Systems
The fields of organizational behavior (OB)/strategy and marketing have taken different paths over the past two decades to understanding organizational learning. OB/strategy has been pre-occupied with theory development and case study illustrations, whereas marketing has taken a highly quantitative path. Although relying on essentially the same foundation theory, the two disciplines have had minimal crossfertilization. Furthermore, both fields tend to blur or usually ignore the distinction between structural and informal knowledge processes. The purpose of the paper is to highlight the distinction between informal and structural knowledge acquisition and dissemination processes and propose new definitions to differentiate them. Future research …
Fuzzy Matching Of Web Queries To Structured Data,
2010
University of Illinois at Urbana-Champaign
Fuzzy Matching Of Web Queries To Structured Data, Tao Cheng, Hady W. Lauw, Stelios Paparizos
Research Collection School Of Computing and Information Systems
Recognizing the alternative ways people use to reference an entity, is important for many Web applications that query structured data. In such applications, there is often a mismatch between how content creators describe entities and how different users try to retrieve them. In this paper, we consider the problem of determining whether a candidate query approximately matches with an entity. We propose an off-line, data-driven, bottom-up approach that mines query logs for instances where Web content creators and Web users apply a variety of strings to refer to the same Web pages. This way, given a set of strings that …
K-Anonymity In The Presence Of External Databases,
2010
Singapore Management University
K-Anonymity In The Presence Of External Databases, Dimitris Sacharidis, Kyriakos Mouratidis, Dimitris Papadias
Research Collection School Of Computing and Information Systems
The concept of k-anonymity has received considerable attention due to the need of several organizations to release microdata without revealing the identity of individuals. Although all previous k-anonymity techniques assume the existence of a public database (PD) that can be used to breach privacy, none utilizes PD during the anonymization process. Specifically, existing generalization algorithms create anonymous tables using only the microdata table (MT) to be published, independently of the external knowledge available. This omission leads to high information loss. Motivated by this observation we first introduce the concept of k-join-anonymity (KJA), which permits more effective generalization to reduce the …
Survey Of Environmental Data Portals: Features, Characteristics, And Reliability Issues,
2010
University of Nevada, Las Vegas
Survey Of Environmental Data Portals: Features, Characteristics, And Reliability Issues, Shahram Latifi, David Walker
2010 Annual Nevada NSF EPSCoR Climate Change Conference
24 PowerPoint slides Session 2: Infrastructure Convener: Sergiu Dascalu, UNR Abstract: -What is a Data Portal? -Presents information from diverse sources in a unified way -Enables instant, reliable and secure exchange of information over the Web -The "portal" concept is to offer a single web page that aggregates content from several systems or servers.
Twitterrank: Finding Topic-Sensitive Influential Twitterers,
2010
Singapore Management University
Twitterrank: Finding Topic-Sensitive Influential Twitterers, Jianshu Weng, Ee Peng Lim, Jing Jiang, Qi He
Research Collection School Of Computing and Information Systems
This paper focuses on the problem of identifying influential users of micro-blogging services. Twitter, one of the most notable micro-blogging services, employs a social-networking model called "following", in which each user can choose who she wants to "follow" to receive tweets from without requiring the latter to give permission first. In a dataset prepared for this study, it is observed that (1) 72.4% of the users in Twitter follow more than 80% of their followers, and (2) 80.5% of the users have 80% of users they are following follow them back. Our study reveals that the presence of "reciprocity" can …
Estimating The Quality Of Postings In The Real-Time Web,
2010
Singapore Management University
Estimating The Quality Of Postings In The Real-Time Web, Hady W. Lauw, Alexandros Ntoulas, Krishnaram Kenthapadi
Research Collection School Of Computing and Information Systems
Millions of users are posting their status updates, interesting findings, news, ideas and observations in real-time on microblogging services such as Twitter, Jaiku and Plurk. This real-time Web can be a great resource of valuable timely information. Since the real-time Web is completely open and decentralized and anyone may post information at whim, distinguishing interesting and popular postings from the mundane ones is a challenging task. In this paper we study the problem of estimating the quality (or “interestingness”) of postings in the real-time Web. We identify several important factors that are indicative of the quality of postings, and present …
