Engineering Commons^™

Methodologies For Quantum Circuit And Algorithm Design At Low And High Levels, Edison Tsai

Dissertations and Theses

Although the concept of quantum computing has existed for decades, the technology needed to successfully implement a quantum computing system has not yet reached the level of sophistication, reliability, and scalability necessary for commercial viability until very recently. Significant progress on this front was made in the past few years, with IBM planning to create a 1000-qubit chip by the end of 2023, and Google already claiming to have achieved quantum supremacy. Other major industry players such as Intel and Microsoft have also invested significant amounts of resources into quantum computing research.

Any viable computing system requires both hardware and …

Sequentially-Closed And Forward-Closed String Rewriting Systems, Yu Zhang

Legacy Theses & Dissertations (2009 - 2024)

In this dissertation we introduce the new concept of sequentially-closed string rewriting systems which generalizes forward-closed string rewriting systems and monadic string rewriting systems. We also investigate subclasses and properties of finite and regular sequentially-closed systems and forward-closed systems.

Synchronous Subgraphs In Networks, Navita Jain

Legacy Theses & Dissertations (2009 - 2024)

Community detection is a central problem in network analysis. The majority of existing work defines communities as subsets of nodes that are structurally well-connected and isolated from the rest of the network. Apart from their underlying connectivity, nodes in real-world networks exhibit temporal activity: user posts in social networks, browsing activity on web pages and neuron activations in brain networks to name a few. While edges encode potential for community interactions, participation in the community can be quantified by synchronized member activity. Given both the network structure and individual node activity, how can we detect communities that are both well-connected …

Use Of Tabu Search In A Solver To Map Complex Networks Onto Emulab Testbeds, Jason E. Macdonald

Theses and Dissertations

The University of Utah's solver for the testbed mapping problem uses a simulated annealing metaheuristic algorithm to map a researcher's experimental network topology onto available testbed resources. This research uses tabu search to find near-optimal physical topology solutions to user experiments consisting of scale-free complex networks. While simulated annealing arrives at solutions almost exclusively by chance, tabu search incorporates the use of memory and other techniques to guide the search towards good solutions. Both search algorithms are compared to determine whether tabu search can produce equal or higher quality solutions than simulated annealing in a shorter amount of time. It …

Development Of Self-Adaptive Back Propagation And Derivative Free Training Algorithms In Artificial Neural Networks, Shamsuddin Ahmed

Theses: Doctorates and Masters

Three new iterative, dynamically self-adaptive, derivative-free and training parameter free artificial neural network (ANN) training algorithms are developed. They are defined as self-adaptive back propagation, multi-directional and restart ANN training algorithms. The descent direction in self-adaptive back propagation training is determined implicitly by a central difference approximation scheme, which chooses its step size according to the convergence behavior of the error function. This approach trains an ANN when the gradient information of the corresponding error function is not readily available. The self- adaptive variable learning rates per epoch are determined dynamically using a constrained interpolation search. As a result, appropriate …

Improving The Run Time Of The Decomposition Algorithm For Fault Tolerant Clos Interconnection Networks Through Swap Re-Ordering, Andrea Laura Mcmakin

Theses

Clos interconnection networks, used in data networks and computing systems, can contain extra switches to be used in faulty conditions. The speed of such fault tolerant Clos interconnection networks is improved through the use these switches in no-fault situations. The network can be represented by a matrix, which is then decomposed using an algorithm, and the switch settings are thus assigned.

The original decomposition algorithm consisted of four element swaps in the following order: wild swap, simple swap, next simple swap, and successive swap. However, by re-arranging these swaps with the simple swap first, followed by the next simple and …

Ignoring Interprocessor Communication During Scheduling, Chintamani M. Patwardhan

Dissertations and Theses

The goal of parallel processing is to achieve high speed computing by partitioning a program into concurrent parts, assigning them in an efficient way to the available processors, scheduling the program and then executing the concurrent parts simultaneously. In the past researchers have combined the allocation of tasks in a program and scheduling of those tasks into one operation. We define scheduling as a process of efficiently assigning priorities to the already allocated tasks in a program. Assignment of priorities is important in cases when more than one task at a processor is ready for execution. Most heuristics for scheduling …

Rivest-Shamir-Adelman Cryptosystem, Edward A. Fetzner

Theses & Honors Papers

Cryptography, the art of writing secret messages, has been practiced for almost 3000 years. Two people have a message to communicate to each other , with a chance of an outside person intercepting the message before it reaches the receiver . Therefore, the message must be put through an encryption scheme to keep the intervening person from finding the true nature of the message . An encryption scheme is coding a message using an enciphering key and then decoding the coded message with a deciphering key .