A 63-year-old male presents with chronic cough and hemoptysis. Computed tomography of the chest revealed a left lower lobe (LLL) area of consolidation with prominent ipsilateral hilar lymphadenopathy. Bronchoscopic airway examination revealed black mucosal discoloration and airway narrowing at the superior segment of the LLL. Bronchoalveolar lavage from the corresponding site grew mycobacterial...

We report a rare case of granular cell tumor arising in the left lower lobe (LLL) bronchus with secondary obstructive change in a 60-year-old male. The patient was found to have a nodule in the LLL on a computed tomography scan, three months prior to his presentation to the Asan Medical Center. Bronchoscopic biopsies revealed a granular cell tumor. After undergoing LLL lobectomy with bronchopla...

A tight criterion under which the abstract version Lovász Local Lemma (abstract-LLL) holds was given by Shearer [43] decades ago. However, little is known about that of the variable version LLL (variable-LLL) where events are generated by independent random variables, though this model of events is applicable to almost all applications of LLL. We introduce a necessary and sufficient criterion f...

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...

Recently, a new lattice basis reduction notion, called diagonal reduction, was proposed for lattice-reduction-aided detection (LRAD) of multiinput multioutput (MIMO) systems. In this paper, we improve the efficiency of the diagonal reduction algorithm by employing the fast Givens transformations. The technique of the fast Givens is applicable to a family of LLL-type lattice reduction methods to...

We present a comprehensive complexity analysis of an e cient algorithm for polynomial factorization in Z[x]. ? Supported by NSF 0728853 Complexity of Factoring A. Novocin, M. van Hoeij, W. Hart 1 This document is a work in progress. The central problem we address is the factorization of a square-free and monic polynomial in Z[x]. Forgoing for the moment any introduction to the method or explana...

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 ...

The characteristics of active fault movements are essential for estimating the earthquake potential on Tibetan Plateau (TP) in a complex geological setting. 2022 Menyuan Mw6.7 was studied by joint seismological and geodetic methodology to deepen scientific understanding source parameters deformation mechanisms. Firstly, entire InSAR co-seismic field is obtained based ascending descending Sentin...