Трансплантация сердца от доноров, перенесших сердечно-легочную реанимацию

Heart transplantation from сardюpulmonary resuscitated (CPR) donors is one of the way to increase the availability of heart transplantation (HT). The study included 28 recipients: 25 (89,3%) men and 3 (10,7%) women at the age 20-68 (46,2 ± 13,7) who underwent HT from CPR donors in the V.I. Shumakov National Medical Research Center of Transplantology and Artificial Organs in the period from 01.01.2011 to 31.12.2017, that was 4.0% of the total number of HT (n = 698). CPR donor group and control group had no significantly differences in early cardiac transplant dysfunction and 1-, 3- and 5-year survival.Трансплантация сердца от доноров, перенесших сердечно-легочную реанимацию (СЛР) в процессе кондиционирования, является одним из вариантов увеличения доступности трансплантации сердца (ТС). В исследование включили 28 реципиентов: 25 (89,3%) мужчин и 3 (10,7%) женщины, возраст от 20 до 68 (46,2 ± 13,7) лет, которым в ФГУ «ФНЦТиИО им. академика В.И. Шумакова» в период с 01.01.2011 г. по 31.12.2017 г. была выполнена ТС от доноров, перенесших СЛР, что составило 4,0% от общего числа ТС за анализируемый период (n = 698). По частоте развития ранней дисфункции сердечного трансплантата, потребовавшей применения посттрансплантационной МПК, реципиенты групп «донор с СЛР» и «донор без СЛР» достоверно не различались. При сравнительном анализе достоверного различия в одно-, трехи пятилетней выживаемости реципиентов групп «донор с СЛР» и «донор без СЛР» выявлено не было

Branch Retinal Vein Occlusion: Pathogenesis, Visual Prognosis, and Treatment Modalities

In branch retinal vein occlusion (BRVO), abnormal arteriovenous crossing with vein compression, degenerative changes of the vessel wall and abnormal hematological factors constitute the primary mechanism of vessel occlusion. In general, BRVO has a good prognosis: 50–60% of eyes are reported to have a final visual acuity (VA) of 20/40 or better even without treatment. One important prognostic factor for final VA appears to be the initial VA. Grid laser photocoagulation is an established treatment for macular edema in a particular group of patients with BRVO, while promising results for this condition are shown by intravitreal application of steroids or new vascular endothelial growth factor inhibitors. Vitrectomy with or without arteriovenous sheathotomy combined with removal of the internal limiting membrane may improve vision in eyes with macular edema which are unresponsive to or ineligible for laser treatment

Rainbow matchings in properly colored multigraphs

Aharoni and Berger conjectured that in any bipartite multigraph that is properly edge-colored by $n$ colors with at least $n + 1$ edges of each color there must be a matching that uses each color exactly once. In this paper we consider the same question without the bipartiteness assumption. We show that in any multigraph with edge multiplicities $o(n)$ that is properly edge-colored by $n$ colors with at least $n + o(n)$ edges of each color there must be a matching of size $n-O(1)$ that uses each color at most once. Read More: https://epubs.siam.org/doi/abs/10.1137/17M115174

On the number of symbols that forces a transversal

Akbari and Alipour [1] conjectured that any Latin array of order n with at least n2/2 symbols contains a transversal. For large n, we confirm this conjecture, and moreover, we show that n399/200 symbols suffice

Rainbow subdivisions of cliques

We show that for every integer m ≥ 2 and large n, every properly edge-coloured graph on n vertices with at least n(log n)^{53} edges contains a rainbow subdivision of K_{m}. This is sharp up to a polylogarithmic factor. Our proof method exploits the connection between the mixing time of random walks and expansion in graphs

Rainbow factors in hypergraphs

For any $r$-graph $H$, we consider the problem of finding a rainbow $H$-factor in an $r$-graph $G$ with large minimum $\ell$-degree and an edge-colouring that is suitably bounded. We show that the asymptotic degree threshold is the same as that for finding an $H$-factor

Rainbow factors in hypergraphs

For any $r$-graph $H$, we consider the problem of finding a rainbow $H$-factor in an $r$-graph $G$ with large minimum $\ell$-degree and an edge-colouring that is suitably bounded. We show that the asymptotic degree threshold is the same as that for finding an $H$-factor

Heart transplantation from cardiac arrest-resuscitated donors

Heart transplantation from сardюpulmonary resuscitated (CPR) donors is one of the way to increase the availability of heart transplantation (HT). The study included 28 recipients: 25 (89,3%) men and 3 (10,7%) women at the age 20-68 (46,2 ± 13,7) who underwent HT from CPR donors in the V.I. Shumakov National Medical Research Center of Transplantology and Artificial Organs in the period from 01.01.2011 to 31.12.2017, that was 4.0% of the total number of HT (n = 698). CPR donor group and control group had no significantly differences in early cardiac transplant dysfunction and 1-, 3- and 5-year survival

An algorithm for approximate multiparametric convex programming

For multiparametric convex nonlinear programming problems we propose a recursive algorithm for approximating, within a given suboptimality tolerance, the value function and an optimizer as functions of the parameters. The approximate solution is expressed as a piecewise affine function over a simplicial partition of a subset of the feasible parameters, and it is organized over a tree structure for efficiency of evaluation. Adaptations of the algorithm to deal with multiparametric semidefinite programming and multiparametric geometric programming are provided and exemplified. The approach is relevant for real-time implementation of several optimization-based feedback control strategies