awood

What I Know About PKI

Abstract Syntax Notation One (ASN.1)

Much of the data in the PKI world is stored in ASN.1 so a basic understanding is necessary. ASN.1 is a way to describe data by starting from primitive types and building up to more complex types. Do you remember Backus-Naur Form? What about writing XML schemas in XSD? It's the same concept.

Let's say we have a Widget. Every Widget has a model name, a serial number, and some inspection information with the name of the inspector and the dates of the inspections. Our Widget then looks like this in ASN.1:

Widget ::= SEQUENCE {
    model IA5String, 

serialNumber INTEGER,

iamnewton

Regular Colors

Value	Color
\e[0;30m	Black
\e[0;31m	Red
\e[0;32m	Green
\e[0;33m	Yellow
\e[0;34m	Blue
\e[0;35m	Purple

headius

Title: Foreign Function Interface Author: Charles Oliver Nutter Organization: Red Hat Owner: Charles Oliver Nutter Created: 2014/01/28 Type: Feature State: Draft Exposure: Open Component: --/-- Scope: JDK

guillaumebort

def forceHttps(handler: Handler, request: RequestHeader): Handler = {
    (isHTTPSRequired, isRequestSecure(request), request.method, request.uri) match {
      
      // HTTPS is supported but not required for the API
      case (_, _, _, uri) if uri.startsWith("/api") => handler
      
      // HTTPS is required here, redirect GET requests
      case (true, false, "GET", uri)                => Action(Results.Redirect(s"https://${request.domain}${request.uri}"))
      
      // HTTPS is required but we can't redirect

debasishg

General Background and Overview

1. 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.
2. Models and Issues in Data Stream Systems
3. 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
4. Approximate Frequency Counts over Data Streams by Gurmeet Singh Manku & Rajeev Motwani : One of the early papers on the subject.
5. [Methods for Finding Frequent Items in Data Streams](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.187.9800&rep=rep1&t

tnolet

#!/bin/bash
# Perform installation as root
# Install prereqs

yum -y install libcurl libcurl-devel rrdtool rrdtool-devel rrdtool-prel libgcrypt-devel gcc make gcc-c++

# Get Collectd, untar it, make it and install

wget http://collectd.org/files/collectd-5.4.0.tar.gz
tar zxvf collectd-5.4.0.tar.gz

tbroyer

UPDATE: This is now available as a plugin https://github.com/tbroyer/gradle-errorprone-plugin

To use it, just add the following to your build.gradle and it'll change all JavaCompile tasks to use the error-prone compiler:

apply from: 'https://gist.github.com/tbroyer/6847494/raw/errorprone.gradle'

ismell

#!/bin/bash -e

IFADDR="192.168.3.1/24"

if [[ ! ip link show docker0 ]]; then
  ip link add docker0 type bridge
  ip addr add "$IFADDR" dev docker0
  ip link set docker0 up
  iptables -t nat -A POSTROUTING -s "$IFADDR" ! -d "$IFADDR" -j MASQUERADE
fi

glebm

#!/usr/bin/env ruby
require 'base64'
require 'open-uri'

# file or url
def get_css(src)
  if src.start_with? 'http'
    src = src.gsub('|', '%7C')
    STDERR.puts "# GET #{src}"
    # simulate modern browser to get woff

skybrian

// Solve Every Sudoku Puzzle in Dart
// A translation of: http://norvig.com/sudopy.shtml
// Translated by Brian Slesinsky

// See http://norvig.com/sudoku.html

// Throughout this program we have:
//   r is a row,     e.g. 'A'
//   c is a column,  e.g. '3'
//   s is a square,  e.g. 'A3'