Computer Engineering Commons^™

Application Of Genomic Compression Techniques For Efficient Storage Of Captured Network Traffic Packets, James Alfred Loving

CCE Theses and Dissertations

In cybersecurity, one of most important forensic tools are audit files; they contain a record of cyber events that occur on systems throughout the enterprise. Threats to an enterprise have become one of the top concerns of IT professionals world-wide. Although there are various approaches to detect anomalous insider behavior, these approaches are not always able to detect advanced persistent threats or even exfiltration of sensitive data by insiders. The issue is the volume of network data required to identify this anomalous activity. It has been estimated that an average corporate user creates a minimum of 1.5 MB audit data …

Using An Integrative Machine Learning Approach To Study Microrna Regulation Networks In Pancreatic Cancer Progression, Roland Madadjim

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

With advances in genomic discovery tools, recent biomedical research has produced a massive amount of genomic data on post-transcriptional regulations related to various transcript factors, microRNAs, lncRNAs, epigenetic modifications, and genetic variations. In this direction, the field of gene regulation network inference is created and aims to understand the interactome regulations between these molecules (e.g., gene-gene, miRNA-gene) that take place to build models able to capture behavioral changes in biological systems. A question of interest arises in integrating such molecules to build a network while treating each specie in its uniqueness. Given the dynamic changes of interactome in chaotic systems …

Zooming Into The Pandemic! A Forensic Analysis Of The Zoom Application, Andrew Mahr, Meghan Cichon, Sophia Mateo, Cinthya Grajeda, Ibrahim Baggili

Electrical & Computer Engineering and Computer Science Faculty Publications

The global pandemic of COVID-19 has turned the spotlight on video conferencing applications like never before. In this critical time, applications such as Zoom have experienced a surge in its user base jump over the 300 million daily mark (ZoomBlog, 2020). The increase in use has led malicious actors to exploit the application, and in many cases perform Zoom Bombings. Therefore forensically examining Zoom is inevitable. Our work details the primary disk, network, and memory forensic analysis of the Zoom video conferencing application. Results demonstrate it is possible to find users' critical information in plain text and/or encrypted/encoded, such …

Generate Network’S Disjoint Mps Based On Simevents Simulation, Tang Jian, Fuli Ai, Faming Shao, Jiaojiao Zhang

Journal of System Simulation

Abstract: The disjoint MPs (Minimal Path sets) algorithm proposed was improved from the point of signal transmission. The CoA network was transformed into a corresponding signal network, which was composed of forward and backward transmitting paths. According to the basic principle of disjoint MPs algorithm, a set of signal transmitting and rewriting rules, including forward and backward processing rules, were designed to make the disjoint MPs could be generated by means of DES (Discrete Event Simulation). The basic realizing idea was studied in SimEvents, in which, the entities acted as the information carriers, and the nodes as the …

Classification Of Vegetation In Aerial Imagery Via Neural Network, Gevand Balayan

UNLV Theses, Dissertations, Professional Papers, and Capstones

This thesis focuses on the task of trying to find a Neural Network that is best suited for identifying vegetation from aerial imagery. The goal is to find a way to quickly classify items in an image as highly likely to be vegetation(trees, grass, bushes and shrubs) and then interpolate that data and use it to mark sections of an image as vegetation. This has practical applications as well. The main motivation of this work came from the effort that our town takes in conserving water. By creating an AI that can easily recognize plants, we can better monitor the …

An Empirical Comparison Of Networks And Routing Strategies For Parallel Computation, Ronald I. Greenberg, Lee Guan

Ronald Greenberg

This paper compares message routing capabilities of important networks proposed for general-purpose parallel computing. All the networks have been proven to have some type of universality property, i.e., an ability to simulate other networks of comparable cost with modest slowdown, using appropriate cost and communication models. But in this paper we seek an empirical comparison of communication capability under typical direct use rather than an analysis of worst-case results for simulating message traffic of another network.

Analyzing Methods Of Network Topologies Based On Chordal Rings, Damian Ledzinski, Sandra Smigiel, Lukasz Zabludowski

Turkish Journal of Electrical Engineering and Computer Sciences

This paper presents a methodology for the transmission properties research of networks patterned according to the third-degree chordal graphs. When designing and analyzing ICT systems, it is vital to consider the topology of network components. The telecommunication network structure can be described by a graph. Computing modes or specialized computers are the vertexes and the edges are bidirectional, independent transmission channels that represent the connected nodes. The algorithm is potentially useful for the determination of the impact of diameter and an average path length of the chordal rings on the properties of the transmission network. It is also useful for …

Accurate Modeling Of The Siemens S7 Scada Protocol For Intrusion Detection And Digital Forensics, Amit Kleinmann, Avishai Wool

Journal of Digital Forensics, Security and Law

The Siemens S7 protocol is commonly used in SCADA systems for communications between a Human Machine Interface (HMI) and the Programmable Logic Controllers (PLCs). This paper presents a model-based Intrusion Detection Systems (IDS) designed for S7 networks. The approach is based on the key observation that S7 traffic to and from a specific PLC is highly periodic; as a result, each HMI-PLC channel can be modeled using its own unique Deterministic Finite Automaton (DFA). The resulting DFA-based IDS is very sensitive and is able to flag anomalies such as a message appearing out of its position in the normal sequence …

Shifted-Modified Chebyshev Filters, Meti̇n Şengül

Turkish Journal of Electrical Engineering and Computer Sciences

This paper introduces a new type of filter approximation method that utilizes shifted-modified Chebyshev filters. Construction of the new filters involves the use of shifted-modified Chebyshev polynomials that are formed using the roots of conventional Chebyshev polynomials. The study also includes 2 tables containing the shifted-modified Chebyshev polynomials and the normalized element values for the low-pass prototype filters up to degree 6. The transducer power gain, group delay, and impulse and step responses of the proposed filters are compared with those of the Butterworth and Chebyshev filters, and a sixth-order filter design example is presented to illustrate the implementation of …

Improving Backup And Restore Performance For Deduplication-Based Cloud Backup Services, Stephen Mkandawire

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

The benefits provided by cloud computing and the space savings offered by data deduplication make it attractive to host data storage services like backup in the cloud. Data deduplication relies on comparing fingerprints of data chunks, and store them in the chunk index, to identify and remove redundant data, with an ultimate goal of saving storage space and network bandwidth.

However, the chunk index presents a bottleneck to the throughput of the backup operation. While several solutions to address deduplication throughput have been proposed, the chunk index is still a centralized resource and limits the scalability of both storage capacity …

An Empirical Comparison Of Networks And Routing Strategies For Parallel Computation, Ronald I. Greenberg, Lee Guan

Computer Science: Faculty Publications and Other Works

This paper compares message routing capabilities of important networks proposed for general-purpose parallel computing. All the networks have been proven to have some type of universality property, i.e., an ability to simulate other networks of comparable cost with modest slowdown, using appropriate cost and communication models. But in this paper we seek an empirical comparison of communication capability under typical direct use rather than an analysis of worst-case results for simulating message traffic of another network.