Probability Commons^™

Encryption Using Deterministic Chaos, Jonathan Blackledge, Nikolai Ptitsyn

Articles

The concepts of randomness, unpredictability, complexity and entropy form the basis of modern cryptography and a cryptosystem can be interpreted as the design of a key-dependent bijective transformation that is unpredictable to an observer for a given computational resource. For any cryptosystem, including a Pseudo-Random Number Generator (PRNG), encryption algorithm or a key exchange scheme, for example, a cryptanalyst has access to the time series of a dynamic system and knows the PRNG function (the algorithm that is assumed to be based on some iterative process) which is taken to be in the public domain by virtue of the Kerchhoff-Shannon …

A Hidden Markov Model Based Approach To Detect Rogue Access Points, Gayathri Shivaraj

Electrical & Computer Engineering Theses & Dissertations

One of the most challenging security concerns for network administrators is the presence of Rogue access points. The challenge is to detect and disable a Rogue access point before it can cause hazardous damage to the network. This thesis proposes a statistically based approach to detect Rogue access points using a Hidden Markov Model, which is applied to passively measure packet-header data collected at a gateway router or any monitoring point. This approach utilizes variations in packet inter-arrival time to differentiate between authorized access points and Rouge access points. This approach used the inter-arrival time of a packet as a …

Reconstructability Analysis With Fourier Transforms, Martin Zwick

Complex Systems Faculty Publications and Presentations

Fourier methods used in two‐ and three‐dimensional image reconstruction can be used also in reconstructability analysis (RA). These methods maximize a variance‐type measure instead of information‐theoretic uncertainty, but the two measures are roughly collinear and the Fourier approach yields results close to that of standard RA. The Fourier method, however, does not require iterative calculations for models with loops. Moreover, the error in Fourier RA models can be assessed without actually generating the full probability distributions of the models; calculations scale with the size of the data rather than the state space. State‐based modeling using the Fourier approach is also …

Multi-Level Decomposition Of Probabilistic Relations, Stanislaw Grygiel, Martin Zwick, Marek Perkowski

Complex Systems Faculty Publications and Presentations

Two methods of decomposition of probabilistic relations are presented in this paper. They consist of splitting relations (blocks) into pairs of smaller blocks related to each other by new variables generated in such a way so as to minimize a cost function which depends on the size and structure of the result. The decomposition is repeated iteratively until a stopping criterion is met. Topology and contents of the resulting structure develop dynamically in the decomposition process and reflect relationships hidden in the data.

Fuzzy Product -Limit Estimators: Soft Computing In The Presence Of Very Small And Highly Censored Data Sets, Kian Lawrence Pokorny

Doctoral Dissertations

When very few data are available and a high proportion of the data is censored, accurate estimates of reliability are problematic. Standard statistical methods require a more complete data set, and with any fewer data, expert knowledge or heuristic methods are required. In the current research a computational system is developed that obtains a survival curve, point estimate, and confidence interval about the point estimate.

The system uses numerical methods to define fuzzy membership functions about each data point that quantify uncertainty due to censoring. The “fuzzy” data are then used to estimate a survival curve, and the mean survival …

Single Row Routing: Theoretical And Experimental Performance Evaluation, And New Heuristic Development, David A. Hysom

Computer Science Theses & Dissertations

The Single Row Routing Problem (SRRP) is an abstraction arising from real-world multilayer routing concerns. While NP-Complete, development of efficient SRRP routing heuristics are of vital concern to VLSI design. Previously, researchers have introduced various heuristics for SRRP; however, a comprehensive examination of SRRP behavior has been lacking.

We are particularly concerned with the street-congestion minimization constraint, which is agreed to be the constraint of greatest interest to industry. Several theorems stating lower bounds on street congestion are known. We show that these bounds are not tight in general, and argue they may be in error by at least 50% …

Some Applications Of Sophisticated Mathematics To Randomized Computing, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

No abstract provided.

Adaptive Integration Of Audio And Visual Information Using Discrete And Semi-Continuous Hidden Markov Models In Audiovisual Automatic Speech Recognition, Qin Su

Electrical & Computer Engineering Theses & Dissertations

An audiovisual semi-continuous hidden Markov model (HMM)-based Automatic Speech Recognition (ASR) system and an improved method of integrating audio and visual information in an audiovisual discrete HMM-based ASR system are investigated.

In the audiovisual discrete HMM, an adaptive integration formulation is employed, which incorporates the integration into the HMM at a pre-categorical stage. A visual weighting parameter is determined automatically, which allows the relative contribution of audio and visual information to be adjusted adaptively. Using an adaptive weight, the accuracy increased by 13% compared to the same model with no adaptive weight.

The semi-continuous HMM is a class of models …

Control Uniqueness In Reconstructability Analysis, Martin Zwick

Complex Systems Faculty Publications and Presentations

When the reconstructability analysis of a directed system yields a structure in which a generated variable appears in more than one subsystem, information from all of the subsystems can be used in modeling the relationship between generating and generated variables. The conceptualization and procedure proposed here is discussed in relation to Klir's concept of control uniqueness.

Set-Theoretic Reconstructability Of Elementary Cellular Automata, Martin Zwick, Hui Shu

Complex Systems Faculty Publications and Presentations

Set-theoretic reconstructability analysis is used to characterize the structures of the mappings of elementary cellular automata. The minimum complexity structure for each ECA mapping, indexed by parameter σ, is more effective than the λ parameter of Langton as a predictor of chaotic dynamics.

Estimation In A Marked Poisson Error Recapture Model Of Software Reliability, Rajan Gupta

Mathematics & Statistics Theses & Dissertations

Nayak's (1988) model for the detection, removal, and recapture of the errors in a computer program is extended to a larger family of models in which the probabilities that the successive programs produce errors are described by the tail probabilities of discrete distribution on the positive integers. Confidence limits are derived for the probability that the final program produces errors. A comparison of the asymptotic variances of parameter estimates given by the error recapture and by the repetitive-run procedure of Nagel, Scholz, and Skrivan (1982) is made to determine which of these procedures efficiently uses the test time.

Shadow Casting Phenomena At Newgrange, Frank Prendergast

Articles

A digital model of the Newgrange passage tomb and surrounding ring of monoliths known as the Great Circle is used to investigate sunrise shadow casting phenomena at the monument. Diurnal variation in shadow directions and lengths are analysed for their potential use in the Bronze Age to indicate the passage of seasonal time. Computer-aided simulations are developed from a photogrammetric survey to accurately show how three of the largest monoliths, located closest to the tomb entrance and archaeologically coded GC1, GC-1 and GC-2, cast their shadows onto the vertical face of the entrance kerbstone, coded K1. The phenomena occur at …