On dendrites in Down syndrome and DS murine models: a spiny way to learn

Since the discovery in the 1970s that dendritic abnormalities in cortical pyramidal neurons are the most consistent pathologic correlate of mental retardation, research has focused on how dendritic alterations are related to reduced intellectual ability. Due in part to obvious ethical problems and in part to the lack of fruitful methods to study neuronal circuitry in the human cortex, there is little data about the microanatomical contribution to mental retardation. The recent identification of the genetic bases of some mental retardation associated alterations, coupled with the technology to create transgenic animal models and the introduction of powerful sophisticated tools in the field of microanatomy, has led to a growth in the studies of the alterations of pyramidal cell morphology in these disorders. Studies of individuals with Down syndrome, the most frequent genetic disorder leading to mental retardation, allow the analysis of the relationships between cognition, genotype and brain microanatomy. In Down syndrome the crucial question is to define the mechanisms by which an excess of normal gene products, in interaction with the environment, directs and constrains neural maturation, and how this abnormal development translates into cognition and behaviour. In the present article we discuss mainly Down syndrome-associated dendritic abnormalities and plasticity and the role of animal models in these studies. We believe that through the further development of such approaches, the study of the microanatomical substrates of mental retardation will contribute significantly to our understanding of the mechanisms underlying human brain disorders associated with mental retardation. (C) 2004 Elsevier Ltd. All rights reserved.

The correspondence framework for 3D surface matching algorithms

Beyond the inherent technical challenges, current research into the three dimensional surface correspondence problem is hampered by a lack of uniform terminology, an abundance of application specific algorithms, and the absence of a consistent model for comparing existing approaches and developing new ones. This paper addresses these challenges by presenting a framework for analysing, comparing, developing, and implementing surface correspondence algorithms. The framework uses five distinct stages to establish correspondence between surfaces. It is general, encompassing a wide variety of existing techniques, and flexible, facilitating the synthesis of new correspondence algorithms. This paper presents a review of existing surface correspondence algorithms, and shows how they fit into the correspondence framework. It also shows how the framework can be used to analyse and compare existing algorithms and develop new algorithms using the framework's modular structure. Six algorithms, four existing and two new, are implemented using the framework. Each implemented algorithm is used to match a number of surface pairs. Results demonstrate that the correspondence framework implementations are faithful implementations of existing algorithms, and that powerful new surface correspondence algorithms can be created. (C) 2004 Elsevier Inc. All rights reserved.

Genetic algorithms with applications in wireless communications

Genetic algorithms (GAs) are known to locate the global optimal solution provided sufficient population and/or generation is used. Practically, a near-optimal satisfactory result can be found by Gas with a limited number of generations. In wireless communications, the exhaustive searching approach is widely applied to many techniques, such as maximum likelihood decoding (MLD) and distance spectrum (DS) techniques. The complexity of the exhaustive searching approach in the MLD or the DS technique is exponential in the number of transmit antennas and the size of the signal constellation for the multiple-input multiple-output (MIMO) communication systems. If a large number of antennas and a large size of signal constellations, e.g. PSK and QAM, are employed in the MIMO systems, the exhaustive searching approach becomes impractical and time consuming. In this paper, the GAs are applied to the MLD and DS techniques to provide a near-optimal performance with a reduced computational complexity for the MIMO systems. Two different GA-based efficient searching approaches are proposed for the MLD and DS techniques, respectively. The first proposed approach is based on a GA with sharing function method, which is employed to locate the multiple solutions of the distance spectrum for the Space-time Trellis Coded Orthogonal Frequency Division Multiplexing (STTC-OFDM) systems. The second approach is the GA-based MLD that attempts to find the closest point to the transmitted signal. The proposed approach can return a satisfactory result with a good initial signal vector provided to the GA. Through simulation results, it is shown that the proposed GA-based efficient searching approaches can achieve near-optimal performance, but with a lower searching complexity comparing with the original MLD and DS techniques for the MIMO systems.