similar to: expand.grid game

Hi everyone, I am hoping someone can help with my attempted use of the expression function. I have a long series of text and variable to paste together including a degree symbol. The text is to be placed on my scatter plot using the mtext function. Using expression like this: changetext = expression(paste("Change from ",mini," to ", maxi, ":", diff

Hi, I'm trying to use sapply to compute the min of several variables, each of them stored in data.frames, grouped as a list: Is it normal that mean() and min() produce different objects dimensions? > str(dats) List of 5 $ log20:'data.frame': 83 obs. of 5 variables: ..$ DATE : int [1:83] 2001081500 2001081512 2001081600 2001081612 2001081700 2001081712

The following makes 'x86info -r' dump hypervisor leaf cpu ids (for kvm this is signature+features) when running in a vm. On the guest we see the signature and the features: eax in: 0x40000000, eax = 00000000 ebx = 4b4d564b ecx = 564b4d56 edx = 0000004d eax in: 0x40000001, eax = 0100007b ebx = 00000000 ecx = 00000000 edx = 00000000 Hypervisor flag is checked to avoid output changes when

The following makes 'x86info -r' dump hypervisor leaf cpu ids (for kvm this is signature+features) when running in a vm. On the guest we see the signature and the features: eax in: 0x40000000, eax = 00000000 ebx = 4b4d564b ecx = 564b4d56 edx = 0000004d eax in: 0x40000001, eax = 0100007b ebx = 00000000 ecx = 00000000 edx = 00000000 Hypervisor flag is checked to avoid output changes when

Hi all ! I have a little problem here mounting or browsing samba shares. I have a FreeBSD 4.6.2 running samba, and a share on that called public. when I try to mount that share it asks for password, and then gives an error: ex. libra# mount_smbfs //maxi@samba/public /mnt Password: mount_smbfs: can't get handle to requester (no /dev/nsmb* device) libra# I can list the shares with

Hello, I'd like to take all possible sub-summands of a vector in the quickest and most efficient way possible. By "sub-summands" I mean for each sub-vector, take its sum. Which is to say: if I had the vector x<-1:4 I'd want the "sum" of x[1], x[2], etc. And then the sum of x[1:2], x[2:3], etc. And then...so on. The result would be: 1 2 3 4 2 5 7 6 9 10 I can

I've writen this function (imagenrgb) to display a (m,n,3) array as a RGB image with ngris^3 colors and,optionally, stretching. If option ver=F, it does not display but saves a pseudocolor version of the image as a list (so that subsequent displays are faster). I'd appreciate feedback and improvements and hope that it's useful for others. Example of use: > dim(imatest) [1] 100

Hi there, I have a question on how to read a bunch of dataset, assign each of the dataset to a matrix in the memory, and append them. Suppose I have 20 dataset saved to different .rda files named gradeFileData1, gradeFileData2,...., gradeFileData20. And I would like to read them each into a dataset in the memory, then combine them. I wrote something like: e1<-new.env(parent=.GlobalEnv)

Dear All, Suppose I have a program as below: Outside is a loop for simulation (with random generated data), inside there are several sapply()'s (10~100) over the data and something else, but these sapply's have to be sequential. And each sapply do not involve very intensive calculation (a few seconds only). So the outside loop takes minutes to finish one iteration. I guess the better way

I have a set of linear equations and would like to find any feasible solution. A simplex solution works in Case 1 below, but not in Case 2. I would be grateful for any help. Case 1: Find any feasible solution for the set of linear equations: a + b + c = 5 a + b + 0c = 4 0a + b + c = 4 Solution - a feasible (and unique) solution is a=1, b=3, c=1. The following R code

Hello, I created a data.frame which contains two columns: df$P (Power) et df$DateTime (time). I'd like to add a new column df$diffP (difference of Power between T and T-2). I made a loop : for (i in 3:length(df$DateTime)){ df$diffP[i] = df$P[i] - df$P[i-2] } execution time result is unaceptable: 24s !! Is there any way to reduce complexity about O(n) ? for example 2 or 3s (10s maxi)

Hi, Look at the following code: Look at the following C code seqence: unsigned char mainGtU ( unsigned int i1, unsigned int i2, unsigned char* block) { unsigned char c1, c2; c1 = block[i1]; c2 = block[i2]; if (c1 != c2) return (c1 > c2); i1++; i2++; c1 = block[i1]; c2 = block[i2]; if (c1 != c2) return (c1 > c2); i1++; i2++; .. ..

hi... i try to make dovecot (v1.0.r26) in solaris 10 and i have the following problem # ./configure --with-ldap ... ... Install prefix ...................... : /usr/local File offsets ........................ : 64bit I/O loop method ..................... : poll File change notification method ..... : none Building with SSL support ........... : yes (OpenSSL) Building with IPv6 support ..........

I'm new to bugs, so please bear with me. Can someone tell me if the following two models are doing the same thing? The reason I ask is that with the same data, the first (based on 4 separate coeffs a1--a4) takes about 50 secs, while the second (based on a vectorized form, a[]) takes about 300. The means are about the same, though R-hat's in the second version are quite a bit better.

Hello people I am doing some thinking about how to analyse data on dimorphic animals - where different individuals of the same species have rather different morphology. An example of this is that some male beetles have large horns and small wings, and rely on beating the other guys up to get access to mates, whereas others have smaller horns and larger wings, and rely on mobility to

Hi all, i'm new in the list so i'm sorry if this i'm posting is off-topic or it was already answered before. I'm having this problem; i've got an ext3 8GB partition and it doesn't mount, the cause of this: a user (yes me!) running fsck.ext3 with the filesystem mounted, ups! (snif, forgive me!!, totally newbie and mad) errors while booting: EXT3_fs error (device hda4):

Regarding this article (1) I have one question to make. What can I do to record the call if the agent makes a transfer using the "flash" button instead of "transfer button" or using blindxfer or atxfer defined in features. conf If the agent makes the transfer with "flash", the comunication between the person who is calling and is already in the queue and the target

Full_Name: George F. LeCompte Version: 1.6.1 OS: Windows 98 Submission from: (NULL) (208.8.162.161) This may be a newbie problem. I am attempting tor unt the simplex routine from the boot package. The example code doesn't find simplex. What's wrong here? > help(simplex,package=boot) > # from the resulting article > > # This example is taken from Exercise 7.5 of

Dear all, I am new to R, and I am a biotechnologist, I want to fit a smoothing spline with smoothing parameter selected by generalized maximum likelihood. I was wondering what function implement this, and, if possible how I can find the fitted results for a certain point (or predict from the fitted spline if this is the correct language) -- View this message in context:

Hi, i'm trying to install a compatible modem to act as a X100P, and i would appreciate some help here, this is what is hapening when i modprobe zaptel: # modprobe zaptel FATAL: Error inserting zaptel (/lib/modules/2.6.11-6mdk-i586-up-1GB/misc/zaptel.ko): Invalid module format firstly, i did: 'make clean' then 'make linux26' and then 'make install' into zaptel