search for: weeds

i was wondering how a blog db has grown by about 15 mb in a week or two. it turns out its the sessions table.. so ive tried this: class ApplicationController.. session :off end class AccountController session :only, :login end and now, its impossible to login, and nothing ever appears in the session table. is this the right approach? i dont want to weed out the sessions with cron, i just

Looking for some guidance, I seem to be caught in the weeds. I want to do a search on fields in a master/detail relationship. E.g. manufacturer owns many parts. I want to search on the manufacturer name, part name and part number, then return the full set of results. I have tried to use the .find method and create my own model .find method using a S...

I have a problem that deals with correlating wind velocity to seed collection data. The problem lies in that I have a wind data set that is contains 2000+ data points and weed collection data on the order of a couple hundred. Both data sets were collected for the same time period, but there is not a one-to-one wind velocity->seed location match. My understanding of correlation is that you

I ran into a weird problem while writing my own little guide to Markdown (using Markdown, of course). The document is mostly made of list items in nested ul's. As I neared the end, I found (via MarsEdit's preview) that in place of two sections of content, Markdown had begun to generate gibberish strings like this: aa9ca05a7c006bc5e5c091c00aee0cd7 After weeding through different

Hi, My mail server is running on CentOS 7 with Postfix, Dovecot and Spamassassin. I get quite a lot of spam on a few accounts, and Spamassassin does its job fine. Spam mail is identified correctly, and it looks like there are no false positives, e. g. valid mail is never identified as spam. When a message is flagged as spam, the subject line is rewritten to begin with [SPAM]. Then, a filter in

Hi all, I want to implement a captcha on my register page to help weed out any ''non-human'' visitors. I was told to check out http://expressica.com/simple_captcha/ but the site isnt responding. Does anyone have any other reccomendations that are tried and tested & successful? Many Thanks -- You received this message because you are subscribed to the Google Groups

Jeff, I wanted to let you know that your function is faster than generating the directional circular permutations and weeding. Here is the time for n = 10. I compared with just doing the permutations, there is no point in proceeding further with the weeding since it is slower at the start itself. system.time(directionless_circular_permutations(10)) user system elapsed 1.576 0.000

Every once in a while a user cannot connect to one of two samba servers. Most of the time (but not always), if he waits 15 minutes to an hour, he can connect successfully. Sometimes he can connect to one server, but not the other, which have the same configuration. We are using authentication from the NT server. Samba version 2.0.3 The messages in the log file are are shown below. In this

I''m porting an old site of mine into Rails and I''m running into some duplication that could / needs to be weeded out. For each of my actions, I have to wrap the view content in the following HTML: <div class="box"> <img src="/images/content-top2.png" class="border" /> <div class="visible"> # content

I don't know if this is more efficient than enumerating with distinct directions and weeding... it seems kind of heavyweight to me: ####### library(gtools) directionless_circular_permutations <- function( n ) { v <- seq.int( n-1 ) ix <- combinations( n-1, 2 ) jx <- permutations( n-3, n-3 ) x <- lapply( seq.int( nrow( ix ) ) , function( i ) {

Thanks Chris, I was able to weed out loop invariant arithmetic instructions using isLoopInvariant function. when i try to do an instruction->moveBefore(bb->getTerminator()) i'm getting a seg fault. any obvious reasons that i'm missing out on? Thanks in advance On Wed, Nov 17, 2010 at 10:41 PM, Chris Lattner <clattner at apple.com> wrote: > > On Nov 17, 2010, at 2:20

New function below is a bit faster due to more efficent memory handling. for-loop FTW! directionless_circular_permutations2 <- function( n ) { n1 <- n - 1L v <- seq.int( n1 ) ix <- combinations( n1, 2L ) jx <- permutations( n-3L, n-3L ) jxrows <- nrow( jx ) jxoffsets <- seq.int( jxrows ) result <- matrix( n, nrow = factorial( n1 )/2L, ncol = n ) k

...are less than 'x'. An example would be: sapply(x,FUN=function(i) {length(which(y<i))}) [1] 0 0 0 0 1 2 2 3 3 4 But this solution is far too slow when x and y have lengths in the millions. I'm certain an elegant (and computationally efficient) solution exists, but I'm in the weeds at this point. Any help is much appreciated. Kevin University of Manchester Take two vectors x and y, where y is a subset of x: x=1:10 y=c(2,5,6,9) If y is removed from x, the original x values now have a new placement (index) in the resulting vector (new): new=x[-y] index=1:length...

Thanks for all the comments on the 3Com phones. Thankfully, there is a large number of phones out there to dig through looking for the right solution. What I have not been able to find, after spending all weekend looking, is a good solution for an attendant console. We have 2 receptionists that need to be able to view all 60+ phones (we could probably weed it down a bit if we had to,

Thanks! Yes, however, this seems a bit wasteful. Just wondering if there are other, more efficient options possible. Best wishes, Ranjan On Thu, 29 Mar 2018 22:20:19 -0400 Boris Steipe <boris.steipe at utoronto.ca> wrote: > If one is equal to the reverse of another, keep only one of the pair. > > B. > > > > > On Mar 29, 2018, at 9:48 PM, Ranjan Maitra

The funny thing is that i am manually able to hoist the Loop invariant instruction to the basicBlock terminator, by editing the human readable form and then using llvm-as to convert it into bytecode. On Thu, Nov 18, 2010 at 4:01 AM, Chris Lattner <clattner at apple.com> wrote: > > On Nov 17, 2010, at 1:38 PM, Sreeraj a wrote: > > > Thanks Chris, > > > > I was

The ATS community is having trouble with clang. They had been using an older version of clang and upgraded because newer versions give higher quality warning messages. Unfortunately, with 3.5, moving from -O1 to -O2 triggers a crash on startup in the clang-generated executable. I had suggested building with -fsanitize=undefined and -fsanitize=address to weed out any dependencies undefined

...d.sourceforge.net/installers.php) I feel confident I can write a short script for Puppet to "exec" on my hosts to silently install most of what I need. What I can''t decide on a "best" way to test if the software has already been installed. I am likely "off in the weeds" and could use some help getting back. Here are what I think my choices are, I make no claim to their sanity. 0.) I think using the "package" provider in puppet will not work if the program installed did not use the MSI installer.(?) 1.) Check for existence of a file known to be i...

Dear List I apologize for the multiple postings. After being in the weeds on this problem for a while I think my original post may have been a little cryptic. I think I can be clearer. Essentially, I need the following a <- c(2,3) b <- c(4,5,6) (2*4) + (2*5) + (2*6) + (3*4) + (3*5) +(3*6) But I do not know of a built in function that would do this. Any suggestio...

On Nov 17, 2010, at 1:38 PM, Sreeraj a wrote: > Thanks Chris, > > I was able to weed out loop invariant arithmetic instructions using isLoopInvariant function. > when i try to do an instruction->moveBefore(bb->getTerminator()) i'm getting a seg fault. > any obvious reasons that i'm missing out on? No idea, sorry. -Chris