Gleethos

u/Gleethos


r/java•

...and it is still just Swing.

For the last few years, our team at Global TCAD Solutions has been building our products on top of an open-source library called SwingTree.

The idea behind it was pretty straightforward: we wanted to keep Swing but get rid of a lot of the tedious ceremony that comes with when building modern UIs in it.

So instead of constructing and wiring up a component hierarchy imperatively, you can describe it declaratively:

UI.panel("fill")

.add("grow",

UI.button("Hello")

.onClick(it -> doSomething())

);

On top of declarative code, SwingTree also ships a versatile styling API.

It has a CSS-inspired style engine with selectors, specificity, cascading, semantic gro

7666

r/java•

Feel free to let me know what you think! :)

https://github.com/Gleethos/neureka

Here's a simple 2 layer neural network:

var X = Tsr.ofDoubles().withShape(4,3).andFill(0d, 0d, 1d, 0d, 1d, 1d, 1d, 0d, 1d, 1d, 1d, 1d);
var y = Tsr.ofDoubles().withShape(1,4).andFill(0d, 1d, 1d, 0d).T();
var W1 = Tsr.ofRandom(Double.class, 3, 4).setRqsGradient(true);
var W2 = Tsr.ofRandom(Double.class, 4, 1).setRqsGradient(true);
for ( int i = 0; i < 60; i++ ) {
    var l2 = Tsr.of("sig(",Tsr.of("sig(",X,"@",W1,")"),"@",W2,")");
    l2.backward(Tsr.of(y,'-',l2)); // Back-propagating the error!
    W1.applyGradient(); W2.applyGradient();
201

r/groovy•

I wanted to understand deep learning and tensor maths experimentally...
So after endless trial and error coding around this topic...

I ended up building my own little light weight platform independent tensor library:
https://github.com/Gleethos/neureka

It is OpenCL accelerated and therefore, unlike Pytorch or Tensorflow, not tied to Nvidia GPU's only.
Even FPGA's should work.

Besides the dynamically compiled CL kernels there is no native code involved.

It should run anywhere!

Compared to the big ML-Frameworks it
is of course not much. It's still a tiny one man project...
But I think it nails the basics.

I would really love to see some c

100

r/Iota•

The tangle white paper states that the proof of work determines the weight of the transaction by a factor of 3^n . It says that the weight represents the "importance" of a transaction. The white paper also claims that this is a measure to protect the tangle from spam attacks. To me that makes perfect sense: If the approval of transactions with bigger weights is being preferred then that means that the difficulty of the whole network (or parts of it) can easily adapt to spam attacks! So if an attacker tries to spam the network with low weighted transactions he will eventually run into the problem that his transactions will not get confirmed anymore due to the fact that the pow difficulty has

2415

You've reached the end of this feed.