bluuebunny/crossref_metadata_2025_split huggingface dataset:
Effect of a nurse-led secondary stroke prevention intervention on medium-term stroke outcome in a teaching hospital in Nigeria
Authors: Ademuyiwa Iyabo Yewande , Okubadejo Njideka U. 
Published: August 2021

Background:
Mortality and morbidity attributable to stroke remain high in developing countries. Secondary prevention of stroke can reduce recurrence using targeted interventions addressing modifiable risk factors. This study assessed the effect of a nurse-led secondary stroke prevention intervention on compliance to lifestyle, diet, clinic and physical therapy attendance, and drug compliance over the medium-term poststroke.

Methods:
The study utilized a case (interventional group)–control (noninterventional group) quasi-experimental design. Sixty consenting acute stroke patients surviving till discharge were consecutively recruited into the study and conveniently assigned to either group in a 1:1 ratio. Recruitment was conducted over the initial 3 months of the study. The intervention group received standardized intensive in-person counseling for cases and designated caregivers at discharge. This means that, apart from standardized intensive in-person counseling for cases and designated caregivers at discharge. There was additional telephone calls and weekly short messages to the intervention group in-order to reinforce information and communication during follow-up. The nonintervention group received discharge instructions provided by the managing physician only. Outcome assessment was conducted at 9 months post stroke.

Results:
The study recruited 39 (65%) males and 21 (35%) females. The mean age of participants in intervention group was 55.0 ± 14.5 years, while it was 56.0 ± 11.2 years in the nonintervention group. Other demographic parameters were similar between both the groups. At the end of the follow-up period of 9 months, compliance with lifestyle and diet modification, clinic and physical therapy attendance, and drug compliance was statistically significantly higher in the intervention compared to the nonintervention group (P < 0.05 for all comparisons).

Conclusion:
This study demonstrates the potential utility of a nurse-led intervention incorporating targeted lifestyle risk modification on compliance to strategies aimed at reducing stroke recurrence. Adoption of this task shifting/sharing strategy is recommended.
Angiographic Profile and Therapeutic Approach of Prior Coronary Artery Bypass Graft Patients Presenting with Acute Coronary Syndromes
Authors: Immaneni Sathyamurthy , Manikandan T. , Kirubakaran K. , Srinivasan K. N. , Nayak Rajeswari , Oomman Abraham , Kumar K. Pramod , Gunasekaran Sengottuvelu 
Published: August 2021

Abstract

Objectives:
Patients presenting as acute coronary syndromes (ACS) after coronary artery bypass graft (CABG) surgery are different subset with multiple comorbidities. Reappearance of symptoms could be due to either native vessel, graft disease, or both. The aim of the present study was to evaluate the mode of presentation, angiographic profile, and management strategies followed in them.

Methods:
One hundred consecutive patients presenting with ACS during 2 years' period at a tertiary care hospital were studied. ST segment elevation myocardial infarction (STEMI) was noted only in 7 cases, rest had either non-STEMI or unstable angina. Their comorbid risk factors, echocardiographic left ventricular ejection fraction were noted. All of them undergone invasive coronary angiography followed by revascularization as indicated.

Results:
Fifty percent of cases presented with reappearance of symptoms within 10 years after surgery. Culprit vessel identified was saphenous vein graft (SVG) in 49% followed by native vessel in (22%), both SVG and native vessel in 15%. Only 14% showed left internal mammary artery (LIMA) graft block at distal anastomotic site. Percutaneous coronary intervention was done in 47, redo CABG surgery in 8 cases. Rest were continued on optimal medical treatment. Of the 47 who have undergone PCI, 14 were done for SVGs and in 4 to LIMA graft to the left anterior descending. PCI to native vessel was done in 22 cases and in 7 one SVG and one native vessel.

Conclusions:
Post-CABG surgery patients are high risk subset with multiple comorbidities including impaired renal functions. Presentation as STEMI was less common. Majority of them can be managed with PCI of grafts or native vessels or both. Optimal medical treatment was advised in whom intervention or redo CABG is not feasible. More studies are needed comparing post-CABG ACS patients with de novo cases in Indian patients.
Scoring Balloon Versus Drug-Eluting Balloon in Coronary Intervention for Very Small Coronary Vessels
Authors: Metwally Yasser Gaber , Elnady Khaled Y. 
Published: August 2021

Abstract

Background:
The optimal therapeutic strategy for coronary intervention in very small coronary vessels (<2.5 mm.) remains controversial and challenging.

