OBJECTIVE It is still controversial whether sirolimus-eluting stent (SES) and paclitaxel-eluting stent (PES) are equally effective in patients with diabetes. In these patients, multiple individual variables may be responsible for neointimal hyperplasia, thus making difficult the comparison of the two drug-eluting stents (DES). RESEARCH DESIGN AND METHODS We designed a prospective, randomized ...

6 The LLL algorithm has received a lot of attention as an effective numerical tool for preconditioning 7 an integer least squares problem. However, the workings of the algorithm are not well understood. In this 8 paper, we present a new way to look at the LLL reduction, which leads to a new implementation method 9 that performs better than the original LLL scheme. 10 © 2007 Published by Elsevie...

The LLL algorithm, named after its inventors, Lenstra, Lenstra and Lovász, is one of themost popular lattice reduction algorithms in the literature. In this paper, we propose the first variant of LLL algorithm that is dedicated for ideal lattices, namely, the iLLL algorithm. Our iLLL algorithm takes advantage of the fact that within LLL procedures, previously reduced vectors can be re-used for ...

OBJECTIVE The aim of this study was to estimate the efficacy of an intensive CDP program, as well as to identify the predictors associated with lymphedema severity and response to CDP in lower limb lymphedema (LLL) after pelvic cancer therapy. METHODS We performed a retrospective review of post-pelvic cancer LLL patients that were treated with a CDP program between January 2004 and March 2011...

This study compares the clearing and metabolism of three different lipid emulsions. They had the same phospholipid emulsifier and similar particle sizes. In one (LLL) the core component was long-chain triglycerides (TG), the second (MMM/LLL) contained equal molar amounts of medium- and long-chain TG, the third (MLM) contained synthetic TG with medium-chain (M) fatty acids in the 1,3-positions a...

No efficient algorithm is known to find the shortest vector in a lattice (in arbitrary dimension), or even just computing its length λ1. A central tool in the algorithmic study of lattices (and their applications) is the LLL algorithm of Lenstra, Lenstra and Lovasz. The LLL algorithm runs in polynomial time and finds an approximate solution x to the shortest vector problem, in the sense that th...

Reduction can be important to aid quickly attaining the integer least squares (ILS) estimate from noisy data. We present an improved Lenstra-Lenstra-Lovasz (LLL) algorithm with fixed complexity by extending a parallel reduction method for positive definite quadratic forms to lattice vectors. We propose the minimum angle of a reduced basis as an alternative quality measure of orthogonality, whic...

This article provides the background and concept of Thailand Lifelong Learning [LLL], even attempting a definition. The Thai LLL vision encompasses strategies for developing human qualities such as integrity, self-reliance, adaptability, resilience, and spirituality, to name a few. In some regards LLL seeks to recapture a more fully-developed perspective, on what in earlier times and places [12...

Lifelong language learning (LLL) aims at new tasks and retaining old in the field of NLP. LAMOL is a recent LLL framework following data-free constraints. Previous works have been researched based on with additional computing more time costs or parameters. However, they still gap between multi-task (MTL), which regarded as upper bound LLL. In this paper, we propose Metacognitive Adaptation (Met...

Lattice reduction is fundamental in computational number theory and in computer science, especially in cryptography. The celebrated Lenstra–Lenstra–Lovász reduction algorithm (called LLL or L) has been improved in many ways through the past decades and remains one of the central tool for reducing lattice basis. In particular, its floating-point variants — where the long-integer arithmetic requi...