similar to: ssh-agent for kerberos-like authentication to my own daemon?

Dear R helpers, I have a largish matrix (1300 x 1300) and I wish to find the row and column numbers that identify particular elements whose values I know in advance (for example, the row and column numbers for the maximum value of the matrix). I have looked in the help manual and found the functions 'row' and 'col' for finding the indices of a matrix. But, I can't figure out

Hello all, I''m looking to setup a simple network "pasteboard" for files within my organization, to circumvent people trying to email 50 meg files and me being unwilling to open up our mail server for massive email transfers. I''ve seen the pasteboard idea elsewhere where you can go and paste code or log files or whatever, and then they just fall off an hour or a day

I've got a set of data that are weighted by a largish integer (ranging from about 50K to 1.5 million). I'd like to plot CDF's for this data taking into account the weighting. What do you recommend? Thanks! -- Russell Senior ``The two chiefs turned to each other. seniorr at aracnet.com Bellison uncorked a flood of horrible

On Jun 29, 2007, at 3:57 PM, Chris Lattner wrote: > On Fri, 29 Jun 2007, John Criswell wrote: >> Chris Lattner wrote: >>> On Fri, 29 Jun 2007, John Criswell wrote: >>>> The LLVM web server is up and running, but we're still working >>>> on some >>>> subversion configuration issues. The server may go up and down >>>>

Hi FETCHing a largish (~30K) zlib compressed maildir message causes an assertion failure on an attempt to grow the stream buffer to smaller than its current size. I believe the attached patch fixes this. -------------- next part -------------- A non-text attachment was scrubbed... Name: istream-zlib.c.patch Type: application/octet-stream Size: 416 bytes Desc: not available URL:

I am working with a largish dataset of 25k lines and I am now tying to use predict. pred = predict(cuDataGlmModel, length + meanPitch + minimumPitch + maximumPitch + meanF1 + meanF2 + meanF3 + meanF4 + meanF5 + ratioF1ToF2 + rationF3ToF1 + jitter + shimmer + percentUnvoicedFrames + numberOfVoiceBreaks + percentOfVoiceBreaks + meanIntensity + minimumIntensity + maximumIntensity +

Hi, Is there any way of doing 'grep' ore something like it on the content of a text file and extract the byte positioning of the match in the file? I'm facing the need to access rather largish (>600MB) XML files and would like to be able to index them ... Thanks for any help or flogging, Joh

Hi there, I have a largish optimisation problem (10 years of daily observations). I want to optimise between 4 and 6 parameters. I'd like to utilise parallel computing if I can as I will have to run it with different starting values etc. I have a quad core PC with 16GB ram running windows 7. Having done a little reading it seems the two best options for me are: 1.) Use the academic

I have a largish dataset (1025) with around .15 of the data missing at random overall, but more like .25 in the dependent variable. I am interested in modelling the data using quantile regression, but do not know how to do this with multiply imputed data (which is what the dataset seems to need). The original plan was to use qr (or whatever) from the quantreg package as the 'fitter'

Hi, I have a couple of old samba 3.0.30 installations. I enabled the "use kerberos keytab" option in the smb.conf file to aquire a tgt automatically when a user logs in. This works fine on 3.0.30 installs. On newer samba versions I recognized that the option has been phased out and replaced by a newer option called "kerberos method" the man page is not really clear about what

Greetings- The subject sums it up... I have a Dell 2950 acting as a general purpose 'storage' machine, handling some NFS work for some local servers, and also pulling in rsync backups of some largish filesystems over SSH. These backups, prior to the upgrade were taking about 6 hours to complete (MANY small files). Now, after the upgrade, the same backups are taking about 16 hours to

Hello all. This is a question that I should be able to answer, but the old grey cells aren't working. My Google-Fu must not be up to snuff, either. I have a MOXA IP-RS232 converter that I'm going to be using over an RF WAN and I need to confirm the actual data rate that I'll be able to achieve. I have the drivers loaded (/dev/ttyr00) and a loopback plug on the end of the device. I

https://bugzilla.mindrot.org/show_bug.cgi?id=92 --- Comment #2 from Damien Miller <djm at mindrot.org> 2008-06-29 18:57:03 --- Created an attachment (id=1536) --> (http://bugzilla.mindrot.org/attachment.cgi?id=1536) delay fork when ExitOnForwardFailure set This is quite easy now that we have proper request callback queues, but I don't think we need a funny non-idempotent

https://bugzilla.mindrot.org/show_bug.cgi?id=92 Damien Miller <djm at mindrot.org> changed: What |Removed |Added ---------------------------------------------------------------------------- Status|NEW |RESOLVED Resolution| |FIXED --- Comment #4 from Damien Miller <djm at

I have an issue with silent calls when an agent gets a call from the queue What happens is - The system dials a call (agent call) - The caller picks up - Asterisk sees the person picked up - Transfered to an agent - Agents phone automaticly picks up (sjphone auto accept on) -The user hears nothing says "Hello, Hello, Hello ???" - Asterisk sees agent as 'Available'

Dear R users we're having a problem reading a largish data file using read.table(). The file consists of 175000 lines of 4 floating pt numbers. Here's what happens: > dat_read.table('sst.dat') Error: memory exhausted (This is line 358 of src/main/memory.c). Cutting down the file to around 15000 lines allows read.table() to work OK. I edited the memory limits in Platform.h

per IRC discussion, >From a1d982bf49e166341096902fc4c103d4397ce0e3 Mon Sep 17 00:00:00 2001 From: Jim Meyering <meyering at redhat.com> Date: Tue, 11 Aug 2009 13:16:27 +0200 Subject: [PATCH libguestfs] daemon/ls: make do_ll require root, like all the rest * ls.c (do_ll): Do invoke "NEED_ROOT" here, and add a FIXME to provide a "debug ll" command with the semantics

Is there a generic binary search routine in a standard library which a) works for character vectors b) runs in O(log(N)) time? I'm aware of findInterval(x,vec), but it is restricted to numeric vectors. I'm also aware of various hashing solutions (e.g. new.env(hash=TRUE) and fastmatch), but I need the greatest-lower-bound match in my application. findInterval is also slow for

Hi, I have a largish index [700MB] which is updated from time to time, requiring me to close and recreate the Ferret::Search::Searcher to use the latest index. My problem is that the first few searches on the new index are slow [by comparison to before the close/recreate], I''m guessing because the new index is being loaded into RAM by my OS and into Ferret as needed. I''m

Hi all, first post here... reposting this from Stack Overflow as it didn''t get much traction there... I am using puppet to read a fact from facter, and based on that I apply a different configuration to my modules. Problem: the puppet agent isn''t seeing this fact. Running puppet agent --test interactively works as expected. Even running it non-interactively from a script