نتایج جستجو برای: lg
تعداد نتایج: 4846 فیلتر نتایج به سال:
Polymorphism of the b-lactoglobulin (b-LG) gene in 101 cows belonging to the Holstein herd and a superior cow, producing more than 150 Kg milk/day, together with four offsprings was investigated by the Polymerase Chain Reaction-Restriction Fragment Length Polymorphism (PCR-RFLP) method. In the Holstein herd, the alleles A and B of the b-LG gene had frequencies of 0.53 and 0.47, respectively. Th...
Hypercubic sorting networks are a class of comparator networks whose structure maps eeciently to the hypercube and any of its bounded degree variants. Recently, n-input hypercubic sorting networks with depth 2 O(p lg lg n) lg n have been discovered. These networks are the only known sorting networks of depth o(lg 2 n) that are not based on expanders, and their existence raises the question of w...
We define and design succinct indexes for several abstract data types (ADTs). The concept is to design auxiliary data structures that ideally occupy asymptotically less space than the information-theoretic lower bound on the space required to encode the given data, and support an extended set of operations using the basic operators defined in the ADT. The main advantage of succinct indexes as o...
10 technique enables a simple cost-eeective implementation with little eeort. It was used for the rst time to implement a fast optimal parallel hashing algorithm 7]. The hashing algorithm in 7] comprises two parts: the rst part is a randomized geometric decaying algorithm which runs for O(lg lg n) steps. By using the technique of this paper and the O(lg lg n) time load balancing of 6], this par...
We develop a data structure for maintaining a dynamic multiset that uses O(n lg lg n/ lg n) bits and O(1) words, in addition to the space required by the n elements stored, supports searches in O(lg n) worst-case time and updates in O(lg n) amortized time. Compared to earlier data structures, we improve the space requirements from O(n) bits to O(n lg lg n/ lg n) bits, but the running time of up...
to answer challenge of targeted and controlled drug release in oral delivery various materials were studied by different methods. in the present paper, controlled metal based drug (pd(ii) complex) release manner of β‑lactoglobulin (β-lg) nanoparticles was investigated using mathematical drug release model in order to design and production of a new oral drug delivery system for gastrointestinal ...
Lytic granule (LG)-mediated apoptosis is the main mechanism by which CTL kill virus-infected and tumorigenic target cells. CTL form a tight junction with the target cells, which is called the immunological synapse (IS). To avoid unwanted killing of neighboring cells, exocytosis of lytic granules (LG) is tightly controlled and restricted to the IS. In this study, we show that in activated human ...
AIMS Our aim was to evaluate the invasive haemodynamic indices of high-risk symptomatic patients presenting with 'paradoxical' low-flow, low-gradient, severe aortic stenosis (AS) (PLF-LG) and low-flow, low-gradient severe AS (LEF-LG) and to compare clinical outcomes following transcatheter aortic valve implantation (TAVI) among these challenging AS subgroups. METHODS AND RESULTS Of 534 sympto...
Backgrounds. Magnifying endoscopy with narrow-band imaging (NBI-ME) is useful for diagnosing differentiated early gastric cancer (D-EGC). D-EGC is classified as high- or low-grade based on its glandular architectural and cytological atypia. Low-grade, well-differentiated tubular adenocarcinoma (LG-tub1) mixed with high-grade tub1 (HG-tub1) and/or other histological types (M-LG-tub1) may indicat...
We present a new probabilistic sequential algorithm for stable sorting n uniformly distributed keys in an arbitrary range. The algorithm runs in linear time with very-high probability 1 ? 2 ?(n) (the best previously known probability bound has been 1 ? 2 ?(n=(lg n lg lg n))). We also describe an EREW PRAM version of the algorithm that sorts in O((n=p + lg p) lg n= lg (n=p + lg n)) time using p ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید