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

Physical Sciences and Mathematics Commons

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

OS and Networks

PDF

Series

2021

Institution
Keyword
Publication

Articles 1 - 30 of 51

Full-Text Articles in Physical Sciences and Mathematics

Comparison Of Major Cloud Providers, Justin Berman Dec 2021

Comparison Of Major Cloud Providers, Justin Berman

Other Student Works

This paper will compare the following major cloud providers: Microsoft Azure, Amazon AWS, Google Cloud, and IBM Cloud. An introduction to the companies and their history, fundamentals and services, strengths and weaknesses, costs, and their security will be discussed throughout this writing.


Ggnb: Graph-Based Gaussian Naive Bayes Intrusion Detection System For Can Bus, Riadul Islam, Maloy K. Devnath, Manar D. Samad, Syed Md Jaffrey Al Kadry Nov 2021

Ggnb: Graph-Based Gaussian Naive Bayes Intrusion Detection System For Can Bus, Riadul Islam, Maloy K. Devnath, Manar D. Samad, Syed Md Jaffrey Al Kadry

Computer Science Faculty Research

The national highway traffic safety administration (NHTSA) identified cybersecurity of the automobile systems are more critical than the security of other information systems. Researchers already demonstrated remote attacks on critical vehicular electronic control units (ECUs) using controller area network (CAN). Besides, existing intrusion detection systems (IDSs) often propose to tackle a specific type of attack, which may leave a system vulnerable to numerous other types of attacks. A generalizable IDS that can identify a wide range of attacks within the shortest possible time has more practical value than attack-specific IDSs, which is not a trivial task to accomplish. In this …


Routing And Spectrum Allocation In Spectrum-Sliced Elastic Optical Path Networks: A Primal-Dual Framework, Yang Wang, Chaoyang Li, Qian Hu, Jabree Flor, Maryam Jalalitabar Nov 2021

Routing And Spectrum Allocation In Spectrum-Sliced Elastic Optical Path Networks: A Primal-Dual Framework, Yang Wang, Chaoyang Li, Qian Hu, Jabree Flor, Maryam Jalalitabar

Department of Mathematics and Computer Science Faculty Work

The recent decade has witnessed a tremendous growth of Internet traffic, which is expected to continue climbing for the foreseeable future. As a new paradigm, Spectrum-sliced Elastic Optical Path (SLICE) networks promise abundant (elastic) bandwidth to address the traffic explosion, while bearing other inherent advantages including enhanced signal quality and extended reachability. The fundamental problem in SLICE networks is to route each traffic demand along a lightpath with continuously and consecutively available sub-carriers, which is known as the Routing and Spectrum Allocation (RSA) problem. Given its NP-Hardness, the solutions to the RSA problem can be classified into two categories: optimal …


Representation Learning On Multi-Layered Heterogeneous Network, Delvin Ce Zhang, Hady W. Lauw Nov 2021

Representation Learning On Multi-Layered Heterogeneous Network, Delvin Ce Zhang, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Network data can often be represented in a multi-layered structure with rich semantics. One example is e-commerce data, containing user-user social network layer and item-item context layer, with cross-layer user-item interactions. Given the dual characters of homogeneity within each layer and heterogeneity across layers, we seek to learn node representations from such a multi-layered heterogeneous network while jointly preserving structural information and network semantics. In contrast, previous works on network embedding mainly focus on single-layered or homogeneous networks with one type of nodes and links. In this paper we propose intra- and cross-layer proximity concepts. Intra-layer proximity simulates propagation along …


Pruning Meta-Trained Networks For On-Device Adaptation, Dawei Gao, Xiaoxi He, Zimu Zhou, Yongxin Tong, Lothar Thiele Nov 2021

Pruning Meta-Trained Networks For On-Device Adaptation, Dawei Gao, Xiaoxi He, Zimu Zhou, Yongxin Tong, Lothar Thiele

Research Collection School Of Computing and Information Systems

