Other Computer Sciences Commons^™

Framework For Assessing Information System Security Posture Risks, Syed Waqas Hamdani

Electronic Thesis and Dissertation Repository

In today’s data-driven world, Information Systems, particularly the ones operating in regulated industries, require comprehensive security frameworks to protect against loss of confidentiality, integrity, or availability of data, whether due to malice, accident or otherwise. Once such a security framework is in place, an organization must constantly monitor and assess the overall compliance of its systems to detect and rectify any issues found. This thesis presents a technique and a supporting toolkit to first model dependencies between security policies (referred to as controls) and, second, devise models that associate risk with policy violations. Third, devise algorithms that propagate risk when …

The History Of The Enigma Machine, Jenna Siobhan Parkinson

History Publications

The history of the Enigma machine begins with the invention of the rotor-based cipher machine in 1915. Various models for rotor-based cipher machines were developed somewhat simultaneously in different parts of the world. However, the first documented rotor machine was developed by Dutch naval officers in 1915. Nonetheless, the Enigma machine was officially invented following the end of World War I by Arthur Scherbius in 1918 (Faint, 2016).

Self-Assembly Of Tiles: Theoretical Models, The Power Of Signals, And Local Computing, Amirhossein Simjour

Electronic Thesis and Dissertation Repository

DNA-based self-assembly is an autonomous process whereby a disordered system of DNA sequences forms an organized structure or pattern as a consequence of Watson-Crick complementarity of DNA sequences, without external direction.

Here, we propose self-assembly (SA) hypergraph automata as an automata-theoretic model for patterned self-assembly. We investigate the computational power of SA-hypergraph automata and show that for every recognizable picture language, there exists an SA-hypergraph automaton that accepts this language. Conversely, we prove that for any restricted SA-hypergraph automaton, there exists a Wang Tile System, a model for recognizable picture languages, that accepts the same language.

Moreover, we investigate the …

The Contributions Of Anatol Rapoport To Game Theory, Erika Simpson

Political Science Publications

Game theory is used to rationally and dispassionately examine the strategic behaviour of nations, especially superpower behaviour. This article explains how basic game theory - at its simplest level - was used by Anatol Rapoport to generate ideas about how to enhance world peace. Rapoport was at the forefront of the game theoreticians who sought to conceptualize strategies that could promote international cooperation. Accordingly, the basic logic of game theory is explained using the game models of ‘Chicken’ and ‘Prisoner’s Dilemma’. These models were used by Rapoport in his books and lectures in simple and complex ways. Then Rapoport’s revolutionary …

Energy Based Multi-Model Fitting And Matching Problems, Hossam N. Isack

Electronic Thesis and Dissertation Repository

Feature matching and model fitting are fundamental problems in multi-view geometry. They are chicken-&-egg problems: if models are known it is easier to find matches and vice versa. Standard multi-view geometry techniques sequentially solve feature matching and model fitting as two independent problems after making fairly restrictive assumptions. For example, matching methods rely on strong discriminative power of feature descriptors, which fail for stereo images with repetitive textures or wide baseline. Also, model fitting methods assume given feature matches, which are not known a priori. Moreover, when data supports multiple models the fitting problem becomes challenging even with known matches …

Optimizing The Analysis Of Electroencephalographic Data By Dynamic Graphs, Mehrsasadat Golestaneh

Electronic Thesis and Dissertation Repository

The brain’s underlying functional connectivity has been recently studied using tools offered by graph theory and network theory. Although the primary research focus in this area has so far been mostly on static graphs, the complex and dynamic nature of the brain’s underlying mechanism has initiated the usage of dynamic graphs, providing groundwork for time sensi- tive and finer investigations. Studying the topological reconfiguration of these dynamic graphs is done by exploiting a pool of graph metrics, which describe the network’s characteristics at different scales. However, considering the vast amount of data generated by neuroimaging tools, heavy computation load and …

Collaborative Policy-Based Autonomic Management In Iaas Clouds, Omid Mola

Electronic Thesis and Dissertation Repository

With the increasing number of "machines" (either virtual or physical) in a computing environment, it is becoming harder to monitor and manage these resources. Relying on human administrators, even with tools, is expensive and the growing complexity makes management even harder. The alternative is to look for automated approaches that can monitor and manage computing resources in real time with no human intervention. One of the approaches to this problem is policy-based autonomic management. However, in large systems having one single autonomic manager to manage everything is almost impossible. Therefore, multiple autonomic managers will be needed and these will need …

Workflow-Net Based Cooperative Multi-Agent Systems, Yehia T. Kotb

Electronic Thesis and Dissertation Repository

Workflow-nets are mathematical frameworks that are used to formally describe, model and implement workflows. First, we propose critical section workflow nets (abbreviated WFCSnet). This framework allows feedbacks in workflow systems while ensuring the soundness of the workflow. Feedback is generally not recommended in workflow systems as they threaten the soundness of the system. The proposed WFCSnet allows safe feedback and limits the maximum number of activities per workflow as required. A theorem for soundness of WFCSnet is presented. Serializability, Separability, Quasi-liveness and CS-Properties of WFCSnet are examined and some theorems and lemmas are proposed to mathematically formalize them. In this …

Algorithmic Contributions To The Theory Of Regular Chains, Wei Pan

Electronic Thesis and Dissertation Repository

Regular chains, introduced about twenty years ago, have emerged as one of the major

tools for solving polynomial systems symbolically. In this thesis, we focus on different

algorithmic aspects of the theory of regular chains, from theoretical questions to high-

performance implementation issues.

The inclusion test for saturated ideals is a fundamental problem in this theory.

By studying the primitivity of regular chains, we show that a regular chain generates

its saturated ideal if and only if it is primitive. As a result, a family of inclusion tests

can be detected very efficiently.

The algorithm to compute the regular GCDs …