The use of nanotechnology and nanomaterials in medical research is growing. Silver-containing nanoparticles have previously demonstrated antimicrobial efficacy against bacteria and viral particles. This preliminary study utilized an in vitro approach to evaluate the ability of silver-based nanoparticles to inhibit infectivity of the biological select agent, monkeypox virus (MPV). Nanoparticles ...

We consider the two-dimensional sorted range reporting problem. Our data structure requires O(n lg lgn) words of space and O(lg lg n+ k lg lg n) query time, where k is the number of points in the query range. This data structure improves a recent result of Nekrich and Navarro [8] by a factor of O(lg lgn) in query time, and matches the state of the art for unsorted range reporting [1].

Using a sensitive flow-cytometer-based method of detecting small numbers of morphologically normal monoclonal B lymphocytes, we have investigated the presence and quantity of these cells in the blood of 12 patients with Waldenstrom's macroglobulinemia. All 12 patients, including 6 at the time of asymptomatic presentation, had such circulating monoclonal cells. By comparison, 2 of 7 patients wit...

Fourier transform infrared spectroscopy (FTIR) and differential scanning calorimetry (DSC) were used to monitor changes in the secondary structure and thermal stability of beta-lactoglobulin A and B in the presence of sodium dodecyl sulphate (SDS), N-ethylmaleimide (NEM), urea and cysteine. An increase in the thermal stabilities of both proteins was noted in the presence of 10 mM-SDS. In the pr...

The partial characterization of the structure of the lipoglycan (LG) from Acholeplasma axanthum is added to the previous complete structural analysis of the lipoglycan from A. granularum. The terminal sequence of A. axanthum LG is Glcp(beta 1----2)-Glcp(beta 1----2)-Glcp(beta 1----6)-; of A. granularum Glcp(beta 1----2)-Glcp(alpha 1----4)-Glcp(beta 1----4)-. These specific residues define the m...

This paper presents several deterministic algorithms for selecting the kth largest record from a set of n records on any n-node hypercubic network. All of the algorithms are based on the selection algorithm of Cole and Yap, as well as on various sorting algorithms for hypercubic networks. Our fastest algorithm runs in O(lg n lg n) time, very nearly matching the trivial (lg n) lower bound. Previ...

We derive the simplest form of the κ(κ) order graviton self-interaction Lagrangian density Lg(Lg) in the weak field approximation. With the divergenceless condition, de Donder gauge and some combinatoric techniques, we derive the mathematically independent basis expressions for Lg(Lg) composed of 8(24) terms. By using the basis expressions Lg(Lg) is reduced to 6(18) terms. [email protected]...

We introduce a probabilistic sequential algorithm for stable sorting n uniformly distributed keys in an arbitrary range. The algorithm runs in linear time and sorts all but a very small fraction 2−Ω(n) of the input sequences; the best previously known bound was 2−Ω(n/(lg n lg lgn)). An EREW PRAM extension of this sequential algorithm sorts in O((n/p + lg p) lg n/ lg (n/p + lg n)) time using p ≤...

The rank and select operations over a string of length n from an alphabet of size σ have been used widely in the design of succinct data structures. In many applications, the string itself must be maintained dynamically, allowing characters of the string to be inserted and deleted. Under the word RAM model with word size w = Ω(lg n), we design a succinct representation of dynamic strings using ...

Consider a tree T on n nodes, each having a weight drawn from [1..σ]. In this paper, we design succinct data structures to encode T using nH(WT ) + o(n lg σ) bits of space, such that we can support path counting queries in O( lg σ lg lgn + 1) time, path reporting queries in O((occ+1)( lg σ lg lgn +1)) time, and path median and path selection queries in O( lg σ lg lg σ ) time, where H(WT ) is th...