Aj Gappmark ajgappmark

## ecc.py
# Basics of Elliptic Curve Cryptography implementation on Python
import collections


def inv(n, q):
    """div on PN modulo a/b mod q as a * inv(b, q) mod q
    >>> assert n * inv(n, q) % q == 1
    """
    for i in range(q):
        if (n * i) % q == 1:

## goldwasser_micali.py
#!/usr/bin/env python
# encoding: utf8
from unicodedata import normalize
from string import ascii_letters
from random import randint

# Miller-Rabin probabilistic primality test (HAC 4.24)
# returns True if n is a prime number
# n is the number to be tested
# t is the security parameter

## bansheeserver.py
#!/usr/bin/env python

#Copyright (C) 2009 Nikitas Stamatopoulos
# Modified by [email protected] 2009-10

#This program is free software: you can redistribute it and/or modify
#it under the terms of the GNU General Public License as published by
#the Free Software Foundation, either version 3 of the License, or
#(at your option) any later version.

## ruby-dbus-and-banshee.rb
#!/usr/bin/env ruby

require 'dbus'

bus = DBus::SessionBus.instance

banshee_service = bus.service("org.bansheeproject.Banshee")

banshee = banshee_service.object("/org/bansheeproject/Banshee/PlayerEngine")
puts banshee.introspect

## n_queens.py
# Solve n-queens problem with picosat
import pycosat
import numpy
import itertools

def get_cnf(N):
    cnf = []

    # * convert to object because pycosat expects 'int's
    # * add 1 because 0 is reserved in pycosat

## mongoose-cheatsheet.md

      
              1 file
            
          
              3 forks
            
          
                0 comments
              
            
              2 stars
            
          
                ajgappmark
                / mongoose-cheatsheet.md
            
            
              Created
              February 25, 2016 01:26
                — forked from subfuzion/mongoose-cheatsheet.md
            
              
                mongoose cheatsheet
              
          
    Definitely not comprehensive. This is meant to be a basic memory aid with links to get more details. I'll add to it over time.
Install

$ npm install mongoose --save

Connect

const mongoose = require('mongoose');


## gist:afbca177d1087013873c
    morseAlphabet ={
        "A" : ".-",
        "B" : "-...",
        "C" : "-.-.",
        "D" : "-..",
        "E" : ".",
        "F" : "..-.",
        "G" : "--.",
        "H" : "....",
        "I" : "..",

## google_drive_util.py
## Simple Python module to upload files to Google Drive
# Needs a file 'client_secrets.json' in the directory
# The file can be obtained from https://console.developers.google.com/
# under APIs&Auth/Credentials/Create Client ID for native application

# To test usage:
# import google_drive_util
# google_drive_util.login()
# google_drive_util.test()

## gist:b285c1c2f159be1c8e3136b787c36ac3

      
              1 file
            
          
              0 forks
            
          
                0 comments
              
            
              0 stars
            
          
                ajgappmark
                / gist:b285c1c2f159be1c8e3136b787c36ac3
            
            
              Created
              December 23, 2016 13:41
                — forked from learncodeacademy/gist:5f84705f2229f14d758d
            
              
                Getting Started with Vagrant, SSH & Linux Server Administration
              
          
    ###Let's install Vagrant###

Install VirtualBox: https://www.virtualbox.org/
Install Vagrant: http://vagrantup.com/

###Select a Vagrant Box from https://vagrantcloud.com###
#add it to your list of boxes
vagrant box add hashicorp/precise32
#create a new folder for your project &amp; init vagrant


## pyscript.py
#!/usr/bin/env python

"""A simple python script template.

"""

from __future__ import print_function
import os
import sys
import argparse
	# Basics of Elliptic Curve Cryptography implementation on Python
	import collections


	def inv(n, q):
	"""div on PN modulo a/b mod q as a * inv(b, q) mod q
	>>> assert n * inv(n, q) % q == 1
	"""
	for i in range(q):
	if (n * i) % q == 1:
	#!/usr/bin/env python
	# encoding: utf8
	from unicodedata import normalize
	from string import ascii_letters
	from random import randint

	# Miller-Rabin probabilistic primality test (HAC 4.24)
	# returns True if n is a prime number
	# n is the number to be tested
	# t is the security parameter
	#!/usr/bin/env python

	#Copyright (C) 2009 Nikitas Stamatopoulos
	# Modified by [email protected] 2009-10

	#This program is free software: you can redistribute it and/or modify
	#it under the terms of the GNU General Public License as published by
	#the Free Software Foundation, either version 3 of the License, or
	#(at your option) any later version.
	#!/usr/bin/env ruby

	require 'dbus'

	bus = DBus::SessionBus.instance

	banshee_service = bus.service("org.bansheeproject.Banshee")

	banshee = banshee_service.object("/org/bansheeproject/Banshee/PlayerEngine")
	puts banshee.introspect
	# Solve n-queens problem with picosat
	import pycosat
	import numpy
	import itertools

	def get_cnf(N):
	cnf = []

	# * convert to object because pycosat expects 'int's
	# * add 1 because 0 is reserved in pycosat
	morseAlphabet ={
	"A" : ".-",
	"B" : "-...",
	"C" : "-.-.",
	"D" : "-..",
	"E" : ".",
	"F" : "..-.",
	"G" : "--.",
	"H" : "....",
	"I" : "..",
	## Simple Python module to upload files to Google Drive
	# Needs a file 'client_secrets.json' in the directory
	# The file can be obtained from https://console.developers.google.com/
	# under APIs&Auth/Credentials/Create Client ID for native application

	# To test usage:
	# import google_drive_util
	# google_drive_util.login()
	# google_drive_util.test()
	#!/usr/bin/env python

	"""A simple python script template.

	"""

	from __future__ import print_function
	import os
	import sys
	import argparse