-
ndpi allow the users to define some custom rules via proto.txt" files.
Among these rules, I am interested in talking about the ip/port rules (only).
There are 4 kind of these rules, at least:
* i…
-
`Print Sorted Universes` tells me that the standard library needs `Prop`, `Set`, and three more universes. I'd like to trace the universe dependencies of the standard library, to see just what requir…
-
This is a continuation of the work started in tickets #30400, #30447. It is expected to add methods about computing homology groups of h-regular spaces. Also, the computation of homologically admiss…
-
Hello,
when I naively try to execute `find . -name '*.v' -exec alectryon.py --frontend coqdoc --backend webpage {} \;` in a project using a `_CoqProject`, I get errors like this:
```
./Instance…
-
Implement the well-known Blossom algorithm for maximum weight (perfect) matching in generic graphs.
- wiki link: https://en.wikipedia.org/wiki/Blossom_algorithm
- many simple (not-optimized) imple…
-
I think it would be nice to have a version of `--rewriting` that does pure syntactic matching rather than reasoning up to eta-equality.
This would mean that ordinary confluence is insufficient to g…
-
Added `matching_generating_poly`, modified `matching_polynomial`, added an option
to `permanental_minor_polynomial`, which for some graphs is faster than the previous
algorithm.
`matching_generatin…
-
The problem is simple. In an RSS download rule, disabling "Ignore Subsequent Matches" downloads like 5 versions of the same episode. Not good. So what do we do? We set it to a number of days high enou…
-
I am working with projection algorithms and encountering issues with the Distance Driven (DD) implementation in this toolbox. The DD implementation iterates the indexes of both detector and voxel boun…
-
Hi Pengze,
I hope you are doing well! Congrats on your recent paper "Formulating Discrete Probability Flow Through Optimal Transport" . I had a good read and found it impressive in theory! However,…