Objective:
The aim of this study is to assess the 12 months outcome of scoring balloon (SB) versus drug-eluting balloon (DEB) in very small (<2.5 mm) coronary interventions.

Patients and Methods:
Seventy-seven patients referred for coronary intervention with reference vessel diameter <2.5 mm were assigned to either SB or DEB. The primary endpoint was target vessel revascularization (TVR) at 12 months follow-up.

Results:
Out of 77 patients enrolled, 37.7% were assigned to SB, while 62.3% were assigned to DEB. Sever dissection rate was significantly higher among the DEB group (0% vs. 12.5%, P = 0.048); while TVR rate was significantly lower among the SB group (0% vs. 12.5%, P = 0.048). Similarly, the target vessel-related myocardial infarction rate was significantly lower among the SB group (0% vs. 12.5%, P = 0.048). On the other hand, there were no significant differences in the rates of deaths or restenosis between the two groups.

Conclusion and Recommendations:
SB is superior to the DEB with better both safety and efficacy for coronary intervention in very small coronary vessels (<2.5 mm). Larger scaled prospective multicenter randomized trials are needed for confirming our favorable results of using SB for coronary intervention in very small coronary vessels <2.5 mm.
Comparison of Diagnostic Performances of Urine Cytology Before and After the Use of The Paris System Criteria
Authors: Onder Sevgen , Kurtulan Olcay , Kavuncuoglu Altan , Akdogan Bulent 
Published: August 2021

Background:
Urine cytology remains to be the test of choice in the detection of high-grade urothelial carcinomas (HGUC) due to its favorable sensitivity. However, a significant rate of cases is reported under atypical/indeterminate categories, which result in a decrease in its specificity. Providing standardized cytologic criteria, one of the aims of The Paris System (TPS) is to reduce the use of indeterminate diagnoses and provide a higher predictive value in these categories.

Aims:
We compared the diagnostic performances of TPS and our original reporting system, and also investigated the interobserver reproducibility of the cytologic criteria used.

Materials and Methods:
A total of 386 urine samples were reviewed retrospectively. Original cytologic diagnoses have been made using similar cytologic features proposed by TPS. All slides were recategorized after the use of the cytologic criteria as described by TPS guideline.

Results:
After TPS, specificity of the test increased from 39.6% to 63.5, sensitivity decreased from 92.5% to 88.8%, and diagnostic accuracy increased from 63.6% to 75%. The use of negative category increased threefold. Frequencies of indeterminate categories of atypical urothelial cells (AUC) and suspicious for HGUC (SHGUC) decreased by 36% and 56.5%, respectively. A subsequent detection of HGUC after AUC and SHGUC categories increased by 38% and 64%, respectively. Interobserver agreement for TPS categorization was 39%.

Conclusions:
TPS improved diagnostic accuracy of urine cytology by reducing the use of indeterminate categories, and resulted in increase in their predictive value for subsequent diagnosis of HGUC. However, reproducibility of diagnostic categories seemed to be imperfect.
Powers of Principal Q-Borel ideals
Authors: Camps-Moreno Eduardo , Kohne Craig , Sarmiento Eliseo , Van Tuyl Adam 
Published: August 2021

AbstractFix a poset Q on
$\{x_1,\ldots ,x_n\}$
. A Q-Borel monomial ideal
$I \subseteq \mathbb {K}[x_1,\ldots ,x_n]$
is a monomial ideal whose monomials are closed under the Borel-like moves induced by Q. A monomial ideal I is a principal Q-Borel ideal, denoted
$I=Q(m)$
, if there is a monomial m such that all the minimal generators of I can be obtained via Q-Borel moves from m. In this paper we study powers of principal Q-Borel ideals. Among our results, we show that all powers of
$Q(m)$
agree with their symbolic powers, and that the ideal
$Q(m)$
satisfies the persistence property for associated primes. We also compute the analytic spread of
$Q(m)$
in terms of the poset Q.
NADİR TOPRAK ELEMENTLERİNİN HAYVAN BESLEMEDE KULLANIMI
Authors: Uğur SEVİLMİŞ  
Published: August 2021

