超级计算机和加密和压缩@的速度为96％ [英] Supercomputer and encryption and compression @ rate of 96%
问题描述
超级计算机和加密和压缩@的速度为96％
拿一份文件或三维矩阵文件随机更改两个或者b / b $ b二进制代码或者只是一个0'和1'的程序并将它折叠起来
就像一张纸然后让1和0互相添加或者
0,1'相互抵消1 + 0 = 0和0 + 1 = 1 1 + 1 = 1 0 + 0 = 0如果你给了
折叠地址就像传播一样没有数学表格。
首先A 1-24将折叠到k 1-24。（参见示例A）然后在F1-24
下来两k 1-24（见例B）如果你写了一封非常长的字母
，然后把它改成两个二进制代码就会看起来像这样。
123456789 ..... ........ 24
a.01010101010101010101010
b.10010101010101010101010
c.01010101001010101010010
e.00010101000101010101010
f.10010101010100101010101首先A 24折成k 24下来
g.0101010101 0100001100101参见示例A
h.01001010101010101010111
I.11110111001101010101010
j.01010101010101010101010
k.10101010101010101010101
见例A
123456789 ............. 24
f.10010101010100101010101
g.01010101010100001100101
h.01001010101010101010111然后在F1-24下来两个k 1-24
I.11110111001101010101010
j.01010101010101010101010
k.10101010101010101010101
见例B
123456789 ............. 24
I.11110111001101010101010
j.01010101010101010101010然后从I 1-24到K 1-24
k.10101010101010101010101
123456789 ....................
j.01010101010101010101010然后从j-24到j-1
123456789 ......
j.010101010101然后从j-12到j-1
123456
j.010101然后从j-6到j1
123
j.010然后从j-3到j1
12
j.01然后从j-2到j1
j.0然后你会有
1位来转移
互联网
发送的位数为0密钥代码为F1-24，k 1-24，
I 1-24，K 1-24，j24，j1，j12，j1，j6，j1，j3，j1，j2 ，j1并且将解压缩或者是新的
加密，你可以加密或压缩100兆兆位，低至1位
信息。现在，如果你从我的网站上获取这个想法，你可以使这个分配更加复杂和牢不可破。数据加密360度
旋转文件90度并加密每个天使然后45度
改变它两个二进制代码一次又一次地做它并折叠它像一个
一张纸，然后将一个'和'零相互抵消。在
理论中，您可以向某人的计算机发送一个100太比特的程序，并且
让它解压缩并运行并安装或制作
A计算机处理器就像新的64位AMD有点解压缩成一个大bm驱动器和缓冲区使用一半的64位处理器解码
消息和主要64有点运行数字。另一种做的方式就是使用其中一个进程的并行计算机
运行压缩的1位信息给出未压缩的地址
$ ram驱动器上的b $ b改变甚至没有丢弃处理器然后
与每台机器上的不同信息进行比较并运行统计数据
有关45 tflops的信息超级计算机并将45 tflops
计算机转换为1位= 100,000太比特至无限，只要你支持
存储的内存！根据我的计算，45 tflops将不再是b $ b b b b b 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32是32 * 45tflops会
= 1440 tflops物质移动得如此之快以至于它会相互影响并且
更快地解除阻挡然后我们可以看到任何速度就像水一样来自
软管以实际接近的速度移动--------线。
Supercomputer and encryption and compression @ rate of 96%
Take a document then or a 3D matrix document change it two random or
binary code or just a program for 0''s and 1''s and fold it over and over
like a piece of paper then having the 1 and 0 add each other or the
0,1''s canceling each other out 1+0=0 and 0+1=1 1+1=1 0+0=0 if you gave
the folds addresses like on a spread sheet there would be no math.
First A 1-24 would fold to k 1-24 down.(See Example A ) Then at F1-24
down two k 1-24 ( See example B ) If you written a very long letter
and then change it two binary code it would look like this.
123456789.............24
a.01010101010101010101010
b.10010101010101010101010
c.01010101001010101010010
e.00010101000101010101010
f.10010101010100101010101 First A 24 would fold to k 24 down
g.01010101010100001100101 See Example A
h.01001010101010101010111
I.11110111001101010101010
j.01010101010101010101010
k.10101010101010101010101
See Example A
123456789.............24
f.10010101010100101010101
g.01010101010100001100101
h.01001010101010101010111 Then at F1-24 down two k 1-24
I.11110111001101010101010
j.01010101010101010101010
k.10101010101010101010101
See example B
123456789.............24
I.11110111001101010101010
j.01010101010101010101010 Then from I 1-24 to K 1-24
k.10101010101010101010101
123456789.............24
j.01010101010101010101010 Then from j-24 to j-1
123456789...
j.010101010101 Then from j-12 to j-1
123456
j.010101 Then from j-6 to j1
123
j.010 Then from j-3 to j1
12
j.01 Then from j-2 to j1
j.0 Then you would have
1 bit to transfer over the
Internet
The bit sent would be 0 and the key code would be F1-24,k 1-24,
I 1-24,K 1-24,j24,j1,j12,j1,j6,j1,j3,j1,j2,j1 and would unzip or be new
encryption you could encrypt or compress 100 terabits down to 1 bit of
information. Now if you take this idea from my web site you could make
this allot more complex and unbreakable. Data encryption 360 degrees
rotation document 90 degrees and encrypt on every angel then 45 degrees
change it two binary code do it again and again and fold it over like a
piece of paper then having the one''s and zero cancel each other out. In
theory you could send a 100 terabit program to someone''s computer and
have it unzip and run and install or make
A computer processor like the new 64 bit AMD have the bit unzip into a
large ram drive and buffer use one half of the 64 bit processor decode
the message and the main 64 bit run the numbers. Another way of doing
this is to have a parallel computers with using one of the processes
run the compressed 1 bit of information give the uncompressed a address
on the ram drive to change and not even go threw the processor and then
with different information on each machine compare and run statistics
on information on a 45 tflops supercomputer and turn that 45 tflops
computer into a 1 bit = 100,000 terabits to infinite as long as you
have the ram for storage! with my calculations 45 tflops wouldn''t
matter any more it would be how much data you have on a 32bit operating
system changing that to a 1 bit system it would be 32 * 45tflops would
= 1440 tflops Matter moves so fast that it intergreats and
deintergreats faster then any speed we can see it like water from a
hose at real close speed it moves in -------- lines.
推荐答案
c3 ******* @ yahoo.com 写道：
超级计算机和加密和压缩@率96％
发送的位为0，密钥代码为F1-24，k 1-24，
I 1-24，K 1-24，j24，j1， j12，j1，j6，j1，j3，j1，j2，j1并且可以解压缩或者是新的加密，你可以加密或压缩100兆兆位到1位的信息。现在，如果你从我的网站上获取这个想法，你可以使这个分配更加复杂和牢不可破。数据加密360度旋转文件90度并加密每个天使然后45度
改变它两个二进制代码一次又一次地做它并折叠它像一张纸然后有一个人和零人互相取消。在
理论中，你可以向别人的计算机发送一个100太比特的程序，并让它解压缩并运行和安装或制作像新的64位AMD这样的计算机处理器有点解压缩进入一个大的ram驱动器和缓冲区使用64位处理器的一半解码消息和主64位运行数字。这样做的另一种方法是让并行计算机使用其中一个进程运行压缩的1位信息给ram驱动器上的未压缩地址
改变甚至不均匀扔掉处理器，然后用每台机器上的不同信息比较并运行有关45 tflops超级计算机信息的统计信息，将45 tflops计算机转换成1比特= 100,000太比特到无限只要你有ram存储！根据我的计算45 tflops将不再重要的是你在32位操作系统上有多少数据将它改为1位系统它将是32 * 45tflops
= 1440 tflops物质移动得如此之快以至于它会更快地进行分离和解除阻塞，然后我们可以看到任何速度，就像来自软管的水一样，它以真正的近距离移动--------线。
Supercomputer and encryption and compression @ rate of 96%
The bit sent would be 0 and the key code would be F1-24,k 1-24,
I 1-24,K 1-24,j24,j1,j12,j1,j6,j1,j3,j1,j2,j1 and would unzip or be new
encryption you could encrypt or compress 100 terabits down to 1 bit of
information. Now if you take this idea from my web site you could make
this allot more complex and unbreakable. Data encryption 360 degrees
rotation document 90 degrees and encrypt on every angel then 45 degrees
change it two binary code do it again and again and fold it over like a
piece of paper then having the one''s and zero cancel each other out. In
theory you could send a 100 terabit program to someone''s computer and
have it unzip and run and install or make
A computer processor like the new 64 bit AMD have the bit unzip into a
large ram drive and buffer use one half of the 64 bit processor decode
the message and the main 64 bit run the numbers. Another way of doing
this is to have a parallel computers with using one of the processes
run the compressed 1 bit of information give the uncompressed a address
on the ram drive to change and not even go threw the processor and then
with different information on each machine compare and run statistics
on information on a 45 tflops supercomputer and turn that 45 tflops
computer into a 1 bit = 100,000 terabits to infinite as long as you
have the ram for storage! with my calculations 45 tflops wouldn''t
matter any more it would be how much data you have on a 32bit operating
system changing that to a 1 bit system it would be 32 * 45tflops would
= 1440 tflops Matter moves so fast that it intergreats and
deintergreats faster then any speed we can see it like water from a
hose at real close speed it moves in -------- lines.
请将其作为Python模块实现。我想将我的
mp3集合压缩成单位。
将McGugan
-
http://www.willmcgugan.com
" ; .join（[{''*''：'''''，''''''''。''}。get（c，None）或chr（97+（ord（c） - 84）％26）for c
injvyy * jvyyzpthtna ^ pbz]）
Please implement this as a Python module. I would like to compress my
mp3 collection to single bits.
Will McGugan
--
http://www.willmcgugan.com
"".join( [ {''*'':''@'',''^'':''.''}.get(c,None) or chr(97+(ord(c)-84)%26) for c
in "jvyy*jvyyzpthtna^pbz" ] )
消息< 42 **** *******************@news.zen.co.uk> ;, Will McGugan
< ne ** @ NOwillmcguganSPAM.com>写道
In message <42***********************@news.zen.co.uk>, Will McGugan
<ne**@NOwillmcguganSPAM.com> writes
请将其作为Python模块实现。我想将我的
mp3集合压缩成单个位。
Please implement this as a Python module. I would like to compress my
mp3 collection to single bits.
想想你可以比宽带下载速度更好，在你的
旧300bps调制解调器！
-
Stephen Kellett
Object Media Limited http://www.objmedia.demon.co.uk
RSI信息： http://www.objmedia.demon.co.uk/rsi.html
请问McGugan写道：
Will McGugan wrote:
请将其作为Python模块实现。我想将我的mp3集合压缩为单个
位。
Please implement this as a Python module. I would like to compress my mp3 collection to single
bits.
这里是魔术算法（稍微简化）：
def算法（数据）：
m = 102021＃magic constant
d = [int（c）for c in str（1 * 2 * 3 * 4 * 5 * m + 5 + 4 + 2 + 1）]
x = [ord（c）表示c为十六进制（1 + 2 + 4 + 5 + m * 5 * 4 * 3 * 2 * 1）]
x [d [0] * d [1] * d [2]] = x [d [-1]] + sum（d） - d [d [-d [-1] -1]] + d [0]
x = __import __（" .join（chr（c）for c in x [d [0] * d [1]： ]））。encodestring
return"" .join（x（data）.split（" \ n"））。rstrip（" ="），sum（d） -sum（反向（d））
和这里是你的MP3收藏的驱动程序：
import glob
def compress（文件名）：
data = open（filename，" rb"）。read（）
keycode，bit = algorithm（数据）
file = open（keycode +" .out"，" wb"）
file.write（chr（bit））
file.close（）
pr int" compressed"，filename，
print len（data），" =>"，1，round（100.0 / len（data），3），"％" <对于glob.glob（" * .mp3"）中的文件，
：
compress（文件）
< / F>
here''s the magic algorithm (somewhat simplified):
def algorithm(data):
m = 102021 # magic constant
d = [int(c) for c in str(1*2*3*4*5*m+5+4+2+1)]
x = [ord(c) for c in hex(1+2+4+5+m*5*4*3*2*1)]
x[d[0]*d[1]*d[2]] = x[d[-1]] + sum(d) - d[d[-d[-1]-1]] + d[0]
x = __import__("".join(chr(c) for c in x[d[0]*d[1]:])).encodestring
return "".join(x(data).split("\n")).rstrip("="), sum(d)-sum(reversed(d))
and here''s a driver for your MP3 collection:
import glob
def compress(filename):
data = open(filename, "rb").read()
keycode, bit = algorithm(data)
file = open(keycode + ".out", "wb")
file.write(chr(bit))
file.close()
print "compressed", filename,
print len(data), "=>", 1, round(100.0/len(data), 3), "%"
for file in glob.glob("*.mp3"):
compress(file)
</F>
这篇关于超级计算机和加密和压缩@的速度为96％的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！
