Risk of adverse outcomes associated with cardiac sarcoidosis diagnostic schemes

BackgroundMultiple cardiac sarcoidosis (CS) diagnostic schemes have been published.ObjectivesThis study aims to evaluate the association of different CS diagnostic schemes with adverse outcomes. The diagnostic schemes evaluated were 1993, 2006, and 2017 Japanese criteria and the 2014 Heart Rhythm Society criteria.MethodsData were collected from the Cardiac Sarcoidosis Consortium, an international registry of CS patients. Outcome events were any of the following: all-cause mortality, left ventricular assist device placement, heart transplantation, and appropriate implantable cardioverter-defibrillator therapy. Logistic regression analysis evaluated the association of outcomes with each CS diagnostic scheme.ResultsA total of 587 subjects met the following criteria: 1993 Japanese (n = 310, 52.8%), 2006 Japanese (n = 312, 53.2%), 2014 Heart Rhythm Society (n = 480, 81.8%), and 2017 Japanese (n = 112, 19.1%). Patients who met the 1993 criteria were more likely to experience an event than patients who did not (n = 109 of 310, 35.2% vs n = 59 of 277, 21.3%; OR: 2.00; 95% CI: 1.38-2.90; P P P = 0.18 or OR: 1.51; 95% CI: 0.97-2.33; P = 0.067, respectively).ConclusionsCS patients who met the 1993 and the 2006 criteria had higher odds of adverse clinical outcomes. Future research is needed to prospectively evaluate existing diagnostic schemes and develop new risk models for this complex disease.Cardiolog

Relation between magnetic and structural anisotropy in the Ni23Se12(PEt3)13 cluster compound

We have measured the magnetic properties of the cluster compound Ni23Se12(PEt3)13, where PEt3 is triethyl phosphine, by dc magnetization (1.5–300 K) and ac susceptibility (0.280–4 K). We observe a small, almost temperature-independent, magnetic moment of only ~2μB/cluster indicating the presence of two unpaired spins in the cluster. Despite the large shape anisotropy of the molecule, we find no preferred magnetic axis. We interpret this as the result of delocalization of the valence electrons due to covalent Ni-Se bonding.

Dilation-optimal edge deletion in polygonal cycles

Consider a geometric network G in the plane. The dilation between any two vertices x and y in G is the ratio of the shortest path distance between x and y in G to the Euclidean distance between them. The maximum dilation over all pair of vertices in G is called the dilation of G. In this paper, a randomized algorithm is presented which, when given a polygonal cycle C on n vertices in the plane, computes in O(n log 3 n) expected time, the edge of C whose removal results in a polygonal path of smallest possible dilation. It is also shown that the edge whose removal gives a polygonal path of largest possible dilation can be computed in O(n log n) time. If C is a convex polygon, the running time for the latter problem becomes O(n). Finally, it is shown that a (1 − ǫ)-approximation to the dilation of all the path C \ {e}, for all edge e of C, can be computed in O(n log n) total time.

A New Intersection Model and Improved Algorithms for Tolerance Graphs

Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This class of graphs, which generalizes in a natural way both interval and permutation graphs, has attracted many research efforts since their introduction in [M. C. Golumbic and C. L. Monma, Congr. Numer., 35 (1982), pp. 321–331], as it finds many important applications in constraint-based temporal reasoning, resource allocation, and scheduling problems, among others. In this article we propose the first non-trivial intersection model for general tolerance graphs, given by three-dimensional parallelepipeds, which extends the widely known intersection model of parallelograms in the plane that characterizes the class of bounded tolerance graphs. Apart from being important on its own, this new representation also enables us to improve the time complexity of three problems on tolerance graphs. Namely, we present optimal O(n log n) algorithms for computing a minimum coloring and a maximum clique and an O(n2) algorithm for computing a maximum weight independent set in a tolerance graph with n vertices, thus improving the best known running times O(n2) and O(n3) for these problems, respectively

Arrhythmia Monitoring and Outcomes in Patients With Cardiac Sarcoidosis: Insights From the Cardiac Sarcoidosis Consortium

Cardiolog