search for: liblit

...The Samba box will not be a domain controller; it's just going to be a nondescript member of the domain. The primary domain controller is running Windows 2000, but is also configured to emulate an NT4 PDC. Our system administrators did their side of things, and told me that user "domain\liblit" now has permission to add machine "zubzub" to the "domain" domain. I became root on "zubzub" and ran the following command: # smbpasswd -j DOMAIN -r PRIME As you can probably guess "DOMAIN" is the name of the domain. "PRIME" is the name...

I would like to use R to perform a logistic regression with about 30,000 independent variables. That's right, thirty thousand. Most will be irrelevant: the intent is to use the regression to identify the few that actually matter. Among other things, this calls for giving glm() a colossal "y ~ ..." formula with thirty thousand summed terms on its right hand side. I build up the

...vm.org/~vadve On Aug 11, 2011, at 6:24 AM, <llvmdev-request at cs.uiuc.edu> wrote: > Date: Wed, 10 Aug 2011 23:44:14 -0500 > From: Will Dietz <willdtz at gmail.com> > Subject: Re: [LLVMdev] EQTDDataStructures omits obvious, direct callee > from DSCallGraph > To: Ben Liblit <liblit at cs.wisc.edu> > Cc: llvmdev at cs.uiuc.edu > Message-ID: > <CAKGWAO-Co6V0VFTHRyjpq9MQNPsv9Wo+36=vFTczhFgwB9Ks5g at mail.gmail.com> > Content-Type: text/plain; charset=ISO-8859-1 > > On Tue, Aug 9, 2011 at 10:45 PM, Ben Liblit <liblit at cs.wisc.edu> w...

.... Ripley, you mention the theory of perceptrons. Could you please point me to an introduction paper or book? Thanks in previous, Dominik > -----Original Message----- > From: ripley at stats.ox.ac.uk [mailto:ripley at stats.ox.ac.uk] > Sent: dimanche, 10. novembre 2002 18:55 > To: Ben Liblit > Cc: r-help at stat.math.ethz.ch > Subject: Re: [R] building a formula for glm() with 30,000 independent > variables > > > Well, the theory of perceptrons says you will find perfect > discrimination > with high probability even if there is no structure unless n > is...

On Tue, Aug 9, 2011 at 6:19 PM, Ben Liblit <liblit at cs.wisc.edu> wrote: > I am using EQTDDataStructures (from the poolalloc project) to resolve > indirect function calls to over-approximated sets of possible callees. If I remember correctly, it only tries to resolve indirect calls. The analysis doesn't track direct calls...

On Wed, Aug 10, 2011 at 10:37 AM, Ben Liblit <liblit at cs.wisc.edu> wrote: > Equally strange: if I comment out the "base->virt();" call, then DSCallGraph > *does* give the expected answer that "(unknown ? red : blue)()" could call > either red() or blue() but not Base::virt(). Somehow having that > vt...

Using ssh-keygen from OpenSSH-2.9p1, I can perform the following key conversions: - convert a commercial public key into an OpenSSH public key: % ssh-keygen -i -f commercial-key.pub > openssh-key.pub - convert a commercial private key into an OpenSSH private key, provided that the commercial key has no password % ssh-keygen -i -f commercial-key > openssh-key -

On Tue, Aug 9, 2011 at 10:45 PM, Ben Liblit <liblit at cs.wisc.edu> wrote: > Andrew Lenharth wrote: >> If I remember correctly, it only tries to resolve indirect calls.  The >> analysis doesn't track direct calls because you can do it just as well >> yourself. > > DSCallGraph::callee_begin() and DSCallGra...

On Wed, Aug 10, 2011 at 1:39 PM, Ben Liblit <liblit at cs.wisc.edu> wrote: > The first of those two calls is a vtable dispatch; the ideal answer would be > Base::virt() const and Derived::virt() const, without red() and blue(). >  Still, vtable lookups are complex, so I could imagine an over-approximation > here. > >...

I am using EQTDDataStructures (from the poolalloc project) to resolve indirect function calls to over-approximated sets of possible callees. Unfortunately I find that it yields incorrect results even on a very simple test input. My LLVM and poolalloc sources are Subversion trunk checkouts, no more than a day older than the current trunk head. My test input is the following C source,

Andrew Lenharth wrote: > If I remember correctly, it only tries to resolve indirect calls. The > analysis doesn't track direct calls because you can do it just as well > yourself. DSCallGraph::callee_begin() and DSCallGraph::callee_end() cooperate to iterate over an empty set (EmptyActual) for any call site not found in the ActualCallees map. So if direct calls are not tracked,

On Thu, Aug 11, 2011 at 11:10 AM, Ben Liblit <liblit at cs.wisc.edu> wrote: >        volatile int unknown; > >        static void red() { } >        static void blue() { } > >        int main() >        { >          (unknown ? red : blue)(); >          return 0; >        } > > If I save this as "...

I wrote: > I'll keep poking at this some more and let you folks know if I hit any other surprises. Well, that didn't take long. :-) I have found two new surprises in DSCallGraph as built by TDDataStructures. Consider the following program, which is complete and self-contained and which has one simple indirect call site: volatile int unknown; static void red() { } static void

In an earlier message (http://lists.cs.uiuc.edu/pipermail/llvmdev/2011-August/042298.html), Andrew Lenharth suggested that EQTDDataStructures (from the poolalloc project) may only try to resolve indirect function calls. However, I am now finding that the generated DSCallGraph over-approximates the callees in a very simple indirect call. Some over-approximation is unavoidable, but this case

John Criswell wrote: > 1) I'll try out your example C++ code below and see if I can get the > same results that you do. However, I'm at a conference right now (Usenix > Security), so I don't know exactly when I'll get to it. Excellent. Thanks, John! > 2) DSA can get pessimistic results when dealing with external code (as > Andrew described). It is designed for

Will Dietz wrote: > This is actually the expected behavior for EQTD :). Expected by you, maybe. :-D > If you switch to TD you'll get better alias-analysis information, and > in this example the correct result. OK, I have switched to TDDataStructures as well, and I am also seeing much better (for my purposes) results in simple tests. I'll keep poking at this some more and

As suggested in my earlier message, I have a large population of independent variables and a binary dependent outcome. It is expected that only a few of the independent variables actually contribute to the outcome, and I'd like to find those. If it wasn't already obvious, I am *not* a statistician. Not even close. :-) Statistician colleagues have suggested that I use logistic

...e how well it is working. We'll be shaking down mainline DSA as we integrate it into an optional libLTO replacement for use with the SAFECode memory safety compiler. DSA for LLVM 2.7 is still available in the release_27 branch of the poolalloc project. -- John T. On 8/10/11 8:37 AM, Ben Liblit wrote: > In an earlier message > (http://lists.cs.uiuc.edu/pipermail/llvmdev/2011-August/042298.html), > Andrew Lenharth suggested that EQTDDataStructures (from the poolalloc > project) may only try to resolve indirect function calls. However, I > am now finding that the generat...

Is a ".journal" file supposed to be visible in root directories of ext3 filesystems? I have two ext3 filesystems on a single box. One, mounted as "/", has a visible ".journal" file in the root directory. The other, mounted elsewhere, does not. What's the story here?

I recently applied the ext3-2.4-0.9.6-249.gz patch to an otherwise unmodified official-from-Linus 2.4.9 kernel. I built both ext2 and ext3 in as modules, did the "tune2fs -j" incantation, and rebooted. Mounting / as ext3 worked fine. But a few seconds later, my startup scripts tried to launch a squad of automounter daemons, and that didn't work so well. A stream of kernel