Results 1 
3 of
3
Monte Carlo Exact Conditional Tests for Quasiindependence using Gibbs Sampling
, 1994
"... this paper, is the hypothesis of QI for the offdiagonal cells of a r \Theta r square table, where the sufficient statistics for the nuisance parameters are x i+ ; x +j and x ii , for i; j = 1; : : : ; r. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
this paper, is the hypothesis of QI for the offdiagonal cells of a r \Theta r square table, where the sufficient statistics for the nuisance parameters are x i+ ; x +j and x ii , for i; j = 1; : : : ; r.
Exact Tests via Complete Enumeration: A Distributed Computing Approach
, 1997
"... The analysis of categorical data often leads to the analysis of a contingency table. For large samples, asymptotic approximations are sufficient when calculating pvalues, but for small samples the tests can be unreliable. In these situations an exact test should be considered. This bases the test o ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The analysis of categorical data often leads to the analysis of a contingency table. For large samples, asymptotic approximations are sufficient when calculating pvalues, but for small samples the tests can be unreliable. In these situations an exact test should be considered. This bases the test on the exact distribution of the test statistic. Sampling techniques can be used to estimate the distribution. Alternatively, the distribution can be found by complete enumeration. This thesis develops a number of new algorithms for complete enumeration of various models. Recursive algorithms are developed to test for independence in r × c tables. The algorithm is extended for multidimensional tables. One algorithm is extended to enumerate tables under the model of quasiindependence, and a rejection stage enables testing of models such as quasisymmetry and uniform association. A new algorithm is developed that enables a model to be defined by a model matrix, and all tables that satisfy the model are found. This provides a more efficient enumeration mechanism for complex models and extends the range of models that can be tested. The technique can lead to large calculations and a distributed version of the algorithm is developed that enables a number of machines to work efficiently on the same problem.
A Distributed LISPSTAT Environment
 in Proceedings of COMPSTAT
, 1994
"... s on a heterogeneous network. For these reasons, LISPSTAT is an ideal basis for the development of a statistical computing environment for heterogeneous networks. LISPSTAT provides dynamic, interactive graphics. Under the Xwindows system, LISPSTAT processes running on one workstation can use ano ..."
Abstract
 Add to MetaCart
s on a heterogeneous network. For these reasons, LISPSTAT is an ideal basis for the development of a statistical computing environment for heterogeneous networks. LISPSTAT provides dynamic, interactive graphics. Under the Xwindows system, LISPSTAT processes running on one workstation can use another for their display and user interaction. These facilities alone are sufficient to allow one user to run LISPSTAT processes on multiple computers, each having its display set to the user's workstation. However, to harness the full potential of such an environment, mechanisms for communication between those processes must be providedand these mechanisms need to be supported within the LISPSTAT language so that they are available to a user writing LISPSTAT programs. 3 Distributed Lisp To establish an environment for distributed statistical computing, it is essential to specify standard interfaces between the components of the system. This will enable the con