similar to: puzzle with integrate over infinite range

Displaying 20 results from an estimated 1000 matches similar to: "puzzle with integrate over infinite range"

2010 Oct 04
1
Help with apply
Suppose I have the following data: tmp <- data.frame(var1 = sample(c(0:10), 3, replace = TRUE), var2 = sample(c(0:10), 3, replace = TRUE), var3 = sample(c(0:10), 3, replace = TRUE)) I can run the following double loop and yield what I want in the end (rr1) as: library(statmod) Q <- 2 b <- runif(3) qq <- gauss.quad.prob(Q, dist = 'normal', mu = 0, sigma=1) rr1 <- matrix(0,
2010 Dec 02
4
Integral of PDF
The integral of any probability density from -Inf to Inf should equal 1, correct? I don't understand last result below. > integrate(function(x) dnorm(x, 0,1), -Inf, Inf) 1 with absolute error < 9.4e-05 > integrate(function(x) dnorm(x, 100,10), -Inf, Inf) 1 with absolute error < 0.00012 > integrate(function(x) dnorm(x, 500,50), -Inf, Inf) 8.410947e-11 with absolute error <
2010 Apr 22
2
Compare two data frames
I wonder if there is a more efficient way to do this task. Suppose I have two data frames, such as d1 <- data.frame(x = c(1,2,3), y = c(4,5,6), z = c(7,8,9)) d2 <- d1[, c('y', 'x')] The first dataframe d1 has more variables than d2 and the variable columns are in a different order. So, what I want to do is compare the two frames on the variables that are common between
2010 Sep 29
1
nlminb and optim
I am using both nlminb and optim to get MLEs from a likelihood function I have developed. AFAIK, the model I has not been previously used in this way and so I am struggling a bit to unit test my code since I don't have another data set to compare this kind of estimation to. The likelihood I have is (in tex below) \begin{equation} \label{eqn:marginal} L(\beta) = \prod_{s=1}^N \int
2009 Sep 27
0
puzzle with drawDetails for a class derived from a gTree
Dear all, I've tried all sorts of variations discussed in "R graphics" by Paul Murrell, but I still can't understand how to write a drawDetails method for a class derived from a gTree. Below is a minimal, dummy example where two strings are plotted in two separate viewports. I require the creation of the strings to be evaluated inside the drawDetails function because my real
2010 Sep 29
2
R crashes when loading rgl package before minqa package
Hej, Calling newuoa (from the minqa package) makes R crash when the package rgl is loaded first. This however only on certain selected data. The data used for testing (saved to 'bugs.R'): xvals = c(1,2,4,5,7,8,9,10,11,12,14,15,16,18,19,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36) yvals =
2019 Apr 12
2
integrate over an infinite region produces wrong results depending on scaling
Dear all, This is the first time I am posting to the r-devel list. On StackOverflow, they suggested that the strange behaviour of integrate() was more bug-like. I am providing a short version of the question (full one with plots: https://stackoverflow.com/q/55639401). Suppose one wants integrate a function that is just a product of two density functions (like gamma). The support of the
2006 Feb 22
2
Bug#353962: integrate courier file in logcheck-database
Package: courier-imap-ssl,logcheck-database Severity: wishlist Please move /etc/logcheck/*/courier to the courier packages and out of logcheck-database. -- System Information: Debian Release: testing/unstable APT prefers stable APT policy: (700, 'stable'), (600, 'testing'), (98, 'unstable'), (1, 'experimental') Architecture: i386 (i686) Shell: /bin/sh linked
2002 Nov 07
1
language inconsistency puzzle (in the tradition of Bill V enables (Hi Bill) puzzle "what is x")
R allows you to dynamically extend a vector by assigning past the end. So if a has length 10, then assigning to a[11] creates also a[11] with value a2[11] NA. So a is now length 11, while a2 is still length 10. So the occurrence of a[11] has a different meaning on the assigned-to side than on the assigned-from side. E.g. >a <- rep(1,10) >b <- 11 >a2 <- a >a[b] <- a2[b]
2007 Apr 18
0
Zidane Headbutt - A Flash Jigsaw Puzzle - .
Skipped content of type multipart/alternative-------------- next part -------------- A non-text attachment was scrubbed... Name: not available Type: image/gif Size: 13487 bytes Desc: not available Url : http://lists.linux-foundation.org/pipermail/virtualization/attachments/20070322/2daa12a4/attachment.gif
2013 Oct 03
1
version comparison puzzle
Can anyone explain what I'm missing here? max(pp1 <- package_version(c("0.99999911.3","1.0.4","1.0.5"))) ## [1] ?1.0.4? max(pp2 <- package_version(c("1.0.3","1.0.4","1.0.5"))) ## [1] ?1.0.5? I've looked at ?package_version , to no avail. Since max() goes to .Primitive("max") I'm having trouble figuring out
2007 Apr 18
0
Zidane Headbutt - A Flash Jigsaw Puzzle - .
Skipped content of type multipart/alternative-------------- next part -------------- A non-text attachment was scrubbed... Name: not available Type: image/gif Size: 13487 bytes Desc: not available Url : http://lists.linux-foundation.org/pipermail/virtualization/attachments/20070322/2daa12a4/attachment.gif
2012 Aug 08
0
[LLVMdev] another mips16 puzzle
i'm trying to formulate the optimal way to do comparison testing for mips 16. on mips32 there are no condition codes. you can test a<b and place the result in a register in mip32. on mips16 you can do the same, however, the register is always T8==24. T8 is not directly accessible by most mips16 instructions, but can be directly moved to a generally accessible mips16 register, and can
2012 Oct 12
0
[LLVMdev] another mips16 puzzle
Usually we do all the accessing of stack variables via the SP register. When the stack size is dynamic we need a frame pointer, FP. There is a traditional FP register for MIPS, but FP is not a mips16 register so in general it has little use for mips16 because you can't directly address it except in the move instruction when moving from/to mips16 to mips32 register. There are several ways
2013 Jan 08
0
[LLVMdev] mips16 hard float puzzle
On Mon, Jan 7, 2013 at 6:07 PM, reed kotler <rkotler at mips.com> wrote: > > For example: > > /home/rkotler/llvm/install/bin/llc -mcpu=mips16 hf16_2.ll -march=mipsel > -relocation-model=pic -o hf16_2.s -O3 -mips16-hard-float -soft-float Try something like the following: float f; double test(void* fptr) { f = ((float(*)(float,float))fptr)(1.0, 1.0); } -Eli
2013 Jan 09
0
[LLVMdev] mips16 hard float puzzle
On Tue, Jan 8, 2013 at 6:33 PM, reed kotler <rkotler at mips.com> wrote: > On 01/08/2013 01:48 PM, Eli Friedman wrote: >> >> On Mon, Jan 7, 2013 at 6:07 PM, reed kotler <rkotler at mips.com> wrote: >>> >>> For example: >>> >>> /home/rkotler/llvm/install/bin/llc -mcpu=mips16 hf16_2.ll -march=mipsel >>> -relocation-model=pic -o
2013 May 23
0
[LLVMdev] LLVM Loop Vectorizer puzzle
On 23 May 2013 14:52, Arnold Schwaighofer <aschwaighofer at apple.com> wrote: > I would like us to grow a few annotations, among others, one to force > vectorization irrespective whether the loop vectorizer thinks it is > beneficial or not - however, this is future music. > Isn't that part of the ivdep implementation? I thought there was support for that already...
2013 May 23
0
[LLVMdev] LLVM Loop Vectorizer puzzle
On 2013-05-23, at 2:13 PM, Pekka Jääskeläinen wrote: > On 05/23/2013 06:52 PM, Redmond, Paul wrote: >> I'm not even sure you would need the llvm.loop.parallel anymore since the >> vectorizer could just look to see if the loop id on a parallel_loop_access >> matches the loop id of the loop being vectorized. >> >> Does this make any sense? > > Yes.
2008 Nov 19
0
net-snmp puzzle
I have a bunch of centos 5.2 boxes. I'm trying to run smtp on all of them. Using indentical net-snmp configuration files. /etc/snmp/snmpd.conf com2sec notConfigUser localhost smssnmp com2sec notConfigUser 10.1.1.0/24 smssnmp group notConfigGroup v1 notConfigUser group notConfigGroup v2c notConfigUser view systemview included
2016 Aug 16
0
local routing puzzle
On 8/16/2016 3:53 AM, lejeczek wrote: > > $ ping 10.5.6.17 -I p3p3 > PING 10.5.6.17 (10.5.6.17) from 172.25.12.202 p3p3: 56(84) bytes of data. > > and nothing, ping waits and no reply, Ctrl+C > > with such a simple setup rules based routing should not be involved, > kernel should figure it out, right? you specifically said to send that packet to an interface on the wrong