Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons™

Open Access. Powered by Scholars. Published by Universities.®

2021

Research Collection School Of Computing and Information Systems

Discipline
Keyword

Articles 1 - 30 of 473

Full-Text Articles in Physical Sciences and Mathematics

Channel Integration Services In Online Healthcare Communities, Anqi Zhao, Qian Tang Dec 2021

Channel Integration Services In Online Healthcare Communities, Anqi Zhao, Qian Tang

Research Collection School Of Computing and Information Systems

In online healthcare communities, channel integration services have become the bridge between online and offline channels, enabling patients to easily migrate across channels. Different from pure online services, online-to-offline (On2Off) and offline-to-online (Off2On) channel integration services involve both channels. This study examines the interrelationships between pure online services and channel integration services. Using a panel dataset composed of data from an online healthcare community, we find that pure online services decrease patients’ demand for On2Off integration services but increase their use of Off2On integration services. Our findings suggest that providing healthcare services online can reduce online patients’ needs to visit …

Go to article

Ai And The Future Of Work: What We Know Today, Steven M. Miller, Thomas H. Davenport Dec 2021

Ai And The Future Of Work: What We Know Today, Steven M. Miller, Thomas H. Davenport

Research Collection School Of Computing and Information Systems

To contribute to a better understanding of the contemporary realities of AI workplace deployments, the authors recently completed 29 case studies of people doing their everyday work with AI-enabled smart machines. Twenty-three of these examples were from North America, mostly in the US. Six were from Southeast Asia, mostly in Singapore. In this essay, we compare our findings on job and workplace impacts to those reported in the MIT Task Force on the Work of the Future report, as we consider that to be the most comprehensive recent study on this topic.

Go to article

Towards Non-Intrusive Camera-Based Heart Rate Variability Estimation In The Car Under Naturalistic Condition, Shu Liu, Kevin Koch, Zimu Zhou, Martin Maritsch, Xiaoxi He, Elgar Fleisch, Felix Wortmann Dec 2021

Towards Non-Intrusive Camera-Based Heart Rate Variability Estimation In The Car Under Naturalistic Condition, Shu Liu, Kevin Koch, Zimu Zhou, Martin Maritsch, Xiaoxi He, Elgar Fleisch, Felix Wortmann

Research Collection School Of Computing and Information Systems

Driver status monitoring systems are a vital component of smart cars in the future, especially in the era when an increasing amount of time is spent in the vehicle. The heart rate (HR) is one of the most important physiological signals of driver status. To infer HR of drivers, the mainstream of existing research focused on capturing subtle heartbeat-induced vibration of the torso or leveraged photoplethysmography (PPG) that detects cardiac cycle-related blood volume changes in the microvascular. However, existing approaches rely on dedicated sensors that are expensive and cumbersome to be integrated or are vulnerable to ambient noise. Moreover, their …

Go to article

Imon: Appearance-Based Gaze Tracking System On Mobile Devices, Sinh Huynh, Rajesh Krishna Balan, Jeonggil Ko Dec 2021

Imon: Appearance-Based Gaze Tracking System On Mobile Devices, Sinh Huynh, Rajesh Krishna Balan, Jeonggil Ko

Research Collection School Of Computing and Information Systems

Gaze tracking is a key building block used in many mobile applications including entertainment, personal productivity, accessibility, medical diagnosis, and visual attention monitoring. In this paper, we present iMon, an appearance-based gaze tracking system that is both designed for use on mobile phones and has significantly greater accuracy compared to prior state-of-the-art solutions. iMon achieves this by comprehensively considering the gaze estimation pipeline and then overcoming three different sources of errors. First, instead of assuming that the user's gaze is fixed to a single 2D coordinate, we construct each gaze label using a probabilistic 2D heatmap gaze representation input to …

Go to article

Rmm: Reinforced Memory Management For Class-Incremental Learning, Yaoyao Liu, Qianru Sun, Qianru Sun Dec 2021

Rmm: Reinforced Memory Management For Class-Incremental Learning, Yaoyao Liu, Qianru Sun, Qianru Sun

Research Collection School Of Computing and Information Systems

