Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Reinforcement learning (7)
- Image search (6)
- Data mining (5)
- Human action recognition (5)
- Searchable encryption (5)
-
- Cloud security (4)
- Cloud storage (4)
- Data Mining (4)
- Deep learning (4)
- 802.11 (3)
- AoA (3)
- Attribute-based encryption (3)
- Bag-of-words (3)
- Click-through data (3)
- Clustering (3)
- Co-occurrence (3)
- Data integration (3)
- Fault localization (3)
- Game theory (3)
- MIMO (3)
- Machine learning (3)
- Plan learning (3)
- Self-organizing neural networks (3)
- Spatio-temporal interest points (3)
- Subspace learning (3)
- Topic model (3)
- Unsupervised learning (3)
- Video retrieval (3)
- Video search (3)
- Visualization (3)
- Publication Year
Articles 31 - 60 of 390
Full-Text Articles in Physical Sciences and Mathematics
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 …
When Program Analysis Meets Bytecode Search: Targeted And Efficient Inter-Procedural Analysis Of Modern Android Apps In Backdroid, Daoyuan Wu, Debin Gao, Robert H. Deng, Rocky Chang
When Program Analysis Meets Bytecode Search: Targeted And Efficient Inter-Procedural Analysis Of Modern Android Apps In Backdroid, Daoyuan Wu, Debin Gao, Robert H. Deng, Rocky Chang
Research Collection School Of Computing and Information Systems
Widely-used Android static program analysis tools,e.g., Amandroid and FlowDroid, perform the whole-app interprocedural analysis that is comprehensive but fundamentallydifficult to handle modern (large) apps. The average app size hasincreased three to four times over five years. In this paper, weexplore a new paradigm of targeted inter-procedural analysis thatcan skip irrelevant code and focus only on the flows of securitysensitive sink APIs. To this end, we propose a technique calledon-the-fly bytecode search, which searches the disassembled appbytecode text just in time when a caller needs to be located. In thisway, it guides targeted (and backward) inter-procedural analysisstep by step until reaching …
Ship-Gan: Generative Modeling Based Maritime Traffic Simulator, Chaithanya Shankaramurthy Basrur, Arambam James Singh, Arunesh Sinha, Akshat Kumar
Ship-Gan: Generative Modeling Based Maritime Traffic Simulator, Chaithanya Shankaramurthy Basrur, Arambam James Singh, Arunesh Sinha, Akshat Kumar
Research Collection School Of Computing and Information Systems
Modeling vessel movement in a maritime environment is an extremely challenging task given the complex nature of vessel behavior. Several existing multiagent maritime decision making frameworks require access to an accurate traffic simulator. We develop a system using electronic navigation charts to generate realistic and high fidelity vessel traffic data using Generative Adversarial Networks (GANs). Our proposed Ship-GAN uses a conditional Wasserstein GAN to model a vessel’s behavior. The generator can simulate the travel time of vessels across different maritime zones conditioned on vessels’ speeds and traffic intensity. Furthermore, it can be used as an accurate simulator for prior decision …
Interactive Search Vs. Automatic Search: An Extensive Study On Video Retrieval, Phuong-Anh Nguyen, Chong-Wah Ngo
Interactive Search Vs. Automatic Search: An Extensive Study On Video Retrieval, Phuong-Anh Nguyen, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
This article conducts user evaluation to study the performance difference between interactive and automatic search. Particularly, the study aims to provide empirical insights of how the performance landscape of video search changes, with tens of thousands of concept detectors freely available to exploit for query formulation. We compare three types of search modes: free-to-play (i.e., search from scratch), non-free-to-play (i.e., search by inspecting results provided by automatic search), and automatic search including concept-free and concept-based retrieval paradigms. The study involves a total of 40 participants; each performs interactive search over 15 queries of various difficulty levels using two search modes …
Towards Efficient Motif-Based Graph Partitioning: An Adaptive Sampling Approach, Shixun Huang, Yuchen Li, Zhifeng Bao, Zhao Li
Towards Efficient Motif-Based Graph Partitioning: An Adaptive Sampling Approach, Shixun Huang, Yuchen Li, Zhifeng Bao, Zhao Li
Research Collection School Of Computing and Information Systems
In this paper, we study the problem of efficient motif-based graph partitioning (MGP). We observe that existing methods require to enumerate all motif instances to compute the exact edge weights for partitioning. However, the enumeration is prohibitively expensive against large graphs. We thus propose a sampling-based MGP (SMGP) framework that employs an unbiased sampling mechanism to efficiently estimate the edge weights while trying to preserve the partitioning quality. To further improve the effectiveness, we propose a novel adaptive sampling framework called SMGP+. SMGP+ iteratively partitions the input graph based on up-to-date estimated edge weights, and adaptively adjusts the sampling distribution …
Boundary Precedence Image Inpainting Method Based On Self-Organizing Maps, Haibo Pen, Quan Wang, Zhaoxia Wang
Boundary Precedence Image Inpainting Method Based On Self-Organizing Maps, Haibo Pen, Quan Wang, Zhaoxia Wang
Research Collection School Of Computing and Information Systems
In addition to text data analysis, image analysis is an area that has increasingly gained importance in recent years because more and more image data have spread throughout the internet and real life. As an important segment of image analysis techniques, image restoration has been attracting a lot of researchers’ attention. As one of AI methodologies, Self-organizing Maps (SOMs) have been applied to a great number of useful applications. However, it has rarely been applied to the domain of image restoration. In this paper, we propose a novel image restoration method by leveraging the capability of SOMs, and we name …
Dycuckoo: Dynamic Hash Tables On Gpus, Yuchen Li, Qiwei Zhu, Zheng Lyu, Zhongdong Huang, Jianling Sun
Dycuckoo: Dynamic Hash Tables On Gpus, Yuchen Li, Qiwei Zhu, Zheng Lyu, Zhongdong Huang, Jianling Sun
Research Collection School Of Computing and Information Systems
The hash table is a fundamental structure that has been implemented on graphics processing units (GPUs) to accelerate a wide range of analytics workloads. Most existing works have focused on static scenarios and occupy large GPU memory to maximize the insertion efficiency. In many cases, data stored in hash tables get updated dynamically, and existing approaches use unnecessarily large memory resources. One naïve solution is to rebuild a hash table (known as rehashing) whenever it is either filled or mostly empty. However, this approach renders significant overheads for rehashing. In this paper, we propose a novel dynamic cuckoo hash table …
Newslink: Empowering Intuitive News Search With Knowledge Graphs, Yueji Yang, Yuchen Li, Anthony Tung
Newslink: Empowering Intuitive News Search With Knowledge Graphs, Yueji Yang, Yuchen Li, Anthony Tung
Research Collection School Of Computing and Information Systems
News search tools help end users to identify relevant news stories. However, existing search approaches often carry out in a "black-box" process. There is little intuition that helps users understand how the results are related to the query. In this paper, we propose a novel news search framework, called NEWSLINK, to empower intuitive news search by using relationship paths discovered from open Knowledge Graphs (KGs). Specifically, NEWSLINK embeds both a query and news documents to subgraphs, called subgraph embeddings, in the KG. Their embeddings' overlap induces relationship paths between the involving entities. Two major advantages are obtained by incorporating subgraph …
Dram Failure Prediction In Aiops: Empirical Evaluation, Challenges And Opportunities, Zhiyue Wu, Hongzuo Xu, Guansong Pang, Fengyuan Yu, Yijie Wang, Songlei Jian, Yongjun Wang
Dram Failure Prediction In Aiops: Empirical Evaluation, Challenges And Opportunities, Zhiyue Wu, Hongzuo Xu, Guansong Pang, Fengyuan Yu, Yijie Wang, Songlei Jian, Yongjun Wang
Research Collection School Of Computing and Information Systems
DRAM failure prediction is a vital task in AIOps, which is crucial to maintain the reliability and sustainable service of large-scale data centers. However, limited work has been done on DRAM failure prediction mainly due to the lack of public available datasets. This paper presents a comprehensive empirical evaluation of diverse machine learning techniques for DRAM failure prediction using a large-scale multisource dataset, including more than three millions of records of kernel, address, and mcelog data, provided by Alibaba Cloud through PAKDD 2021 competition. Particularly, we first formulate the problem as a multiclass classification task and exhaustively evaluate seven popular/stateof-the-art …
Efficient Retrieval Of Matrix Factorization-Based Top-K Recommendations: A Survey Of Recent Approaches, Duy Dung Le, Hady W. Lauw
Efficient Retrieval Of Matrix Factorization-Based Top-K Recommendations: A Survey Of Recent Approaches, Duy Dung Le, Hady W. Lauw
Research Collection School Of Computing and Information Systems
Top-k recommendation seeks to deliver a personalized list of k items to each individual user. An established methodology in the literature based on matrix factorization (MF), which usually represents users and items as vectors in low-dimensional space, is an effective approach to recommender systems, thanks to its superior performance in terms of recommendation quality and scalability. A typical matrix factorization recommender system has two main phases: preference elicitation and recommendation retrieval. The former analyzes user-generated data to learn user preferences and item characteristics in the form of latent feature vectors, whereas the latter ranks the candidate items based on the …
Dbl: Efficient Reachability Queries On Dynamic Graphs, Qiuyi Lyu, Yuchen Li, Bingsheng He, Bin Gong
Dbl: Efficient Reachability Queries On Dynamic Graphs, Qiuyi Lyu, Yuchen Li, Bingsheng He, Bin Gong
Research Collection School Of Computing and Information Systems
Reachability query is a fundamental problem on graphs, which has been extensively studied in academia and industry. Since graphs are subject to frequent updates in many applications, it is essential to support efficient graph updates while offering good performance in reachability queries. Existing solutions compress the original graph with the Directed Acyclic Graph (DAG) and propose efficient query processing and index update techniques. However, they focus on optimizing the scenarios where the Strong Connected Components (SCCs) remain unchanged and have overlooked the prohibitively high cost of the DAG maintenance when SCCs are updated. In this paper, we propose DBL, an …
Fault Analysis And Debugging Of Microservice Systems: Industrial Survey, Benchmark System, And Empirical Study, Xiang Zhou, Xin Peng, Tao Xie, Jun Sun, Chao Ji, Wenhai Li, Dan Ding
Fault Analysis And Debugging Of Microservice Systems: Industrial Survey, Benchmark System, And Empirical Study, Xiang Zhou, Xin Peng, Tao Xie, Jun Sun, Chao Ji, Wenhai Li, Dan Ding
Research Collection School Of Computing and Information Systems
The complexity and dynamism of microservice systems pose unique challenges to a variety of software engineering tasks such as fault analysis and debugging. In spite of the prevalence and importance of microservices in industry, there is limited research on the fault analysis and debugging of microservice systems. To fill this gap, we conduct an industrial survey to learn typical faults of microservice systems, current practice of debugging, and the challenges faced by developers in practice. We then develop a medium-size benchmark microservice system (being the largest and most complex open source microservice system within our knowledge) and replicate 22 industrial …
Learning Adl Daily Routines With Spatiotemporal Neural Networks, Shan Gao, Ah-Hwee Tan, Rossi Setchi
Learning Adl Daily Routines With Spatiotemporal Neural Networks, Shan Gao, Ah-Hwee Tan, Rossi Setchi
Research Collection School Of Computing and Information Systems
The activities of daily living (ADLs) refer to the activities performed by individuals on a daily basis and are the indicators of a person’s habits, lifestyle, and wellbeing. Learning an individual’s ADL daily routines has significant value in the healthcare domain. Specifically, ADL recognition and inter-ADL pattern learning problems have been studied extensively in the past couple of decades. However, discovering the patterns performed in a day and clustering them into ADL daily routines has been a relatively unexplored research area. In this paper, a self-organizing neural network model, called the Spatiotemporal ADL Adaptive Resonance Theory (STADLART), is proposed for …
Multi-User Verifiable Searchable Symmetric Encryption For Cloud Storage, Xueqiao Liu, Guomin Yang, Guomin Yang
Multi-User Verifiable Searchable Symmetric Encryption For Cloud Storage, Xueqiao Liu, Guomin Yang, Guomin Yang
Research Collection School Of Computing and Information Systems
In a cloud data storage system, symmetric key encryption is usually used to encrypt files due to its high efficiency. In order allow the untrusted/semi-trusted cloud storage server to perform searching over encrypted data while maintaining data confidentiality, searchable symmetric encryption (SSE) has been proposed. In a typical SSE scheme, a users stores encrypted files on a cloud storage server and later can retrieve the encrypted files containing specific keywords. The basic security requirement of SSE is that the cloud server learns no information about the files or the keywords during the searching process. Some SSE schemes also offer additional …
Peer-Inspired Student Performance Prediction In Interactive Online Question Pools With Graph Neural Network, Haotian Li, Huan Wei, Yong Wang, Yangqiu Song, Huamin. Qu
Peer-Inspired Student Performance Prediction In Interactive Online Question Pools With Graph Neural Network, Haotian Li, Huan Wei, Yong Wang, Yangqiu Song, Huamin. Qu
Research Collection School Of Computing and Information Systems
Student performance prediction is critical to online education. It can benefit many downstream tasks on online learning platforms, such as estimating dropout rates, facilitating strategic intervention, and enabling adaptive online learning. Interactive online question pools provide students with interesting interactive questions to practice their knowledge in online education. However, little research has been done on student performance prediction in interactive online question pools. Existing work on student performance prediction targets at online learning platforms with predefined course curriculum and accurate knowledge labels like MOOC platforms, but they are not able to fully model knowledge evolution of students in interactive online …
Temporal Heterogeneous Interaction Graph Embedding For Next-Item Recommendation, Yugang Ji, Mingyang Yin, Yuan Fang, Hongxia Yang, Xiangwei Wang, Tianrui Jia, Chuan Shi
Temporal Heterogeneous Interaction Graph Embedding For Next-Item Recommendation, Yugang Ji, Mingyang Yin, Yuan Fang, Hongxia Yang, Xiangwei Wang, Tianrui Jia, Chuan Shi
Research Collection School Of Computing and Information Systems
In the scenario of next-item recommendation, previous methods attempt to model user preferences by capturing the evolution of sequential interactions. However, their sequential expression is often limited, without modeling complex dynamics that short-term demands can often be influenced by long-term habits. Moreover, few of them take into account the heterogeneous types of interaction between users and items. In this paper, we model such complex data as a Temporal Heterogeneous Interaction Graph (THIG) and learn both user and item embeddings on THIGs to address next-item recommendation. The main challenges involve two aspects: the complex dynamics and rich heterogeneity of interactions. We …
Querying Recurrent Convoys Over Trajectory Data, Munkh-Erdene Yadamjav, Zhifeng Bao, Baihua Zheng, Farhana M. Choudhury, Hanan Samet
Querying Recurrent Convoys Over Trajectory Data, Munkh-Erdene Yadamjav, Zhifeng Bao, Baihua Zheng, Farhana M. Choudhury, Hanan Samet
Research Collection School Of Computing and Information Systems
Moving objects equipped with location-positioning devices continuously generate a large amount of spatio-temporal trajectory data. An interesting finding over a trajectory stream is a group of objects that are travelling together for a certain period of time. Existing studies on mining co-moving objects do not consider an important correlation between co-moving objects, which is the reoccurrence of the movement pattern. In this study, we define a problem of finding recurrent pattern of co-moving objects from streaming trajectories and propose an efficient solution that enables us to discover recent co-moving object patterns repeated within a given time period. Experimental results on …
Efficient Fine-Grained Data Sharing Mechanism For Electronic Medical Record Systems With Mobile Devices, Hui Ma, Rui Zhang, Guomin Yang, Zishuai Zong, Kai He, Yuting Xiao
Efficient Fine-Grained Data Sharing Mechanism For Electronic Medical Record Systems With Mobile Devices, Hui Ma, Rui Zhang, Guomin Yang, Zishuai Zong, Kai He, Yuting Xiao
Research Collection School Of Computing and Information Systems
Sharing digital medical records on public cloud storage via mobile devices facilitates patients (doctors) to get (offer) medical treatment of high quality and efficiency. However, challenges such as data privacy protection, flexible data sharing, efficient authority delegation, computation efficiency optimization, are remaining toward achieving practical fine-grained access control in the Electronic Medical Record (EMR) system. In this work, we propose an innovative access control model and a fine-grained data sharing mechanism for EMR, which simultaneously achieves the above-mentioned features and is suitable for resource-constrained mobile devices. In the model, complex computation is outsourced to public cloud servers, leaving almost no …
Social Participation Performance Of Wheelchair Users Using Clustering And Geolocational Sensor's Data, Yukun Yin, Kar Way Tan
Social Participation Performance Of Wheelchair Users Using Clustering And Geolocational Sensor's Data, Yukun Yin, Kar Way Tan
Research Collection School Of Computing and Information Systems
For wheelchair users, social participation and physical mobility play a significant part in determining their mental health and quality of life outcomes. However, little is known about how wheelchair users move about and engage in social interactions within their life-spaces. In this project, we investigate the social participation performance of the wheelchair users based on a combination of geolocational and lifestyle survey data collected over a period of three months. This paper adopts a multi-variate approach combining geolocational travel patterns and various factors such as independence, willingness and self-perception to provide multi-faceted analysis to their lifestyles. We provide profiles of …
Learning Transferrable Parameters For Long-Tailed Sequential User Behavior Modeling, Jianwen Yin, Chenghao Liu, Weiqing Wang, Jianling Sun, Steven C. H. Hoi
Learning Transferrable Parameters For Long-Tailed Sequential User Behavior Modeling, Jianwen Yin, Chenghao Liu, Weiqing Wang, Jianling Sun, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
Sequential user behavior modeling plays a crucial role in online user-oriented services, such as product purchasing, news feed consumption, and online advertising. The performance of sequential modeling heavily depends on the scale and quality of historical behaviors. However, the number of user behaviors inherently follows a long-tailed distribution, which has been seldom explored. In this work, we argue that focusing on tail users could bring more benefits and address the long tails issue by learning transferrable parameters from both optimization and feature perspectives. Specifically, we propose a gradient alignment optimizer and adopt an adversarial training scheme to facilitate knowledge transfer …
Skin-Mimo: Vibration-Based Mimo Communication Over Human Skin, Dong Ma, Yuezhong Wu, Ming Ding, Mahbub Hassan, Wen Hu
Skin-Mimo: Vibration-Based Mimo Communication Over Human Skin, Dong Ma, Yuezhong Wu, Ming Ding, Mahbub Hassan, Wen Hu
Research Collection School Of Computing and Information Systems
We explore the feasibility of Multiple-Input-Multiple-Output (MIMO) communication through vibrations over human skin. Using off-the-shelf motors and piezo transducers as vibration transmitters and receivers, respectively, we build a 2x2 MIMO testbed to collect and analyze vibration signals from real subjects. Our analysis reveals that there exist multiple independent vibration channels between a pair of transmitter and receiver, confirming the feasibility of MIMO. Unfortunately, the slow ramping of mechanical motors and rapidly changing skin channels make it impractical for conventional channel sounding based channel state information (CSI) acquisition, which is critical for achieving MIMO capacity gains. To solve this problem, we …
Adaptive Large Neighborhood Search For Vehicle Routing Problem With Cross-Docking, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu
Adaptive Large Neighborhood Search For Vehicle Routing Problem With Cross-Docking, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu
Research Collection School Of Computing and Information Systems
Cross-docking is considered as a method to manage and control the inventory flow, which is essential in the context of supply chain management. This paper studies the integration of the vehicle routing problem with cross-docking, namely VRPCD which has been extensively studied due to its ability to reducethe overall costs occurring in a supply chain network. Given a fleet of homogeneous vehicles for delivering a single type of product from suppliers to customers through a cross-dock facility, the objective of VRPCD is to determine the number of vehicles used and the corresponding vehicle routes, such that the vehicleoperational and transportation …
Towards Distributed Node Similarity Search On Graphs, Tianming Zhang, Yunjun Gao, Baihua Zheng, Lu Chen, Shiting Wen, Wei Guo
Towards Distributed Node Similarity Search On Graphs, Tianming Zhang, Yunjun Gao, Baihua Zheng, Lu Chen, Shiting Wen, Wei Guo
Research Collection School Of Computing and Information Systems
Node similarity search on graphs has wide applications in recommendation, link prediction, to name just a few. However, existing studies are insufficient due to two reasons: (i) the scale of the real-world graph is growing rapidly, and (ii) vertices are always associated with complex attributes. In this paper, we propose an efficiently distributed framework to support node similarity search on massive graphs, which considers both graph structure correlation and node attribute similarity in metric spaces. The framework consists of preprocessing stage and query stage. In the preprocessing stage, a parallel KD-tree construction (KDC) algorithm is developed to form a newly …
Sensing, Computing, And Communications For Energy Harvesting Iots: A Survey, Dong Ma, Guohao Lan, Mahbub Hassan, Wen Hu, Sajal K. Das
Sensing, Computing, And Communications For Energy Harvesting Iots: A Survey, Dong Ma, Guohao Lan, Mahbub Hassan, Wen Hu, Sajal K. Das
Research Collection School Of Computing and Information Systems
With the growing number of deployments of Internet of Things (IoT) infrastructure for a wide variety of applications, the battery maintenance has become a major limitation for the sustainability of such infrastructure. To overcome this problem, energy harvesting offers a viable alternative to autonomously power IoT devices, resulting in a number of battery-less energy harvesting IoTs (or EH-IoTs) appearing in the market in recent years. Standards activities are also underway, which involve wireless protocol design suitable for EH-IoTs as well as testing procedures for various energy harvesting methods. Despite the early commercial and standards activities, IoT sensing, computing and communications …
Transferring And Regularizing Prediction For Semantic Segmentation, Yiheng Zhang, Zhaofan Qiu, Ting Yao, Chong-Wah Ngo, Dong Liu, Tao Mei
Transferring And Regularizing Prediction For Semantic Segmentation, Yiheng Zhang, Zhaofan Qiu, Ting Yao, Chong-Wah Ngo, Dong Liu, Tao Mei
Research Collection School Of Computing and Information Systems
Semantic segmentation often requires a large set of images with pixel-level annotations. In the view of extremely expensive expert labeling, recent research has shown that the models trained on photo-realistic synthetic data (e.g., computer games) with computer-generated annotations can be adapted to real images. Despite this progress, without constraining the prediction on real images, the models will easily overfit on synthetic data due to severe domain mismatch. In this paper, we novelly exploit the intrinsic properties of semantic segmentation to alleviate such problem for model transfer. Specifically, we present a Regularizer of Prediction Transfer (RPT) that imposes the intrinsic properties …
Enhancing Cellular Communications For Uavs Via Intelligent Reflective Surface, Dong Ma, Ming Ding, Mahbub Hassan
Enhancing Cellular Communications For Uavs Via Intelligent Reflective Surface, Dong Ma, Ming Ding, Mahbub Hassan
Research Collection School Of Computing and Information Systems
Intelligent reflective surfaces (IRSs) capable of reconfiguring their electromagnetic absorption and reflection properties in real-time are offering unprecedented opportunities to enhance wireless communication experience in challenging environments. In this paper, we analyze the potential of IRS in enhancing cellular communications for UAVs, which currently suffers from poor signal strength due to the down-tilt of base station antennas optimized to serve ground users. We consider deployment of IRS on building walls, which can be remotely configured by cellular base stations to coherently direct the reflected radio waves towards specific UAVs in order to increase their received signal strengths. Using the recently …
How To And How Much? Teaching Ethics In An Interaction Design Course, Bimlesh Wadhwa, Eng Lieh Ouh, Benjamin Gan
How To And How Much? Teaching Ethics In An Interaction Design Course, Bimlesh Wadhwa, Eng Lieh Ouh, Benjamin Gan
Research Collection School Of Computing and Information Systems
How much is sufficient and how should one teach ethics in an Interaction Design curriculum in undergraduate computing program has been a point of dilemma for many HCI educators. We conducted a preliminary study using a mixed method to gather perception on ethics in our interaction design courses at two of the leading Singapore Universities. We answer three research questions specific to an undergraduate HCI course: Is there a need for ethics? Is there sufficient ethics coverage? and how to teach ethics? We surveyed 140 students and interviewed six teachers in two Singapore Universities. Our findings suggest that 92% of …
Attribute-Based Cloud Data Integrity Auditing For Secure Outsourced Storage, Yong Yu, Yannan Li, Bo Yang, Willy Susilo, Guomin Yang, Jian Bai
Attribute-Based Cloud Data Integrity Auditing For Secure Outsourced Storage, Yong Yu, Yannan Li, Bo Yang, Willy Susilo, Guomin Yang, Jian Bai
Research Collection School Of Computing and Information Systems
Outsourced storage such as cloud storage can significantly reduce the burden of data management of data owners. Despite of a long list of merits of cloud storage, it triggers many security risks at the same time. Data integrity, one of the most burning challenges in secure cloud storage, is a fundamental and pivotal element in outsourcing services. Outsourced data auditing protocols enable a verifier to efficiently check the integrity of the outsourced files without downloading the entire file from the cloud, which can dramatically reduce the communication overhead between the cloud server and the verifier. Existing protocols are mostly based …
Two Can Play That Game: An Adversarial Evaluation Of A Cyber-Alert Inspection System, Ankit Shah, Arunesh Sinha, Rajesh Ganesan, Sushil Jajodia, Hasan Cam
Two Can Play That Game: An Adversarial Evaluation Of A Cyber-Alert Inspection System, Ankit Shah, Arunesh Sinha, Rajesh Ganesan, Sushil Jajodia, Hasan Cam
Research Collection School Of Computing and Information Systems
Cyber-security is an important societal concern. Cyber-attacks have increased in numbers as well as in the extent of damage caused in every attack. Large organizations operate a Cyber Security Operation Center (CSOC), which forms the first line of cyber-defense. The inspection of cyber-alerts is a critical part of CSOC operations (defender or blue team). Recent work proposed a reinforcement learning (RL) based approach for the defender’s decision-making to prevent the cyber-alert queue length from growing large and overwhelming the defender. In this article, we perform a red team (adversarial) evaluation of this approach. With the recent attacks on learning-based decision-making …
Feature Agglomeration Networks For Single Stage Face Detection, Jialiang Zhang, Xiongwei Wu, Steven C. H. Hoi, Jianke Zhu
Feature Agglomeration Networks For Single Stage Face Detection, Jialiang Zhang, Xiongwei Wu, Steven C. H. Hoi, Jianke Zhu
Research Collection School Of Computing and Information Systems
Recent years have witnessed promising results of exploring deep convolutional neural network for face detection. Despite making remarkable progress, face detection in the wild remains challenging especially when detecting faces at vastly different scales and characteristics. In this paper, we propose a novel simple yet effective framework of “Feature Agglomeration Networks” (FANet) to build a new single-stage face detector, which not only achieves state-of-the-art performance but also runs efficiently. As inspired by Feature Pyramid Networks (FPN) (Lin et al., 2017), the key idea of our framework is to exploit inherent multi-scale features of a single convolutional neural network by aggregating …