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 3091 - 3120 of 8722
Full-Text Articles in Entire DC Network
Context-Aware Retrieval-Based Deep Commit Message Generation, Haoye Wang, Xin Xia, David Lo, Qiang He, Xinyu Wang, John Grundy
Context-Aware Retrieval-Based Deep Commit Message Generation, Haoye Wang, Xin Xia, David Lo, Qiang He, Xinyu Wang, John Grundy
Research Collection School Of Computing and Information Systems
Commit messages recorded in version control systems contain valuable information for software development, maintenance, and comprehension. Unfortunately, developers often commit code with empty or poor quality commit messages. To address this issue, several studies have proposed approaches to generate commit messages from commit diffs. Recent studies make use of neural machine translation algorithms to try and translate git diffs into commit messages and have achieved some promising results. However, these learning-based methods tend to generate high-frequency words but ignore low-frequency ones. In addition, they suffer from exposure bias issues, which leads to a gap between training phase and testing phase. …
Do Blockchain And Iot Architecture Create Informedness To Support Provenance Tracking In The Product Lifecycle?, Somnath Mazumdar, Thomas Jensen, Raghava Rao Mukkamala, Robert John Kauffman, Jan Damsgaard
Do Blockchain And Iot Architecture Create Informedness To Support Provenance Tracking In The Product Lifecycle?, Somnath Mazumdar, Thomas Jensen, Raghava Rao Mukkamala, Robert John Kauffman, Jan Damsgaard
Research Collection School Of Computing and Information Systems
Consumers often lack information about the origin and provenance of the products they buy. They may ask: Is a food product truly organic? Or, what is the origin of the gemstone in the ring I purchased? They also may have sustainability concerns about the footprint of a product at the end of its life. Producers and sellers, meanwhile, wish to know how longitudinal tracking of the provenance of products and their components can boost their sales prices and after-market value, and re- veal new business opportunities. We focus on how the product lifecycle (PLC) can be leveraged to track information …
Can We Trust Your Explanations? Sanity Checks For Interpreters In Android Malware Analysis, Min Fan, Wenying Wei, Xiaofei Xie, Yang Liu, Xiaohong Guan, Ting Liu
Can We Trust Your Explanations? Sanity Checks For Interpreters In Android Malware Analysis, Min Fan, Wenying Wei, Xiaofei Xie, Yang Liu, Xiaohong Guan, Ting Liu
Research Collection School Of Computing and Information Systems
With the rapid growth of Android malware, many machine learning-based malware analysis approaches are proposed to mitigate the severe phenomenon. However, such classifiers are opaque, non-intuitive, and difficult for analysts to understand the inner decision reason. For this reason, a variety of explanation approaches are proposed to interpret predictions by providing important features. Unfortunately, the explanation results obtained in the malware analysis domain cannot achieve a consensus in general, which makes the analysts confused about whether they can trust such results. In this work, we propose principled guidelines to assess the quality of five explanation approaches by designing three critical …
Fakespotter: A Simple Yet Robust Baseline For Spotting Ai-Synthesized Fake Faces, Run Wang, Felix Juefei-Xu, Lei Ma, Xiaofei Xie, Yihao Huang, Jian Wang, Yang Liu
Fakespotter: A Simple Yet Robust Baseline For Spotting Ai-Synthesized Fake Faces, Run Wang, Felix Juefei-Xu, Lei Ma, Xiaofei Xie, Yihao Huang, Jian Wang, Yang Liu
Research Collection School Of Computing and Information Systems
In recent years, generative adversarial networks (GANs) and its variants have achieved unprecedented success in image synthesis. They are widely adopted in synthesizing facial images which brings potential security concerns to humans as the fakes spread and fuel the misinformation. However, robust detectors of these AI-synthesized fake faces are still in their infancy and are not ready to fully tackle this emerging challenge. In this work, we propose a novel approach, named FakeSpotter, based on monitoring neuron behaviors to spot AIsynthesized fake faces. The studies on neuron coverage and interactions have successfully shown that they can be served as testing …
Unsupervised Representation Learning By Predicting Random Distances, Hu Wang, Guansong Pang, Chunhua Shen, Congbo Ma
Unsupervised Representation Learning By Predicting Random Distances, Hu Wang, Guansong Pang, Chunhua Shen, Congbo Ma
Research Collection School Of Computing and Information Systems
Deep neural networks have gained great success in a broad range of tasks due to its remarkable capability to learn semantically rich features from high-dimensional data. However, they often require large-scale labelled data to successfully learn such features, which significantly hinders their adaption in unsupervised learning tasks, such as anomaly detection and clustering, and limits their applications to critical domains where obtaining massive labelled data is prohibitively expensive. To enable unsupervised learning on those domains, in this work we propose to learn features without using any labelled data by training neural networks to predict data distances in a randomly projected …
Privacy-Preserving Outsourced Clinical Decision Support System In The Cloud, Ximeng Liu, Robert H. Deng, Kim-Kwang Raymond Choo, Yang Yang
Privacy-Preserving Outsourced Clinical Decision Support System In The Cloud, Ximeng Liu, Robert H. Deng, Kim-Kwang Raymond Choo, Yang Yang
Research Collection School Of Computing and Information Systems
In this paper, we propose a privacy-preserving clinical decision support system using Naïve Bayesian (NB) classifier, hereafter referred to as Peneus, designed for the outsourced cloud computing environment. Peneus allows one to use patient health information to train the NB classifier privately, which can then be used to predict a patient's (undiagnosed) disease based on his/her symptoms in a single communication round. Specifically, we design secure Single Instruction Multiple Data (SIMD) integer circuits using the fully homomorphic encryption scheme, which can greatly increase the performance compared with the original secure integer circuit. Then, we present a privacy-preserving historical Personal Health …
Enabling Efficient Spatial Keyword Queries On Encrypted Data With Strong Security Guarantees, Xiangyu Wang, Jianfeng Ma, Feng Li, Ximeng Liu, Yinbin Miao, Robert H. Deng
Enabling Efficient Spatial Keyword Queries On Encrypted Data With Strong Security Guarantees, Xiangyu Wang, Jianfeng Ma, Feng Li, Ximeng Liu, Yinbin Miao, Robert H. Deng
Research Collection School Of Computing and Information Systems
Structured Encryption (STE), which allows a server to provide secure search services on encrypted data structures, has been widely investigated in recent years. To meet expressive search requirements in practical applications, a large number of STE constructions have been proposed either on textual keywords or spatial data. However, STE on spatio-textual data, which are widely used in location-based services, has not been fully investigated. In this paper, we formally define the notion of Spatial Keyword Structured Encryption (SKSE) and propose several concrete SKSE constructions with various efficiencysecurity trade-offs. Firstly, we propose a basic construction with linear search complexity, which only …
3d Dental Biometrics: Automatic Pose-Invariant Dental Arch Extraction And Matching, Xin Zhong, Zhiyuan Zhang
3d Dental Biometrics: Automatic Pose-Invariant Dental Arch Extraction And Matching, Xin Zhong, Zhiyuan Zhang
Research Collection School Of Computing and Information Systems
A novel automatic pose-invariant dental arch extraction and matching framework is developed for 3D dental identification using laser-scanned dental plasters. In our previous attempt [1-5], 3D point-based algorithms have been developed and they have shown a few advantages over existing 2D dental identifications. This study is a continuous effort in developing arch-based algorithms to extract and match dental arch feature in an automatic and pose-invariant way. As best as we know, this is the first attempt at automatic dental arch extraction and matching for 3D dental identification. A Radial Ray Algorithm (RRA) is proposed by projecting dental arch shape from …
Deep Unsupervised Anomaly Detection, Tangqing Li, Zheng Wang, Siying Liu, Wen-Yan Lin
Deep Unsupervised Anomaly Detection, Tangqing Li, Zheng Wang, Siying Liu, Wen-Yan Lin
Research Collection School Of Computing and Information Systems
This paper proposes a novel method to detect anomalies in large datasets under a fully unsupervised setting. The key idea behind our algorithm is to learn the representation underlying normal data. To this end, we leverage the latest clustering technique suitable for handling high dimensional data. This hypothesis provides a reliable starting point for normal data selection. We train an autoencoder from the normal data subset, and iterate between hypothesizing normal candidate subset based on clustering and representation learning. The reconstruction error from the learned autoencoder serves as a scoring function to assess the normality of the data. Experimental results …
Software Engineering In Australasia, Sherlock A. Licorish, Christoph Treude, John Grundy, Kelly Blincoe, Stephen Macdonell, Chakkrit Tantithamthavorn, Li Li, Jean-Guy Schneider
Software Engineering In Australasia, Sherlock A. Licorish, Christoph Treude, John Grundy, Kelly Blincoe, Stephen Macdonell, Chakkrit Tantithamthavorn, Li Li, Jean-Guy Schneider
Research Collection School Of Computing and Information Systems
Six months ago an important call was made for researchers globally to provide insights into the way Software Engineering is done in their region. Heeding this call, we hereby outline the position Software Engineering in Australasia (New Zealand and Australia). This article first considers the software development methods, practices and tools that are popular in the Australasian software engineering community. We then briefly review the particular strengths of software engineering researchers in Australasia. Finally, we make an open call for collaborators by reflecting on our current position and identifying future opportunities.
Facial Emotion Recognition With Noisy Multi-Task Annotations, S. Zhang, Zhiwu Huang, D.P. Paudel, Gool L. Van
Facial Emotion Recognition With Noisy Multi-Task Annotations, S. Zhang, Zhiwu Huang, D.P. Paudel, Gool L. Van
Research Collection School Of Computing and Information Systems
Human emotions can be inferred from facial expressions. However, the annotations of facial expressions are often highly noisy in common emotion coding models, including categorical and dimensional ones. To reduce human labelling effort on multi-task labels, we introduce a new problem of facial emotion recognition with noisy multitask annotations. For this new problem, we suggest a formulation from the point of joint distribution match view, which aims at learning more reliable correlations among raw facial images and multi-task labels, resulting in the reduction of noise influence. In our formulation, we exploit a new method to enable the emotion prediction and …
Proxy-Free Privacy-Preserving Task Matching With Efficient Revocation In Crowdsourcing, Jiangang Shu, Kan Yang, Xiaohua Jia, Ximeng Liu, Cong Wang, Robert H. Deng
Proxy-Free Privacy-Preserving Task Matching With Efficient Revocation In Crowdsourcing, Jiangang Shu, Kan Yang, Xiaohua Jia, Ximeng Liu, Cong Wang, Robert H. Deng
Research Collection School Of Computing and Information Systems
Task matching in crowdsourcing has been extensively explored with the increasing popularity of crowdsourcing. However, privacy of tasks and workers is usually ignored in most of exiting solutions. In this paper, we study the problem of privacy-preserving task matching for crowdsourcing with multiple requesters and multiple workers. Instead of utilizing proxy re-encryption, we propose a proxy-free task matching scheme for multi-requester/multi-worker crowdsourcing, which achieves task-worker matching over encrypted data with scalability and non-interaction. We further design two different mechanisms for worker revocation including ServerLocal Revocation (SLR) and Global Revocation (GR), which realize efficient worker revocation with minimal overhead on the …
Sustainability Of Rewards-Based Crowdfunding: A Quasi-Experimental Analysis Of Funding Targets And Backer Satisfaction, Michael Wessel, Rob Gleasure, Robert John Kauffman
Sustainability Of Rewards-Based Crowdfunding: A Quasi-Experimental Analysis Of Funding Targets And Backer Satisfaction, Michael Wessel, Rob Gleasure, Robert John Kauffman
Research Collection School Of Computing and Information Systems
Rewards-based crowdfunding presents an information asymmetry for participants due to the funding mechanism used. Campaign-backers trust creators to complete projects and deliver rewards as outlined prior to the fundraising process, but creators may discover better opportunities as they progress with a project. Despite this, the all-or-nothing (AON) mechanism on crowdfunding platforms incentivizes creators to set meager funding-targets that are easier to achieve but may offer limited slack when creators wish to simultaneously pursue emerging opportunities later in the project. We explore the related issues of how funding targets seem to be selected by the creators, and how dissatisfaction with the …
Creators And Backers In Rewards-Based Crowdfunding: Will Incentive Misalignment Affect Kickstarter's Sustainability?, Michael Wessel, Rob Gleasure, Robert John Kauffman
Creators And Backers In Rewards-Based Crowdfunding: Will Incentive Misalignment Affect Kickstarter's Sustainability?, Michael Wessel, Rob Gleasure, Robert John Kauffman
Research Collection School Of Computing and Information Systems
Incentive misalignment in rewards-based crowd-funding occurs because creators may benefit disproportionately from fundraising, while backers may benefit disproportionately from the quality of project deliverables. The resulting principal-agent relationship means backers rely on campaign information to identify signs of moral hazard, adverse selection, and risk attitude asymmetry. We analyze campaign information related to fundraising, and compare how different information affects eventual backer satisfaction, based on an extensive dataset from Kickstarter. The data analysis uses a multi-model comparison to reveal similarities and contrasts in the estimated drivers of dependent variables that capture different outcomes in Kickstarter’s funding campaigns, using a linear probability …
An Efficient Privacy Preserving Message Authentication Scheme For Internet-Of-Things, Jiannan Wei, Tran Viet Xuan Phuong, Guomin Yang
An Efficient Privacy Preserving Message Authentication Scheme For Internet-Of-Things, Jiannan Wei, Tran Viet Xuan Phuong, Guomin Yang
Research Collection School Of Computing and Information Systems
As an essential element of the next generation Internet, Internet of Things (IoT) has been undergoing an extensive development in recent years. In addition to the enhancement of peoples daily lives, IoT devices also generate/gather a massive amount of data that could be utilized by machine learning and big data analytics for different applications. Due to the machine-to-machine communication nature of IoT, data security and privacy are crucial issues that must be addressed to prevent different cyber attacks (e.g., impersonation and data pollution/poisoning attacks). Nevertheless, due to the constrained computation power and the diversity of IoT devices, it is a …
Discovering Hidden Topical Hubs And Authorities Across Multiple Online Social Networks, Ka Wei, Roy Lee, Tuan-Anh Hoang, Ee-Peng Lim
Discovering Hidden Topical Hubs And Authorities Across Multiple Online Social Networks, Ka Wei, Roy Lee, Tuan-Anh Hoang, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
Finding influential users in online social networks (OSNs) is an important problem with many possible useful applications. Many methods have been proposed to identify influential users in OSNs. PageRank and HITs are two well known examples that determine influential users through link analysis. In recent years, new models that consider both content and social network links have been developed. The Hub and Authority Topic (HAT) model is one that extends HITS to identify topic-specific hubs and authorities by jointly learning hubs, authorities, and topical interests from users’ relationship and textual content. However, many of the previous works are confined to …
The Value Of Humanization In Customer Service, Yang Gao, Huaxia Rui, Shujing Sun
The Value Of Humanization In Customer Service, Yang Gao, Huaxia Rui, Shujing Sun
Research Collection School Of Computing and Information Systems
As algorithm-based agents become increasingly capable of handling customer service queries, customers are often uncertain whether they are served by humans or algorithms, and managers are left to question the value of human agents once the technology matures. The current paper studies this question by quantifying the impact of customers' enhanced perception of being served by human agents on customer service interactions. Our identification strategy hinges on the abrupt implementation by Southwest Airlines of a signature policy, which requires the inclusion of an agent's first name in responses on Twitter, thereby making the agent more humanized in the eyes of …
Chronic Customers Or Increased Awareness? The Dynamics Of Social Media Customer Service, Shujing Sun, Yang Gao, Huaxia Rui
Chronic Customers Or Increased Awareness? The Dynamics Of Social Media Customer Service, Shujing Sun, Yang Gao, Huaxia Rui
Research Collection School Of Computing and Information Systems
Despite that social media has become a promising alternative to traditional call centers, managers hesitate to fully harness its power because they worry that active service intervention may encourage excessive use of the channel by disgruntled customers. This paper sheds light on such a concern by examining the dynamics between brand-level customer complaints and service interventions on social media. Using details of customer-brand interactions of 40 airlines on Twitter, we find that more service interventions indeed cause more customer complaints, accounting for the online customer population and service quality. However, the increased complaints are primarily driven by the awareness enhancement …
Rapid Transition Of A Technical Course From Face-To-Face To Online, Swapna Gottipatti, Venky Shankaraman
Rapid Transition Of A Technical Course From Face-To-Face To Online, Swapna Gottipatti, Venky Shankaraman
Research Collection School Of Computing and Information Systems
Just like most universities around the world, the senior management at Singapore Management University decided to move all courses to a virtual, online, synchronous mode, giving instructors a very short notice period—one week—to make this transition. In this paper, we describe the challenges, practical solutions adopted, and the lessons learnt in rapidly transitioning a face-to-face Master’s degree course in Text Analytics and Applications into a virtual, online, course format that could deliver a quality learning experience.
Towards Theoretically Understanding Why Sgd Generalizes Better Than Adam In Deep Learning, Pan Zhou, Jiashi Feng, Chao Ma, Caiming Xiong, Steven C. H. Hoi, Weinan E
Towards Theoretically Understanding Why Sgd Generalizes Better Than Adam In Deep Learning, Pan Zhou, Jiashi Feng, Chao Ma, Caiming Xiong, Steven C. H. Hoi, Weinan E
Research Collection School Of Computing and Information Systems
It is not clear yet why ADAM-alike adaptive gradient algorithms suffer from worse generalization performance than SGD despite their faster training speed. This work aims to provide understandings on this generalization gap by analyzing their local convergence behaviors. Specifically, we observe the heavy tails of gradient noise in these algorithms. This motivates us to analyze these algorithms through their Lévy-driven stochastic differential equations (SDEs) because of the similar convergence behaviors of an algorithm and its SDE. Then we establish the escaping time of these SDEs from a local basin. The result shows that (1) the escaping time of both SGD …
Algorithms And Hardness Results For Computing Cores Of Markov Chains, Ali Ahmadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Roodabeh Safavi, Dorde Zikelic
Algorithms And Hardness Results For Computing Cores Of Markov Chains, Ali Ahmadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Roodabeh Safavi, Dorde Zikelic
Research Collection School Of Computing and Information Systems
Given a Markov chain M = (V,v0,δ), with state space V and a starting state v0, and a probability threshold ϵ, an ϵ-core is a subset C of states that is left with probability at most ϵ. More formally, C ⊆V is an ϵ-core, iff P reach(V\C) ≤ ϵ. Cores have been applied in a wide variety of verification problems over Markov chains, Markov decision processes, and probabilistic programs, as a means of discarding uninteresting and low-probability parts of a probabilistic system and instead being able to focus on the states that are likely to be encountered in a real-world …
A Study Of Multi-Task And Region-Wise Deep Learning For Food Ingredient Recognition, Jingjing Chen, Bin Zhu, Chong-Wah Ngo, Tat-Seng Chua, Yu-Gang Jiang
A Study Of Multi-Task And Region-Wise Deep Learning For Food Ingredient Recognition, Jingjing Chen, Bin Zhu, Chong-Wah Ngo, Tat-Seng Chua, Yu-Gang Jiang
Research Collection School Of Computing and Information Systems
Food recognition has captured numerous research attention for its importance for health-related applications. The existing approaches mostly focus on the categorization of food according to dish names, while ignoring the underlying ingredient composition. In reality, two dishes with the same name do not necessarily share the exact list of ingredients. Therefore, the dishes under the same food category are not mandatorily equal in nutrition content. Nevertheless, due to limited datasets available with ingredient labels, the problem of ingredient recognition is often overlooked. Furthermore, as the number of ingredients is expected to be much less than the number of food categories, …
Learning To Dispatch For Job Shop Scheduling Via Deep Reinforcement Learning, Cong Zhang, Wen Song, Zhiguang Cao, Jie Zhang, Puay Siew Tan, Xu Chi
Learning To Dispatch For Job Shop Scheduling Via Deep Reinforcement Learning, Cong Zhang, Wen Song, Zhiguang Cao, Jie Zhang, Puay Siew Tan, Xu Chi
Research Collection School Of Computing and Information Systems
Priority dispatching rule (PDR) is widely used for solving real-world Job-shop scheduling problem (JSSP). However, the design of effective PDRs is a tedious task, requiring a myriad of specialized knowledge and often delivering limited performance. In this paper, we propose to automatically learn PDRs via an end-to-end deep reinforcement learning agent. We exploit the disjunctive graph representation of JSSP, and propose a Graph Neural Network based scheme to embed the states encountered during solving. The resulting policy network is size-agnostic, effectively enabling generalization on large-scale instances. Experiments show that the agent can learn high-quality PDRs from scratch with elementary raw …
Generating Concept Based Api Element Comparison Using A Knowledge Graph, Yang Liu, Mingwei Liu, Xin Peng, Christoph Treude, Zhenchang Xing, Xiaoxin Zhang
Generating Concept Based Api Element Comparison Using A Knowledge Graph, Yang Liu, Mingwei Liu, Xin Peng, Christoph Treude, Zhenchang Xing, Xiaoxin Zhang
Research Collection School Of Computing and Information Systems
Recommender systems are a valuable tool for software engineers. For example, they can provide developers with a ranked list of files likely to contain a bug, or multiple auto-complete suggestions for a given method stub. However, the way these recommender systems interact with developers is often rudimentary—a long list of recommendations only ranked by the model’s confidence. In this vision paper, we lay out our research agenda for re-imagining how recommender systems for software engineering communicate their insights to developers. When issuing recommendations, our aim is to recommend diverse rather than redundant solutions and present them in ways that highlight …
Theory-Inspired Path-Regularized Differential Network Architecture Search, Pan Zhou, Caiming Xiong, Richard Socher, Steven C. H. Hoi
Theory-Inspired Path-Regularized Differential Network Architecture Search, Pan Zhou, Caiming Xiong, Richard Socher, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
Despite its high search efficiency, differential architecture search (DARTS) often selects network architectures with dominated skip connections which lead to performance degradation. However, theoretical understandings on this issue remain absent, hindering the development of more advanced methods in a principled way. In this work, we solve this problem by theoretically analyzing the effects of various types of operations, e.g. convolution, skip connection and zero operation, to the network optimization. We prove that the architectures with more skip connections can converge faster than the other candidates, and thus are selected by DARTS. This result, for the first time, theoretically and explicitly …
Deep Multi-Task Learning For Depression Detection And Prediction In Longitudinal Data, Guansong Pang, Ngoc Thien Anh Pham, Emma Baker, Rebecca Bentley, Anton Van Den Hengel
Deep Multi-Task Learning For Depression Detection And Prediction In Longitudinal Data, Guansong Pang, Ngoc Thien Anh Pham, Emma Baker, Rebecca Bentley, Anton Van Den Hengel
Research Collection School Of Computing and Information Systems
Depression is among the most prevalent mental disorders, affecting millions of people of all ages globally. Machine learning techniques have shown effective in enabling automated detection and prediction of depression for early intervention and treatment. However, they are challenged by the relative scarcity of instances of depression in the data. In this work we introduce a novel deep multi-task recurrent neural network to tackle this challenge, in which depression classification is jointly optimized with two auxiliary tasks, namely one-class metric learning and anomaly ranking. The auxiliary tasks introduce an inductive bias that improves the classification model's generalizability on small depression …
Watch Out! Motion Is Blurring The Vision Of Your Deep Neural Networks, Qing Guo, Felix Juefei-Xu, Xiaofei Xie, Lei Ma, Jian Wang, Bing Yu, Wei Feng, Yang Liu
Watch Out! Motion Is Blurring The Vision Of Your Deep Neural Networks, Qing Guo, Felix Juefei-Xu, Xiaofei Xie, Lei Ma, Jian Wang, Bing Yu, Wei Feng, Yang Liu
Research Collection School Of Computing and Information Systems
The state-of-the-art deep neural networks (DNNs) are vulnerable to adversarial examples with additive random noise-like perturbations. While such examples are hardly found in the physical world, the image blurring effect caused by object motion, on the other hand, commonly occurs in practice, making the study of which greatly important especially for the widely adopted real-time image processing tasks (e.g., object detection, tracking). In this paper, we initiate the first step to comprehensively investigate the potential hazards of blur effect for DNN, caused by object motion. We propose a novel adversarial attack method that can generate visually natural motion-blurred adversarial examples, …
Driving Cybersecurity Policy Insights From Information On The Internet, Qiu-Hong Wang, Steven Mark Miller, Robert H. Deng
Driving Cybersecurity Policy Insights From Information On The Internet, Qiu-Hong Wang, Steven Mark Miller, Robert H. Deng
Research Collection School Of Computing and Information Systems
Cybersecurity policy analytics quantitatively evaluates the effectiveness of cybersecurity protection measures consisting of both technical and managerial countermeasures and is inherently interdisciplinary work, drawing on the concepts and methods from economics, business, social science, and law.
Walls Have Ears: Eavesdropping User Behaviors Via Graphics-Interrupt-Based Side Channel, Haoyu Ma, Jianwen Tian, Debin Gao, Jia Chunfu
Walls Have Ears: Eavesdropping User Behaviors Via Graphics-Interrupt-Based Side Channel, Haoyu Ma, Jianwen Tian, Debin Gao, Jia Chunfu
Research Collection School Of Computing and Information Systems
Graphics Processing Units (GPUs) are now playing a vital role in many devices and systems including computing devices, data centers, and clouds, making them the next target of side-channel attacks. Unlike those targeting CPUs, existing side-channel attacks on GPUs exploited vulnerabilities exposed by application interfaces like OpenGL and CUDA, which can be easily mitigated with software patches. In this paper, we investigate the lower-level and native interface between GPUs and CPUs, i.e., the graphics interrupts, and evaluate the side channel they expose. Being an intrinsic profile in the communication between a GPU and a CPU, the pattern of graphics interrupts …
Social Media Analytics: A Case Study Of Singapore General Election 2020, Sebastian Zhi Tao Khoo, Leong Hock Ho, Ee Hong Lee, Danston Kheng Boon Goh, Zehao Zhang, Swee Hong Ng, Haodi Qi, Kyong Jin Shim
Social Media Analytics: A Case Study Of Singapore General Election 2020, Sebastian Zhi Tao Khoo, Leong Hock Ho, Ee Hong Lee, Danston Kheng Boon Goh, Zehao Zhang, Swee Hong Ng, Haodi Qi, Kyong Jin Shim
Research Collection School Of Computing and Information Systems
The 2020 Singaporean General Election (GE2020) was a general election held in Singapore on July 10, 2020. In this study, we present an analysis on social conversations about GE2020 during the election period. We analyzed social conversations from popular platforms such as Twitter, HardwareZone, and TR Emeritus.