Thesis (M.S.)--University of Alabama at Birmingham, 2008. / Description based on contents viewed Feb. 10, 2009; title from PDF t.p. Includes bibliographical references (p. 74-75).

ITC/USA 2009 Conference Proceedings / The Forty-Fifth Annual International Telemetering Conference and Technical Exhibition / October 26-29, 2009 / Riviera Hotel & Convention Center, Las Vegas, Nevada / The need to allow remote access to telemetry data from closed networks has long existed. To ensure the correct engineers are available for anomaly resolution, NOAA developed the Secure Remote Access Server (SRAS) to allow transfer of satellite telemetry to an external secure server. SRAS uses one-way links to protect the ground system and secure communications for all communications with the user. After the SRAS was developed, a similar system was developed to support file transfers. This paper provides an overview of these systems and lessons learned in the development of one-way fiber systems.

No description available.

Zero-knowledge protocols enable one party, called a prover, to "convince" another party, called a verifier, the validity of a mathematical statement such that the verifier "learns nothing" other than the fact that the proven statement is true. The different ways of formulating the terms "convince" and "learns nothing" gives rise to four classes of languages having zero-knowledge protocols, which are: statistical zero-knowledge proof systems, computational zero-knowledge proof systems, statistical zero-knowledge argument systems, and computational zero-knowledge argument systems. We establish complexity-theoretic characterization of the classes of languages in NP having zero-knowledge argument systems. Using these characterizations, we show that for languages in NP: -- Instance-dependent commitment schemes are necessary and sufficient for zero-knowledge protocols. Instance-dependent commitment schemes for a given language are commitment schemes that can depend on the instance of the language, and where the hiding and binding properties are required to hold only on the YES and NO instances of the language, respectively. -- Computational zero knowledge and computational soundness (a property held by argument systems) are symmetric properties. Namely, we show that the class of languages in NP intersect co-NP having zero-knowledge arguments is closed under complement, and that a language in NP has a statistical zero-knowledge **argument** system if and only if its complement has a **computational** zero-knowledge proof system. -- A method of transforming any zero-knowledge protocol that is secure only against an honest verifier that follows the prescribed protocol into one that is secure against malicious verifiers. In addition, our transformation gives us protocols with desirable properties like having public coins, being black-box simulatable, and having an efficient prover. The novelty of our results above is that they are **unconditional**, meaning that they do not rely on any unproven complexity assumptions such as the existence of one-way functions. Moreover, in establishing our complexity-theoretic characterizations, we give the first construction of statistical zero-knowledge argument systems for NP based on any one-way function.

Rakto apsikeitimo protokolo, kaip ir bet kurio asimetrinės kriptografijos algoritmo, pagrindas yra vienkryptės funkcijos, kurias paprasta apskaičiuoti, tačiau apskaičiuoti atvirkštinę jų reikšmę per priimtiną laiko tarpą neįmanoma. Darbe bus bandoma įrodyti, kad tiriamoji lygčių sistema turi mažai sprendinių ir yra tinkama kriptografiniams algoritmams. Iš pradžių tyrinėta atskiros lygties sprendinių aibė, paskui pereita prie lygčių sistemos sprendinių aibės. Sprendiniai ieškomi naudojant matricų perrinkima, tai pat pasitelkiant kitus metodus. Nustatyta, kad lygčių sistemos sprendinių skaičius, nepriklauso nuo matricos eilės m. / Key agreement protocol, as well as any asymmetric cryptographic algorithm, is based on one-way functions which are easy to calculate, but to calculate the inverse of their value within a reasonable period of time is impossible. The paper will attempt to prove that the system of equations has not much solutions ant that it could be used in cryptographic algorithm. At first individual equation was solved, set of solutions was found. Then moved explore to the set of solutions of equations system. Solutions were found using brute force algorithm for matrices. As well as through other methods. It was found that the number of solutions of equations system does not depend on the matrix size.

