Analysis of Personal and Social Characteristics Requisite for High Grade Institutional Teaching of Delinquent Children

The goal of this study was to select those particular characteristics pertinent to successful teaching, and by which a more intelligent selection of institutional teachers of delinquent youth could be made

Branes and Calibrated Geometries

The fivebrane worldvolume theory in eleven dimensions is known to contain BPS threebrane solitons which can also be interpreted as a fivebrane whose worldvolume is wrapped around a Riemann surface. By considering configurations of intersecting fivebranes and hence intersecting threebrane solitons, we determine the Bogomol'nyi equations for more general BPS configurations. We obtain differential equations, generalising Cauchy-Riemann equations, which imply that the worldvolume of the fivebrane is wrapped around a calibrated geometry.Comment: Latex, 35 pages. References added, minor change

Assessing Site Productivity of Indigenous Cypress Pine Forest in Southern Queensland

Site form, the expected height of a 25 cm d.b.h.o.b. tree predicted from the stand height-diameter relationship, is shown to be a practical and useful measure of site productivity in indigenous cypress pine (Callitris sp.) forests in southern Queensland. Unlike site index, this measure is not based on age and thus has potential for site productivity assessment in stands of unknown or uneven age

Generality Vs. speed of convergence in the cart-pole balancer

technical reportThis paper compares the speed of convergence to an optimal solution of four controllers for the problem of balancing a pole on a cart. We demonstrate that controllers whose design is tailored specifically to the cart-pole problem (i.e. less general) converge more rapidly to an optimal solution. However, the architectures and learning algorithms for those networks may not perform well for more general tasks. The four controllers, ordered from the least general to the most general, are the Perceptron, the Associative Search Element [1], Jordan's approach [3], and Prejudicial Search applied to the ASE architecture. Two of the above neural networks, the Perceptron and Prejudicial Search [2] are new methods for solving this problem. The perceptron is a simple two input neuron (summing unit) with 2 weights and a step function output. The Prejudicial Search is a method for biasing the search of possible solutions. It guarantees convergence, but allows the search to be biased by heuristics or information about the problem. In this paper, it is combined with the ASE architecture. However, the Prejudicial Search technique can be combined with any architecture and learning algorithm, extending their ability to handle a more general class of problems

Prejudicial search and backprop

Journal ArticleThis paper introduces the combination of backward error propagation and prejudicial search. Prejudicial search is a method, which like simulated annealing, guarantees convergence to a global minimum as time approaches infinity. Unlike simulated annealing, its application is more flexible because it can be combined with other search methods. This method is applied to the exclusive-or problem. When prejudicial search is combined with backward error propagation, the resulting sum of mean squared error at each time step is between 10 and 70 percent (depending on t h e cooling schedule) of the normal backward error propagation error