OS and Networks Commons^™

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

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 …

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 …

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 …

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

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 …

Characterizing And Optimizing Asynchronous Event-Driven Architecture For Modern Cloud Systems, Shungeng Zhang

LSU Doctoral Dissertations

Achieving good performance and high efficiency simultaneously is an essential requirement for emerging modern cloud systems such as e-commerce due to their business impact. For example, Akamai reported that every 100ms delay in website load time could lead to a 6% drop in sales. Unfortunately, achieving good performance (e.g., low latency) for modern cloud systems at high resource utilization is significantly challenging. Despite continuing efforts by cloud professionals, however, they have consistently experienced performance degradation problems (e.g., the long-tail latency problem) due to the bursty workload in the cloud. To resolve the performance degradation problems, many previous research efforts have …

Windows Kernel Hijacking Is Not An Option: Memoryranger Comes To The Rescue Again, Igor Korkin

Journal of Digital Forensics, Security and Law

The security of a computer system depends on OS kernel protection. It is crucial to reveal and inspect new attacks on kernel data, as these are used by hackers. The purpose of this paper is to continue research into attacks on dynamically allocated data in the Windows OS kernel and demonstrate the capacity of MemoryRanger to prevent these attacks. This paper discusses three new hijacking attacks on kernel data, which are based on bypassing OS security mechanisms. The first two hijacking attacks result in illegal access to files open in exclusive access. The third attack escalates process privileges, without applying …

Counting And Sampling Small Structures In Graph And Hypergraph Data Streams, Themistoklis Haris

Dartmouth College Undergraduate Theses

In this thesis, we explore the problem of approximating the number of elementary substructures called simplices in large k-uniform hypergraphs. The hypergraphs are assumed to be too large to be stored in memory, so we adopt a data stream model, where the hypergraph is defined by a sequence of hyperedges.

First we propose an algorithm that (ε, δ)-estimates the number of simplices using O(m^1+1/k / T) bits of space. In addition, we prove that no constant-pass streaming algorithm can (ε, δ)- approximate the number of simplices using less than O( m ^1+1/k / T ) bits of space. Thus …

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 …

Pier Ocean Pier, Brandon J. Nowak

Computer Engineering

Pier Ocean Peer is a weatherproof box containing a Jetson Nano, connected to a cell modem and camera, and powered by a Lithium Iron Phosphate battery charged by a 50W solar panel. This system can currently provide photos to monitor the harbor seal population that likes to haul out at the base of the Cal Poly Pier, but more importantly it provides a platform for future expansion by other students either though adding new sensors directly to the Jetson Nano or by connecting to the jetson nano remotely through a wireless protocol of their choice.

Multi-View Collaborative Network Embedding, Sezin Kircali Ata, Yuan Fang, Min Wu, Jiaqi Shi, Chee Keong Kwoh, Xiaoli Li

Research Collection School Of Computing and Information Systems

Real-world networks often exist with multiple views, where each view describes one type of interaction among a common set of nodes. For example, on a video-sharing network, while two user nodes are linked, if they have common favorite videos in one view, then they can also be linked in another view if they share common subscribers. Unlike traditional single-view networks, multiple views maintain different semantics to complement each other. In this article, we propose Multi-view collAborative Network Embedding (MANE), a multi-view network embedding approach to learn low-dimensional representations. Similar to existing studies, MANE hinges on diversity and collaboration—while diversity enables …

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 …

Witness For Two-Site Enabled Coordination, Sriram Priyatham Siram

Master's Projects

Many replicated data services utilize majority quorums to safely replicate data changes in the presence of server failures. Majority quorum-based services require a simple majority of the servers to be operational for the service to stay available. A key limitation of the majority quorum is that if a service is composed of just two servers, progress cannot be made even if a single server fails because the majority quorum size is also two. This is called the Two-Server problem. A problem similar to the Two-Server problem occurs when a service’s servers are spread across only two failure domains. Servers in …

Higher-Order Link Prediction Using Node And Subgraph Embeddings, Kalpnil Anjan

Master's Projects

Social media, academia collaborations, e-commerce websites, biological structures, and other real-world networks are modeled as graphs to represent their entities and relationships in an abstract way. Such graphs are becoming more complex and informative, and by analyzing them we can solve various problems and find hidden insights. Some applications include predicting relationships and potential links between nodes, classifying nodes, and finding the most influential nodes in the graph, etc.

A large amount of research is being done in the field of predicting links between two nodes. However, predicting a future relationship among three or more nodes in a graph is …

Cyberbullying Classification Based On Social Network Analysis, Anqi Wang

Master's Projects

With the popularity of social media platforms such as Facebook, Twitter, and Instagram, people widely share their opinions and comments over the Internet. Exten- sive use of social media has also caused a lot of problems. A representative problem is Cyberbullying, which is a serious social problem, mostly among teenagers. Cyber- bullying occurs when a social media user posts aggressive words or phrases to harass other users, and that leads to negatively affects on their mental and social well-being. Additionally, it may ruin the reputation of that media. We are considering the problem of detecting posts that are aggressive. Moreover, …

Overlapping Community Detection In Social Networks, Akshar Panchal

Master's Projects

Social networking sites are important to connect with the world virtually. As the number of users accessing these sites increase, the data and information keeps on increasing. There are communities and groups which are formed virtually based on different factors. We can visualize these communities as networks of users or nodes and the relationships or connections between them as edges. This helps in evaluating and analyzing different factors that influence community formation in such a dense network. Community detection helps in revealing certain characteristics which makes these groups in the network unique and different from one another. We can use …

Fake News Analysis And Graph Classification On A Covid-19 Twitter Dataset, Kriti Gupta

Master's Projects

Earlier researches have showed that the spread of fake news through social media can have a huge impact to society and also to individuals in an extremely negative way. In this work we aim to study the spread of fake news compared to real news in a social network. We do that by performing classical social network analysis to discover various characteristics, and formulate the problem as a binary classification, where we have graphs modeling the spread of fake and real news. For our experiments we rely on how news are propagated through a popular social media services such as …

Using Oracle To Solve Zookeeper On Two-Replica Problems, Ching-Chan Lee

Master's Projects

The project introduces an Oracle, a failure detector, in Apache ZooKeeper and makes it fault-tolerant in a two-node system. The project demonstrates the Oracle authorizes the primary process to maintain the liveness when the majority’s rule becomes an obstacle to continue Apache ZooKeeper service. In addition to the property of accuracy and completeness from Chandra et al.’s research, the project proposes the property of see to avoid losing transactions and the property of mutual exclusion to avoid split-brain issues. The hybrid properties render not only more sounder flexibility in the implementation but also stronger guarantees on safety. Thus, the Oracle …

Semi-Supervised Spatial-Temporal Feature Learning On Anomaly-Based Network Intrusion Detection, Huy Mai

Computer Science and Computer Engineering Undergraduate Honors Theses

Due to a rapid increase in network traffic, it is growing more imperative to have systems that detect attacks that are both known and unknown to networks. Anomaly-based detection methods utilize deep learning techniques, including semi-supervised learning, in order to effectively detect these attacks. Semi-supervision is advantageous as it doesn't fully depend on the labelling of network traffic data points, which may be a daunting task especially considering the amount of traffic data collected. Even though deep learning models such as the convolutional neural network have been integrated into a number of proposed network intrusion detection systems in recent years, …