27,990 research outputs found

    Content Based Image Retrieval by Convolutional Neural Networks

    Get PDF
    Hamreras S., Benítez-Rochel R., Boucheham B., Molina-Cabello M.A., López-Rubio E. (2019) Content Based Image Retrieval by Convolutional Neural Networks. In: Ferrández Vicente J., Álvarez-Sánchez J., de la Paz López F., Toledo Moreo J., Adeli H. (eds) From Bioinspired Systems and Biomedical Applications to Machine Learning. IWINAC 2019. Lecture Notes in Computer Science, vol 11487. Springer.In this paper, we present a Convolutional Neural Network (CNN) for feature extraction in Content based Image Retrieval (CBIR). The proposed CNN aims at reducing the semantic gap between low level and high-level features. Thus, improving retrieval results. Our CNN is the result of a transfer learning technique using Alexnet pretrained network. It learns how to extract representative features from a learning database and then uses this knowledge in query feature extraction. Experimentations performed on Wang (Corel 1K) database show a significant improvement in terms of precision over the state of the art classic approaches.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech

    Diverse auto-curriculum is critical for successful real-world multiagent learning systems

    Get PDF
    Multiagent reinforcement learning (MARL) has achieved a remarkable amount of success in solving various types of video games. A cornerstone of this success is the auto-curriculum framework, which shapes the learning process by continually creating new challenging tasks for agents to adapt to, thereby facilitating the acquisition of new skills. In order to extend MARL methods to real-world domains outside of video games, we envision in this blue sky paper that maintaining a diversity-aware auto-curriculum is critical for successful MARL applications. Specifically, we argue that behavioural diversity is a pivotal, yet under-explored, component for real-world multiagent learning systems, and that significant work remains in understanding how to design a diversity-aware auto-curriculum. We list four open challenges for auto-curriculum techniques, which we believe deserve more attention from this community. Towards validating our vision, we recommend modelling realistic interactive behaviours in autonomous driving as an important test bed, and recommend the SMARTS/ULTRA benchmark

    Blind trials of computer-assisted structure elucidation software

    Get PDF
    <p>Abstract</p> <p>Background</p> <p>One of the largest challenges in chemistry today remains that of efficiently mining through vast amounts of data in order to elucidate the chemical structure for an unknown compound. The elucidated candidate compound must be fully consistent with the data and any other competing candidates efficiently eliminated without doubt by using additional data if necessary. It has become increasingly necessary to incorporate an <it>in silico </it>structure generation and verification tool to facilitate this elucidation process. An effective structure elucidation software technology aims to mimic the skills of a human in interpreting the complex nature of spectral data while producing a solution within a reasonable amount of time. This type of software is known as computer-assisted structure elucidation or CASE software. A systematic trial of the ACD/Structure Elucidator CASE software was conducted over an extended period of time by analysing a set of single and double-blind trials submitted by a global audience of scientists. The purpose of the blind trials was to reduce subjective bias. Double-blind trials comprised of data where the candidate compound was unknown to both the submitting scientist and the analyst. The level of expertise of the submitting scientist ranged from novice to expert structure elucidation specialists with experience in pharmaceutical, industrial, government and academic environments.</p> <p>Results</p> <p>Beginning in 2003, and for the following nine years, the algorithms and software technology contained within ACD/Structure Elucidator have been tested against 112 data sets; many of these were unique challenges. Of these challenges 9% were double-blind trials. The results of eighteen of the single-blind trials were investigated in detail and included problems of a diverse nature with many of the specific challenges associated with algorithmic structure elucidation such as deficiency in protons, structure symmetry, a large number of heteroatoms and poor quality spectral data.</p> <p>Conclusion</p> <p>When applied to a complex set of blind trials, ACD/Structure Elucidator was shown to be a very useful tool in advancing the computer's contribution to elucidating a candidate structure from a set of spectral data (NMR and MS) for an unknown. The synergistic interaction between humans and computers can be highly beneficial in terms of less biased approaches to elucidation as well as dramatic improvements in speed and throughput. In those cases where multiple candidate structures exist, ACD/Structure Elucidator is equipped to validate the correct structure and eliminate inconsistent candidates. Full elucidation can generally be performed in less than two hours; this includes the average spectral data processing time and data input.</p

    Approximation algorithms for maximally balanced connected graph partition

    Full text link
    Given a simple connected graph G=(V,E)G = (V, E), we seek to partition the vertex set VV into kk non-empty parts such that the subgraph induced by each part is connected, and the partition is maximally balanced in the way that the maximum cardinality of these kk parts is minimized. We refer this problem to as {\em min-max balanced connected graph partition} into kk parts and denote it as {\sc kk-BGP}. The general vertex-weighted version of this problem on trees has been studied since about four decades ago, which admits a linear time exact algorithm; the vertex-weighted {\sc 22-BGP} and {\sc 33-BGP} admit a 5/45/4-approximation and a 3/23/2-approximation, respectively; but no approximability result exists for {\sc kk-BGP} when k4k \ge 4, except a trivial kk-approximation. In this paper, we present another 3/23/2-approximation for our cardinality {\sc 33-BGP} and then extend it to become a k/2k/2-approximation for {\sc kk-BGP}, for any constant k3k \ge 3. Furthermore, for {\sc 44-BGP}, we propose an improved 24/1324/13-approximation. To these purposes, we have designed several local improvement operations, which could be useful for related graph partition problems.Comment: 23 pages, 7 figures, accepted for presentation at COCOA 2019 (Xiamen, China

    Topological Analysis of Metabolic Networks Integrating Co-Segregating Transcriptomes and Metabolomes in Type 2 Diabetic Rat Congenic Series

    Get PDF
    Background: The genetic regulation of metabolic phenotypes (i.e., metabotypes) in type 2 diabetes mellitus is caused by complex organ-specific cellular mechanisms contributing to impaired insulin secretion and insulin resistance. Methods: We used systematic metabotyping by 1H NMR spectroscopy and genome-wide gene expression in white adipose tissue to map molecular phenotypes to genomic blocks associated with obesity and insulin secretion in a series of rat congenic strains derived from spontaneously diabetic Goto-Kakizaki (GK) and normoglycemic Brown-Norway (BN) rats. We implemented a network biology strategy approach to visualise shortest paths between metabolites and genes significantly associated with each genomic block. Results: Despite strong genomic similarities (95-99%) among congenics, each strain exhibited specific patterns of gene expression and metabotypes, reflecting metabolic consequences of series of linked genetic polymorphisms in the congenic intervals. We subsequently used the congenic panel to map quantitative trait loci underlying specific metabotypes (mQTL) and genome-wide expression traits (eQTL). Variation in key metabolites like glucose, succinate, lactate or 3-hydroxybutyrate, and second messenger precursors like inositol was associated with several independent genomic intervals, indicating functional redundancy in these regions. To navigate through the complexity of these association networks we mapped candidate genes and metabolites onto metabolic pathways and implemented a shortest path strategy to highlight potential mechanistic links between metabolites and transcripts at colocalized mQTLs and eQTLs. Minimizing shortest path length drove prioritization of biological validations by gene silencing. Conclusions: These results underline the importance of network-based integration of multilevel systems genetics datasets to improve understanding of the genetic architecture of metabotype and transcriptomic regulations and to characterize novel functional roles for genes determining tissue-specific metabolism

    Pleosporales

    Get PDF
    One hundred and five generic types of Pleosporales are described and illustrated. A brief introduction and detailed history with short notes on morphology, molecular phylogeny as well as a general conclusion of each genus are provided. For those genera where the type or a representative specimen is unavailable, a brief note is given. Altogether 174 genera of Pleosporales are treated. Phaeotrichaceae as well as Kriegeriella, Zeuctomorpha and Muroia are excluded from Pleosporales. Based on the multigene phylogenetic analysis, the suborder Massarineae is emended to accommodate five families, viz. Lentitheciaceae, Massarinaceae, Montagnulaceae, Morosphaeriaceae and Trematosphaeriaceae

    Multiferroicity in an organic charge-transfer salt: Electric-dipole-driven magnetism

    Get PDF
    Multiferroics, showing simultaneous ordering of electrical and magnetic degrees of freedom, are remarkable materials as seen from both the academic and technological points of view. A prominent mechanism of multiferroicity is the spin-driven ferroelectricity, often found in frustrated antiferromagnets with helical spin order. There, similar to conventional ferroelectrics, the electrical dipoles arise from an off-centre displacement of ions. However, recently a different mechanism, namely purely electronic ferroelectricity, where charge order breaks inversion symmetry, has attracted considerable interest. Here we provide evidence for this exotic type of ferroelectricity, accompanied by antiferromagnetic spin order, in a two-dimensional organic charge-transfer salt, thus representing a new class of multiferroics. Quite unexpectedly for electronic ferroelectrics, dipolar and spin order arise nearly simultaneously. This can be ascribed to the loss of spin frustration induced by the ferroelectric ordering. Hence, here the spin order is driven by the ferroelectricity, in marked contrast to the spin-driven ferroelectricity in helical magnets.Comment: 8 pages, 9 figures (including 4 pages and 6 figures in supplementary information). Version 2 with minor errors corrected (legend of Fig. 3c and definition of vectors e and Q
    corecore