Spatial representations of numbers and letters in children

Different lines of evidence suggest that children's mental representations of numbers are spatially organized in form of a mental number line. It is, however, still unclear whether a spatial organization is specific for the numerical domain or also applies to other ordinal sequences in children. In the present study, children (n = 129) aged 8–9 years were asked to indicate the midpoint of lines flanked by task-irrelevant digits or letters. We found that the localization of the midpoint was systematically biased toward the larger digit. A similar, but less pronounced, effect was detected for letters with spatial biases toward the letter succeeding in the alphabet. Instead of assuming domain-specific forms of spatial representations, we suggest that ordinal information expressing relations between different items of a sequence might be spatially coded in children, whereby numbers seem to convey this kind of information in the most salient way

Recent advances on recursive filtering and sliding mode design for networked nonlinear stochastic systems: A survey

Copyright © 2013 Jun Hu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.Some recent advances on the recursive filtering and sliding mode design problems for nonlinear stochastic systems with network-induced phenomena are surveyed. The network-induced phenomena under consideration mainly include missing measurements, fading measurements, signal quantization, probabilistic sensor delays, sensor saturations, randomly occurring nonlinearities, and randomly occurring uncertainties. With respect to these network-induced phenomena, the developments on filtering and sliding mode design problems are systematically reviewed. In particular, concerning the network-induced phenomena, some recent results on the recursive filtering for time-varying nonlinear stochastic systems and sliding mode design for time-invariant nonlinear stochastic systems are given, respectively. Finally, conclusions are proposed and some potential future research works are pointed out.This work was supported in part by the National Natural Science Foundation of China under Grant nos. 61134009, 61329301, 61333012, 61374127 and 11301118, the Engineering and Physical Sciences Research Council (EPSRC) of the UK under Grant no. GR/S27658/01, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany

Physicality in Australian patent law

It is generally understood that the patent system exists to encourage the conception and disclosure of new and useful inventions embodied in machines and other physical devices, along with new methods that physically transform matter from one state to another. What is not well understood is whether, and to what extent, the patent system is to encourage and protect the conception and disclosure of inventions that are non-physical methods – namely those that do not result in a physical transformation of matter. This issue was considered in Grant v Commissioner of Patents. In that case the Full Court of the Federal Court of Australia held that an invention must involve a physical effect or transformation to be patentable subject matter. In doing so, it introduced a physicality requirement into Australian law. What this article seeks to establish is whether the court’s decision is consistent with the case law on point. It does so by examining the key common law cases that followed the High Court’s watershed decision in National Research Development Corporation v Commissioner of Patents, the undisputed authoritative statement of principle in regard to the patentable subject matter standard in Australia. This is done with a view to determining whether there is anything in those cases that supports the view that the Australian patentable subject matter test contains a physicality requirement

The Man Who Mistook His Neuropsychologist For a Popstar: When Configural Processing Fails in Acquired Prosopagnosia

We report the case of an individual with acquired prosopagnosia who experiences extreme difficulties in recognizing familiar faces in everyday life despite excellent object recognition skills. Formal testing indicates that he is also severely impaired at remembering pre-experimentally unfamiliar faces and that he takes an extremely long time to identify famous faces and to match unfamiliar faces. Nevertheless, he performs as accurately and quickly as controls at identifying inverted familiar and unfamiliar faces and can recognize famous faces from their external features. He also performs as accurately as controls at recognizing famous faces when fracturing conceals the configural information in the face. He shows evidence of impaired global processing but normal local processing of Navon figures. This case appears to reflect the clearest example yet of an acquired prosopagnosic patient whose familiar face recognition deficit is caused by a severe configural processing deficit in the absence of any problems in featural processing. These preserved featural skills together with apparently intact visual imagery for faces allow him to identify a surprisingly large number of famous faces when unlimited time is available. The theoretical implications of this pattern of performance for understanding the nature of acquired prosopagnosia are discussed.DY, Avery Braun, Jacob Waite, and Nadine Wanke, Bruno Rossion, Thomas Busigny and the grant awarded by AJ by the Experimental Psychology Society (EPS

Fast Color Quantization Using Weighted Sort-Means Clustering

Color quantization is an important operation with numerous applications in graphics and image processing. Most quantization methods are essentially based on data clustering algorithms. However, despite its popularity as a general purpose clustering algorithm, k-means has not received much respect in the color quantization literature because of its high computational requirements and sensitivity to initialization. In this paper, a fast color quantization method based on k-means is presented. The method involves several modifications to the conventional (batch) k-means algorithm including data reduction, sample weighting, and the use of triangle inequality to speed up the nearest neighbor search. Experiments on a diverse set of images demonstrate that, with the proposed modifications, k-means becomes very competitive with state-of-the-art color quantization methods in terms of both effectiveness and efficiency.Comment: 30 pages, 2 figures, 4 table