search for: conducive

I'm trying to write a function to find the means over factors of the responses in a mlm (something I would do easily in SAS with PROC SUMMARY). The not-working stub of a function to do what I want is below, and my problem is that I don't know how to call aggregate (or some other function) in the context of terms in a linear model extracted from a lm/mlm object. means.mlm <-

Package: logcheck Version: 1.2.54 Followup-For: Bug #330220 root at ns2:/# ls -l /var/lock/ total 4 drwxr-xr-x 2 root root 4096 2007-01-30 15:40 logcheck I think chmod 775 on that file would fix this problem... -- System Information: Debian Release: 4.0 APT prefers testing APT policy: (500, 'testing'), (500, 'stable') Architecture: amd64 (x86_64) Shell: /bin/sh linked

...few changes regarding register allocation. I am wondering will there be support for radically different data structures other than the LiveIntervals, Virtual Register Map, etc? I have build a custom data structure which has it's own intermediate representation like live-intervals, but much more conducive for my allocation algorithm. I do not know if LiveIntervals can accurately describe my data structure, and it would be a huge hack to enforce the live interval framework. - Thanks, Jeff Kunkel

I'm trying to extend some work in the car and heplots packages that requires getting a table of multivariate means for one (or later, more) terms in an mlm object. I can do this for concrete examples, using aggregate(), but can't figure out how to generalize it. I want to return a result that has the factor-level combinations as rownames, and the means as the body of the table

.../docs/hlvm/ to get an index of the documentation that is available. but unfortunately that URL yields a 404. While I could check the docs out of subversion myself (assuming they're actually there, which I haven't verified), putting the docs online for easy access would be much more conducive to attracting users and or developers to HLVM. Eric

...age project of mine, LLVM looks promising, but I'd like to clear a few things up first: 1. What relation does LLVM bear with GCC; why would somebody use LLVM for a compiler back-end over GCC (aside from the Virtual Machine)? How do the goals of GCC and LLVM differ as compiler toolkits? 2. How conducive to Incremental Compilation is LLVM? I would like to be able to compile and execute code in the same process immediately. An example of this would be in an interactive programming environment, or a Common Lisp style of compilation. 3. Is LLVM able to support advanced runtime features as continuatio...

...support for deferred insertion of spill code might go away in the future. It is not really needed any longer - InlineSpiller simply inserts spill code directly. > I > have build a custom data structure which has it's own intermediate > representation like live-intervals, but much more conducive for my > allocation algorithm. I do not know if LiveIntervals can accurately > describe my data structure, and it would be a huge hack to enforce the > live interval framework. So don't. RegAllocFast isn't using LiveIntervals either. It is entirely optional. /jakob

Hi I'm conducing a meta-analysis using the meta package. Here's a bit of code that works fine - tmp <- metacont(samplesize.2, pctdropout.2, sddropout.2, samplesize.1, pctdropout.1, sddropout.1, data=Dataset, sm="WMD") I would now like to control for a couple of variables (continuous and categorical) that aren't in the equation. Is meta

Monty, You helped me out quite a bit the other day, but I just wanted to make sure I understand something. The "ideal" way to do bit rate peeling is to have the encoder set the file up to be conducive to the peeling process, and the streamer would be the device that actually does the peeling. Am I correct in assuming, then, that the decoder would think that the file it is receiving was (more or less) simply encoded at the lower bit rate, or does the decoder also have to know that it's d...

HPA, now that syslinux release madness has calmed down, could you provide some info on how we syslinux-minions/wannabes can use bochs and/or qemu to run (sys|pxe|iso|ext)linux in an emulated environment thats more conducive to debugging, single-stepping, and ultimately understanding how the magic happens ? tia jimc

...ch does _not_ split its argument. Hmm... actually a new directive that allows a more complex path entry syntax might be a better idea - something along the lines of, URLPATH http://www.foo.com/bar/ ftp://baz.org/ ::/tftp/ /bin/ That way, we can completely redefine the syntax as something more conducive to urls. -- Matt Fleming, Intel Open Source Technology Center

