Knowing who likes who: The early developmental basis of coalition understanding

Group biases based on broad category membership appear early in human development. However, like many other primates humans inhabit social worlds also characterised by small groups of social coalitions which are not demarcated by visible signs or social markers. A critical cognitive challenge for a young child is thus how to extract information concerning coalition structure when coalitions are dynamic and may lack stable and outwardly visible cues to membership. Therefore, the ability to decode behavioural cues of affiliations present in everyday social interactions between individuals would have conferred powerful selective advantages during our evolution. This would suggest that such an ability may emerge early in life, however, little research has investigated the developmental origins of such processing. The present paper will review recent empirical research which indicates that in the first 2 years of life infants achieve a host of social-cognitive abilities that make them well adapted to processing coalition-affiliations of others. We suggest that such an approach can be applied to better understand the origins of intergroup attitudes and biases. Copyright © 2010 John Wiley & Sons, Ltd.

Mean-tracking clustering algorithm for radial basis function centre selection

Radial basis functions can be combined into a network structure that has several advantages over conventional neural network solutions. However, to operate effectively the number and positions of the basis function centres must be carefully selected. Although no rigorous algorithm exists for this purpose, several heuristic methods have been suggested. In this paper a new method is proposed in which radial basis function centres are selected by the mean-tracking clustering algorithm. The mean-tracking algorithm is compared with k means clustering and it is shown that it achieves significantly better results in terms of radial basis function performance. As well as being computationally simpler, the mean-tracking algorithm in general selects better centre positions, thus providing the radial basis functions with better modelling accuracy

Dual-orthogonal radial basis function networks for nonlinear time series prediction

A new structure of Radial Basis Function (RBF) neural network called the Dual-orthogonal RBF Network (DRBF) is introduced for nonlinear time series prediction. The hidden nodes of a conventional RBF network compare the Euclidean distance between the network input vector and the centres, and the node responses are radially symmetrical. But in time series prediction where the system input vectors are lagged system outputs, which are usually highly correlated, the Euclidean distance measure may not be appropriate. The DRBF network modifies the distance metric by introducing a classification function which is based on the estimation data set. Training the DRBF networks consists of two stages. Learning the classification related basis functions and the important input nodes, followed by selecting the regressors and learning the weights of the hidden nodes. In both cases, a forward Orthogonal Least Squares (OLS) selection procedure is applied, initially to select the important input nodes and then to select the important centres. Simulation results of single-step and multi-step ahead predictions over a test data set are included to demonstrate the effectiveness of the new approach.

Optimal piecewise locally linear modeling

Associative memory networks such as Radial Basis Functions, Neurofuzzy and Fuzzy Logic used for modelling nonlinear processes suffer from the curse of dimensionality (COD), in that as the input dimension increases the parameterization, computation cost, training data requirements, etc. increase exponentially. Here a new algorithm is introduced for the construction of a Delaunay input space partitioned optimal piecewise locally linear models to overcome the COD as well as generate locally linear models directly amenable to linear control and estimation algorithms. The training of the model is configured as a new mixture of experts network with a new fast decision rule derived using convex set theory. A very fast simulated reannealing (VFSR) algorithm is utilized to search a global optimal solution of the Delaunay input space partition. A benchmark non-linear time series is used to demonstrate the new approach.

Data based constructive identification - overcoming the curse of dimensionality

The modelling of a nonlinear stochastic dynamical processes from data involves solving the problems of data gathering, preprocessing, model architecture selection, learning or adaptation, parametric evaluation and model validation. For a given model architecture such as associative memory networks, a common problem in non-linear modelling is the problem of "the curse of dimensionality". A series of complementary data based constructive identification schemes, mainly based on but not limited to an operating point dependent fuzzy models, are introduced in this paper with the aim to overcome the curse of dimensionality. These include (i) a mixture of experts algorithm based on a forward constrained regression algorithm; (ii) an inherent parsimonious delaunay input space partition based piecewise local lineal modelling concept; (iii) a neurofuzzy model constructive approach based on forward orthogonal least squares and optimal experimental design and finally (iv) the neurofuzzy model construction algorithm based on basis functions that are Bézier Bernstein polynomial functions and the additive decomposition. Illustrative examples demonstrate their applicability, showing that the final major hurdle in data based modelling has almost been removed.

Dynamic Niche Clustering: a fuzzy variable radius niching technique for multimodal optimisation in GAs

This paper describes the recent developments and improvements made to the variable radius niching technique called Dynamic Niche Clustering (DNC). DNC is fitness sharing based technique that employs a separate population of overlapping fuzzy niches with independent radii which operate in the decoded parameter space, and are maintained alongside the normal GA population. We describe a speedup process that can be applied to the initial generation which greatly reduces the complexity of the initial stages. A split operator is also introduced that is designed to counteract the excessive growth of niches, and it is shown that this improves the overall robustness of the technique. Finally, the effect of local elitism is documented and compared to the performance of the basic DNC technique on a selection of 2D test functions. The paper is concluded with a view to future work to be undertaken on the technique.

Transreal arithmetic as a consistent basis for paraconsistent logics

Paraconsistent logics are non-classical logics which allow non-trivial and consistent reasoning about inconsistent axioms. They have been pro- posed as a formal basis for handling inconsistent data, as commonly arise in human enterprises, and as methods for fuzzy reasoning, with applica- tions in Artificial Intelligence and the control of complex systems. Formalisations of paraconsistent logics usually require heroic mathe- matical efforts to provide a consistent axiomatisation of an inconsistent system. Here we use transreal arithmetic, which is known to be consis- tent, to arithmetise a paraconsistent logic. This is theoretically simple and should lead to efficient computer implementations. We introduce the metalogical principle of monotonicity which is a very simple way of making logics paraconsistent. Our logic has dialetheaic truth values which are both False and True. It allows contradictory propositions, allows variable contradictions, but blocks literal contradictions. Thus literal reasoning, in this logic, forms an on-the- y, syntactic partition of the propositions into internally consistent sets. We show how the set of all paraconsistent, possible worlds can be represented in a transreal space. During the development of our logic we discuss how other paraconsistent logics could be arithmetised in transreal arithmetic.

Exact Search Directions for Optimization of Linear and Nonlinear Models Based on Generalized Orthonormal Functions

A novel technique for selecting the poles of orthonormal basis functions (OBF) in Volterra models of any order is presented. It is well-known that the usual large number of parameters required to describe the Volterra kernels can be significantly reduced by representing each kernel using an appropriate basis of orthonormal functions. Such a representation results in the so-called OBF Volterra model, which has a Wiener structure consisting of a linear dynamic generated by the orthonormal basis followed by a nonlinear static mapping given by the Volterra polynomial series. Aiming at optimizing the poles that fully parameterize the orthonormal bases, the exact gradients of the outputs of the orthonormal filters with respect to their poles are computed analytically by using a back-propagation-through-time technique. The expressions relative to the Kautz basis and to generalized orthonormal bases of functions (GOBF) are addressed; the ones related to the Laguerre basis follow straightforwardly as a particular case. The main innovation here is that the dynamic nature of the OBF filters is fully considered in the gradient computations. These gradients provide exact search directions for optimizing the poles of a given orthonormal basis. Such search directions can, in turn, be used as part of an optimization procedure to locate the minimum of a cost-function that takes into account the error of estimation of the system output. The Levenberg-Marquardt algorithm is adopted here as the optimization procedure. Unlike previous related work, the proposed approach relies solely on input-output data measured from the system to be modeled, i.e., no information about the Volterra kernels is required. Examples are presented to illustrate the application of this approach to the modeling of dynamic systems, including a real magnetic levitation system with nonlinear oscillatory behavior.

ALGEBRAIC AND GEOMETRIC THEORY OF THE TOPOLOGICAL RING OF COLOMBEAU GENERALIZED FUNCTIONS

We continue the investigation of the algebraic and topological structure of the algebra of Colombeau generalized functions with the aim of building up the algebraic basis for the theory of these functions. This was started in a previous work of Aragona and Juriaans, where the algebraic and topological structure of the Colombeau generalized numbers were studied. Here, among other important things, we determine completely the minimal primes of (K) over bar and introduce several invariants of the ideals of 9(Q). The main tools we use are the algebraic results obtained by Aragona and Juriaans and the theory of differential calculus on generalized manifolds developed by Aragona and co-workers. The main achievement of the differential calculus is that all classical objects, such as distributions, become Cl-functions. Our purpose is to build an independent and intrinsic theory for Colombeau generalized functions and place them in a wider context.

