duplicates = multiple editions
A Classical Introduction to Modern Number Theory, Kenneth Ireland Michael Rosen
A Classical Introduction to Modern Number Theory, Kenneth Ireland Michael Rosen
| # -*- coding: utf-8 -*- | |
| """ | |
| Created on Fri Jun 15 14:00:29 2012 | |
| Author: Josef Perktold | |
| License: MIT, BSD-3 (for statsmodels) | |
| http://en.wikipedia.org/wiki/Distance_correlation | |
| Yaroslav and Satrajit on sklearn mailing list |
| import java.util.Arrays; | |
| import java.util.Comparator; | |
| public class NormalizedGini { | |
| private static double gini(double[] a, double[] p, double[] w) { | |
| int len = a.length; | |
| if (p.length != len || w.length != len) { | |
| throw new IllegalArgumentException("array length not equal"); | |
| } |
| # Original code from tinrtgu on Kaggle under WTFPL license | |
| # Relicensed to BSD 3-clause (it does say do what you want...) | |
| # Authors: Kyle Kastner | |
| # License: BSD 3-clause | |
| # Reference links: | |
| # Adaptive learning: http://static.googleusercontent.com/media/research.google.com/en//pubs/archive/41159.pdf | |
| # Criteo scalable response prediction: http://people.csail.mit.edu/romer/papers/TISTRespPredAds.pdf | |
| # Vowpal Wabbit (hashing trick): https://github.com/JohnLangford/vowpal_wabbit/ | |
| # Hashing Trick: http://arxiv.org/pdf/0902.2206.pdf |
| Latency Comparison Numbers | |
| -------------------------- | |
| L1 cache reference 0.5 ns | |
| Branch mispredict 5 ns | |
| L2 cache reference 7 ns 14x L1 cache | |
| Mutex lock/unlock 25 ns | |
| Main memory reference 100 ns 20x L2 cache, 200x L1 cache | |
| Compress 1K bytes with Zippy 3,000 ns | |
| Send 1K bytes over 1 Gbps network 10,000 ns 0.01 ms | |
| Read 4K randomly from SSD* 150,000 ns 0.15 ms |
| """ | |
| Implementation of pairwise ranking using scikit-learn LinearSVC | |
| Reference: "Large Margin Rank Boundaries for Ordinal Regression", R. Herbrich, | |
| T. Graepel, K. Obermayer. | |
| Authors: Fabian Pedregosa <fabian@fseoane.net> | |
| Alexandre Gramfort <alexandre.gramfort@inria.fr> | |
| """ |
| object test { | |
| def main(args: Array[String]) { | |
| println("Hello World!") | |
| } | |
| } |
| apt-get -y install build-essential libssl-dev libqrencode-dev libminiupnpc-dev git libz-dev libbz2-dev python2.7-dev | |
| git clone https://github.com/dogecoin/dogecoin.git | |
| wget -O boost_1_55_0.tar.gz http://sourceforge.net/projects/boost/files/boost/1.55.0/boost_1_55_0.tar.gz/download | |
| tar -xvzf boost_1_55_0.tar.gz | |
| cd boost_1_55_0 | |
| ./bootstrap.sh --prefix=/usr | |
| ./b2 stage threading=multi link=shared | |
| ./b2 install threading=multi link=shared | |
| cd /home/user/dogecoin/src | |
| make -f makefile.unix |
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