Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (8549)
- Computer Sciences (8532)
- Databases and Information Systems (3451)
- Software Engineering (2164)
- Artificial Intelligence and Robotics (1697)
-
- Information Security (1067)
- Numerical Analysis and Scientific Computing (1024)
- Engineering (956)
- Graphics and Human Computer Interfaces (933)
- Social and Behavioral Sciences (734)
- Business (686)
- Computer Engineering (512)
- Theory and Algorithms (493)
- Operations Research, Systems Engineering and Industrial Engineering (417)
- Programming Languages and Compilers (379)
- OS and Networks (323)
- Communication (310)
- Social Media (248)
- Public Affairs, Public Policy and Public Administration (227)
- Transportation (204)
- Medicine and Health Sciences (186)
- Education (180)
- Management Information Systems (178)
- Data Storage Systems (176)
- E-Commerce (151)
- International and Area Studies (125)
- Asian Studies (124)
- Digital Communications and Networking (123)
- Technology and Innovation (114)
- Health Information Technology (113)
- Keyword
-
- Machine learning (125)
- Deep learning (124)
- Social media (80)
- Artificial intelligence (72)
- Reinforcement learning (69)
-
- Data mining (65)
- Privacy (65)
- Cloud computing (58)
- Deep Learning (56)
- Empirical study (55)
- Optimization (55)
- Security (54)
- Singapore (52)
- Visualization (52)
- Task analysis (50)
- Twitter (50)
- Neural networks (49)
- Online learning (49)
- Software engineering (49)
- Training (49)
- Anomaly detection (47)
- Feature extraction (46)
- Collaboration (45)
- Large Language Models (45)
- Blockchain (44)
- Semantics (43)
- Access control (41)
- Algorithms (40)
- Android (39)
- Natural language processing (39)
- Publication Year
- File Type
Articles 2401 - 2430 of 8722
Full-Text Articles in Entire DC Network
Unified And Incremental Simrank: Index-Free Approximation With Scheduled Principle (Extended Abstract), Fanwei Zhu, Yuan Fang, Kai Zhang, Kevin Chen-Chuan Chang, Hongtai Cao, Zhen Jiang, Minghui Wu
Unified And Incremental Simrank: Index-Free Approximation With Scheduled Principle (Extended Abstract), Fanwei Zhu, Yuan Fang, Kai Zhang, Kevin Chen-Chuan Chang, Hongtai Cao, Zhen Jiang, Minghui Wu
Research Collection School Of Computing and Information Systems
SimRank is a popular link-based similarity measure on graphs. It enables a variety of applications with different modes of querying. In this paper, we propose UISim, a unified and incremental framework for all SimRank modes based on a scheduled approximation principle. UISim processes queries with incremental and prioritized exploration of the entire computation space, and thus allows flexible tradeoff of time and accuracy. On the other hand, it creates and shares common “building blocks” for online computation without relying on indexes, and thus is efficient to handle both static and dynamic graphs. Our experiments on various real-world graphs show that …
Simple Or Complex? Together For A More Accurate Just-In-Time Defect Predictor, Xin Zhou, Donggyun Han, David Lo
Simple Or Complex? Together For A More Accurate Just-In-Time Defect Predictor, Xin Zhou, Donggyun Han, David Lo
Research Collection School Of Computing and Information Systems
Just-In-Time (JIT) defect prediction aims to automatically predict whether a commit is defective or not, and has been widely studied in recent years. In general, most studies can be classified into two categories: 1) simple models using traditional machine learning classifiers with hand-crafted features, and 2) complex models using deep learning techniques to automatically extract features. Hand-crafted features used by simple models are based on expert knowledge but may not fully represent the semantic meaning of the commits. On the other hand, deep learning-based features used by complex models represent the semantic meaning of commits but may not reflect useful …
On The Transferability Of Pre-Trained Language Models For Low-Resource Programming Languages, Fuxiang Chen, Fatemeh H. Fard, David Lo, Timofey Bryksin
On The Transferability Of Pre-Trained Language Models For Low-Resource Programming Languages, Fuxiang Chen, Fatemeh H. Fard, David Lo, Timofey Bryksin
Research Collection School Of Computing and Information Systems
A recent study by Ahmed and Devanbu reported that using a corpus of code written in multilingual datasets to fine-tune multilingual Pre-trained Language Models (PLMs) achieves higher performance as opposed to using a corpus of code written in just one programming language. However, no analysis was made with respect to fine-tuning monolingual PLMs. Furthermore, some programming languages are inherently different and code written in one language usually cannot be interchanged with the others, i.e., Ruby and Java code possess very different structure. To better understand how monolingual and multilingual PLMs affect different programming languages, we investigate 1) the performance of …
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 …
Arsearch: Searching For Api Related Resources From Stack Overflow And Github, Kien Luong, Ferdian Thung, David Lo
Arsearch: Searching For Api Related Resources From Stack Overflow And Github, Kien Luong, Ferdian Thung, David Lo
Research Collection School Of Computing and Information Systems
Stack Overflow and GitHub are two popular platforms containing API-related resources for developers to learn how to use APIs. The platforms are good sources for information about API such as code examples, usages, sentiment, bug reports, etc. However, it is difficult to collect the correct resources regarding a particular API due to the ambiguity of an API method name. An API method name mentioned in the text would only refer to one API, but the method name could match with different APIs. To help people in finding the correct resources for a particular API, we introduce ARSearch. ARSearch finds Stack …
Shieldfl: Mitigating Model Poisoning Attacks In Privacy-Preserving Federated Learning, Zhuoran Ma, Jianfeng Ma, Yinbin Miao, Yingjiu Li, Robert H. Deng
Shieldfl: Mitigating Model Poisoning Attacks In Privacy-Preserving Federated Learning, Zhuoran Ma, Jianfeng Ma, Yinbin Miao, Yingjiu Li, Robert H. Deng
Research Collection School Of Computing and Information Systems
Privacy-Preserving Federated Learning (PPFL) is an emerging secure distributed learning paradigm that aggregates user-trained local gradients into a federated model through a cryptographic protocol. Unfortunately, PPFL is vulnerable to model poisoning attacks launched by a Byzantine adversary, who crafts malicious local gradients to harm the accuracy of the federated model. To resist model poisoning attacks, existing defense strategies focus on identifying suspicious local gradients over plaintexts. However, the Byzantine adversary submits encrypted poisonous gradients to circumvent existing defense strategies in PPFL, resulting in encrypted model poisoning. To address the issue, in this paper we design a privacy-preserving defense strategy using …
Surveying Structural Complexity In Quantum Many-Body Systems, Whei Yeap Suen, Thomas J. Elliott, Jayne Thompson, Andrew J. P. Garner, John R. Mahoney, Vlatko Vedral, Mile Gu
Surveying Structural Complexity In Quantum Many-Body Systems, Whei Yeap Suen, Thomas J. Elliott, Jayne Thompson, Andrew J. P. Garner, John R. Mahoney, Vlatko Vedral, Mile Gu
Research Collection School Of Computing and Information Systems
Quantum many-body systems exhibit a rich and diverse range of exotic behaviours, owing to their underlying non-classical structure. These systems present a deep structure beyond those that can be captured by measures of correlation and entanglement alone. Using tools from complexity science, we characterise such structure. We investigate the structural complexities that can be found within the patterns that manifest from the observational data of these systems. In particular, using two prototypical quantum many-body systems as test cases-the one-dimensional quantum Ising and Bose-Hubbard models-we explore how different information-theoretic measures of complexity are able to identify different features of such patterns. …
On Explaining Multimodal Hateful Meme Detection Models, Ming Shan Hee, Roy Ka-Wei Lee, Wen Haw Chong
On Explaining Multimodal Hateful Meme Detection Models, Ming Shan Hee, Roy Ka-Wei Lee, Wen Haw Chong
Research Collection School Of Computing and Information Systems
Hateful meme detection is a new multimodal task that has gained significant traction in academic and industry research communities. Recently, researchers have applied pre-trained visual-linguistic models to perform the multimodal classification task, and some of these solutions have yielded promising results. However, what these visual-linguistic models learn for the hateful meme classification task remains unclear. For instance, it is unclear if these models are able to capture the derogatory or slurs references in multimodality (i.e., image and text) of the hateful memes. To fill this research gap, this paper propose three research questions to improve our understanding of these visual-linguistic …
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 …
Comai: Enabling Lightweight, Collaborative Intelligence By Retrofitting Vision Dnns, Kasthuri Jayarajah, Dhanuja Wanniarachchige, Tarek Abdelzaher, Archan Misra
Comai: Enabling Lightweight, Collaborative Intelligence By Retrofitting Vision Dnns, Kasthuri Jayarajah, Dhanuja Wanniarachchige, Tarek Abdelzaher, Archan Misra
Research Collection School Of Computing and Information Systems
While Deep Neural Network (DNN) models have transformed machine vision capabilities, their extremely high computational complexity and model sizes present a formidable deployment roadblock for AIoT applications. We show that the complexity-vs-accuracy-vs-communication tradeoffs for such DNN models can be significantly addressed via a novel, lightweight form of “collaborative machine intelligence” that requires only runtime changes to the inference process. In our proposed approach, called ComAI, the DNN pipelines of different vision sensors share intermediate processing state with one another, effectively providing hints about objects located within their mutually-overlapping Field-of-Views (FoVs). CoMAI uses two novel techniques: (a) a secondary shallow ML …
Gesturelens: Visual Analysis Of Gestures In Presentation Videos, Haipeng Zeng, Xingbo Wang, Yong Wang, Aoyu Wu, Ting Chuen Pong, Huamin Qu
Gesturelens: Visual Analysis Of Gestures In Presentation Videos, Haipeng Zeng, Xingbo Wang, Yong Wang, Aoyu Wu, Ting Chuen Pong, Huamin Qu
Research Collection School Of Computing and Information Systems
Appropriate gestures can enhance message delivery and audience engagement in both daily communication and public presentations. In this paper, we contribute a visual analytic approach that assists professional public speaking coaches in improving their practice of gesture training through analyzing presentation videos. Manually checking and exploring gesture usage in the presentation videos is often tedious and time-consuming. There lacks an efficient method to help users conduct gesture exploration, which is challenging due to the intrinsically temporal evolution of gestures and their complex correlation to speech content. In this paper, we propose GestureLens, a visual analytics system to facilitate gesture-based and …
Ampsum: Adaptive Multiple-Product Summarization Towards Improving Recommendation Captions, Quoc Tuan Truong, Hady Wirawan Lauw, Changhe Yuan, Jin Li, Jim Chan, Soo-Min Pantel, Hady W. Lauw
Ampsum: Adaptive Multiple-Product Summarization Towards Improving Recommendation Captions, Quoc Tuan Truong, Hady Wirawan Lauw, Changhe Yuan, Jin Li, Jim Chan, Soo-Min Pantel, Hady W. Lauw
Research Collection School Of Computing and Information Systems
In e-commerce websites, multiple related product recommendations are usually organized into “widgets”, each given a name, as a recommendation caption, to describe the products within. These recommendation captions are usually manually crafted and generic in nature, making it difficult to attach meaningful and informative names at scale. As a result, the captions are inadequate in helping customers to better understand the connection between the multiple recommendations and make faster product discovery.We propose an Adaptive Multiple-Product Summarization framework (AmpSum) that automatically and adaptively generates widget captions based on different recommended products. The multiplicity of products to be summarized in a widget …
Victor: An Implicit Approach To Mitigate Misinformation Via Continuous Verification Reading, Kuan-Chieh Lo, Shih-Chieh Dai, Aiping Xiong, Jing Jiang, Lun-Wei Ku
Victor: An Implicit Approach To Mitigate Misinformation Via Continuous Verification Reading, Kuan-Chieh Lo, Shih-Chieh Dai, Aiping Xiong, Jing Jiang, Lun-Wei Ku
Research Collection School Of Computing and Information Systems
We design and evaluate VICTOR, an easy-to-apply module on top of a recommender system to mitigate misinformation. VICTOR takes an elegant, implicit approach to deliver fake-news verifications, such that readers of fake news can continuously access more verified news articles about fake-news events without explicit correction. We frame fake-news intervention within VICTOR as a graph-based question-answering (QA) task, with Q as a fake-news article and A as the corresponding verified articles. Specifically, VICTOR adopts reinforcement learning: it first considers fake-news readers’ preferences supported by underlying news recommender systems and then directs their reading sequence towards the verified news articles. To …
Chatbot4qr: Interactive Query Refinement For Technical Question Retrieval, Neng Zhang, Qiao Huang, Xin Xia, Ying Zou, David Lo, Zhenchang Xing
Chatbot4qr: Interactive Query Refinement For Technical Question Retrieval, Neng Zhang, Qiao Huang, Xin Xia, Ying Zou, David Lo, Zhenchang Xing
Research Collection School Of Computing and Information Systems
Technical Q&A sites (e.g., Stack Overflow(SO)) are important resources for developers to search for knowledge about technical problems. Search engines provided in Q&A sites and information retrieval approaches have limited capabilities to retrieve relevant questions when queries are imprecisely specified, such as missing important technical details (e.g., the user's preferred programming languages). Although many automatic query expansion approaches have been proposed to improve the quality of queries by expanding queries with relevant terms, the information missed is not identified. Moreover, without user involvement, the existing query expansion approaches may introduce unexpected terms and lead to undesired results. In this paper, …
Securead: A Secure Video Anomaly Detection Framework On Convolutional Neural Network In Edge Computing Environment, Hang Cheng, Ximeng Liu, Huaxiong Wang, Yan Fang, Meiqing Wang, Xiaopeng Zhao
Securead: A Secure Video Anomaly Detection Framework On Convolutional Neural Network In Edge Computing Environment, Hang Cheng, Ximeng Liu, Huaxiong Wang, Yan Fang, Meiqing Wang, Xiaopeng Zhao
Research Collection School Of Computing and Information Systems
Anomaly detection offers a powerful approach to identifying unusual activities and uncommon behaviors in real-world video scenes. At present, convolutional neural networks (CNN) have been widely used to tackle anomalous events detection, which mainly rely on its stronger ability of feature representation than traditional hand-crafted features. However, massive video data and high cost of CNN model training are a challenge to achieve satisfactory detection results for resource-limited users. In this paper, we propose a secure video anomaly detection framework (SecureAD) based on CNN. Specifically, we introduce additive secret sharing to design several calculation protocols for achieving safe CNN training and …
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 …
Learning Scenario Representation For Solving Two-Stage Stochastic Integer Programs, Yaoxin Wu, Wen Song, Zhiguang Cao, Jie Zhang
Learning Scenario Representation For Solving Two-Stage Stochastic Integer Programs, Yaoxin Wu, Wen Song, Zhiguang Cao, Jie Zhang
Research Collection School Of Computing and Information Systems
Many practical combinatorial optimization problems under uncertainty can be modeled as stochastic integer programs (SIPs), which are extremely challenging to solve due to the high complexity. To solve two-stage SIPs efficiently, we propose a conditional variational autoencoder (CVAE) based method to learn scenario representation for a class of SIP instances. Specifically, we design a graph convolutional network based encoder to embed each scenario with the deterministic part of its instance (i.e. context) into a low-dimensional latent space, from which a decoder reconstructs the scenario from its latent representation conditioned on the context. Such a design effectively captures the dependencies of …
Resil: Revivifying Function Signature Inference Using Deep Learning With Domain-Specific Knowledge, Yan Lin, Debin Gao, David Lo
Resil: Revivifying Function Signature Inference Using Deep Learning With Domain-Specific Knowledge, Yan Lin, Debin Gao, David Lo
Research Collection School Of Computing and Information Systems
Function signature recovery is important for binary analysis and security enhancement, such as bug finding and control-flow integrity enforcement. However, binary executables typically have crucial information vital for function signature recovery stripped off during compilation. To make things worse, recent studies show that many compiler optimization strategies further complicate the recovery of function signatures with intended violations to function calling conventions.In this paper, we first perform a systematic study to quantify the extent to which compiler optimizations (negatively) impact the accuracy of existing deep learning techniques for function signature recovery. Our experiments show that a state-of-the-art deep learning technique has …
On Size-Oriented Long-Tailed Graph Classification Of Graph Neural Networks, Zemin Liu, Qiheng Mao, Chenghao Liu, Yuan Fang, Jianling Sun
On Size-Oriented Long-Tailed Graph Classification Of Graph Neural Networks, Zemin Liu, Qiheng Mao, Chenghao Liu, Yuan Fang, Jianling Sun
Research Collection School Of Computing and Information Systems
The prevalence of graph structures attracts a surge of investigation on graph data, enabling several downstream tasks such as multigraph classification. However, in the multi-graph setting, graphs usually follow a long-tailed distribution in terms of their sizes, i.e., the number of nodes. In particular, a large fraction of tail graphs usually have small sizes. Though recent graph neural networks (GNNs) can learn powerful graph-level representations, they treat the graphs uniformly and marginalize the tail graphs which suffer from the lack of distinguishable structures, resulting in inferior performance on tail graphs. To alleviate this concern, in this paper we propose a …
Computableviz: Mathematical Operators As A Formalism For Visualization Processing And Analysis, Aoyu Wu, Wai Tong, Haotian Li, Dominik Moritz, Yong Wang, Huamin. Qu
Computableviz: Mathematical Operators As A Formalism For Visualization Processing And Analysis, Aoyu Wu, Wai Tong, Haotian Li, Dominik Moritz, Yong Wang, Huamin. Qu
Research Collection School Of Computing and Information Systems
Data visualizations are created and shared on the web at an unprecedented speed, raising new needs and questions for processing and analyzing visualizations after they have been generated and digitized. However, existing formalisms focus on operating on a single visualization instead of multiple visualizations, making it challenging to perform analysis tasks such as sorting and clustering visualizations. Through a systematic analysis of previous work, we abstract visualization-related tasks into mathematical operators such as union and propose a design space of visualization operations. We realize the design by developing ComputableViz, a library that supports operations on multiple visualization specifications. To demonstrate …
Cost: Contrastive Learning Of Disentangled Seasonal-Trend Representations For Time Series Forecasting, Gerald Woo, Chenghao Liu, Doyen Sahoo, Akshat Kumar, Steven Hoi
Cost: Contrastive Learning Of Disentangled Seasonal-Trend Representations For Time Series Forecasting, Gerald Woo, Chenghao Liu, Doyen Sahoo, Akshat Kumar, Steven Hoi
Research Collection School Of Computing and Information Systems
Deep learning has been actively studied for time series forecasting, and the mainstream paradigm is based on the end-to-end training of neural network architectures, ranging from classical LSTM/RNNs to more recent TCNs and Transformers. Motivated by the recent success of representation learning in computer vision and natural language processing, we argue that a more promising paradigm for time series forecasting, is to first learn disentangled feature representations, followed by a simple regression fine-tuning step – we justify such a paradigm from a causal perspective. Following this principle, we propose a new time series representation learning framework for long sequence time …
Asteroids: Exploring Swarms Of Mini-Telepresence Robots For Physical Skill Demonstration, Jiannan Li, Maurício Sousa, Chu Li, Jessie Liu, Yan Chen, Ravin Balakrishnan, Tovi Grossman
Asteroids: Exploring Swarms Of Mini-Telepresence Robots For Physical Skill Demonstration, Jiannan Li, Maurício Sousa, Chu Li, Jessie Liu, Yan Chen, Ravin Balakrishnan, Tovi Grossman
Research Collection School Of Computing and Information Systems
Online synchronous tutoring allows for immediate engagement between instructors and audiences over distance. However, tutoring physical skills remains challenging because current telepresence approaches may not allow for adequate spatial awareness, viewpoint control of the demonstration activities scattered across an entire work area, and the instructor’s sufficient awareness of the audience. We present Asteroids, a novel approach for tangible robotic telepresence, to enable workbench-scale physical embodiments of remote people and tangible interactions by the instructor. With Asteroids, the audience can actively control a swarm of mini-telepresence robots, change camera positions, and switch to other robots’ viewpoints. Demonstrators can perceive the audiences’ …
Immersivepov: Filming How-To Videos With A Head-Mounted 360° Action Camera, Kevin Huang, Jiannan Li, Maurício Sousa, Tovi Grossman
Immersivepov: Filming How-To Videos With A Head-Mounted 360° Action Camera, Kevin Huang, Jiannan Li, Maurício Sousa, Tovi Grossman
Research Collection School Of Computing and Information Systems
How-to videos are often shot using camera angles that may not be optimal for learning motor tasks, with a prevalent use of third-person perspective. We present immersivePOV, an approach to film how-to videos from an immersive first-person perspective using a head-mounted 360° action camera. immersivePOV how-to videos can be viewed in a Virtual Reality headset, giving the viewer an eye-level viewpoint with three Degrees of Freedom. We evaluated our approach with two everyday motor tasks against a baseline first-person perspective and a third-person perspective. In a between-subjects study, participants were assigned to watch the task videos and then replicate the …
Learning For Amalgamation: A Multi-Source Transfer Learning Framework For Sentiment Classification, Cuong V. Nguyen, Khiem H. Le, Hong Quang Pham, Quang H. Pham, Binh T. Nguyen
Learning For Amalgamation: A Multi-Source Transfer Learning Framework For Sentiment Classification, Cuong V. Nguyen, Khiem H. Le, Hong Quang Pham, Quang H. Pham, Binh T. Nguyen
Research Collection School Of Computing and Information Systems
Transfer learning plays an essential role in Deep Learning, which can remarkably improve the performance of the target domain, whose training data is not sufficient. Our work explores beyond the common practice of transfer learning with a single pre-trained model. We focus on the task of Vietnamese sentiment classification and propose LIFA, a framework to learn a unified embedding from several pre-trained models. We further propose two more LIFA variants that encourage the pre-trained models to either cooperate or compete with one another. Studying these variants sheds light on the success of LIFA by showing that sharing knowledge among the …
Sibnet: Food Instance Counting And Segmentation, Huu-Thanh. Nguyen, Chong-Wah Ngo, Wing-Kwong Chan
Sibnet: Food Instance Counting And Segmentation, Huu-Thanh. Nguyen, Chong-Wah Ngo, Wing-Kwong Chan
Research Collection School Of Computing and Information Systems
Food computing has recently attracted considerable research attention due to its significance for health risk analysis. In the literature, the majority of research efforts are dedicated to food recognition. Relatively few works are conducted for food counting and segmentation, which are essential for portion size estimation. This paper presents a deep neural network, named SibNet, for simultaneous counting and extraction of food instances from an image. The problem is challenging due to varying size and shape of food as well as arbitrary viewing angle of camera, not to mention that food instances often occlude each other. SibNet is novel for …
Fine-Grained Detection Of Academic Emotions With Spatial Temporal Graph Attention Networks Using Facial Landmarks, Hua Leong Fwa
Fine-Grained Detection Of Academic Emotions With Spatial Temporal Graph Attention Networks Using Facial Landmarks, Hua Leong Fwa
Research Collection School Of Computing and Information Systems
With the incidence of the Covid-19 pandemic, institutions have adopted online learning as the main lessondelivery channel. A common criticism of online learning is that sensing of learners’ affective states such asengagement is lacking which degrades the quality of teaching. In this study, we propose automatic sensing of learners’ affective states in an online setting with web cameras capturing their facial landmarks and head poses. We postulate that the sparsely connected facial landmarks can be modelled using a Graph Neural Network. Using the publicly available in the wild DAiSEE dataset, we modelled both the spatial and temporal dimensions of the …
Algorithm Selection For The Team Orienteering Problem, Mustafa Misir, Aldy Gunawan, Pieter Vansteenwegen
Algorithm Selection For The Team Orienteering Problem, Mustafa Misir, Aldy Gunawan, Pieter Vansteenwegen
Research Collection School Of Computing and Information Systems
This work utilizes Algorithm Selection for solving the Team Orienteering Problem (TOP). The TOP is an NP-hard combinatorial optimization problem in the routing domain. This problem has been modelled with various extensions to address different real-world problems like tourist trip planning. The complexity of the problem motivated to devise new algorithms. However, none of the existing algorithms came with the best performance across all the widely used benchmark instances. This fact suggests that there is a performance gap to fill. This gap can be targeted by developing more new algorithms as attempted by many researchers before. An alternative strategy is …
Metaheuristics For Time-Dependent Vehicle Routing Problem With Time Windows, Yun-C Liang, Vanny Minanda, Aldy Gunawan, Hsiang-L. Chen
Metaheuristics For Time-Dependent Vehicle Routing Problem With Time Windows, Yun-C Liang, Vanny Minanda, Aldy Gunawan, Hsiang-L. Chen
Research Collection School Of Computing and Information Systems
Vehicle routing problem (VRP), a combinatorial problem, deals with the vehicle’s capacity visiting a particular set of nodes while its variants attempt to fit real-world scenarios. Our study aims to minimise total travelling time, total distance, and the number of vehicles under time-dependent and time windows constraints (TDVRPTW). The harmony search algorithm (HSA) focuses on the harmony memory and pitch adjustment mechanism for new solution construction. Several local search operators and a roulette wheel for the performance improvement were verified via 56 Solomon’s VRP instances by adding a speed matrix. The performance comparison with a genetic algorithm (GA) was completed …
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 …
Internet Privacy Concerns Revisited: Oversight From Surveillance And Right To Be Forgotten As New Dimensions, Gaurav Bansal, Fiona Fui-Hoon Nah
Internet Privacy Concerns Revisited: Oversight From Surveillance And Right To Be Forgotten As New Dimensions, Gaurav Bansal, Fiona Fui-Hoon Nah
Research Collection School Of Computing and Information Systems
In the post-Snowden revelation era, concerns related to government surveillance and oversight have come to the forefront. The ability of the Internet to remember “everything” (or forget anything) also raises a privacy concern associated with the right to be forgotten (RTBF). In this paper, we examine the conceptualization of Internet privacy concerns (IPC) by extending Hong and Thong's (2013) model with the addition of two dimensions: oversight (i.e., due to surveillance) and the RTBF. We provide theoretical and empirical evidence for our proposed integrated conceptualization. Data were collected from Amazon's Mechanical Turk and analyzed with structural equation modeling using a …