Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (4216)
- Computer Sciences (4213)
- Databases and Information Systems (1558)
- Software Engineering (1254)
- Artificial Intelligence and Robotics (747)
-
- Information Security (730)
- Graphics and Human Computer Interfaces (490)
- Numerical Analysis and Scientific Computing (454)
- Engineering (345)
- Programming Languages and Compilers (269)
- Computer Engineering (232)
- Social and Behavioral Sciences (214)
- Theory and Algorithms (212)
- Business (202)
- OS and Networks (148)
- Communication (103)
- Operations Research, Systems Engineering and Industrial Engineering (101)
- Social Media (83)
- Data Storage Systems (81)
- Medicine and Health Sciences (79)
- Education (66)
- Public Affairs, Public Policy and Public Administration (55)
- Computer and Systems Architecture (52)
- Health Information Technology (51)
- Transportation (51)
- Management Information Systems (49)
- Digital Communications and Networking (47)
- E-Commerce (44)
- Finance and Financial Management (40)
- Higher Education (30)
- Keyword
-
- Deep learning (71)
- Machine learning (59)
- Privacy (41)
- Empirical study (40)
- Deep Learning (35)
-
- Training (34)
- Security (33)
- Task analysis (32)
- Cloud computing (31)
- Data mining (31)
- Artificial intelligence (29)
- Reinforcement learning (29)
- Social media (29)
- Software engineering (29)
- Neural networks (28)
- Android (27)
- Blockchain (27)
- Feature extraction (27)
- Large Language Models (26)
- Model Check (26)
- Access control (25)
- Natural language processing (25)
- Authentication (24)
- Large language models (24)
- Privacy-preserving (24)
- Servers (24)
- Anomaly detection (23)
- Information retrieval (23)
- Visualization (23)
- Classification (22)
- Publication Year
Articles 2911 - 2940 of 4266
Full-Text Articles in Entire DC Network
Synchronicity: Pushing The Envelope Of Fine-Grained Localization With Distributed Mimo, Jie Xiong, Kyle Jamieson, Karthikeyan Sundaresan
Synchronicity: Pushing The Envelope Of Fine-Grained Localization With Distributed Mimo, Jie Xiong, Kyle Jamieson, Karthikeyan Sundaresan
Research Collection School Of Computing and Information Systems
Indoor localization of mobile devices and tags has received much attention recently, with encouraging fine-grained localization results available with enough line-of-sight coverage and enough hardware infrastructure. Synchronicity is a location system that aims to push the envelope of highly-accurate localization systems further in both dimensions, requiring less line-of-sight and less infrastructure. With Distributed MIMO network of wireless LAN access points (APs) as a starting point, we leverage the time synchronization that such a network affords to localize with time-difference-of-arrival information at the APs. We contribute novel super-resolution signal processing algorithms and reflection path elimination schemes, yielding superior results even in …
Revisiting Risk-Sensitive Mdps: New Algorithms And Results, Ping Hou, William Yeoh, Pradeep Reddy Varakantham
Revisiting Risk-Sensitive Mdps: New Algorithms And Results, Ping Hou, William Yeoh, Pradeep Reddy Varakantham
Research Collection School Of Computing and Information Systems
While Markov Decision Processes (MDPs) have been shown to be effective models for planning under uncertainty, theobjective to minimize the expected cumulative cost is inappropriate for high-stake planning problems. As such, Yu, Lin, and Yan (1998) introduced the Risk-Sensitive MDP (RSMDP) model, where the objective is to find a policy that maximizes the probability that the cumulative cost is within some user-defined cost threshold. In this paper, we revisit this problem and introduce new algorithms that are based on classical techniques, such as depth-first search and dynamic programming, and a recently introduced technique called Topological Value Iteration (TVI). We demonstrate …
Global Immutable Region Computation, Jilian Zhang, Kyriakos Mouratidis, Hwee Hwa Pang
Global Immutable Region Computation, Jilian Zhang, Kyriakos Mouratidis, Hwee Hwa Pang
Research Collection School Of Computing and Information Systems
A top-k query shortlists the k records in a dataset that best match the user's preferences. To indicate her preferences, the user typically determines a numeric weight for each data dimension (i.e., attribute). We refer to these weights collectively as the query vector. Based on this vector, each data record is implicitly mapped to a score value (via a weighted sum function). The records with the k largest scores are reported as the result. In this paper we propose an auxiliary feature to standard top-k query processing. Specifically, we compute the maximal locus within which the query vector incurs no …
Ar-Miner: Mining Informative Reviews For Developers From Mobile App Marketplace, Ning Chen, Jialiu Lin, Steven C. H. Hoi, Xiaokui Xiao, Boshen Zhang
Ar-Miner: Mining Informative Reviews For Developers From Mobile App Marketplace, Ning Chen, Jialiu Lin, Steven C. H. Hoi, Xiaokui Xiao, Boshen Zhang
Research Collection School Of Computing and Information Systems
With the popularity of smartphones and mobile devices, mobile application (a.k.a. “app”) markets have been growing exponentially in terms of number of users and downloads. App developers spend considerable effort on collecting and exploiting user feedback to improve user satisfaction, but suffer from the absence of effective user review analytics tools. To facilitate mobile app developers discover the most “informative” user reviews from a large and rapidly increasing pool of user reviews, we present “AR-Miner” — a novel computational framework for App Review Mining, which performs comprehensive analytics from raw user reviews by (i) first extracting informative user reviews by …
Cross-Language Bug Localization, Xin Xia, David Lo, Xingen Wang, Chenyi Zhang, Xinyu Wang
Cross-Language Bug Localization, Xin Xia, David Lo, Xingen Wang, Chenyi Zhang, Xinyu Wang
Research Collection School Of Computing and Information Systems
Bug localization refers to the process of identifying source code files that contain defects from textual descriptions in bug reports. Existing bug localization techniques work on the assumption that bug reports, and identifiers and comments in source code files, are written in the same language (i.e., English). However, software users from non-English speaking countries (e.g., China) often use their native languages (e.g., Chinese) to write bug reports. For this setting, existing studies on bug localization would not work as the terms that appear in the bug reports do not appear in the source code. We refer to this problem as …
Interactive Two-Sided Transparent Displays: Designing For Collaboration, Jiannan Li, Saul Greenberg, Ehud Sharlin, Joaquim Jorge
Interactive Two-Sided Transparent Displays: Designing For Collaboration, Jiannan Li, Saul Greenberg, Ehud Sharlin, Joaquim Jorge
Research Collection School Of Computing and Information Systems
Transparent displays can serve as an important collaborative medium supporting face-to-face interactions over a shared visual work surface. Such displays enhance workspace awareness: when a person is working on one side of a transparent display, the person on the other side can see the other's body, hand gestures, gaze and what he or she is actually manipulating on the shared screen. Even so, we argue that designing such transparent displays must go beyond current offerings if it is to support collaboration. First, both sides of the display must accept interactive input, preferably by at least touch and / or pen, …
Air Indexing For On-Demand Xml Data Broadcast, Weiwei Sun, Rongrui Qin, Jinjin Wu, Baihua Zheng
Air Indexing For On-Demand Xml Data Broadcast, Weiwei Sun, Rongrui Qin, Jinjin Wu, Baihua Zheng
Research Collection School Of Computing and Information Systems
XML data broadcast is an efficient way to disseminate semi-structured information in wireless mobile environments. In this paper, we propose a novel two-tier index structure to facilitate the access of XML document in an on-demand broadcast system. It provides the clients with an overall image of all the XML documents available at the server side and hence enables the clients to locate complete result sets accordingly. A pruning strategy is developed to cut down the index size and a two-tier structure is proposed to further remove any redundant information. In addition, two index distribution strategies, namely naive distribution and partial …
An Air Index For Spatial Query Processing In Road Networks, Weiwei Sun, Chunan Chen, Baihua Zheng, Chong Chen, Peng Liu
An Air Index For Spatial Query Processing In Road Networks, Weiwei Sun, Chunan Chen, Baihua Zheng, Chong Chen, Peng Liu
Research Collection School Of Computing and Information Systems
Spatial queries such as range query and kNN query in road networks have received a growing number of attention in real life. Considering the large population of the users and the high overhead of network distance computation, it is extremely important to guarantee the efficiency and scalability of query processing. Motivated by the scalable and secure properties of wireless broadcast model, this paper presents an air index called Network Partition Index (NPI) to support efficient spatial query processing in road networks via wireless broadcast. The main idea is to partition the road network into a number of regions and then …
Condensing Class Diagrams By Analyzing Design And Network Metrics Using Optimistic Classification, Ferdian Thung, David Lo, Mohd Hafeez Osman, Michel R.V. Chaudron
Condensing Class Diagrams By Analyzing Design And Network Metrics Using Optimistic Classification, Ferdian Thung, David Lo, Mohd Hafeez Osman, Michel R.V. Chaudron
Research Collection School Of Computing and Information Systems
A class diagram of a software system enhances our ability to understand software design. However, this diagram is often unavailable. Developers usually reconstruct the diagram by reverse engineering it from source code. Unfortunately, the resultant diagram is often very cluttered; making it difficult to learn anything valuable from it. Thus, it would be very beneficial if we are able to condense the reverse- engineered class diagram to contain only the important classes depicting the overall design of a software system. Such diagram would make program understanding much easier. A class can be important, for example, if its removal would break …
Information Systems User Competency: A Conceptual Foundation, B. Eschenbrenner, Fiona Fui-Hoon Nah
Information Systems User Competency: A Conceptual Foundation, B. Eschenbrenner, Fiona Fui-Hoon Nah
Research Collection School Of Computing and Information Systems
Research has identified a variety of factors that influence people’s intentions to use IS and their degree of IS use. However, what has not been well understood are the characteristics of competent IS users who are proficient in using IS and are able to achieve quality IS usage. Considering that improving IS users’ abilities to more efficiently and effectively use IS has always been and remains a challenge, research that provides a comprehensive view of the characteristics associated with competent IS users is warranted. This paper addresses this research question by proposing a conceptual foundation for IS user competency. Based …
The Case For Human-Centric Personal Analytics, Youngki Lee, Rajesh Krishna Balan
The Case For Human-Centric Personal Analytics, Youngki Lee, Rajesh Krishna Balan
Research Collection School Of Computing and Information Systems
The rich context provided by smartphones has enabled many new context-aware applications. However, these applications still need to provide their own mechanisms to interpret low-level sensing data and generate high-level user states. In this paper, we propose the idea of building a personal analytics (PA) layer that will use inputs from multiple lower layer sources, such as sensor data (accelerometers, gyroscopes, etc.), phone data (call logs, application activity, etc.), and online sources (Twitter, Facebook posts, etc.) to generate high-level user contextual states (such as emotions, preferences, and engagements). Developers can then use the PA layer to easily build a new …
Version History, Similar Report, And Structure: Putting Them Together For Improved Bug Localization, Shaowei Wang, David Lo
Version History, Similar Report, And Structure: Putting Them Together For Improved Bug Localization, Shaowei Wang, David Lo
Research Collection School Of Computing and Information Systems
During the evolution of a software system, a large number of bug reports are submitted. Locating the source code files that need to be fixed to resolve the bugs is a challenging problem. Thus, there is a need for a technique that can automatically figure out these buggy files. A number of bug localization solutions that take in a bug report and output a ranked list of files sorted based on their likelihood to be buggy have been proposed in the literature. However, the accuracy of these tools still need to be improved. In this paper, to address this need, …
Towards More Accurate Content Categorization Of Api Discussions, Bo Zhou, Xin Xia, David Lo, Cong Tian, Xinyu Wang
Towards More Accurate Content Categorization Of Api Discussions, Bo Zhou, Xin Xia, David Lo, Cong Tian, Xinyu Wang
Research Collection School Of Computing and Information Systems
Nowadays, software developers often discuss the usage of various APIs in online forums. Automatically assigning pre-defined semantic categorizes to API discussions in these forums could help manage the data in online forums, and assist developers to search for useful information. We refer to this process as content categorization of API discussions. To solve this problem, Hou and Mo proposed the usage of naive Bayes multinomial, which is an effective classification algorithm. In this paper, we propose a Cache-bAsed compoSitE algorithm, short formed as CASE, to automatically categorize API discussions. Considering that the content of an API discussion contains both textual …
Daisy Filter Flow: A Generalized Discrete Approach To Dense Correspondences, Hongsheng Yang, Wen-Yan Lin, Jiangbo Lu
Daisy Filter Flow: A Generalized Discrete Approach To Dense Correspondences, Hongsheng Yang, Wen-Yan Lin, Jiangbo Lu
Research Collection School Of Computing and Information Systems
No abstract provided.
Graph-Based Semi-Supervised Learning: Realizing Pointwise Smoothness Probabilistically, Yuan Fang, Kevin Chen-Chuan Chang, Hady W. Lauw
Graph-Based Semi-Supervised Learning: Realizing Pointwise Smoothness Probabilistically, Yuan Fang, Kevin Chen-Chuan Chang, Hady W. Lauw
Research Collection School Of Computing and Information Systems
As the central notion in semi-supervised learning, smoothness is often realized on a graph representation of the data. In this paper, we study two complementary dimensions of smoothness: its pointwise nature and probabilistic modeling. While no existing graph-based work exploits them in conjunction, we encompass both in a novel framework of Probabilistic Graph-based Pointwise Smoothness (PGP), building upon two foundational models of data closeness and label coupling. This new form of smoothness axiomatizes a set of probability constraints, which ultimately enables class prediction. Theoretically, we provide an error and robustness analysis of PGP. Empirically, we conduct extensive experiments to show …
Hydra: Large-Scale Social Identity Linkage Via Heterogeneous Behavior Modeling, Siyuan Liu, Shuhui Wang, Feida Zhu, Jinbo Zhang, Ramayya Krishnan
Hydra: Large-Scale Social Identity Linkage Via Heterogeneous Behavior Modeling, Siyuan Liu, Shuhui Wang, Feida Zhu, Jinbo Zhang, Ramayya Krishnan
Research Collection School Of Computing and Information Systems
We study the problem of large-scale social identity linkage across different social media platforms, which is of critical importance to business intelligence by gaining from social data a deeper understanding and more accurate profiling of users. This paper proposes HYDRA, a solution framework which consists of three key steps: (I) modeling heterogeneous behavior by long-term behavior distribution analysis and multi-resolution temporal information matching; (II) constructing structural consistency graph to measure the high-order structure consistency on users' core social structures across different platforms; and (III) learning the mapping function by multi-objective optimization composed of both the supervised learning on pair-wise ID …
Practical Analysis Framework For Software-Based Attestation Scheme, Li Li, Hong Hu, Jun Sun, Yang Liu, Dong Jin Song
Practical Analysis Framework For Software-Based Attestation Scheme, Li Li, Hong Hu, Jun Sun, Yang Liu, Dong Jin Song
Research Collection School Of Computing and Information Systems
An increasing number of ”smart” embedded devices are employed in our living environment nowadays. Unlike traditional computer systems, these devices are often physically accessible to the attackers. It is therefore almost impossible to guarantee that they are un-compromised, i.e., that indeed the devices are executing the intended software. In such a context, software-based attestation is deemed as a promising solution to validate their software integrity. It guarantees that the software running on the embedded devices are un-compromised without any hardware support. However, designing software-based attestation protocols are shown to be error-prone. In this work, we develop a framework for design …
A Hybrid Model Of Connectors In Cyber-Physical Systems, Xiaohong Chen, Jun Sun, Meng Sun Sun
A Hybrid Model Of Connectors In Cyber-Physical Systems, Xiaohong Chen, Jun Sun, Meng Sun Sun
Research Collection School Of Computing and Information Systems
Compositional coordination models and languages play an important role in cyber-physical systems (CPSs). In this paper, we introduce a formal model for describing hybrid behaviors of connectors in CPSs. We extend the constraint automata model, which is used as the semantic model for the exogenous channel-based coordination language Reo, to capture the dynamic behavior of connectors in CPSs where the discrete and continuous dynamics co-exist and interact with each other. In addition to the formalism, we also provide a theoretical compositional approach for constructing the product automata for a Reo circuit, which is typically obtained by composing several primitive connectors …
Scc-Based Improved Reachability Analysis For Markov Decision Processes, Lin Gui, Jun Sun, Songzheng Song, Yang Liu, Jin Song Dong
Scc-Based Improved Reachability Analysis For Markov Decision Processes, Lin Gui, Jun Sun, Songzheng Song, Yang Liu, Jin Song Dong
Research Collection School Of Computing and Information Systems
Markov decision processes (MDPs) are extensively used to model systems with both probabilistic and nondeterministic behavior. The problem of calculating the probability of reaching certain system states (hereafter reachability analysis) is central to the MDP-based system analysis. It is known that existing approaches on reachability analysis for MDPs are often inefficient when a given MDP contains a large number of states and loops, especially with the existence of multiple probability distributions. In this work, we propose a method to eliminate strongly connected components (SCCs) in an MDP using a divide-and-conquer algorithm, and actively remove redundant probability distributions in the MDP …
Tauth: Verifying Timed Security Protocols, Li Li, Jun Sun, Yang Liu, Jin Song Dong
Tauth: Verifying Timed Security Protocols, Li Li, Jun Sun, Yang Liu, Jin Song Dong
Research Collection School Of Computing and Information Systems
Quantitative timing is often relevant to the security of systems, like web applications, cyber-physical systems, etc. Verifying timed security protocols is however challenging as both arbitrary attacking behaviors and quantitative timing may lead to undecidability. In this work, we develop a service framework to support intuitive modeling of the timed protocol, as well as automatic verification with an unbounded number of sessions. The partial soundness and completeness of our verification algorithms are formally defined and proved. We implement our method into a tool called TAuth and the experiment results show that our approach is efficient and effective in both finding …
Gpu Accelerated Counterexample Generation In Ltl Model Checking, Zhimin Wu, Yang Liu, Yun Liang, Jun Sun
Gpu Accelerated Counterexample Generation In Ltl Model Checking, Zhimin Wu, Yang Liu, Yun Liang, Jun Sun
Research Collection School Of Computing and Information Systems
Strongly Connected Component (SCC) based searching is one of the most popular LTL model checking algorithms. When the SCCs are huge, the counterexample generation process can be time-consuming, especially when dealing with fairness assumptions. In this work, we propose a GPU accelerated counterexample generation algorithm, which improves the performance by parallelizing the Breadth First Search (BFS) used in the counterexample generation. BFS work is irregular, which means it is hard to allocate resources and may suffer from imbalanced load. We make use of the features of latest CUDA Compute Architecture-NVIDIA Kepler GK110 to achieve the dynamic parallelism and memory hierarchy …
Lifi: Line-Of-Sight Identification With Wifi, Zimu Zhou, Zheng Yang, Chenshu Wu, Wei Sun, Yunhao Liu
Lifi: Line-Of-Sight Identification With Wifi, Zimu Zhou, Zheng Yang, Chenshu Wu, Wei Sun, Yunhao Liu
Research Collection School Of Computing and Information Systems
Wireless LANs, especially WiFi, have been pervasively deployed and have fostered myriad wireless communication services and ubiquitous computing applications. A primary concern in designing each scenario-tailored application is to combat harsh indoor propagation environments, particularly Non-LineOf-Sight (NLOS) propagation. The ability to distinguish LineOf-Sight (LOS) path from NLOS paths acts as a key enabler for adaptive communication, cognitive radios, robust localization, etc. Enabling such capability on commodity WiFi infrastructure, however, is prohibitive due to the coarse multipath resolution with mere MAC layer RSSI. In this work, we dive into the PHY layer and strive to eliminate irrelevant noise and NLOS paths …
How Many Eyeballs Does A Bug Need? An Empirical Validation Of Linus' Law, Subhajit Datta, Proshanta Sarkar, Sutirtha Das, Sonu Sreshtha, Prasanth Lade, Subhashis Majumder
How Many Eyeballs Does A Bug Need? An Empirical Validation Of Linus' Law, Subhajit Datta, Proshanta Sarkar, Sutirtha Das, Sonu Sreshtha, Prasanth Lade, Subhashis Majumder
Research Collection School Of Computing and Information Systems
Linus’ Law reflects on a key characteristic of open source software development: developers’ tendency to closely work together in the bug resolution process. In this paper we empirically examine Linus’ Law using a data-set of 1,000+ Android bugs, owned by 70+ developers. Our results indicate that encouraging developers to work closely with one another has nuanced implications; while one form of contact may help reduce bug resolution time, another form can have quite the opposite effect. We present statistically significant evidence in support of our results and discuss their relevance at the individual and organizational levels.
Didn’T You See My Message?: Predicting Attentiveness To Mobile Instant Messages, Martin Pielot, Rodrigo De Oliveira, Haewoon Kwak, Nuria. Oliver
Didn’T You See My Message?: Predicting Attentiveness To Mobile Instant Messages, Martin Pielot, Rodrigo De Oliveira, Haewoon Kwak, Nuria. Oliver
Research Collection School Of Computing and Information Systems
Mobile instant messaging (e.g., via SMS or WhatsApp) often goes along with an expectation of high attentiveness, i.e., that the receiver will notice and read the message within a few minutes. Hence, existing instant messaging services for mobile phones share indicators of availability, such as the last time the user has been online. However, in this paper we not only provide evidence that these cues create social pressure, but that they are also weak predictors of attentiveness. As remedy, we propose to share a machine-computed prediction of whether the user will view a message within the next few minutes or …
Physio@Home: Design Explorations To Support Movement Guidance, Richard Tang, Hesam Alizadeh, Anthony Tang, Scott Bateman, Joaquim A.P. Jorge
Physio@Home: Design Explorations To Support Movement Guidance, Richard Tang, Hesam Alizadeh, Anthony Tang, Scott Bateman, Joaquim A.P. Jorge
Research Collection School Of Computing and Information Systems
Patients typically undergo physiotherapy with the help of a physiotherapist who teaches, guides, and corrects the patients as they perform exercises. It would be nice if people could repeat these exercises at home, potentially improving their recovery rate. However, without guidance and/or corrective feedback from a physiotherapist, the patient will not know whether they are doing their exercises correctly. To address this problem, we implemented a prototype that guides patients through pre-recorded exercise movements using visual guides overlaid atop a mirror-view of the patient on a wall-mounted display. We conducted informal evaluations and pilot studies to assess our prototype and …
One Space: Shared Visual Scenes For Active Free Play, Maayan Cohen, Kody Dillman, Haley Macleod, Seth Hunter, Anthony Tang
One Space: Shared Visual Scenes For Active Free Play, Maayan Cohen, Kody Dillman, Haley Macleod, Seth Hunter, Anthony Tang
Research Collection School Of Computing and Information Systems
Children engage in free play for emotional, physical and social development; researchers have explored supporting free play between physically remote playmates using videoconferencing tools. We show that the configuration of the video conferencing setup affects play. Specifically, we show that a shared visual scene configuration promotes fundamentally active forms of engaged, co-operative play.
Haptics In Remote Collaborative Exercise Systems For Seniors, Hesam Alizadeh, Richard Tang, Ehud Sharlin, Anthony Tang
Haptics In Remote Collaborative Exercise Systems For Seniors, Hesam Alizadeh, Richard Tang, Ehud Sharlin, Anthony Tang
Research Collection School Of Computing and Information Systems
Group exercise provides motivation to follow and maintain a healthy daily exercise schedule while enjoying beneficial encouragement and social support from friends and exercise partners. However, mobility and transportation issues frequently prevent seniors from engaging in group activities. To address this problem, we investigated the exercise needs of seniors and developed a prototype remote exercise system. Our system uses haptic feedback to simulate assistive pushing and pulling of limbs when exercising with a partner. We developed three distinct vibration metaphors -- constant push/pull, corrective feedback, and notification -- to convey engagement and connection between exercise partners. We conducted a preliminary …
Simple Effective Named Entity Recognition For Microblogs: Arabic As An Example, Kareem Darwish, Wei Gao
Simple Effective Named Entity Recognition For Microblogs: Arabic As An Example, Kareem Darwish, Wei Gao
Research Collection School Of Computing and Information Systems
No abstract provided.
Detecting Anomaly Collections Using Extreme Feature Ranks, Hanbo Dai, Feida Zhu, Ee Peng Lim, Hwee Hwa Pang
Detecting Anomaly Collections Using Extreme Feature Ranks, Hanbo Dai, Feida Zhu, Ee Peng Lim, Hwee Hwa Pang
Research Collection School Of Computing and Information Systems
Detecting anomaly collections is an important task with many applications, including spam and fraud detection. In an anomaly collection, entities often operate in collusion and hold different agendas to normal entities. As a result, they usually manifest collective extreme traits, i.e., members of an anomaly collection are consistently clustered toward the top or bottom ranks on certain features. We therefore propose to detect these anomaly collections by extreme feature ranks. We introduce a novel anomaly definition called Extreme Rank Anomalous Collection or ERAC. We propose a new measure of anomalousness capturing collective extreme traits based on a statistical model. As …
Handling Location Uncertainty In Event Driven Experimentation, Kartik Muralidharan, Srinivasan Seshan, Narayan Ramasubbu, Rajesh Krishna Balan
Handling Location Uncertainty In Event Driven Experimentation, Kartik Muralidharan, Srinivasan Seshan, Narayan Ramasubbu, Rajesh Krishna Balan
Research Collection School Of Computing and Information Systems
The wide spread use of smart phones has ushered in a wave of context-based advertising services that operate on pre-defined user events. A prime example is Location Based Advertising. What is missing though, is the ability to experiment with these services under varying event conditions with real users using their regular phones in real-world environments. Such experiments provide greater insight into user needs for and responsiveness towards context-based advertising applications. However, these event-driven experiments rely on data that arrive from sources such as mobile sensors which have inherent uncertainties associated with them. This effects the interpretation of the outcome of …