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

OS and Networks Commons™

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

1,762 Full-Text Articles 2,709 Authors 1,183,428 Downloads 111 Institutions

All Articles in OS and Networks

Faceted Search

1,762 full-text articles. Page 17 of 56.

Ava: Adversarial Vignetting Attack Against Visual Recognition, Binyu TIAN, Felix JUEFEI-XU, Qing GUO, Xiaofei XIE, Xiaohong LI, Yang LIU 2021 Singapore Management University

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 …


Forecasting Interaction Order On Temporal Graphs, Wenwen XIA, Yuchen LI, Jianwei TIAN, Shenghong LI 2021 Singapore Management University

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 …


Neural Architecture Search Of Spd Manifold Networks, R.S. SUKTHANKER, Zhiwu HUANG, S. KUMAR, E. G. ENDSJO, Y. WU, Gool L. VAN 2021 Singapore Management University

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 2021 Singapore Management University

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 …


Estimating Homophily In Social Networks Using Dyadic Predictions, George BERRY, Antonio SIRIANNI, Ingmar WEBER, Jisun AN, Michael MACY 2021 Cornell University

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 …


Code Integrity Attestation For Plcs Using Black Box Neural Network Predictions, Yuqi CHEN, Christopher M. POSKITT, Jun SUN 2021 Singapore Management University

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 …


Optimization Planning For 3d Convnets, Zhaofan QIU, Ting YAO, Chong-wah NGO, Tao MEI 2021 Singapore Management University

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 2021 Singapore Management University

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 2021 Singapore Management University

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 2021 Louisiana State University and Agricultural and Mechanical College

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 2021 Independent Researcher

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 2021 Dartmouth College

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(m1+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 2021 University of Nevada, Las Vegas

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 2021 California Polytechnic State University, San Luis Obispo

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 2021 Nanyang Technological University

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 …


Witness For Two-Site Enabled Coordination, Sriram Priyatham Siram 2021 San Jose State University

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 …


Adaptive Aggregation Networks For Class-Incremental Learning, Yaoyao LIU, Bernt SCHIELE, Qianru SUN 2021 Max Plank Institute for Informatics

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 …


Cyberbullying Classification Based On Social Network Analysis, Anqi Wang 2021 San Jose State University

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, …


Higher-Order Link Prediction Using Node And Subgraph Embeddings, Kalpnil Anjan 2021 San Jose State University

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 …


Overlapping Community Detection In Social Networks, Akshar Panchal 2021 San Jose State University

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 …


Digital Commons powered by bepress