j-keck

dnsmasq from package 'dnsmasq-base' starts with a (from libvirt) generated configuration: /var/lib/libvirt/dnsmasq/default.conf.
this configuration file is not directly editable because it gets overwritten from libvirt.
there is no possibility to set 'no-dhcp-interface=eth0' per 'libvirt'.
 
# ###########################################################
# deactivate dhcp in dnsmasq per libvirt
 
# dnsmasq listen on port 53 (dns) and 67 (dhcp)
j@ubuntu:~$ sudo netstat -taupen | grep -E ':53|:67'
tcp 0 0 192.168.122.1:53 0.0.0.0:* LISTEN 0 9817 1218/dnsmasq

j-keck

linux:
 
# drop packets (10% probability)
 
iptables -A INPUT -m statistic --mode random --probability 0.1 -j DROP
iptables -A OUTPUT -m statistic --mode random --probability 0.1 -j DROP
 
# drop packets (10% probability), add latency (500ms) and limit bandwidth (1Mbps)
 
tc qdisc add dev eth0 root netem delay 250ms loss 10% rate 1mbps

j-keck

* print generated code: scala -Xprint:typer <scala file>

* compiler phases: scalac -Xshow-phases
* show generated code: scala -Xprint:<phases> (-Xprint:typer or -Xprint:1-14 or -Xprint:all)
* show generated code in gui: scala -Ybrowse:<phases>



scalac options in sbt [source](http://tpolecat.github.io/2014/04/11/scalac-flags.html):

j-keck

from: http://play.golang.org/p/P5DDZrcXZB

package main

import "fmt"

type Monad interface {
	Bind(func(interface{}, Monad) Monad) Monad
	Return(interface{}) Monad
}

j-keck

PROGRAMMING WITH EFFECTS
Graham Hutton, January 2014

Shall we be pure or impure?

The functional programming community divides into two camps:

 o "Pure" languages, such as Haskell, are based directly
   upon the mathematical notion of a function as a
   mapping from arguments to results.

j-keck

# tcpdump

* HTTP GET request

        tcpdump -s 0 -A 'tcp[((tcp[12:1] & 0xf0) >> 2):4] = 0x47455420'
        
* HTTP POST

        tcpdump -s 0 -A 'tcp dst port 80 and (tcp[((tcp[12:1] & 0xf0) >> 2):4] = 0x504f5354)'
        

j-keck

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

j-keck

/*
The MIT License (MIT)

Copyright (c) 2016 j-keck <jhyphenkeck@gmail.com>

Permission is hereby granted, free of charge, to any person obtaining a copy of this 
software and associated documentation files (the "Software"), to deal in the Software 
without restriction, including without limitation the rights to use, copy, modify, 
merge, publish, distribute, sublicense, and/or sell copies of the Software, and to 
permit persons to whom the Software is furnished to do so, subject to the following conditions:

j-keck

{-# LANGUAGE OverloadedStrings #-}
module Main where

import           Control.Exception       (SomeException, try)
import           Control.Lens
import qualified Data.ByteString.Lazy    as BL
import           Network.Connection      (TLSSettings (..))
import           Network.HTTP.Client.TLS (mkManagerSettings)
import           Network.Wreq

j-keck

#!/usr/bin/env perl
#
# save systemd journal logs to a postgres instance
#
#
#  * first run with '-init-db' to intialize the database
#  * second run to load all logs
#    (maybe with '-journalctl-args "-n 1000000"')
#  * the following runs inserts only new log entries
#