Adapting neural networks to unseen tasks with few training samples on resource-constrained devices benefits various Internet-of-Things applications. Such neural networks should learn the new tasks in few shots and be compact in size. Meta-learning enables few-shot learning, yet the meta-trained networks can be overparameterised. However, naive combination of standard compression techniques like network pruning with meta-learning jeopardises the ability for fast adaptation. In this work, we propose adaptation-aware network pruning (ANP), a novel pruning scheme that works with existing meta-learning methods for a compact network capable of fast adaptation. ANP uses weight importance metric that is based on the sensitivity …


Sofi: Reflection-Augmented Fuzzing For Javascript Engines, Xiaoyu He, Xiaofei Xie, Yuekang Li, Jianwen Sun, Feng Li, Wei Zou, Yang Liu, Lei Yu, Jianhua Zhou, Wenchang Shi, Wei Huo Nov 2021

Sofi: Reflection-Augmented Fuzzing For Javascript Engines, Xiaoyu He, Xiaofei Xie, Yuekang Li, Jianwen Sun, Feng Li, Wei Zou, Yang Liu, Lei Yu, Jianhua Zhou, Wenchang Shi, Wei Huo

Research Collection School Of Computing and Information Systems

JavaScript engines have been shown prone to security vulnerabilities, which can lead to serious consequences due to their popularity. Fuzzing is an effective testing technique to discover vulnerabilities. The main challenge of fuzzing JavaScript engines is to generate syntactically and semantically valid inputs such that deep functionalities can be explored. However, due to the dynamic nature of JavaScript and the special features of different engines, it is quite challenging to generate semantically meaningful test inputs.We observed that state-of-the-art semantic-aware JavaScript fuzzers usually require manually written rules to analyze the semantics for a JavaScript engine, which is labor-intensive, incomplete and engine-specific. …


Learning Knowledge-Enriched Company Embeddings For Investment Management, Gary Ang, Ee-Peng Lim Nov 2021

Learning Knowledge-Enriched Company Embeddings For Investment Management, Gary Ang, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Relationships between companies serve as key channels through which the effects of past stock price movements and news events propagate and influence future price movements. Such relationships can be implicitly found in knowledge bases or explicitly represented as knowledge graphs. In this paper, we propose KnowledgeEnriched Company Embedding (KECE), a novel multi-stage attentionbased dynamic network embedding model combining multimodal information of companies with knowledge from Wikipedia and knowledge graph relationships from Wikidata to generate company entity embeddings that can be applied to a variety of downstream investment management tasks. Experiments on an extensive set of real-world stock prices and news …


Cis 440 Unix, George A. Nossa Oct 2021

Cis 440 Unix, George A. Nossa

Open Educational Resources

This document is a topical outline of the CIS 440 UNIX Course. This course is mostly based on lab assignments that are performed by students using their home computers (desktops or laptops). The home computers are configured as virtual machines by installing the Oracle Virtual Box Version 6.12 The Ubuntu Desktop Operating System (version 20.04) is then installed on these virtual machines, which are then used to run the course labs. The first Unit of the syllabus covers the virtual machine configuration for the lab environment and subsequent Units are a topical outline of the course. The detailed content is …


Improving The Performance Of Transportation Networks: A Semi-Centralized Pricing Approach, Zhiguang Cao, Hongliang Guo, Wen Song, Kaizhou Gao, Liujiang Kang, Xuexi Zhang, Qilun Wu Oct 2021

Improving The Performance Of Transportation Networks: A Semi-Centralized Pricing Approach, Zhiguang Cao, Hongliang Guo, Wen Song, Kaizhou Gao, Liujiang Kang, Xuexi Zhang, Qilun Wu

Research Collection School Of Computing and Information Systems

Improving the performance of transportation network is a crucial task in traffic management. In this paper, we start with a cooperative routing problem, which aims to minimize the chance of road network breakdown. To address this problem, we propose a subgradient method, which can be naturally implemented as a semi-centralized pricing approach. Particularly, each road link adopts the pricing scheme to calculate and adjust the local toll regularly, while the vehicles update their routes to minimize the toll costs by exploiting the global toll information. To prevent the potential oscillation brought by the subgradient method, we introduce a heavy-ball method …


Taxthemis: Interactive Mining And Exploration Of Suspicious Tax Evasion Group, Yating Lin, Kamkwai Wong, Yong Wang, Rong Zhang, Bo Dong, Huamin Qu, Qinghua Zheng Oct 2021

Taxthemis: Interactive Mining And Exploration Of Suspicious Tax Evasion Group, Yating Lin, Kamkwai Wong, Yong Wang, Rong Zhang, Bo Dong, Huamin Qu, Qinghua Zheng

Research Collection School Of Computing and Information Systems

Tax evasion is a serious economic problem for many countries, as it can undermine the government’s tax system and lead to an unfair business competition environment. Recent research has applied data analytics techniques to analyze and detect tax evasion behaviors of individual taxpayers. However, they have failed to support the analysis and exploration of the related party transaction tax evasion (RPTTE) behaviors (e.g., transfer pricing), where a group of taxpayers is involved. In this paper, we present TaxThemis, an interactive visual analytics system to help tax officers mine and explore suspicious tax evasion groups through analyzing heterogeneous tax-related data. A …


Adversarial Attacks And Mitigation For Anomaly Detectors Of Cyber-Physical Systems, Yifan Jia, Jingyi Wang, Christopher M. Poskitt, Sudipta Chattopadhyay, Jun Sun, Yuqi Chen Sep 2021

Adversarial Attacks And Mitigation For Anomaly Detectors Of Cyber-Physical Systems, Yifan Jia, Jingyi Wang, Christopher M. Poskitt, Sudipta Chattopadhyay, Jun Sun, Yuqi Chen

Research Collection School Of Computing and Information Systems

The threats faced by cyber-physical systems (CPSs) in critical infrastructure have motivated research into a multitude of attack detection mechanisms, including anomaly detectors based on neural network models. The effectiveness of anomaly detectors can be assessed by subjecting them to test suites of attacks, but less consideration has been given to adversarial attackers that craft noise specifically designed to deceive them. While successfully applied in domains such as images and audio, adversarial attacks are much harder to implement in CPSs due to the presence of other built-in defence mechanisms such as rule checkers (or invariant checkers). In this work, we …


Holistic Prediction For Public Transport Crowd Flows: A Spatio Dynamic Graph Network Approach, Bingjie He, Shukai Li, Chen Zhang, Baihua Zheng, Fugee Tsung Sep 2021

Holistic Prediction For Public Transport Crowd Flows: A Spatio Dynamic Graph Network Approach, Bingjie He, Shukai Li, Chen Zhang, Baihua Zheng, Fugee Tsung

Research Collection School Of Computing and Information Systems

This paper targets at predicting public transport in-out crowd flows of different regions together with transit flows between them in a city. The main challenge is the complex dynamic spatial correlation of crowd flows of different regions and origin-destination (OD) paths. Different from road traffic flows whose spatial correlations mainly depend on geographical distance, public transport crowd flows significantly relate to the region’s functionality and connectivity in the public transport network. Furthermore, influenced by commuters’ time-varying travel patterns, the spatial correlations change over time. Though there exist many works focusing on either predicting in-out flows or OD transit flows of …


Estimating Homophily In Social Networks Using Dyadic Predictions, George Berry, Antonio Sirianni, Ingmar Weber, Jisun An, Michael Macy Aug 2021

Estimating Homophily In Social Networks Using Dyadic Predictions, George Berry, Antonio Sirianni, Ingmar Weber, Jisun An, Michael Macy

Research Collection School Of Computing and Information Systems

Predictions of node categories are commonly used to estimate homophily and other relational properties in networks. However, little is known about the validity of using predictions for this task. We show that estimating homophily in a network is a problem of predicting categories of dyads (edges) in the graph. Homophily estimates are unbiased when predictions of dyad categories are unbiased. Node-level prediction models, such as the use of names to classify ethnicity or gender, do not generally produce unbiased predictions of dyad categories and therefore produce biased homophily estimates. Bias comes from three sources: sampling bias, correlation between model errors …


Explainable Deep Few-Shot Anomaly Detection With Deviation Networks, Guansong Pang, Choubo Ding, Chunhua Shen, Anton Van Den Hengel Aug 2021

Explainable Deep Few-Shot Anomaly Detection With Deviation Networks, Guansong Pang, Choubo Ding, Chunhua Shen, Anton Van Den Hengel

Research Collection School Of Computing and Information Systems

Existing anomaly detection paradigms overwhelmingly focus on training detection models using exclusively normal data or unlabeled data (mostly normal samples). One notorious issue with these approaches is that they are weak in discriminating anomalies from normal samples due to the lack of the knowledge about the anomalies. Here, we study the problem of few-shot anomaly detection, in which we aim at using a few labeled anomaly examples to train sample-efficient discriminative detection models. To address this problem, we introduce a novel weakly-supervised anomaly detection framework to train detection models without assuming the examples illustrating all possible classes of anomaly.Specifically, the …


Deeprepair: Style-Guided Repairing For Deep Neural Networks In The Real-World Operational Environment, Bing Yu, Hua Qi, Guo Qing, Felix Juefei-Xu, Xiaofei Xie, Lei Ma, Jianjun Zhao Aug 2021

Deeprepair: Style-Guided Repairing For Deep Neural Networks In The Real-World Operational Environment, Bing Yu, Hua Qi, Guo Qing, Felix Juefei-Xu, Xiaofei Xie, Lei Ma, Jianjun Zhao

Research Collection School Of Computing and Information Systems

Deep neural networks (DNNs) are continuously expanding their application to various domains due to their high performance. Nevertheless, a well-trained DNN after deployment could oftentimes raise errors during practical use in the operational environment due to the mismatching between distributions of the training dataset and the potential unknown noise factors in the operational environment, e.g., weather, blur, noise, etc. Hence, it poses a rather important problem for the DNNs' real-world applications: how to repair the deployed DNNs for correcting the failure samples under the deployed operational environment while not harming their capability of handling normal or clean data with limited …


An Empirical Study Of Gui Widget Detection For Industrial Mobile Games, Jiaming Ye, Ke Chen, Xiaofei Xie, Lei Ma, Ruochen Huang, Yingfeng Chen, Yinxing Xue, Jianjun Zhao Aug 2021

An Empirical Study Of Gui Widget Detection For Industrial Mobile Games, Jiaming Ye, Ke Chen, Xiaofei Xie, Lei Ma, Ruochen Huang, Yingfeng Chen, Yinxing Xue, Jianjun Zhao

Research Collection School Of Computing and Information Systems

With the widespread adoption of smartphones in our daily life, mobile games experienced increasing demand over the past years. Meanwhile, the quality of mobile games has been continuously drawing more and more attention, which can greatly affect the player experience. For better quality assurance, general-purpose testing has been extensively studied for mobile apps. However, due to the unique characteristic of mobile games, existing mobile testing techniques may not be directly suitable and applicable. To better understand the challenges in mobile game testing, in this paper, we first initiate an early step to conduct an empirical study towards understanding the challenges …


Gp3: Gaussian Process Path Planning For Reliable Shortest Path In Transportation Networks, Hongliang Guo, Xuejie Hou, Zhiguang Cao, Jie Zhang Aug 2021

Gp3: Gaussian Process Path Planning For Reliable Shortest Path In Transportation Networks, Hongliang Guo, Xuejie Hou, Zhiguang Cao, Jie Zhang

Research Collection School Of Computing and Information Systems

This paper investigates the reliable shortest path (RSP) problem in Gaussian process (GP) regulated transportation networks. Specifically, the RSP problem that we are targeting at is to minimize the (weighted) linear combination of mean and standard deviation of the path's travel time. With the reasonable assumption that the travel times of the underlying transportation network follow a multi-variate Gaussian distribution, we propose a Gaussian process path planning (GP3) algorithm to calculate the a priori optimal path as the RSP solution. With a series of equivalent RSP problem transformations, we are able to reach a polynomial time complexity algorithm with guaranteed …


