Solving navigational uncertainty using grid cells on robots

To successfully navigate their habitats, many mammals use a combination of two mechanisms, path integration and calibration using landmarks, which together enable them to estimate their location and orientation, or pose. In large natural environments, both these mechanisms are characterized by uncertainty: the path integration process is subject to the accumulation of error, while landmark calibration is limited by perceptual ambiguity. It remains unclear how animals form coherent spatial representations in the presence of such uncertainty. Navigation research using robots has determined that uncertainty can be effectively addressed by maintaining multiple probabilistic estimates of a robot's pose. Here we show how conjunctive grid cells in dorsocaudal medial entorhinal cortex (dMEC) may maintain multiple estimates of pose using a brain-based robot navigation system known as RatSLAM. Based both on rodent spatially-responsive cells and functional engineering principles, the cells at the core of the RatSLAM computational model have similar characteristics to rodent grid cells, which we demonstrate by replicating the seminal Moser experiments. We apply the RatSLAM model to a new experimental paradigm designed to examine the responses of a robot or animal in the presence of perceptual ambiguity. Our computational approach enables us to observe short-term population coding of multiple location hypotheses, a phenomenon which would not be easily observable in rodent recordings. We present behavioral and neural evidence demonstrating that the conjunctive grid cells maintain and propagate multiple estimates of pose, enabling the correct pose estimate to be resolved over time even without uniquely identifying cues. While recent research has focused on the grid-like firing characteristics, accuracy and representational capacity of grid cells, our results identify a possible critical and unique role for conjunctive grid cells in filtering sensory uncertainty. We anticipate our study to be a starting point for animal experiments that test navigation in perceptually ambiguous environments.

Access control : allocating resources to selfish agents

The ultimate goal of an authorisation system is to allocate each user the level of access they need to complete their job - no more and no less. This proves to be challenging in an organisational setting because on one hand employees need enough access to perform their tasks, while on the other hand more access will bring about an increasing risk of misuse - either intentionally, where an employee uses the access for personal benefit, or unintentionally through carelessness, losing the information or being socially engineered to give access to an adversary. With the goal of developing a more dynamic authorisation model, we have adopted a game theoretic framework to reason about the factors that may affect users’ likelihood to misuse a permission at the time of an access decision. Game theory provides a useful but previously ignored perspective in authorisation theory: the notion of the user as a self-interested player who selects among a range of possible actions depending on their pay-offs.

Ontology-based specific and exhaustive user profiles for constraint information fusion for multi-agents

Intelligent agents are an advanced technology utilized in Web Intelligence. When searching information from a distributed Web environment, information is retrieved by multi-agents on the client site and fused on the broker site. The current information fusion techniques rely on cooperation of agents to provide statistics. Such techniques are computationally expensive and unrealistic in the real world. In this paper, we introduce a model that uses a world ontology constructed from the Dewey Decimal Classification to acquire user profiles. By search using specific and exhaustive user profiles, information fusion techniques no longer rely on the statistics provided by agents. The model has been successfully evaluated using the large INEX data set simulating the distributed Web environment.

Property Agents and Motor Dealers Act : strike three

The Tourism, Racing and Fair Trading (Miscellaneous Provisions) Act 2002 (“the Act”) which was passed on 18 April 2002 contains a number of significant amendments relevant to the operation of the Property Agents and Motor Dealers Act 2000. The main changes relevant to property transactions are: (i) Changes to the process for appointment of a real estate agent and consolidation of the appointment forms; (ii) Additions to the disclosure obligation of agents and property developers; (iii) Simplification of the process for commencing the cooling off period; (iv) Alteration of the common law position concerning when the parties are bound by a contract; (v) Removal of the requirement for a seller’s signature on the warning statement to be witnessed; (vi) Retrospective amendment of s 170 of the Body Corporate and Community Management Act 1997; (vii) Inclusion of a new power to allow inspectors to enter the place of business of a licensee or a marketeer without consent and without a warrant; and (viii) Inclusion of a new power for inspectors to require documents to be produced by marketeers. The majority of the amendments are effective from the date of assent, 24 April 2002, however, some of the amendments do not commence until a date fixed by proclamation. No proclamation has been made at the time of writing (2 May 2002). Where the amendments have not commenced this will be noted in the article. Before providing clients with advice, practitioners should carefully check proclamation details.

Property Agents and Motor Dealers Act : take two

The Property Agents and Motor Dealers Act 2000 commenced on 1 July 2001. Significant changes have now been made to the Act by the Property Agents and Motor Dealers Amendment Act 2001 (“the amending Act”). The amending Act contains two distinct parts. First, ss 11-19 of the amending Act provide for increased disclosure obligations on real estate agents, property developers and lawyers together with an extension of the 5 business day cooling-off period imposed by the original Act to all residential property (other than contracts formed on a sale by auction). These provisions commenced on 29 October 2001. The remaining provisions of the amending Act provide for increased jurisdiction and powers to the Property Agents and Motor Dealers Tribunal (“the Tribunal”) enabling the Tribunal to deal with claims against marketeers. These provisions commenced on the date of assent, 21 September 2001.

