Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Computer Sciences (449)
- Physical Sciences and Mathematics (449)
- Data Storage Systems (183)
- Databases and Information Systems (171)
- Digital Communications and Networking (138)
-
- Software Engineering (126)
- Computer and Systems Architecture (98)
- Graphics and Human Computer Interfaces (69)
- Artificial Intelligence and Robotics (35)
- OS and Networks (35)
- Information Security (29)
- Social and Behavioral Sciences (29)
- Business (25)
- Communication (18)
- Theory and Algorithms (15)
- Social Media (14)
- Technology and Innovation (14)
- Robotics (11)
- Hardware Systems (9)
- Numerical Analysis and Scientific Computing (9)
- Programming Languages and Compilers (9)
- Systems Architecture (8)
- Public Affairs, Public Policy and Public Administration (6)
- Transportation (6)
- Asian Studies (5)
- International and Area Studies (5)
- Communication Technology and New Media (4)
- Accounting (2)
- Keyword
-
- Data mining (7)
- Machine learning (7)
- Reinforcement learning (7)
- Deep learning (6)
- Image search (6)
-
- Artificial intelligence (5)
- Clustering (5)
- Human action recognition (5)
- Searchable encryption (5)
- Twitter (5)
- Anomaly detection (4)
- Cloud security (4)
- Cloud storage (4)
- Collaboration (4)
- Data Mining (4)
- Game theory (4)
- Social media (4)
- Unsupervised learning (4)
- Visualization (4)
- 802.11 (3)
- AoA (3)
- Attribute-based encryption (3)
- Automation (3)
- Bag-of-words (3)
- Big data (3)
- Categorization (3)
- Click-through data (3)
- Cloud computing (3)
- Co-occurrence (3)
- Collaborative filtering (3)
- Publication Year
- Publication
- Publication Type
Articles 121 - 150 of 546
Full-Text Articles in Computer Engineering
Why Reinventing The Wheels? An Empirical Study On Library Reuse And Re-Implementation, Bowen Xu, Le An, Ferdian Thung, Foutse Khomh, David Lo
Why Reinventing The Wheels? An Empirical Study On Library Reuse And Re-Implementation, Bowen Xu, Le An, Ferdian Thung, Foutse Khomh, David Lo
Research Collection School Of Computing and Information Systems
Nowadays, with the rapid growth of open source software (OSS), library reuse becomes more and more popular since a large amount of third- party libraries are available to download and reuse. A deeper understanding on why developers reuse a library (i.e., replacing self-implemented code with an external library) or re-implement a library (i.e., replacing an imported external library with self-implemented code) could help researchers better understand the factors that developers are concerned with when reusing code. This understanding can then be used to improve existing libraries and API recommendation tools for researchers and practitioners by using the developers concerns identified …
Preference Learning And Similarity Learning Perspectives On Personalized Recommendation, Duy Dung Le
Preference Learning And Similarity Learning Perspectives On Personalized Recommendation, Duy Dung Le
Dissertations and Theses Collection (Open Access)
Personalized recommendation, whose objective is to generate a limited list of items (e.g., products on Amazon, movies on Netflix, or pins on Pinterest, etc.) for each user, has gained extensive attention from both researchers and practitioners in the last decade. The necessity of personalized recommendation is driven by the explosion of available options online, which makes it difficult, if not downright impossible, for each user to investigate every option. Product and service providers rely on recommendation algorithms to identify manageable number of the most likely or preferred options to be presented to each user. Also, due to the limited screen …
Confusion And Information Triggered By Photos In Persona Profiles, Joni Salminen, Soon-Gyo Jung, Jisun An, Haewoon Kwak, Lene Nielsen, Bernard J. Jansen
Confusion And Information Triggered By Photos In Persona Profiles, Joni Salminen, Soon-Gyo Jung, Jisun An, Haewoon Kwak, Lene Nielsen, Bernard J. Jansen
Research Collection School Of Computing and Information Systems
We investigate whether additional photos beyond a single headshot makes a persona profile more informative without confusing the end user. We conduct an eye-tracking experiment and qualitative interviews with digital content creators after varying the persona in photos via a single headshot, a headshot and photo of the persona in different contexts, and a headshot with photos of different people with key persona attributes the gender and age. Findings show that contextual photos provide significantly more persona information to end users; however, showing photos of multiple people engenders confusion and lowers informativeness. Also, as anticipated, viewing additional photos requires more …
Efficient Distributed Reachability Querying Of Massive Temporal Graphs, Tianming Zhang, Yunjun Gao, Chen Lu, Wei Guo, Shiliang Pu, Baihua Zheng, Christian S. Jensen
Efficient Distributed Reachability Querying Of Massive Temporal Graphs, Tianming Zhang, Yunjun Gao, Chen Lu, Wei Guo, Shiliang Pu, Baihua Zheng, Christian S. Jensen
Research Collection School Of Computing and Information Systems
Reachability computation is a fundamental graph functionality with a wide range of applications. In spite of this, little work has as yet been done on efficient reachability queries over temporal graphs, which are used extensively to model time-varying networks, such as communication networks, social networks, and transportation schedule networks. Moreover, we are faced with increasingly large real-world temporal networks that may be distributed across multiple data centers. This state of affairs motivates the paper's study of efficient reachability queries on distributed temporal graphs. We propose an efficient index, called Temporal Vertex Labeling (TVL), which is a labeling scheme for distributed …
Optimizing Impression Counts For Outdoor Advertising, Yipeng Zhang, Yuchen Li, Zhifeng Bao, Songsong Mo, Ping Zhang
Optimizing Impression Counts For Outdoor Advertising, Yipeng Zhang, Yuchen Li, Zhifeng Bao, Songsong Mo, Ping Zhang
Research Collection School Of Computing and Information Systems
In this paper we propose and study the problem of optimizing theinfluence of outdoor advertising (ad) when impression counts aretaken into consideration. Given a database U of billboards, each ofwhich has a location and a non-uniform cost, a trajectory databaseT and a budget B, it aims to find a set of billboards that has themaximum influence under the budget. In line with the advertisingconsumer behavior studies, we adopt the logistic function to takeinto account the impression counts of an ad (placed at differentbillboards) to a user trajectory when defining the influence measurement. However, this poses two challenges: (1) our problemis …
Coresets For Minimum Enclosing Balls Over Sliding Windows, Yanhao Wang, Yuchen Li, Kian-Lee Tan
Coresets For Minimum Enclosing Balls Over Sliding Windows, Yanhao Wang, Yuchen Li, Kian-Lee Tan
Research Collection School Of Computing and Information Systems
Coresets are important tools to generate concise summaries of massive datasets for approximate analysis. A coreset is a small subset of points extracted from the original point set such that certain geometric properties are preserved with provable guarantees. This paper investigates the problem of maintaining a coreset to preserve the minimum enclosing ball (MEB) for a sliding window of points that are continuously updated in a data stream. Although the problem has been extensively studied in batch and append-only streaming settings, no efficient sliding-window solution is available yet. In this work, we first introduce an algorithm, called AOMEB, to build …
Digital Marketing In The Artificial Intelligence And Machine Learning Age, Z. Ruan, Keng Siau
Digital Marketing In The Artificial Intelligence And Machine Learning Age, Z. Ruan, Keng Siau
Research Collection School Of Computing and Information Systems
We are living in a period of profound change driven by digitization, information and communication technology, artificial intelligence, machine learning, and robotics (Gupta, Keen, Shah, and Verdier, 2017; Wang and Siau, 2019). Traditional marketing is shifting to digital marketing enabled by AI and machine learning. Customer consumption behavior has changed from traditional in-store shopping to online shopping (Thiraviyam, 2018). The large volume of transaction and demographic data enables business analytics, AI, and machine learning to analyze and predict customer behavior to improve customer satisfaction and enhance sales (Siau and Wang, 2018). For example, predictive analytics uses different algorithms to predict …
Shoal: Large-Scale Hierarchical Taxonomy Via Graph-Based Query Coalition In E-Commerce, Zhao Li, Xia Chen, Xuming Pan, Pengcheng Zou, Yuchen Li, Guoxian Yu
Shoal: Large-Scale Hierarchical Taxonomy Via Graph-Based Query Coalition In E-Commerce, Zhao Li, Xia Chen, Xuming Pan, Pengcheng Zou, Yuchen Li, Guoxian Yu
Research Collection School Of Computing and Information Systems
E-commerce taxonomy plays an essential role in online retail business. Existing taxonomy of e-commerce platformsorganizes items into an ontology structure. However, theontology-driven approach is subject to costly manual maintenance and often does not capture user’s search intention,particularly when user searches by her personalized needsrather than a universal definition of the items. Observingthat search queries can effectively express user’s intention,we present a novel large-Scale Hierarchical taxOnomy viagrAph based query coaLition (SHOAL) to bridge the gapbetween item taxonomy and user search intention. SHOALorganizes hundreds of millions of items into a hierarchicaltopic structure. Each topic that consists of a cluster of itemsdenotes a …
Low-Rank Sparse Subspace For Spectral Clustering, Xiaofeng Zhu, Shichao Zhang, Yonggang Li, Jilian Zhang, Lifeng Yang, Yue Fang
Low-Rank Sparse Subspace For Spectral Clustering, Xiaofeng Zhu, Shichao Zhang, Yonggang Li, Jilian Zhang, Lifeng Yang, Yue Fang
Research Collection School Of Computing and Information Systems
The current two-step clustering methods separately learn the similarity matrix and conduct k means clustering. Moreover, the similarity matrix is learnt from the original data, which usually contain noise. As a consequence, these clustering methods cannot achieve good clustering results. To address these issues, this paper proposes a new graph clustering methods (namely Low-rank Sparse Subspace clustering (LSS)) to simultaneously learn the similarity matrix and conduct the clustering from the low-dimensional feature space of the original data. Specifically, the proposed LSS integrates the learning of similarity matrix of the original feature space, the learning of similarity matrix of the low-dimensional …
Do Grant Funding And Pro-Environmental Spillovers Influence Household Hazardous Waste Collection?, Kustini Lim-Wavde, Robert J Kauffman, Tin Seong Kam, Gregory S. Dawsond
Do Grant Funding And Pro-Environmental Spillovers Influence Household Hazardous Waste Collection?, Kustini Lim-Wavde, Robert J Kauffman, Tin Seong Kam, Gregory S. Dawsond
Research Collection School Of Computing and Information Systems
Agency and state grant funding should be disseminated in ways so it will result in better management of household hazardous waste (HHW) and environmental sustainability. Since location seems to matter in HHW collection activities, it is important to consider pro-environmental spatial spillovers that occur, based on agency actions and waste collection behavior taking place in other locations. These may influence HHW-related practices in close-by regions. Using a county-level spatio-temporal dataset that consists of economic, demographic, and HHW data in California from 2004 to 2015, we evaluate the impact of HHW grants on HHW collection activities while considering pro-environmental spillovers. We …
Gpu-Based Graph Traversal On Compressed Graphs, Mo Sha, Yuchen Li, Kian-Lee Tan
Gpu-Based Graph Traversal On Compressed Graphs, Mo Sha, Yuchen Li, Kian-Lee Tan
Research Collection School Of Computing and Information Systems
Graph processing on GPUs received much attention in theindustry and the academia recently, as the hardware accelerator offers attractive potential for performance boost. However, the high-bandwidth device memory on GPUs has limited capacity that constrains the size of the graph to be loadedon chip. In this paper, we introduce GPU-based graph traversal on compressed graphs, so as to enable the processingof graphs having a larger size than the device memory. Designed towards GPU’s SIMT architecture, we propose twonovel parallel scheduling strategies Two-Phase Traversal andTask-Stealing to handle thread divergence and workload imbalance issues when decoding the compressed graph. Wefurther optimize our …
Chatbots: Conversation Killers Or Makers?, Jing Jiang
Chatbots: Conversation Killers Or Makers?, Jing Jiang
MITB Thought Leadership Series
Whether you’re aware of it or not, the chances are you’ve been chatting to robots of late. While these bots are faceless and unseen, don’t be fooled into thinking they aren’t there. In fact, chatbots, have been around since the 1960s at least, but with the progress in artificial intelligence, cloud computing and voice recognition, they’ve received both a functionality and a popularity boost. From the cosmetic to the life-changing, nowadays, chatbots can do anything from helping a person lose weight to assisting refugees applying for asylum.
The Impact Of Changes Mislabeled By Szz On Just-In-Time Defect Prediction, Yuanrui Fan, Xin Xia, Daniel A. Costa, David Lo, Ahmed E. Hassan, Shanping Li
The Impact Of Changes Mislabeled By Szz On Just-In-Time Defect Prediction, Yuanrui Fan, Xin Xia, Daniel A. Costa, David Lo, Ahmed E. Hassan, Shanping Li
Research Collection School Of Computing and Information Systems
Just-in-Time (JIT) defect prediction—a technique which aims to predict bugs at change level—has been paid more attention. JIT defect prediction leverages the SZZ approach to identify bug-introducing changes. Recently, researchers found that the performance of SZZ (including its variants) is impacted by a large amount of noise. SZZ may considerably mislabel changes that are used to train a JIT defect prediction model, and thus impact the prediction accuracy. In this paper, we investigate the impact of the mislabeled changes by different SZZ variants on the performance and interpretation of JIT defect prediction models. We analyze four SZZ variants (i.e., B-SZZ, …
Matching Passengers And Drivers With Multiple Objectives In Ride Sharing Markets, Guodong Lyu, Chung Piaw Teo, Wangchi Cheung, Hai Wang
Matching Passengers And Drivers With Multiple Objectives In Ride Sharing Markets, Guodong Lyu, Chung Piaw Teo, Wangchi Cheung, Hai Wang
Research Collection School Of Computing and Information Systems
In many cities in the world, ride sharing companies, such as Uber, Didi, Grab and Lyft, have been able to leverage on Internet-based platforms to conduct online decision making to connect passengers and drivers. These online platforms facilitate the integration of passengers and drivers’ mobility data on smart phones in real-time, which enables a convenient matching between demand and supply in real time. These clear operational advantages have motivated many similar shared service business models in the public transportation arena, and have been a disruptive force to the traditional taxi industry.
Metagraph-Based Learning On Heterogeneous Graphs, Yuan Fang, Wenqing Lin, Vincent W. Zheng, Min Wu, Jiaqi Shi, Kevin Chang, Xiao-Li Li
Metagraph-Based Learning On Heterogeneous Graphs, Yuan Fang, Wenqing Lin, Vincent W. Zheng, Min Wu, Jiaqi Shi, Kevin Chang, Xiao-Li Li
Research Collection School Of Computing and Information Systems
Data in the form of graphs are prevalent, ranging from biological and social networks to citation graphs and the Web. Inparticular, most real-world graphs are heterogeneous, containing objects of multiple types, which present new opportunities for manyproblems on graphs. Consider a typical proximity search problem on graphs, which boils down to measuring the proximity between twogiven nodes. Most earlier studies on homogeneous or bipartite graphs only measure a generic form of proximity, without accounting fordifferent “semantic classes”—for instance, on a social network two users can be close for different reasons, such as being classmates orfamily members, which represent two distinct …
R2gan: Cross-Modal Recipe Retrieval With Generative Adversarial Network, Bin Zhu, Chong-Wah Ngo, Jingjing Chen, Yanbin Hao
R2gan: Cross-Modal Recipe Retrieval With Generative Adversarial Network, Bin Zhu, Chong-Wah Ngo, Jingjing Chen, Yanbin Hao
Research Collection School Of Computing and Information Systems
Representing procedure text such as recipe for crossmodal retrieval is inherently a difficult problem, not mentioning to generate image from recipe for visualization. This paper studies a new version of GAN, named Recipe Retrieval Generative Adversarial Network (R2GAN), to explore the feasibility of generating image from procedure text for retrieval problem. The motivation of using GAN is twofold: learning compatible cross-modal features in an adversarial way, and explanation of search results by showing the images generated from recipes. The novelty of R2GAN comes from architecture design, specifically a GAN with one generator and dual discriminators is used, which makes the …
Adversarial Contract Design For Private Data Commercialization, Parinaz Naghizadeh, Arunesh Sinha
Adversarial Contract Design For Private Data Commercialization, Parinaz Naghizadeh, Arunesh Sinha
Research Collection School Of Computing and Information Systems
The proliferation of data collection and machine learning techniques has created an opportunity for commercialization of private data by data aggregators. In this paper, we study this data monetization problem as a mechanism design problem, specifically using a contract-theoretic approach. Our proposed adversarial contract design framework provides a fundamental extension to the classic contract theory set-up in order to account for the heterogeneity in honest buyers’ demands for data, as well as the presence of adversarial buyers who may purchase data to compromise its privacy. We propose the notion of Price of Adversary (PoAdv) to quantify the effects of adversarial …
Worker Demographics And Earnings On Amazon Mechanical Turk: An Exploratory Analysis, Kotaro Hara, Kristy Milland, Benjamin V. Hanrahan, Chris Callison-Burch, Abigail Adams, Saiph Savage, Jeffrey P. Bigham
Worker Demographics And Earnings On Amazon Mechanical Turk: An Exploratory Analysis, Kotaro Hara, Kristy Milland, Benjamin V. Hanrahan, Chris Callison-Burch, Abigail Adams, Saiph Savage, Jeffrey P. Bigham
Research Collection School Of Computing and Information Systems
Prior research reported that workers on Amazon Mechanical Turk (AMT) are underpaid, earning about $2/h. But the prior research did not investigate the difference in wage due to worker characteristics (e.g., country of residence). We present the first data-driven analysis on wage gap on AMT. Using work log data and demographic data collected via online survey, we analyse the gap in wage due to different factors. We show that there is indeed wage gap; for example, workers in the U.S. earn $3.01/h while those in India earn $1.41/h on average.
The Future Robo-Advisor, Catalin Burlacu
The Future Robo-Advisor, Catalin Burlacu
MITB Thought Leadership Series
The accelerated digitalisation of both people and business around the world today is having a huge impact on the investment management and advisory space. The addition of new and vastly larger data sets, as well as exponentially more sophisticated analytical tools to turn that data into usable information is constantly changing the way investments are decided on, made and managed.
Incentivizing Collaboration In A Competition, Arunesh Sinha, Michael P. Wellman
Incentivizing Collaboration In A Competition, Arunesh Sinha, Michael P. Wellman
Research Collection School Of Computing and Information Systems
Research and design competitions aim to promote innovation or creative production, which are often best achieved through collaboration. The nature of a competition, however, typically necessitates sorting by individual performance. This presents tradeoffs for the competition designer, between incentivizing global performance and distinguishing individual capability. We model this situation in terms of an abstract collaboration game, where individual effort also benefits neighboring agents. We propose a scoring mechanism called LSWM that rewards agents based on localized social welfare. We show that LSWM promotes global performance, in that social optima are equilibria of the mechanism. Moreover, we establish conditions under which …
Designated-Server Identity-Based Authenticated Encryption With Keyword Search For Encrypted Emails, Hongbo Li, Qiong Huang, Jian Shen, Guomin Yang, Willy Susilo
Designated-Server Identity-Based Authenticated Encryption With Keyword Search For Encrypted Emails, Hongbo Li, Qiong Huang, Jian Shen, Guomin Yang, Willy Susilo
Research Collection School Of Computing and Information Systems
In encrypted email system, how to search over encrypted cloud emails without decryption is an important and practical problem. Public key encryption with keyword search (PEKS) is an efficient solution to it. However, PEKS suffers from the complex key management problem in the public key infrastructure. Its variant in the identity-based setting addresses the drawback, however, almost all the schemes does not resist against offline keyword guessing attacks (KGA) by inside adversaries. In this work we introduce the notion of designated-server identity-based authenticated encryption with keyword search (dIBAEKS), in which the email sender authenticates the message while encrypting so that …
Cure: Flexible Categorical Data Representation By Hierarchical Coupling Learning, Songlei Jian, Guansong Pang, Longbing Cao, Kai Lu, Hang Gao
Cure: Flexible Categorical Data Representation By Hierarchical Coupling Learning, Songlei Jian, Guansong Pang, Longbing Cao, Kai Lu, Hang Gao
Research Collection School Of Computing and Information Systems
The representation of categorical data with hierarchical value coupling relationships (i.e., various value-to-value cluster interactions) is very critical yet challenging for capturing complex data characteristics in learning tasks. This paper proposes a novel and flexible coupled unsupervised categorical data representation (CURE) framework, which not only captures the hierarchical couplings but is also flexible enough to be instantiated for contrastive learning tasks. CURE first learns the value clusters of different granularities based on multiple value coupling functions and then learns the value representation from the couplings between the obtained value clusters. With two complementary value coupling functions, CURE is instantiated into …
Emerging App Issue Identification From User Feedback: Experience On Wechat, Cuiyun Gao, Wujie Zheng, Yuetang Deng, David Lo, Jichuan Zeng, Michael R. Lyu, Irwin King
Emerging App Issue Identification From User Feedback: Experience On Wechat, Cuiyun Gao, Wujie Zheng, Yuetang Deng, David Lo, Jichuan Zeng, Michael R. Lyu, Irwin King
Research Collection School Of Computing and Information Systems
It is vital for popular mobile apps with large numbers of users to release updates with rich features while keeping stable user experience. Timely and accurately locating emerging app issues can greatly help developers to maintain and update apps. User feedback (i.e., user reviews) is a crucial channel between app developers and users, delivering a stream of information about bugs and features that concern users. Methods to identify emerging issues based on user feedback have been proposed in the literature, however, their applicability in industry has not been explored. We apply the recent method IDEA to WeChat, a popular messenger …
Community Discovery In Heterogeneous Social Networks, Lei Meng, Ah-Hwee Tan, Donald C. Wunsch
Community Discovery In Heterogeneous Social Networks, Lei Meng, Ah-Hwee Tan, Donald C. Wunsch
Research Collection School Of Computing and Information Systems
Discovering social communities of web users through clustering analysis of heterogeneous link associations has drawn much attention. However, existing approaches typically require the number of clusters a priori, do not address the weighting problem for fusing heterogeneous types of links, and have a heavy computational cost. This chapter studies the commonly used social links of users and explores the feasibility of the proposed heterogeneous data co-clustering algorithm GHF-ART, as introduced in Sect. 3.6, for discovering user communities in social networks. Contrary to the existing algorithms proposed for this task, GHF-ART performs real-time matching of patterns and one-pass learning, which guarantees …
Interaction-Aware Arrangement For Event-Based Social Networks, Feifei Kou, Zimu Zhou, Hao Cheg, Junping Du, Yexuan Shi, Pan Xu
Interaction-Aware Arrangement For Event-Based Social Networks, Feifei Kou, Zimu Zhou, Hao Cheg, Junping Du, Yexuan Shi, Pan Xu
Research Collection School Of Computing and Information Systems
No abstract provided.
Modeling Sequential And Basket-Oriented Associations For Top-K Recommendation, Duc-Trong Le Duc Trong
Modeling Sequential And Basket-Oriented Associations For Top-K Recommendation, Duc-Trong Le Duc Trong
Dissertations and Theses Collection (Open Access)
Top-K recommendation is a typical task in Recommender Systems. In traditional approaches, it mainly relies on the modeling of user-item associations, which emphasizes the user-specific factor or personalization. Here, we investigate another direction that models item-item associations, especially with the notions of sequence-aware and basket-level adoptions . Sequences are created by sorting item adoptions chronologically. The associations between items along sequences, referred to as “sequential associations”, indicate the influence of the preceding adoptions on the following adoptions. Considering a basket of items consumed at the same time step (e.g., a session, a day), “basket-oriented associations” imply correlative dependencies among these …
Wiwear: Wearable Sensing Via Directional Wifi Energy Harvesting, Huy Vu Tran, Archan Misra, Jie Xiong, Rajesh Krishna Balan
Wiwear: Wearable Sensing Via Directional Wifi Energy Harvesting, Huy Vu Tran, Archan Misra, Jie Xiong, Rajesh Krishna Balan
Research Collection School Of Computing and Information Systems
Energy harvesting, from a diverse set of modes such as light or motion, has been viewed as the key to developing batteryless sensing devices. In this paper, we develop the nascent idea of harvesting RF energy from WiFi transmissions, applying it to power a prototype wearable device that captures and transmits accelerometer sensor data. Our solution, WiWear, has two key innovations: 1) beamforming WiFi transmissions to significantly boost the energy that a receiver can harvest ~23 meters away, and 2) smart zero-energy, triggering of inertial sensing, that allows intelligent duty-cycled operation of devices whose transient power consumption far exceeds what …
Ict: In-Field Calibration Transfer For Air Quality Sensor Deployments, Yun Cheng, Xiaoxi He, Zimu Zhou, Lothar Thiele
Ict: In-Field Calibration Transfer For Air Quality Sensor Deployments, Yun Cheng, Xiaoxi He, Zimu Zhou, Lothar Thiele
Research Collection School Of Computing and Information Systems
Recent years have witnessed a growing interest in urban air pollution monitoring, where hundreds of low-cost air quality sensors are deployed city-wide. To guarantee data accuracy and consistency, these sensors need periodic calibration after deployment. Since access to ground truth references is often limited in large-scale deployments, it is difficult to conduct city-wide post-deployment sensor calibration. In this work we propose In-field Calibration Transfer (ICT), a calibration scheme that transfers the calibration parameters of source sensors (with access to references) to target sensors (without access to references). On observing that (i) the distributions of ground truth in both source and …
Fc2: Cloud-Based Cluster Provisioning For Distributed Machine Learning, Nguyen Binh Duong Ta
Fc2: Cloud-Based Cluster Provisioning For Distributed Machine Learning, Nguyen Binh Duong Ta
Research Collection School Of Computing and Information Systems
Training large, complex machine learning models such as deep neural networks with big data requires powerful computing clusters, which are costly to acquire, use and maintain. As a result, many machine learning researchers turn to cloud computing services for on-demand and elastic resource provisioning capabilities. Two issues have arisen from this trend: (1) if not configured properly, training models on cloud-based clusters could incur significant cost and time, and (2) many researchers in machine learning tend to focus more on model and algorithm development, so they may not have the time or skills to deal with system setup, resource selection …
Deception In Finitely Repeated Security Games, Thanh H. Nguyen, Yongzhao Wang, Arunesh Sinha, Michael P. Wellman
Deception In Finitely Repeated Security Games, Thanh H. Nguyen, Yongzhao Wang, Arunesh Sinha, Michael P. Wellman
Research Collection School Of Computing and Information Systems
Allocating resources to defend targets from attack is often complicated by uncertainty about the attacker’s capabilities, objectives, or other underlying characteristics. In a repeated interaction setting, the defender can collect attack data over time to reduce this uncertainty and learn an effective defense. However, a clever attacker can manipulate the attack data to mislead the defender, influencing the learning process toward its own benefit. We investigate strategic deception on the part of an attacker with private type information, who interacts repeatedly with a defender. We present a detailed computation and analysis of both players’ optimal strategies given the attacker may …