## Search

Now showing items 1-10 of 16

#### Real-time optimization of an active filter's performance

(University of Canterbury. Electrical and Computer Engineering., 1994)

Recent advances in power electronics have meant
that many loads now draw a distorted current from the power
supply. For the same real power consumed, the apparent power
for the distorted load is greater than the equivalent ...

#### Credibility of the Final Results from Quantitative Stochastic Simulation

(University of CanterburyUniversity of Canterbury. Computer Science and Software Engineering, 1995)

#### The length of a random leaf coloration on a random tree.

(University of Canterbury. Mathematics and Statistics, 1997)

An assignment of colors to objects induces a natural integer weight on each tree that has these objects as leaves. This weight is called "parsimony length" in biostatistics and is the basis of the "maximum parsimony" ...

#### A Survey of Confidence Interval Formulae for Coverage Analysis

(Department of Computer Science and Management, University of CanterburyUniversity of Canterbury. Computer Science and Software EngineeringUniversity of Canterbury. Management, 1998)

Confidence interval estimators for proportions using normal approximation have been
commonly used for coverage analysis of simulation output even though alternative approximate estimators of confidence intervals for ...

#### Inverting random functions

(University of Canterbury. Mathematics and Statistics., 1999)

In this paper we study how to invert random functions under different
criteria. The motivation for this study is phylogeny reconstruction, since
the evolution of biomolecular sequences may be considered as a random ...

#### Partial fields and matroid representation

(University of Canterbury. Mathematics and Statistics., 1996)

A partial field P is an algebraic structure that behaves very much
like a field except that addition is a partial binary operation, that is,
for some a,b Є P, a + b may not be defined. We develop a theory of
matroid ...

#### A DiGraph Model for Extended Event Structures

(University of CanterburyUniversity of Canterbury. Computer Science and Software Engineering, 1994)

A geometric model for concurrency has been described by Pratt in [5]. While the intuition is easily understood
the formal description using n-complexes requires some mathematical maturity. The purpose of this paper is
two ...

#### Tree representations of non-symmetric, group-valued proximities

(University of Canterbury. Mathematics and Statistics., 1999)

Let X be a finite set and let d be a function from X x X into an
arbitrary group G. An example of such a function arises by taking a tree T whose vertices include X, assigning two elements of G to each edge of T (one for ...

#### A Random Access Protocol for Unidirectional Bus Networks

(University of Canterbury. Computer Science and Software EngineeringUniversity of Canterbury. Electrical and Computer Engineering, 1995)

A random access protocol for packet-switched,
multiple access communication via time slotted busses is investigated. Assuming heavy traffic for all stations, the access
probabilities are determined as to allocate a certain ...

#### Automating Parallel and Distributed Quantative Stochastic Simulation

(University of CanterburyUniversity of Canterbury. Computer Science and Software Engineering, 1996)