Methods and apparatuses of digital data processing

Abstract

The invention Ubit can make data semantics understandable to both humans and machine; semantic translating tools no needed any more, such as compiler, interpreter, semantic analysis, web parser, domain name resolution; machine embodies real intelligence. The three password authentication makes entity authentication nearly unbreakable. Three key encryption can easily realize one-time pad, and also can used in data storage encryption; making data in perfect secure. Ubit presents an interface method between human and human, between machine and human, and between machine and machine; makes all data compatible one another; and anyone can access anything, from anywhere, and in anytime. The methods make hardware and software much more precisely, efficiency and space saved. All methods can be easily implemented.

The invention claimed is: 
     
       1. A binary 1 and 0 digital data processing method, the method comprises at least one of the following:
 a1) Embed information in Ucodes or associate information with Ucodes; 
 a2) Extract the information embedded in or associated with Ucodes; 
 wherein, the Ucode comprises at least one of the following characteristics: 
 b1) Scan a binary 1 and 0 sequence from left to right, distinguishing the sequence into group step by Right 0 rule as the following: 
 Scanning a binary 1 and 0 sequence from left to right, if the first bit is 1, continue scanning until a bit 0 is met, then from the first bit 1 to bit 0 is distinguished as a group; if the first bit is 0, then the bit 0 is distinguished as a group; continue scanning and distinguishing until the end of the sequence, if the last bit of the sequence is not 0, then the last group is an incomplete group; 
 The group above is characterized as: The left bit neighbor of a group is not 1, but the right bit neighbor of a group is 1 or 0, there is one bit 0 in one group, if there are more than 1 bit in a group, then the bit 0 is the rightmost bit in the group; 
 b2) Scan a binary 1 and 0 sequence from right to left, distinguishing the sequence into group step by Right 0 rule as the following: 
 Scanning a binary 1 and 0 sequence from right to left, if the first bit is 1, continue scanning until a bit 0 is met, then from the first 1 to the right neighbor bit of the bit 0 is distinguished as an incomplete group; if the first bit is 0, continue scanning until second bit 0 is met, then from the first 0 to the right neighbor bit of the second bit 0 is distinguished as a group; continue scanning and distinguishing until the end of the sequence; 
 The group above is characterized as: 
 The left bit neighbor of a group is not 1, but the right bit neighbor of a group is 1 or 0, there is one bit 0 in one group, if there are more than 1 bit in a group, then the bit 0 is the rightmost bit in the group.