133 results about "Boolean expression" patented technology

A system and method for content-filtering of data containers in a network supporting versatile communications services are disclosed. The content-filtering system is integrated with a content-adaptation system. Several server units handle data containers formulated at source according to different protocols. A content filtering process relies on characterizing each component of a container to produce a set of content descriptors and producing a set of binary conditions for each component according to a preset criterion for each descriptor. A set of rules is devised where each rule applies a respective Boolean expression to a subset of the conditions to prescribe a respective content-editing action. Methods of specifying and evaluating a rule's Boolean expression are disclosed. A formal graph is used to define inter-dependence of rules.

A system, method, and apparatus are directed to managing a subscription to an RSS feed. A search component enables searching over a network for content associated with an RSS feed. In one embodiment, the search component receives a search query in the form of a structured query language (SQL), Boolean expression, or the like. The search component may search for content based on the search query and validate the RSS feed associated with the results from the search. A list of validated RSS feeds may be sent to the user. The user may then select from the list and subscribe to a validated RSS feed. In addition, the user may employ the search query as an RSS feed. Thus, the same search may be performed automatically and the results compared to the previous search results. If a change in the search results is detected, the user may be alerted.

A system and method for network fault diagnosis in a network having network elements is presented. The method comprises creating a network causality model, generating Boolean expressions from the network causality model, converting the Boolean expressions into SAT sets, receiving network monitoring results, correlating these monitoring results with the SAT sets, and enumerating all possible diagnostic explanations of potential faults, properly annotated. Creating a network causality model can comprise creating, for each network element, an element-specific causality model, stitching together all network elements using the element-specific causality models and a network topology, retrieving monitoring state and propagation information, and generating the network causality model using the stitched together network elements and the monitoring state and propagation information. Stitching together network elements can comprise adding causes and implies dependency between appropriate network elements and/or adding and connecting reachable and not-reachable states. The network causality model can comprise network element states.

A method for rendering software resistant to reverse engineering. Replace at least one first constant (mathematical expression, etc.) in a computational expression with a second mixed mathematical and bitwise-Boolean expression, the first constant being simpler than the second expression and the second expression being based on the value or the variables found in the first constant (or expression). Evaluation of the second mixed mathematical and bitwise-Boolean expression produces a value preserving the value of the first constant, either: with the original value of the first constant or the original value of the result of the first expression, in which case the second mixed mathematical and bitwise-Boolean expression is obtained from the first constant by converting the first constant by mathematical identities; or, in an encoded form, as a new value, which can be converted back to the original value of the first constant by applying an information-preserving decoding function, in which case the second mixed mathematical and bitwise-Boolean expression is obtained from the first constant by modifying the first constant by a combination of conversion according to mathematical identities and transformation according to an information preserving encoding function.

The present invention specifies database security at a row level and, optionally, at a column and table level. The systems and methods cluster one or more sets of rows with similar security characteristics and treat them as a named expression, wherein clustered data is accessed based on associated row-level security. The systems and methods specify a syntax that invokes row(s), column(s) and/or table(s) security via programming statements. Such statements include arbitrary Boolean expressions (predicates) defined over, but not restricted to table columns and/or other contextual data. These statements typically are associated with query initiators, incorporated into queries therefrom, and utilized while querying data. Rows of data that return “true” when evaluated against an aggregate of associated security expressions are said to “satisfy” the security expressions and enable access to the data stored therein. Such security expressions can be created and invoked via the Structured Query Language (SQL) database programming language.

A method for group authentication using a public key cryptosystem that includes a public key and a private key, comprising the steps of providing a Private Key Share to a Tool of each Entity of each Group encompassed by a Boolean Expression of a prescribed Rule based upon the private key, encrypting a random number using the public key of the public key cryptosystem to generate a ciphertext challenge at a Verification Device, conveying the ciphertext challenge to the Tool of each Entity in communication with the Verification Device, generating a response to the ciphertext challenge using the Private Key Share of the Tool of each Entity in communication with the Verification Device, transmitting the response generated by each Entity in communication with the Verification Device to the Verification Device, combining the responses received from the Entities in communication with the Verification Device, determining whether any combination of the responses equals the random number wherein any combination that equals the random number identifies an Authenticated Group and any combination that does not equal the random number identifies a non-authenticated Group, and effecting an apposite course of action with respect to an Operation governed by the prescribed Rule based upon the outcome of the determining step.

Automatic management of networked publisher-subscriber relationships in an advertising server network. The method comprises steps for constructing a directed graph representation comprising at least one publisher node (e.g. an Internet property), at least one subscriber node (e.g. an Internet advertiser), at least one intermediary node (e.g. an Internet advertising agent), and at least one edge (e.g. an advertising target predicate) wherein any one of the edges is directly associated with at least one target predicate. The directed graph representation is used in conjunction with an inverted index for retrieving a valid node list comprising only nodes having at least one target predicate that matches at least one event predicate. The event predicate (as well as any target predicate) is any arbitrarily complex Boolean expression, and is used in producing a result node list comprising only nodes that concurrently match the event predicate with an advertising target predicate and are reachable.

