similar to: QCA3 segfault

Hello all, I would like to use the lp function (lpSolve package) on a linux system. Using sample code from the lp function help, I can solve the linear program with no errors or problems. However, when I copy the exact same code to R in linux (after loading the lpSolve package), I get the following error: *** caught segfault *** address 0x3, cause 'memory not mapped' Traceback: 1:

Dear Adrian Dusa, others, I've recently started to learn R in order to use the QCA package because i think it might offer what other QCA packages don't: possibilities for quite a few conditions and large n. However, can someone tell me approx. how much RAM i need to run QCA on set of +/- 400.000 cases and +/- 15 conditions? (or differently: how much time will it take with RAM of a

I attached preprocessed files. $ llvm-g++ gcc-RenderBoxModelObject.ii -fno-exceptions -arch x86_64 -O2 -c -o part.o vs $ clang++ clang-RenderBoxModelObject.ii -fno-exceptions -arch x86_64 -O2 -c -o part.o If I compile with clang, it causes a crash to webkit. -Argiris -------------- next part -------------- A non-text attachment was scrubbed... Name: prepro.zip Type: application/zip Size:

Hi all, I just wanted to ask if anybody did a # up2date --upgrade-to-release=4.1 on CentOS 3.5 box? I did it and I'm having a bit of problems. The box just dies... at intervals between half a day and a couple of days. Initially I considered it was a hw problem, so I had the tech support check it out, and they just switched the box with another, and put the harddisks back on the new box...

On Sep 1, 2010, at 6:25 AM, Argyrios Kyrtzidis wrote: > The attached .ll files seem equivalent, but the resulting asm from 'opt-fail.ll' causes a crash to webkit. > I suspect the usage of registers is wrong, can someone take a look ? The difference is that there is a shift right after the multiply, before the divide. In IR, the difference is: %5 = mul nsw i32 %4, %tmp1

CRAN (and crantastic) updates this week New packages ------------ Updated packages ---------------- New reviews ----------- This email provided as a service for the R community by http://crantastic.org. Like it? Hate it? Please let us know: cranatic at gmail.com.

Hi everyone, I have a very quick question: Is there a ready-made function in R or any R packages to find the prime factorization of an integer? -- View this message in context: http://r.789695.n4.nabble.com/Prime-Factorization-tp2548877p2548877.html Sent from the R help mailing list archive at Nabble.com.

The attached .ll files seem equivalent, but the resulting asm from 'opt-fail.ll' causes a crash to webkit. I suspect the usage of registers is wrong, can someone take a look ? $ llc opt-pass.ll -o - .section __TEXT,__text,regular,pure_instructions .globl __ZN7WebCore6kolos1ERiS0_PKNS_20RenderBoxModelObjectEPNS_10StyleImageE .align 4, 0x90

Hello! I have a curious problem, which I cannot solve. With my code I solve thousands of small linear programs with the package lpSolve automatically. But R crashes sometimes (~always, but always on different linear programs) in a strange way. For illustration, I tried to prepare a simple example, which shows the nature of the problem. The function aaa (see below) declares some constants (only in

Hi people, Do you have pointers to web documents that help me make comparisons between buying a server with two quad core 2.33 ghz or buying a 4 dual core 2ghz server? I am trying to answer a question of performance. It is not important the redundancy/failover or the price of the server. Just the performance. obviously all the hardware specs are the same, the question is the CPU. --

Hi. I am trying to use the linear optimizer from package lpSolve in R 2.4.1 on Windows XP (Version 5.1). The problem I am trying to solve has 2843 variables (2841 integer, 2 continuous) and 8524 constraints, and I have 2 Gb of memory. After I load the input data into R, I have at most 1.5 Gb of memory available. If I start the lp with significantly less memory available (say 1 Gb), I get

Hi, I'm trying to add static entries to the wins.dat file, as per The Official Samba 3 How-to guide but can't get it to work. If I add entries and just leave it be, the server responds with unknown host and If I restart nmbd it removes all the entries (static) that I manually added. Am I doing something wrong or is this a bug ? Brett

CRAN (and crantastic) updates this week New packages ------------ * bdoc (1.0) Michael Anderson http://crantastic.org/packages/bdoc This package contains a function that will classify DNA barcodes as well as a few test and reference data sets. * bdsmatrix (1.0) Terry Therneau http://crantastic.org/packages/bdsmatrix This is a special case of sparse matrices, used by coxme and

I've posted this earlier and have not heard much so far. I'd really appreciate any guidance on this as we are about to order new hardware. We are buying Dell workstations with Red Hat Linux and 64-bit Xeon CPUs to run R. We could add a second processor to each system, or buy slightly faster single CPU systems. Is it possible to make a generalized statement as to what kind of performance

Dear all, I would like to solve a problem similar to a multiple knapsack problem and am looking for a function in R that can help me. Specifically, my situation is as follows: I have a list of n items which I would like to allocate to m groups with fixed size. Each item has a certain profit value and this profit depends on the type of group the item is in. My problem is to allocate the items

We are currently running R under Windows 2000 on a server box running with 2 1.2 GHZ Intel Pentium III Processors. We would like to run this on a new computer running Linux and receive a significant speed increase over our current implementation. Could anyone provide some suggestions for a fast 64 BIT Intel based processor computer with a recommendation for memory and speed/type/number of

Hi, Nicolas, I have been talking to Andre about this project. Let me add my two cents: > I don't get it. What is the cons then of a simulation? The tradeoff, IMHO, is as follows: simulation: it does not add instructions to LLVM IR. Instead, it builds an interval representation for each variable. Each interval represents a variable in SSI form, and will be associated to one or

If I have matrics as follows: > a <- c(1,1,0,0) > b <- c(4,4,0,0) > c <- c(3,5,5,6) How can I use R code to solve the equation ax^2+bx+c=0. thanks! yuying shi [[alternative HTML version deleted]]

On May 19, 2009, at 8:15 PM, Nick Lewycky wrote: > Eli Friedman wrote: >> On Tue, May 19, 2009 at 12:30 PM, Nicolas Geoffray >> <nicolas.geoffray at lip6.fr> wrote: >>>> The pi functions can be implemented with copy instructions. >>> Store instructions? >> >> I would assume something more like "select i1 true, <ty> %val, <ty>

> As a guess, how many IceCast streams could be supported on one Linux PC > (say 1.5Ghz PC). Icast at one point had about 456 stations or so. We were able to do this (all the music was preencoded) with 8 machines quite reliably. Basically 4 machines sourced streams, and 4 machines served them. Only three machines were really needed, so failures were taken care of if only one machine