search for: purpose_

...st be a better way? > > Just a cryptographic hash (e.g. SHA1) to avoid the need to "hope" that there are no collisions. > > -- Sean Silva  Cryptographic hashes don't guarantee you get no accidental collisions; their goal is to make it super hard to produce a collision _on purpose_. What you need is an algorithm designed for string inputs, with good uniformity, and an adequate output size; there are many. Accidental collisions are essentially the Birthday Problem: http://en.wikipedia.org/wiki/Birthday_problem See particularly the end of the "Square approximation" s...

...; Just a cryptographic hash (e.g. SHA1) to avoid the need to "hope" that > there are no collisions. > > > > -- Sean Silva > > Cryptographic hashes don't guarantee you get no accidental collisions; > their goal is to make it super hard to produce a collision _on purpose_. > What you need is an algorithm designed for string inputs, with good > uniformity, and an adequate output size; there are many. > It's obvious by the pigeonhole principle that there must be collisions. The point of my statement that OP doesn't have to "hope" that it av...

...ash (e.g. SHA1) to avoid the need to "hope" that >> there are no collisions. >> > >> > -- Sean Silva >> >> Cryptographic hashes don't guarantee you get no accidental collisions; >> their goal is to make it super hard to produce a collision _on purpose_. >> What you need is an algorithm designed for string inputs, with good >> uniformity, and an adequate output size; there are many. >> > > It's obvious by the pigeonhole principle that there must be collisions. > The point of my statement that OP doesn't have to &...

On Wed, Jun 19, 2013 at 1:04 AM, edA-qa mort-ora-y <eda-qa at disemia.com>wrote: > > The problem is that if I derive the name from what the type contains the > length of that name is essential unbound. So how does one generate > names? I'm thinking of just using a long hash and hoping I don't get > accidental collisions. Surely there must be a better way? > Just

Hi, I'm testing affyPara on Debian lenny with R 2.7 from unstable, and the corresponding bioconductor packages from bioconductor.org downloaded using biocLite as per usual. The command cl = makeMPIcluster(k) succeeds, but spawns k R slaves which promptly soak up all available CPU, which is odd since they are not doing anything yet. This looks like a bug to me. Similar behaviour is shown

In my language I have anonymous types (essentially tuples), and I have generated functions (like constructors) which are unique for these types. If the same type occurs in multiple modules however it should end up with only one definition being linked. Thus I need a way to give them the same name. The problem is that if I derive the name from what the type contains the length of that name is