## Where communities thrive

• Join over 1.5M+ people
• Join over 100K+ communities
• Free without limits
##### Activity
• 18:33
schillic edited #2847
• 18:27
schillic synchronize #2847
• 18:27

schillic on 2845

review (compare)

• 18:22
mforets opened #2852
• 16:37

schillic on gh-pages

build based on fb903ff (compare)

• 16:23
schillic updated the wiki
• 16:22

schillic on underapprox

• 16:22

schillic on master

cleanup underapproximate Merge branch 'master' into mfor… remove unfinished sentence and 2 more (compare)

• 16:22
schillic closed #2306
• 15:02
mforets commented #2306
• 15:00
mforets synchronize #2306
• 15:00

mforets on underapprox

• 14:58

mforets on makie

• 14:44
mforets edited #2851
• 14:44
mforets opened #2851
• 14:37
mforets labeled #2850
• 14:37
mforets opened #2850
• 14:12

schillic on gh-pages

build based on f663b7f (compare)

• 14:00
schillic updated the wiki
• 13:57

schillic on 2756

Marcelo Forets
@mforets
if a region is inside the ellipsoid or not?

that can be done with the membership function:

E = Ellipsoid([1.0, 1.0], [2.0 0.0; 0.0 0.5])
B = box_approximation(E)
Bs = split(B, [30, 30])

res = [center(Bi) ∈ E for Bi in Bs]
M = reshape(res, (30, 30))

produces

plot(E)
plot!(Bs)
Marcelo Forets
@mforets
and the M matrix is
30×30 Matrix{Bool}:
0  0  0  0  0  0  0  0  0  0  0  1  1  …  1  0  0  0  0  0  0  0  0  0  0  0
0  0  0  0  0  0  0  0  1  1  1  1  1     1  1  1  1  0  0  0  0  0  0  0  0
0  0  0  0  0  0  0  1  1  1  1  1  1     1  1  1  1  1  0  0  0  0  0  0  0
0  0  0  0  0  1  1  1  1  1  1  1  1     1  1  1  1  1  1  1  0  0  0  0  0
0  0  0  0  1  1  1  1  1  1  1  1  1     1  1  1  1  1  1  1  1  0  0  0  0
0  0  0  1  1  1  1  1  1  1  1  1  1  …  1  1  1  1  1  1  1  1  1  0  0  0
0  0  0  1  1  1  1  1  1  1  1  1  1     1  1  1  1  1  1  1  1  1  0  0  0
0  0  1  1  1  1  1  1  1  1  1  1  1     1  1  1  1  1  1  1  1  1  1  0  0
0  1  1  1  1  1  1  1  1  1  1  1  1     1  1  1  1  1  1  1  1  1  1  1  0
0  1  1  1  1  1  1  1  1  1  1  1  1     1  1  1  1  1  1  1  1  1  1  1  0
0  1  1  1  1  1  1  1  1  1  1  1  1  …  1  1  1  1  1  1  1  1  1  1  1  0
1  1  1  1  1  1  1  1  1  1  1  1  1     1  1  1  1  1  1  1  1  1  1  1  1
1  1  1  1  1  1  1  1  1  1  1  1  1     1  1  1  1  1  1  1  1  1  1  1  1
⋮              ⋮              ⋮        ⋱        ⋮              ⋮
1  1  1  1  1  1  1  1  1  1  1  1  1     1  1  1  1  1  1  1  1  1  1  1  1
0  1  1  1  1  1  1  1  1  1  1  1  1     1  1  1  1  1  1  1  1  1  1  1  0
0  1  1  1  1  1  1  1  1  1  1  1  1  …  1  1  1  1  1  1  1  1  1  1  1  0
0  1  1  1  1  1  1  1  1  1  1  1  1     1  1  1  1  1  1  1  1  1  1  1  0
0  0  1  1  1  1  1  1  1  1  1  1  1     1  1  1  1  1  1  1  1  1  1  0  0
0  0  0  1  1  1  1  1  1  1  1  1  1     1  1  1  1  1  1  1  1  1  0  0  0
0  0  0  1  1  1  1  1  1  1  1  1  1     1  1  1  1  1  1  1  1  1  0  0  0
0  0  0  0  1  1  1  1  1  1  1  1  1  …  1  1  1  1  1  1  1  1  0  0  0  0
0  0  0  0  0  1  1  1  1  1  1  1  1     1  1  1  1  1  1  1  0  0  0  0  0
0  0  0  0  0  0  0  1  1  1  1  1  1     1  1  1  1  1  0  0  0  0  0  0  0
0  0  0  0  0  0  0  0  1  1  1  1  1     1  1  1  1  0  0  0  0  0  0  0  0
0  0  0  0  0  0  0  0  0  0  0  1  1     1  0  0  0  0  0  0  0  0  0  0  0
and
plot(E)
plot!(Bs[res])
Dale-Black
@Dale-Black
Yes that's exactly what I am looking for. Thanks again
Marcelo Forets
@mforets
:thumbsup:
Marcelo Forets
@mforets
Christian Schilling
@schillic
:O
Marcelo Forets
@mforets
in the #javis.jl stream on zulip i got feedback from the Javis developers and made a quick animation
Javis is a pure julia package to make animations
it has many features that i didn';t try yet, such as sets following a path
Marcelo Forets
@mforets

