Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Computer Sciences (431)
- Physical Sciences and Mathematics (431)
- Data Storage Systems (175)
- Databases and Information Systems (165)
- Software Engineering (125)
-
- Digital Communications and Networking (123)
- Computer and Systems Architecture (89)
- Graphics and Human Computer Interfaces (68)
- OS and Networks (33)
- Artificial Intelligence and Robotics (31)
- Information Security (29)
- Social and Behavioral Sciences (25)
- Business (15)
- Theory and Algorithms (15)
- Communication (14)
- Social Media (12)
- Hardware Systems (9)
- Robotics (9)
- Technology and Innovation (8)
- Numerical Analysis and Scientific Computing (7)
- Programming Languages and Compilers (7)
- Public Affairs, Public Policy and Public Administration (6)
- Systems Architecture (6)
- Transportation (6)
- Asian Studies (5)
- International and Area Studies (5)
- Communication Technology and New Media (2)
- E-Commerce (2)
- Keyword
-
- Machine learning (7)
- Reinforcement learning (7)
- Data mining (6)
- Deep learning (6)
- Image search (6)
-
- Clustering (5)
- Human action recognition (5)
- Searchable encryption (5)
- Anomaly detection (4)
- Cloud security (4)
- Cloud storage (4)
- Collaboration (4)
- Data Mining (4)
- Game theory (4)
- Social media (4)
- Twitter (4)
- Unsupervised learning (4)
- Visualization (4)
- 802.11 (3)
- AoA (3)
- Artificial intelligence (3)
- Attribute-based encryption (3)
- Bag-of-words (3)
- Categorization (3)
- Click-through data (3)
- Cloud computing (3)
- Co-occurrence (3)
- Collaborative filtering (3)
- Crowdsourcing (3)
- Data integration (3)
- Publication Year
Articles 31 - 60 of 511
Full-Text Articles in Computer Engineering
Softskip: Empowering Multi-Modal Dynamic Pruning For Single-Stage Referring Comprehension, Dulanga Weerakoon, Vigneshwaran Subbaraju, Tuan Tran, Archan Misra
Softskip: Empowering Multi-Modal Dynamic Pruning For Single-Stage Referring Comprehension, Dulanga Weerakoon, Vigneshwaran Subbaraju, Tuan Tran, Archan Misra
Research Collection School Of Computing and Information Systems
Supporting real-time referring expression comprehension (REC) on pervasive devices is an important capability for human-AI collaborative tasks. Model pruning techniques, applied to DNN models, can enable real-time execution even on resource-constrained devices. However, existing pruning strategies are designed principally for uni-modal applications, and suffer a significant loss of accuracy when applied to REC tasks that require fusion of textual and visual inputs. We thus present a multi-modal pruning model, LGMDP, which uses language as a pivot to dynamically and judiciously select the relevant computational blocks that need to be executed. LGMDP also introduces a new SoftSkip mechanism, whereby 'skipped' visual …
Remgen: Remanufacturing A Random Program Generator For Compiler Testing, Haoxin Tu, He Jiang, Xiaochen Li, Zhide Zhou, Lingxiao Jiang, Lingxiao Jiang
Remgen: Remanufacturing A Random Program Generator For Compiler Testing, Haoxin Tu, He Jiang, Xiaochen Li, Zhide Zhou, Lingxiao Jiang, Lingxiao Jiang
Research Collection School Of Computing and Information Systems
Program generators play a critical role in generating bug-revealing test programs for compiler testing. However, existing program generators have been tamed nowadays (i.e., compilers have been hardened against test programs generated by them), thus calling for new solutions to improve their capability in generating bug-revealing test programs. In this study, we propose a framework named Remgen, aiming to Remanufacture a random program Generator for this purpose. RemgEnaddresses the challenges of the synthesis of diverse code snippets at a low cost and the selection of the bug-revealing code snippets for constructing new test programs. More specifically, RemgEnfirst designs a grammar-aided synthesis …
Fine-Grained And Controllably Editable Data Sharing With Accountability In Cloud Storage, Huiying Hou, Jianting Ning, Yunlei Zhao, Robert H. Deng
Fine-Grained And Controllably Editable Data Sharing With Accountability In Cloud Storage, Huiying Hou, Jianting Ning, Yunlei Zhao, Robert H. Deng
Research Collection School Of Computing and Information Systems
With the increasing cloud storage service, users can enjoy non-interactive data sharing. Nonetheless, the data owner cannot timely update the shared data all the while. To ensure the timeliness and the authoritative source of the data, some users should be allowed to update the data on behalf of an authoritative data owner without changing data source. However, this allows harmful information to be injected into the data unnoticeably. How to efficiently realize editable cloud-based data sharing supporting malicious user tracing has not been fully explored. To address the problem, we propose a fine-grained and controllably editable cloud-based data sharing scheme …
An Attribute-Aware Attentive Gcn Model For Attribute Missing In Recommendation, Fan Liu, Zhiyong Cheng, Lei Zhu, Chenghao Liu, Liqiang Nie
An Attribute-Aware Attentive Gcn Model For Attribute Missing In Recommendation, Fan Liu, Zhiyong Cheng, Lei Zhu, Chenghao Liu, Liqiang Nie
Research Collection School Of Computing and Information Systems
As important side information, attributes have been widely exploited in the existing recommender system for better performance. However, in the real-world scenarios, it is common that some attributes of items/users are missing (e.g., some movies miss the genre data). Prior studies usually use a default value (i.e., "other") to represent the missing attribute, resulting in sub-optimal performance. To address this problem, in this paper, we present an attribute-aware attentive graph convolution network (A(2)-GCN). In particular, we first construct a graph, where users, items, and attributes are three types of nodes and their associations are edges. Thereafter, we leverage the graph …
Structured Encryption For Knowledge Graphs, Yujie Xue, Lanxiang Chen, Yu Mi, Lingfang Zeng, Fatemeh Rezaeibagha, Robert H. Deng
Structured Encryption For Knowledge Graphs, Yujie Xue, Lanxiang Chen, Yu Mi, Lingfang Zeng, Fatemeh Rezaeibagha, Robert H. Deng
Research Collection School Of Computing and Information Systems
We investigate the problem of structured encryption (STE) for knowledge graphs (KGs) where the knowledge of data can be efficiently and privately queried. Presently, the application of natural language processing (NLP) for knowledge-based search is gradually emerging. Compared with the traditional search based only on keywords of documents-symmetric searchable encryption (SSE), the knowledge-based search system transforms the latent knowledge contained in documents into a semantic network as a knowledge base, which greatly improves the accuracy and relevance of search results. In order to develop a knowledge-based search, the contents of documents are analyzed and extracted using KG techniques (e.g. multi-relational …
Who Is Missing? Characterizing The Participation Of Different Demographic Groups In A Korean Nationwide Daily Conversation Corpus, Haewoon Kwak, Jisun An, Kunwoo Park
Who Is Missing? Characterizing The Participation Of Different Demographic Groups In A Korean Nationwide Daily Conversation Corpus, Haewoon Kwak, Jisun An, Kunwoo Park
Research Collection School Of Computing and Information Systems
A conversation corpus is essential to build interactive AI applications. However, the demographic information of the participants in such corpora is largely underexplored mainly due to the lack of individual data in many corpora. In this work, we analyze a Korean nationwide daily conversation corpus constructed by the National Institute of Korean Language (NIKL) to characterize the participation of different demographic (age and sex) groups in the corpus.
Freed: An Efficient Privacy-Preserving Solution For Person Re-Identification, Bowen Zhao, Yingjiu Li, Ximeng Liu, Hwee Hwa Pang, Robert H. Deng
Freed: An Efficient Privacy-Preserving Solution For Person Re-Identification, Bowen Zhao, Yingjiu Li, Ximeng Liu, Hwee Hwa Pang, Robert H. Deng
Research Collection School Of Computing and Information Systems
Person Re-IDentification (Re-ID) is a critical technology to identify a target person from captured person images by surveillance cameras. However, person Re-ID has triggered great concerns of personal image privacy. Although the law (e.g., GDPR) has stipulated person images are personal private data, there is no an efficient solution to tackle the image privacy concern for person Re-ID. To this end, we propose FREED, the first system solution for privacy-preserving person Re-ID, which supports the state-of-the-art person Re-ID operations on encrypted feature vectors of person images. To handle the encryption of feature vectors effectively and enable person Re-ID operations on …
Taxi Travel Time Based Geographically Weighted Regression Model (Gwr) For Modeling Public Housing Prices In Singapore, Yi’An Wang, Fangyi Cai, Shih-Fen Cheng, Bo Wu, Kai Cao
Taxi Travel Time Based Geographically Weighted Regression Model (Gwr) For Modeling Public Housing Prices In Singapore, Yi’An Wang, Fangyi Cai, Shih-Fen Cheng, Bo Wu, Kai Cao
Research Collection School Of Computing and Information Systems
In this research, a taxi travel time based Geographically Weighted Regression model (GWR) is proposed and utilized to model the public housing price in the case study of Singapore. In addition, a comparison between the proposed taxi data driven GWR and other models, such as ordinary least squares model (OLS), GWR model based on Euclidean distance and GWR model based on public transport travel time, have also been carried out. Results indicates that taxi travel time based GWR model has better fitting performance than the OLS model, and slightly better than the Euclidean distance-based GWR model, however, it is not …
An Empirical Study Of Memorization In Nlp, Xiaosen Zheng, Jing Jiang
An Empirical Study Of Memorization In Nlp, Xiaosen Zheng, Jing Jiang
Research Collection School Of Computing and Information Systems
A recent study by Feldman (2020) proposed a long-tail theory to explain the memorization behavior of deep learning models. However, memorization has not been empirically verified in the context of NLP, a gap addressed by this work. In this paper, we use three different NLP tasks to check if the long-tail theory holds. Our experiments demonstrate that top-ranked memorized training instances are likely atypical, and removing the top-memorized training instances leads to a more serious drop in test accuracy compared with removing training instances randomly. Furthermore, we develop an attribution method to better understand why a training instance is memorized. …
Benchmarking Library Recognition In Tweets, Ting Zhang, Divya Prabha Chandrasekaran, Ferdian Thung, David Lo
Benchmarking Library Recognition In Tweets, Ting Zhang, Divya Prabha Chandrasekaran, Ferdian Thung, David Lo
Research Collection School Of Computing and Information Systems
Software developers often use social media (such as Twitter) to shareprogramming knowledge such as new tools, sample code snippets,and tips on programming. One of the topics they talk about is thesoftware library. The tweets may contain useful information abouta library. A good understanding of this information, e.g., on thedeveloper’s views regarding a library can be beneficial to weigh thepros and cons of using the library as well as the general sentimentstowards the library. However, it is not trivial to recognize whethera word actually refers to a library or other meanings. For example,a tweet mentioning the word “pandas" may refer to …
Message-Locked Searchable Encryption: A New Versatile Tool For Secure Cloud Storage, Xueqiao Liu, Guomin Yang, Willy Susilo, Joseph Tonien, Rongmao Chen, Xixiang Lv
Message-Locked Searchable Encryption: A New Versatile Tool For Secure Cloud Storage, Xueqiao Liu, Guomin Yang, Willy Susilo, Joseph Tonien, Rongmao Chen, Xixiang Lv
Research Collection School Of Computing and Information Systems
Message-Locked Encryption (MLE) is a useful tool to enable deduplication over encrypted data in cloud storage. It can significantly improve the cloud service quality by eliminating redundancy to save storage resources, and hence user cost, and also providing defense against different types of attacks, such as duplicate faking attack and brute-force attack. A typical MLE scheme only focuses on deduplication. On the other hand, supporting search operations on stored content is another essential requirement for cloud storage. In this article, we present a message-locked searchable encryption (MLSE) scheme in a dual-server setting, which achieves simultaneously the desirable features of supporting …
Shellfusion: Answer Generation For Shell Programming Tasks Via Knowledge Fusion, Neng Zhang, Chao Liu, Xin Xia, Christoph Treude, Ying Zou, David Lo, Zibin Zheng
Shellfusion: Answer Generation For Shell Programming Tasks Via Knowledge Fusion, Neng Zhang, Chao Liu, Xin Xia, Christoph Treude, Ying Zou, David Lo, Zibin Zheng
Research Collection School Of Computing and Information Systems
Shell commands are widely used for accomplishing tasks, such as network management and file manipulation, in Unix and Linux platforms. There are a large number of shell commands available. For example, 50,000+ commands are documented in the Ubuntu Manual Pages (MPs). Quite often, programmers feel frustrated when searching and orchestrating appropriate shell commands to accomplish specific tasks. To address the challenge, the shell programming community calls for easy-to-use tutorials for shell commands. However, existing tutorials (e.g., TLDR) only cover a limited number of frequently used commands for shell beginners and provide limited support for users to search for commands by …
Pre-Training Graph Neural Networks For Link Prediction In Biomedical Networks, Yahui Long, Min Wu, Yong Liu, Yuan Fang, Chee Kong Kwoh, Jiawei Luo, Xiaoli Li
Pre-Training Graph Neural Networks For Link Prediction In Biomedical Networks, Yahui Long, Min Wu, Yong Liu, Yuan Fang, Chee Kong Kwoh, Jiawei Luo, Xiaoli Li
Research Collection School Of Computing and Information Systems
Motivation: Graphs or networks are widely utilized to model the interactions between different entities (e.g., proteins, drugs, etc) for biomedical applications. Predicting potential links in biomedical networks is important for understanding the pathological mechanisms of various complex human diseases, as well as screening compound targets for drug discovery. Graph neural networks (GNNs) have been designed for link prediction in various biomedical networks, which rely on the node features extracted from different data sources, e.g., sequence, structure and network data. However, it is challenging to effectively integrate these data sources and automatically extract features for different link prediction tasks. Results: In …
Verifiable Searchable Encryption Framework Against Insider Keyword-Guessing Attack In Cloud Storage, Yinbin Miao, Robert H. Deng, Kim-Kwang Raymond Choo, Ximeng Liu, Hongwei Li
Verifiable Searchable Encryption Framework Against Insider Keyword-Guessing Attack In Cloud Storage, Yinbin Miao, Robert H. Deng, Kim-Kwang Raymond Choo, Ximeng Liu, Hongwei Li
Research Collection School Of Computing and Information Systems
Searchable encryption (SE) allows cloud tenants to retrieve encrypted data while preserving data confidentiality securely. Many SE solutions have been designed to improve efficiency and security, but most of them are still susceptible to insider Keyword-Guessing Attacks (KGA), which implies that the internal attackers can guess the candidate keywords successfully in an off-line manner. Also in existing SE solutions, a semi-honest-but-curious cloud server may deliver incorrect search results by performing only a fraction of retrieval operations honestly (e.g., to save storage space). To address these two challenging issues, we first construct the basic Verifiable SE Framework (VSEF), which can withstand …
Improving Feature Generalizability With Multitask Learning In Class Incremental Learning, Dong Ma, Chi Ian Tang, Cecilia Mascolo
Improving Feature Generalizability With Multitask Learning In Class Incremental Learning, Dong Ma, Chi Ian Tang, Cecilia Mascolo
Research Collection School Of Computing and Information Systems
Many deep learning applications, like keyword spotting [1], [2], require the incorporation of new concepts (classes) over time, referred to as Class Incremental Learning (CIL). The major challenge in CIL is catastrophic forgetting, i.e., preserving as much of the old knowledge as possible while learning new tasks. Various techniques, such as regularization, knowledge distillation, and the use of exemplars, have been proposed to resolve this issue. However, prior works primarily focus on the incremental learning step, while ignoring the optimization during the base model training. We hypothesise that a more transferable and generalizable feature representation from the base model would …
Efficient Certificateless Multi-Copy Integrity Auditing Scheme Supporting Data Dynamics, Lei Zhou, Anmin Fu, Guomin Yang, Huaqun Wang, Yuqing Zhang
Efficient Certificateless Multi-Copy Integrity Auditing Scheme Supporting Data Dynamics, Lei Zhou, Anmin Fu, Guomin Yang, Huaqun Wang, Yuqing Zhang
Research Collection School Of Computing and Information Systems
To improve data availability and durability, cloud users would like to store multiple copies of their original files at servers. The multi-copy auditing technique is proposed to provide users with the assurance that multiple copies are actually stored in the cloud. However, most multi-replica solutions rely on Public Key Infrastructure (PKI), which entails massive overhead of certificate computation and management. In this article, we propose an efficient multi-copy dynamic integrity auditing scheme by employing certificateless signatures (named MDSS), which gets rid of expensive certificate management overhead and avoids the key escrow problem in identity-based signatures. Specifically, we improve the classic …
Batchlens: A Visualization Approach For Analyzing Batch Jobs In Cloud Systems, Shaolun Ruan, Yong Wang, Hailong Jiang, Weijia Xu, Qiang. Guan
Batchlens: A Visualization Approach For Analyzing Batch Jobs In Cloud Systems, Shaolun Ruan, Yong Wang, Hailong Jiang, Weijia Xu, Qiang. Guan
Research Collection School Of Computing and Information Systems
Cloud systems are becoming increasingly powerful and complex. It is highly challenging to identify anomalous execution behaviors and pinpoint problems by examining the overwhelming intermediate results/states in complex application workflows. Domain scientists urgently need a friendly and functional interface to understand the quality of the computing services and the performance of their applications in real time. To meet these needs, we explore data generated by job schedulers and investigate general performance metrics (e.g., utilization of CPU, memory and disk I/O). Specifically, we propose an interactive visual analytics approach, BatchLens, to provide both providers and users of cloud service with an …
Analyzing Offline Social Engagements: An Empirical Study Of Meetup Events Related To Software Development, Abhishek Sharma, Gede Artha Azriadi Prana, Anamika Sawhney, Nachiappan Nagappan, David Lo
Analyzing Offline Social Engagements: An Empirical Study Of Meetup Events Related To Software Development, Abhishek Sharma, Gede Artha Azriadi Prana, Anamika Sawhney, Nachiappan Nagappan, David Lo
Research Collection School Of Computing and Information Systems
Software developers use a variety of social mediachannels and tools in order to keep themselves up to date,collaborate with other developers, and find projects to contributeto. Meetup is one of such social media used by softwaredevelopers to organize community gatherings. We in this work,investigate the dynamics of Meetup groups and events relatedto software development. Our work is different from previouswork as we focus on the actual event and group data that wascollected using Meetup API.In this work, we performed an empirical study of eventsand groups present on Meetup which are related to softwaredevelopment. First, we identified 6,327 Meetup groups related …
Efficient Server-Aided Secure Two-Party Computation In Heterogeneous Mobile Cloud Computing, Yulin Wu, Xuan Wang, Willy Susilo, Guomin Yang, Zoe L. Jiang, Qian Chen, Peng Xu
Efficient Server-Aided Secure Two-Party Computation In Heterogeneous Mobile Cloud Computing, Yulin Wu, Xuan Wang, Willy Susilo, Guomin Yang, Zoe L. Jiang, Qian Chen, Peng Xu
Research Collection School Of Computing and Information Systems
With the ubiquity of mobile devices and rapid development of cloud computing, mobile cloud computing (MCC) has been considered as an essential computation setting to support complicated, scalable and flexible mobile applications by overcoming the physical limitations of mobile devices with the aid of cloud. In the MCC setting, since many mobile applications (e.g., map apps) interacting with cloud server and application server need to perform computation with the private data of users, it is important to realize secure computation for MCC. In this article, we propose an efficient server-aided secure two-party computation (2PC) protocol for MCC. This is the …
Which Variables Should I Log?, Zhongxin Liu, Xin Xia, David Lo, Zhenchang Xing, Ahmed E. Hassan, Shanping Li
Which Variables Should I Log?, Zhongxin Liu, Xin Xia, David Lo, Zhenchang Xing, Ahmed E. Hassan, Shanping Li
Research Collection School Of Computing and Information Systems
Developers usually depend on inserting logging statements into the source code to collect system runtime information. Such logged information is valuable for software maintenance. A logging statement usually prints one or more variables to record vital system status. However, due to the lack of rigorous logging guidance and the requirement of domain-specific knowledge, it is not easy for developers to make proper decisions about which variables to log. To address this need, in this work, we propose an approach to recommend logging variables for developers during development by learning from existing logging statements. Different from other prediction tasks in software …
Estimating Homophily In Social Networks Using Dyadic Predictions, George Berry, Antonio Sirianni, Ingmar Weber, Jisun An, Michael Macy
Estimating Homophily In Social Networks Using Dyadic Predictions, George Berry, Antonio Sirianni, Ingmar Weber, Jisun An, Michael Macy
Research Collection School Of Computing and Information Systems
Predictions of node categories are commonly used to estimate homophily and other relational properties in networks. However, little is known about the validity of using predictions for this task. We show that estimating homophily in a network is a problem of predicting categories of dyads (edges) in the graph. Homophily estimates are unbiased when predictions of dyad categories are unbiased. Node-level prediction models, such as the use of names to classify ethnicity or gender, do not generally produce unbiased predictions of dyad categories and therefore produce biased homophily estimates. Bias comes from three sources: sampling bias, correlation between model errors …
Thunderrw: An In-Memory Graph Random Walk Engine, Shixuan Sun, Yuhang Chen, Shengliang Lu, Bingsheng He, Yuchen Li
Thunderrw: An In-Memory Graph Random Walk Engine, Shixuan Sun, Yuhang Chen, Shengliang Lu, Bingsheng He, Yuchen Li
Research Collection School Of Computing and Information Systems
As random walk is a powerful tool in many graph processing, mining and learning applications, this paper proposes an efficient inmemory random walk engine named ThunderRW. Compared with existing parallel systems on improving the performance of a single graph operation, ThunderRW supports massive parallel random walks. The core design of ThunderRW is motivated by our profiling results: common RW algorithms have as high as 73.1% CPU pipeline slots stalled due to irregular memory access, which suffers significantly more memory stalls than the conventional graph workloads such as BFS and SSSP. To improve the memory efficiency, we first design a generic …
Context-Aware Outstanding Fact Mining From Knowledge Graphs, Yueji Yang, Yuchen Li, Panagiotis Karras, Anthony Tung
Context-Aware Outstanding Fact Mining From Knowledge Graphs, Yueji Yang, Yuchen Li, Panagiotis Karras, Anthony Tung
Research Collection School Of Computing and Information Systems
An Outstanding Fact (OF) is an attribute that makes a target entity stand out from its peers. The mining of OFs has important applications, especially in Computational Journalism, such as news promotion, fact-checking, and news story finding. However, existing approaches to OF mining: (i) disregard the context in which the target entity appears, hence may report facts irrelevant to that context; and (ii) require relational data, which are often unavailable or incomplete in many application domains. In this paper, we introduce the novel problem of mining Contextaware Outstanding Facts (COFs) for a target entity under a given context specified by …
Automated Taxi Queue Management At High-Demand Venues, Mengyu Ji, Shih-Fen Cheng
Automated Taxi Queue Management At High-Demand Venues, Mengyu Ji, Shih-Fen Cheng
Research Collection School Of Computing and Information Systems
In this paper, we seek to identify an effective management policy that could reduce supply-demand gaps at taxi queues serving high-density locations where demand surges frequently happen. Unlike current industry practice, which relies on broadcasting to attract taxis to come and serve the queue, we propose more proactive and adaptive approaches to handle demand surges. Our design objective is to reduce the cumulative supply-demand gaps as much as we could by sending notifications to individual taxis. To address this problem, we first propose a highly effective passenger demand prediction system that is based on the real-time flight arrival information. By …
A Lagrangian Column Generation Approach For The Probabilistic Crowdsourced Logistics Planning, Chung-Kyun Han, Shih-Fen Cheng
A Lagrangian Column Generation Approach For The Probabilistic Crowdsourced Logistics Planning, Chung-Kyun Han, Shih-Fen Cheng
Research Collection School Of Computing and Information Systems
In recent years we have increasingly seen the movement for the retail industry to move their operations online. Along the process, it has created brand new patterns for the fulfillment service, and the logistics service providers serving these retailers have no choice but to adapt. The most challenging issues faced by all logistics service providers are the highly fluctuating demands and the shortening response times. All these challenges imply that maintaining a fixed fleet will either be too costly or insufficient. One potential solution is to tap into the crowdsourced workforce. However, existing industry practices of relying on human planners …
Users’ Reception Of Product Recommendations: Analyses Based On Eye Tracking Data, Feiyan Jia, Yani Shi, Choon Ling Sia, Chuan-Hoo Tan, Fiona Fui-Hoon Nah, Keng Siau
Users’ Reception Of Product Recommendations: Analyses Based On Eye Tracking Data, Feiyan Jia, Yani Shi, Choon Ling Sia, Chuan-Hoo Tan, Fiona Fui-Hoon Nah, Keng Siau
Research Collection School Of Computing and Information Systems
Based on eye tracking technology, we study consumers’ overall attention to recommendations appearing at different time settings (i.e., early, mid, and late) and their attention to different information contained in each recommendation, such as recommendation signs, product descriptions, and reviews. By investigating consumers’ eye movement patterns and attention distributions on recommendations, we open the “black box” of why consumers’ reception to recommendations appearing at different time settings varies. The product preference construction literature and mindset theory help to explain why the early recommendations receive the most attention. The need for justification helps to explain why the late recommendations should receive …
Vibransee: Enabling Simultaneous Visible Light Communication And Sensing, Ila Nitin Gokarn, Archan Misra
Vibransee: Enabling Simultaneous Visible Light Communication And Sensing, Ila Nitin Gokarn, Archan Misra
Research Collection School Of Computing and Information Systems
Driven by the ubiquitous proliferation of low-cost LED luminaires, visible light communication (VLC) has been established as a high-speed communications technology based on the high-frequency modulation of an optical source. In parallel, Visible Light Sensing (VLS) has recently demonstrated how vision-based at-a-distance sensing of mechanical vibrations (e.g., of factory equipment) can be performed using high frequency optical strobing. However, to date, exemplars of VLC and VLS have been explored in isolation, without consideration of their mutual dependencies. In this work, we explore whether and how high-throughput VLC and high-coverage VLS can be simultaneously supported. We first demonstrate the existence of …
Addressing The ‘Unseens’: Digital Wellbeing In The Remote Workplace, Holtjona Galanxhi, Fiona Fui-Hoon Nah
Addressing The ‘Unseens’: Digital Wellbeing In The Remote Workplace, Holtjona Galanxhi, Fiona Fui-Hoon Nah
Research Collection School Of Computing and Information Systems
The ubiquity of sophisticated devices, along with uninterrupted access to the Internet and organizational computerized systems, allows for the “anyplace” workplace to be established. Technology has the potential to deliberately or inadvertently impact psychological wellbeing. Specific psychological demands are inadvertently imposed on remote employees whose permanent online presence is required. Hence, it is important to understand factors affecting digital wellbeing and steps that can be taken to maximize the wellbeing of remote employees. This paper provides suggestions for future research on studying the digital wellbeing of (fully or partially) remote employees. A research framework is proposed to demonstrate the different …
On M-Impact Regions And Standing Top-K Influence Problems, Bo Tang, Kyriakos Mouratidis, Mingji Han
On M-Impact Regions And Standing Top-K Influence Problems, Bo Tang, Kyriakos Mouratidis, Mingji Han
Research Collection School Of Computing and Information Systems
In this paper, we study the ��-impact region problem (mIR). In a context where users look for available products with top-�� queries, mIR identifies the part of the product space that attracts the most user attention. Specifically, mIR determines the kind of attribute values that lead a (new or existing) product to the top-�� result for at least a fraction of the user population. mIR has several applications, ranging from effective marketing to product improvement. Importantly, it also leads to (exact and efficient) solutions for standing top-�� impact problems, which were previously solved heuristically only, or whose current solutions face …
Ultrapin: Inferring Pin Entries Via Ultrasound, Liu, Ximing, Robert H. Deng, Robert H. Deng
Ultrapin: Inferring Pin Entries Via Ultrasound, Liu, Ximing, Robert H. Deng, Robert H. Deng
Research Collection School Of Computing and Information Systems
While PIN-based user authentication systems such as ATM have long been considered to be secure enough, they are facing new attacks, named UltraPIN, which can be launched from commodity smartphones. As a target user enters a PIN on a PIN-based user authentication system, an attacker may use UltraPIN to infer the PIN from a short distance (50 cm to 100 cm). In this process, UltraPIN leverages smartphone speakers to issue human-inaudible ultrasound signals and uses smartphone microphones to keep recording acoustic signals. It applies a series of signal processing techniques to extract high-quality feature vectors from low-energy and high-noise signals …