Spelling suggestions: "subject:"storable"" "subject:"restoration""
1 |
A Descriptive Study of Incompetent to Stand Trial and Non-Restorable Defendants in Pinal County ArizonaJanuary 2017 (has links)
abstract: This thesis examines the demographic, clinical, and criminal characteristics and discharge dispositions of pre-trial defendants deemed incompetent to stand trial and non-restorable (IST/NR) in Pinal County Arizona. Currently, there is limited research on defendants who are deemed IST/NR and even less so on discharge dispositions. The study utilized comparative descriptive analysis of secondary data collected by the Pinal County Attorney Offices on IST/NR defendants and restored defendants. It employed chi-square analyses to compare key variables between defendant groups. The study found few variations in clinical, legal, and criminal characteristics observed by previous studies and no statistical differences amongst IST/NR and restored defendants. However, it found the re-offense rate of IST/NR defendants in Pinal County was considerably lower than the general prison population. Moreover, it identified a narrow use of civil commitment procedures and guardianship amongst the IST/NR defendants who have a mental illness. Implications for further research and policy for Pinal County and Arizona are made. / Dissertation/Thesis / Masters Thesis Social Work 2017
|
2 |
Pre-cross-connected protection architectures for transparent optical transport networksGrue, Aden 11 1900 (has links)
This thesis presents a collection of studies on the topic of survivable transparent optical networks. As backbone networks increase in capacity, the issue of their survivability grows correspondingly in importance. The transparent optical network offers many advantages as the optical backbone network of the future, but also faces several challenges with regards to network protection. The fundamental question addressed by this thesis is therefore “How can we achieve high availability and failure resiliency in transparent optical transport networks?” We cover the design, characterization, and comparison of several protection architectures, many of them novel, that share the property of pre-cross-connection, a property that is important for protection of transparent networks. The architectures studied include span p-trees, PXTs, path p-trees, p-cycles, FIPP p-cycles, and UPSR-like p-cycles.
We first present detailed studies of the PXT, span p-tree, and path p-tree architectures. This includes the development of efficient design algorithms and structural analysis of efficient designs. The results indicate a clear hierarchy of efficiency, with cycles being the most efficient, followed by trails, and then trees. However, we discover that architectures with lower average efficiency can be used to complement more efficient structures in rare cases. We also present a new design method for PXTs that is as capacity-efficient as the prior established method, but produces designs with greatly improved structural characteristics.
We then move on to address PXT protection under a collection of real-world design constraints. The results show that PXTs strike a balance between efficiency and flexibility under these constraints. A further study on the problem of failure localization in transparent p-cycle networks demonstrates the possibility of integrating low cost failure localization capabilities into p-cycle network designs.
Finally, we propose UPSR-like p-cycles as a way to combine the simplicity and speed of dedicated protection with the flexibility of mesh-based approaches. The results from our design experiments show that this architecture is able to take advantage of mesh topologies in a way that traditional ring-based approaches cannot. We also demonstrate methods by which UPSR-like p-cycle networks can deliver superior dual failure restorability to a select class of high priority services. / Communications
|
3 |
Pre-cross-connected protection architectures for transparent optical transport networksGrue, Aden Unknown Date
No description available.
|
Page generated in 0.0637 seconds