Real estate agents, brochure and misleading or deceptive conduct

The decision of the High Court in Butcher v Lachlan Elder Realty Pty Ltd [2004] HCA 60 involves issues that affect every person who is induced to buy real estate in Australia by statements in sales brochures distributed by real estate agents. One of these issues is the extent to which estate agents unwittingly engage in misleading or deceptive conduct under s 52 of the Trade Practices Act 1974 (Cth) (‘the Act’) when they distribute sales brochures that contain untrue or misleading statements prepared by others. A further issue is the extent to which agents can escape liability by relying on disclaimers about the authenticity of false statements contained in brochures prepared by them.

Waiver of statutory requirements : Property Agents and Motor Dealers Act 2000 (Qld)

One of the many difficulties associated with the drafting of the Property Agents and Motor Dealers Act 2000 (Qld) (‘the Act’) is the operation of s 365. If the requirements imposed by this section concerning the return of the executed contract are not complied with, the buyer and the seller will not be bound by the relevant contract and the cooling-off period will not commence. In these circumstances, it is clear that a buyer’s offer may be withdrawn. However, the drafting of the Act creates a difficulty in that the ability of the seller to withdraw from the transaction prior to the parties being bound by the contract is not expressly provided by s 365. On one view, if the buyer is able to withdraw an offer at any time before receiving the prescribed contract documentation the seller also should not be bound by the contract until this time, notwithstanding that the seller may have been bound at common law. However, an alternative analysis is that the legislative omission to provide the seller with a right of withdrawal may be deliberate given the statutory focus on buyer protection. If this analysis were correct the seller would be denied the right to withdraw from the transaction after the contract was formed at common law (that is, after the seller had signed and the fact of signing had been communicated to the buyer).

Property Agents and Motor Dealers Act (Qld) : disclosure, cooling-off and marketeers

The Property Agents and Motor Dealers Act 2000 commenced on 1 July 2001. Significant changes have now been made to the Act by the Property Agents and Motor Dealers Amendment Act 2001 (“the amending Act”). The amending Act contains two distinct parts. First, ss 11-19 of the amending Act provide for increased disclosure obligations on real estate agents, property developers and lawyers together with an extension of the 5 business day cooling-off period imposed by the original Act to all residential property (other than contracts formed on a sale by auction). These provisions are expected to commence on 29 October 2001. The remaining provisions of the amending Act provide for increased jurisdiction and powers to the Property Agents and Motor Dealers Tribunal (“the Tribunal”) enabling the Tribunal to deal with claims against marketeers. These provisions commenced on the date of assent (21 September 2001).

The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network

Sample complexity results from computational learning theory, when applied to neural network learning for pattern classification problems, suggest that for good generalization performance the number of training examples should grow at least linearly with the number of adjustable parameters in the network. Results in this paper show that if a large neural network is used for a pattern classification problem and the learning algorithm finds a network with small weights that has small squared error on the training patterns, then the generalization performance depends on the size of the weights rather than the number of weights. For example, consider a two-layer feedforward network of sigmoid units, in which the sum of the magnitudes of the weights associated with each unit is bounded by A and the input dimension is n. We show that the misclassification probability is no more than a certain error estimate (that is related to squared error on the training set) plus A3 √((log n)/m) (ignoring log A and log m factors), where m is the number of training patterns. This may explain the generalization performance of neural networks, particularly when the number of training examples is considerably smaller than the number of weights. It also supports heuristics (such as weight decay and early stopping) that attempt to keep the weights small during training. The proof techniques appear to be useful for the analysis of other pattern classifiers: when the input domain is a totally bounded metric space, we use the same approach to give upper bounds on misclassification probability for classifiers with decision boundaries that are far from the training examples.

Neural network learning:theoretical foundations

This important work describes recent theoretical advances in the study of artificial neural networks. It explores probabilistic models of supervised learning problems, and addresses the key statistical and computational questions. Chapters survey research on pattern classification with binary-output networks, including a discussion of the relevance of the Vapnik Chervonenkis dimension, and of estimates of the dimension for several neural network models. In addition, Anthony and Bartlett develop a model of classification by real-output networks, and demonstrate the usefulness of classification with a "large margin." The authors explain the role of scale-sensitive versions of the Vapnik Chervonenkis dimension in large margin classification, and in real prediction. Key chapters also discuss the computational complexity of neural network learning, describing a variety of hardness results, and outlining two efficient, constructive learning algorithms. The book is self-contained and accessible to researchers and graduate students in computer science, engineering, and mathematics