A combined tramp ship routing, fleet deployment, and network design problem I. K. Moon, Z. B. Qiu & J. H. Wang a Department of Industrial Engineering, Seoul National University, Seoul 151-744, Korea b LG Electronics Hi Logistics (China) Co., Ltd., No. 9 Wangjing Beilu, Chaoyang District, Beijing 100102, China c Department of Industrial Engineering, Pusan National University, Busan 609-735, Kore...

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

In this article, we study the pseudoscalar bound state η c f0(980) (irrespective of the hadro-charmonium and the molecular state) with the QCD sum rules. Considering the SU(3) symmetry of the light flavor quarks and the heavy quark symmetry, we also study the bound states η cσ(400 − 1200), η b f0(980) and η b σ(400− 1200), and make reasonable predictions for their masses. PACS number: 12.39.Mk,...

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

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

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.

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

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

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 .

Aim Canine lymphoma is one of the most common canine neoplasms, but little is known regarding the effects of exposure to tobacco smoke on their biologic behavior. As cytology is the most frequent diagnostic method of canine lymphoma, the aims of this study were to perform an immunocytochemical study of canine lymphomas, including subtyping and cell proliferation analysis, and to establish their...