Facetas de Porcelana VS Facetas de Resina Composta

Projeto de Pós-Graduação/Dissertação apresentado à Universidade Fernando Pessoa como parte dos requisitos para obtenção do grau de Mestre em Medicina Dentária

Bullying e cyberbullying

Dissertação apresentada à Universidade Fernando Pessoa como parte dos requisitos para a obtenção do grau de Mestre em Psicologia Jurídica

A osteonecrose associada ao uso de bisfosfonatos

Projeto de Pós-Graduação/Dissertação apresentado à Universidade Fernando Pessoa como parte dos requisitos para obtenção do grau de Mestre em Medicina Dentária

Bayesian Packet Loss Detection for TCP

One of TCP's critical tasks is to determine which packets are lost in the network, as a basis for control actions (flow control and packet retransmission). Modern TCP implementations use two mechanisms: timeout, and fast retransmit. Detection via timeout is necessarily a time-consuming operation; fast retransmit, while much quicker, is only effective for a small fraction of packet losses. In this paper we consider the problem of packet loss detection in TCP more generally. We concentrate on the fact that TCP's control actions are necessarily triggered by inference of packet loss, rather than conclusive knowledge. This suggests that one might analyze TCP's packet loss detection in a standard inferencing framework based on probability of detection and probability of false alarm. This paper makes two contributions to that end: First, we study an example of more general packet loss inference, namely optimal Bayesian packet loss detection based on round trip time. We show that for long-lived flows, it is frequently possible to achieve high detection probability and low false alarm probability based on measured round trip time. Second, we construct an analytic performance model that incorporates general packet loss inference into TCP. We show that for realistic detection and false alarm probabilities (as are achievable via our Bayesian detector) and for moderate packet loss rates, the use of more general packet loss inference in TCP can improve throughput by as much as 25%.

On the Intrinsic Locality Properties of Web Reference Streams

There has been considerable work done in the study of Web reference streams: sequences of requests for Web objects. In particular, many studies have looked at the locality properties of such streams, because of the impact of locality on the design and performance of caching and prefetching systems. However, a general framework for understanding why reference streams exhibit given locality properties has not yet emerged. In this work we take a first step in this direction, based on viewing the Web as a set of reference streams that are transformed by Web components (clients, servers, and intermediaries). We propose a graph-based framework for describing this collection of streams and components. We identify three basic stream transformations that occur at nodes of the graph: aggregation, disaggregation and filtering, and we show how these transformations can be used to abstract the effects of different Web components on their associated reference streams. This view allows a structured approach to the analysis of why reference streams show given properties at different points in the Web. Applying this approach to the study of locality requires good metrics for locality. These metrics must meet three criteria: 1) they must accurately capture temporal locality; 2) they must be independent of trace artifacts such as trace length; and 3) they must not involve manual procedures or model-based assumptions. We describe two metrics meeting these criteria that each capture a different kind of temporal locality in reference streams. The popularity component of temporal locality is captured by entropy, while the correlation component is captured by interreference coefficient of variation. We argue that these metrics are more natural and more useful than previously proposed metrics for temporal locality. We use this framework to analyze a diverse set of Web reference traces. We find that this framework can shed light on how and why locality properties vary across different locations in the Web topology. For example, we find that filtering and aggregation have opposing effects on the popularity component of the temporal locality, which helps to explain why multilevel caching can be effective in the Web. Furthermore, we find that all transformations tend to diminish the correlation component of temporal locality, which has implications for the utility of different cache replacement policies at different points in the Web.

Improving the use of asset-building financial services by Latino immigrants in Langley Park, Maryland

Gemstone Team ANSWER Poverty (Assessing the Need for Services Which Effectively Reduce Poverty)

Phylogenomic analyses data of the avian phylogenomics project.

BACKGROUND: Determining the evolutionary relationships among the major lineages of extant birds has been one of the biggest challenges in systematic biology. To address this challenge, we assembled or collected the genomes of 48 avian species spanning most orders of birds, including all Neognathae and two of the five Palaeognathae orders. We used these genomes to construct a genome-scale avian phylogenetic tree and perform comparative genomic analyses. FINDINGS: Here we present the datasets associated with the phylogenomic analyses, which include sequence alignment files consisting of nucleotides, amino acids, indels, and transposable elements, as well as tree files containing gene trees and species trees. Inferring an accurate phylogeny required generating: 1) A well annotated data set across species based on genome synteny; 2) Alignments with unaligned or incorrectly overaligned sequences filtered out; and 3) Diverse data sets, including genes and their inferred trees, indels, and transposable elements. Our total evidence nucleotide tree (TENT) data set (consisting of exons, introns, and UCEs) gave what we consider our most reliable species tree when using the concatenation-based ExaML algorithm or when using statistical binning with the coalescence-based MP-EST algorithm (which we refer to as MP-EST*). Other data sets, such as the coding sequence of some exons, revealed other properties of genome evolution, namely convergence. CONCLUSIONS: The Avian Phylogenomics Project is the largest vertebrate phylogenomics project to date that we are aware of. The sequence, alignment, and tree data are expected to accelerate analyses in phylogenomics and other related areas.

Mi escuela virtual de Educación Matemática

esde el año 2004 la Licenciatura en Matemáticas, consecuente con el principio de pertinencia de la Investigación en la Universidad de Cundinamarca, emprendió acciones inmediatas orientadas a generar procesos de innovación modernizadora en la formación de docentes investigadores en Educación Matemática que contribuyeran con la construcción gradual de bases sólidas para la línea de investigación del programa10, eje articulador del proyecto curricular.

Problemas comentados (XIX)

Algunos problemas nos atraen independientemente de la dificultad de su resolución. El que vamos a presentar lleva como título ¿CÓMO SE LLAMA EL PROFE? Y lo hemos encontrado en el libro de Agustín Fonseca: “El rompecocos” (Ed. Temas de Hoy).

Algoritmos como herramienta en la búsqueda de nuevos datos para la resolución de problemas sobre isometrías del plano

Reconociendo la importancia que tienen los algoritmos en el proceso de resolución de problemas, particularmente en la geometría, se identificaron algunas formas en las que se usan algoritmos que son conocidos para los resolutores, durante la resolución de algún problema. A tales formas se les ha dado el nombre de uso de algoritmos y, específicamente, se describen y se muestran evidencias de los usos relacionados con la obtención de nueva información que permita ampliar los caminos considerados para la solución del problema.

Botany origin and protein content of homemade honeys from Galicia hives (NW Spain)

The botanic origin and the protein content of 15 honeys from small bee farms exploitations of Galicia, for family consume, were studied; the aim is to check if the protein wealth and the pollen wealth are dependent parameters. Seven honeys resulted to be Rhamnus frangula unifloral (pollen patterns with low diversity), two Castanea sativa Miller unifloral, other one heather unifloral, and five was multifloral honeys of various pollen patterns (four Castanea predominant and one Rhamnus frangula predominant). Their pollen wealth was low; eight honeys classified in the Maurizio Class I, 3 in Class II, 2 in Class III, and one in Maurizio Class IV. There has been a wide variability in its protein content (0.09- 4.83 mg prot./g honey). The relative amount of pollen from different taxa has a direct or inverse proportionality to wealth protein.