533 resultados para indexing
Resumo:
Pós-graduação em Ciência da Informação - FFC
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
This article analyzes the specific features and processes of indexing and classification performed in school libraries to process and retrieve information from their collections. Subject languages used in Spanish, Portuguese and Brazilian Portuguese school libraries are also analyzed. To achieve this goal, the concept of school library was analyzed, its function was studied and the techniques and tools that allow the information organization were examined. Among the tools, we studied the Subject Headings Lists for children and juveniles'books and the Subject Headings List for public libraries, the Universal Decimal Classification System (paperback edition) or the classification by fields of interest and specialized thesauri like the Tesauro de la Educacion UNESCO-OIE and the TesauroEuropeo de la Educacion.
Resumo:
A healthy and attractive smile is very valued in today s society. Yet this requires better aesthetic and cosmetic solutions from dental surgeons.The present paper presents a case report of diastema closure using an association of tooth movement induced by orthodontic elastics,dental cosmetics and resin-bonded prosthesis. The female patient L.B.A.J., aged 19 years, visited the Integrated Clinic of Araçatuba DentalSchool UNESP mainly complaining of missing teeth and poor esthetics. After anamnesis, clinical and radiographic examination revealedhypodontia of the maxillary right and left first premolars, abnormal maxillary right lateral incisor shape and diastema between the maxillaryright lateral incisor and canine and between the maxillary left lateral incisor and canine. Planning was done which included indication ofdiastema closure with composite resin restoration and metal-free resin-bonded prosthesis, with a structure made of Vectris (Ivoclar VivadentInc., Amherst, NT, USA). The option for dental cosmetics associated with resin-bonded prosthesis after movement with orthodontic elasticsresulted in an excellent aesthetic outcome of low cost and short treatment duration.Indexing terms: composite resins; diastema; fixed resin bonded partial denture.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Pós-graduação em Ciência da Informação - FFC
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Pós-graduação em Ciência da Informação - FFC
Resumo:
Spatial data warehouses (SDWs) allow for spatial analysis together with analytical multidimensional queries over huge volumes of data. The challenge is to retrieve data related to ad hoc spatial query windows according to spatial predicates, avoiding the high cost of joining large tables. Therefore, mechanisms to provide efficient query processing over SDWs are essential. In this paper, we propose two efficient indices for SDW: the SB-index and the HSB-index. The proposed indices share the following characteristics. They enable multidimensional queries with spatial predicate for SDW and also support predefined spatial hierarchies. Furthermore, they compute the spatial predicate and transform it into a conventional one, which can be evaluated together with other conventional predicates by accessing a star-join Bitmap index. While the SB-index has a sequential data structure, the HSB-index uses a hierarchical data structure to enable spatial objects clustering and a specialized buffer-pool to decrease the number of disk accesses. The advantages of the SB-index and the HSB-index over the DBMS resources for SDW indexing (i.e. star-join computation and materialized views) were investigated through performance tests, which issued roll-up operations extended with containment and intersection range queries. The performance results showed that improvements ranged from 68% up to 99% over both the star-join computation and the materialized view. Furthermore, the proposed indices proved to be very compact, adding only less than 1% to the storage requirements. Therefore, both the SB-index and the HSB-index are excellent choices for SDW indexing. Choosing between the SB-index and the HSB-index mainly depends on the query selectivity of spatial predicates. While low query selectivity benefits the HSB-index, the SB-index provides better performance for higher query selectivity.
Resumo:
We study a probabilistic model of interacting spins indexed by elements of a finite subset of the d-dimensional integer lattice, da parts per thousand yen1. Conditions of time reversibility are examined. It is shown that the model equilibrium distribution converges to a limit distribution as the indexing set expands to the whole lattice. The occupied site percolation problem is solved for the limit distribution. Two models with similar dynamics are also discussed.
Resumo:
In mammalian species, profibrogenic cells are activated to become myofibroblasts in response to liver damage. Few studies have examined hepatic myofibroblasts and their role in liver damage in teleosts. The aim of the present study was to investigate the involvement of myofibroblast-like cells in rainbow trout (Oncorhynchus mykiss) with hepatic damage induced by aflatoxin B1 (AFB1). Histopathological and immunohistochemical analyses characterized alterations in the liver stroma during the carcinogenic process. Anti-human a-smoothmuscle actin (SMA) and anti-human desmin primary antibodies were used in immunohistochemistry. Only the anti-SMA reagent labelled cells in trout liver. In the livers of control fish, only smooth muscle in blood vessels and around bile ducts was labelled. In the livers from AFB1-treated fish, SMA-positive cells were present in the stroma surrounding neoplastic lesions and in areas of desmoplastic reaction. These observations indicate that in teleosts, as in mammals, the myofibroblast-like cell is involved in fibrosis associated with liver injury. Chronic liver injury induced in trout by aflatoxin may provide a useful model system for study of the evolution of such mechanisms.
Resumo:
Sistemas de gestão desenvolvidos para a web, a partir de metadados, permitem manutenção eficiente de grandes quantidades de informação. Um vocabulário controlado como o utilizado pelo Sistema Integrado de Bibliotecas da USP (SIBi/USP) necessita de atualização contínua realizada através de uma rede colaborativa com a participação de bibliotecários indexadores de todas as áreas do conhecimento. Este trabalho apresenta os resultados obtidos com o sistema de gestão desenvolvido pelo Grupo de Gerenciamento para a manutenção do Vocabulário Controlado do SIBi/USP. O fluxo deste sistema consiste em filtros de validação realizados pelos componentes do Grupo de Gerenciamento do Vocabulário. A metodologia de gestão do Vocabulário possui além deste sistema, uma política de governança. Os resultados obtidos nos seis anos desde a ativação do sistema de gestão pela Base de Sugestões consistiram em: 1192 inclusões de descritores, 240 alterações, 61 exclusões, totalizando 1493 operações. A gestão e o controle de qualidade do Vocabulário permitiram o aprimoramento do tratamento e da recuperação da informação no Banco de Dados Bibliográficos da USP – DEDALUS.
Resumo:
O artigo apresenta uma análise da operacionalidade das Folksonomias e a possibilidade de aplicação dessa ferramenta nos sistemas de organização da informação da área de Ciência da Informação. Para tanto foi realizada uma análise de coerência de tags e dos recursos disponíveis para etiquetagem em dois websites, a Last.fm e o CiteULike. Por meio dessa análise constatou-se que em ambos os websites ocorreram incoerências e discrepâncias nas tags utilizadas. Todavia, o sistema da Last.fm demonstrou-se mais funcional que o do CiteULike obtendo um desempenho melhor. Por fim, sugere-se a junção das Folksonomias às Ontologias, que permitiriam a criação de sistemas automatizados de organização de conteúdos informacionais alimentados pelos próprios usuários
Resumo:
The ubiquity of time series data across almost all human endeavors has produced a great interest in time series data mining in the last decade. While dozens of classification algorithms have been applied to time series, recent empirical evidence strongly suggests that simple nearest neighbor classification is exceptionally difficult to beat. The choice of distance measure used by the nearest neighbor algorithm is important, and depends on the invariances required by the domain. For example, motion capture data typically requires invariance to warping, and cardiology data requires invariance to the baseline (the mean value). Similarly, recent work suggests that for time series clustering, the choice of clustering algorithm is much less important than the choice of distance measure used.In this work we make a somewhat surprising claim. There is an invariance that the community seems to have missed, complexity invariance. Intuitively, the problem is that in many domains the different classes may have different complexities, and pairs of complex objects, even those which subjectively may seem very similar to the human eye, tend to be further apart under current distance measures than pairs of simple objects. This fact introduces errors in nearest neighbor classification, where some complex objects may be incorrectly assigned to a simpler class. Similarly, for clustering this effect can introduce errors by “suggesting” to the clustering algorithm that subjectively similar, but complex objects belong in a sparser and larger diameter cluster than is truly warranted.We introduce the first complexity-invariant distance measure for time series, and show that it generally produces significant improvements in classification and clustering accuracy. We further show that this improvement does not compromise efficiency, since we can lower bound the measure and use a modification of triangular inequality, thus making use of most existing indexing and data mining algorithms. We evaluate our ideas with the largest and most comprehensive set of time series mining experiments ever attempted in a single work, and show that complexity-invariant distance measures can produce improvements in classification and clustering in the vast majority of cases.
Resumo:
The increasing diffusion of wireless-enabled portable devices is pushing toward the design of novel service scenarios, promoting temporary and opportunistic interactions in infrastructure-less environments. Mobile Ad Hoc Networks (MANET) are the general model of these higly dynamic networks that can be specialized, depending on application cases, in more specific and refined models such as Vehicular Ad Hoc Networks and Wireless Sensor Networks. Two interesting deployment cases are of increasing relevance: resource diffusion among users equipped with portable devices, such as laptops, smart phones or PDAs in crowded areas (termed dense MANET) and dissemination/indexing of monitoring information collected in Vehicular Sensor Networks. The extreme dynamicity of these scenarios calls for novel distributed protocols and services facilitating application development. To this aim we have designed middleware solutions supporting these challenging tasks. REDMAN manages, retrieves, and disseminates replicas of software resources in dense MANET; it implements novel lightweight protocols to maintain a desired replication degree despite participants mobility, and efficiently perform resource retrieval. REDMAN exploits the high-density assumption to achieve scalability and limited network overhead. Sensed data gathering and distributed indexing in Vehicular Networks raise similar issues: we propose a specific middleware support, called MobEyes, exploiting node mobility to opportunistically diffuse data summaries among neighbor vehicles. MobEyes creates a low-cost opportunistic distributed index to query the distributed storage and to determine the location of needed information. Extensive validation and testing of REDMAN and MobEyes prove the effectiveness of our original solutions in limiting communication overhead while maintaining the required accuracy of replication degree and indexing completeness, and demonstrates the feasibility of the middleware approach.