Class-Incremental Learning (CIL) [38] trains classifiers under a strict memory budget: in each incremental phase, learning is done for new data, most of which is abandoned to free space for the next phase. The preserved data are exemplars used for replaying. However, existing methods use a static and ad hoc strategy for memory allocation, which is often sub-optimal. In this work, we propose a dynamic memory management strategy that is optimized for the incremental phases and different object classes. We call our method reinforced memory management (RMM), leveraging reinforcement learning. RMM training is not naturally compatible with CIL as the …

Go to article

Spurring Digital Transformation In Singapore's Legal Industry, Xin Juan Chua, Steven M. Miller Dec 2021

Spurring Digital Transformation In Singapore's Legal Industry, Xin Juan Chua, Steven M. Miller

Research Collection School Of Computing and Information Systems

COVID-19 has transformed the way we live and work. It has caused the processes and operations of businesses and organisations to be restructured, as well as transformed business models. A 2020 McKinsey Global survey reported that companies all over the world claim they have accelerated the digitalisation of their customer and supply-chain interactions, as well as their internal operations, by three to four years. They also said they thought the share of digital or digitally enabled products in their portfolios has advanced by seven years. While technology transformation is not new to the legal profession, COVID-19 has cemented the importance …

Go to article

Fine-Grained Generalization Analysis Of Inductive Matrix Completion, Antoine Ledent, Rodrigo Alves, Yunwen Lei, Marius Kloft Dec 2021

Fine-Grained Generalization Analysis Of Inductive Matrix Completion, Antoine Ledent, Rodrigo Alves, Yunwen Lei, Marius Kloft

Research Collection School Of Computing and Information Systems

In this paper, we bridge the gap between the state-of-the-art theoretical results for matrix completion with the nuclear norm and their equivalent in \textit{inductive matrix completion}: (1) In the distribution-free setting, we prove bounds improving the previously best scaling of \widetilde{O}(rd2) to \widetilde{O}(d3/2√r), where d is the dimension of the side information and rr is the rank. (2) We introduce the (smoothed) \textit{adjusted trace-norm minimization} strategy, an inductive analogue of the weighted trace norm, for which we show guarantees of the order \widetilde{O}(dr) under arbitrary sampling. In the inductive case, a similar rate was previously achieved only under uniform sampling …

Go to article

Degree Doesn't Matter: Identifying The Drivers Of Interaction In Software Development Ecosystem, Amrita Bhattacharjee, Subhajit Datta, Subhashis Majumder Dec 2021

Degree Doesn't Matter: Identifying The Drivers Of Interaction In Software Development Ecosystem, Amrita Bhattacharjee, Subhajit Datta, Subhashis Majumder

Research Collection School Of Computing and Information Systems

Large scale software development ecosystems represent one of the most complex human enterprises. In such settings, developers are embedded in a web of shared concerns, responsibilities, and objectives at individual and collective levels. A deep understanding of the factors that influence developers to connect with one another is crucial in appreciating the challenges of such ecosystems as well as formulating strategies to overcome those challenges. We use real world data from multiple software development ecosystems to construct developer interaction networks and examine the mechanisms of such network formation using statistical models to identify developer attributes that have maximal influence on …

Go to article

Functional Signatures: New Definition And Constructions, Qingwen Guo, Qiong Huang, Sha Ma, Meiyan Xiao, Guomin Yang, Willy Susilo Dec 2021

Functional Signatures: New Definition And Constructions, Qingwen Guo, Qiong Huang, Sha Ma, Meiyan Xiao, Guomin Yang, Willy Susilo

Research Collection School Of Computing and Information Systems

Functional signatures (FS) enable a master authority to delegate its signing privilege to an assistant. Concretely, the master authority uses its secret key sk(F) to issue a signing key sk(f) for a designated function f is an element of F-FS and sends both f and sk(f) to the assistant E, which is then able to compute a signature sigma(f) with respect to pk(F) for a message y in the range of f. In this paper, we modify the syntax of FS slightly to support the application scenario where a certificate of authorization is necessary. Compared with the original FS, our …

Go to article

Canita: Faster Rates For Distributed Convex Optimization With Communication Compression, Zhize Li, Peter Richtarik Dec 2021