New Relativistic Atomic Natural Orbital Basis Sets for Lanthanide Atoms with Applications to the Ce Diatom and LuF3

New basis sets of the atomic natural orbital (ANO) type have been developed for the lanthanide atoms La-Lu. The ANOs have been obtained from the average density matrix of the ground and lowest excited states of the atom, the positive ions, and the atom in an electric field. Scalar relativistic effects are included through the use of a Douglas-Kroll-Hess Hamiltonian. Multiconfigurational wave functions have been used with dynamic correlation included using second-order perturbation theory (CASSCF/CASPT2). The basis sets are applied in calculations of ionization energies and some excitation energies. Computed ionization energies have an accuracy better than 0.1 eV in most cases. Two molecular applications are inluded as illustration: the cerium diatom and the LuF3 molecule. In both cases it is shown that 4f orbitals are not involved in the chemical bond in contrast to an earlier claim for the latter molecule.

Methylmercury localization in Danio rerio retina after trophic and subchronic exposure: A basis for neurotoxicology

Methylmercury is a known neurotoxic organometal which affects visual functions and few studies concerns to wild fish are available. The autometallography mercury distribution in the retina of Danio rerio was mapped using light and electron microscopy. Abundant mercury deposits were found in the photoreceptor layer (outer and inner segments of the photoreceptors) and in the inner and outer nuclear layers. Occasionally, the presence of mercury deposits in plexiform layers was observed and very rarely in the ganglion cell layer. Also the occurrence of mercury deposits in cells from the disc region was observed, but not in the nerve fiber layer. An interesting difference was found between mercury accumulation in the central and peripheral regions of the retina. These results demonstrate that mercury after trophic exposure to Danio rerio is able to cross the blood-retina barrier and accumulate in the cells of the retina even under subchronic exposure. (C) 2010 Elsevier Inc. All rights reserved.

Does speed matter? : the impact of the EU membership incentive on rule adoption in minority language rights protection

Denna avhandling tar sin utgångspunkt i ett ifrågasättande av effektiviteten i EU:s konditionalitetspolitik avseende minoritetsrättigheter. Baserat på den rationalistiska teoretiska modellen, External Incentives Model of Governance, syftar denna hypotesprövande avhandling till att förklara om tidsavståndet på det potentiella EU medlemskapet påverkar lagstiftningsnivån avseende minoritetsspråksrättigheter. Mätningen av nivån på lagstiftningen avseende minoritetsspråksrättigheter begränsas till att omfatta icke-diskriminering, användning av minoritetsspråk i officiella sammanhang samt minoriteters språkliga rättigheter i utbildningen. Metodologiskt används ett jämförande angreppssätt både avseende tidsramen för studien, som sträcker sig mellan 2003 och 2010, men även avseende urvalet av stater. På basis av det \"mest lika systemet\" kategoriseras staterna i tre grupper efter deras olika tidsavstånd från det potentiella EU medlemskapet. Hypotesen som prövas är följande: ju kortare tidsavstånd till det potentiella EU medlemskapet desto större sannolikhet att staternas lagstiftningsnivå inom de tre områden som studeras har utvecklats till en hög nivå. Studien visar att hypotesen endast bekräftas delvis. Resultaten avseende icke-diskriminering visar att sambandet mellan tidsavståndet och nivån på lagstiftningen har ökat markant under den undersökta tidsperioden. Detta samband har endast stärkts mellan kategorin av stater som ligger tidsmässigt längst bort ett potentiellt EU medlemskap och de två kategorier som ligger närmare respektive närmast ett potentiellt EU medlemskap. Resultaten avseende användning av minoritetsspråk i officiella sammanhang och minoriteters språkliga rättigheter i utbildningen visar inget respektive nästan inget samband mellan tidsavståndet och utvecklingen på lagstiftningen mellan 2003 och 2010.

Sistema fuzzy para estimativa do bem-estar de matrizes pesadas

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Product functions: interfaces with ergonomic design

In addition to technical quality, increasing emphasis is being placed on the importance of elements such as the appearance and meaning of products. To be successful, therefore, attention must be paid to the aesthetic and symbolic functions of objects as well as to reliability and physical quality. Study of the interfaces of these functions may provide a theoretical basis for the ergonomic design of products. The objective of this review is to attempt to establish the nature of these interfaces.

Fuzzy modeling to predict chicken egg hatchability in commercial hatchery

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)