similar to: Error TukeyHSD

Hi all, I have a very high dimensional data and apparently there are several columns that contain similar information (some columns are equal). I want to form a matrix/data frame consisting of unique columns. Does anyone have an efficient way of getting out these columns. A small section of the data frame is given below. Thanks for helping. Stephen. > newdata [,1] [,2] [,3] [,4] [,5]

If there are any other users who use AHRQ's SAS code comoanaly2010 and comformat2010 to create comorbidity variables, I thought you might be interested in the following PRELIM code we wrote to mimic its functionality in R. It seems to yield similar results, but may contain errors. Please feel free to comment (kindly) or enhance. I'm sure there are better ways to skin this cat, but we at

Full_Name: José Otero Version: Version 1.5.0 (2002-04-29) OS: Redhat 7.3 Submission from: (NULL) (192.187.16.164) Hi: Installation of package faraway as root, from tarbal: R CMD INSTALL ./faraway.tar.gz ERROR: cannot extract package from './faraway.tar.gz' idem, from zipped package: R CMD INSTALL faraway.zip gzip: faraway.zip has more than one entry--rest ignored ERROR: cannot

Recently, I''ve been reading through the ZIL/slog discussion and have the impression that a lot of folks here are (like me) interested in getting a viable solution for a cheap, fast and reliable ZIL device. I think I can provide such a solution for about $200, but it involves a lot of development work. The basic idea: the main problem when using a HDD as a ZIL device are the cache flushes

This series introduces a generic readahead interface for btrfs trees. The intention is to use it to speed up scrub in a first run, but balance is another hot candidate. In general, every tree walk could be accompanied by a readahead. Deletion of large files comes to mind, where the fetching of the csums takes most of the time. Also the initial build-ups of free-space-caches and

This series introduces a generic readahead interface for btrfs trees. The intention is to use it to speed up scrub in a first run, but balance is another hot candidate. In general, every tree walk could be accompanied by a readahead. Deletion of large files comes to mind, where the fetching of the csums takes most of the time. Also the initial build-ups of free-space-caches and