Canita: Faster Rates For Distributed Convex Optimization With Communication Compression, Zhize Li, Peter Richtarik

Research Collection School Of Computing and Information Systems

Due to the high communication cost in distributed and federated learning, methods relying on compressed communication are becoming increasingly popular. Besides, the best theoretically and practically performing gradient-type methods invariably rely on some form of acceleration/momentum to reduce the number of communications (faster convergence), e.g., Nesterov's accelerated gradient descent (Nesterov, 1983, 2004) and Adam (Kingma and Ba, 2014). In order to combine the benefits of communication compression and convergence acceleration, we propose a \emph{compressed and accelerated} gradient method based on ANITA (Li, 2021) for distributed optimization, which we call CANITA. Our CANITA achieves the \emph{first accelerated rate} $O\bigg(\sqrt{\Big(1+\sqrt{\frac{\omega^3}{n}}\Big)\frac{L}{\epsilon}} + \omega\big(\frac{1}{\epsilon}\big)^{\frac{1}{3}}\bigg)$, …

Go to article

Solving The Vehicle Routing Problem With Simultaneous Pickup And Delivery And Occasional Drivers By Simulated Annealing, Vincent F. Yu, Grace Aloina, Panca Jodiawan, Aldy Gunawan, Tsung-Chi Huang Dec 2021

Solving The Vehicle Routing Problem With Simultaneous Pickup And Delivery And Occasional Drivers By Simulated Annealing, Vincent F. Yu, Grace Aloina, Panca Jodiawan, Aldy Gunawan, Tsung-Chi Huang

Research Collection School Of Computing and Information Systems

This research studies the vehicle routing problem with simultaneous pickup and delivery with an occasional driver (VRPSPDOD). VRPSPDOD is a new variant of the vehicle routing problems with simultaneous pickup and delivery (VRPSPD). Different from VRPSPD, in VRPSPDOD, occasional drivers are employed to work with regular vehicles to service customers’ pickup and delivery requests in order to minimize the total cost. We formulate a mixed integer linear programming model for VRPSPD and propose a heuristic algorithm based on simulated annealing (SA) to solve the problem. The results of comprehensive numerical experiments show that the proposed SA performs well in terms …

Go to article

Building Action Sets In A Deep Reinforcement Learner, Yongzhao Wang, Arunesh Sinha, Sky C.H. Wang, Michael P. Wellman Dec 2021

Building Action Sets In A Deep Reinforcement Learner, Yongzhao Wang, Arunesh Sinha, Sky C.H. Wang, Michael P. Wellman

Research Collection School Of Computing and Information Systems

In many policy-learning applications, the agent may execute a set of actions at each decision stage. Choosing among an exponential number of alternatives poses a computational challenge, and even representing actions naturally expressed as sets can be a tricky design problem. Building upon prior approaches that employ deep neural networks and iterative construction of action sets, we introduce a reward-shaping approach to apportion reward to each atomic action based on its marginal contribution within an action set, thereby providing useful feedback for learning to build these sets. We demonstrate our method in two environments where action spaces are combinatorial. Experiments …

Go to article

Self-Supervised Learning Disentangled Group Representation As Feature, Tan Wang, Zhongqi Yue, Jianqiang Huang, Qianru Sun, Hanwang Zhang Dec 2021

Self-Supervised Learning Disentangled Group Representation As Feature, Tan Wang, Zhongqi Yue, Jianqiang Huang, Qianru Sun, Hanwang Zhang

Research Collection School Of Computing and Information Systems

A good visual representation is an inference map from observations (images) to features (vectors) that faithfully reflects the hidden modularized generative factors (semantics). In this paper, we formulate the notion of “good” representation from a group-theoretic view using Higgins’ definition of disentangled representation [38], and show that existing Self-Supervised Learning (SSL) only disentangles simple augmentation features such as rotation and colorization, thus unable to modularize the remaining semantics. To break the limitation, we propose an iterative SSL algorithm: Iterative Partition-based Invariant Risk Minimization (IP-IRM), which successfully grounds the abstract semantics and the group acting on them into concrete contrastive learning. …

Go to article

Automated Doubt Identification From Informal Reflections Through Hybrid Sentic Patterns And Machine Learning Approach, Siaw Ling Lo, Kar Way Tan, Eng Lieh Ouh Dec 2021

