Skip to content
View SebastianPoell's full-sized avatar
🦆
🦆

Sponsoring

@slim-template
@anycable

Organizations

@LiveVoiceOfficial

Block or report SebastianPoell

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Please don't include any personal information such as legal names or email addresses. Maximum 100 characters, markdown supported. This note will be visible to only you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse

Pinned Loading

  1. pca.rb pca.rb
    1
    # This script implements a very basic PCA (Principal Component Analysis).
    2
    # PCAs are often used as statistical method on data sets to reduce
    3
    # dimensionality / complexity. This is done by finding new features which
    4
    # maximize variance. PCAs can reduce dimensionality down to any number,
    5
    # but lose information within the process. However, most of the time,
  2. boids.rb boids.rb
    1
    # This script simulates flocking behavior of boids (bird-oid objects), based
    2
    # on Craig Reynolds algorithm. Also inspired by: https://eater.net/boids.
    3
    # It could probably be better optimized for performance, e.g. by using
    4
    # Quadtrees. Utilizing the 'matrix' library for vector operations didn't
    5
    # seem to improve speed.
  3. phone_unlock_patterns.rb phone_unlock_patterns.rb
    1
    # This script calculates all possible paths through mobile phone unlock codes.
    2
    # Results are sorted in a depth first manner. There are exactly 389,498
    3
    # valid paths. However, Android only allows paths with length > 3, resulting
    4
    # in only 389,112 paths[1].
    5
    #
  4. needleman_wunsch.rb needleman_wunsch.rb
    1
    # This script is an implementation of the Needleman-Wunsch algorithm for
    2
    # sequence alignment (mostly used for nucleotide or protein sequences in
    3
    # bioinformatics). The algorithm works by first computing a similarity matrix
    4
    # and then backtrack the optimal paths. The scores/penalties for matches,
    5
    # mismatches and gaps can be set. Complexity is O(n*m) where n and m are the
  5. viterbi.rb viterbi.rb
    1
    # This script is a simple implementation of the famous Viterbi algorithm.
    2
    # Viterbi can find the best path of states through an HMM (Hidden Markov Model),
    3
    # given a sequence of observations. In the future, the HMM class could be
    4
    # extended to also support other algorithms (e.g. Forward or Baum-Welch).
    5
    #
  6. pile_of_sand.rb pile_of_sand.rb
    1
    # This script implements a simple cellular automaton to simulate sand,
    2
    # inspired by the game "Noita". View introduce a grid which holds
    3
    # boolean values (true means there is sand). Then, we define three
    4
    # simple rules how those cells evolve. Finally, we advance this grid
    5
    # over and over to get the simulation.