BACKGROUND The optimal monitoring schedules and cutoff minimal residual disease (MRD) levels for the accurate prediction of relapse at all time points after allogeneic hematopoietic stem cell transplantation (allo-HSCT) remain unclear in patients with t(8;21) acute myeloid leukemia (AML). METHODS RUNX1-RUNX1T1 transcript levels were measured in bone marrow samples collected from 208 patients ...

This report shows the therapeutic benefit of HEP1 (human ezrin peptide 324-337; TEKKRRETVEREKE) monotherapy of hepatitis C virus (HCV) infection in HIV infected patients in two clinical studies. In the Pilot Study I, 16 of 18 patients responded well to the treatment with significant reductions of HCV viral load and a normalization of serum liver enzymes. In 8 of 18 patients, HCV RNA became unde...

This article describes about the difference of resolution structure and size between HornSAT and CNFSAT. We can compute HornSAT by using clauses causality. Therefore we can compute proof diagram by using Log space reduction. But we must compute CNFSAT by using clauses correlation. Therefore we cannot compute proof diagram by using Log space reduction, and reduction of CNFSAT is not P-Complete.

Human noroviruses (NoVs) are a significant cause of nonbacterial gastroenteritis worldwide, with contaminated drinking water a potential transmission route. The absence of a cell culture infectivity model for NoV necessitates the use of molecular methods and/or viral surrogate models amenable to cell culture to predict NoV inactivation. The NoV surrogates murine NoV (MNV), feline calicivirus (F...

Building on a result of Larose and Tesson for constraint satisfaction problems (CSPs), we uncover a dichotomy for the quantified constraint satisfaction problem QCSP(B), where B is a finite structure that is a core. Specifically, such problems are either in ALogtime or are L-hard. This involves demonstrating that if CSP(B) is first-order expressible, and B is a core, then QCSP(B) is in ALogtime...

In this paper we tackle the problem of character conversion from simplified Chinese to traditional Chinese. Of those simplified characters that need conversion, about 9.5% of them have more than 2 counterparts in the traditional scripts. We improve upon the previous log-linear approach first used in (Chen et al 2011) by utilizing more data sets and better translation models. We also show that a...

This paper is focused on algorithmic issues for biometric face verification (i.e., given an image of the face and an identity claim, decide whether they correspond to each other or not). Several alternatives for geometric normalization of images, photometric normalization, dimensionality reduction and similarity measures are proposed and compared using the XM2VTS database and the associated Lau...

A novel cross term deleted Wigner representation can be obtained by expanding the Wigner Distribution (WD) in terms of two complementary Gabor coe cients of the signal and a translated set of Wigner basis functions. Two such complementary Gabor coe cients of a signal can be obtained by reversing the role of Gabor synthesis window h(t) and its biorthogonal function b(t). Such a representation is...

In this paper we show that for the purposes of dimensionality reduction certain class of structured random matrices behave similarly to random Gaussian matrices. This class includes several matrices for which matrix-vector multiply can be computed in log-linear time, providing efficient dimensionality reduction of general sets. In particular, we show that using such matrices any set from high d...

We characterize the complexity of SAT instances with path-decompositions of width w(n). Although pathwidth is the most restrictive among the studied width-parameterizations of SAT, the most time-efficient algorithms known for such SAT instances run in time 2, even when the path-decomposition is given in the input. We wish to better understand the decision complexity of SAT instances of width ω(...