Independent Reinforcement Learning For Weakly Cooperative Multiagent Traffic Control Problem, Chengwei Zhang, Shan Jin, Wanli Xue, Xiaofei Xie, Shengyong Chen, Rong Chen Aug 2021

Independent Reinforcement Learning For Weakly Cooperative Multiagent Traffic Control Problem, Chengwei Zhang, Shan Jin, Wanli Xue, Xiaofei Xie, Shengyong Chen, Rong Chen

Research Collection School Of Computing and Information Systems

The adaptive traffic signal control (ATSC) problem can be modeled as a multiagent cooperative game among urban intersections, where intersections cooperate to counter the city's traffic conditions. Recently, reinforcement learning (RL) has achieved marked successes in managing sequential decision making problems, which motivates us to apply RL in the ATSC problem. One of the largest challenges of this problem is that the observation of intersection is typically partially observable, which limits the learning performance of RL algorithms. Considering the large scale of intersections in an urban traffic environment, we use independent RL to solve ATSC problem in this study. We …


Toward Deep Supervised Anomaly Detection: Reinforcement Learning From Partially Labeled Anomaly Data, Guansong Pang, Anton Van Den Hengel, Chunhua Shen, Longbing Cao Aug 2021

Toward Deep Supervised Anomaly Detection: Reinforcement Learning From Partially Labeled Anomaly Data, Guansong Pang, Anton Van Den Hengel, Chunhua Shen, Longbing Cao

Research Collection School Of Computing and Information Systems

We consider the problem of anomaly detection with a small set of partially labeled anomaly examples and a large-scale unlabeled dataset. This is a common scenario in many important applications. Existing related methods either exclusively fit the limited anomaly examples that typically do not span the entire set of anomalies, or proceed with unsupervised learning from the unlabeled data. We propose here instead a deep reinforcement learning-based approach that enables an end-to-end optimization of the detection of both labeled and unlabeled anomalies. This approach learns the known abnormality by automatically interacting with an anomalybiased simulation environment, while continuously extending the …


Code Integrity Attestation For Plcs Using Black Box Neural Network Predictions, Yuqi Chen, Christopher M. Poskitt, Jun Sun Aug 2021

Code Integrity Attestation For Plcs Using Black Box Neural Network Predictions, Yuqi Chen, Christopher M. Poskitt, Jun Sun

Research Collection School Of Computing and Information Systems

Cyber-physical systems (CPSs) are widespread in critical domains, and significant damage can be caused if an attacker is able to modify the code of their programmable logic controllers (PLCs). Unfortunately, traditional techniques for attesting code integrity (i.e. verifying that it has not been modified) rely on firmware access or roots-of-trust, neither of which proprietary or legacy PLCs are likely to provide. In this paper, we propose a practical code integrity checking solution based on privacy-preserving black box models that instead attest the input/output behaviour of PLC programs. Using faithful offline copies of the PLC programs, we identify their most important …


An Improved Learnable Evolution Model For Solving Multi-Objective Vehicle Routing Problem With Stochastic Demand, Yunyun Niu, Detian Kong, Rong Wen, Zhiguang Cao, Jianhua Xiao Aug 2021

An Improved Learnable Evolution Model For Solving Multi-Objective Vehicle Routing Problem With Stochastic Demand, Yunyun Niu, Detian Kong, Rong Wen, Zhiguang Cao, Jianhua Xiao

Research Collection School Of Computing and Information Systems

The multi-objective vehicle routing problem with stochastic demand (MO-VRPSD) is much harder to tackle than other traditional vehicle routing problems (VRPs), due to the uncertainty in customer demands and potentially conflicted objectives. In this paper, we present an improved multi-objective learnable evolution model (IMOLEM) to solve MO-VRPSD with three objectives of travel distance, driver remuneration and number of vehicles. In our method, a machine learning algorithm, i.e., decision tree, is exploited to help find and guide the desirable direction of evolution process. To cope with the key issue of "route failure" caused due to stochastic customer demands, we propose a …


