Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (92)
- Software Engineering (48)
- Information Security (38)
- Engineering (32)
- Numerical Analysis and Scientific Computing (29)
-
- Business (28)
- Social and Behavioral Sciences (24)
- Artificial Intelligence and Robotics (22)
- Communication (20)
- Operations Research, Systems Engineering and Industrial Engineering (18)
- Theory and Algorithms (14)
- Computer Engineering (13)
- Graphics and Human Computer Interfaces (13)
- Social Media (13)
- Management Information Systems (8)
- Programming Languages and Compilers (8)
- Data Storage Systems (7)
- Technology and Innovation (7)
- Communication Technology and New Media (5)
- E-Commerce (4)
- Computer and Systems Architecture (3)
- Applied Mathematics (2)
- Asian Studies (2)
- Bioinformatics (2)
- Digital Communications and Networking (2)
- Education (2)
- Finance and Financial Management (2)
- Higher Education (2)
- Keyword
-
- RFID (4)
- Social images (4)
- Uncertainty (4)
- Distance metric learning (3)
- Linear Temporal Logic (3)
-
- Machine learning (3)
- Model Check (3)
- Operational Semantic (3)
- Social media (3)
- Algorithm (2)
- Algorithms (2)
- Authenticated Key Exchange (2)
- Auto face annotation (2)
- Certificateless cryptography (2)
- Chameleon All-But-One Trapdoor Functions (2)
- Classification (2)
- Conformal parameterization (2)
- Content-based image retrieval (2)
- Debugging (2)
- Design (2)
- End-user programming (2)
- Experimentation (2)
- Fault detection (2)
- Identity-based cryptography (2)
- Information retrieval (2)
- Innovation (2)
- Label Transition System (2)
- Learning to rank (2)
- Lossy Trapdoor Functions (2)
- Management (2)
Articles 31 - 60 of 217
Full-Text Articles in Physical Sciences and Mathematics
A Model Checking Framework For Hierarchical Systems., Truong Khanh Nguyen, Jun Sun, Yang Liu, Jin Song Dong
A Model Checking Framework For Hierarchical Systems., Truong Khanh Nguyen, Jun Sun, Yang Liu, Jin Song Dong
Research Collection School Of Computing and Information Systems
BDD-based symbolic model checking is capable of verifying systems with a large number of states. In this work, we report an extensible framework to facilitate symbolic encoding and checking of hierarchical systems. Firstly, a novel library of symbolic encoding functions for compositional operators (e.g., parallel composition, sequential composition, choice operator, etc.) are developed so that users can apply symbolic model checking techniques to hierarchical systems with little knowledge of symbolic encoding techniques (like BDD or CUDD). Secondly, as the library is language-independent, we build an extensible framework with various symbolic model checking algorithms so that the library can be easily …
Search-Based Fault Localization, Shaowei Wang, David Lo, Lingxiao Jiang, - Lucia, Hoong Chuin Lau
Search-Based Fault Localization, Shaowei Wang, David Lo, Lingxiao Jiang, - Lucia, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Many spectrum-based fault localization measures have been proposed in the literature. However, no single fault localization measure completely outperforms others: a measure which is more accurate in localizing some bugs in some programs is less accurate in localizing other bugs in other programs. This paper proposes to compose existing spectrum-based fault localization measures into an improved measure. We model the composition of various measures as an optimization problem and present a search-based approach to explore the space of many possible compositions and output a heuristically near optimal composite measure. We employ two search-based strategies including genetic algorithm and simulated annealing …
A Pomdp Model For Guiding Taxi Cruising In A Congested Urban City, Lucas Agussurja, Hoong Chuin Lau
A Pomdp Model For Guiding Taxi Cruising In A Congested Urban City, Lucas Agussurja, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
We consider a partially observable Markov decision process (POMDP) model for improving a taxi agent cruising decision in a congested urban city. Using real-world data provided by a large taxi company in Singapore as a guide, we derive the state transition function of the POMDP. Specifically, we model the cruising behavior of the drivers as continuous-time Markov chains. We then apply dynamic programming algorithm for finding the optimal policy of the driver agent. Using a simulation, we show that this policy is significantly better than a greedy policy in congested road network.
Coping With Distance: An Empirical Study Of Communication On The Jazz Platform, Renuka Sindhgatta, Bikram Sengupta, Subhajit Datta
Coping With Distance: An Empirical Study Of Communication On The Jazz Platform, Renuka Sindhgatta, Bikram Sengupta, Subhajit Datta
Research Collection School Of Computing and Information Systems
Global software development - which is characterized by teams separated by physical distance and/or time-zone differences - has traditionally posed significant communication challenges. Often these have caused delays in completing tasks, or created misalignment across sites leading to re-work. In recent years, however, a new breed of development environments with rich collaboration features have emerged to facilitate cross-site work in distributed projects. In this paper we revisit the question "does distance matter?" in the context of IBM Jazz Platform -- a state-of-the-art collaborative development environment. We study the ecosystem of a large distributed team of around 300 members across 35 …
Learning Human Emotion Patterns For Modeling Virtual Humans, Shu Feng, Ah-Hwee Tan
Learning Human Emotion Patterns For Modeling Virtual Humans, Shu Feng, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Emotion modeling is a crucial part in modeling virtual humans. Although various emotion models have been proposed, most of them focus on designing specific appraisal rules. As there is no unified framework for emotional appraisal, the appraisal variables have to be defined beforehand and evaluated in a subjective way. In this paper, we propose an emotion model based on machine learning methods by taking the following position: an emotion model should mirror actual human emotion in the real world and connect tightly with human inner states, such as drives, motivations and personalities. Specifically, a self-organizing neural model called Emotional Appraisal …
Applying Time-Bound Hierarchical Key Assignment In Wireless Sensor Networks, Wentao Zhu, Robert H. Deng, Jianying Zhou, Feng Bao
Applying Time-Bound Hierarchical Key Assignment In Wireless Sensor Networks, Wentao Zhu, Robert H. Deng, Jianying Zhou, Feng Bao
Research Collection School Of Computing and Information Systems
Access privileges in distributed systems can be effectively organized as a partial-order hierarchy that consists of distinct security classes, and are often designated with certain temporal restrictions. The time-bound hierarchical key assignment problem is to assign distinct cryptographic keys to distinct security classes according to their privileges so that users from a higher class can use their class key to derive the keys of lower classes, and these keys are time-variant with respect to sequentially allocated temporal units called time slots. In this paper, we explore applications of time-bound hierarchical key assignment in a wireless sensor network environment where there …
Towards Trajectory-Based Experience Sharing In A City, Byoungjip Kim, Youngki Lee, Sangjeong Lee, Yunseok Rhee, Junehwa Song
Towards Trajectory-Based Experience Sharing In A City, Byoungjip Kim, Youngki Lee, Sangjeong Lee, Yunseok Rhee, Junehwa Song
Research Collection School Of Computing and Information Systems
As location-aware mobile devices such as smartphones have now become prevalent, people are able to easily record their trajectories in daily lives. Such personal trajectories are a very promising means to share their daily life experiences, since important contextual information such as significant locations and activities can be extracted from the raw trajectories. In this paper, we propose MetroScope, a trajectory-based real-time and on-the-go experience sharing system in a metropolitan city. MetroScope allows people to share their daily life experiences through trajectories, and enables them to refer to other people's diverse and interesting experiences in a city. Eventually, MetroScope aims …
Profit-Maximizing Firm Investments In Customer Information Security, Yong Yick Lee, Robert J. Kauffman, Ryan Sougstad
Profit-Maximizing Firm Investments In Customer Information Security, Yong Yick Lee, Robert J. Kauffman, Ryan Sougstad
Research Collection School Of Computing and Information Systems
When a customer interacts with a firm, extensive personal information often is gathered without the individual's knowledge. Significant risks are associated with handling this kind of information. Providing protection may reduce the risk of the loss and misuse of private information, but it imposes some costs on both the firm and its customers. Nevertheless, customer information security breaches still may occur. They have several distinguishing characteristics: (1) typically it is hard to quantify monetary damages related to them; (2) customer information security breaches may be caused by intentional attacks, as well as through unintentional organizational and customer behaviors; and (3) …
Enabling Gpu Acceleration With Messaging Middleware, Randall E. Duran, Li Zhang, Tom Hayhurst
Enabling Gpu Acceleration With Messaging Middleware, Randall E. Duran, Li Zhang, Tom Hayhurst
Research Collection School Of Computing and Information Systems
Graphics processing units (GPUs) offer great potential for accelerating processing for a wide range of scientific and business applications. However, complexities associated with using GPU technology have limited its use in applications. This paper reviews earlier approaches improving GPU accessibility, and explores how integration with middleware messaging technologies can further improve the accessibility and usability of GPU-enabled platforms. The results of a proof-of-concept integration between an open-source messaging middleware platform and a general-purpose GPU platform using the CUDA framework are presented. Additional applications of this technique are identified and discussed as potential areas for further research.
Managing Successive Generation Product Diffusion In The Presence Of Strategic Consumers, Zhiling Guo
Managing Successive Generation Product Diffusion In The Presence Of Strategic Consumers, Zhiling Guo
Research Collection School Of Computing and Information Systems
Frequent new product release and technological uncertainty about the release time pose significant challenges for firms to manage successive generation of products. On the one hand, strategic consumers may delay their purchase decision and substitute the earlier generation with the newer generation product. On the other hand, the firm must fully anticipate consumer reactions and take into account the effect of their strategic behavior on product pricing and successive generation product diffusion. This paper proposes a prediction market to forecast new product release. We show that the market information aggregation mechanism can improve forecast accuracy of new product launch. Better …
Pat 3: An Extensible Architecture For Building Multi-Domain Model Checkers, Yang Liu, Jun Sun, Jin Song Dong
Pat 3: An Extensible Architecture For Building Multi-Domain Model Checkers, Yang Liu, Jun Sun, Jin Song Dong
Research Collection School Of Computing and Information Systems
Model checking is emerging as an effective software verification method. Although it is desirable to have a dedicated model checker for each application domain, implementing one is rather challenging. In this work, we develop an extensible and integrated architecture in PAT3 (PAT version 3.*) to support the development of model checkers for wide range application domains. PAT3 adopts a layered design with an intermediate representation layer (IRL), which separates modeling languages from model checking algorithms so that the algorithms can be shared by different languages. IRL contains several common semantic models to support wide application domains, and builds both explicit …
Exploring Tweets Normalization And Query Time Sensitivity For Twitter Search, Zhongyu Wei, Wei Gao, Lanjun Zhou, Binyang Li, Kam-Fai Wong
Exploring Tweets Normalization And Query Time Sensitivity For Twitter Search, Zhongyu Wei, Wei Gao, Lanjun Zhou, Binyang Li, Kam-Fai Wong
Research Collection School Of Computing and Information Systems
This paper presents our work for the Realtime Adhoc Task of TREC 2011 Microblog Track. Microblog texts like tweets are generally characterized by the inclusion of a large proportion of irregular expressions, such as ill-formed words, which can lead to significant mismatch between query terms and tweets. In addition, Twitter queries are distinguished from Web queries with many unique characteristics, one of which reflects the clearly distinct temporal aspects of Twitter search behavior. In this study, we deal with the first problem by normalizing tweet texts and the second by capturing the temporal characteristics of topic. We divided topics into …
Finding Relevant Answers In Software Forums, Swapna Gottopati, David Lo, Jing Jiang
Finding Relevant Answers In Software Forums, Swapna Gottopati, David Lo, Jing Jiang
Research Collection School Of Computing and Information Systems
Online software forums provide a huge amount of valuable content. Developers and users often ask questions and receive answers from such forums. The availability of a vast amount of thread discussions in forums provides ample opportunities for knowledge acquisition and summarization. For a given search query, current search engines use traditional information retrieval approach to extract webpages containing relevant keywords. However, in software forums, often there are many threads containing similar keywords where each thread could contain a lot of posts as many as 1,000 or more. Manually finding relevant answers from these long threads is a painstaking task to …
Unsupervised Multiple Kernel Learning, Jinfeng Zhuang, Jialei Wang, Steven C. H. Hoi, Xiangyang Lan
Unsupervised Multiple Kernel Learning, Jinfeng Zhuang, Jialei Wang, Steven C. H. Hoi, Xiangyang Lan
Research Collection School Of Computing and Information Systems
Traditional multiple kernel learning (MKL) algorithms are essentially supervised learning in the sense that the kernel learning task requires the class labels of training data. However, class labels may not always be available prior to the kernel learning task in some real world scenarios, e.g., an early preprocessing step of a classification task or an unsupervised learning task such as dimension reduction. In this paper, we investigate a problem of Unsupervised Multiple Kernel Learning (UMKL), which does not require class labels of training data as needed in a conventional multiple kernel learning task. Since a kernel essentially defines pairwise similarity …
Are There Contagion Effects In Information Technology And Business Process Outsourcing?, Arti Mann, Robert J. Kauffman, Kunsoo Han, Barrie R. Nault
Are There Contagion Effects In Information Technology And Business Process Outsourcing?, Arti Mann, Robert J. Kauffman, Kunsoo Han, Barrie R. Nault
Research Collection School Of Computing and Information Systems
We model the diffusion of IT outsourcing using announcements about IT outsourcing deals. We estimate a lognormal diffusion curve to test whether IT outsourcing follows a pure diffusion process or there are contagion effects involved. The methodology permits us to study the consequences of outsourcing events, especially mega-deals with IT contract amounts that exceed US$1 billion. Mega-deals act, we theorize, as precipitating events that create a strong basis for contagion effects and are likely to affect decision-making by other firms in an industry. Then, we evaluate the role of different communication channels in the diffusion process of IT outsourcing by …
A Brain-Inspired Model Of Hierarchical Planner, Budhitama Subagdja, Ah-Hwee Tan
A Brain-Inspired Model Of Hierarchical Planner, Budhitama Subagdja, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Hierarchical planning is an approach of planning by composing and executing hierarchically arranged plans to solve some problems. Most symbolic-based hierarchical planners have been devised to allow the knowledge to be described expressively. However, a great challenge is to automatically seek and acquire new plans on the fly. This paper presents a novel neural-based model of hierarchical planning that can seek and acquired new plans on-line if the necessary knowledge are lacking. Inspired by findings in neuropsychology, plans can be inherently learnt, retrieved, and manipulated simultaneously rather than discretely processed like in most symbolic approaches. Using a multi-channel adaptive resonance …
Software Process Evaluation: A Machine Learning Approach, Ning Chen, Steven C. H. Hoi, Xiaokui Xiao
Software Process Evaluation: A Machine Learning Approach, Ning Chen, Steven C. H. Hoi, Xiaokui Xiao
Research Collection School Of Computing and Information Systems
Software process evaluation is essential to improve software development and the quality of software products in an organization. Conventional approaches based on manual qualitative evaluations (e.g., artifacts inspection) are deficient in the sense that (i) they are time-consuming, (ii) they suffer from the authority constraints, and (iii) they are often subjective. To overcome these limitations, this paper presents a novel semi-automated approach to software process evaluation using machine learning techniques. In particular, we formulate the problem as a sequence classification task, which is solved by applying machine learning algorithms. Based on the framework, we define a new quantitative indicator to …
Consistent Community Identification In Complex Networks, Haewoon Kwak, Young-Ho Eom, Yoonchan Choi, Hawoong Jeong
Consistent Community Identification In Complex Networks, Haewoon Kwak, Young-Ho Eom, Yoonchan Choi, Hawoong Jeong
Research Collection School Of Computing and Information Systems
We have found that known community identification algorithms produce inconsistent communities when the node ordering changes at input. We use the pairwise membership probability and consistency to quantify the level of consistency across multiple runs of an algorithm. Based on these two metrics, we address the consistency problem without compromising the modularity. The key insight of the algorithm is to use pairwise membership probabilities as link weights. It offers a new tool in the study of community structures and their evolutions.
Beyond Search: Event-Driven Summarization For Web Videos, Richard Hong, Jinhui Tang, Hung-Khoon Tan, Chong-Wah Ngo, Shuicheng Yan, Tat-Seng Chua
Beyond Search: Event-Driven Summarization For Web Videos, Richard Hong, Jinhui Tang, Hung-Khoon Tan, Chong-Wah Ngo, Shuicheng Yan, Tat-Seng Chua
Research Collection School Of Computing and Information Systems
The explosive growth of Web videos brings out the challenge of how to efficiently browse hundreds or even thousands of videos at a glance. Given an event-driven query, social media Web sites usually return a large number of videos that are diverse and noisy in a ranking list. Exploring such results will be time-consuming and thus degrades user experience. This article presents a novel scheme that is able to summarize the content of video search results by mining and threading "key" shots, such that users can get an overview of main content of these videos at a glance. The proposed …
Price Points And Price Rigidity, Daniel Levy, Dongwon Lee, Haipeng (Allen) Lee, Robert J. Kauffman, Mark Bergen
Price Points And Price Rigidity, Daniel Levy, Dongwon Lee, Haipeng (Allen) Lee, Robert J. Kauffman, Mark Bergen
Research Collection School Of Computing and Information Systems
We study the link between price points and price rigidity using two data sets: weekly scanner data and Internet data. We find that ‘‘9’’ is the most frequent ending for the penny, dime, dollar, and ten-dollar digits; the most common price changes are those that keep the price endings at ‘‘9’’; 9-ending prices are less likely to change than non-9-ending prices; and the average size of price change is larger for 9-ending than non-9- ending prices. We conclude that 9-ending contributes to price rigidity from penny to dollar digits and across a wide range of product categories, retail formats, and …
Concern Localization Using Information Retrieval: An Empirical Study On Linux Kernel, Shaowei Wang, David Lo, Zhenchang Xing, Lingxiao Jiang
Concern Localization Using Information Retrieval: An Empirical Study On Linux Kernel, Shaowei Wang, David Lo, Zhenchang Xing, Lingxiao Jiang
Research Collection School Of Computing and Information Systems
Many software maintenance activities need to find code units (functions, files, etc.) that implement a certain concern (features, bugs, etc.). To facilitate such activities, many approaches have been proposed to automatically link code units with concerns described in natural languages, which are termed as concern localization and often employ Information Retrieval (IR) techniques. There has not been a study that evaluates and compares the effectiveness of latest IR techniques on a large dataset. This study fills this gap by investigating ten IR techniques, some of which are new and have not been used for concern localization, on a Linux kernel …
Direction-Based Surrounder Queries For Mobile Recommendations, Xi Guo, Baihua Zheng, Yoshiharu Ishikawa, Yunjun Gao
Direction-Based Surrounder Queries For Mobile Recommendations, Xi Guo, Baihua Zheng, Yoshiharu Ishikawa, Yunjun Gao
Research Collection School Of Computing and Information Systems
Location-based recommendation services recommend objects to the user based on the user’s preferences. In general, the nearest objects are good choices considering their spatial proximity to the user. However, not only the distance of an object to the user but also their directional relationship are important. Motivated by these, we propose a new spatial query, namely a direction-based surrounder (DBS) query, which retrieves the nearest objects around the user from different directions. We define the DBS query not only in a two-dimensional Euclidean space E">EE but also in a road network R">RR . In the Euclidean space E" …
Adaptive Collision Resolution For Efficient Rfid Tag Identification, Yung-Chun Chen, Kuo-Hui Yeh, Nai-Wei Lo, Yingjiu Li, Enrico Winata
Adaptive Collision Resolution For Efficient Rfid Tag Identification, Yung-Chun Chen, Kuo-Hui Yeh, Nai-Wei Lo, Yingjiu Li, Enrico Winata
Research Collection School Of Computing and Information Systems
In large-scale RFID systems, all of the communications between readers and tags are via a shared wireless channel. When a reader intends to collect all IDs from numerous existing tags, a tag identification process is invoked by the reader to collect the tags' IDs. This phenomenon results in tag-to-reader signal collisions which may suppress the system performance greatly. To solve this problem, we design an efficient tag identification protocol in which a significant gain is obtained in terms of both identification delay and communication overhead. A k-ary tree-based abstract is adopted in our proposed tag identification protocol as underlying architecture …
Cooperative Reinforcement Learning In Topology-Based Multi-Agent Systems, Dan Xiao, Ah-Hwee Tan
Cooperative Reinforcement Learning In Topology-Based Multi-Agent Systems, Dan Xiao, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Topology-based multi-agent systems (TMAS), wherein agents interact with one another according to their spatial relationship in a network, are well suited for problems with topological constraints. In a TMAS system, however, each agent may have a different state space, which can be rather large. Consequently, traditional approaches to multi-agent cooperative learning may not be able to scale up with the complexity of the network topology. In this paper, we propose a cooperative learning strategy, under which autonomous agents are assembled in a binary tree formation (BTF). By constraining the interaction between agents, we effectively unify the state space of individual …
Efficient Evaluation Of Continuous Text Seach Queries, Kyriakos Mouratidis, Hwee Hwa Pang
Efficient Evaluation Of Continuous Text Seach Queries, Kyriakos Mouratidis, Hwee Hwa Pang
Research Collection School Of Computing and Information Systems
Consider a text filtering server that monitors a stream of incoming documents for a set of users, who register their interests in the form of continuous text search queries. The task of the server is to constantly maintain for each query a ranked result list, comprising the recent documents (drawn from a sliding window) with the highest similarity to the query. Such a system underlies many text monitoring applications that need to cope with heavy document traffic, such as news and email monitoring.In this paper, we propose the first solution for processing continuous text queries efficiently. Our objective is to …
Allocating Resources In Multiagent Flowshops With Adaptive Auctions, Hoong Chuin Lau, Zhengyi Zhao, Sam Shuzhi Ge, Thong Heng Lee
Allocating Resources In Multiagent Flowshops With Adaptive Auctions, Hoong Chuin Lau, Zhengyi Zhao, Sam Shuzhi Ge, Thong Heng Lee
Research Collection School Of Computing and Information Systems
In this paper, we consider the problem of allocating machine resources among multiple agents, each of which is responsible to solve a flowshop scheduling problem. We present an iterated combinatorial auction mechanism in which bid generation is performed within each agent, while a price adjustment procedure is performed by a centralized auctioneer. While this approach is fairly well-studied in the literature, our primary innovation is in an adaptive price adjustment procedure, utilizing variable step-size inspired by adaptive PID-control theory coupled with utility pricing inspired by classical microeconomics. We compare with the conventional price adjustment scheme proposed in Fisher (1985), and …
Recommending People In Developers' Collaboration Network, Didi Surian, Nian Liu, David Lo, Hanghang Tong, Ee Peng Lim, Christos Faloutsos
Recommending People In Developers' Collaboration Network, Didi Surian, Nian Liu, David Lo, Hanghang Tong, Ee Peng Lim, Christos Faloutsos
Research Collection School Of Computing and Information Systems
Many software developments involve collaborations of developers across the globe. This is true for both open-source and closed-source development efforts. Developers collaborate on different projects of various types. As with any other teamwork endeavors, finding compatibility among members in a development team is helpful towards the realization of the team’s goal. Compatible members tend to share similar programming style and naming strategy, communicate well with one another, etc. However, finding the right person to work with is not an easy task. In this work, we extract information available from Sourceforge.Net, the largest database of open source software, and build developer …
General Construction Of Chameleon All-But-One Trapdoor Functions, Shengli Liu, Junzuo Lai, Robert H. Deng
General Construction Of Chameleon All-But-One Trapdoor Functions, Shengli Liu, Junzuo Lai, Robert H. Deng
Research Collection School Of Computing and Information Systems
Lossy trapdoor functions enable black-box construction of public key encryption (PKE) schemes secure against chosen-ciphertext attack [18]. Recently, a more efficient black-box construction of public key encryption was given in [12] with the help of chameleon all-but-one trapdoor functions (ABO-TDFs).In this paper, we propose a black-box construction for transforming any ABO-TDFs into chameleon ABO-TDFs with the help of chameleon hash functions. Instantiating the proposed general black-box construction of chameleon ABO-TDFs, we can obtain the first chameleon ABO-TDFs based on the Decisional Diffie-Hellman (DDH) assumption.
Using Social Annotations For Trend Discovery In Scientific Publications, Meiqun Hu, Ee Peng Lim, Jing Jiang
Using Social Annotations For Trend Discovery In Scientific Publications, Meiqun Hu, Ee Peng Lim, Jing Jiang
Research Collection School Of Computing and Information Systems
Social tags and citing documents are two forms of social annotations to scientific publications. These social annotations provide useful contextual and temporal information for the annotated work, which encapsulates the attention and interest of the annotators. In this work, we explore the use of social annotations for discovering trends in scientific publications. We propose a trend discovery process that employs trend estimation and trend selection and ranking for analyzing the emerging trends shown in the social annotation profiles. The proposed sigmoid trend estimator allows us to characterize and compare how much, when and how fast the trends emerge. To perform …
Location-Dependent Spatial Query Containment, Ken C. K. Lee, Brandon Unger, Baihua Zheng, Wang-Chien Lee
Location-Dependent Spatial Query Containment, Ken C. K. Lee, Brandon Unger, Baihua Zheng, Wang-Chien Lee
Research Collection School Of Computing and Information Systems
Nowadays, location-related information is highly accessible to mobile users via issuing Location-Dependent Spatial Queries (LDSQs) with respect to their locations wirelessly to Location-Based Service (LBS) servers. Due to the limited mobile device battery energy, scarce wireless bandwidth, and heavy LBS server workload, the number of LDSQs submitted over wireless channels to LBS servers for evaluation should be minimized as appropriate. In this paper, we exploit query containment techniques for LDSQs (called LDSQ containment) to enable mobile clients to determine whether the result of a new LDSQ Q′ is completely covered by that of another LDSQ Q previously answered by a …