search for: inventive

On Tue, 2015-01-06 at 18:51 -0700, Warren Young wrote: > I think we?ll figure out something new to do with computers tomorrow. Certainly by Friday at latest. You seem to forget. Computers were invented to perform repetitive tasks. Computer usage should be serving mankind - not making it more difficult for mankind. -- Regards, Paul. England, EU.

Hi all, I apologize for this off-topic question but I need your help -- I know there are lots of experts here. As a lover and student of statistics, I am thinking of building a tree of various branches of statistics and keeping track of the greatest historical inventions/discoveries in statistics and the latest development of each branch. The goal is to understand in what context did the great

I have an interesting task for my son's lacrosse team... it is the time-old telephone tree... I am pretty sure someone has already done this w/*, why re-invent the wheel?... a) coach calls in leaves a msg, others call in retrieve the msg b) coach calls in leaves a msg, kicks of a call to every parent plays msg c) coach calls in leaves a msg, kicks off a call to every parent, checks for

Is there a function in R for calculating empirical cumulative distribution functions, i.e. the inverse of the quantile function? Perhaps in some library? I''d hate to have to re-invent the wheel. David Edwards, Biostatistics, Novo Nordisk A/S, Bagsværd, Denmark. DEd@novonordisk.com <mailto:DEd@novonordisk.com> Tlf: +45 44 42 62 35. Fax: +45 44 42 14 80 [[alternate HTML version

Hi, all! Anyone know an easy way to specify the following model. Panel dataset, with stock through time, by firm. I want to run a model of y on a bunch of explanatory variables, and one dummy for each firm, which is 1 for observations that come from firm i, and 0 everywhere else. I have over 200 firms (and a factor variable that contains a firm identifier). Any easy way of going about

I''m new to puppet and working my way through the documentation. I''m struggling with the puppet labs module repo. I''ve toyed with numerous automation and configuration methodologies over the decades. Perhaps I''m seeing puppet wrong, Compared with CFEngine there is a a lot I like, but I''m not sure why I''m still having to re-invent the

yah. iceS does that. in fact, i'm listening to all of my mp3's right now using less bandwidth than a 56k. (32kpbs) -----Original Message----- From: owner-icecast@xiph.org [mailto:owner-icecast@xiph.org]On Behalf Of Matthew Goward Sent: Monday, September 10, 2001 4:29 PM To: icecast@xiph.org Subject: [icecast] Hoping to not have to re-invent the wheel Anyone have a good way to knock my

On Sun, Mar 2, 2014 at 3:53 AM, Ferenc Wagner <wferi at niif.hu> wrote: >> And an official stat() implementation would be very useful. After >> inventing mine, I noticed rosh also invented its own... #include <sys/stat.h> int stat(const char *path, struct stat *buf); I invented my own in rosh after not having one in the libraries based on what I thought was the most

The standard chisq.test() and fisher.test() functions, when applied to two distributions (to determine whether the same underlying distribution applies to both) requires one to pre-bin the distributions. Is there a library function (either built-in or in a package) that acts more like the ks.test() function, in that one can simply pass the two distributions and have it do the necessary binning as

...tput. =================== One thing that stands out to me are that none of the primary claims seem to describe the technical format itself (ie, no algorithms, keywords, block sizes, byte-alignment, etc..) This means the claims at issue seem to be *methods* of data handling, (and not particularly inventive ones in my opinion). That suggests to me that with a little thought it should be possible to generate the same results via a method that doesn't infringe one of the 4 specific claims listed above. To clarify, despite all the technical mumbling in the abstract the claimed invention does not appe...

Hello! There is something I really don't get: As I ordered a PRI ISDN line in Germany with DID, I had not to pay anything for a "DID number block", now I'm trying to get a PRI ISDN in the U.S. (CA) and SBC wants to charge more than 200 USD/month for numbers. I mean, this has nothing to do with DID, where everything that comes after the "base number" will be

Anyone have a good way to knock my 160kbit mp3s down to 56k real time using *nix? Even if it is beta sorta working code, anyone have anything even close to fast enough to do this? matt --- >8 ---- List archives: http://www.xiph.org/archives/ icecast project homepage: http://www.icecast.org/ To unsubscribe from this list, send a message to 'icecast-request@xiph.org' containing only

It appears that Markdown will process ampersands contained within HTML comments if that comment is part of a markdown paragraph, but will not when that paragraph is contained within an HTML block of it's own (and therefore ignored by Markdown.) For example: This is a markdown paragraph with a comment that *will* be processed <!-- This & *will* be converted -->

On Wed, Aug 28, 2019 at 01:37:12PM +0800, Tiwei Bie wrote: > Details about this can be found here: > > https://lwn.net/Articles/750770/ > > What's new in this version > ========================== > > There are three choices based on the discussion [1] in RFC v2: > > > #1. We expose a VFIO device, so we can reuse the VFIO container/group > > based

On Wed, Aug 28, 2019 at 01:37:12PM +0800, Tiwei Bie wrote: > Details about this can be found here: > > https://lwn.net/Articles/750770/ > > What's new in this version > ========================== > > There are three choices based on the discussion [1] in RFC v2: > > > #1. We expose a VFIO device, so we can reuse the VFIO container/group > > based

> Sorry for coming to the discussion so late. I have a couple of questions/comments: Actually, you're note is timely, because I'm planning to send out a patch (as soon as I update LangRef and rerun tests) that supports safelen but *not* lexical dependences. I don't need the safelen for Julia, but having done the work and seeing that OpenMP needs it, feel that I should finish the

> If I understand correctly: > > %v1 = load i32, i32* %a > %v2 = load i32, i32* %b > %v3 = add i32 %v1, %v2 > store i32 %v3, i32* %c > > maps to (using invented mnemonics): > > ASSIGN R0, %a > ASSIGN R1, %b > ASSIGN R2, %c > ADD *R2, *R0, *R1 > > I.e. pattern > (store %c, (add (load %a), (load %b))) > becomes > (ADD (ASSIGN R2, %c), (ASSIGN

On Tue, Oct 29, 2019 at 07:19:25PM +0000, Tim Northover via llvm-dev wrote: > On Tue, 29 Oct 2019 at 19:11, Dmitriy Borisenkov via llvm-dev > <llvm-dev at lists.llvm.org> wrote: > > 2. Test with a dummy target. It might work if we have a group of contributors who is willing to rewrite and upstream some of their downstream tests as well as to design and implement the target

It seems people are reinventing the wheel here: The goal is to generate all combinations of 1:n of size k. This (typically) results in a matrix of size k * choose(n,k) i.e. needs O(n ^ k) space, hence is only applicable to relatively small k. Then alternatives have been devised to generate the combinations "one by one", and I think I remember there has been a quiz/challenge about 20

I was under the impression his answer was correct from your reply, no? On Oct 17, 2016 17:45, "Alex Bradley via llvm-dev" <llvm-dev at lists.llvm.org> wrote: > Gentle Ping !! > > I would appreciate any help on this. I want to generate following as > described by Krzysztof : > > %v1 = load i32, i32* %a > %v2 = load i32, i32* %b > %v3 = add i32 %v1, %v2 >