search for: laborious

...trying to read a bunch of csv files using read.table() that are named "test_xxxxxx.csv" where "xxxxxx" has no particular pattern. Is there a way of reading all the files by specifying a truncated file name e.g. "test_" with some wild card characters, or would I have to laboriously create some vector with the "xxxxxx" names and iterate or lapply() over it? Kind regards Chibisi [[alternative HTML version deleted]]

Hi, I am a graduate student at Oregon State University pursuing my Masters degree in Computer Science. I am interested in conducting research on the bug reports in many open source projects. I would like to study how the projects manage their bug reports and identifying how Bugzilla and similar bug repository systems could be improved to facilitate this process. I have a bunch of Perl scripts

Apologies for this simple question - Given the number of comparisons I need to do it has become somewhat laborious to compute the SSE manually. I first have to extract the coefficients, build the model and run the model on the data. So far I haven't found any method in R that will do this for me. Is there a method that I haven't seen, or is there a small function I could write that would do this, and ho...

Dear all, I wrote a wrapper to a FORTRAN program using R. The main program uses a text file (~200 lines) as an input describing the simulation to be run. I typically generate the file once with the right parameters using a combination of file(), paste(), cat(). This is fine, and it works well, however I then need to update only a few values in the file many times (~200 times,

...20 70-79 19 80-89 12 90-99 2 Or the other way around with transpose. classes = c("40-49", "50-59", "60-69", "70-79", "80-89", "90-99") For the rownames sum(zz$x9 > 40 & zz$x9 < 50) For getting frequency counts is very laborious... I got this far: > table(cut(zz$x9, brk)) (40,50] (50,60] (60,70] (70,80] (80,90] (90,100] 2 19 21 19 8 1 > brk [1] 40 50 60 70 80 90 100 > > t(table(cut(zz$x9, brk))) (40,50] (50,60] (60,70] (70,80] (80,90] (90,100] [1,] 2...

...column 2 and calculate the row wise mean of the remaining columns which includes column 1 too and then subtracting these values from the column i left out i.e. col=2.and then continuing this process the last column. i know a kind of "manual way" of doing things but its extremely long and laborious.Is there any loop command or shorter way?? thanks in advanceregardseliza [[alternative HTML version deleted]]

Hi, I would like to use a weighted lm model to reduce heteroscendasticity. I am wondering if the only way to generate the weights in R is through the laborious process of trial and error by hand. Does anyone know if R has a function that would automatically generate the weights need for lm? Thanks, -- Tom [[alternative HTML version deleted]]

...pace. This is particularly important because I cannot cycle to the graphics device window that is opened when I call a new plot. If I force quit the X11 window and Rcommander, R remains running and I can see the graphics device window and the plot looks fine. But as you can imagine, this is quite laborious, having to restart. I've looked through the help documentation and tried reinstalling tcltk prior to opening up Rcommander, but that does not address the problem. Any thoughts? Yours, Simon Kiss ********************************* Simon J. Kiss, PhD Assistant Professor, Wilfrid Laurier University...

...laz at PARAVIS.LOCAL <mailto:laz at PARAVIS.LOCAL> and my email address would be laz at paravis.net <mailto:laz at paravis.net>. All of this works just fine. But what I want to do is allow the users to log in using their email address and not their full Kerberos name. It is becoming laborious to help the users understand the difference between their username at LOCAL.REALM and username at email.address <mailto:username at email.address> and why we have to have two separate identities that mean the same thing. I have the SQL statements to convert either the Kerberos login or the e...

...ow there are values in between these end points. Hence a2 doesn't include the indices of the values in-between the end points. I have looked at cut, but it doesn't quite behave the way I want since if I set x1 <- c(2:4) I get more intervals than I really want and cleaning it up will be laborious. I think I can construct the full set of indices I want with a2[1]:a2[2] but is there a more clever way to do this? I'm thinking there might be a function out there that I am not aware of. TIA, Bryan ************* Bryan Hanson Acting Chair Professor of Chemistry & Biochemistry DePauw Uni...

....36 for more than a week and I did not see any of such hangs upto now. The machine seems table with 2.6.36. So I think its really an regression of 2.6.37. I am stuck with what to try next. Since trying to track it down to a specific commit appears too involved for me and its appears also quite laborious to get any value debug information out of the kernel - cause it can take days for the bug to appear -, I am inclined to either test with 2.6.37.1 once its available or just give it a go with 2.6.38-rc3 or rc4. Maybe 2.6.38-rc3/4 would be the best bet, I have seen a report on the btrfs mailing l...

...nMP Validation Suite from OpenUH Research Compiler, SPEC OMP2012 and internal Intel test suites). Performance-wise, it demonstrates similar gains and scalability as other compilers with OpenMP support. (Sorry, I can’t be more specific here, as properly reporting performance results is a precise and laborious process. You are welcome to try clang compiler with OpenMP support on your own OpenMP programs, awe performance gains and share excitement with the community. :-)) The project was started by Mahesha HS (then at AMD), who created initial patch. After that, it was carried out by several Intel engine...

