| http://www.w3.org/ns/prov#value | - An alternative of the method of FIG. 6 may be used without creating a binary tree or other data structure. [0154] Another Binary Tree Building Implementation Utilizing Bit by Bit Matching, the Up Command Enhanced with a Response, and an Inter-command Memory at Each Tag [0155] Each tag is associated with a guaranteed unique binary number (serial number), which has at least a specified minimum numbe
|
