search for: negligible

Hello The data set I am examining has 7425 observations (rows with unique identifiers) and 46 samples(columns). I have been trying to generate a dataset that filters out observations that are "negligible" The definition of "negligible" is absolute value less or equal to 1.58. The rule that I would like to adopt to create a new data is: drop rows in which 2 or more observations have absolute values <= 1.58. Since I have unique identifier per row, I have tried to reshape the data...

Hi, Last week I wrote llvm-dev and presented data that shows how enabling the vectorizer on -Os can improve the performance of many workloads and that it has negligible effects on code size. I also added a command line switch to make it easier for people to benchmark the vectorizer using -Os directly from clang without changing LLVM. Has anyone done any benchmarks on -Os + vectorization ? Thanks, Nadav

Could you offer some suggestion how to fetch mailbox content over high RTT link (with negligible packet loss)? Currently I use IMAP+IDLE *but* it fails to use full available bandwidth due to high RTT and "send command wait for response" nature of POP3 and IMAP4 protocols. -- [pl>en: Andrew] Andrzej Adam Filip : anfi at onet.eu Learning without thought is labor lost; thought wit...

...nce is not about the size of the values! It is about the > reduction of the norm during the householder transformation. From the > sources <https://svn.r-project.org/R/trunk/src/appl/dqrdc2.f> > > > c cycle the columns from l to p left-to-right until one > c with non-negligible norm is located. a column is considered > c to have become negligible if its norm has fallen below > c tol times its original norm.... > > Best, > Uwe Ligges Oh, I apologise, I read the arguments section in the help page, but not the asterisk down below. Then the result is...

2017-06-22 19:49 GMT+02:00 Uwe Ligges <ligges at statistik.tu-dortmund.de>: > On 22.06.2017 17:11, Bernd Funovits wrote: >> >> Hello, >> >> I experienced some unexpected behaviour while determining the rank of matrices (sometimes 1x1 matrices): >> base::qr(matrix(1e-20))$rank returns 1 (incorrect) >> base::qr(diag(c(1, 1e-20)))$rank returns 2

Hello, I would like to treat a very simple case : to fit a linear model with 5 parameters (including main terms, interactions and quadratic terms using a central composite design with 27 runs) for a constant response (e.g resp = 100.0). The fitting process works and return me a good intercept value (the value of my constant) and some negligeable effects (around e-15). But, I don't understand

The H.264 codec patent by Qualcomm has been ruled invalid by a San Diego Federal jury: http://www.eetimes.com/news/semi/showArticle.jhtml?articleID=197001066 . That means that H.264 codecs can now be written, distributed and revised freely under any license their authors choose, including GPL, public domain, or any other, and $free now that royalties are no longer required. How does H.264

OS X 10.2 and higher comes standard with highly optimized versions of BLAS and Lapack in /Systems/Library/Frameworks/vecLib.framework. It seems that even for double precision they do much better. See http://sthmac.magnet.fsu.edu/benchmarks/ I am not sure how these numbers would look on G3 Macs, but obviously for double precision there is not much reliance on Altivec. So I tried to configure

Especially on Windows, some common functions are missing. Use the autoconf LIBOBJS mechanism to replace these functions. This includes replacement functions for: Function names Implementation Origin getdelim, getline general purpose NetBSD under a compatible license openlog, syslog, Win32 written by me vsyslog realpath Win32 written by me

...ect?rev=194702&view=rev It provides only function-level boolean coverage (i.e. no counters, just "visited or not"), but is very fast and very simple (no extra sections to the binary file, etc) I've tried it for Chrome's content_shell (huge and heavy binary) and the overhead is negligible at both run-time and shutdown-time. We'll be evaluating this implementation and collecting usage stats. Maybe we want to implement something simple like this in the Clang coverage. --kcc -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/...

Especially on Windows, some common functions are missing. Use the autoconf LIBOBJS mechanism to replace these functions. This includes replacement functions for: Function names Implementation Origin getdelim, getline general purpose NetBSD under a compatible license openlog, syslog, Win32 written by me vsyslog realpath Win32 written by me

...n code > size (not sure what he was referencing, my guess will be something related > to hot-cold code splitting). > IIUC, it's just using optsize instead of optnone. The idea is that, if the code really doesn't run often/at all, then the performance impact of reducing the size is negligible, but the size impact is considerable. I'd wager that optsize could even be faster than optnone, as it would delete a lot of useless code... but not noticeable, as it wouldn't run much. This is an idea that we (Verona Language) are interested in, too. -------------- next part -------------...

On Wed, Aug 1, 2018 at 2:14 PM Richard W.M. Jones <rjones@redhat.com> wrote: > Currently this adds two useful header files containing functions which > will be consumed by filters in later commits. > --- > Makefile.am | 5 +++- > common/include/Makefile.am | 39 ++++++++++++++++++++++++ > common/include/ispowerof2.h | 50 +++++++++++++++++++++++++++++++

Similar to C, OCaml and Rust, this is not a plugin per se. Instead it's more of a method and set of tests around writing plugins in golang. They are standalone programs that compile into shared objects that nbdkit can then load (so there is no "go plugin" between nbdkit and the user plugin, unlike in scripting languages like Perl). --- plugins/golang/nbdkit-golang-plugin.pod

...do File.foreach(words) do |line| line.chomp! Word.create!(:word => line) end end end end def self.down drop_table :words end end That takes about 45 seconds, and a one-liner shows the time needed by the foreach loop itself is negligible. The analogous SQL file with inserts takes about 3 seconds to load passed directly to the mysql client. I have no problem with those 45 seconds, but I would like to know why that''s that way. Do you know why there is so much difference? Is it the driver? -- fxn

Ferret 0.10.11 & AAF: the time seems to be stored in a format that can''t be sorted, the order doesn''t make any sense. Workaround: use to_i on the Time object before putting it into the index. -- Posted via http://www.ruby-forum.com/.

Does anybody use and prefer Redcloth (or bluecloth, which appears to be alpha)? Does it affect performance much? Is there a way to get it to automatically process templates without having to call textilize? Thanks, Joe -- Posted via http://www.ruby-forum.com/.

...ire string. There is the > > added overhead of maintaining a counter when using strnlen(), but I > > thought I'd start with the general case. It may make sense to only use > > this optimization with small constants. On the other hand, the impact of > > the counter may be negligible in many or most cases due to > > hardware-level optimizations. > > This is an optimisation I am very vary of two two reasons: > (1) strnlen is only POSIX2008, so missing on many slightly older > systems. That's why we check whether it exists. glibc has had strnlen since 199...

...urn into NOPs > in the regular case and callee-saved function calls for the PV case. > > That still does not entirely eliminate cost, but does reduce it > significant. Please consider using that. The additional register pressure may just cause a few more register moves which should be negligible in the overall performance . The additional icache pressure, however, may have some impact on performance. I was trying to balance the performance of the pv and non-pv versions so that we won't penalize the pv code too much for a bit more performance in the non-pv code. Doing it your way wi...

...erges so need to figure out a way to speed it up. I have tried a number of different things to speed things up to no avail. I've noticed that rbinds execute much faster using matrices than dataframes. However the performance improvement when using matrices (vs. data frames) on merges were negligible (8 hours down to 7). I tried casting my merge field (date) into various different data types (character, factor, date). This didn't seem to have any effect. I tried the hash package, however, merge couldn't coerce the class into a data.frame. I've tried various ways to parellelize co...