The principal purpose of this invention is to provide the mechanism for enhancing the safe use of a wireless mobile terminal (smartphone) in a moving vehicle. The Invoke facility service's Boolean expression controls the conditions for which a smartphone app will be invoked into execution. Hence, smartphone apps, which create dangerous circumstances when executed in a moving vehicle, can be prevented from invocation. The total elimination of smartphone use in a moving vehicle is inadvisable. For example, an app that deploys an accelerometer to sense the impact of a vehicle's serious collision and thereby calls “911” to transmit a recorded message that includes the vehicle's GPS location should be allowed to execute when a vehicle is moving. This invention allows an app builder to select suitable invocation conditions for an app.

Significant and pertinent to the invention is the manner in which the Boolean logic operation “Not” is used. Whereas conventional apps are invoked by a positive assertion of an event; the use of the operation “Not” avails negative event assertions in the Boolean expression of an Invoke facility service. That is, the contradiction of an event is also an event; meaning that if an event is false, its contradictory event is true. Another important Boolean logic aspect of this invention is the conjunctive operation of “and then”. The “And Then” operation possesses the same functionality as the conjunctive operation of “And”, but “And Then” also possesses a sequential implication for determining the occurrence of events. The sequential implication provides an efficient means to evaluate the Boolean expressions of the Invoke facility service.

Multi-lingual search and retrieval of digital content. Embodiments are generally directed to methods and systems for creating an English language database that associates non-English terms with English terms in multiple categories of metadata. Language experts use an interface to create equivalencies between non-English terms and English terms, Boolean expressions, synonyms, and other forms of search terms. Language dictionaries and other sources also create equivalencies. The database is used to evaluate non-English search terms submitted by a user, and to determine English search terms that can be used to perform a search for content. The multiple categories of metadata may comprise structured data, such as keywords of a structured vocabulary, and/or unstructured data, such as captions, titles, descriptions, etc. Weighting and/or prioritization can be applied to the search terms, to the process of searching the multiple categories, and/or to the search results, to rank the search results.

The invention discloses an SQL statement optimization method based on constant substitution. The SQL statement optimization method based on constant substitution comprises the following steps: step 1, a substitution chain table is created according to a Boolean expression of WHERE clauses in a target SQL statement; step 2, the substitution chain table is traversed and a driving expression is searched for, wherein the driving expression is an equivalent expression, one side of the equivalent condition is a column, the other side of the equivalent condition is a constant, the next step continues to be executed if the driving expression is found through searching, and the step 2 is ended otherwise; step 3, according to the current driving expression, constant substitution is conducted on the target SQL statement, the substitution chain table is adjusted, and the current driving expression is marked; step 4, a next driving expression continues to be searched for, the step 3 is executed again if the next driving expression is found through searching, and the step 4 is ended otherwise. The SQL statement optimization method based on constant substitution has the advantages of being high in optimization level, and capable of improving system performance substantially.

A method and apparatus of a device that evaluates multiple network asserts in response to changing network of network elements is described. In an exemplary embodiment, the device receives the multiple network asserts, where each of the plurality of network asserts represents a Boolean expression regarding a condition of at least one characteristic of at least one of the network elements. The device further detects a change in the network. In response to the detected change, the device, for one or more of the network asserts, evaluates this network assert to determine if this network asserts raises an action associated with this network assert. The device further performs the action associated this network assert if the network assert was raised.

The invention relates to a general method for generating station data, which comprises the following steps: sequentially acquiring names of rule bases from a time table, such as Name 1; finding out rule entries having a rule base name of the Name 1 in the rule base; finding out corresponding configuration parameters in a parameter declaration table through type codes in the rule entries; selecting a mode of continuous generation by using key words in a rule description; and after one role is generated, continuing to generate Name 2 according to the time table. Compared with the prior art, the method adopts object-oriented technology ensuring what you see is what you get, uses a traversal method for automatically generating an interlocked route sheet and adopts an open customizable mode that allows a user to make certain corrections of the rule base when a Boolean expression is generated automatically and improves working efficiency in application.

Methods, software and devices for searching and indexing information are disclosed. Information to be searched is organized as a plurality of responses to queries. A Boolean expression is associated with each response. The Boolean expression for each response is applied to a received query for information. Which of the responses is or are presented is based on the results of the application of the Boolean expressions to the query.

Gated clock signals in ASIC designs are automatically optimized for implementation with a programmable device. Components having gated clock signals are identified and converted to operate directly from the base clock signal. To maintain compatibility, the data signal to the component is modified to connect with additional input logic responsive to a clock enable signal. The input logic modifies the signal received by the component's data input so that the component's output in response to the clock enable signal is unchanged. To this end, a system and method may identify the logic cone associated with a gated clock signal, convert this logic cone into a Boolean expression, and determine cofactors of the base clock signal from this Boolean expression. The input logic and clock enable logic are derived from an analysis of the cofactors of the base clock signal.