perfecthash
SetReplace
| perfecthash | SetReplace | |
|---|---|---|
| 2 | 1 | |
| 60 | 211 | |
| - | - | |
| 0.7 | 0.0 | |
| 6 months ago | over 2 years ago | |
| C | Mathematica | |
| BSD 3-clause "New" or "Revised" License | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
perfecthash
-
Scientists Find Optimal Balance of Data Storage and Time
Hey, if you're looking for a real-world pragmatic and performant implementation of a theoretically-cool algorithm, my https://github.com/tpn/perfecthash project might fit the bill.
It's geared to generating perfect hash tables with the fastest possible lookup/index times (for 32-bit keys), for key sets in the <=100,000 range. (It scales well up to millions of keys, but the solving time takes a lot longer.)
-
Show HN: Hypergraph, a data structure library to generate directed hypergraphs
Hypergraphs are neat; I used them to implement a perfect hash library in C: https://github.com/tpn/perfecthash.
SetReplace
-
Multicomputation as a General Paradigm for Theoretical Science
Some of the ideas in this post might pan out, some might not. Regardless, I do think token event graphs will turn out to be important. Of course, I'm biased: I coined the name TEG -- although the underlying idea originated with Max Piskunov and his "local multiway systems" [0]
What's promising about TEGs (and their incidence hypergraph, the rewrite hypergraph) is that they offer a clean methodology to decompose the behavior of a non-deterministic automaton into its causally independent parts. We're still trying to understand how to think about them, but the most promising approach seems to use the lens of (modular) representation theory, which gives us a rich mathematical toolkit to work with.
If this methodology works, there will be possibility to represent many kinds of systems in disparate fields, ranging from distributed computation to physics to biology to machine learning, in the common language of TEGs and their representations. Of course it may turn out to be merely a recasting of older ideas. In particular the Khrone-Rhodes theorem [1], categorical Petri nets [2], and the GNS construction [3] seem like they might be describing the same or an analogous procedure.
I hope to soon be describing this approach in full detail using quiver geometry [4].
[0]: https://github.com/maxitg/SetReplace/blob/master/Research/Lo...
[1]: https://www.wikiwand.com/en/Krohn–Rhodes_theory
[2]: https://arxiv.org/abs/2101.04238
[3]: https://www.youtube.com/watch?v=OmaSAG4J6nw
[4]: https://quivergeometry.net
What are some alternatives?
processhacker - A free, powerful, multi-purpose tool that helps you monitor system resources, debug software and detect malware. Brought to you by Winsider Seminars & Solutions, Inc. @ http://www.windows-internals.com [Moved to: https://github.com/winsiderss/systeminformer]
WolframLanguageForJupyter - Wolfram Language kernel for Jupyter notebooks
hypergraph - Hypergraph is data structure library to create a directed hypergraph in which a hyperedge can join any number of vertices.
feyncalc - Mathematica package for algebraic calculations in elementary particle physics.
Rufus - The Reliable USB Formatting Utility
BernDirac - A Mathematica package for performing calculations involving matrices/vectors in the Dirac notation which is usually used in quantum mechanics/quantum computing.
xntsv - XNTSV program for detailed viewing of system structures for Windows.
iceberghashtable