...pley about this last 12 Jun 2007. This suggests that I may have accidentally entered some possibly non-printing character into the offending Rd file. The message tells me which file, but I don't know which lines in the file. Is there some way of finding the offending character(s) without laboriously running R CMD check after deleting different portions of the file until I isolate the problem? Thanks, Spencer Graves

...s. When I do: mod$fitted.values I get a number of fitted values corresponding to the umber of unique lines in the dataset. Is there a way to have the fitted values match the observation, even though some are duplicated and so have the same fitted value? I could do it by hand but it's laborious and I'd venture there is a better way. Best, Federico -- Federico C. F. Calboli Department of Epidemiology and Public Health Imperial College, St. Mary's Campus Norfolk Place, London W2 1PG Tel +44 (0)20 75941602 Fax +44 (0)20 75943193 f.calboli [.a.t] imperial.ac.uk f.calboli [.a.t...

I have a very long list of strings. Each string actually contains multiple values separated by a semi-colon. I need to turn each string into a vector of the values delimited by the semi-colons. I know I can do this very laboriously by using loops, nchar, and substr, but it is terribly slow. Is there a basic R function that handles this situation? If not, is there perhaps a faster way to do it than I currently am, which is to lapply the following function? Thanks, Mark #######################################################...

...random variable. However, I keep getting the following error: Error in JohnsonFit(x) : Unbounded solution intermediate values out of range When I run the fit individually by group ID, it works fine. However I do not want to do that manually as there are a large number of groups that would be too laborious to do so. If possible, could you shed some light on this error? Thanks! -- Regards, Shiner Yang B. Sc Statistics & Economics, Commerce Minor | UBC Co-President, Science Co-op Students Association [[alternative HTML version deleted]]

...red symbol in the text. So what I want to do is to get R to create some high quality picture files of the symbols with the colours I tell it to. Does anyone have an idea about the best way to go about this? I created a graph of the symbols and tried to use photoshop to cut them out, but it's laborious and the quality is not the best. I just want small sharp symbols. Thanks Gareth Campbell PhD Candidate The University of Auckland P +649 815 3670 M +6421 256 3511 E gareth.campbell@esr.cri.nz gcam032@gmail.com [[alternative HTML version deleted]]

...hybrid includes a 3 cycle readydelay (seems arbitrary) whereas the ilp version readies all instructions once data dependencies are resolved. Additionally, the ilp_ls_rr_sort::operator() just calls BURRSort at the end after applying a bunch of heuristics to the queue beforehand. Reading it is quite laborious (very few comments) and was wondering if anyone had any references to what exactly it is doing and why it is doing it in such order. I'm focused right now on understanding the behavior of the two schedulers. If anyone could give me some direction (papers, slides) that would be greatly apprecia...

...> <b>Some Text</b><br /> <b>Some More Text</b><br /> <b>Some More Text</b><br /> <b>Some More Text</b> <%= render :partial => "_end_box" %> Then use some CSS to purdy it up. This does seem to be a bit laborious when it seems partials are so flexible. Should I be using partials for this type of widget? Is their some way to accomplish this via a single partial instead of a partial for the first part of the table and a partial for the end part of the table? Thanks swoolley-a1UlTwdHLosxpvK4C0GaPQ@public.gma...

...it did before. In addition, the scaling constant affects the value of the optimal parameters and the converging value of the NLL (evidently). So to be able to compare the parameters between different data sets I need to use the same scaling constant. Trying out all values between 0.1 and 1 is very laborious and is not quite a systematic approach. My question is: Are there any rules of thumb to choose a scaling constant? And how do I justify it's application (it looks a bit like a "magic constant" that tricks the algo to converge, but does not have a systematic justification)? I...