search for: harvesting

A few random observations: 1. Clang could do better with large but boring switches like this: http://embed.cs.utah.edu/embarrassing/jan_10/harvest/source/E8/E88C5111.shtml Performance of clang's output will be fine but this is a major code size lose. 2. Destruction of stupid loops is incomplete, sometimes due to phase ordering problems:

Is there a way to listen on port 25 for repeated dictionary attacks to harvest email address and blacklist that Ip with shorewall? Thanks, Mike

Just a warning to dovecot listmembers. The list is being harvested. test3943395 is a unique address I created only for communication to the dovecot list. The following spam came from: Received: from dial-dynamic-62-69-52-187.surfdial.murphx.net (dial-dynamic-62-69-52-187.surfdial.murphx.net [62.69.52.187]) by sasami.anime.net (8.11.6/8.11.6) with SMTP id j7FLxtv03775 for

First, I love R and am grateful to be using this free and extremely high quality software. Recently I have been comparing two algorithms and naturally I programmed in R first. It is so slow that I can almost feel its pain. So I decided to do a comparison with Java. To draw 500,0000 truncated normal, Java program takes 2 second and R takes 72 seconds. Not a computer science major, I find it hard

>> Repetitive code with lots of bitwise operations is compiled by LLVM into >> much larger code than the other compilers: >> >> http://embed.cs.utah.edu/embarrassing/jan_10/harvest/source/ED/ED37DAF5.shtml >> http://embed.cs.utah.edu/embarrassing/jan_10/harvest/source/1F/1F4003C7.shtml >> >> Note that this is straight-line code, so LLVM's output will

> Umm, can you find one that isn't a popcount implementation? Ok. MMX psadbw instruction: http://embed.cs.utah.edu/embarrassing/jan_10/harvest/source/CE/CE3DA132.shtml Position of first set bit: http://embed.cs.utah.edu/embarrassing/jan_10/harvest/source/1F/1F4003C7.shtml Log2 floor: http://embed.cs.utah.edu/embarrassing/jan_10/harvest/source/83/837A80E9.shtml Pixel format

On Tue, Jan 26, 2010 at 12:36 PM, John Regehr <regehr at cs.utah.edu> wrote: > 2. > Sometimes not: > > http://embed.cs.utah.edu/embarrassing/jan_10/harvest/source/EC/ECC74C0C.shtml The primary issue here is that scalar evolution doesn't know how to deal with loops using "sle" for the exit condition. Shouldn't be too hard to fix now that we have overflow flags

Just a quick note to those who care, I received a UCE this morning addressed to samba-337@ccp.com.au, the only place this was used was when emailing to this list. I can only conclude that either the list itself was harvested or someone has gone through the archive and harvested that. The Email actually came from 200.171.136.80 which has an abuse email address of abuse@telesp.net.br The Email

A spammer claiming to be '"Tim Saarela" <tim.saarela at dovecot.fi>' is sending out a pitch for "Enterprise Level Support" for Dovecot. The address of mine which he hit is only ever used for this mailing list, so it is clear that whatever the mechanism, this list is being harvested for commercial leads.

Not to stir the pot, but I notice my email address has recently been harvested from this list for spamming purposes. This email address is unique and not used for anything else. I'd distinguish this from spam sent to the mailing list itself, which is obviously different. Is there anything further that could be done to prevent this? -- Dave

R-Users, I am working with gplots (in gregmisc bundle) plotting some posterior probabilities (using barplot2) of harvest bag limits for discrete data (x-axis from 0 to 12, data is counts) and I ran into a couple of questions whose solutions have evaded me. 1) When I create and include the confidence intervals, the lower bound of the confidence intervals for several of the posterior probabilities

Hi there I'm trying to find the mle fo a multinomial model ->*L(N,h,S?x)*. There is only *N* I want to estimate, which is used in the number of successes for the last cell probability. These successes are given by: p^(N-x1-x2-...xi) All the other parameters (i.e. h and S) I know from somewhere else. Here is what I've tried to do so far for a imaginary data set:

On Tue, Jan 26, 2010 at 5:55 PM, John Regehr <regehr at cs.utah.edu> wrote: >>> Repetitive code with lots of bitwise operations is compiled by LLVM into >>> much larger code than the other compilers: >>> >>> >>> http://embed.cs.utah.edu/embarrassing/jan_10/harvest/source/ED/ED37DAF5.shtml >>> >>>

Quoting dovecot-e51 at deemzed.uk: > Not to stir the pot, but I notice my email address has recently been > harvested from this list for spamming purposes. This email address is > unique and not used for anything else. > > I'd distinguish this from spam sent to the mailing list itself, which is > obviously different. > > Is there anything further that could be done

Hi Everyone, I am looking into AMI (using PHP) to record every instance of HOLD that is generated by putting a caller on HOLD (press hold button on the phone set). There is no HOLD in Asterisk but the event Music on Hold is generated when HOLD is pressed. The complexity is that all of the the calls are handled by FreePBX so I don't have the channel IDs etc... Can someone please point out how

<HEAD> <BODY bgColor=#ffccff> <TABLE border=0 cellPadding=0 cellSpacing=0 width=475> <TBODY> <TR> <TD align=middle vAlign=top></TD></TR></TBODY></TABLE> <TABLE> <TBODY> <TR> <TD width="5%"></TD> <TD bgColor=#b8ecff borderColor=#0000ff width="90%"><FONT

...t least three already. The most recent one has the subject line "Introduction on ADSL" and a previous one had the subject line "A good tool". The messages are infected with the WORM_KLEZ.G virus in an attachment. I am not sure what mechanisms can be used to deter spammers from harvesting email addresses from lists, but something should be considered. One thing I know people have tried is to put blanks or other characters into the publicly displayed addresses on lists. This means that people can read the lists and figure out an email address, but simple automatic tools are foiled....

...ons, and say that it simplifies when it doesn't; on the other hand it should never say that an expression doesn't simplify when it does - that's would be a bug). You can get it like this: svn co svn://topo.math.u-psud.fr/harvest As explained in the README there are two main parts: (1) harvesting expressions from IR (currently only side-effect free integer expressions are supported), and (2) looking for simplifications. You can use it something like this to harvest IR sequences from the optimized clang output for a file, sort them by order of popularity, and look for ones that simplify:...

...t;-c(rep("bef",24), rep("after",40)) >abund<-runif(64, min=0, max=10) >harvest<-data.frame(abund, BA, H, site, year) Question 3. The authors use a complex anova design and here is part of their anova table which shows the design and the df. source.of.var df Harvesting(H) 1, 6 before-after(BA) 1, 6 H x BA 1, 6 Site(H) 6, 31 Year(BA) 6, 31 Site x BA 6, 31 Year x H 6, 31 Resid. 31 My question again is: Why can't I reproduce the results? When I try a simple anova without any random factors: >h...

Hi folks, I've posted an updated code size comparison between LLVM, GCC, and others here: http://embed.cs.utah.edu/embarrassing/ New in this version: - much larger collection of harvested functions: more than 360,000 - bug fixes and UI improvements - added the x86 Open64 compiler John