Displaying 20 results from an estimated 200 matches similar to: "LCG with modulo 2^30"
2004 Nov 14
1
solving system of nonlinear equations
Hello there
Can anybody please tell me if there is any package in R to solve the
following 4 nonlinear equations with 4 unknowns:
alpha*exp(20/sigma)+ beta*exp(21/tau) = 2
alpha*exp(22/sigma)+ beta*exp(9/tau) = 4
alpha*exp(10/sigma)+ beta*exp(30/tau) = 6
alpha*exp(40/sigma)+ beta*exp(39/tau) = 5
where
alpha = exp(lambda/sigma)
beta= exp(delta/tau)
I need to estimate lambda, sigma, delta, tau
2008 Oct 13
1
newbie question about running mysql
Hello,
I am following the Agile Rails dev book and I like the command line
format used to create example apps in the book. However, I am stuck on
one point. How do I run mysql commands from the Rails prompt. I have a
Win Xp sys. I can start rails from the command prompt. But if I type
"mysql", I get an error saying it is not recognized as an internal or
external command.
MySQL 5.0.51
2018 Dec 28
1
[PATCH nbdkit] common: Improve pseudo-random number generation.
Currently we use non-cryptographically secure random numbers in two
places, the error filter (to inject errors at random) and the random
plugin. For this we have used either random_r or a home-brew-ish
Linear Congruential Generator. Use of random_r is problematic on BSDs
because it doesn't exist there. Use of the LCG is simply a bad
choice.
Replace both uses with a better quality and
2018 Dec 28
2
[PATCH v2 nbdkit] common: Improve pseudo-random number generation.
v2:
- Fix seeding.
- Add a test that nbdkit-random-plugin is producing something
which looks at least somewhat random.
Rich.
2018 Dec 28
0
[PATCH v2 nbdkit] common: Improve pseudo-random number generation.
Currently we use non-cryptographically secure random numbers in two
places, the error filter (to inject errors at random) and the random
plugin. For this we have used either random_r or a home-brew-ish
Linear Congruential Generator. Use of random_r is problematic on BSDs
because it doesn't exist there. Use of the LCG is simply a bad
choice.
Replace both uses with a better quality and
2018 Dec 31
1
Re: [PATCH v2 nbdkit] common: Improve pseudo-random number generation.
On 12/28/18 2:55 PM, Richard W.M. Jones wrote:
> Currently we use non-cryptographically secure random numbers in two
> places, the error filter (to inject errors at random) and the random
> plugin. For this we have used either random_r or a home-brew-ish
> Linear Congruential Generator. Use of random_r is problematic on BSDs
> because it doesn't exist there. Use of the LCG is
2007 Apr 24
5
Random Number Generator of Park and Miller
Hi,
I failed to search for R package providing random number generator of "Park
and Miller".
Anyone know any R package supporting this kind of function?
Thanks,
Grace
--
View this message in context: http://www.nabble.com/Random-Number-Generator-of-Park-and-Miller-tf3636501.html#a10154554
Sent from the R help mailing list archive at Nabble.com.
2008 Sep 24
2
cannot allocate memory
I am getting "Error: cannot allocate vector of size 197 MB".
I know that similar problems were discussed a lot already, but I
didn't find any satisfactory answers so far!
Details:
*** I have XP (32bit) with 4GB ram. At the time when the problem
appeared I had 1.5GB of available physical memory.
*** I increased R memory limit to 3GB via memory.limit(3000)
*** I did gs() and got
2002 Oct 11
1
growing process size in simulation
I came across this in a simulation I ran under 1.6.0: If I do something
like
R> x <- rnorm(10)
R> rval <- NULL
R> for(i in 1:100000) rval <- t.test(x)$p.value
then the process size remains at about 14M under 1.5.1, but it seems to
be almost linearly growing up to more than 100M under 1.6.0.
I know that the above simulation is nonsense, but it was the simplest I
could come up
2013 Mar 05
0
[LLVMdev] modulo scheduling
Hello,
I was wondering if anybody could help me to find swing modulo scheduling
implementation in LLVM. It looks like that SMS has been implemented for
SPARC V9 back end but I could not find it anywhere!!
Thanks
--
Mahdi Hamzeh
Graduate Research Associate
School of Computing, Informatics, and Decision Systems Engineering (CIDSE)
Arizona State University
http://www.public.asu.edu/~mhamzeh1/
2013 Dec 09
3
[LLVMdev] [cfe-dev] ARM EABI and modulo
On Mon, Dec 09, 2013 at 07:56:26AM +0000, Tim Northover wrote:
> Hi Joerg,
>
> > At the moment, this will call __modsi3 and __umodsi3, even though those
> > functions are not part of AAPCS. Should this be considered a lowering
> > bug in the ARM target?
>
> LLVM actually supports both variants, depending on the target. The
> __aeabi_* functions are part of the
2013 Dec 09
0
[LLVMdev] [cfe-dev] ARM EABI and modulo
On 9 December 2013 11:51, Joerg Sonnenberger <joerg at britannica.bec.de> wrote:
> Part of the concern is that the same code using / does call __aeabi_idiv
> and __aeabi_uidiv.
Hi Joerg,
I can see the error, and it's just a bad selection of choices. I was
wrong in assuming that the "eabi" at the end would always force it:
$ clang -target arm-elf-eabi -S mod.c -o - |
2013 Dec 09
0
[LLVMdev] [cfe-dev] ARM EABI and modulo
On Mon, Dec 09, 2013 at 03:11:45PM +0100, Joerg Sonnenberger wrote:
> On Mon, Dec 09, 2013 at 01:58:29PM +0000, Renato Golin wrote:
> > I can see the error, and it's just a bad selection of choices. I was
> > wrong in assuming that the "eabi" at the end would always force it:
> >
> > $ clang -target arm-elf-eabi -S mod.c -o - | grep mod
> > .file
2013 Jan 24
0
[LLVMdev] Order of optimization: modulo scheduling & register allocation
On Jan 23, 2013, at 3:45 PM, ryan baird <ryanrbaird at gmail.com> wrote:
> I was reading about the order of optimizations in the code generation stage here: http://llvm.org/docs/CodeGenerator.html#the-high-level-design-of-the-code-generator
>
> This is the part that's interesting to me:
>
> 3. SSA-based Machine Code Optimizations — This optional stage consists of a
2014 Nov 10
2
[LLVMdev] About inlining the modulo function in ARM architecture
Hi all,
Sorry for bothering those not interested. I found that ARM backend will
insert a modulo function
(like __modsi3) instead of the modulo instruction. I wonder how we can
inline the modulo function
into the program. Is there any OPTION we can use in the opt or llc?
Thanks,
Ray
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
2014 Nov 10
3
[LLVMdev] About inlining the modulo function in ARM architecture
Hi Tim,
Thanks for your reply.
On Mon, Nov 10, 2014 at 1:26 PM, Tim Northover <t.p.northover at gmail.com>
wrote:
> Hi Ray,
>
> On 10 November 2014 10:13, Alex S <alexmountain13 at gmail.com> wrote:
> > Sorry for bothering those not interested. I found that ARM backend will
> > insert a modulo function
> > (like __modsi3) instead of the modulo instruction.
2014 Dec 05
0
Size of array hosts, vhosts_count and modulo operation
Hi,
Timo Sirainen wrote (May 19, 2010 1:50:34 am) :
"When a connection from a newly seen user arrives, it gets assigned to a
mail server according to a function:
host = vhosts[ md5(username) mod vhosts_count ]"
This hash function is it still used as it is without modification ?
My another question sounds pretty innocent but I have doubts about
vhosts_count.
Taking two directors
2013 Dec 09
0
[LLVMdev] [cfe-dev] ARM EABI and modulo
Hi Joerg,
> At the moment, this will call __modsi3 and __umodsi3, even though those
> functions are not part of AAPCS. Should this be considered a lowering
> bug in the ARM target?
LLVM actually supports both variants, depending on the target. The
__aeabi_* functions are part of the ARM "runtime ABI" and largely
independent of AAPCS. For whatever reason, Linux (& Darwin)
2013 Dec 09
3
[LLVMdev] [cfe-dev] ARM EABI and modulo
On Mon, Dec 09, 2013 at 01:58:29PM +0000, Renato Golin wrote:
> I can see the error, and it's just a bad selection of choices. I was
> wrong in assuming that the "eabi" at the end would always force it:
>
> $ clang -target arm-elf-eabi -S mod.c -o - | grep mod
> .file "mod.c"
> bl __modsi3
> bl __umodsi3
I was discussing this with Tim on IRC and he
2013 Jan 23
2
[LLVMdev] Order of optimization: modulo scheduling & register allocation
I was reading about the order of optimizations in the code generation stage
here:
http://llvm.org/docs/CodeGenerator.html#the-high-level-design-of-the-code-generator
This is the part that's interesting to me:
3. SSA-based Machine Code
Optimizations<http://llvm.org/docs/CodeGenerator.html#ssa-based-machine-code-optimizations>—
This optional stage consists of a series of machine-code