Automated Doubt Identification From Informal Reflections Through Hybrid Sentic Patterns And Machine Learning Approach, Siaw Ling Lo, Kar Way Tan, Eng Lieh Ouh

Research Collection School Of Computing and Information Systems

Do my students understand? The question that lingers in every instructor’s mind after each lesson. With the focus on learner-centered pedagogy, is it feasible to provide timely and relevant guidance to individual learners according to their levels of understanding? One of the options available is to collect reflections from learners after each lesson to extract relevant feedback so that doubts or questions can be addressed in a timely manner. In this paper, we derived a hybrid approach that leverages a novel Doubt Sentic Pattern Detection (SPD) algorithm and a machine learning model to automate the identification of doubts from students’ …

Go to article

Deriving Invariant Checkers For Critical Infrastructure Using Axiomatic Design Principles, Cheah Huei Yoong, Venkata Reddy Palleti, Rajib Ranjan Maiti, Arlindo Silva, Christopher M. Poskitt Dec 2021

Deriving Invariant Checkers For Critical Infrastructure Using Axiomatic Design Principles, Cheah Huei Yoong, Venkata Reddy Palleti, Rajib Ranjan Maiti, Arlindo Silva, Christopher M. Poskitt

Research Collection School Of Computing and Information Systems

Cyber-physical systems (CPSs) in critical infrastructure face serious threats of attack, motivating research into a wide variety of defence mechanisms such as those that monitor for violations of invariants, i.e. logical properties over sensor and actuator states that should always be true. Many approaches for identifying invariants attempt to do so automatically, typically using data logs, but these can miss valid system properties if relevant behaviours are not well-represented in the data. Furthermore, as the CPS is already built, resolving any design flaws or weak points identified through this process is costly. In this paper, we propose a systematic …

Go to article

Hierarchical Control Of Multi-Agent Reinforcement Learning Team In Real-Time Strategy (Rts) Games, Weigui Jair Zhou, Budhitama Subagdja, Ah-Hwee Tan, Darren Wee Sze Ong Dec 2021

Hierarchical Control Of Multi-Agent Reinforcement Learning Team In Real-Time Strategy (Rts) Games, Weigui Jair Zhou, Budhitama Subagdja, Ah-Hwee Tan, Darren Wee Sze Ong

Research Collection School Of Computing and Information Systems

Coordinated control of multi-agent teams is an important task in many real-time strategy (RTS) games. In most prior work, micromanagement is the commonly used strategy whereby individual agents operate independently and make their own combat decisions. On the other extreme, some employ a macromanagement strategy whereby all agents are controlled by a single decision model. In this paper, we propose a hierarchical command and control architecture, consisting of a single high-level and multiple low-level reinforcement learning agents operating in a dynamic environment. This hierarchical model enables the low-level unit agents to make individual decisions while taking commands from the high-level …

Go to article

Beyond Smoothness : Incorporating Low-Rank Analysis Into Nonparametric Density Estimation, Rob Vandermeulen, Antoine Ledent Dec 2021

Beyond Smoothness : Incorporating Low-Rank Analysis Into Nonparametric Density Estimation, Rob Vandermeulen, Antoine Ledent

Research Collection School Of Computing and Information Systems

The construction and theoretical analysis of the most popular universally consistent nonparametric density estimators hinge on one functional property: smoothness. In this paper we investigate the theoretical implications of incorporating a multi-view latent variable model, a type of low-rank model, into nonparametric density estimation. To do this we perform extensive analysis on histogram-style estimators that integrate a multi-view model. Our analysis culminates in showing that there exists a universally consistent histogram-style estimator that converges to any multi-view model with a finite number of Lipschitz continuous components at a rate of ˜O(1/3√n) in L1 error. In contrast, the standard histogram estimator …

Go to article

Strategic Behavior And Market Inefficiency In Blockchain-Based Auctions, Ping Fan Ke, Jianqing Chen, Zhiling Guo Dec 2021

Strategic Behavior And Market Inefficiency In Blockchain-Based Auctions, Ping Fan Ke, Jianqing Chen, Zhiling Guo

Research Collection School Of Computing and Information Systems

