887 resultados para vector competence
Resumo:
Since the beginning, some pattern recognition techniques have faced the problem of high computational burden for dataset learning. Among the most widely used techniques, we may highlight Support Vector Machines (SVM), which have obtained very promising results for data classification. However, this classifier requires an expensive training phase, which is dominated by a parameter optimization that aims to make SVM less prone to errors over the training set. In this paper, we model the problem of finding such parameters as a metaheuristic-based optimization task, which is performed through Harmony Search (HS) and some of its variants. The experimental results have showen the robustness of HS-based approaches for such task in comparison against with an exhaustive (grid) search, and also a Particle Swarm Optimization-based implementation.
Resumo:
In this paper we deal with the notion of regulated functions with values in a C*-algebra A and present examples using a special bi-dimensional C*-algebra of triangular matrices. We consider the Dushnik integral for these functions and shows that a convenient choice of the integrator function produces an integral homomorphism on the C*-algebra of all regulated functions ([a, b], A). Finally we construct a family of linear integral functionals on this C*-algebra.
Resumo:
In this paper some aspects on chaotic behavior and minimality in planar piecewise smooth vector fields theory are treated. The occurrence of non-deterministic chaos is observed and the concept of orientable minimality is introduced. Some relations between minimality and orientable minimality are also investigated and the existence of new kinds of non-trivial minimal sets in chaotic systems is observed. The approach is geometrical and involves the ordinary techniques of non-smooth systems.
Resumo:
Design tools have existed for decades for standard step-index fibers, with analytical expressions for cutoff conditions as a function of core size, refractive indexes, and wavelength. We present analytical expressions for cutoff conditions for fibers with a ring-shaped propagation region. We validate our analytical expressions against numerical solutions, as well as via asymptotic analysis yielding the existing solutions for standard step-index fiber. We demonstrate the utility of our solutions for optimizing fibers supporting specific eigenmode behaviors of interest for spatial division multiplexing. In particular, we address large mode separation for orbital angular momentum modes and fibers supporting only modes with a single intensity ring.
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
High throughput sequencing (HTS) provides new research opportunities for work on non-model organisms, such as differential expression studies between populations exposed to different environmental conditions. However, such transcriptomic studies first require the production of a reference assembly. The choice of sampling procedure, sequencing strategy and assembly workflow is crucial. To develop a reliable reference transcriptome for Triatoma brasiliensis, the major Chagas disease vector in Northeastern Brazil, different de novo assembly protocols were generated using various datasets and software. Both 454 and Illumina sequencing technologies were applied on RNA extracted from antennae and mouthparts from single or pooled individuals. The 454 library yielded 278 Mb. Fifteen Illumina libraries were constructed and yielded nearly 360 million RNA-seq single reads and 46 million RNA-seq paired-end reads for nearly 45 Gb. For the 454 reads, we used three assemblers, Newbler, CAP3 and/or MIRA and for the Illumina reads, the Trinity assembler. Ten assembly workflows were compared using these programs separately or in combination. To compare the assemblies obtained, quantitative and qualitative criteria were used, including contig length, N50, contig number and the percentage of chimeric contigs. Completeness of the assemblies was estimated using the CEGMA pipeline. The best assembly (57,657 contigs, completeness of 80 %, < 1 % chimeric contigs) was a hybrid assembly leading to recommend the use of (1) a single individual with large representation of biological tissues, (2) merging both long reads and short paired-end Illumina reads, (3) several assemblers in order to combine the specific advantages of each.
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Since dogs presenting several vector borne diseases can show none or nonspecific clinical signs depending on the phase of infection, the assessment of the particular agents involved is mandatory. The present study aimed to investigate the presence of Babesia spp., Ehrlichia spp., Anaplasma spp., Hepatozoon spp. and Leishmania spp. in blood samples and ticks, collected from two dogs from Rio Grande do Norte showing suggestive tick-borne disease by using molecular techniques. DNA of E. canis, H. canis and L. infantum were detected in blood samples and R. sanguineus ticks collected from dogs. Among all samples analyzed, two showed the presence of multiple infections with E. canis, H. canis and L. infantum chagasi. Here we highlighted the need for molecular differential diagnosis in dogs showing nonspecific clinical signs.
Resumo:
In the pattern recognition research field, Support Vector Machines (SVM) have been an effectiveness tool for classification purposes, being successively employed in many applications. The SVM input data is transformed into a high dimensional space using some kernel functions where linear separation is more likely. However, there are some computational drawbacks associated to SVM. One of them is the computational burden required to find out the more adequate parameters for the kernel mapping considering each non-linearly separable input data space, which reflects the performance of SVM. This paper introduces the Polynomial Powers of Sigmoid for SVM kernel mapping, and it shows their advantages over well-known kernel functions using real and synthetic datasets.