Entradas

Hacker, notable cases and techniques

Imagen
Anonymous The wanted hacker that watches over the freedom of expression of the citizens all around the world. Anonymous is a group of users who protests in support freedom of expression, access to information, the Internet's independence and against various organizations like Daesh or gobernment censorship systems.   Since there is no hierarchy, it is generally difficult to confirm the authenticity of news or information regarding Anonymous. They are difusely organized on the web, which makes it difficult to find anything official related to them. However, this community of people organizes operations, discusses the state of certain countries and other issues using various online channels. Because there is no leadership or membership in an administrative sense, and the collaboration has no commitment, its structure can be compared to that of an anarchist movement.  In January 2011, British police arrested five males between the ages of 15 and 26 suspected of involvement i...

hdr

Imagen
 

prácticas GIMP

Imagen
 
 IP privada: 10.227.63.1 IP pública: 217.9.26.185 getaway (puerta de enlace): 10.227.63.1 DNS primario:172.23.136.5 DNS secundario:172.23.144.5 Dirección MAC: 4c:cc:6a:fc:48:43 Tiempo de respuesta al compañero de la derecha: 0,26 ms Direción IP de www.google.es:  142.250.200.99 Tiempo de respuesta de www.google.es: 6.828ms

codigo raqueta

int bolaX=400,bolaY=300,velX=5,velY=5,raquetaX,points=0; int level=1; void setup(){ size(800,600); fill(0); rectMode(CENTER); } void draw(){ background(255); bola(); raqueta(); textSize(20); text("POINTS: " + points,50,50); text("LEVEL: " + level,50,70); if(bolaY>600){ background(0); textSize(50); fill(255); text("GAME OVER",250,200); stop(); text("FINAL POINTS: " + points,250,300); text("FINAL LEVEL: " + level,250,400); } } void raqueta(){ raquetaX=mouseX; if (raquetaX>750){ raquetaX=750; } if (raquetaX 520 && raquetaX-50 775){ velX=-velX; } if (bolaY

compression

Its called compression when you reduce the number of bits by counting the number of them together and is based on redundancy. Its commonly used in hexadecimal code, but I will use binary now to explain it betterExample: 111111000001010000000010100 -> (27 bits) uncompressed (6,1) (5,0) (1,1)(1,0)(1,1)(8,0)(1,1)(1,0)(1,1)(2,0)-> (20 bits) compressed There are two types of compression: Its called lossless compression when the compressed file is exactly the same as the original one.  On the other hand we have statistic compression, when you make little changes conveniently to compress it even more. Quality is lost in this proccess. This change is not perceptible in images and sounds, but can't be done in other situations. Example: 1111111110111111100000000 -> (9,1)(1,0)(7,1)(8,0) 111111111 1 111111100000000 -> (17,1)(8,0)