Blockchain-based auctions play a key role in decentralized finance, such as liquidation of collaterals in crypto-lending. In this research, we show that a Blockchain-based auction is subject to the threat to availability because of the characteristics of the Blockchain platform, which could lead to auction inefficiency or even market failure. Specifically, an adversary could occupy all of the transaction capacity of an auction by sending transactions with sufficiently high transaction fees, and then win the item in an auction with a nearly zero bid price as there are no competitors available. We discuss how to prevent this kind of strategic …

Go to article

Learning Large Neighborhood Search Policy For Integer Programming, Yaoxin Wu, Wen Song, Zhiguang Cao, Jie Zhang Dec 2021

Learning Large Neighborhood Search Policy For Integer Programming, Yaoxin Wu, Wen Song, Zhiguang Cao, Jie Zhang

Research Collection School Of Computing and Information Systems

We propose a deep reinforcement learning (RL) method to learn large neighborhood search (LNS) policy for integer programming (IP). The RL policy is trained as the destroy operator to select a subset of variables at each step, which is reoptimized by an IP solver as the repair operator. However, the combinatorial number of variable subsets prevents direct application of typical RL algorithms. To tackle this challenge, we represent all subsets by factorizing them into binary decisions on each variable. We then design a neural network to learn policies for each variable in parallel, trained by a customized actor-critic algorithm. We …

Go to article

Learning To Iteratively Solve Routing Problems With Dual-Aspect Collaborative Transformer, Yining Ma, Jingwen Li, Zhiguang Cao, Wen Song, Le Zhang, Zhenghua Chen, Jing Tang Dec 2021

Learning To Iteratively Solve Routing Problems With Dual-Aspect Collaborative Transformer, Yining Ma, Jingwen Li, Zhiguang Cao, Wen Song, Le Zhang, Zhenghua Chen, Jing Tang

Research Collection School Of Computing and Information Systems

Recently, Transformer has become a prevailing deep architecture for solving vehicle routing problems (VRPs). However, it is less effective in learning improvement models for VRP because its positional encoding (PE) method is not suitable in representing VRP solutions. This paper presents a novel Dual-Aspect Collaborative Transformer (DACT) to learn embeddings for the node and positional features separately, instead of fusing them together as done in existing ones, so as to avoid potential noises and incompatible correlations. Moreover, the positional features are embedded through a novel cyclic positional encoding (CPE) method to allow Transformer to effectively capture the circularity and symmetry …

Go to article

Concise Mercurial Subvector Commitments: Definitions And Constructions, Yannan Li, Willy Susilo, Guomin Yang, Tran Viet Xuan Phuong, Yong Yu, Dongxi Liu Dec 2021

Concise Mercurial Subvector Commitments: Definitions And Constructions, Yannan Li, Willy Susilo, Guomin Yang, Tran Viet Xuan Phuong, Yong Yu, Dongxi Liu

Research Collection School Of Computing and Information Systems

Vector commitment and its variants have attracted a lot of attention recently as they have been exposed to a wide range of applications in blockchain. Two special extensions of vector commitments, namely subvector commitments and mercurial commitments, have been proposed with attractive features that are desirable in many applications. Nevertheless, to the best of our knowledge, a single construction satisfying all those attractive features is still missing. In this work, we analyze those important properties and propose a new primitive called mercurial subvector commitments, which are efficiently updatable, mercurial hiding, position binding, and aggregatable. We formalize the system model and …

Go to article

Broadcast Authenticated Encryption With Keyword Search, Xueqiao Liu, Kai He, Guomin Yang, Willy Susilo, Joseph Tonien, Qiong Huang Dec 2021

Broadcast Authenticated Encryption With Keyword Search, Xueqiao Liu, Kai He, Guomin Yang, Willy Susilo, Joseph Tonien, Qiong Huang

Research Collection School Of Computing and Information Systems

The emergence of public-key encryption with keyword search (PEKS) has provided an elegant approach to enable keyword search over encrypted content. Due to its high computational complexity proportional to the number of intended receivers, the trivial way of deploying PEKS for data sharing with multiple receivers is impractical, which motivates the development of a new PEKS framework for broadcast mode. However, existing works suffer from either the vulnerability to keyword guessing attacks (KGA) or high computation and communication complexity. In this work, a new primitive for keyword search in broadcast mode, named broadcast authenticated encryption with keyword search (BAEKS), is …

