a brief background to the development of the rock engineering design process is given, showing that since the development of the science of mathematics, deterministic methods have been used to perform various calculations. the variability of rock properties and support characteristics have always been known. however, they were not explicitly used in design but compensated for by the use of a sa...

In MIndiGolog, agents work concurrently to perform a sequence of actions in order to accomplish some task. The domain in which agents operate is static and deterministic, meaning each discrete action produces a predetermined result. The real world equivalent of some of these actions may have a number of possible results, and it may be impossible to distinguish which outcome will occur prior to ...

The synchronization delay of an N-state local automaton is known to be O(N 2). It has been conjectured by S. Kim, R. McNaughton and R. McCloskey that, for deterministic local automata, it is O(N 1:5) on a two-letter alphabet and no less than O(N 2) in the general case. We prove that this conjecture is false and that the synchronization delay is (N 2) in all cases.

We show that in any finite field Fq a primitive root can be found in time O(q’ ‘+’ ) Let Fq denote a finite field of q elements. An element 0 E IFq is called a primitive root if it generates the multiplicative group F;,“. We show that a combination of known results on distribution primitive roots and the factorization algorithm of [6] leads to a deterministic algorithm to find a primitive root ...

Marcus' original deterministic parsing included almost no part-of-speech ambiguity. In this paper, the addition of part-of-speech ambiguity to a deterministic parser written in Prolog is described. To handle this ambiguity, it was necessary to add no special mechanisms to the parser. Instead the grammar rules were made to enforce agreement, and reject ungrammatical sentences. The resulting syst...

The hypothesis underlying topomer development is that describing molecular structures consistently may be at least as productive as describing them more realistically but incompletely. A general protocol is detailed for deterministically generating self-consistent shapes of molecular fragments from their topologies. These and other extensions to the topomer methodology are validated by repetiti...

Abstract. Consider a N × n random matrix Yn = (Y n ij ) where the entries are given by Y n ij = σij(n) √ n X ij , the X n ij being independent and identically distributed, centered with unit variance and satisfying some mild moment assumption. Consider now a deterministic N×n matrix An whose columns and rows are uniformly bounded for the Euclidean norm. Let Σn = Yn + An. We prove in this articl...