This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/usr/bin/env python | |
# -*- coding: utf-8 -*- | |
""" | |
Implementacion para entender cómo es el algoritmo de los Multiplicative | |
Scramblers. | |
Referencias: | |
- http://en.wikipedia.org/wiki/Scrambler#Multiplicative_.28self-synchronizing.29_scramblers |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/usr/bin/env python | |
# -*- coding: utf-8 -*- | |
""" | |
Alejandro Santos, [email protected] | |
Adaptador de un Iterador para saber si el Iterador original tiene | |
un proximo elemento. Igual que los iteradores de Java: | |
http://download.oracle.com/javase/1.5.0/docs/api/java/util/Iterator.html |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
[01:52] <alcuadrado> en 1928 Hilber propuso una serie de problemas matematicos que esperaba sean resueltos a lo largo del siglo XX, uno de ellos el Entscheidungsproblem, que planteba si se podia hacer un sistema o maquina que dada una formula de logica de primer orden te devuelva el valor de verdad de esta (True o False). | |
[01:53] <alcuadrado> este problema fue resuelto independientemente por dos personas, Church en 1936 | |
[01:53] <alcuadrado> y Alan Turing <3 en 1937 | |
[01:53] <alcuadrado> y lo resolvieron de formas radicalmente distintas | |
[01:54] <alcuadrado> Turing (el padre de la computacion) creo una abtraccion de lo que era para el la resolucion de un problema por parte de una persona en lo que se llama Maquina de Turing (la computadora mas basica del mundo) | |
[01:54] <alcuadrado> la clave de estas es que se tiene una memoria o estado, la cual se va mutando hasta obtener el resultado | |
[01:54] <alcuadrado> como funcionan las pcs de hoy en dia | |
[01:54] <alcuadrado> uno tiene el estado en la ram y se aplica una seri |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
>>> def f(): | |
... for x in xrange(10): | |
... print "Mi thread id: ", thread.get_ident() | |
... sys.stdout.flush() | |
... time.sleep(0.1) | |
... | |
>>> | |
>>> | |
>>> tt = [thread.start_new_thread(f, tuple()) for y in xrange(10)] | |
Mi thread id: >>> 139873167742720 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#! /bin/sh | |
# | |
# soundmodem Start Soundmodem driver. | |
# | |
# Author: Thomas Sailer, <[email protected]> | |
# | |
### BEGIN INIT INFO | |
# Provides: soundmodem | |
# Required-Start: $remote_fs $syslog $named $network $time |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
* Arduino SWR Meter | |
* Por Alejandro Santos LU4EXT ([email protected]) | |
* | |
* Conectar en Analog0 la salida de potencia directa, y en Analog1 la salida de reflejada. | |
* Creado para usarlo junto a un puente de ROE, por ejemplo el de XQ2FOD. | |
* http://ludens.cl/Electron/swr/swr.html | |
*/ | |
#include <LiquidCrystal.h> |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
#include <cmath> | |
#include <portaudio.h> | |
#define SAMPLE_RATE 22050 | |
int input_channels = 2; /* <<< THIS VALUE TO ZERO WORKS!! */ |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/usr/bin/env python | |
# -*- coding: utf-8 -*- | |
""" | |
Ref: http://listas.python.org.ar/pipermail/pyar/2014-January/027667.html | |
Sea f una función continua en [a, b], tal que f presenta un único | |
máximo en [a, b]. Por ejemplo f puede ser una parábola con los cuernos | |
hacia abajo, y f no puede ser de la forma de los cuernos de Sauron |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <openssl/bio.h> | |
#include <openssl/evp.h> | |
void base64calc(const unsigned char* msg, size_t msgsize, char* out, size_t outsize) { | |
BIO *bio, *b64, *mem; | |
// Shit, this base64 thing with openssl was hard to get right. | |
b64 = BIO_new(BIO_f_base64()); |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package test2; | |
import java.util.Random; | |
import org.apache.commons.logging.Log; | |
import org.apache.commons.logging.LogFactory; | |
import com.espertech.esper.client.Configuration; | |
import com.espertech.esper.client.EPAdministrator; | |
import com.espertech.esper.client.EPRuntime; |
OlderNewer