search for: worst

Hi Jean-Marc, Thanks for your response. Given a worst case scenario, what is the "worst case" latency (in terms of Speex frames) that the jitter buffer algorithm will incur? We're trying to determine the worst case hard number. Sorry for unclear question below; what I was trying to ask is that given a worst case latency (which I'm...

...mulation (HS) is just taking sample percentiles over a moving sample. Suppose we want to use HS to predict a portfolio's Value-at-Risk at a confidence level of 99 percent and the window size is chosen to be 250 trading days. Then the 1 percent sample percentile is some amount between the second worst portfolio loss and the third worst portfolio loss (since 250 ? 0.01 = 2.5). We decide to determine the Value-at-Risk through interpolation; in this case the VaR lies halfway between the second worst portfolio loss and the third worst portfolio loss. Benjamin

On 5/7/2015 4:56 AM, Timothy Murphy wrote: > The worst thing about BackupPC is the insane error message > "Unable to read 4 bytes", which comes up if anything is wrong. > Possibly the worst error message anywhere? thats an rsync protocol message, and yeah, debugging connection/authentication issues is a bit ugly. -- john r pierce,...

...as many as half the size of r[] itself. I can't see an algorithmically (compile-time or run-time) way to guarantee that the number of clusters will be small without scanning the whole array. So, even if you add such a check in run-time and only vectorize if the number of clusters is small, the worst case scenario will run twice as many times, (the initial check can be vectorized, as it's a read-only loop), but the later cannot. in the best case scenario, you'll have only a handful of loops, which will run in parallel. Worst case: n/VF + n Best case: n/VF + ammortized n/VF For VF == 2...

...takes this long, then there's something else wrong. It should be > well under a tenth of a second (and probably closer to 1/100). No, nothing wrong, at least darkice is doing very badly. With darkice as encoder at about 30 kbps, there are about 3 buffers per second, which mean that in the worst case, a client must wait 2/3 seconds in order to start receiving. In the best case in 1/3 seconds. That means the improvements is among 0.66 and 0.33 seconds (ish). <p><p> -- ricardo galli GPG id C8114D34 --- >8 ---- List archives: http://www.xiph.org/archives/ icecast...

...SYSLOG NOTIFYFLAG LOWBATT SYSLOG NOTIFYFLAG FSD SYSLOG NOTIFYFLAG COMMOK SYSLOG NOTIFYFLAG COMMBAD SYSLOG NOTIFYFLAG SHUTDOWN SYSLOG NOTIFYFLAG REPLBATT SYSLOG NOTIFYFLAG NOCOMM SYSLOG NOTIFYFLAG NOPARENT SYSLOG The 'wall' messages (message.exe) don't pop-up and worst case, I had so many message.exe's running that all memory was consumed. This is because Windows hasn't allowed services to interact with the desktop for some time. Maybe it works pre-Vista. The worst case is probably because upsmon will log a problem every poll interval until it's...

Are there any possible undesirable effects of a BIOS upgrade? The worst I can think of is something that would change my SATA drives from being mapped as SCSI to being mapped as IDE. Ted Miller Indiana

Hello people I'm studying worst case execution time calculation (WCET) and I'm planing use LLVM to develop a tool to calculate the maximum execution time of a real time program. Is there any project or initiative of using LLVM to real time systems and, specifically to calculate execution times? Does anyone have any hint? I&...

..._VAL) succeeds the > spin_unlock() must do the hash lookup, right? We can make the lookup > unhash. > > If the cmpxchg() fails the unlock will not do the lookup and we must > unhash. The idea being that the result is that any lookup is guaranteed to find an entry, which reduces our worst case lookup cost to whatever the worst case insertion cost was.

..._VAL) succeeds the > spin_unlock() must do the hash lookup, right? We can make the lookup > unhash. > > If the cmpxchg() fails the unlock will not do the lookup and we must > unhash. The idea being that the result is that any lookup is guaranteed to find an entry, which reduces our worst case lookup cost to whatever the worst case insertion cost was.

> -----Original Message----- > From: centos-bounces at centos.org [mailto:centos-bounces at centos.org] On > Behalf Of Timothy Murphy > Sent: den 7 maj 2015 23:21 > To: centos at centos.org > Subject: Re: [CentOS] Backup PC or other solution > > >> The worst thing about BackupPC is the insane error message > >> "Unable to read 4 bytes", which comes up if anything is wrong. > >> Possibly the worst error message anywhere? > > > > thats an rsync protocol message, and yeah, debugging > > connection/authenticati...

Hi, I have seen and heard many cases of ext3 corrupted after abnormal powerdown (e.g. missing all the files in one directory). yes, UPS should help, but wonder what kind of worst scenario will ext3 present after powerdown. messed up meta data has been seen in many cases, for example, the in-direct block of one inode contains garbage, which causes the automatic fsck failed to work and user has to repair the file system manually (and always result in some missing files). sh...

Hi All, As specified in earlier email we have released the trial version of the ogg vorbis decoder. Along with the decoder we have released an experimental version of the bitrate peeler that we have used to test the decoder for bitrate peeled inputs. We have made the executable of the bitrate peeler available from our website downloads section. www.vinjey.com/ogg_downloads.html

The wine font problem is well known, every week there are users reporting font problems on this list. Now have this problem, too: I installed some additional fonts on my system, now text is unreadable in wine. Wine is obviously too stupid to decide which font to use, but why can't it just always default to some standard X font? Philipp

I'm sorry but I will not make an account for every thing. Take note if you want: Programs as eMule (emule original) doesn't work now, with the lastest version of Wine.

Ira, obj_name<- load("arun.RData") Pred1<- get(obj_name[1]) Actual1<- get(obj_name[2]) dat2<- data.frame(S1=rep(Pred1[,1],ncol(Pred1)-1),variable=rep(colnames(Pred1)[-1],each=nrow(Pred1)),Predict=unlist(Pred1[,-1],use.names=FALSE),Actual=unlist(Actual1[,-1],use.names=FALSE),stringsAsFactors=FALSE) dat2New<- dat2[!(is.na(dat2$Predict)|is.na(dat2$Actual)),] ?dat3<-

...nged. The problem is that in the backend, we emit a function at a time, from DAG formation to object emission. So no two MachineFunctions ever exist at any one time. Changing this necessarily means increasing memory usage. I've prototyped this change and have measured peak memory usage in the worst case scenario - LTO'ing llc and clang. Without further ado: llvm-lto llc: before: 1.44GB maximum resident set size after: 1.68GB (+17%) llvm-lto clang: before: 2.48GB maximum resident set size after: 3.42GB (+33%) The increases are very large. This...

Hello llvm-dev! We are currently building a tool using LLVM which statically computes the worst-case stack depth for programs whose call-graphs are statically constrained. While this task is undecidable for general programs, we specifically plan to use it to analyze all entry points into Zircon’s kernel and the vDSO. Currently, without such a tool, the best option for allocating kernel memor...

...9.987793% 99.987793% 99.987793% 99.987793% 99.987793% 99.987793% 99.987793% 99.987793% 99.987793% 99.987793% 99.987793% 99.987793% 100.000000% 99.987793% 99.987793% 99.987793% 99.987793% 99.987793% 99.987793% 99.987793% 99.987793% 99.987793% --- Results after 57 passes --- Best: 100.000000 -- Worst: 99.975586 -- Average: 99.987793 What does this mean? Should I have expected to get 100% across the board? This is from a TE410P running on Debian 2.6.11-1-686-smp on a dual Xeon 2.4GHz server. Thanks, Waldo

...ev(order(xhigh$Predict)),],xlow)}))? ##reverse the order of high values ?dim(res) #[1] 480?? 4 A.K. ________________________________ From: Ira Sharenow <irasharenow100 at yahoo.com> To: arun <smartpink111 at yahoo.com> Sent: Wednesday, September 25, 2013 12:55 PM Subject: Best and worst values for each date Arun, I hope you have been doing well. I have a new problem. I have two data frames, one for predictions and one for the actual returns. Each day I act on the returns that have the 5 highest values and the five lowest values. I then want to compare to the actual values....