[Env: Tested under Win Xp, R 2.9.2 and R 2.10.1; sessionInfo() at end] I've run into a problem with the heplot3d() function in my heplots package which causes the R GUI to crash ('R for Windows GUI encountered a problem and needs to close...'). I think the problem comes from an rgl call, but, I can't get a traceback or other information because my R session crashes. I've

...deal with. On that note, they aren't completely impossible to work with in some cases, it just might require accepting getting attacked for a few weeks. I'm a channel operator in one of the Mesa related IRC channels and have had success in communicating with them that their behaviour is not conducive to the environment that we were attempting to create in the channel. This took a bit of coaxing on their "good" days, and communicating with them while being attacked for around a month on end. At the end of this month-long attack and communication I was able to get them to understand tha...

...has advantages over LLVM (more target support etc), and LLVM has advantages over GCC (JIT compilation, easier to work with, interprocedural optimization, can use it to build non GPL tools, ...). This is really a big question that has many nuances, but that is at least part of it. > 2. How conducive to Incremental Compilation is LLVM? I would like to be > able to compile and execute code in the same process immediately. An > example of this would be in an interactive programming environment, or a > Common Lisp style of compilation. That is no problem. You can take a look at the llvm...

Hola a todos: Las versiones oficiales de R no son versiones beta, sino versiones "definitivas" convenientemente testadas. Los paquetes disponibles en el servidor de CRAN están testados contra la versión actual de R. Mantenerse en una versión anticuada normalmente conduce a la pérdida de funcionalidad, errores de dependencias entre versiones de paquetes nuevos etc. En R, actualizar

Hi All R guru's, A couple of simple questions which I cannot find answers to in "an introduction to R" or in the reference manuals. I am running R on Win95, and have plotted up quite a nice box and whisker plot: char<-read.table("n:/reddinm/grifpr~1/survey/char.txt") attach(char) boxplot(Al,Fe,OC,pH, range=0,xaxis=FALSE, ylab="Proportion of Unirigated

...s..... during that time it can ring multiple extensions, at the same time, then after that hunt through various ext until the appropriate party is reached, or if not then it will fall to voicemail. I understand a queue in its most basic function will do this, but a queue doesn't seem to be conducive to dialplan logic, it is setup more for a call center situation. Ideally I would like to put in prompts which will ask them if they would like to continue to hold if need be (ie everyone is on the phone) or go to a voicemail, or if no one is answering then it will go to voicemail etc. Also th...

...ke the >> loop unroller create code in a way such that the constrained vectorizer >> still performs the relevant transformations. > > I was not clear; I meant that imposing a cut off is likely to work, but > it would work even better if the loop unroller produced code > more-conducive to vectorization. Is such a cutoff already integrated and can be enabled by default. I believe it would be great if we could show that the compile time increase is limited by a low constant (maybe 100%), while still showing an overall improvement in run time. >> Also, what do you mean wi...

...e other hand, we could make the > loop unroller create code in a way such that the constrained vectorizer > still performs the relevant transformations. I was not clear; I meant that imposing a cut off is likely to work, but it would work even better if the loop unroller produced code more-conducive to vectorization. > > Also, what do you mean with 'if the loop unroller would intermix > statements from the loops where possible'. Are you referring to the > grouped unrolling as shown in my the last mail? Yes. Also, the code necessary to take advantage of grouped unrolling...

...ut I think the high order bit is the > repository question. > So, a reasonable question might be, why do I prefer #2? I have a lot of not terribly connected reasons. First, I want to consider what happens if we go with #1. Today, LLVM subprojects have been formed essentially any time it was conducive to do so. This worked around the subversion sparse checkout challenges (arguably also solved by newer subversion features, but that's neither here nor there) and didn't cause any problem because we could lay out the tree any way that made sense and we always had a global revision number. A...