282 results about "Logical expression" patented technology

A system and method for optimizing a database query with improved performance enhancements is herein disclosed. The database query consists of one or more logical expressions. Through the repeated application of one or more rules, the logical expressions are transformed into execution plans. The query optimizer partitions the database query into one or more subproblems with each subproblem consisting of one or more logical expressions. A plan is obtained for each subproblem with the plan for the database query including the plans for each subproblem. The query optimizer is cost-based and uses rules including transformation and implementation rules that are used to perform transformations on the logical expressions in a subproblem in order to produce a plan. The rules are classified into context-free and context-sensitive in order to avoid generating duplicate expressions. Context-free rules are applied once for each logical expression and context-sensitive rules are applied once for each logical expression for a particular optimization goal. In a preferred embodiment, the query optimizer performs several optimization passes over the database query in order to obtain an optimal plan. For each pass, if no optimal plan exists for the requested optimization goal, existing plans having the same optimization goal are utilized with each input reoptimized for a more cost effective plan.

A system and method for creating a custom grouping of data in a database. A custom group object is created, a plurality of custom group elements are defined, each of the custom group elements being a subset of the custom group object and being defined by a different filter, each one of the different filters representing a logical expression of qualifications based on the data or a derived calculation of the data. Each of the different filters is resolved against the data or a subset of the data, and the plurality of custom group elements are grouped into a consolidated result set which in not naturally existing in the data structure.

In one embodiment, a content license is created that defines parameters for accessing a piece of digital content. A first logical expression in the content license defines a plurality of playback devices that are authorized to access the piece of digital content. A second logical expression in the content license defines at least one time interval when the plurality of playback devices are authorized to access the piece of digital content. The content license is used to access the piece of digital content.

A method and apparatus provide for implementing query-response interactions on a publish-subscribe network. An advertisement relating to a data set and a query representing a logical expression are received. The advertisement is mapped to a corresponding subscription. The query is mapped to a corresponding notification. The subscription and the notification are used for implementing of the advertisement and the query in the network.

Methods and systems capable of determining which subset of a set of logical expressions are true with relatively few evaluations of the primitives that, together with any standard logical connectives, make up the logical expressions. A plurality of directed acyclic graphs, each graph including at least one root node, at least one leaf node, and at least one non-leaf node associated with a leaf node. Each node is associated with a, possibly empty, subset of presumed to be true logical expressions. Each non-leaf node is associated with one of the primitives mentioned in any of the logical expressions. Edges are defined between two of the nodes, each edge being associated with a possible value, or range of possible values, of the primitive associated with the node at the tail of the edge. Paths are defined through each of the directed acyclic graphs from a root node to a leaf node by recursively following each edge corresponding to the current value of the primitive at a selected non-leaf node. Lastly, subsets of logical expressions associated with the nodes on the defined paths are collated to yield a subset of logical expressions that are true.

A project management system is integrated with a workflow engine to provide automatic coordination of project tasks and workflow processes. The workflow engine provides support for defining logical expressions that determine a path of execution for the defined workflow tasks. In addition to composition capabilities, the workflow engine may execute and track the defined processes. The project management system provides a platform for defining the project plan that includes tasks and resources. Tasks are annotated defining their behavior and implementation and exported to the workflow system. The workflow system substitutes project tasks with the appropriate workflow activities and provides feedback upon execution of the activities.

A method and apparatus for mapping concepts and attributes to distance fields via rvachev-functions. The steps including generating, for a plurality of objects, equations representing boundaries of attributes for each respective object, converting, for a plurality of objects, the equations into greater than or equal to zero type inequalities, generating, for a plurality of objects, a logical expression combining regions of space defined by the inequalities into a semantic entity, and substituting, for a plurality of objects, the logical expression with a corresponding rvachev-function such that the resulting rvachev-function is equal to 0 on a boundary of the semantic entity, greater then 0 inside a region of the semantic entity, and less then 0 outside the region of the semantic entity. Also included is the step of generating a composite rvachev-function representing logical statements corresponding to the plurality of objects using the respective rvachev-functions of the objects.

A method and system for identifying clusters of similarly-configured computers. The method, for example, comprises gathering system and business configuration information values from a set of computers. Next, at least a portion of the system and business configuration information values gathered from the set of computers is analyzed along with the numbers of computers that are configured in various ways. Then, using the result of the analysis as a guide, logical expressions of configuration information values are selected for use as definitions of one or more clusters of similarly-configured computers, the selection process generally maximizing the number of computers included within each cluster and also generally maximizing the number of configuration information value specifications included within the definition of each cluster. Then, for one or more clusters so defined and selected, one or more statistics or limit values are generated from one or more configuration information values or both gathered from the subset of computers included in the one or more clusters.

A process builder for a system of routing electronic documents and a method for using the same are provided. The process builder receives an electronic document having programmable features. The process builder determines a number of attributes and form fields from the electronic document. Data input is received by the process builder from an electronic document author via a graphical user interface. The process builder defines logical conditions for one or more of the form fields and attributes based on the received data input, and combines the logical conditions into logical expressions. The process builder then translates the logical expressions into program code and inserts the generated program code into the electronic document.

