| // It is important to declare your variables. | |
| (function() { | |
| var foo = 'Hello, world!'; | |
| print(foo); //=> Hello, world! | |
| })(); | |
| // Because if you don't, the become global variables. | |
| (function() { |
| function cross_domain_JSON_call(url){ | |
| // url points to a JSON feed | |
| // eg http://openlylocal.com/committees.json?council_id=111 | |
| url="http://pipes.yahoo.com/ouseful/jsonproxy?url="+encodeURIComponent(url)+"&_render=json&_callback=?"; | |
| $.getJSON( | |
| url, | |
| function(data) { myCallbackFunction(data.value.items[0]); } | |
| ) |
Base URL: https://www.google.com/speech-api/v1/recognize
It accepts POST requests with voice file encoded in FLAC format, and query parameters for control.
client
The client's name you're connecting from. For spoofing purposes, let's use chromium
lang
Speech language, for example, ar-QA for Qatari Arabic, or en-US for U.S. English
| mergesort = (input) -> | |
| n = input.length | |
| if n == 1 | |
| return input | |
| pivot = Math.floor n/2 | |
| a = mergesort input[0...pivot] # coffee script does not include the last element in a slice | |
| b = mergesort input[pivot...n] | |
| merge(a, b) | |
| merge = (a, b) -> |
| #!/usr/bin/ruby | |
| # | |
| # If you want to understand how this script works, I'd recommend starting to read it | |
| # at the "entry point" where it starts validating and parsing the arguments---just | |
| # look for the lines interacting with ARGV to get the initial list of cards. From | |
| # there you can follow how it generates the full set of candidate melds (which may | |
| # overlap) and then how it builds a "tree" where each path to a leaf node defines a | |
| # non-overlapping set of melds. | |
| usage = "deadwood.rb: |
##BLOG ON CRYPTOGRAPHY
Today, people in general relate to cryptography mostly in regard to the security of their passwords. The passwords are worthless if others have resources to know it.
Today most of the websites dont simply use cryptographic hash functions like SHA256, MD5 etc. directly on the password. Instead random bits ( salt ) are added while encrypting them so that even when two users enter the same password the hashes that are generated are different from each other.
Hashes like SHA1 , SHA256, MD5 etc. are general purpose hashes. They have been designed to hash a large amount of data as quickly as possible.
An encryption algorithm for securely storing your password should have the following characteristics:
| This playbook has been removed as it is now very outdated. |
| %!PS-Adobe-3.0 | |
| % Title: dot grid paper, 5x5 mm | |
| %%BeginSetup | |
| %%BeginFeature: *PageSize A4 | |
| << /PageSize [ 595.27 841.889 ] | |
| /ImagingBBox null | |
| >> setpagedevice | |
| %%EndFeature | |
| %%EndSetup |
| /* Cranium MVC | |
| * A minimalist MVC implementation written for | |
| * demonstration purposes at my workshops | |
| * http://addyosmani.com | |
| * Copyright (c) 2012 Addy Osmani; Licensed MIT */ | |
| var Cranium = Cranium || {}; | |
| // Set DOM selection utility |