search for: precomput

I see there are still some floating point operations left in the codec init(ialization) code. Changing that code to fixed point is not only difficult (due to the trigonometric functions etc) but may also degrade the precision. Here is an idea whereby we can easily precompute (record) all those values on a powerful processor and then use (replay) them on an embedded processor / DSP. The only requirement is that 'xxx_init_xxx' should be called in exactly the same environment in both cases (e.g. FIXED_POINT and with the same mode or sequence of modes). All t...

Firstly, running for more channels will not break my hack. All that's needed is to call RECOPLAY_MARK with different identifiers (say nb, wb or uwb) before doing the appropriate initialization. Secondly, my attempts to do the Gaussian in fixed point went like this : Define a new constant lag_factor_gauss that is manually set equal to exp(sqr(2*M_PI*lag_factor)/-2) by whoever changes the

On 5/30/2008 11:40 AM, rocket at google.com wrote: > I've run into a scoping problem in R. No, in your use of it. > I'm calling a function that > * creates a formula ... incorrectly. > * calculates a weight vector > * calls lm with that formula and weights > This fails. > > Here's a simplified reproduce example: > # f works, g doesn't, h is

I've run into a scoping problem in R. I'm calling a function that * creates a formula * calculates a weight vector * calls lm with that formula and weights This fails. Here's a simplified reproduce example: # f works, g doesn't, h is a workaround rm(w) data <- data.frame(y=runif(20), x=runif(20), z=runif(20)) f <- function(k){ w <- data$z^k coef(lm(y~x, data

...is. The idea of llvmbuilder is that it is a > "free" wrapper around the other existing API calls. Making the > methods virtual would make them much more expensive. Wouldn't the class of the objects be known at compile time in most cases? This is essentially just a case of precomputing constants, so I think this should be possible. If yes, the compiler can predetermine the type, hence the virtual method table that will be used, and can replace the virtual call with a static one. Does such an approach make sense with LLVM? (I'd want to do such things for my personal langu...

...of all their known cracked passwords. It's big -- 5.3Gb 7-zipped file. https://haveibeenpwned.com/Passwords "j.emerlik" further asks: > You mean that today they using encrypted passwords to seeing > who has same passwords using brute force, hashes dictionary attack ? They precompute hashes for large number of password candidates, then look up hashes in that table. Rainbow tables are a way of folding large tables into a smaller ones, trading off space for extra CPU time. However, for hashes that use non-trivial salts, you would need to precompute an astronomically large numb...

...me > > infrequent type of group, so that the entity who defines the group > > can't force you into this secret corner case if they have special > > knowledge. > > that being said, how using NUMS seeds to generate safe prime would > hurt? If you're concerned about precomputation, then it effectively gives the attackers a list of what you're going to use in the future. > also, doesn't that require us to provide primality certificates for q > rather than p? IMO you'd want both to prove a safe prime -d

...ven close. The way to create a key is to use a PRNG seeded with true, system level entropy. 3. Rainbow Tables Since there will be standard data common among many apps (eg null sessions), and no salting is employed, we can use create Rainbow Tables, and afterwards find the secret very quickly. 4. Precomputation Cookie session computes the hash by *appending* the secret to the data. This can be used to speed up the brute force, by precomputing the hash of the data, and starting the hash function on the candidate session. The correct way to use the key is to repeatedly XOR it to the data, not append...

...r("foo"): SEXP getFoo() { return mkChar("foo"); } The above implementation doesn't take advantage of the fact that mkChar("foo") could be pre-computed only once, and then the function would return the pre-computed value. So the question is how to create this precomputed value. The closest thing I could find in the sources is R_NaString, but I was not able to trace down how it comes about. Thanks, Vadim P.S. I was able to solve a similar problem with symbols. If I need a symbol "foo", I do static SEXP FooSymbol = install("foo");...

On 10/17/2012 9:04 AM, Duncan Sands wrote: > Unfortunately I have no idea how to implement this in a reasonable way. It should be possible to precompute the layout of the .ll file from the IR itself and then add self-annotations. It may require a special form of dumping the IR into a .ll file to make sure that empty lines, etc. are properly synchronized with the annotations. Wouldn't this solve the problem (reasonably)? -Krzysztof --...

A. Schulze writes: > precomputing ssl-params is also possible without patching but it's a > little bit tricky > ... > Long version in german: https://andreasschulze.de/dovecot/ssl-params Nice. (You should probably point out to ensure ssl_parameters_regenerate is zero, otherwise all this work will get wiped out!)...

...lvmbuilder is that it is a >> "free" wrapper around the other existing API calls. Making the >> methods virtual would make them much more expensive. > > Wouldn't the class of the objects be known at compile time in most > cases? This is essentially just a case of precomputing constants, so I > think this should be possible. > > If yes, the compiler can predetermine the type, hence the virtual method > table that will be used, and can replace the virtual call with a static > one. Please verify that this actually happens in practice with llvm-gcc and g...

...aking a pass would be useful if the information would help other passes as well though. Also, FWIW, this is a case where the terminology of analysis "passes" and the general emphasis on "running" them is a little misleading. Instead of having a runOnFunction that runs ahead and precomputes information for the entire function, this kind of analysis is a good match for the on-demand approach, where runOnFunction does nothing, and information about each block is computed the first time a query needs it. Dan

Hello Matthias, On 28 July 2017 at 04:13, Matthias Braun <mbraun at apple.com> wrote: > It's not that hard in principle: > - A register class is a set of registers. > - Virtual Registers have a register class assigned. > - If you have register constraints (like x86 8bit operations only work on > al,ah,etc.) then you have to create a new register class to express that.

Also, how are default moduli shipped with OpenSSH for use in diffie-hellman-group-exchange-sha1/sha256 chosen? Are they chosen randomly by developers or are they chosen for security properties? If they are random, why not use moduli from RFC 7919 instead, like Mozilla recommends? On Fri, Feb 15, 2019 at 3:48 AM Mark D. Baushke <mdb at juniper.net> wrote: > > Yegor Ievlev <koops1997

...te then quickly, sometimes it takes a long while (minutes). http://dovecot.org/pipermail/dovecot/2015-November/102447.html Try running openssl dhparam -noout 2048 to see how it varies for you. If what I suspect is true, you can try using shorter keys. A followup post suggest a way you can precompute the key Joseph Tam <jtam.home at gmail.com>

On Tuesday 07 October 2008 00:32, Nicolas Capens wrote: > Anyway, this can definitely also be done with an analysis pass that > provides information about ordering between loads and stores. It's just Actually, no it can't. See the thread about analysis passes depending on other analysis passes and when things do and don't get updated by PassManager.

Hi, Can anybody briefly explain the significance of the updated moduli file? Is this a critical update? Should all existing installations update their moduli file? Thanks in advance, -- Dan

...to zero instead to shut up >> the warning. To further improve readability, I also make the >> error case indented and leave the normal case as the final 'return' >> statement. >> > > I think to make perfectly clear why this check is done, we simply > should precompute the denominator and do something like this: > > int denominator = M * P > if (denominator == 0) > return 0; > return sclk * N / denominator; > > but with a better name for "denominator". I don't know what M and P actually are in this function, so I couldn'...

...use some help explaining. The point of interest is between 'unreachableblockelim' and 'codegenprepare' passes. Here is the paste of IR after each pass http://pastebin.com/42xLT4ZN I've annotated 3 spots in the code with stars. In (1), after unreachableblockelim, addr89 is precomputed outside the loop once and is used in store in (2). However, in (3), after codegenprepare, there is now a bunch of math being done every loop iteration to get the address for the same store. Additionally, looks like the same thing is happening for several addresses above as well. Does this look r...