50 research outputs found

    Deep Randomized Neural Networks

    Get PDF
    Randomized Neural Networks explore the behavior of neural systems where the majority of connections are fixed, either in a stochastic or a deterministic fashion. Typical examples of such systems consist of multi-layered neural network architectures where the connections to the hidden layer(s) are left untrained after initialization. Limiting the training algorithms to operate on a reduced set of weights inherently characterizes the class of Randomized Neural Networks with a number of intriguing features. Among them, the extreme efficiency of the resulting learning processes is undoubtedly a striking advantage with respect to fully trained architectures. Besides, despite the involved simplifications, randomized neural systems possess remarkable properties both in practice, achieving state-of-the-art results in multiple domains, and theoretically, allowing to analyze intrinsic properties of neural architectures (e.g. before training of the hidden layers' connections). In recent years, the study of Randomized Neural Networks has been extended towards deep architectures, opening new research directions to the design of effective yet extremely efficient deep learning models in vectorial as well as in more complex data domains. This chapter surveys all the major aspects regarding the design and analysis of Randomized Neural Networks, and some of the key results with respect to their approximation capabilities. In particular, we first introduce the fundamentals of randomized neural models in the context of feed-forward networks (i.e., Random Vector Functional Link and equivalent models) and convolutional filters, before moving to the case of recurrent systems (i.e., Reservoir Computing networks). For both, we focus specifically on recent results in the domain of deep randomized systems, and (for recurrent models) their application to structured domains

    Deep Randomized Neural Networks

    Get PDF
    Randomized Neural Networks explore the behavior of neural systems where the majority of connections are fixed, either in a stochastic or a deterministic fashion. Typical examples of such systems consist of multi-layered neural network architectures where the connections to the hidden layer(s) are left untrained after initialization. Limiting the training algorithms to operate on a reduced set of weights inherently characterizes the class of Randomized Neural Networks with a number of intriguing features. Among them, the extreme efficiency of the resulting learning processes is undoubtedly a striking advantage with respect to fully trained architectures. Besides, despite the involved simplifications, randomized neural systems possess remarkable properties both in practice, achieving state-of-the-art results in multiple domains, and theoretically, allowing to analyze intrinsic properties of neural architectures (e.g. before training of the hidden layers’ connections). In recent years, the study of Randomized Neural Networks has been extended towards deep architectures, opening new research directions to the design of effective yet extremely efficient deep learning models in vectorial as well as in more complex data domains. This chapter surveys all the major aspects regarding the design and analysis of Randomized Neural Networks, and some of the key results with respect to their approximation capabilities. In particular, we first introduce the fundamentals of randomized neural models in the context of feed-forward networks (i.e., Random Vector Functional Link and equivalent models) and convolutional filters, before moving to the case of recurrent systems (i.e., Reservoir Computing networks). For both, we focus specifically on recent results in the domain of deep randomized systems, and (for recurrent models) their application to structured domains

    Local and Landscape Factors Determining Occurrence of Phyllostomid Bats in Tropical Secondary Forests

    Get PDF
    Neotropical forests are being increasingly replaced by a mosaic of patches of different successional stages, agricultural fields and pasture lands. Consequently, the identification of factors shaping the performance of taxa in anthropogenic landscapes is gaining importance, especially for taxa playing critical roles in ecosystem functioning. As phyllostomid bats provide important ecological services through seed dispersal, pollination and control of animal populations, in this study we assessed the relationships between phyllostomid occurrence and the variation in local and landscape level habitat attributes caused by disturbance. We mist-netted phyllostomids in 12 sites representing 4 successional stages of a tropical dry forest (initial, early, intermediate and late). We also quantitatively characterized the habitat attributes at the local (vegetation structure complexity) and the landscape level (forest cover, area and diversity of patches). Two focal scales were considered for landscape characterization: 500 and 1000 m. During 142 sampling nights, we captured 606 individuals representing 15 species and 4 broad guilds. Variation in phyllostomid assemblages, ensembles and populations was associated with variation in local and landscape habitat attributes, and this association was scale-dependent. Specifically, we found a marked guild-specific response, where the abundance of nectarivores tended to be negatively associated with the mean area of dry forest patches, while the abundance of frugivores was positively associated with the percentage of riparian forest. These results are explained by the prevalence of chiropterophilic species in the dry forest and of chiropterochorous species in the riparian forest. Our results indicate that different vegetation classes, as well as a multi-spatial scale approach must be considered for evaluating bat response to variation in landscape attributes. Moreover, for the long-term conservation of phyllostomids in anthropogenic landscapes, we must realize that the management of the habitat at the landscape level is as important as the conservation of particular forest fragments

    Bioinformatics and molecular modeling in glycobiology

    Get PDF
    The field of glycobiology is concerned with the study of the structure, properties, and biological functions of the family of biomolecules called carbohydrates. Bioinformatics for glycobiology is a particularly challenging field, because carbohydrates exhibit a high structural diversity and their chains are often branched. Significant improvements in experimental analytical methods over recent years have led to a tremendous increase in the amount of carbohydrate structure data generated. Consequently, the availability of databases and tools to store, retrieve and analyze these data in an efficient way is of fundamental importance to progress in glycobiology. In this review, the various graphical representations and sequence formats of carbohydrates are introduced, and an overview of newly developed databases, the latest developments in sequence alignment and data mining, and tools to support experimental glycan analysis are presented. Finally, the field of structural glycoinformatics and molecular modeling of carbohydrates, glycoproteins, and protein–carbohydrate interaction are reviewed

    Gift-tiere

    No full text

    Wirkung des Thorium X auf die Circulation

    No full text

    Allgemeine Therapie

    No full text
    corecore