Murray W. Huff, Dawn E. Telford, Jane Y. Edwards, John R. Burnett, P. Hugh R. Barrett, Cholesterol and ApoB by Enhanced Plasma Clearance of LDL ApoB Inhibition of the Apical Sodium-Dependent Bile Acid Transporter Reduces LDL Print ISSN: 1079-5642. Online ISSN: 1524-4636 Copyright © 2002 American Heart Association, Inc. All rights reserved. Greenville Avenue, Dallas, TX 75231 is published by the...

A convex repeated game is a two players game that is performed in a sequence of consecutive rounds. On round t of the repeated game, the first player chooses a vector wt from a convex set A. Next, the second player responds with a convex function gt : A → R. Finally, the first player suffers an instantaneous loss gt(wt). We study the game from the viewpoint of the first player. In offline conve...

We study the Online Budgeted Maximum Coverage (OBMC) problem. Subsets of a weighted ground set U arrive one by one, where each set has a cost. The online algorithm has to select a collection of sets, under the constraint that their cost is at most a given budget. Upon arrival of a set the algorithm must decide whether to accept or to reject the arriving set, and it may also drop previously acce...

2011;139;1203-1209; Prepublished online October 21, 2010; Chest Young, William A. Gahl, Joel Moss and Bernadette R. Gochuico Wilson, Hai Ping Wu, Mary Haughey, Nathan R. Peterson, Neal S. Souheil El-Chemaly, Shira G. Ziegler, Rodrigo T. Calado, Kirkland A. Mutation Subjects With the Same Telomerase Natural History of Pulmonary Fibrosis in Two http://chestjournal.chestpubs.org/content/139/5/1203...

This paper revisits the online PCA problem. Given a stream of n vectors xt ∈ R (columns of X) the algorithm must output yt ∈ R (columns of Y ) before receiving xt+1. The goal of online PCA is to simultaneously minimize the target dimension ` and the error ‖X − (XY +)Y ‖. We describe two simple and deterministic algorithms. The first, receives a parameter ∆ and guarantees that ‖X − (XY +)Y ‖ is ...

In the online bipartite matching problem, vertices in one partition are given up front and vertices in the other partition arrive sequentially. When a vertex arrives, it reveals its neighboring edges and it must be immediately matched or left unmatched. We determine asymptotic matching sizes given by a variety of greedy online matching algorithms on random graphs. On G(n, n, p), we show that an...

It is shown that for a metric space (M,d) the following are equivalent: (i) M is a complete R-tree; (ii) M is hyperconvex and has unique metric segments.

We present a new spatial index belonging to R-tree family. Since our new index comes out from the R-tree and holds the concept of nonoverlapping nodes we call it R-tree. The original R-tree was designed for both point and spatial data. Using R-tree for indexing spatial data is very inefficient. In our research we face the problem of indexing product catalogues data that can be represented as po...

R-tree based access methods for moving objects are hardly applicable in practice, due mainly to excessive space requirements and high management costs. To overcome the limitations of such R-tree based access methods, we propose a new index structure called AIM (Adaptive cell-based Index for Moving objects). The AIM is a cell-based multiversion access structure adopting an overlapping technique....