This paper presents a novel matching-adjusted approach to indirectly compare survival estimates for competitive treatment options. Using patient-level data for the treatment arm and summary patient characteristics and survival outcomes for the comparator, matching variables prognostic for survival are chosen. A program involving an extension of a common SAS® 9.2 procedure, PROC SURVEYSELECT, is...

Now-a-days identification of fingerprint is an active area of research. In most areas we are using recognition of fingerprint for improving the privacy and security. The recognition is done by using methods of fingerprint matching. Matching methods can be of two types-verification of fingerprint and identification of fingerprint. Combination of fingerprint for protecting privacy is a system for...

Abstract We apply the Darmois and $C^3$ matching conditions to three different spherically symmetric spacetimes. The exterior spacetime is described by Schwarzschild vacuum solution whereas for interior counterpart we choose perfect fluid solutions with same symmetry. show that are satisfied in all cases not fulfilled. argue this difference due a non-physical behavior of pressure on surface.

Introduction: ZANU is a Bruton tyrosine kinase inhibitor (BTKi) that has been evaluated for the treatment of R/R MZL in two phase 2, single-arm trials (MAGNOLIA, n = 66, NCT03846427; BGB-3111-AU-003, 20, NCT02343120). At 28 and 35 months study follow-up MAGNOLIA respectively, median progression-free survival (PFS) overall (OS) were not reached. IBRU, first-generation BTKi, also trial (PCYC-1121...

Let $G=(V,E)$ be a simple connected graph. A matching $M$ in a graph $G$ is a collection of edges of $G$ such that no two edges from $M$ share a vertex. A matching $M$ is maximal if it cannot be extended to a larger matching in $G$. The cardinality of any smallest maximal matching in $G$ is the saturation number of $G$ and is denoted by $s(G)$. In this paper we study the saturation numbe...