129 results about "Binade" patented technology

The purpose of this invention is to provide a method / system which can prevent the conflict of the software. The base is compartmentalized to the first floor to the M floor, M>= 1.The talked method includes: (a) prescan the square function which the binary system of the executable code transfers and the transfer or transferred square function which are belong to the case of the first floor. If the value of M is larger than 1, it also prescans the transfer square function which belongs to the first floor to the M-1floor and the transferred square function which are belong to the second floor from the M floor. (b)If there is at least one conflict, then at least information of the conflict can be saved, and (c) when the process transfers the direct base, if there is corresponding conflict information, it will give up loading the base, or loading the base.

A method of monitoring processor resources. To monitor a processor resource, first a set of needed resources is determined at the beginning of a block of code. A test is then performed to determine if the set of needed resources is available at the start of the block of code. An error is signaled if the needed resources are not available at the beginning of the block of code.

A method and apparatus of entropy coding of coding symbols using Context-Based Adaptive Binary Arithmetic Coder (CABAC) are disclosed. According to the present invention, a math formula is used for calculating the LPS range for deriving rangeOne value and rangeZero value. For example, the LPS range is derived using one or more mathematical operations comprising calculating a multiplication of a first value and a second value, in which the first value is related to (2*the LPS probability index+1) or the LPS probability index, while the second value is related to (2*the range index+1) or the range index. Besides, the LPS range can be derived by using a look-up-table including table contents corresponding to values of LPS range associated with a set of LPS probability indexes and a set of range indexes for encoding or decoding a binary value of the current bin.

A source binary code that complies with a source architecture is translated to a target binary code that complies with a target architecture. The target binary code includes a first target portion translated from a respective source portion of the source binary code. During execution of the target binary code on a processor that complies with a target architecture, it is determined whether to retranslate the source portion to produce a second target portion that is more optimized to the target architecture than the first target portion or to retranslate the source portion to produce a third target portion that is more optimized to the target architecture than the second target portion.

The invention proposes a method of protection of a Boolean circuit associated with a structural description of the circuit comprising elementary Boolean variables, each represented by one bit, the method comprising the steps consisting in:selecting a set of k elementary Boolean variables of the circuit as a function of predefined selection criteria,constructing a variable x represented by k bits by concatenation of the k selected variables in accordance with a chosen order,determining a binary code C comprising a set of code words and belonging to a given vector space and the supplementary code D of said binary code C as a function of a condition bearing on the dual distance of said supplementary code D, said binary code C having a length n and a size 2k, where k designates the number of bits representing said variable x;substituting the variable x in the structural description of the Boolean circuit with a protected variable z represented by n bits so that:any operation of writing on the variable x in the circuit is substituted with an operation of writing on the variable z, the variable z being generated by adding the variable x encoded by said code C to a random bit vector y encoded by the supplementary code D, andany operation of reading the variable x in the circuit is substituted with an operation of reading the value of the protected variable z and an operation of decoding said read value of the protected variable z using a decoding matrix J of size (n×k) determined from the binary code C and the supplementary code D of the binary code C.

The provided adaptive arithmetic code method comprises: A. making received binary bit bin as current bin; B. with initial probability space of current bin, calculating probability space of the bin before normalization, and executing step C and D paralleled; C. taking the first normalization process for probability space of current bin as the initial space of next bin, back to step A; and D. taking second normalization process for probability space of current bin, and outputting bit code flow. This invention improves coding efficiency.

Systems and methods index and search log files created after execution of binaries. A plurality of log files each have one or more sequences. An index tree is created for the log files. A first log file is placed into a bucket of the index tree according to the lengths of the one or more sequences of the first log file. Remaining logs files are placed the index tree according to their respective sequence lengths. Each log becomes a representative in the bucket or associated with a representative in the bucket. The index tree can be searched, where an incurred distance and a remaining distance is maintained during the search. Nodes are pruned based, at least in part, on the incurred distance and the remaining distance.

Methods and systems for residue number system based ALUs, processors, and other hardware provide the full range of arithmetic operations while taking advantage of the benefits of the residue numbers in certain operations.