نتایج جستجو برای: toxoplasma gon

تعداد نتایج: 11073  

Journal: :Journal of Mathematical Sciences 2021

This paper defines Artin groups with m-gon structure and proves that for m > 3 in this class the problems of equality conjugacy words are solvable.

Journal: :Arquivos de neuro-psiquiatria 1998
M B Vincent R A Luna D Scandiuzzi S A Novis

Cervicocogenic headache (CeH) is a relatively common disorder. Although on ideal treatment is available so far, blockades in different structures and nerves may be temporarily effective. We studied the effects of 1-2 mL 0.5% bupivacaine injection at the ipsilateral greater occipital nerve (GON) in 41 CeH patients. The pain is significantly reduced both immediately and as long as 7 days after th...

Journal: :J. Comb. Theory, Ser. A 1996
Richard P. Stanley

A simple bijection is given between dissections of a convex n gon with d diagonals not intersecting in their interiors and standard Young tableaux of shape d d n d Partially supported by National Science Foundation grant DMS For d n let f n d be the number of ways to draw d diagonals in a convex n gon such that no two diagonals intersect in their interior For instance f n n is just the Catalan ...

Journal: :Jurnal Kedokteran Brawijaya (e-journal) 2022

Cerebral toxoplasmosis is one of the frequent opportunistic infections central nervous system Human Immunodeficiency Virus (HIV) patients in presence Toxoplasma Gondii infection. In Indonesia, incidence HIV with cerebral 45%. This study was done to determine demographic, clinical, and laboratory characteristics at Haji Adam Malik Hospital, Medan, based on medical record data 2022. The total sam...

Journal: :Deutsche Zeitschrift für Sportmedizin 2016

Journal: :Journal of Combinatorial Theory, Series A 2018

Journal: :Časopis pro pěstování matematiky a fysiky 1907

Journal: :Bulletin of the Australian Mathematical Society 2001

Journal: :Discrete & Computational Geometry 1996
Boris Aronov Alan R. Davis Tamal K. Dey Sudebkumar Prasant Pal D. Chithra Prasad

We show that the region lit by a point light source inside a simple n-gon after at most k reeections oo the boundary has combinatorial complexity O(n 2k), for any k 1. A lower bound of ((n=k ? (1)) 2k) is also established which matches the upper bound for any xed k. A simple near-optimal algorithm for computing the illuminated region is presented, which runs in O(n 2k log n) time and O(n 2k) sp...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید