Moelf

Comparison

julia> includet("./tmp.jl")

julia> @time user_code(LRU_getindex);
  6.539568 seconds (840.07 k allocations: 69.739 MiB, 0.18% gc time, 1.18% compilation time: 33% of which was recompilation)

julia> @time user_code(illegal_getindex);
  3.374077 seconds (252.80 k allocations: 53.082 MiB, 2.87% compilation time: 25% of which was recompilation)

Moelf

30 workers

julia> nworkers()
30

julia> pmap((x)->gethostname(), workers()) |> unique |> length
25

julia> res = @time WVZAnalysis.hist_root_pmap("Signal");
[ Info: -------------- Signal SF begin ------------ 

Moelf

This in principle allows one to read anything that uproot/awkward can read and represent (as long as to_arrow worked):

We use the following packages to demonstrate our round trip

julia> using PythonCall

julia> const ak = pyimport("awkward")

julia> ak.__version__
Python str: '1.9.0rc10'

Moelf

julia> using ONNX, ONNX.Ghost

julia> dummy = rand(Float32, 78, 1);

julia> model = ONNX.load("./classifier_DF.onnx", dummy);

julia> x = range(0, Float32(0.5), length=78)
0.0f0:0.0064935065f0:0.5f0

julia> result = Ghost.play!(model, x)

Moelf

• UnROOT.jl -- ROOT I/O in pure Julia: https://github.com/JuliaHEP/UnROOT.jl
• UnROOT.jl JOSS paper: https://joss.theoj.org/papers/bab42b0c60f9dc7ef3b8d6460bc7229c
• HiggsCombine / HistFactory in pure Julia: https://github.com/JuliaHEP/LiteHF.jl
• Histogram + plotting in pure Julia: https://moelf.github.io/FHist.jl/dev/notebooks/makie_plotting/
• Benchmark: https://github.com/Moelf/UnROOT_RDataFrame_MiniBenchmark

more links:

• JuliaHEP organization: https://github.com/JuliaHEP/
• Julia official discourse HEP tag: https://discourse.julialang.org/tag/hep, also join us at #hep on official slack.
• mailist: https://groups.google.com/g/julia-hep

Moelf

Numpy is absurd

HN Discussion

I always gripe about Python not having useful (i.e. performant and with adoption) built-in array type and Numpy doesn't distinguish "vector of vector" from "matrix", but this still surprised me.

in is actually intersect?

It seems that Numpy uses intersect logic to check a in b:

Moelf

using Cairo, LinearAlgebra
c = CairoRGBSurface(256,256);
cr = CairoContext(c);

save(cr);
set_source_rgb(cr,0.8,0.8,0.8);    # light gray
rectangle(cr,0.0,0.0,256.0,256.0); # background
fill(cr);
restore(cr);

Moelf

#= one can use these to test fastmath-like path in controlled way
@inline mul_fast(x::T, y::T) where {T<:Complex} =
        T(complex(muladd(-imag(x), imag(y), real(x)*real(y)),
                  muladd( real(x), imag(y), imag(x)*real(y))))

@inline abs2_fast(z::Complex) = muladd(real(z), real(z), imag(z)*imag(z))
=#

function run_julia(height, width)
    y = range(-1.0f0, 0.0f0; length = height)

Moelf

https://howlongtobeat.com/

julia> get_hour("horizon zero dawn")44.0

julia> get_hour("Celeste")
8.0

julia> get_hour("Portal 2")
21.0

Moelf

[Security]
EAP-Method=TTLS
EAP-Identity=anonymous@harvard.edu
EAP-TTLS-CACert=/var/lib/iwd/usertrustrsacertificationauthority.cer
EAP-TTLS-ClientKeyBundle=/var/lib/iwd/blah.p12
EAP-TTLS-ClientKeyPassphrase=<> # your certification password
EAP-TTLS-Phase2-Method=Tunneled-PAP
EAP-TTLS-Phase2-Identity=<harvard id>@g.harvard.edu
EAP-TTLS-Phase2-Password=<> # your harvard key password