Introduction In this post I will outline how to run tasks/jobs that have dependencies on other tasks such as builds or testing. When one task is dependent on another it means that the task cannot be be started or executed until it has the results from a previous task/job. Imagine you plan on making an omelette, this task requires that you have eggs among other things. We can say then that this task, “make-omelette”, has a dependency on eggs.

In this post we will implement the K-Means Clustering algorithm in python. You will not need to know any python libraries such as numpy or pandas as this will be done in vanilla python. The key take aways here are: The algorithm by itself is naive, and not guaranteed to converge on the best fit centroid locations We need an optimizer of sorts to find an acceptable centroid fit Setup To generate your own fake data sets and try out a basic implementation of the k-means algorithm download and run the following file kmeans.

So I built a game engine in javascript using Vue.js to do the rendering. It’s in an in-progress project, and therefore this post is as well. Play here

I decided to write this post as the result of attempting to find a pattern for executing any number of asynchronous tasks in a specified order with javascript. It came as a surprise to me that this isn’t supported out of the box in any modern browers javascript engine. After googling around for a few minutes I came across this related blog post Decembersoft Inc. which comes close but doesn’t yield a working solution.