Nadir topraklar elementleri doğada birçok minerallerin yapısında bulunur. Günümüzde nadir toprak elementleri (NTE) tıbbi teknolojide, nükleer mühendislikte, otomobil endüstrisinde, askeri cihazlarda ve uzay araçlarında kullanılmaktadır. Ayrıca, bazı sağlık sorunlarının tedavisi için günümüzde NTE içeren ilaçlar kullanılmaktadır. Bu elementlerin gelecekteki potansiyel kullanım alanlarının kanser, osteoporoz, aterosklerozun tedavisi ve önlenmesi ile organ transplantasyonu olacağı öngürülmektedir. Çin'de NTE, on yıllardır yem katkı maddesi ve gübre olarak düşük konsantrasyonlarda başarıyla kullanılmaktadır. Bu ülkedeki çalışmalardan elde edilen sonuçlar, NTE kullanımının çiftlik hayvanlarında canlı ağırlık artışını ve yem dönüşümü oranını iyileştirdiğini göstermektedir. Bu elementlerin etki mekanizması iyi anlaşılmamış olmasına rağmen sindirim kanalında çok az emildiğinden, etkinliklerini bu şekilde geliştirdikleri düşünülmektedir. NTE hayvansal üretimde yeni, güvenli, ucuz bir büyüme destekleyicisi olarak ilgi çekici bir ürün durumundadır. Bu derlemenin amacı, hayvan yemlerinde nadir toprak elementi kullanımı ile ilgili elektronik olarak erişilebilir literatürü analiz etmektir.
Computing the number of h-edge spanning forests in complete bipartite graphs
Authors: Stones Rebecca 
Published: August 2021

Analysis of Algorithms
Let fm,n,h be the number of spanning forests with h edges in the complete bipartite graph Km,n. Kirchhoff\textquoterights Matrix Tree Theorem implies fm,n,m+n-1=mn-1 nm-1 when m &#x2265;1 and n &#x2265;1, since fm,n,m+n-1 is the number of spanning trees in Km,n. In this paper, we give an algorithm for computing fm,n,h for general m,n,h. We implement this algorithm and use it to compute all non-zero fm,n,h when m &#x2264;50 and n &#x2264;50 in under 2 days.
Descents after maxima in compositions
Authors: Blecher Aubrey , Brennan Charlotte , Knopfmacher Arnold 
Published: August 2021

Combinatorics
We consider compositions of n, i.e., sequences of positive integers (or parts) (σi)i=1k where σ1+σ2+...+σk=n. We define a maximum to be any part which is not less than any other part. The variable of interest is the size of the descent immediately following the first and the last maximum. Using generating functions and Mellin transforms, we obtain asymptotic expressions for the average size of these descents. Finally, we show with the use of a simple bijection between the compositions of n for n>1, that on average the descent after the last maximum is greater than the descent after the first.
Congruence successions in compositions
Authors: Mansour Toufik , Shattuck Mark , Wilson Mark 
Published: August 2021

Combinatorics
A composition is a sequence of positive integers, called parts, having a fixed sum. By an m-congruence succession, we will mean a pair of adjacent parts x and y within a composition such that x=y(modm). Here, we consider the problem of counting the compositions of size n according to the number of m-congruence successions, extending recent results concerning successions on subsets and permutations. A general formula is obtained, which reduces in the limiting case to the known generating function formula for the number of Carlitz compositions. Special attention is paid to the case m=2, where further enumerative results may be obtained by means of combinatorial arguments. Finally, an asymptotic estimate is provided for the number of compositions of size n having no m-congruence successions.
Graphs where every k-subset of vertices is an identifying set
Authors: Gravier Sylvain , Janson Svante , Laihonen Tero , Ranto Sanna 
Published: August 2021

Combinatorics
Let $G=(V,E)$ be an undirected graph without loops and multiple edges. A subset $C\subseteq V$ is called \emph{identifying} if for every vertex $x\in V$ the intersection of $C$ and the closed neighbourhood of $x$ is nonempty, and these intersections are different for different vertices $x$. Let $k$ be a positive integer. We will consider graphs where \emph{every} $k$-subset is identifying. We prove that for every $k>1$ the maximal order of such a graph is at most $2k-2.$ Constructions attaining the maximal order are given for infinitely many values of $k.$ The corresponding problem of $k$-subsets identifying any at most $\ell$ vertices is considered as well.
Strong parity vertex coloring of plane graphs
Authors: Kaiser Tomas , Rucky Ondrej , Stehlik Matej , Škrekovski Riste 
Published: August 2021

Graph Theory
A strong parity vertex coloring of a 2-connected plane graph is a coloring of the vertices such that every face is incident with zero or an odd number of vertices of each color. We prove that every 2-connected loopless plane graph has a strong parity vertex coloring with 97 colors. Moreover the coloring we construct is proper. This proves a conjecture of Czap and Jendrol' [Discuss. Math. Graph Theory 29 (2009), pp. 521-543.]. We also provide examples showing that eight colors may be necessary (ten when restricted to proper colorings).
The graph isomorphism problem on geometric graphs
Authors: Uehara Ryuhei 
Published: August 2021

Special issue PRIMA 2013
The graph isomorphism (GI) problem asks whether two given graphs are isomorphic or not. The GI problem is quite basic and simple, however, it\textquoterights time complexity is a long standing open problem. The GI problem is clearly in NP, no polynomial time algorithm is known, and the GI problem is not NP-complete unless the polynomial hierarchy collapses. In this paper, we survey the computational complexity of the problem on some graph classes that have geometric characterizations. Sometimes the GI problem becomes polynomial time solvable when we add some restrictions on some graph classes. The properties of these graph classes on the boundary indicate us the essence of difficulty of the GI problem. We also show that the GI problem is as hard as the problem on general graphs even for grid unit intersection graphs on a torus, that partially solves an open problem.
Nonrepetitive colorings of lexicographic product of graphs
Authors: Keszegh Balázs , Patkós Balázs , Zhu Xuding 
Published: August 2021

Special issue PRIMA 2013
A coloring c of the vertices of a graph G is nonrepetitive if there exists no path v1v2\textellipsisv2l for which c(vi)=c(vl+i) for all 1<=i<=l. Given graphs G and H with |V(H)|=k, the lexicographic product G[H] is the graph obtained by substituting every vertex of G by a copy of H, and every edge of G by a copy of Kk,k. We prove that for a sufficiently long path P, a nonrepetitive coloring of P[Kk] needs at least 3k+&#x230A;k/2&#x230B; colors. If k>2 then we need exactly 2k+1 colors to nonrepetitively color P[Ek], where Ek is the empty graph on k vertices. If we further require that every copy of Ek be rainbow-colored and the path P is sufficiently long, then the smallest number of colors needed for P[Ek] is at least 3k+1 and at most 3k+&#x2308;k/2&#x2309;. Finally, we define fractional nonrepetitive colorings of graphs and consider the connections between this notion and the above results.
Toppling numbers of complete and random graphs
Authors: Bonato Anthony , Kinnersley William B. , Pralat Pawel 
Published: August 2021

Graph Theory
We study a two-person game played on graphs based on the widely studied chip-firing game. Players Max and Min alternately place chips on the vertices of a graph. When a vertex accumulates as many chips as its degree, it fires, sending one chip to each neighbour; this may in turn cause other vertices to fire. The game ends when vertices continue firing forever. Min seeks to minimize the number of chips played during the game, while Max seeks to maximize it. When both players play optimally, the length of the game is the toppling number of a graph G, and is denoted by t(G). By considering strategies for both players and investigating the evolution of the game with differential equations, we provide asymptotic bounds on the toppling number of the complete graph. In particular, we prove that for sufficiently large n 0.596400 n2 < t(Kn) < 0.637152 n2. Using a fractional version of the game, we couple the toppling numbers of complete graphs and the binomial random graph G(n,p). It is shown that for pn ≥n² / √ log(n) asymptotically almost surely t(G(n,p))=(1+o(1)) p t(Kn).
Complexity of conditional colouring with given template
Authors: Dukes Peter J. , Lowdon Steve , Macgillivray Gary 
Published: August 2021

Graph Theory
We study partitions of the vertex set of a given graph into cells that each induce a subgraph in a given family, and for which edges can have ends in different cells only when those cells correspond to adjacent vertices of a fixed template graph H. For triangle-free templates, a general collection of graph families for which the partitioning problem can be solved in polynomial time is described. For templates with a triangle, the problem is in some cases shown to be NP-complete.
An exact algorithm for the generalized list T-coloring problem
Authors: Junosza-Szaniawski Konstanty , Rzazewski Pawel 
Published: August 2021

Discrete Algorithms
The generalized list T-coloring is a common generalization of many graph coloring models, including classical coloring, L(p,q)-labeling, channel assignment and T-coloring. Every vertex from the input graph has a list of permitted labels. Moreover, every edge has a set of forbidden differences. We ask for a labeling of vertices of the input graph with natural numbers, in which every vertex gets a label from its list of permitted labels and the difference of labels of the endpoints of each edge does not belong to the set of forbidden differences of this edge. In this paper we present an exact algorithm solving this problem, running in time O*((τ+2)n), where τ is the maximum forbidden difference over all edges of the input graph and n is the number of its vertices. Moreover, we show how to improve this bound if the input graph has some special structure, e.g. a bounded maximum degree, no big induced stars or a perfect matching.
Biased weak polyform achievement games
Authors: Norris Ian , Sieben Nándor 
Published: August 2021