Go to article

Integration Of Information Technology Certifications Into Undergraduate Computing Curriculum, Eng Lieh Ouh, Kyong Jin Shim Dec 2021

Integration Of Information Technology Certifications Into Undergraduate Computing Curriculum, Eng Lieh Ouh, Kyong Jin Shim

Research Collection School Of Computing and Information Systems

This innovative practice full paper describes our experiences of integrating information technology certifications into an undergraduate computing curriculum. As the technology landscape evolves, a common challenge for educators in computing programs is designing an industry-relevant curriculum. Over the years, industry practitioners have taken technology certifications to validate themselves against a base level of technical knowledge currently in demand in industry. Information technology (IT) certifications can also offer paths for academic computing programs to stay relevant to industry needs. However, identifying relevant IT certifications and integrating it into an academic curriculum requires a careful design approach as substantial efforts are needed …

Go to article

Adadeep: A Usage-Driven, Automated Deep Model Compression Framework For Enabling Ubiquitous Intelligent Mobiles, Sicong Liu, Junzhao Du, Kaiming Nan, Zimu Zhou, Hui Liu, Zhangyang Wang, Yingyan Lin Dec 2021

Adadeep: A Usage-Driven, Automated Deep Model Compression Framework For Enabling Ubiquitous Intelligent Mobiles, Sicong Liu, Junzhao Du, Kaiming Nan, Zimu Zhou, Hui Liu, Zhangyang Wang, Yingyan Lin

Research Collection School Of Computing and Information Systems

Recent breakthroughs in deep neural networks (DNNs) have fueled a tremendously growing demand for bringing DNN-powered intelligence into mobile platforms. While the potential of deploying DNNs on resource-constrained platforms has been demonstrated by DNN compression techniques, the current practice suffers from two limitations: 1) merely stand-alone compression schemes are investigated even though each compression technique only suit for certain types of DNN layers; and 2) mostly compression techniques are optimized for DNNs’ inference accuracy, without explicitly considering other application-driven system performance (e.g., latency and energy cost) and the varying resource availability across platforms (e.g., storage and processing capability). To this …

Go to article

Verification Assisted Gas Reduction For Smart Contracts, Bo Gao, Siyuan Shen, Ling Shi, Jiaying Li, Jun Sun, Lei Bu Dec 2021

Verification Assisted Gas Reduction For Smart Contracts, Bo Gao, Siyuan Shen, Ling Shi, Jiaying Li, Jun Sun, Lei Bu

Research Collection School Of Computing and Information Systems

Smart contracts are computerized transaction protocols built on top of blockchain networks. Users are charged with fees, a.k.a. gas in Ethereum, when they create, deploy or execute smart contracts. Since smart contracts may contain vulnerabilities which may result in huge financial loss, developers and smart contract compilers often insert codes for security checks. The trouble is that those codes consume gas every time they are executed. Many of the inserted codes are however redundant. In this work, we present sOptimize, a tool that optimizes smart contract gas consumption automatically without compromising functionality or security. sOptimize works on smart contract bytecode, …

Go to article

Video Snapshot: Single Image Motion Expansion Via Invertible Motion Embedding, Qianshu Zhu, Chu Han, Guoqiang Han, Tien-Tsin Wong, Shengfeng He Dec 2021

Video Snapshot: Single Image Motion Expansion Via Invertible Motion Embedding, Qianshu Zhu, Chu Han, Guoqiang Han, Tien-Tsin Wong, Shengfeng He

Research Collection School Of Computing and Information Systems

Unlike images, finding the desired video content in a large pool of videos is not easy due to the time cost of loading and watching. Most video streaming and sharing services provide the video preview function for a better browsing experience. In this paper, we aim to generate a video preview from a single image. To this end, we propose two cascaded networks, the motion embedding network and the motion expansion network. The motion embedding network aims to embed the spatio-temporal information into an embedded image, called video snapshot. On the other end, the motion expansion network is proposed to …

Go to article