Systems and methods for providing distributed debugging in an extensible SOAP environment of asynchronous software web services are disclosed. Such a system may include a message originator, a diagnostics tagger, an intended message receiver, and a debug controller, which may communicate with one another via SOAP messages. The message originator originally puts the SOAP message onto the network. The diagnostics tagger modifies the SOAP message to include certain diagnostics elements that cause a breakpoint to be triggered. The intended message receiver eventually receives the message and is expected to trigger the breakpoint. The debug controller is a process that is called by the intended message receiver when a breakpoint is detected. The header of the SOAP message may include a security element and a diagnostics element. The diagnostics element may include one or more breakpoint elements. Each breakpoint element may include a debugging controller element, and one or more condition elements. Each condition element may include a logical expression. The intended message receiver determines whether the conditions are met. If the conditions are met, then the breakpoint is triggered.

Described herein is a system and method for providing a condensed license description syntax for use in a software due diligence system. In particular, the license description syntax may employ a limited number of verifiable attributes to provide precision and lack of redundancy in describing various software licenses relevant to software due diligence. For example, the software due diligence system may identify licenses in software under review and invoke a compiler configured to perform various operations on the license description syntax to check for permissions and obligations associated with the identified licenses (e.g., name translation, operator translation, logical expression evaluation, etc.). Thus, the license description syntax may enable the license database to be established as a global public or private license database, in addition to providing licenses attributes useful in software due diligence review.

A method of defining access control. The method allows the expression of access control rules using ontology based semantics and references an ontology subset using XPath as the ontological expression. The access control rules or access criteria are defined by an access control statement and may be expressed using classification criteria and ontology classes. The access control statement comprises a structural description that is used to define an asset and a logical expression that may be used to express the classification criteria. The access control statement defines access policy for various assets.

A failure-effect validation system includes an effects modeler configured to develop a cumulative effects model for failure modes of the complex system, and by which a model of the complex system is extendible to form an extended complex-system model. The effects modeler is also configured to develop search targets each of which includes logical expressions of notable hazards and other factors that contribute to the cumulative effects, such as crew workload, safety margin and/or physiological effects. A model analysis system is configured to perform an automated analysis using the extended complex-system model and search targets, and in which the automated analysis includes a graph search of possible states of the extended complex-system model to locate search targets. And the effects assessment system is configured to selectively generate a layout of failure analysis data including at least a portion of the extended complex-system model and results of the automated analysis.

The invention relates to the determination and visualization of the spatial distribution of tissue states in histologic tissue sections on the basis of mass spectrometric signals acquired so as to be spatially resolved. The invention provides a method which determines the tissue state for the tissue spots as a state characteristic, which is calculated as a mathematical or logical expression from at least two mass signals of this tissue spot, and which indicates the tissue state as a gray-level or false-color image in one or two dimensions.

A system for enabling a user of a relational database to define and enforce ordered check constraints to insure that defined logical relationships are maintained between data values in pairs of adjacent rows when adjacency is defined by some ordering of the data. These inter-row conditions, here called “ordered check constraints,” are expressed by a logical expressions which define a required relationship between the attributes of a given row and its adjacent row or rows. Arbitrarily complex expressions involving these sets of attributes can be formed to model the constraints of interest. These expressions can be created by the database in support of, for example, traditional primary key or uniqueness constraints, or they can be provided by the database user to model new more complex constraints such as a requirement that there be no gaps in a list of serial numbers. These constraints can then be efficiently supported in the presence of a b-tree or another ordered index structure by identifying any inserted, updated or deleted rows and evaluating the expression in the context of those rows and any associated adjacent rows. This approach is similar to that typically used in existing database systems to support primary key and uniqueness constraints, providing the user with the ability to model a much richer set of constraints using a generalized expression which extends and enhances the functionality of check constraints to permit relationships of data in different rows to be defined and enforced.

A system generates criteria associating subjective narrative text describing a treatment outcome with acquired patient medical data and linking a narrative treatment outcome description to documented data during patient assessment documentation. A patient healthcare monitoring system includes an acquisition processor for automatically acquiring data representing outcomes of multiple corresponding assessments of medical condition of a patient. A data processor automatically evaluates a logical expression comprising a logical combination of the multiple corresponding assessments to provide an overall outcome representative result and compares the overall outcome representative result with a predetermined treatment objective of the patient to provide a result indicative of whether the treatment objective is met. A documentation processor updates a record of the patient to indicate the objective is met.

This invention describes a method to verify non-looping properties of programs implemented as rule-based expert systems. Our method detects conditions under which the expert system enters erroneous infinite program loops, which lead to non-terminating or oscillating computations, or otherwise proves the absence of such conditions. Our automatic procedure also gives advice on how to correct these errors. The expert systems considered consist of condition-action rules (IF-THEN-statements), where the conditions are logical expressions (formulas of a propositional finite domain logic), and the actions modify the value of a single variable which in turn can be part of other logical expressions. There may be additional (external) variables not controlled by the expert system, and each rule may have an associated evaluation priority.