search for: degredes

Just wanted to let anyone know that might have checked out the generator before and couldn''t use it b/c you''re project required graceful degredation. Well its in there now. Thanks everyone and enjoy. Demo: http://ajaxscaffold.height1percent.com Release Notes: http://www.height1percent.com/articles/2006/03/04/ajaxscaffold-2-2-0-released-with-graceful-js-degredation -- Richard

I've been running Samba v 2.07 for over a year on a small sub network with excellent results. Win NT 4.0, Win 98, and Win 95 machines all connected properly, and transfer speeds and reaction time is quite good. One of the Win NT machines was just upgraded to run Windows 2000. The connectivity still works, but I noticed a severe degredation in transfer speeds to and from the Windows 2000

OK - good to know. (not sure we're talking about pessimizing it - just not adding a new/possible optimization, to be clear) Just out of curiosity - are there particular reasons you prefer or need to ship an MSVC built version, rather than a bootstrapped Clang? On Mon, Nov 28, 2016 at 9:24 AM Robinson, Paul <paul.robinson at sony.com> wrote: > So I wouldn't personally worry too

On Fri, Nov 25, 2016 at 6:10 AM Mueller-Roemer, Johannes Sebastian via llvm-dev <llvm-dev at lists.llvm.org> wrote: > What about going for > > template<unsigned N> > constexpr StringRef(const char (&Str)[N]) > > and avoiding strlen entirely for string literals? > You'd at least want an assert in there (that N - 1 == strlen(Str)) in case a StringRef is

I'm not sure if this question makes sense, but here goes. We have the need to periodically check for newly created/modified files in a rather elaborate and well populated directory structure. I don't believe that simply walking the directory and checking stat's is the answer, given that I need a process that will impose minimal performance degredation on the system. Would it be

Hi, It seems there must be a better way to do this than what I am currently doing. I have a simple app that collects a users thoughts along with their email address and their first an last name. On a page that lists all the users thoughts they can click on a link to "add a thought" which then displays a form with ajax. My current methodology for this is not very dry. If js is

Hi all, With a rails app running under lighttpd, we''ve recently stopped using lighttpd''s URL rewriting in favour of letting Rails'' routes do their job. However, under proper testing, we now see the application slowing down after a period of time (a couple of days); pages take increasingly longer to load over time. This is fixed by a lighttpd restart. Could this

On Mon, Nov 28, 2016 at 11:01 AM Mehdi Amini <mehdi.amini at apple.com> wrote: > On Nov 28, 2016, at 9:47 AM, David Blaikie via llvm-dev < > llvm-dev at lists.llvm.org> wrote: > > OK - good to know. (not sure we're talking about pessimizing it - just not > adding a new/possible optimization, to be clear) > > > This does not seem that clear to me. The

Can anybody point me at any resources that would explain how to optimize mdct_backward for a cpu with a fused multiply-accumute unit? >From what I understand from responses to my older postings, Tremor's mdct_backward could be rewritten to take advantage of a muladd. My target machine can do either two-wide 32x32 + Accum(64) -> Accum(64) integer muladd or eight-wide 16x16 + Accum(32)

On Thursday 23 July 2009 18:07, Evan Cheng wrote: > Ok. As with any heuristics change, some tests will benefit, some will > suffer. I am ok with both sets of changes assuming there are ways to > control them. Yep, we have flags. > Post-ra scheduling has been working for a while. The reason it's not > turned on for x86 is it's not helping much (1 or 2%) while the compile

We have several latency-sensitive "pipeline"-style programs that have a measurable performance degredation when run on CentOS 5.x versus CentOS 4.x. By "pipeline" program, I mean one that has multiple threads. The mutiple threads work on shared data. Between each thread, there is a queue. So thread A gets data, pushes into Qab, thread B pulls from Qab, does some processing,

This creates a named vector of length nx, then repeatedly draws a single sample from it. lkup <- function(nx, m=10000L) { tbl <- seq_len(nx) names(tbl) <- as.character(tbl) v <- sample(names(tbl), m, replace=TRUE) system.time(for(k in v) tbl[k], gcFirst=TRUE) } There is an abrupt performance degredation at nx=1000 > lkup(1000) user system elapsed 0.180

The fact that the templatized constructor falls down because of the possibility of initializing StringRef with a stack-allocated char array kills that idea in my mind. I feel like the only two reasonable solutions are 1) allow UDL for this case, document that this is an exception and that UDLs are still not permitted anywhere else, and require (by policy, since I don't know of a way to have

....no> > Hello > > > > I understand you are the project leader of Nut. > > > > In my company we have a Eaton 9135 6000 UPS, we are running NUT 2.4.1 > (Debian squeeze) > > > > The ups is connected with a USB cable but it reports a temperature of 300 > degredes. > > > > Can I send you guys any debug info so this can be fixed in later releases ? > sure. please, send me the output of upsc. a driver debug trace is also welcome (using /path/to/driver -DDD -a <upsname>) cheers, Arnaud -- Linux / Unix Expert R&D - Eaton - http://www....

I've come full circle on the Ogg text stream format, back to arbitrary associated xml streams. What's changed? Mostly rolling the requirements around in my head, and weighting them differently. I think we've dealt with the complexity issue; this functionality can be optional for "dumb" audio players, and possibly also for dumb video players, though there it's a smaller

hi, Cant find any information this anywhere so was wondering if anyone had any ideas. Basically when you go to basecamp.com it allows you to sign up for a account and gives you a url username.projectpath.com I was just wondering how they do this, and if each account has there own database or if it is all stored in one. thanks scott -- Posted via http://www.ruby-forum.com/.

Hello, I have this rare and weird problem in the encoder : when I encode and decode this specific speech sample (Attached) the first frame comes out wrong. I found that the error is in the encoder. My settings are : Version 1.2beta2, on linux, in floating point. Wideband. The highpass filter turned off. Perceptual enhancment is turned off. Quality is 9. The weird thing about it is that if I use

I am analyzing particulate matter data (PM10) on a small data set (147 observations). I fitted a semi-parametric model and am worried about overfitting. How can one check for model fit in GAM? Jean G. Orelien

I've tried timing faxes two ways:

On Jul 23, 2009, at 12:42 PM, David Greene wrote: > We have two features for register allocation we'd like to contribute > if folks > think they are worthwhile. We want to get a read on whether they > will be > useful to people. > > The first features backschedules reloads during the spilling phase. > As > reloads are generated, we have some very simple code