37 results about "Boolean algebra" patented technology

The Quantum Matrix system is a multi-dimensional, multi-threaded exchange environment for data organization, management, and manipulation. Data is organized into a multi-dimensional structure of nodes. Nodes may represent data, absence of data, or another set of nodes. The multi-dimensional structure or portions of it can be automatically created from a file system. One or more associations are also defined for the multi-dimensional structure. An association indicates a relationship between a node and another node, data, or a set of nodes. The multi-dimensional structure is then displayed three-dimensionally and navigated. Relational logic, Boolean algebra, or a scripting language can be applied to the nodes, data, and associations to produce a resultant set of nodes. Furthermore, portions of the multi-dimensional structure can be isolated with the use of planes to ease navigation. Furthermore, Avatars may be displayed and used for collaborative purposes and to automate the navigation of the multi-dimensional structure.

The Quantum Matrix system is a multi-dimensional, multi-threaded exchange environment for data organization, management, and manipulation. Data is organized into a multi-dimensional structure of nodes. Nodes may represent data, absence of data, or another set of nodes. The multi-dimensional structure or portions of it can be automatically created from a file system. One or more associations are also defined for the multi-dimensional structure. An association indicates a relationship between a node and another node, data, or a set of nodes. The multi-dimensional structure is then displayed three-dimensionally and navigated. Relational logic, Boolean algebra, or a scripting language can be applied to the nodes, data, and associations to produce a resultant set of nodes. Furthermore, portions of the multi-dimensional structure can be isolated with the use of planes to ease navigation. Furthermore, the Quantum Matrix system may have a client-server architecture, with the client running on a mobile device.

The invention relates to a string retrieval technique using a bit to correspond to a plurality of character elements and uses n bits to correspond to all character elements. All character elements are divided into n groups, and n bits of one data which are all 0 and noted as W are used for marking the character element information of string groups. If a character element P1 of string S belongs to the n group, the n bit of W is marked as 1, and similarly, W is marked according to the groups of other character elements P2, P3, P3, and the like of S to finish marking W of all character elements. Information recording S is called a bit value of S and the mode is called 1 marking. According to logic algebra principle, n bits of one data which are all 1 and noted as W can also be used for marking the character element information forming the strings. If one character element P of S belongs to the n group, the corresponding n bit of the data W is marked as 0, and the mode is called 0 marking. Whether Sb does not include, includes or may include all character elements of the retrieval key word Sb can be judged by comparing bit value Wa of Sa, Wa and bit value Wb of Sb, and Wb of Sb. For example, bit implication calculation is carried out on Wa and Wb. If all bits have implication relation, Sb includes or may include all character elements of Sa. If necessary, such result can be got by a bit-by-bit character comparison method. Bit marking can be used for normal retrieval, as well as for reverse retrieval. If bit n used for marking is over two times of the average length m of the string, combination of bits corresponding to a group of character elements can be used for marking to improve screening efficiency, and the method is called multi-bit marking. For multi-bit marking, bit-by-bit character comparing method can also be used for finally judging whether the Sb includes Sa.

The invention discloses a method and a device for determining pipe failure probability, wherein the method and the device belong to the technical field of an oil gas pipe system. The method comprisesthe steps of determining a third-party damage failure probability based on a damage type, a damage generation grade and a plurality of damage prevention measures; determining a geological disaster failure probability based on a disaster generation grade, a disaster leakage grade and a disaster protection measure which corresponds with the disaster type; determining an outer corrosion failure probability based on the operation pressure and the pipe wall thickness of a target pipe, and at least one outer corrosion generation grade and a plurality of outer corrosion prevention measure grades; anddetermining an inner corrosion failure probability based on the operation pressure, the pipe wall thickness, an inner corrosion generation grade and a plurality of inner corrosion prevention measuregrades. Furthermore, based on the third-party damage failure probability, the geological disaster failure probability, the outer corrosion failure probability and the inner corrosion failure probability, the failure probability of the target pipe is determined through Boolean algebra or Boolean operation, and accuracy in identifying risk grade of the target pipe is improved.

A packet routing method includes computing, for a source node in the data network and a destination node in the data network, a set of multiple routes providing a set of shortest routes from the source to the destination that satisfy all the truth assignments for the Boolean algebra available from the path in the network. The method selects, for a packet flow, a route where logical conjunction of the policy constraints of the flow and the route is satisfied and where the route has sufficient bandwidth.

The invention relates to a graph theory and Boolean algebra-based position arrangement method for automotive exhaust remote measurement devices. For urban buses, the arrangement positions of the automotive exhaust remote measurement devices in an urban road network are searched for to achieve the goal of real-time efficient monitoring of bus exhaust emission situations. The method comprises the steps of firstly, based on a hypergraph related principle in a graph theory, converting a bus running route into a bus route hypergraph, and converting a position arrangement problem of bus exhaust remote measurement devices into a minimum transverse solving problem of the bus route hypergraph according to minimum transverse and transverse hypergraph concepts; secondly, working out all minimum transverse sets of the bus route hypergraph by using a Boolean algebra related principle; and finally, obtaining the minimum transverse sets, namely, minimum monitored road section sets, of the bus route hypergraph, and determining the arrangement positions of the bus exhaust remote measurement devices in the urban road network. Compared with an existing monitor position arrangement scheme, the method specially aims at an urban bus system and is more unique; a solving algorithm is simple and easy to realize; and the method is better in operability.