نتایج جستجو برای: موج lg

تعداد نتایج: 14852  

2015
Ho-Kyung Ha Jin Wook Kim Mee-Ryung Lee Woojin Jun Won-Jae Lee

It is necessary to understand the cellular uptake and cytotoxicity of food-grade delivery systems, such as β-lactoglobulin (β-lg) nanoparticles, for the application of bioactive compounds to functional foods. The objectives of this study were to investigate the relationships between the physicochemical properties of β-lg nanoparticles, such as particle size and zeta-potential value, and their c...

Journal: :Surgery 2011
Kazutaka Obama Hiroshi Okabe Hisahiro Hosogi Eiji Tanaka Atsushi Itami Yoshiharu Sakai

BACKGROUND There is little evidence for the technical feasibility of laparoscopic gastrectomy (LG) with peripancreatic lymphadenectomy in terms of postoperative complications. To evaluate the technical feasibility of LG with radical lymphadenectomy, we focused on pancreas-related complications in LG and open gastrectomy (OG), and then investigated whether such complications increased in LG. M...

Journal: :Behavioral neuroscience 2014
Pauline Pan Alison S Fleming Daeria Lawson Jennifer M Jenkins Patrick O McGowan

Rat dams show natural variations in maternal care, licking and grooming (LG), that are associated with distinct behavioral and neural phenotypes in offspring. However, there has been limited research on the effects of differences in LG received by female pups and of variations in maternal care within the litter. Here, we investigated LG received by measuring active maternal care after pup retri...

2011
Meng He J. Ian Munro Gelin Zhou

We consider the problem of supporting several different path queries over a tree on n nodes, each having a weight drawn from a set of σ distinct values, where σ ≤ n. One query we support is the path median query, which asks for the median weight on a path between two given nodes. For this and the more general path selection query, we present a linear space data structure that answers queries in...

Journal: :SIAM J. Comput. 2013
Gonzalo Navarro Yakov Nekrich

We describe a data structure that supports access, rank and select queries, as well as symbol insertions and deletions, on a string S[1, n] over alphabet [1..σ] in time O(lgn/ lg lgn), which is optimal. The time is worst-case for the queries and amortized for the updates. This complexity is better than the best previous ones by a Θ(1 + lg σ/ lg lgn) factor. Our structure uses nH0(S) + O(n + σ(l...

2017
Liangliang Zhang Indra Dev Sahu Man Xu Yongmei Wang Xinyu Hu

This data article contains complementary results related to the paper "Effect of metal ions on the binding reaction of (-)-epigallocatechin gallate to β-lactoglobulin" (Zhang et al., 2017) [1]. Data was obtained by circular dichroism (CD) spectroscopy to investigate potential β-lactoglobulin (β-Lg) conformational changes with different concentrations of EGCg and Cu2+ or Al3+ added to β-Lg. 500 ...

1994
C. Greg Plaxton Torsten Suel

We prove an (lg 2 n= lg lg n) lower bound for the depth of n-input sorting networks based on the shuue permutation. The best previously known lower bound was the trivial (lg n) bound, while the best upper bound is given by Batcher's (lg 2 n)-depth bitonic sorting network. The proof technique employed in the lower bound argument may be of independent interest.

Journal: :Advances in Mathematics 2022

The goal of this work is to construct a perverse t-structure on the ∞-category ℓ-adic LG-equivariant sheaves loop Lie algebra Lg and show that affine Grothendieck–Springer sheaf S perverse. Moreover, an intermediate extension its restriction locus “compact” elements with regular semi-simple reduction. Note classical methods do not apply in our situation because LG are infinite-dimensional ind-s...

2014
Gerth Stølting Brodal Kasper Green Larsen

The skyline of a set of points in the plane is the subset of maximal points, where a point (x, y) is maximal if no other point (x′, y′) satisfies x′ ≥ x and y′ ≥ x. We consider the problem of preprocessing a set P of n points into a space efficient static data structure supporting orthogonal skyline counting queries, i.e. given a query rectangle R to report the size of the skyline of P ∩ R. We ...

2007
Sergei N. Bespamyatnikh

We give an algorithm to nd a minimum spanning tree in the k-dimensional space under rectilinear metric. The running time is O(8 k p k n(lg n) k?2 lg lg n) for k 3. This improves the previous bound by a factor p k lg 2 n=4 k .

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید