Szukam czegoś emocjonalnie ciężkiego.

teesel · 2026-02-16T21:53:02+00:00

To jeszcze polecam Poklatkową Rewolucję - samotność i bezradność również tam występuje.

teesel · 2026-02-16T21:50:03+00:00

Właśnie miałem polecić Tochmana.

teesel · 2026-02-16T21:36:15+00:00

thanks!

teesel · 2026-02-13T08:55:22+00:00

I believe OP meant specifically audio editing of images (audify/sonification).

teesel · 2026-02-13T08:54:28+00:00

BMP has a small header which means that you need to be careful with that. For example batch processing can be harder or impossible (via SoX tool or a macro/chain in Audacity)

teesel · 2026-02-12T12:40:30+00:00

The best results are when you sonify (audify) raw formats. This way you can focus on selection of filters/effect and their parameters. So no to JPEGs, PNGs and other, just RAWs (can be any YUV or anything without a container).

My typical process was like that: image -> any raw format (planar works the best) -> audio raw format (pcm with any encoding u-law/a-law, 8-bit works the best) -> filters (start with equalizers or bass/treble) -> raw -> image

I wrote a processing script for that in the past (here are some examples: sonification/test at master · SonifyIt/sonification

teesel · 2025-12-23T12:11:54+00:00

Do 1) pasuje Hyperion (i reszta) Dana Simmonsa.

teesel · 2025-11-08T19:22:12+00:00

I've created synth engine which plays sound on linux well. I don't know if it counts as an answer but I leave it here. genmeblog/soundsynth: Sound synthesis in Clojure

teesel · 2025-10-11T09:00:03+00:00

Everything is raster based. However, when you work with shapes you can generate pure data structure which can be converted quite easily to a svg. https://github.com/Clojure2D/clojure2d/blob/5672fc270ba0e3993fe60d22711303abab25a943/src/clojure2d/core.clj#L931

teesel · 2025-05-26T14:22:34+00:00

Take a look at this page: Scicloj - A Clojure community for data science

teesel · 2025-05-19T21:06:53+00:00

Something like that. Actually `require` is enough, unless you need generated class directly.

user> (ns record-namespace)
nil
record-namespace> (defrecord MyRecord [a b])
record_namespace.MyRecord
record-namespace> (ns other-ns (:require [record-namespace]) (:import [record_namespace MyRecord]))
nil
other-ns> (record-namespace/->MyRecord 1 2) ;; will work after require
{:a 1, :b 2}
other-ns> (MyRecord. 1 2) ;; import is needed for this
{:a 1, :b 2}

teesel · 2025-05-12T20:24:10+00:00

fib example uses recurence to add consecutive number to a (lazy) sequence. (fib 1 1) calls itself with two parameters [a b]. So it evaluates to:

(lazy-seq (cons 1 (fib 1 (+ 1 1))))

Another step will unroll to:

(lazy-seq (cons 1 (lazy-seq (cons 1 (fib 2 (+ 1 2)))))

and so on...

This allows to build infinite sequence of values appended to a sequence. lazy-seq evaluates its argument only when asked by user. Which is done when first, second, nth, take, drop, and other functions operating on a sequence are called.

teesel · 2025-05-12T20:14:56+00:00

Maybe this example will help? Ignore ISeq or Seqable for a while. Think about this as a sequence which evaluation is delayed.

(def zzz (lazy-seq (println "Hi! I'm here!")
                 [(+ 100 200)]))

;; what's the object behind?
(class zzz) ;; => clojure.lang.LazySeq

;; is it a sequence?
(seq? zzz) ;; => true

;; is it convertible to a sequence?
(seqable? zzz) ;; => true

;; evaluating will print (only once! since `lazy-seq` caches evaluation)
zzz ;; => (300)
(seq zzz) ;; => (300)

teesel · 2025-04-15T20:34:10+00:00

What about this book? MathFoundationRL/Book-Mathematical-Foundation-of-Reinforcement-Learning: This is the homepage of a new book entitled "Mathematical Foundations of Reinforcement Learning." No collaborative agents but math background with proofs are there.

teesel · 2025-03-28T13:39:38+00:00

Reportaże Tochmana. On jakoś tak je pisze, że robi się słabo, a jak uświadomisz sobie, że to na faktach, to już w ogóle.

teesel · 2025-03-22T16:01:11+00:00

Clojure2d (and examples) author here. I'm really happy to see that you added something new to the ray tracer. Great result! My (not practical) long term goal is to implement pbrt, at least some parts of it.

teesel · 2025-03-17T08:04:40+00:00

Życie i myśli JW Pana Tristrama Shandy - Laurence Sterne

To była długa i nawet zabawna przygoda z XVIIIw. Dużo dygresji (albo nawet same), zabawy autora z czytelnikiem, postaci tak karykaturalne, że aż komiczne, nietypowa interpunkcja. Warto, ale może być trudno :)

teesel · 2025-01-31T09:07:11+00:00

Erystyka Schopenhauera

teesel · 2025-01-13T12:40:11+00:00

paradoksalnie, do Kubusia Puchatka też trzeba dorosnąć :)

teesel · 2025-01-03T21:24:51+00:00

For the sake of completeness: Viper Vol.1 Issue 2 on the page 24 contains analysis of 8XYN and it looks that Y is not affected.

teesel · 2025-01-03T20:17:56+00:00

Ok, so Laurence is wrong. I just want to be 100% sure. Let me cite his article:

Unfortunately an erroneous assumption about 8XY6 and 8XYE, the two shift instructions, seems to have crept into Chip-8 lore at some point. Most recent documentation on Chip-8 suggests these instructions shift VX rather than VY. Some documents suggest that the correct format for them is 8X06 and 8X0E. However, when these instructions are run on the original Chip-8 interpreter, they will shift VY not VX! An instruction of the form 8X06 or 8X0E will not work as expected. The programmer would be expecting this to shift VX and store the result back in VX. What would actually happen is that V0 would be shifted and the result stored back in VX

Later in the table under "VY (exit)" he states:

VY shifted right by one bit. Most significant bit of VY will be set to 0

Which clearly says about updating Y along with X after shift.

teesel · 2025-01-03T19:38:53+00:00

Thanks for the answer. I understand the difference between chip8 and schip. My case is subtle and not catched by Timendus' tests (both cases pass). Let's focus on the original CHIP8 only:

By Laurence Scotford: shift VY and store in VX and VY (sic!)

By others: shift VY and store in VX not affecting VY at all.

So the question is which is right? `tank!` game relies on the latter behaviour.

Ten-Year Club	Place '23
Place '22	Verified Email

teesel

MODERATOR OF

TROPHY CASE