allyraza

#if __has_include(".extend.Xresources")
#include ".extend.Xresources"
#endif

Xft.dpi: 96
Xft.antialias: true
Xft.hinting: true
Xft.rgba: rgb
Xft.autohint: false
Xft.hintstyle: hintslight

allyraza

#include <iostream>

using namespace std;

/*
PSH 5       ; pushes 5 to the stack
PSH 10      ; pushes 10 to the stack
ADD         ; pops two values on top of the stack, adds them pushes to stack
POP         ; pops the value on the stack, will also print it for debugging
SET A 0     ; sets register A to 0

allyraza

function createNode(value) {
  return {
    value: value,
    left: null,
    right: null
  };
}

function addNode(node, value) {
  while (true) {

allyraza

Flow: Actor-based Concurrency with C++

Engineering challenges

FoundationDB began with ambitious goals for both high performance per node and scalability. We knew that to achieve these goals we would face serious engineering challenges while developing the FoundationDB core. We'd need to implement efficient asynchronous communicating processes of the sort supported by Erlang or the Async library in .NET, but we'd also need the raw speed and I/O efficiency of C++. Finally, we'd need to perform extensive simulation to engineer for reliability and fault tolerance on large clusters.

To meet these challenges, we developed several new tools, the first of which is Flow, a new programming language that brings actor-based concurrency to C++11. To add this capability

allyraza

Papers

This list is adapted from the lecture plan for the "Advanced Topics in Computer Systems" course at Berkeley, which is available here: https://people.eecs.berkeley.edu/~kubitron/cs262/index_lectures.html

Thanks to Anthony Joseph and John Kubiatowicz for putting the original list together.

Introduction to the course, some basic philosophy, UNIX system.

allyraza

http://kasterma.net/teach.html

https://learn.saylor.org/course/view.php?id=81

allyraza

1. General Background and Overview

• Probabilistic Data Structures for Web Analytics and Data Mining : A great overview of the space of probabilistic data structures and how they are used in approximation algorithm implementation.
• Models and Issues in Data Stream Systems
• Philippe Flajolet’s contribution to streaming algorithms : A presentation by Jérémie Lumbroso that visits some of the hostorical perspectives and how it all began with Flajolet
• Approximate Frequency Counts over Data Streams by Gurmeet Singh Manku & Rajeev Motwani : One of the early papers on the subject.
• [Methods for Finding Frequent Items in Data Streams](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.187.9800&rep

allyraza

The introduction to Reactive Programming you've been missing

(by @andrestaltz)

---

This tutorial as a series of videos

If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.

---

allyraza

https://www.quora.com/What-are-some-of-the-open-source-projects-in-IoT

http://www.kaaproject.org/category/webinar/

allyraza

# it is simple and straight forward ecto has a method has_many/3 that takes a through option here is simple exmaple


# group.ex

schema "groups" do
  has_many :group_users, MyApp.GroupUser
  has_many :users, through: [:group_users, :user]
end