The increased use of returnable packaging have given rise to the trend of packaging logistics.The operation of returnable packaging is challenging for global companies due to thecomplexity in the process and information flows. Companies invest in returnable packagingsystems in order to ensure quality throughout the supply chain. Despite the large investments inan returnable packaging fleet, it is often poorly controlled, leading to vast tied-up capital andshrinkage.This thesis proposes how the visibility and control of the system is affected by thecategorization of packaging and the allocation of responsibilities throughout the packaginghandling process. Theoretical and empirical studies were carried out, the theoretical part helpeddefine the problem. A case study were performed at Scania CV AB in Södertälje, Sweden.Results of this study shows that categorization of packaging is not sufficient to attain a suitablelevel of control in an packaging handling process. Although it could be used as a supporting orgoverning documents for standardization in the process. Findings showed that theresponsibilities in the process should be centralized in as large extent as possible. Although ifthe current process is lacking visibility and control, the benefits of centralized control may belost.

No description available.

Cluster analysis identifies homogeneous groups that are relevant within a population. In model-based clustering, group membership is estimated using a parametric finite mixture model, commonly the mathematically tractable Gaussian mixture model. One-way clustering methods can be restrictive in cases where there are suspected relationships between the variables in each component, leading to the idea of biclustering, which refers to clustering both observations and variables simultaneously. When the relationships between the variables are known, biclustering becomes one-way supervised. To this end, this thesis focuses on a novel one-way supervised biclustering family based on the Gaussian mixture model. In cases where biclustering may be overestimating the number of components in the data, a model averaging technique utilizing Occam's window is applied to produce better clustering results. Automatic outlier detection is introduced into the biclustering family using mixtures of contaminated Gaussian mixture models. Algorithms for model-fitting and parameter estimation are presented for the techniques described in this thesis, and simulation and real data studies are used to assess their performance. / Thesis / Doctor of Philosophy (PhD)

The subject of this thesis was the verification and the implementation of a multiple retransmission technique for the one-way asynchronous communication channel of the Interactive Video Data Service (IVDS) system. The commercial application of the IVDS project made reliability of the retransmission technique important. Verification of the reliability of the technique was done using a simulator written in the C programming language. The results of the IVDS simulator were compared to the existing statistical model of the transmission channel. Following a favorable comparison of the statistical model and simulator results, a prototype of the control section for the IVDS Consumer Control Unit (CCU) was designed and constructed. This was an important step towards the completion of the IVDS system. The CCU design defined protocols for message format and error detection and also helped to establish an IVDS test-bed system. / Master of Science

Multiple testing literature contains ample research on controlling false discoveries for hypotheses classified according to one criterion, which we refer to as `one-way classified hypotheses'. However, one often encounters the scenario of `two-way classified hypotheses' where hypotheses can be partitioned into two sets of groups via two different criteria. Associated multiple testing procedures that incorporate such structural information are potentially more effective than their one-way classified or non-classified counterparts. To the best of our knowledge, very little research has been pursued in this direction. This dissertation proposes two types of multiple testing procedures for two-way classified hypotheses. In the first part, we propose a general methodology for controlling the false discovery rate (FDR) using the Benjamini-Hochberg (BH) procedure based on weighted p-values. The weights can be appropriately chosen to reflect one- or two-way classified structure of hypotheses, producing novel multiple testing procedures for two-way classified hypotheses. Newer results for one-way classified hypotheses have been obtained in this process. Our proposed procedures control the false discovery rate (FDR) non-asymptotically in their oracle forms under positive regression dependence on subset of null p-values (PRDS) and in their data-adaptive forms for independent p-values. Simulation studies demonstrate that our proposed procedures can be considerably more powerful than some contemporary methods in many instances and that our data-adaptive procedures can non-asymptotically control the FDR under certain dependent scenarios. The proposed two-way adaptive procedure is applied to a data set from microbial abundance study, for which it makes more discoveries than an existing method. In the second part, we propose a Local false discovery rate (Lfdr) based multiple testing procedure for two-way classified hypotheses. The procedure has been developed in its oracle form under a model based framework that isolates the effects due to two-way grouping from the significance of an individual hypothesis. Simulation studies show that our proposed procedure successfully controls the average proportion of false discoveries, and is more powerful than existing methods. / Statistics