today i tried running the Lazysets docs and tests in Julia v1.6 .. and it takes no more than 2 minutes :tada:

in the past it used to take much longer i think

\$ time julia --color=yes docs/make.jl  && julia --color=yes test/runtests.jl

Test Summary:     | Pass  Total
LazySets.plotting |    2      2
21.167309 seconds (31.84 M allocations: 1.854 GiB, 2.67% gc time, 19.44% compilation time)
[ Info: SetupBuildDirectory: setting up build directory.
[ Info: Doctest: running doctests.
[ Info: Skipped ExpandTemplates step (doctest only).
[ Info: Skipped CrossReferences step (doctest only).
[ Info: Skipped CheckDocument step (doctest only).
[ Info: Skipped Populate step (doctest only).
[ Info: Skipped RenderDocument step (doctest only).
Test Summary:     | Pass  Total
LazySets.doctests |    1      1
50.646803 seconds (79.67 M allocations: 5.673 GiB, 2.96% gc time, 4.86% compilation time)
so its 20 sec for tests and 50 sec for doctests and actually building the docs
just rebased to master the branch JuliaReach/LazySets.jl#2753
Christian Schilling
@schillic
the time you show here is just the doctests. the building happens in the first command and does not print the time (you should have gotten the result of time for everything at the very end)
also, you are only showing the time for the plot tests and doctests. there are a lot more of them
what is true is that most of the time is spent in precompilation. running the tests a second time is fast
Marcelo Forets
@mforets
:thumbsup:
Christian Schilling
@schillic
building the docs takes 5:30 and running the tests takes 11:00 on a github server
Christian Schilling
@schillic
Christian Schilling
@schillic
the time for using LazySets increased by 2 seconds compared to v1.6.1 :(
Marcelo Forets
@mforets
ohh
2 seconds is a lot. you tried v1.7 the other day. it also has that additional latency? (i guess so? )
there is supposed to be a workshop / talk about how to use tools to reduce latency
Christian Schilling
@schillic
in v1.7.0-beta3.0 it's 1 second faster compared to v1.6.2 :)
Marcelo Forets
@mforets
the workshop It's all Set: A hands-on introduction to JuliaReach
has been announced
and also the minisymposium Set Propagation Methods in Julia: Techniques and Applications
https://pretalx.com/juliacon2021/talk/DRMPLU/
Christian Schilling
@schillic
@mforets: about the recent segmentation fault when building the docs: it's not just us: JuliaPolyhedra/Polyhedra.jl#265
Marcelo Forets
@mforets
i feel like adding the content of the notebooks to the packages docs
i also like the guided introduction to NNA
can we also trim the youtube video? i mean, the last 15 mins with the NNA presentation
so we can link that directly from the NNA docs
Christian Schilling
@schillic
:+1:
Marcelo Forets
@mforets
FYI there is a #set-propagation discord channel for JuliaCon
Marcelo Forets
@mforets
during the w.e. i plan to continue working on the RA docs revamp
i think we should update the names of the section in a better way
it might be like this:
• Linear methods (which explains reach-sets, flowpipes, etc in the context of ivps with set initial conditions of the form x' = Ax )
• Handling inputs sets (not sure about the section name. this is about linear systems with non-deterministic inputs).
• Taylor models methods
• Hybrid systems
• Clocked systems
• Exploiting structure (which goes at depth into different use cases of LGG09, BFFPSV18)
• ... the list continue
the motivation to separate "Linear methods" wrt systems with inputs is to introduce the set propagation concepts incrementally
Christian Schilling
@schillic
"nondeterministic linear systems"?
or "with uncertainties"
Marcelo Forets
@mforets
perfect
Marcelo Forets
@mforets
Marcelo Forets
@mforets
a blog post on julia ecosystem statistics: https://julialang.org/blog/2021/08/general-survey/
Marcelo Forets
@mforets
Ellipsotopes!