Other UNSW

Publication Search Results

Now showing 1 - 6 of 6
  • (1998) Nipperess, Joe; Baldry, Eileen
    The following report is a detailed description of the Indigenous Australian content of thirteen BSW courses offered at various Australian Universities. The content descriptions were collected and summarised by Joe Nipperess, a fourth year social work student, from information kindly sent by various staff members at those universities and was checked back with those staff members for accuracy. Most of the respondents returned the material with some changes which were incorporated; a small number did not reply. There may be some inaccuracies therefore in some segments. If so, please accept our apologies. Please inform us of any changes needed.

  • (1998) Wilson, William Hulme; Halford, Graeme S
    Conference Paper
    This paper describes experiments on on the robustness of tensor product networks using distributed representations, for recall tasks. The results of the experiments indicate, among other things, that the degree of robustness increases with the number of binding units and decreases with the fraction of the space of possible facts that have been taught to the network. Mean recall scores decrease linearly with the proportion of binding units inactivated, and recall score variance depends linearly on number of binding units and on number of facts taught to the network.

  • (1995) Wilson, William Hulme
    Conference Paper
    This paper concerns a class of recurrent neural networks related to Elman networks (simple recurrent networks) and Jordan networks and a class of feedforward networks architecturally similar to Waibel’s TDNNs. The recurrent nets used herein, unlike standard Elman/Jordan networks, may have more than one state vector. It is known that such multi-state Elman networks have better learning performance on certain tasks than standard Elman networks of similar weight complexity. The task used involves learning the graphotactic structure of a sample of about 400 English words. Learning performance was tested using regimes in which the state vectors are, or are not, zeroed between words: the former results in larger minimum total error, but without the large oscillations in total error observed when the state vectors are not periodically zeroed. Learning performance comparisons of the three classes of network favour the feedforward nets.

  • (1993) Gibson, P; Henry, D; Francis, L; Cruickshank, D; Dupen, F; Higginbotham, N; Henry, RL; Sutherland, D
    Journal Article

  • (1999) Moore, Keri Marie
    Journal Article
    A teachers guide to assessing the students' use of Muscle Energy techniuqes

  • (1997) Mortiss, Genevieve Catherine
    A notion of entropy is defined for the non-singular action of finite co-ordinate changes on X - the infinite product of two-point spaces. This quantity - average co-ordinate or AC entropy - is calculated for product measures and G-measures on X, and an equivalence relation is established for which AC entropy is an invariant. The Inverse Vitali Lemma is discussed in a measure preserving context, and it is shown that for a certain class of measures on X known as odometer bounded, the result will still hold for odometer actions. The foundations for a non-singular version of Rudolph's restricted orbit equivalence are established, and a size for non-singular orbit equivalence is introduced. It is shown that provided the Inverse Vitali Lemma still holds, the non-singular orbit equivalence classes can be described using this new size.