Combinatorics
In a biased weak (a,b) polyform achievement game, the maker and the breaker alternately mark a,b previously unmarked cells on an infinite board, respectively. The maker's goal is to mark a set of cells congruent to a polyform. The breaker tries to prevent the maker from achieving this goal. A winning maker strategy for the (a,b) game can be built from winning strategies for games involving fewer marks for the maker and the breaker. A new type of breaker strategy called the priority strategy is introduced. The winners are determined for all (a,b) pairs for polyiamonds and polyominoes up to size four.
Genus distributions of cubic series-parallel graphs
Authors: Gross Jonathan L. , Kotrbčík Michal , Sun Timothy 
Published: August 2021

Graph Theory
We derive a quadratic-time algorithm for the genus distribution of any 3-regular, biconnected series-parallel graph, which we extend to any biconnected series-parallel graph of maximum degree at most 3. Since the biconnected components of every graph of treewidth 2 are series-parallel graphs, this yields, by use of bar-amalgamation, a quadratic-time algorithm for every graph of treewidth at most 2 and maximum degree at most 3.
A note on a recent attempt to improve the Pin-Frankl bound
Authors: Gonze François , Jungers Raphaël M. , Trahtman Avraham N. 
Published: August 2021

Automata, Logic and Semantics
We provide a counterexample to a lemma used in a recent tentative improvement of the Pin-Frankl bound for synchronizing automata. This example naturally leads us to formulate an open question, whose answer could fix the line of the proof, and improve the bound.
Output sensitive algorithms for covering many points
Authors: Ghasemalizadeh Hossein , Razzazi Mohammadreza 
Published: August 2021

Discrete Algorithms
In this paper we devise some output sensitive algorithms for a problem where a set of points and a positive integer, m, are given and the goal is to cover a maximal number of these points with m disks. We introduce a parameter, ρ, as the maximum number of points that one disk can cover and we analyse the algorithms based on this parameter. At first, we solve the problem for m=1 in O(nρ) time, which improves the previous O(n2) time algorithm for this problem. Then we solve the problem for m=2 in O(nρ + 3 log ρ) time, which improves the previous O(n3 log n) algorithm for this problem. Our algorithms outperform the previous algorithms because ρ is much smaller than n in many cases. Finally, we extend the algorithm for any value of m and solve the problem in O(mnρ + (mρ)2m - 1 log mρ) time. The previous algorithm for this problem runs in O(n2m - 1 log n) time and our algorithm usually runs faster than the previous algorithm because mρ is smaller than n in many cases. We obtain output sensitive algorithms by confining the areas that we should search for the result. The techniques used in this paper may be applicable in other covering problems to obtain faster algorithms.
Intervals and factors in the Bruhat order
Authors: Tenner Bridget Eileen 
Published: August 2021

Combinatorics
In this paper we study those generic intervals in the Bruhat order of the symmetric group that are isomorphic to the principal order ideal of a permutation w, and consider when the minimum and maximum elements of those intervals are related by a certain property of their reduced words. We show that the property does not hold when w is a decomposable permutation, and that the property always holds when w is the longest permutation.
Root-theoretic Young Diagrams, Schubert Calculus and Adjoint Varieties
Authors: Searles Dominic , Yong Alexander 
Published: August 2021

Root-theoretic Young diagrams are a conceptual framework to discuss existence of a root-system uniform and manifestly non-negative combinatorial rule for Schubert calculus. Our main results use them to obtain formulas for (co)adjoint varieties of classical Lie type. This case is the simplest after the previously solved (co)minuscule family. Yet our formulas possess both uniform and non-uniform features.
Les diagrammes de Young racine-théoriques forment un cadre conceptuel qui permet de discuter l’existence de règles de calcul de Schubert explicitement non-négatives et uniformes sur les systèmes de racines. Notre principal résultat est leur utilisation pour obtenir des formules pour les variétés (co)adjointes de types classiques. C’est le cas le plus simple après celui la famille (co)minuscule, déjà résolue. Nos formules possèdent toutefois des propriétés uniformes et non-uniformes.