search for: fiendishly

Dear List, I would greatly appreciate help on the following matter: The RuleFit program of Professor Friedman uses partial dependence plots to explore the effect of an explanatory variable on the response variable, after accounting for the average effects of the other variables. The plot method [plot(summary(rq(y ~ x1 + x2, t=seq(.1,.9,.05))))] of Professor Koenker's quantreg program

...while complex*complex requires four real multiplications, an addition, and a subtraction. So implementing complex*real by conventing the real to complex is inefficient (as well as getting the finer points of IEEE arithmetic wrong). As for comple division, getting that *right* in floating-point is fiendishly difficult (there are lots of algorithms out there and the majority of them have serious flaws) and woefully costly. It's not unfair to characterise implementing complex/real by conversion to complex and doing complex/complex as a beginner's bungle. There are good reasons why "double&q...

When testing chacha20-poly1305, I noticed that aes-gcm is significantly faster than aes-ctr or aes-cbs with umac. Even on systems w/o aes-ni or other recent instruction set additions. And there seems to be consensus in the crypto community that AEAD ciphers are the way forward. As such, it promoting the AEAD ciphers to the head of the preference list looks like a good idea. That would mean

...ng at the exception message, if it is lacking a trailing '.' (as quoted below), then a corrupted entry (or chunk) in the list of document lengths, but if it has a trailing '.', then it's a missing entry in the record table. (I'm not sure if this punctuation difference was a fiendishly cunning deliberate plan or careless inconsistency...) We probably ought to cross-check the two - that shouldn't be costly to do. > This is with Xapian 1.2.16 My guess is that the corruption is caused by the same bug as #645, which was fixed in 1.2.21. > I then ran "delve -t t...

...tion, and a subtraction. So implementing complex*real by > conventing the real > to complex is inefficient (as well as getting the finer points of IEEE > arithmetic wrong). I see your point. > As for complex division, getting that *right* in floating-point is > fiendishly difficult (there are > lots of algorithms out there and the majority of them have serious flaws) > and woefully costly. > It's not unfair to characterise implementing complex/real > by conversion to complex and doing complex/complex as a > beginner's bung...

There seems to be a bug in Gnulib's setenv module on Mac OS X. At configure time it says: checking whether setenv validates arguments ... no (The test program it is running is: | int | main () | { | | if (setenv ("", "", 0) != -1) return 1; | if (errno != EINVAL) return 2; | if (setenv ("a", "=", 1) != 0) return 3; | if

...ing complex*real by > > conventing the real > > to complex is inefficient (as well as getting the finer points of IEEE > > arithmetic wrong). > > I see your point. > > > As for complex division, getting that *right* in floating-point is > > fiendishly difficult (there are > > lots of algorithms out there and the majority of them have serious flaws) > > and woefully costly. > > > It's not unfair to characterise implementing complex/real > > by conversion to complex and doing complex/complex as a >...

Hi, A Recoll user is reporting an index corruption problem. In general, index corruption happens from time to time with Recoll, because of crashes, reboots, misc Recoll bugs, etc. The strange thing here is that xapian-check does not seem to detect anything. In a nutshell, some document numbers seem to point to a data blackhole: the docids are returned when searching for the file/doc unique

Hi, I'm looking to move from Windows into a 64-bit Linux environment. Which is the best Linux Flavor to use within R? To install R on this environment, do I need to do any compiling? Thanks all! Axel. [[alternative HTML version deleted]]

Just a heads-up, because this bug took me absolutely ages to chase down, and I want to save others the same pain. Samba is perhaps the most prominent reason why you might find a user in more than 16 groups on a Unix system, and so this bug may at first appear to be a 'Samba issue' (that certainly is why it found it's way to my attention :-) https://www.illumos.org/issues/3691 In

atan(1i) -> 0 + Inf i complex(1/5) -> 0.2 + 0i atan(1i) -> (0 + Inf i) * (0.2 + 0i) -> 0*0.2 + 0*0i + Inf i * 0.2 + Inf i * 0i infinity times zero is undefined -> 0 + 0i + Inf i + NaN * i^2 -> 0 + 0i + Inf i - NaN -> NaN + Inf i I am not sure how complex arithmetic could arrive at another answer. I advise against messing with infinities... use atan2() if you don't

Getting this error: SyntaxError in CompanyController#positionslist (eval):1:in `compute_type'': compile error (eval):1: parse error, unexpected tINTEGER Object::2 I could not find anything out about it (googling) and it''s not the clearest error message. Not sure if it''s related to an expected data type but that wouldn''t make sense. The only other thing I can

Hey guys I''ve been beating my head on this for a few hours. Maybe it is just a stupid configuration error you can point me at. First here is a small diagram of what I am trying to configure: http://6bit.com/img/netdiag.png Currently I only have Shorewall running on the host on the right of the diagram until I can get this working then I''ll add it to the other host as well.

I think we all know that the readability of steps isn''t great right now, and in fact there''s a very recent thread that discusses just that. It was that recent thread that prompted me to explore this a bit. The basic idea is that you define step matchers, which have a regex, and then you match step names against that regex. Kind of tough for me to explain so I''ll just