922 resultados para Computer arithmetic and logic units
Resumo:
The design of full programmable type-2 membership function circuit is presented in this paper. This circuit is used to implement the fuzzifier block of Type-2 Fuzzy Logic Controller chip. In this paper the type-2 fuzzy set was obtained by blurring the width of the type-1 fuzzy set. This circuit allows programming the height and the shape of the membership function. It operates in current mode, with supply voltage of 3.3V. The simulation results of interval type-2 membership function circuit have been done in CMOS 0.35μm technology using Mentor Graphics software. © 2011 IEEE.
Resumo:
This paper aims to present the use of a learning object (CADILAG), developed to facilitate understanding data structure operations by using visual presentations and animations. The CADILAG allows visualizing the behavior of algorithms usually discussed during Computer Science and Information System courses. For each data structure it is possible visualizing its content and its operation dynamically. Its use was evaluated an the results are presented. © 2012 AISTI.
Resumo:
Background: Brain abscess of dental origin is a rare situation and deserves attention due to its high mortality rate even when adequate treatment is done. Few reports are available when dental origin is the main cause of this infection. Case report: We present the case of a 70-year-old man diagnosed with cerebral abscess caused by apical lesions located at superior and inferior teeth. The three lesions containing pus were drained from anterior and posterior brain region and the laboratory evaluation revealed the presence of Streptococcus viridians and Bacteroides. Postoperative period was uneventful with excellent recovery after 1 year of surgery. Final diagnosis was able to be done due to excellent image exams availability like computer tomography and magnetic resonance using diffusion and perfusion techniques. Discussion: The early detection of this pathology with the correct diagnosis essential to give the patient the best treatment including antimicrobial drugs and drainage is of extreme importance. © 2011 Springer-Verlag.
Resumo:
Constrained intervals, intervals as a mapping from [0, 1] to polynomials of degree one (linear functions) with non-negative slopes, and arithmetic on constrained intervals generate a space that turns out to be a cancellative abelian monoid albeit with a richer set of properties than the usual (standard) space of interval arithmetic. This means that not only do we have the classical embedding as developed by H. Radström, S. Markov, and the extension of E. Kaucher but the properties of these polynomials. We study the geometry of the embedding of intervals into a quasilinear space and some of the properties of the mapping of constrained intervals into a space of polynomials. It is assumed that the reader is familiar with the basic notions of interval arithmetic and interval analysis. © 2013 Springer-Verlag Berlin Heidelberg.
Resumo:
Inferences about leaf anatomical characteristics had largely been made by manually measuring diverse leaf regions, such as cuticle, epidermis and parenchyma to evaluate differences caused by environmental variables. Here we tested an approach for data acquisition and analysis in ecological quantitative leaf anatomy studies based on computer vision and pattern recognition methods. A case study was conducted on Gochnatia polymorpha (Less.) Cabrera (Asteraceae), a Neotropical savanna tree species that has high phenotypic plasticity. We obtained digital images of cross-sections of its leaves developed under different light conditions (sun vs. shade), different seasons (dry vs. wet) and in different soil types (oxysoil vs. hydromorphic soil), and analyzed several visual attributes, such as color, texture and tissues thickness in a perpendicular plane from microscopic images. The experimental results demonstrated that computational analysis is capable of distinguishing anatomical alterations in microscope images obtained from individuals growing in different environmental conditions. The methods presented here offer an alternative way to determine leaf anatomical differences. © 2013 Elsevier B.V.
Resumo:
Biogeographical systems can be analyzed as networks of species and geographical units. Within such a biogeographical network, individual species may differ fundamentally in their linkage pattern, and therefore hold different topological roles. To advance our understanding of the relationship between species traits and large-scale species distribution patterns in archipelagos, we use a network approach to classify birds as one of four biogeographical species roles: peripherals, connectors, module hubs, and network hubs. These roles are based upon the position of species within the modular network of islands and species in Wallacea and the West Indies. We test whether species traits - including habitat requirements, altitudinal range-span, feeding guild, trophic level, and body length - correlate with species roles. In both archipelagos, habitat requirements, altitudinal range-span and body length show strong relations to species roles. In particular, species that occupy coastal- and open habitats, as well as habitat generalists, show higher proportions of connectors and network hubs and thus tend to span several biogeographical modules (i.e. subregions). Likewise, large body size and a wide altitudinal range-span are related to a wide distribution on many islands and across several biogeographical modules. On the other hand, species restricted to interior forest are mainly characterized as peripherals and, thus, have narrow and localized distributions within biogeographical modules rather than across the archipelago-wide network. These results suggest that the ecological amplitude of a species is highly related to its geographical distribution within and across bio geographical subregions and furthermore supports the idea that large-scale species distributions relate to distributions at the local community level. We finally discuss how our biogeographical species roles may correspond to the stages of the taxon cycle and other prominent theories of species assembly. © 2013 The Authors.
Resumo:
Includes bibliography
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:
Pós-graduação em Engenharia Elétrica - FEIS
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
This article presents some aspects of the relationship between the philosophies of Frege and Stuart Mill, from the standpoint of the fregean critic of psychologism and empiricism. I defend the thesis that, in Foundations of Arithmetic, Frege directs his criticism to the empiricism professed by Mill in his System of Logic; this critic does not constitutes a ‘charge’ of the English philosopher as being a psychologist. For this, we presented several aspects concerning the role that the antipsicologismo has in the Fregean thought and its direct relationship with the logicist project of reduction of arithmetic to logic. To defend our thesis, some arguments intended to show that empiricism not necessarily and directly imply psychologism are presented.
Resumo:
With the widespread proliferation of computers, many human activities entail the use of automatic image analysis. The basic features used for image analysis include color, texture, and shape. In this paper, we propose a new shape description method, called Hough Transform Statistics (HTS), which uses statistics from the Hough space to characterize the shape of objects or regions in digital images. A modified version of this method, called Hough Transform Statistics neighborhood (HTSn), is also presented. Experiments carried out on three popular public image databases showed that the HTS and HTSn descriptors are robust, since they presented precision-recall results much better than several other well-known shape description methods. When compared to Beam Angle Statistics (BAS) method, a shape description method that inspired their development, both the HTS and the HTSn methods presented inferior results regarding the precision-recall criterion, but superior results in the processing time and multiscale separability criteria. The linear complexity of the HTS and the HTSn algorithms, in contrast to BAS, make them more appropriate for shape analysis in high-resolution image retrieval tasks when very large databases are used, which are very common nowadays. (C) 2014 Elsevier Inc. All rights reserved.
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Huge image collections are becoming available lately. In this scenario, the use of Content-Based Image Retrieval (CBIR) systems has emerged as a promising approach to support image searches. The objective of CBIR systems is to retrieve the most similar images in a collection, given a query image, by taking into account image visual properties such as texture, color, and shape. In these systems, the effectiveness of the retrieval process depends heavily on the accuracy of ranking approaches. Recently, re-ranking approaches have been proposed to improve the effectiveness of CBIR systems by taking into account the relationships among images. The re-ranking approaches consider the relationships among all images in a given dataset. These approaches typically demands a huge amount of computational power, which hampers its use in practical situations. On the other hand, these methods can be massively parallelized. In this paper, we propose to speedup the computation of the RL-Sim algorithm, a recently proposed image re-ranking approach, by using the computational power of Graphics Processing Units (GPU). GPUs are emerging as relatively inexpensive parallel processors that are becoming available on a wide range of computer systems. We address the image re-ranking performance challenges by proposing a parallel solution designed to fit the computational model of GPUs. We conducted an experimental evaluation considering different implementations and devices. Experimental results demonstrate that significant performance gains can be obtained. Our approach achieves speedups of 7x from serial implementation considering the overall algorithm and up to 36x on its core steps.