OS and Networks Commons^™

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 …

Toward A Quantum Neural Network: Proposing The Qaoa Algorithm To Replace A Feed Forward Neural Network, Erick Serrano

Undergraduate Research Symposium Posters

With a surge in popularity of machine learning as a whole, many researchers have sought optimization methods to reduce the complexity of neural networks; however, only recent attempts have been made to optimize neural networks via quantum computing methods. In this paper, we describe the training process of a feed forward neural network (FFNN) and the time complexity of the training process. We highlight the inefficiencies of the FFNN training process, particularly when implemented with gradient descent, and introduce a call to action for optimization of a FFNN. Afterward, we discuss the strides made in quantum computing to improve the …

An Online Algorithm For The 2-Server Problem On The Line With Improved Competitiveness, Lucas Adam Bang

UNLV Theses, Dissertations, Professional Papers, and Capstones

In this thesis we present a randomized online algorithm for the 2-server problem on the line, named R-LINE (for Randomized Line). This algorithm achieves the lowest competitive ratio of any known randomized algorithm for the 2-server problem on the line.

The competitiveness of R-LINE is less than 1.901. This result provides a significant improvement over the previous known competitiveness of 155/78 (approximately 1.987), by Bartal, Chrobak, and Larmore, which was the first randomized algorithm for the 2-server problem one the line with competitiveness less than 2. Taking inspiration from this algorithm,we improve this result by utilizing ideas from T-theory, game …

Message Passing Algorithm For Different Problems Sum, Mean, Guide And Sorting In A Rooted Tree Network., Sabaresh Nageswara Rao Maddula

UNLV Theses, Dissertations, Professional Papers, and Capstones

In this thesis, we give message passing algorithms in distributed environment for five different problems of a rooted tree having n nodes. In the first algorithm, every node has a value; the root calculates the sum of those values, and sends it to all the nodes in the network. In the second algorithm, the root computes the value of mean of values of all the nodes, and sends it to all nodes of the network. The third algorithm calculates the guide pairs. Guide pair of a node x is an ordered pair (pre_index(x), post_index(x)), where pre_index(x) and post_index(x) are the …

Self-Stabilizing Leader Election In Dynamic Networks, Hema Piniganti

UNLV Theses, Dissertations, Professional Papers, and Capstones

The leader election problem is one of the fundamental problems in distributed computing. It has applications in almost every domain. In dynamic networks, topology is expected to change frequently. An algorithm A is self-stabilizing if, starting from a completely arbitrary configuration, the network will eventually reach a legitimate configuration.

Note that any self-stabilizing algorithm for the leader election problem is also an algorithm for the dynamic leader election problem, since when the topology of the network changes, we can consider that the algorithm is starting over again from an arbitrary state. There are a number of such algorithms in the …

Dynamic Distributed Programming And Applications To Swap Edge Problem, Feven Z. Andemeskel

UNLV Theses, Dissertations, Professional Papers, and Capstones

Link failure is a common reason for disruption in communication networks. If communication between processes of a weighted distributed network is maintained by a spanning tree T, and if one edge e of T fails, communication can be restored by finding a new spanning tree, T’. If the network is 2-edge connected, T’ can always be constructed by replacing e by a single edge, e’, of the network. We refer to e’ as a swap edge of e.

The best swap edge problem is to find the best choice of e’, that is, that e which causes the new spanning …

Visual Occam: High Level Visualization And Design Of Process Networks, Mikolaj M. Slomka

UNLV Theses, Dissertations, Professional Papers, and Capstones

With networks, multiprocessors, and multi-threaded systems becoming more common in our world it is increasingly evident that concurrent programming is not something to be ignored or marginalized even though many takes on concurrency (mainly by means of monitors or shared resources) have proven to be difficult to deal with on large scales. Thankfully, a good deal of work has already been done to combat this, through CSP, occam, and other such derivatives, to produce a scalable process oriented paradigm. Still, it is cumbersome to attempt to deal with the intricacies of such communicating networks down to every minutia; if, instead, …

Wide-Area Incident Management System On The Internet, Kaan Ozbay, Pushkin Kachroo

Electrical & Computer Engineering Faculty Research

The incident management process consists of four sequential steps-incident detection, response, clearance and recovery. Each of these components comprises of a number of operations and coordinated decision-making between the agencies involved. The provision of computer based support tools for the personnel involved will help develop appropriate strategies and increase efficiency and expediency. Existing systems are developed on various traditional computing platforms. However, with the advent of World Wide Web and Internet based programming tools such as Java, it is now possible to develop platform independent decision support tools for the incident management agencies. Any agency will be able to use …