similar to: Dataset from one precinct's turnout in yesterday's election

Dear all, in GADM map there are three levels (nation, province and precinct) for each country of the world but for all of them you are never able to plot only one part of a chosen country. To be sure, I am trying to plot only one region of “Italy” and colour the different precincts in it. So far I am able to colour only the part of my interest but the programme still plot the whole country. Is

I don't know anybody who has S-plus these days, but I expect some of you might, and perhaps you won't mind telling me something. I'm working on my presentation about R for the general audience. As I survey the suggestions from this list about that project, I find myself wondering whether S-plus benefits from R. Does S-plus syntax change like R's does. I can take code for S and

Hi all, I''ve just merged in support for builtin Nagios types into the 0.24.x branch, and I''d like people to give them a once-over before I incorporate them into a release (based on a few (hopefully small) outstanding bugs in 0.24.1, I expect I''ll put out a 0.24.2 in the next week or so). The only thing I''d currently consider a gotcha right now is that

With the continuing annoyance from motion, my manager's asked me to go looking again for a video surveillance appliance: basically, a motion-detecting DVR and cameras. The big thing, of course, is a) price (this is a US federal gov't agency, and being civilian, money is *tight*, don't give me the libertarian/GOP line about how freely we spend, thankyouverymuch), b) it has to be on the

I am trying to plot two density lines on the same graph. Using the functions on the base package, I would go: plot(density(x), col = 1) lines(density(y), col = 2) And I get two distinct (one-bump) density lines. When I try to do it using lattice, I get two two-humped lines. (In other words, I think the smoothing function is taking the next set of data points and smoothing them in the same

Hi! I'm using the Naive Bayes classifier provided by the e1071 package ( http://cran.r-project.org/web/packages/e1071) and I've noticed that the predict function has a different behavior when the level set of the columns used for prediction is different from the ones used for fitting. From inspecting the predict.naiveBayes I came to the conclusion that this is due to the conversion of

Are there any particular licences under which R packages must be released or is it the discretion of the author? The same question if the package is to be destined for CRAN? Kind regards, Nathan -- -------------------------------------------------------- Dr. Nathan S. Watson-Haigh OCE Post Doctoral Fellow CSIRO Livestock Industries Queensland Bioscience Precinct St Lucia, QLD 4067 Australia

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I'm generating a symmetric correlation matrix using a data matrix as input: mat <- cor(data.mat) My question is: Is there a more memory efficient way to store this data? For instance, since: all(mat == t(mat)) every value is duplicated, and I should be able to almost half the memory usage for large matrices. Any thoughts/comments? Cheers,

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I have a rectangular matrix of size 920 by 85. I'd like to coerce it into a square matrix such that all row/col names are present in the new matrix and the additional values are zero. As an example: A B C D A 1 2 3 4 E 5 6 7 8 F 9 10 11 12 Would be coerced to: A B C D E F A 1 2 3 4 5 9 B 2 0 0 0 6 10 C 3 0 0

mark wrote With the continuing annoyance from motion, my manager's asked me to go looking again for a video surveillance appliance: basically, a motion-detecting DVR and cameras. The big thing, of course, is a) price (this is a US federal gov't agency, and being civilian, money is *tight*, don't give me the libertarian/GOP line about how freely we spend, thankyouverymuch), b) it has

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I'm trying to add some Fortran 90 code to an existing package. When I compile and load the file manually like: SHELL> R CMD SHLIB file.f90 R> dyn.load("file.so") I can use the .Fortran() fine. However, when I try to build, install and load the library I seem to be missing something. I do a: SHELL> R CMD build dir SHELL> R

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I have the following data: > y [1] 0.000 0.004 0.008 0.016 0.024 0.032 0.044 0.064 0.072 0.088 0.108 0.140 [13] 0.156 0.180 0.208 0.236 0.264 0.296 0.320 0.360 0.408 0.444 0.472 0.524 [25] 0.576 > x [1] 100 200 300 400 500 600 700 800 900 1000 1100 1200 1300 1400 1500 [16] 1600 1700 1800 1900 2000 2100 2200 2300 2400 2500 I'd

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I've written a function in R which takes a symmetrical matrix as input and processes all triplicate combinations of values from the matrix. The function looks something like: my_fun <- function(m) { if( nrow(mat) != ncol(mat) ) { stop("'m' must be a square matrix") } size <- nrow(m) for(x in 1:(size -2)) {

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I'd like to be able to colour histograms along the diagonal using the colours stored in colnames(d): > d black blue brown cyan 1 0.96405751 -0.02964390 -0.060147424 -0.06460070 2 -0.03614607 0.95475444 -0.152382053 -0.07767974 3 -0.07095613 -0.05884884 -0.061289399 -0.06445973 4 -0.03708223 -0.05997624

The laws already exist: Disturbing the peace, Misappropriation of public funds, Prohibition on unfunded mandates. What's lacking is prosecutors, judges, and juries who see the politicians as getting in the way of the statesmen and the people. To drag this back towards On Topic, it seems to me that the ntp folks might be petitioned to write up and submit to the Congress, a paper

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I was wondering if anyone could point me in the right direction for reading up on writing tests in R. I'm writing some functions for inclusion into a package and would like to test them to ensure they're doing what I expect them to do. Are these approaches used for testing packages in CRAN? Cheers, Nathan - -- -

It might be old but still worked. I am using Dovecot 1.2.11 hoping to replace QualComm Eudora and Cyrus IMAP. dovecot -n yields base_dir: /var/run/dovecot/ protocols: imap imaps pop3 pop3s ssl_listen: 204.209.81.1 ssl_cipher_list: ALL:!LOW:!SSLv2 disable_plaintext_auth: no login_dir: /var/run/dovecot/login login_executable(default): /usr/dovecot/libexec/dovecot/imap-login

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I'm trying to calculate Pearson correlation coefficients for a large matrix of size 18563 x 18563. The following function takes about XX minutes to complete, and I'd like to do this calculation about 15 times and so speed is some what of an issue. Does anyone have any suggestions on ways to speed this up? I'd wondered if using C++ code to

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I have some data generated as follows: <code> n <- 2000 work <- vector() for(x in 1:n) { work[x] <- sum(1:(n-x+1)) } plot(work) </code> What I want to do - ----------------- I want to split work into a number of unequal chunks such that the sum of the values in each chunk is approximately equal. The numbers in

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Is there a library which is capable of identifying distinct clusters of size n from a series of XY coordinates? Failing this, I'd like to be able to to something like: Using a sliding window of size n along the x-axis I'd like to determine the distance between the center of the points in the window and the closest point outside the window. I