similar to: Prime Numbers Pkgs - Schoolmath is broken

Hello, As recommended by N. Gunther, I'm writing you because I have some difficulties to create a script to track computer performance, as done in Holtman, 2005 (Visualization techniques for analysing patterns in system performance). I would like to do a leveplot, with the kind of file here enclosed. I assume I should create a matrix in R, then use the function 'image'. As I am not

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.

I just tried rendering a plot of 166 data point (time series) on my PPC mac, and compared it with the same data rendered by Mathematica. The R plotting is very slow to paint and repaint, compared to Mathematica. This also makes it extremely awkward to use in other documentation such as pdfLatex. On closer inspection, it looks like the Mathematica plot is just a polyline, while in R it is a

> Looking for a recommended package that handles prime number computations. I'm not sure whether this would be helpful to you, but Sage (http://www.sagemath.org) has excellent number theory support and several ways to interface with R (which is included in the distribution of Sage). I use it myself to access several R packages I need to do analysis on data I produce in Sage/Python, and

Hola a todos, Estoy teniendo problemas para cambiar el nombre de los factores. Mi matriz original es de la siguiente forma: > alfa local mes amb Fase sp1 sp2 sp3 sp4 L1-P1-C Ago.10 Lentico LFP 22.111664 0 0 0 L3-P3-M Ago.10 Lentico LFP 22.111664 5.527916 5.527916 0 P-1-C Ago.10 Lotico LFP 11.055832 0 0 0 P-3-M Ago.10 Lotico LFP 55.27916 5.527916 11.055832 0

I need to create a function to find all the prime numbers in an array. Can anyone point me in the right direction? Thank you. AJ -- View this message in context: http://www.nabble.com/Function-to-find-prime-numbers-tp25868633p25868633.html Sent from the R help mailing list archive at Nabble.com.

Dear R-Devel, I have had it in my mind for some time now that a Task View related to R and education might be a good thing. There are currently 19 Task Views, covering a broad spectrum of general topics for which R may be used. The homepage lists 64 books related to R, and several of them have accompanying packages on CRAN. There is a wiki and a host of contributed documentation. We also have a

I''m not sure this is the appropriate community to get objective unbiased feedback on this issue, but I suppose it''s worth a gander... Here''s my question: Is it possible to write a massively scalable application intented for millions of users (i.e. Yahoo, Google, MySpace, etc.) using Ruby on Rails? I''m sure apps like these can be built, but can they scale to

Hola a todos; Quisiera saber si la frunción timeVariation cuando los intervalos de confianza se superponen aunque no sea en todo el perido temporal; es correcto decir que: ?No podemos afirmar que los valores medios horarios de concentración de NO de la serie temporal jun-dic 10-13 son distintos de los de la serie temporal jun-dic 14 debido a que los intervalos de confianza al 95% de ambas series

In message <Pine.LNX.4.30.0104031615270.8678-100000 at holly.crl.go.jp>, Tom Holro yd writes: >SRP has different requirements from Diffie-Hellman. In particular, >for SRP the generator must be primitive. It turns out that the "primes" >file contains only safe primes with primitive generators, and is thus >ideal for SRP, but so far in OpenSSH it has only been used for

On Wed 2015-05-27 05:23:41 -0400, Hubert Kario wrote: > On Tuesday 26 May 2015 15:10:01 Daniel Kahn Gillmor wrote: >> On Tue 2015-05-26 14:02:07 -0400, Hubert Kario wrote: >> > OEIS A014233 >> >> Hm, this is a sequence, but not an algorithm. It looks to me like it is >> not exhaustive, just a list of those integers which are known to have >> the stated

On Fri 2015-05-22 00:06:29 -0400, Darren Tucker wrote: > On Thu, May 21, 2015 at 11:26 PM, Matthew Vernon <matthew at debian.org> wrote: >> >> You will be aware of https://weakdh.org/ by now, I presume; the >> take-home seems to be that 1024-bit DH primes might well be too weak. >> I'm wondering what (if anything!) you propose to do about this issue, >>

https://bugzilla.mindrot.org/show_bug.cgi?id=2559 Bug ID: 2559 Summary: Warnings from reading moduli file, refer to primes file Product: Portable OpenSSH Version: 7.2p1 Hardware: Other OS: Linux Status: NEW Severity: enhancement Priority: P5 Component: sshd

On Thu, 28 May 2015, Hubert Kario wrote: > > If this is the only attack you're trying to address, and you've > > already limited yourself to safe primes, then NUMS properties don't > > really add anything. The NUMS approach is there are to try to avoid > > the possibility of other, unknown cryptanalytic attacks against some > > infrequent type of group,

On Tue 2015-05-26 14:02:07 -0400, Hubert Kario wrote: > On Tuesday 26 May 2015 13:43:13 Daniel Kahn Gillmor wrote: >> On Tue 2015-05-26 12:57:05 -0400, Hubert Kario wrote: >> > creating composites that will pass even 100000 rounds of Miller-Rabin is >> > relatively simple.... >> > (assuming the values for M-R tests are picked randomly) >> >> Can you

On Tue 2015-05-26 12:57:05 -0400, Hubert Kario wrote: > creating composites that will pass even 100000 rounds of Miller-Rabin is > relatively simple.... > (assuming the values for M-R tests are picked randomly) Can you point me to the algorithms for doing that? This would suggest that we really do want primality proofs (and a good way to verify them). Do those algorithms hold for

On Fri, 29 May 2015, Hubert Kario wrote: > Not really, no. > > We can use this time an initial seed of "OpenSSH 1024 bit prime, attempt #1". > Next time we generate the primes we can use the initial seed of "2017 OpenSSH > 1024 bit prime, attempt #1", but we can use just as well a "2nd generation > OpenSSH 1024 bit DH parameters, try number 1".

Hi, You will be aware of https://weakdh.org/ by now, I presume; the take-home seems to be that 1024-bit DH primes might well be too weak. I'm wondering what (if anything!) you propose to do about this issue, and what Debian might do for our users? openssh already prefers ECDH, which must reduce the impact somewhat, although the main Windows client (PuTTY) doesn't support ECDH yet. But

Please I need some help using R to analyze my data. What I would like to do is to repeat the same basic process (e.g. linear regression between wood density and distance from pith) for at least 240 data subsets within the main data-frame. Within the main data-frame, these data subsets will be defined by three variables namely,  species, individual and core (i.e. 20 species, at least 6

Running a samba server version 3.0.7 on a FreeBSD box Life has been fine with XP and so forth I added a new vista workstation to my small network Vista found my shares and I am able to access them with no jerking around with authentication types or such as I use appropriate pw and user name to log into the vista box. Problem is vista is spamming my server, taking up >50% cpu