6,622 research outputs found
A Note on Flips in Diagonal Rectangulations
Rectangulations are partitions of a square into axis-aligned rectangles. A
number of results provide bijections between combinatorial equivalence classes
of rectangulations and families of pattern-avoiding permutations. Other results
deal with local changes involving a single edge of a rectangulation, referred
to as flips, edge rotations, or edge pivoting. Such operations induce a graph
on equivalence classes of rectangulations, related to so-called flip graphs on
triangulations and other families of geometric partitions. In this note, we
consider a family of flip operations on the equivalence classes of diagonal
rectangulations, and their interpretation as transpositions in the associated
Baxter permutations, avoiding the vincular patterns { 3{14}2, 2{41}3 }. This
complements results from Law and Reading (JCTA, 2012) and provides a complete
characterization of flip operations on diagonal rectangulations, in both
geometric and combinatorial terms
Oral Health Intervention: A Multifaceted Approach to Improve Oral Health Care during Pregnancy
Introduction:
Early Childhood Caries (ECC) is the most common chronic disease of childhood
Mothers’ oral health status is a strong predictor of the oral health status of their children
2009:
Vermont spends 495 Medicaid cap on reimbursement for a woman’s dental care during pregnancy and up to 60 days after delivery
American College of Obstetrics and Gynecology (ACOG) Guidelines on prenatal dental care are published
2013:
74% of surveyed Vermont providers treating pregnant women are unaware of the Medicaid change
82% of these providers are not using guidelines to assess oral health during pregnancy
Objective: To improve prenatal dental referral rates from obstetric providers by facilitating Vermont-specific implementation of ACOG guidelineshttps://scholarworks.uvm.edu/comphp_gallery/1212/thumbnail.jp
Pesquisas em reprodução fomentam mudanças tecnológicas na suinocultura.
Projeto: 11.11.11.111
Shortest Paths in Portalgons
Any surface that is intrinsically polyhedral can be represented by a collection of simple polygons (fragments), glued along pairs of equally long oriented edges, where each fragment is endowed with the geodesic metric arising from its Euclidean metric. We refer to such a representation as a portalgon, and we call two portalgons equivalent if the surfaces they represent are isometric.
We analyze the complexity of shortest paths. We call a fragment happy if any shortest path on the portalgon visits it at most a constant number of times. A portalgon is happy if all of its fragments are happy. We present an efficient algorithm to compute shortest paths on happy portalgons.
The number of times that a shortest path visits a fragment is unbounded in general. We contrast this by showing that the intrinsic Delaunay triangulation of any polyhedral surface corresponds to a happy portalgon. Since computing the intrinsic Delaunay triangulation may be inefficient, we provide an efficient algorithm to compute happy portalgons for a restricted class of portalgons
Uso do Implante de Etonogestrel Além da Duração Aprovada – Um Caso ClÃnico
The contraceptive implant is the most effective method of reversible contraception. Observational and trial data indicate that this method remains effective beyond the initially approved duration of use. We report a case of etonogestrel serum levels above the supposed threshold value for ovulation suppression nine years after implant insertion.info:eu-repo/semantics/publishedVersio
Epifisiolise dos suÃnos - observações e diagnóstico.
bitstream/item/59142/1/CUsersPiazzonDocuments63.pd
- …