IntroductionVenous thromboembolism (VTE) management increasingly involves anticoagulation with direct oral anticoagulants (DOACs). Few studies have used competing-risks analyses to ascertain the mortality-adjusted hemorrhage and recurrent VTE (rVTE) risk of individual DOACs. Furthermore, factors in patients treated apixaban remain underexplored.Materials methodsPatients diagnosed receiving were...

Introduction Patients with atrial fibrillation experience an irregular heart rate and have increased risk of stroke; prophylactic treatment anticoagulation medication reduces this risk. Direct-acting oral anticoagulants (DOACs) been approved providing alternative to vitamin K antagonists such as warfarin. There is interest from regulatory bodies on the effectiveness medications in routine clini...

Supply chain security (SCS) incidents increasingly cause financial losses to manufacturing facilities and logistics service providers. Thus, supply certification can have implications for production economics, particularly importing firms who rely on a smooth flow across country borders. However, it largely remains unknown regarding how such could influence firm's operational performance. To th...

Given a graph G where a label is associated with each edge, we address the problem of looking for a maximum matching of G using the minimum number of different labels, namely the Labeled Maximum Matching Problem. It is a relatively new problem whose application is related to the timetabling problem [15]. We prove it is NP-complete and present four different mathematical formulations. Moreover, ...

Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-dimensional matching problem asks whether there is a disjoint collection of the hyperedges which covers all vertices. We show it can be solved by a randomized polynomial space algorithm in time O(2). The O∗() notation hides factors polynomial in n and k. W...

For a graph G=(V,E), finding set of disjoint edges that do not share any vertices is called matching problem, and the maximum fundamental problem in theory distributed algorithms. Although local algorithms for approximate have been widely studied, exact has much studied. In fact, no algorithm faster than trivial upper bound O(n^2) rounds known general instance. this paper, we propose randomized...