Neural Architecture Search Of Spd Manifold Networks, R.S. Sukthanker, Zhiwu Huang, S. Kumar, E. G. Endsjo, Y. Wu, Gool L. Van Aug 2021

Neural Architecture Search Of Spd Manifold Networks, R.S. Sukthanker, Zhiwu Huang, S. Kumar, E. G. Endsjo, Y. Wu, Gool L. Van

Research Collection School Of Computing and Information Systems

In this paper, we propose a new neural architecture search (NAS) problem of Symmetric Positive Definite (SPD) manifold networks, aiming to automate the design of SPD neural architectures. To address this problem, we first introduce a geometrically rich and diverse SPD neural architecture search space for an efficient SPD cell design. Further, we model our new NAS problem with a one-shot training process of a single supernet. Based on the supernet modeling, we exploit a differentiable NAS algorithm on our relaxed continuous search space for SPD neural architecture search. Statistical evaluation of our method on drone, action, and emotion recognition …


The 4th Workshop On Heterogeneous Information Network Analysis And Applications (Hena 2021), Chuan Shi, Yuan Fang, Yanfang Ye, Jiawei Zhang Aug 2021

The 4th Workshop On Heterogeneous Information Network Analysis And Applications (Hena 2021), Chuan Shi, Yuan Fang, Yanfang Ye, Jiawei Zhang

Research Collection School Of Computing and Information Systems

The 4th Workshop on Heterogeneous Information Network Analysis and Applications (HENA 2021) is co-located with the 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. The goal of this workshop is to bring together researchers and practitioners in the field and provide a forum for sharing new techniques and applications in heterogeneous information network analysis. This workshop has an exciting program that spans a number of subtopics, such as heterogeneous network embedding and graph neural networks, data mining techniques on heterogeneous information networks, and applications of heterogeneous information network analysis. The workshop program includes several invited speakers, lively discussion …


Forecasting Interaction Order On Temporal Graphs, Wenwen Xia, Yuchen Li, Jianwei Tian, Shenghong Li Aug 2021

Forecasting Interaction Order On Temporal Graphs, Wenwen Xia, Yuchen Li, Jianwei Tian, Shenghong Li

Research Collection School Of Computing and Information Systems

Link prediction is a fundamental task for graph analysis and the topic has been studied extensively for static or dynamic graphs. Essentially, the link prediction is formulated as a binary classification problem about two nodes. However, for temporal graphs, links (or interactions) among node sets appear in sequential orders. And the orders may lead to interesting applications. While a binary link prediction formulation fails to handle such an order-sensitive case. In this paper, we focus on such an interaction order prediction (IOP) problem among a given node set on temporal graphs. For the technical aspect, we develop a graph neural …


Ava: Adversarial Vignetting Attack Against Visual Recognition, Binyu Tian, Felix Juefei-Xu, Qing Guo, Xiaofei Xie, Xiaohong Li, Yang Liu Aug 2021

Ava: Adversarial Vignetting Attack Against Visual Recognition, Binyu Tian, Felix Juefei-Xu, Qing Guo, Xiaofei Xie, Xiaohong Li, Yang Liu

Research Collection School Of Computing and Information Systems

Vignetting is an inherent imaging phenomenon within almost all optical systems, showing as a radial intensity darkening toward the corners of an image. Since it is a common effect for photography and usually appears as a slight intensity variation, people usually regard it as a part of a photo and would not even want to post-process it. Due to this natural advantage, in this work, we study the vignetting from a new viewpoint, i.e., adversarial vignetting attack (AVA), which aims to embed intentionally misleading information into the vignetting and produce a natural adversarial example without noise patterns. This example can …


Claim: Curriculum Learning Policy For Influence Maximization In Unknown Social Networks, Dexun Li, Meghna Lowalekar, Pradeep Varakantham Jul 2021

Claim: Curriculum Learning Policy For Influence Maximization In Unknown Social Networks, Dexun Li, Meghna Lowalekar, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

