similar to: WindowsXP connecting to Samba

Hi Everyone, I'm new to programming R and have accomplished my goal, but feel that there is probably a more efficient way of coding this. I'd appreciate any guidance that a more advanced programmer can provide. My goal -- I would like to find the length of the longest word in a string containing many words separated by spaces. How I did it -- I was able to find the length of the

Does anybody know a way to determine the longest run of a number in a vector of numbers? For example if I have the following numbers: 0 0 1 1 1 1 0 1 1 0 0 0 1 1; how can I determine that the longest run of 1's = 4 and longest run of 0's = 3? Thanks, Mark

Classification: UNCLASSIFIED Caveats: NONE Thanks for your quick response. The program you mentioned below available from R is based on number of runs (up or down) not based on a longest length of runs of same events. To be more specific, for example, from a series, HHTHTTTTHHH, the number of runs are 5, and the longest length of runs of the same events is 4. I'll check for the website you

On Dec 18, 2012, at 2:07 PM, Chandler Carruth <chandlerc at google.com> wrote: > On Tue, Dec 18, 2012 at 1:13 PM, Eli Bendersky <eliben at google.com> wrote: > On Tue, Dec 18, 2012 at 1:09 PM, Craig Topper <craig.topper at gmail.com> wrote: > > But its pretty easy to change the tabstop within the editor to make it > > readable. > > > > True, in

...if that is possible My task is to find the longest streak of continuous days a user participated in a game. Instead of writing an sql function, I chose to use the R's rle function, to get the longest streaks and then update my db table with the results. The (attached) dataframe is something like this: day user_id 2008/11/01 2001 2008/11/01 2002 2008/11/01 2003

Hi. The description of na.contiguous says: "Find the longest consecutive stretch of non-missing values in a time series object. (In the event of a tie, the first such stretch.)" But this seems not to be the case if one of the tied longest stretches is at the start of the sequence/series. In the following example, there are three stretches of length 3, so I expect the result

Hi, According to its man page substring() "expands (its) arguments cyclically to the length of the longest _provided_ none are of zero length". So, as expected, I get an error here: > substring("abcd", first=2L, last=integer(0)) Error in substring("abcd", first = 2L, last = integer(0)) : invalid substring argument(s) But I don't get one here:

Hello! Im trying to mount the ADMIN$ share of my windows XP and i cant! I can mount other shares. I do ./smbclient -L 192.168.0.18 added interface ip=192.168.0.1 bcast=192.168.0.255 nmask=255.255.255.0 session request to 192.168.0.18 failed (Called name not present) session request to 192 failed (Called name not present) Password: Domain=[WORKGROUP] OS=[Windows 5.1] Server=[Windows 2000 LAN

> > Maybe it's naive, but I would expect it to be easy for each backend to > > expose a constant N which is the length of the longest mnemonic, and then > > for the printer to pad to N+1 or N+2…. > > That would probably work for X86, but other targets (ARM in particular) > often have operands which are printed/parsed as suffices on the mnemonic > itself. Because

Hi, In R < 3.0.0, we used to get: > substring(c(A="abcdefghij", B="123456789"), 2, 6:2) A B A B A "bcdef" "2345" "bcd" "23" "b" But in R >= 3.0.0, we get: > substring(c(A="abcdefghij", B="123456789"), 2, 6:2) [1] "bcdef"

Can anyone shed some light on "rules" that might make the task of parsing the country code and city codes from a dialed number in the CDRs? I know that there is almost never a case where a concatenated country and city code could overlap with another country code, but what about city codes and local numbers? Is it possible for a concatenated city code and local number to match another

Hi to anyone who is willing to help, I have a csv. file which has 1999 horses as the rows and the age(in years) of the horse at each race as columns. Ive read this file into R and called it 'horses'. Im trying to find the longest break between each race in the horse's first year of racing. I already have a numeric called 'age.first' which is the age at which each horse had its

Hi, I just sent this to Steve Underwood, but then found a bunch of posts on the mailing list about similar issues.. does anyone have the fix? I'm running asterisk CVS-HEAD-06/28/04-18:13:13, spandsp 0.0.1k, libtif 3.5.7 one thing i just noticed is that calls come in with format '72' which is G711A-law or LinearPCM.. it uses PCM for the call, i assume this is ok the results of RxFAX

On Tue, Dec 18, 2012 at 3:36 PM, Tim Northover <t.p.northover at gmail.com>wrote: > > > Maybe it's naive, but I would expect it to be easy for each backend to > > > expose a constant N which is the length of the longest mnemonic, and > then > > > for the printer to pad to N+1 or N+2…. > > > > That would probably work for X86, but other targets

This email is not a question, but a potential solution to any who have had the same issue I have faced. If you have agents logged in to multiple queues at the same time, Asterisk does not handle the answering of those queues in any set order or sequence. It has no way of prioritizing calls in between the shared queues, to guarantee that the queue with the call that has the longest hold time

I have a matrix with NAs and want to extract the longest column. > is.matrix(foo) [1] TRUE > dim(foo) [1] 2000 75 > GetLength <- function(x) {length(na.omit(x))} > junk <- apply(foo, 2, GetLength) > junk [1] 1004 512 432 523 691 396 607 838 [9] 730 389 388 445 609 333 637 1024 [17] 1163 823 718 466 799 459 701 833 [25] 456 549 376 728 539 384

Classification: UNCLASSIFIED Caveats: NONE Hello, R users, Has anybody written a function for random test based on the length of longest run of same events. I really appreciate your help. Kyong Park Classification: UNCLASSIFIED Caveats: NONE [[alternative HTML version deleted]]

Hello all/Timo, Up until now, my main Clients office has consisted of a single location, and I have never had to deal with the situation of multiple locations for a single company. They have just told me that they are acquiring an additional floor at a building that is about 4 minutes away - but obviously far enough away that I now have to deal with supporting users in the same domain but at

Fellow R Users: I have a .csv dataset that I have brought into R via read.table (and also via read.csv). The dataset has columns that are not equal in length. Essentially, this data file has vectors/columns in which I plan to use different analyses on, hence they are unequal in length. Also, the columns are either numeric or calendar dates. Is there a way to prevent R from appending

Sorry to bore you more with the clock issue, but have you check /proc/zaptel/<span> to make sure it's not missing interrupts? There's also an option to record the audio for the fax, you could listen to that vs a recorded file that will receive correctly on a fax machine and see whether there is an obvious difference? (Good luck, that'll be really scraping the barrel!!) Does it