Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (3446)
- Software Engineering (2149)
- Artificial Intelligence and Robotics (1675)
- Information Security (1059)
- Numerical Analysis and Scientific Computing (1024)
-
- Graphics and Human Computer Interfaces (924)
- Engineering (858)
- Social and Behavioral Sciences (661)
- Business (627)
- Theory and Algorithms (493)
- Computer Engineering (431)
- Operations Research, Systems Engineering and Industrial Engineering (400)
- Programming Languages and Compilers (379)
- OS and Networks (323)
- Communication (297)
- Social Media (240)
- Public Affairs, Public Policy and Public Administration (207)
- Transportation (185)
- Medicine and Health Sciences (178)
- Education (164)
- Management Information Systems (164)
- Data Storage Systems (160)
- E-Commerce (146)
- Health Information Technology (107)
- International and Area Studies (107)
- Asian Studies (106)
- Technology and Innovation (101)
- Digital Communications and Networking (96)
- Keyword
-
- Deep learning (123)
- Machine learning (121)
- Social media (74)
- Artificial intelligence (70)
- Reinforcement learning (69)
-
- Data mining (64)
- Privacy (61)
- Cloud computing (58)
- Deep Learning (56)
- Empirical study (54)
- Optimization (53)
- Security (53)
- Visualization (51)
- Software engineering (49)
- Training (49)
- Neural networks (48)
- Online learning (48)
- Task analysis (48)
- Anomaly detection (47)
- Singapore (47)
- Twitter (46)
- Feature extraction (45)
- Blockchain (44)
- Collaboration (44)
- Large Language Models (44)
- Semantics (43)
- Access control (41)
- Algorithms (40)
- Android (39)
- Machine Learning (38)
- Publication Year
- File Type
Articles 4651 - 4680 of 8495
Full-Text Articles in Computer Sciences
Experiences In Building A Real-World Eating Recogniser, Sougata Sen, Vigneshwaran Subbaraju, Archan Misra, Rajesh Krishna Balan, Youngki Lee
Experiences In Building A Real-World Eating Recogniser, Sougata Sen, Vigneshwaran Subbaraju, Archan Misra, Rajesh Krishna Balan, Youngki Lee
Research Collection School Of Computing and Information Systems
In this paper, we describe the progressive design of the gesture recognition module of an automated food journaling system - Annapurna. Annapurna runs on a smartwatch and utilises data from the inertial sensors to first identify eating gestures, and then captures food images which are presented to the user in the form of a food journal. We detail the lessons we learnt from multiple in-the-wild studies, and show how eating recognizer is refined to tackle challenges such as (i) high gestural diversity, and (ii) non-eating activities with similar gestural signatures. Annapurna is finally robust (identifying eating across a wide diversity …
Revisiting Assert Use In Github Projects, Pavneet Singh Kochhar, David Lo
Revisiting Assert Use In Github Projects, Pavneet Singh Kochhar, David Lo
Research Collection School Of Computing and Information Systems
Assertions are often used to test the assumptions that developers have about a program. An assertion contains a boolean expression which developers believe to be true at a particular program point. It throws an error if the expression is not satisfied, which helps developers to detect and correct bugs. Since assertions make developer assumptions explicit, assertions are also believed to improve under-standability of code. Recently, Casalnuovo et al. analyse C and C++ programs to understand the relationship between assertion usage and defect occurrence. Their results show that asserts have a small effect on reducing the density of bugs and developers …
The Dark Side Of Banning Hacking Technique Discussion, Qiu-Hong Wang, Ting Zhang Le
The Dark Side Of Banning Hacking Technique Discussion, Qiu-Hong Wang, Ting Zhang Le
Research Collection School Of Computing and Information Systems
Prior studies have evidenced the effectiveness of more severe and broader enforcement in deterringcybercrimes. This study addresses the other side of the story. Our data analysis shows that theenforcement against the production / distribution / possession of computer misuse tools tends toincrease the contribution on detection and protection related posts in online hacker forums. Butthis enforcement may discourage those contributors who had originally actively contributed to theprotection discussions. Thus government regulations have to be cautiously justify the incentives ofmultiple parties in the cybersecurity context.
Measuring The Declared Sdk Versions And Their Consistency With Api Calls In Android Apps, Daoyuan Wu, Ximing Liu, Jiayun Xu, David Lo, Debin Gao
Measuring The Declared Sdk Versions And Their Consistency With Api Calls In Android Apps, Daoyuan Wu, Ximing Liu, Jiayun Xu, David Lo, Debin Gao
Research Collection School Of Computing and Information Systems
Android has been the most popular smartphone system, with multiple platform versions (e.g., KITKAT and Lollipop) active in the market. To manage the application’s compatibility with one or more platform versions, Android allows apps to declare the supported platform SDK versions in their manifest files. In this paper, we make a first effort to study this modern software mechanism. Our objective is to measure the current practice of the declared SDK versions (which we term as DSDK versions afterwards) in real apps, and the consistency between the DSDK versions and their app API calls. To this end, we perform a …
Exploiting Android System Services Through Bypassing Service Helpers, Yachong Gu, Yao Cheng, Lingyun Ying, Yemian Lu, Qi Li, Purui Su
Exploiting Android System Services Through Bypassing Service Helpers, Yachong Gu, Yao Cheng, Lingyun Ying, Yemian Lu, Qi Li, Purui Su
Research Collection School Of Computing and Information Systems
Android allows applications to communicate with system service via system service helper so that applications can use various functions wrapped in the system services. Meanwhile, system services leverage the service helpers to enforce security mechanisms, e.g. input parameter validation, to protect themselves against attacks. However, service helpers can be easily bypassed, which poses severe security and privacy threats to system services, e.g., privilege escalation, function execution without users’ interactions, system service crash, and DoS attacks. In this paper, we perform the first systematic study on such vulnerabilities and investigate their impacts. We develop a tool to analyze all system services …
Local Gaussian Processes For Efficient Fine-Grained Traffic Speed Prediction, Truc Viet Le, Richard Oentaryo, Siyuan Liu, Hoong Chuin Lau
Local Gaussian Processes For Efficient Fine-Grained Traffic Speed Prediction, Truc Viet Le, Richard Oentaryo, Siyuan Liu, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Traffic speed is a key indicator for the efficiency of an urban transportation system. Accurate modeling of the spatiotemporally varying traffic speed thus plays a crucial role in urban planning and development. This paper addresses the problem of efficient fine-grained traffic speed prediction using big traffic data obtained from static sensors. Gaussian processes (GPs) have been previously used to model various traffic phenomena, including flow and speed. However, GPs do not scale with big traffic data due to their cubic time complexity. In this work, we address their efficiency issues by proposing localGPs to learn from and make predictions for …
Webapirec: Recommending Web Apis To Software Projects Via Personalized Ranking, Ferdian Thung, Richard J. Oentaryo, David Lo, Yuan Tian
Webapirec: Recommending Web Apis To Software Projects Via Personalized Ranking, Ferdian Thung, Richard J. Oentaryo, David Lo, Yuan Tian
Research Collection School Of Computing and Information Systems
Application programming interfaces (APIs) offer a plethora of functionalities for developers to reuse without reinventing the wheel. Identifying the appropriate APIs given a project requirement is critical for the success of a project, as many functionalities can be reused to achieve faster development. However, the massive number of APIs would often hinder the developers' ability to quickly find the right APIs. In this light, we propose a new, automated approach called WebAPIRec that takes as input a project profile and outputs a ranked list of web APIs that can be used to implement the project. At its heart, WebAPIRec employs …
Online Repositioning In Bike Sharing Systems, Meghna Lowalekar, Pradeep Varakantham, Supriyo Ghosh, Sanjay Dominic Jena, Patrick Jaillet
Online Repositioning In Bike Sharing Systems, Meghna Lowalekar, Pradeep Varakantham, Supriyo Ghosh, Sanjay Dominic Jena, Patrick Jaillet
Research Collection School Of Computing and Information Systems
Due to increased traffic congestion and carbon emissions, Bike Sharing Systems (BSSs) are adopted in various cities for short distance travels, specifically for last mile transportation. The success of a bike sharing system depends on its ability to have bikes available at the "right" base stations at the "right" times. Typically, carrier vehicles are used to perform repositioning of bikes between stations so as to satisfy customer requests. Owing to the uncertainty in customer demand and day-long repositioning, the problem of having bikes available at the right base stations at the right times is a challenging one. In this paper, …
Sampling Based Approaches For Minimizing Regret In Uncertain Markov Decision Problems (Mdps), Asrar Ahmed, Pradeep Varakantham, Meghna Lowalekar, Yossiri Adulyasak, Patrick Jaillet
Sampling Based Approaches For Minimizing Regret In Uncertain Markov Decision Problems (Mdps), Asrar Ahmed, Pradeep Varakantham, Meghna Lowalekar, Yossiri Adulyasak, Patrick Jaillet
Research Collection School Of Computing and Information Systems
Markov Decision Processes (MDPs) are an effective model to represent decision processes in the presence of transitional uncertainty and reward tradeoffs. However, due to the difficulty in exactly specifying the transition and reward functions in MDPs, researchers have proposed uncertain MDP models and robustness objectives in solving those models. Most approaches for computing robust policies have focused on the computation of maximin policies which maximize the value in the worst case amongst all realisations of uncertainty. Given the overly conservative nature of maximin policies, recent work has proposed minimax regret as an ideal alternative to the maximin objective for robust …
Processing Long Queries Against Short Text: Top-K Advertisement Matching In News Stream Applications, Dongxiang Zhang, Yuchen Li, Ju Fan, Lianli Gao, Fumin Shen, Heng Tao Shen
Processing Long Queries Against Short Text: Top-K Advertisement Matching In News Stream Applications, Dongxiang Zhang, Yuchen Li, Ju Fan, Lianli Gao, Fumin Shen, Heng Tao Shen
Research Collection School Of Computing and Information Systems
Many real applications in real-time news stream advertising call for efficient processing of long queriesagainst short text. In such applications, dynamic news feeds are regarded as queries to match against anadvertisement (ad) database for retrieving the k most relevant ads. The existing approaches to keywordretrieval cannot work well in this search scenario when queries are triggered at a very high frequency.To address the problem, we introduce new techniques to significantly improve search performance. First,we devise a two-level partitioning for tight upper bound estimation and a lazy evaluation scheme to delayfull evaluation of unpromising candidates, which can bring three to four …
Well-Tuned Algorithms For The Team Orienteering Problem With Time Windows, Aldy Gunawan, Hoong Chuin Lau, Kun Lu, Lu Kun
Well-Tuned Algorithms For The Team Orienteering Problem With Time Windows, Aldy Gunawan, Hoong Chuin Lau, Kun Lu, Lu Kun
Research Collection School Of Computing and Information Systems
The Team Orienteering Problem with Time Windows (TOPTW) is the extension of the Orienteering Problem (OP) where each node is limited by a predefined time window during which the service has to start. The objective of the TOPTW is to maximize the total collected score by visiting a set of nodes with a limited number of paths. We propose two algorithms, Iterated Local Search and a hybridization of Simulated Annealing and Iterated Local Search (SAILS), to solve the TOPTW. As indicated in multiple research works on algorithms for the OP and its variants, determining appropriate parameter values in a statistical …
Collaboration In 360° Videochat: Challenges And Opportunities, Anthony Tang, Omid Fakourfar, Carman Neustaedter, Scott Bateman
Collaboration In 360° Videochat: Challenges And Opportunities, Anthony Tang, Omid Fakourfar, Carman Neustaedter, Scott Bateman
Research Collection School Of Computing and Information Systems
We designed a videochat experience where one participant can experience a remote environment from a 360° camera. This allows the remote user to view and explore the environment without necessitating interaction from the local participant. We designed and conducted an observational study to understand the experience, and the challenges that people might encounter. In a study with 32 participants (16 pairs), we found that remote participants could actively participate in the experience with the environment in ways that are not possible with current mobile video chat. However, we also found that participants had challenges in communicating location and orientation information …
Denoising Autoencoders For Fast Real-Time Traffic Estimation On Urban Road Networks, Soham Ghosh, Muhammad Tayyab Asif, Laura Wynter
Denoising Autoencoders For Fast Real-Time Traffic Estimation On Urban Road Networks, Soham Ghosh, Muhammad Tayyab Asif, Laura Wynter
Research Collection School Of Computing and Information Systems
We propose a new method for traffic state estimation applicable to large urban road networks where a significant amount of the real-time and historical data is missing. Our proposed approach involves estimating the missing historical data through low-rank matrix completion, coupled with an online estimation approach for estimating the missing real-time data. In contrast to the traditional approach, the proposed method does not require re-calibration every time new streaming data becomes available. Empirical results from two metropolitan cities show that the proposed two-step approach provides comparable accuracy to a state of the art benchmark method while achieving two orders of …
Exception Handling Bug Hazards In Android: Results From A Mining Study And An Exploratory Survey, Roberta Coelho, Lucas Almeida, Georgios Gousios, Arie Van Deursen, Christoph Treude
Exception Handling Bug Hazards In Android: Results From A Mining Study And An Exploratory Survey, Roberta Coelho, Lucas Almeida, Georgios Gousios, Arie Van Deursen, Christoph Treude
Research Collection School Of Computing and Information Systems
Adequate handling of exceptions has proven difficult for many software engineers. Mobile app developers in particular, have to cope with compatibility, middleware, memory constraints, and battery restrictions. The goal of this paper is to obtain a thorough understanding of common exception handling bug hazards that app developers face. To that end, we first provide a detailed empirical study of over 6,000 Java exception stack traces we extracted from over 600 open source Android projects. Key insights from this study include common causes for system crashes, and common chains of wrappings between checked and unchecked exceptions. Furthermore, we provide a survey …
Using Contextual Information To Predict Co-Changes, Igor Scaliante Wiese, Reginaldo Ré, Igor Steinmacher, Rodrigo Takashi Kuroda, Gustavo A. Oliva, Christoph Treude, Marco Aurélio Gerosa
Using Contextual Information To Predict Co-Changes, Igor Scaliante Wiese, Reginaldo Ré, Igor Steinmacher, Rodrigo Takashi Kuroda, Gustavo A. Oliva, Christoph Treude, Marco Aurélio Gerosa
Research Collection School Of Computing and Information Systems
Background: Co-change prediction makes developers aware of which artifacts will change together with the artifact they are working on. In the past, researchers relied on structural analysis to build prediction models. More recently, hybrid approaches relying on historical information and textual analysis have been proposed. Despite the advances in the area, software developers still do not use these approaches widely, presumably because of the number of false recommendations. We conjecture that the contextual information of software changes collected from issues, developers’ communication, and commit metadata captures the change patterns of software artifacts and can improve the prediction models. Objective: Our …
On The Similarities Between Random Regret Minimization And Mother Logit: The Case Of Recursive Route Choice Models, Tien Mai, Fabian Bastin, Emma Frejinger
On The Similarities Between Random Regret Minimization And Mother Logit: The Case Of Recursive Route Choice Models, Tien Mai, Fabian Bastin, Emma Frejinger
Research Collection School Of Computing and Information Systems
This paper focuses on the comparison of the random regret minimization (RRM) and mother logit models for analyzing the choice between alternatives having deterministic attributes. The mother logit model allows utilities of a given alternative to depend on attributes of other alternatives. It was designed to relax the independence from irrelevant alternatives (IIA) property while keeping the random terms independently and identically distributed extreme value distributed (McFadden et al., 1978).We adapt and extend the RRM model proposed by Chorus (2014) to the case of recursive logit (RL) route choice models (Fosgerau et al., 2013). We argue that these RRM models …
Is The Whole Greater Than The Sum Of Its Parts?, Liangyue Li, Hanghang Tong, Yong Wang, Conglei Shi, Nan Cao, Norbou Buchler
Is The Whole Greater Than The Sum Of Its Parts?, Liangyue Li, Hanghang Tong, Yong Wang, Conglei Shi, Nan Cao, Norbou Buchler
Research Collection School Of Computing and Information Systems
The PART-WHOLE relationship routinely finds itself in many disciplines, ranging from collaborative teams, crowdsourcing, autonomous systems to networked systems. From the algorithmic perspective, the existing work has primarily focused on predicting the outcomes of the whole and parts, by either separate models or linear joint models, which assume the outcome of the parts has a linear and independent effect on the outcome of the whole. In this paper, we propose a joint predictive method named PAROLE to simultaneously and mutually predict the part and whole outcomes. The proposed method offers two distinct advantages over the existing work. First (Model Generality), …
Online Advertising, Retail Platform Openness, And Long Tail Sellers, Jianqing Chen, Zhiling Guo
Online Advertising, Retail Platform Openness, And Long Tail Sellers, Jianqing Chen, Zhiling Guo
Research Collection School Of Computing and Information Systems
It becomes increasingly popular that some large online retailers such as Amazon open their platforms to allow third-party retail competitors to sell on their own platforms. We develop an analytical model to examine this retailer market place model and its business impact. We assume that a leading retailer has both valuation advantage that may come from its reputation and information advantage that may come from its brand awarenewss. We find that the availability of relatively low-cost advertising through social media or search engine can effectively reduce the leading retailer's information advantage, and thus be an important driving force for its …
Charitable Fundraising: Gaining Donors' Trust On Online Platforms, Deserinas Sulaeman
Charitable Fundraising: Gaining Donors' Trust On Online Platforms, Deserinas Sulaeman
Research Collection School Of Computing and Information Systems
Trust is crucial in the relationships between charitable fundraisers and potential donors. This study examines factors that can help fundraisers gain potential donors’ trust, which is crucial to the success of the campaigns. Examining charitable fundraising campaigns on an online platform, this study finds that trust issues can be mitigated by providing a campaign description that is more sophisticated, more informative, and with fewer errors. Additionally, setting a higher campaign funding goal tends to lead to a more successful campaign. These characteristics likely reflect a competent, committed, and passionate fundraiser. On the other hand, mere exposure to a wide set …
Flexible Wildcard Searchable Encryption System, Yang Yang, Ximeng Liu, Robert H. Deng, Jian Weng
Flexible Wildcard Searchable Encryption System, Yang Yang, Ximeng Liu, Robert H. Deng, Jian Weng
Research Collection School Of Computing and Information Systems
Searchable encryption is an important technique for public cloud storage service to provide user data confidentiality protection and at the same time allow users performing keyword search over their encrypted data. Previous schemes only deal with exact or fuzzy keyword search to correct some spelling errors. In this paper, we propose a new wildcard searchable encryption system to support wildcard keyword queries which has several highly desirable features. First, our system allows multiple keywords search in which any queried keyword may contain zero, one or two wildcards, and a wildcard may appear in any position of a keyword and represent …
Scan: Multi-Hop Calibration For Mobile Sensor Arrays, Balz Maag, Zimu Zhou, Olga Saukh, Lothar Thiele
Scan: Multi-Hop Calibration For Mobile Sensor Arrays, Balz Maag, Zimu Zhou, Olga Saukh, Lothar Thiele
Research Collection School Of Computing and Information Systems
Urban air pollution monitoring with mobile, portable, low-cost sensors has attracted increasing research interest for their wide spatial coverage and affordable expenses to the general public. However, low-cost air quality sensors not only drift over time but also suffer from cross-sensitivities and dependency on meteorological effects. Therefore calibration of measurements from low-cost sensors is indispensable to guarantee data accuracy and consistency to be fit for quantitative studies on air pollution. In this work we propose sensor array network calibration (SCAN), a multi-hop calibration technique for dependent low-cost sensors. SCAN is applicable to sets of co-located, heterogeneous sensors, known as sensor …
Deepmon: Mobile Gpu-Based Deep Learning Framework For Continuous Vision Applications, Nguyen Loc Huynh, Youngki Lee, Rajesh Krishna Balan
Deepmon: Mobile Gpu-Based Deep Learning Framework For Continuous Vision Applications, Nguyen Loc Huynh, Youngki Lee, Rajesh Krishna Balan
Research Collection School Of Computing and Information Systems
The rapid emergence of head-mounted devices such as the Microsoft Holo-lens enables a wide variety of continuous vision applications. Such applications often adopt deep-learning algorithms such as CNN and RNN to extract rich contextual information from the first-person-view video streams. Despite the high accuracy, use of deep learning algorithms in mobile devices raises critical challenges, i.e., high processing latency and power consumption. In this paper, we propose DeepMon, a mobile deep learning inference system to run a variety of deep learning inferences purely on a mobile device in a fast and energy-efficient manner. For this, we designed a suite of …
Bug Characteristics In Blockchain Systems: A Large-Scale Empirical Study, Zhiyuan Wan, David Lo, Xin Xia, Liang Cai
Bug Characteristics In Blockchain Systems: A Large-Scale Empirical Study, Zhiyuan Wan, David Lo, Xin Xia, Liang Cai
Research Collection School Of Computing and Information Systems
Bugs severely hurt blockchain system dependability. A thorough understanding of blockchain bug characteristics is required to design effective tools for preventing, detecting and mitigating bugs. We perform an empirical study on bug characteristics in eight representative open source blockchain systems. First, we manually examine 1,108 bug reports to understand the nature of the reported bugs. Second, we leverage card sorting to label the bug reports, and obtain ten bug categories in blockchain systems. We further investigate the frequency distribution of bug categories across projects and programming languages. Finally, we study the relationship between bug categories and bug fixing time. The …
Rack: Code Search In The Ide Using Crowdsourced Knowledge, Mohammad Masudur Rahman, Chanchal K. Roy, David Lo
Rack: Code Search In The Ide Using Crowdsourced Knowledge, Mohammad Masudur Rahman, Chanchal K. Roy, David Lo
Research Collection School Of Computing and Information Systems
Traditional code search engines often do not perform well with natural language queries since they mostly apply keyword matching. These engines thus require carefully designed queries containing information about programming APIs for code search. Unfortunately, existing studies suggest that preparing an effective query for code search is both challenging and time consuming for the developers. In this paper, we propose a novel code search tool-RACK-that returns relevant source code for a given code search query written in natural language text. The tool first translates the query into a list of relevant API classes by mining keyword-API associations from the crowdsourced …
Cataloging Github Repositories, Abhishek Sharma, Ferdian Thung, Pavneet Singh Kochhar, Agus Sulistya, David Lo
Cataloging Github Repositories, Abhishek Sharma, Ferdian Thung, Pavneet Singh Kochhar, Agus Sulistya, David Lo
Research Collection School Of Computing and Information Systems
GitHub is one of the largest and most popular repository hosting service today, having about 14 million users and more than 54 million repositories as of March 2017. This makes it an excellent platform to find projects that developers are interested in exploring. GitHub showcases its most popular projects by cataloging them manually into categories such as DevOps tools, web application frameworks, and game engines. We propose that such cataloging should not be limited only to popular projects. We explore the possibility of developing such cataloging system by automatically extracting functionality descriptive text segments from readme files of GitHub repositories. …
An Exploratory Study Of Functionality And Learning Resources Of Web Apis On Programmableweb, Yuan Tian, Pavneet Singh Kochhar, David Lo
An Exploratory Study Of Functionality And Learning Resources Of Web Apis On Programmableweb, Yuan Tian, Pavneet Singh Kochhar, David Lo
Research Collection School Of Computing and Information Systems
Web APIs provide various functionalities that can be leveraged by developers in building their applications. ProgrammableWeb, which is the largest and most active web API and mashup collection, provides a record of thousands of web APIs and mashups. However, important properties about these large number of web APIs, such as their functionality and support/resources for learning, have never been studied by the existing research work. In this study, we perform an exploratory analysis on functionality and learning resources of 9,883 web APIs and 4,315 mashups listed on ProgrammableWeb, and find that: (1) web APIs provide a wide range of functionalities …
Breathprint: Breathing Acoustics-Based User Authentication, Jagmohan Chauhan, Yining Hu, Suranga Sereviratne, Archan Misra, Aruna Sereviratne, Youngki Lee
Breathprint: Breathing Acoustics-Based User Authentication, Jagmohan Chauhan, Yining Hu, Suranga Sereviratne, Archan Misra, Aruna Sereviratne, Youngki Lee
Research Collection School Of Computing and Information Systems
We propose BreathPrint, a new behavioural biometric signature based on audio features derived from an individual's commonplace breathing gestures. Specifically, BreathPrint uses the audio signatures associated with the three individual gestures: sniff, normal, and deep breathing, which are sufficiently different across individuals. Using these three breathing gestures, we develop the processing pipeline that identifies users via the microphone sensor on smartphones and wearable devices. In BreathPrint, a user performs breathing gestures while holding the device very close to their nose. Using off-the-shelf hardware, we experimentally evaluate the BreathPrint prototype with 10 users, observed over seven days. We show that users …
Employing Smartwatch For Enhanced Password Authentication, Bing Chang, Ximing Liu, Yingjiu Li, Pingjian Wang, Wen-Tao Zhu, Zhan Wang
Employing Smartwatch For Enhanced Password Authentication, Bing Chang, Ximing Liu, Yingjiu Li, Pingjian Wang, Wen-Tao Zhu, Zhan Wang
Research Collection School Of Computing and Information Systems
This paper presents an enhanced password authentication scheme by systematically exploiting the motion sensors in a smartwatch. We extract unique features from the sensor data when a smartwatch bearer types his/her password (or PIN), and train certain machine learning classifiers using these features. We then implement smartwatch-aided password authentication using the classifiers. Our scheme is user-friendly since it does not require users to perform any additional actions when typing passwords or PINs other than wearing smartwatches. We conduct a user study involving 51 participants on the developed prototype so as to evaluate its feasibility and performance. Experimental results show that …
Tackling Large-Scale Home Health Care Delivery Problem With Uncertainty, Cen Chen, Zachary Rubinstein, Stephen Smith, Hoong Chuin Lau
Tackling Large-Scale Home Health Care Delivery Problem With Uncertainty, Cen Chen, Zachary Rubinstein, Stephen Smith, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
In this work, we investigate a multi-period Home HealthCare Scheduling Problem (HHCSP) under stochastic serviceand travel times. We first model the deterministic problemas an integer linear programming model that incorporatesreal-world requirements, such as time windows, continuityof care, workload fairness, inter-visit temporal dependencies.We then extend the model to cope with uncertainty in durations,by introducing chance constraints into the formulation.We propose efficient solution approaches, which providequantifiable near-optimal solutions and further handlethe uncertainties by employing a sampling-based strategy. Wedemonstrate the effectiveness of our proposed approaches oninstances synthetically generated by real-world dataset forboth deterministic and stochastic scenarios.
Augmenting Decisions Of Taxi Drivers Through Reinforcement Learning For Improving Revenues, Tanvi Verma, Pradeep Varakantham, Sarit Kraus, Hoong Chuin Lau
Augmenting Decisions Of Taxi Drivers Through Reinforcement Learning For Improving Revenues, Tanvi Verma, Pradeep Varakantham, Sarit Kraus, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Taxis (which include cars working with car aggregation systems such as Uber, Grab, Lyft etc.) have become a critical component in the urban transportation. While most research and applications in the context of taxis have focused on improving performance from a customer perspective, in this paper,we focus on improving performance from a taxi driver perspective. Higher revenues for taxi drivers can help bring more drivers into the system thereby improving availability for customers in dense urban cities.Typically, when there is no customer on board, taxi driverswill cruise around to find customers either directly (on thestreet) or indirectly (due to a …