Graph Learning Assisted Multi-Objective Integer Programming, Yaoxin Wu, Wen Song, Zhiguang Cao, Jie Zhang, Abhishek Gupta, Mingyan Simon Lin Dec 2021

Graph Learning Assisted Multi-Objective Integer Programming, Yaoxin Wu, Wen Song, Zhiguang Cao, Jie Zhang, Abhishek Gupta, Mingyan Simon Lin

Research Collection School Of Computing and Information Systems

Objective-space decomposition algorithms (ODAs) are widely studied for solvingmulti-objective integer programs. However, they often encounter difficulties inhandling scalarized problems, which could cause infeasibility or repetitive nondominatedpoints and thus induce redundant runtime. To mitigate the issue, we presenta graph neural network (GNN) based method to learn the reduction rule in the ODA.We formulate the algorithmic procedure of generic ODAs as a Markov decisionprocess, and parameterize the policy (reduction rule) with a novel two-stage GNNto fuse information from variables, constraints and especially objectives for betterstate representation. We train our model with imitation learning and deploy it ona state-of-the-art ODA. Results show that …

Go to article

Neurolkh: Combining Deep Learning Model With Lin-Kernighan-Helsgaun Heuristic For Solving The Traveling Salesman Problem, Liang Xin, Wen Song, Zhiguang Cao, Jie Zhang Dec 2021

Neurolkh: Combining Deep Learning Model With Lin-Kernighan-Helsgaun Heuristic For Solving The Traveling Salesman Problem, Liang Xin, Wen Song, Zhiguang Cao, Jie Zhang

Research Collection School Of Computing and Information Systems

We present NeuroLKH, a novel algorithm that combines deep learning with the strong traditional heuristic Lin-Kernighan-Helsgaun (LKH) for solving Traveling Salesman Problem. Specifically, we train a Sparse Graph Network (SGN) with supervised learning for edge scores and unsupervised learning for node penalties, both of which are critical for improving the performance of LKH. Based on the output of SGN, NeuroLKH creates the edge candidate set and transforms edge distances to guide the searching process of LKH. Extensive experiments firmly demonstrate that, by training one model on a wide range of problem sizes, NeuroLKH significantly outperforms LKH and generalizes well to …

Go to article

A Fine-Grained Attribute Based Data Retrieval With Proxy Re-Encryption Scheme For Data Outsourcing Systems, Hanshu Hong, Ximeng Liu, Zhixin Sun Dec 2021

A Fine-Grained Attribute Based Data Retrieval With Proxy Re-Encryption Scheme For Data Outsourcing Systems, Hanshu Hong, Ximeng Liu, Zhixin Sun

Research Collection School Of Computing and Information Systems

Attribute based encryption is suitable for data protection in data outsourcing systems such as cloud computing. However, the leveraging of encryption technique may retrain some routine operations over the encrypted data, particularly in the field of data retrieval. This paper presents an attribute based date retrieval with proxy re-encryption (ABDR-PRE) to provide both fine-grained access control and retrieval over the ciphertexts. The proposed scheme achieves fine-grained data access management by adopting KP-ABE mechanism, a delegator can generate the re-encryption key and search indexes for the ciphertexts to be shared over the target delegatee’s attributes. Throughout the process of data sharing, …

Go to article

On Analysing Student Resilience In Higher Education Programs Using A Data-Driven Approach, Audrey Tedja Widjaja, Ee-Peng Lim, Aldy Gunawan Dec 2021

On Analysing Student Resilience In Higher Education Programs Using A Data-Driven Approach, Audrey Tedja Widjaja, Ee-Peng Lim, Aldy Gunawan

Research Collection School Of Computing and Information Systems

Analysing student resilience is important as research has shown that resilience is related to students’ academic performance and their persistence through academic setbacks. While questionnaires can be conducted to assess student resilience directly, they suffer from human recall errors and deliberate suppression of true responses. In this paper, we propose ACREA, ACademic REsilience Analytics framework which adopts a data-driven approach to analyse student resilient behavior with the use of student-course data. ACREA defines academic setbacks experienced by students and measures how well students overcome such setbacks using a quasi-experimental design. By applying ACREA on a real world student-course dataset, we …

Go to article

Next Last