Influence maximization is the problem of finding a small subset of nodes in a network that can maximize the diffusion of information. Recently, it has also found application in HIV prevention, substance abuse prevention, micro-finance adoption, etc., where the goal is to identify the set of peer leaders in a real-world physical social network who can disseminate information to a large group of people. Unlike online social networks, real-world networks are not completely known, and collecting information about the network is costly as it involves surveying multiple people. In this paper, we focus on this problem of network discovery for …


Bias Field Poses A Threat To Dnn-Based X-Ray Recognition, Bingyu Tian, Qing Guo, Felix Juefei-Xu, Wen Le Chan, Yupeng Cheng, Xiaohong Li, Xiaofei Xie, Shengchao Qin Jul 2021

Bias Field Poses A Threat To Dnn-Based X-Ray Recognition, Bingyu Tian, Qing Guo, Felix Juefei-Xu, Wen Le Chan, Yupeng Cheng, Xiaohong Li, Xiaofei Xie, Shengchao Qin

Research Collection School Of Computing and Information Systems

Chest X-ray plays a key role in screening and diagnosis of many lung diseases including the COVID-19. Many works construct deep neural networks (DNNs) for chest X-ray images to realize automated and efficient diagnosis of lung diseases. However, bias field caused by the improper medical image acquisition process widely exists in the chest X-ray images while the robustness of DNNs to the bias field is rarely explored, posing a threat to the X-ray-based automated diagnosis system. In this paper, we study this problem based on the adversarial attack and propose a brand new attack, i.e., adversarial bias field attack where …


Optimization Planning For 3d Convnets, Zhaofan Qiu, Ting Yao, Chong-Wah Ngo, Tao Mei Jul 2021

Optimization Planning For 3d Convnets, Zhaofan Qiu, Ting Yao, Chong-Wah Ngo, Tao Mei

Research Collection School Of Computing and Information Systems

It is not trivial to optimally learn a 3D Convolutional Neural Networks (3D ConvNets) due to high complexity and various options of the training scheme. The most common hand-tuning process starts from learning 3D ConvNets using short video clips and then is followed by learning long-term temporal dependency using lengthy clips, while gradually decaying the learning rate from high to low as training progresses. The fact that such process comes along with several heuristic settings motivates the study to seek an optimal "path" to automate the entire training. In this paper, we decompose the path into a series of training …


Bountychain: Toward Decentralizing A Bug Bounty Program With Blockchain And Ipfs, Alex Hoffman, Phillipe Austria, Chol Hyun Park, Yoohwan Kim Jun 2021

Bountychain: Toward Decentralizing A Bug Bounty Program With Blockchain And Ipfs, Alex Hoffman, Phillipe Austria, Chol Hyun Park, Yoohwan Kim

Computer Science Faculty Research

Bug Bounty Programs (BBPs) play an important role in providing and maintaining security in software applications. These programs allow testers to discover and resolve bugs before the general public is aware of them, preventing incidents of widespread abuse. However, they have shown problems such as organizations providing accountability of reporting bugs and nonrecognition of testers. In this paper, we discuss Bountychain, a decentralized application using Ethereum-based Smart Contracts (SCs) and the Interplanetary File System (IPFS), a distributed file storage system. Blockchain and SCs provide a safe, secure and transparent platform for a BBP. Testers can submit bug reports and organizations …


Adaptive Aggregation Networks For Class-Incremental Learning, Yaoyao Liu, Bernt Schiele, Qianru Sun Jun 2021

Adaptive Aggregation Networks For Class-Incremental Learning, Yaoyao Liu, Bernt Schiele, Qianru Sun

Research Collection School Of Computing and Information Systems

Class-Incremental Learning (CIL) aims to learn a classification model with the number of classes increasing phase-by-phase. An inherent problem in CIL is the stability-plasticity dilemma between the learning of old and new classes, i.e., high-plasticity models easily forget old classes, but high-stability models are weak to learn new classes. We alleviate this issue by proposing a novel network architecture called Adaptive Aggregation Networks (AANets) in which we explicitly build two types of residual blocks at each residual level (taking ResNet as the baseline architecture): a stable block and a plastic block. We aggregate the output feature maps from these two …