Abstract: Embodiments of methods, apparatuses, devices and/or systems for a file location naming hierarchy are disclosed.

Abstract: Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed. In particular, methods, apparatus devices and or/or systems for analyzing hierarchical data are disclosed. In a particular example, rooted partial subtrees of partial subtrees of a tree are enumerated and associated with target numerals according to an association of trees and numerals. A probe numeral, representing information of interest, may be compared with target numerals to find a match. In one particular example, such a match indicates a presence of particular information in the tree.

Abstract: Embodiments of methods, apparatuses, devices and/or systems for a file location naming hierarchy are disclosed.

Abstract: Embodiments of methods and/or systems for tagging trees are disclosed.

Abstract: Embodiments of methods and/or systems for tagging trees are disclosed.

Abstract: Embodiments of articles, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed.

Abstract: Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed.

Abstract: Ease of processing and exchange of information and data between different programmatic schema and memory stores is described. A common indexing system or coordination language based on the natural number node-labeled tree data structure provides a common programming element for use at the base of all container-oriented manipulation.

Abstract: Embodiments of a method and/or system of transmitting and/or receiving data is disclosed.

Abstract: Embodiments of methods and/or systems of manipulating tree expressions are disclosed.

Abstract: Embodiments of articles, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed. In particular embodiments, one or more trees may be transformed to one or more corresponding symbols strings according to an association of trees and symbols strings. In one particular embodiment, such a symbol string may be further manipulated to provide a resulting symbol string corresponding with a resulting numeral according to an association of symbol strings and numerals.

Abstract: Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed.

Abstract: Embodiments of a method and/or system of transmitting and/or receiving data are disclosed. In certain embodiments, a sequence of binary values may represent a sequence of trees. Such a sequence may be transmitted as an electrical digital signal. In at least one particular implementation, such trees may be represented by natural numerals.

Abstract: Embodiments of methods and/or systems of manipulating tree expressions are disclosed. In one particular example, a tree expression may represent information and/or data in one particular view among a plurality of views. Further, in another particular example, a tree expression representing information and/or data in a first view may be transformed and/or converted to a tree expression which represents the information and/or data in a second view which is different from the first view.

Abstract: A computer structure for storing and manipulating information includes a processor, a table facility, a command facility and a memory. The table facility generates a table of prime numbers and associates a unique data structure with each prime number. The data structures include container data types such as heaps, strings, trees, tables, or any combination thereof. The table facility may further incorporate an ordered pair and a display font associated with each prime numbers. The command facility translates an inbound command from an external structure and provides a command to the processor. The processor manipulates the memory to provide a response to the inbound command. Advantages of the invention include a standard method and apparatus for creating, manipulating, and displaying data structures and container data types. The structures created are adaptable to imitate known data structures and are flexible enough to describe and manipulate new data structures.

Abstract: A method and apparatus for generating, manipulating, and displaying a universal set of data structures is disclosed. A Table Facility generates and stores tokens and a Logic Processor communicates with external host programs and performs arithmetic and logical manipulations of the tokens in response to requests from the host program. The tokens can be tested and used as any currently known data structure, including but not limited to binary trees and linked lists, as well as being versatile enough to emulate new data structures. The method used to create the data structures is such that many database operations, such as comparison of files and data or their merging, proceed much faster on the present invention than known in the art.

Abstract: A system for manipulating data structures includes a memory circuit configured to store a table including a plurality of prime numbers and a data structure associated with each prime number. An interface circuit is configured to receive an instruction from a calling procedure and configured to provide a response to the instruction. A processor circuit is coupled to the memory circuit and to the interface circuit and is configured to receive the instruction, to manipulate the table according to the instruction and to provide a response to the interface circuit. The data structures may also be associated with font patterns.

Abstract: A system for manipulating data structures includes a memory circuit configured to store a table including a plurality of prime numbers and a data structure associated with each prime number. An interface circuit is configured to receive an instruction from a calling procedure and configured to provide a response to the instruction. A processor circuit is coupled to the memory circuit and to the interface circuit and is configured to receive the instruction, to manipulate the table according to the instruction and to provide a response to the interface circuit. In additional embodiments, the data structures are associated with font patterns. Advantages of the invention include the ability to generate, manipulate and display data structures in a highly efficient manner.