Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Entire DC Network
Phylogenetic Analysis Of Within-Host Serially-Sampled Viral Data, Patricia Buendia
Phylogenetic Analysis Of Within-Host Serially-Sampled Viral Data, Patricia Buendia
FIU Electronic Theses and Dissertations
The primary goal of this dissertation is the study of patterns of viral evolution inferred from serially-sampled sequence data, i.e., sequence data obtained from strains isolated at consecutive time points from a single patient or host. RNA viral populations have an extremely high genetic variability, largely due to their astronomical population sizes within host systems, high replication rate, and short generation time. It is this aspect of their evolution that demands special attention and a different approach when studying the evolutionary relationships of serially-sampled sequence data. New methods that analyze serially-sampled data were developed shortly after a groundbreaking HIV-1 study …
A Framework For Transforming, Analyzing, And Realizing Software Designs In Unified Modeling Language, Zhijiang Dong
A Framework For Transforming, Analyzing, And Realizing Software Designs In Unified Modeling Language, Zhijiang Dong
FIU Electronic Theses and Dissertations
Unified Modeling Language (UML) is the most comprehensive and widely accepted object-oriented modeling language due to its multi-paradigm modeling capabilities and easy to use graphical notations, with strong international organizational support and industrial production quality tool support. However, there is a lack of precise definition of the semantics of individual UML notations as well as the relationships among multiple UML models, which often introduces incomplete and inconsistent problems for software designs in UML, especially for complex systems. Furthermore, there is a lack of methodologies to ensure a correct implementation from a given UML design. The purpose of this investigation is …
On Optimizing Compatible Security Policies In Wireless Networks, Scott C-H Huang, Kia Makki, Nikki Pissinou
On Optimizing Compatible Security Policies In Wireless Networks, Scott C-H Huang, Kia Makki, Nikki Pissinou
Telecommunications and Information Technology Institute
This paper deals with finding the maximum number of security policies without conflicts. By doing so we can remove security loophole that causes security violation. We present the problem of maximum compatible security policy and its relationship to the problem of maximum acyclic subgraph, which is proved to be NP-hard. Then we present a polynomial-time approximation algorithm and show that our result has approximation ratio for any integer with complexity .