-
Hi there,
I'm currently working on occupancy models specifically geared towards passive acoustic monitoring, where sites are allowed to chance occupancy state throughout the acoustic deployment per…
-
@mdsumner - I figured it would be good to sketch out designs / requirements for supporting scilicate / hypertidy structures and the like.
I've started porting all the utility functions from `sfhead…
-
Next to the description of the schema of data literals, we would need to describe transformations of theirselves. The ability to express _data transformations_ in the _data plane_ promotes:
* reusa…
-
Rather than having many intermediate files, record data in fast5 files similar to DNA.
Objectives:
* Document bulk & DNA read fast5 specs (roughly).
* Identify commonalities to current data struc…
-
[Barr-Wells-ctcs.pdf](http://www.math.mcgill.ca/triples/Barr-Wells-ctcs.pdf)
- [ ] 1 Preliminaries 1
- [ ] 1.1 Sets 1
- [ ] 1.2 Functions 3
- [ ] 1.3 Graphs 8
- [ ] 1.4 Homomorphisms of graphs…
-
Currently, there is no way to avoid read prepares (and the resulting overhead) in situations where a data structure is intended to be immutable.
In some current FabIL programs, if the data structur…
-
## The problem
Validation errors are a fact of life, when implementing new functionality. But understanding what's causing them can be very hard, as it's not easy to identify what an object in the …
-
Per discussion with @amcastro-tri, we would like to perform some major surgery on MultibodyTree to achieve these goals:
- Make it produce the same results as fast as possible, with 10X as a target (p…
-
This isn't a bug per se, but it is something that lends itself well to a great deal of unintuitive behavior. Consider the following KCL:
```
let exampleSketch = startSketchAt([0, 0])
|> line([1, …
-
I have been thinking about making a push to get this to v1.0. The main problem is the API. The current API is unwieldy: it is a blend of high level helpers and low level data structures, and doing any…