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

OS and Networks Commons

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

1,816 Full-Text Articles 1,884 Authors 638,700 Downloads 98 Institutions

All Articles in OS and Networks

Faceted Search

1,816 full-text articles. Page 1 of 63.

Taxthemis: Interactive Mining And Exploration Of Suspicious Tax Evasion Group, Yating LIN, Kamkwai WONG, Yong WANG, Rong ZHANG, Bo DONG, Huamin QU, Qinghua ZHENG 2021 Singapore Management University

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 ...


Route Choice In A Stochastic Time-Dependent Network: The Recursive Model And Solution Algorithm, Tien MAI, Xinlian YU, Song GAO, Emma FREJINGER 2021 Singapore Management University

Route Choice In A Stochastic Time-Dependent Network: The Recursive Model And Solution Algorithm, Tien Mai, Xinlian Yu, Song Gao, Emma Frejinger

Research Collection School Of Computing and Information Systems

We propose a Recursive Logit (STD-RL) model for routing policy choice in a stochastic time-dependent (STD) network, where a routing policy is a mapping from states to actions on which link to take next, and a state is defined by node, time and information. A routing policy encapsulates travelers’ adaptation to revealed traffic conditions when making route choices. The STD-RL model circumvents choice set generation, a procedure with known issues related to estimation and prediction. In a given state, travelers make their link choice maximizing the sum of the utility of the outgoing link and the expected maximum utility until ...


Holistic Prediction For Public Transport Crowd Flows: A Spatio Dynamic Graph Network Approach, Bingjie HE, Shukai LI, Chen ZHANG, Baihua ZHENG, Fugee TSUNG 2021 Singapore Management University

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 ...


Interdomain Route Leak Mitigation: A Pragmatic Approach, Benjamin Tyler McDaniel 2021 University of Tennessee, Knoxville

Interdomain Route Leak Mitigation: A Pragmatic Approach, Benjamin Tyler Mcdaniel

Doctoral Dissertations

The Internet has grown to support many vital functions, but it is not administered by any central authority. Rather, the many smaller networks that make up the Internet - called Autonomous Systems (ASes) - independently manage their own distinct host address space and routing policy. Routers at the borders between ASes exchange information about how to reach remote IP prefixes with neighboring networks over the control plane with the Border Gateway Protocol (BGP). This inter-AS communication connects hosts across AS boundaries to build the illusion of one large, unified global network - the Internet. Unfortunately, BGP is a dated protocol that allows ASes ...


Estimating Homophily In Social Networks Using Dyadic Predictions, George BERRY, Antonio SIRIANNI, Ingmar WEBER, Jisun AN, Michael MACY 2021 Singapore Management 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 ...


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 ...


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 ...


Attack As Defense: Characterizing Adversarial Examples Using Robustness, Zhe ZHAO, Guangke CHEN, Jingyi WANG, Yiwei YANG, Fu SONG, Jun SUN 2021 Singapore Management University

Attack As Defense: Characterizing Adversarial Examples Using Robustness, Zhe Zhao, Guangke Chen, Jingyi Wang, Yiwei Yang, Fu Song, Jun Sun

Research Collection School Of Computing and Information Systems

As a new programming paradigm, deep learning has expanded its application to many real-world problems. At the same time, deep learning based software are found to be vulnerable to adversarial attacks. Though various defense mechanisms have been proposed to improve robustness of deep learning software, many of them are ineffective against adaptive attacks. In this work, we propose a novel characterization to distinguish adversarial examples from benign ones based on the observation that adversarial examples are significantly less robust than benign ones. As existing robustness measurement does not scale to large networks, we propose a novel defense framework, named attack ...


Traffic Engineering In Planet-Scale Cloud Networks, Rachee Singh 2021 University of Massachusetts Amherst

Traffic Engineering In Planet-Scale Cloud Networks, Rachee Singh

Doctoral Dissertations

Cloud wide-area networks (WANs) play a key role in enabling high performance applications on the Internet. Cloud providers like Amazon, Google and Microsoft, spend over hundred million dollars annually to design, provision and operate their WANs to fulfill the low-latency, high-bandwidth communication demands of their clients. In the last decade, cloud providers have rapidly expanded their datacenter deployments, network equipment and backbone capacity, preparing their infrastructure to meet the growing client demands. This dissertation re-examines the design and operation choices made by cloud providers in this phase of exponential growth along the axes of network performance, reliability and operational expenditure ...


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 ...


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 Publications

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.


Adaptive Aggregation Networks For Class-Incremental Learning, Yaoyao LIU, Bernt SCHIELE, Qianru SUN 2021 Singapore Management University

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 ...


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 ...


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 ...


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 ...


Fake News Analysis And Graph Classification On A Covid-19 Twitter Dataset, Kriti Gupta 2021 San Jose State University

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 2021 San Jose State University

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 ...


Digital Commons powered by bepress