tech3java

This is my Java playground...

Applications Map

Numerics

• Example 1: Monte Carlo integration
• Example 2: Area calculation of a circle using Monte Carlo integration
• Example 3: Using ND4j INDArray class

Statistics

• Example 1: Goodness of fit of regression line
• Example 2: Basic scatter plot
• Example 3: Simulate the standard error for the mean is 1/sqrt(n)
• Example 4: Compute basic statistics
• Example 5: Compute the mean, standard deviation and correlation of two variables
• Example 6: Vanilla bootstrap for the mean
• Example 7: Vanilla bootstrap for skewness
• Example 8: Almost sure convergence

Machine Learning

• Example 1: Classification with vanilla KNN algorithm
• Example 2: Using LinearRegressor class
• Example 5: Using Batch Gradient Descent with only one feature
• Example 6: Batch Gradient Descent with two features
• Example 7: Using NonLinearRegressor class
• Example 8: Using ThreadedKNNClassifier class
• Example 9: Classification with LogisticRegression class
• Example 10: Linear regression with regularization LassoRegularizer and RidgeRegularizer
• Example 11: Clustering with KMeans
• Example 12: Using the ConfusionMatrix class

Reinforcement Learning

• Example 1: Iterative Policy Evaluation applied on GridWorld

Estimation

• Example 1: Kalman Filter
• Example 2: Extended Kalman Filter
• Example 3: Unscented Kalman Filter
• Example 4: Particle Filter
• Example 5: Histogram Filter

Control

Java Threads

• Example 1: Get the sum of the elements of an array
• Example 2: Parallel trapezoid rule
• Example 3: Producer/Consumer pattern
• Example 4: Using the ExecutorService interface
• Example 5: Using the CyclicBarrier class
• Example 6: Using the Lock interface

Algorithms

• Example 1: Delete duplicated elements in a sorted linked list
• Example 2: Vanilla implementation of binary search
• Example 3: Fibonacci Sequence
• Example 4: Finds first non-repeated character in a string
• Example 5: Finds first occurence of a character in a string
• Example 6: Find the minimum element between two increasingly sorted sub-arrays
• Example 7: Reverse an array using a stack
• Example 8: Solves the Tower of Hanoi problem using stacks
• Example 9: Sorts cars of a train according to destination
• Example 10: Find number of digits in an integer
• Example 11: Partition an array into odds and evens
• Example 12: Compute the equivalence classes of a list of numbers
• Example 13: Test if a given string is a palindrome
• Example 14: Fibonacci sequence calculation
• Example 15: Factorial calculation without recursion
• Example 16: Test if a word is an anagram of another
• Example 17: Given a list of words get all the anagrams of a given string
• Example 18: Reverse single linked list in place
• Example 19: Find the binary representation of an integer
• Example 20: Given an array and a value remove all instances of that value in place and return the new array length
• Example 21: Merge two sorted linked lists
• Example 22: Print the value of a node in as singly linked list by counting backwards.
• Example 23: Delete duplicate elements in a sorted singly linked list
• Example 24: Detect cycle in a single linked list
• Example 25: Text editor with stack
• Example 26: Balanced brackets

Useful Links