Abstract: An air conditioning assembly for a recreational vehicle may include a sealed refrigeration system, a display screen, and a controller. The sealed refrigeration system may be mounted to the recreational vehicle. The display screen may be mounted to the recreational vehicle. The controller may be in operable communication with the sealed refrigeration system and the display screen. The controller may be configured to initiate a system operation. The system operation may include detecting the corresponding condition of the air conditioner assembly, presenting a variable field value at the discrete output field based on the detected corresponding condition, determining an anomaly at the air conditioner assembly, and changing the discrete output field to present a predetermined field value in response to determining the anomaly.

Abstract: A method for determining a perturbation energy of a quantum state of a many-body system includes constructing a wave function that approximates the quantum state by adjusting parameters of the wave function to minimize an expectation value of a zeroth-order Hamiltonian. The zeroth-order Hamiltonian explicitly depends on a finite mass of each of a plurality of interacting quantum particles that form the many-body system, the quantum state has a non-zero total angular momentum, the wave function is a linear combination of explicitly correlated Gaussian basis functions, and each of the explicitly correlated Gaussian basis functions includes a preexponential angular factor. The perturbation energy is calculated from the wave function and a perturbation Hamiltonian that explicitly depends on the finite mass of each of the plurality of interacting quantum particles. The perturbation energy may be added to the minimized expectation value to obtain a total energy of the quantum state.

Abstract: A building system of a building including one or more memory devices having instructions thereon, that, when executed by one or more processors, cause the one or more processors to receive a query for information of a building graph of the building from a system, the query including an indication of an entity and an indication of an event associated with the entity. The instructions cause the one or more processors to query the building graph with the indication of the entity and the indication of the event associated with the entity for the information of the building graph and generate a query response based on the information and provide the query response to the system.

Abstract: A method for allocating resources to applications in a distributed datacenter based on generated contact lists is described. The method includes, receiving, by a first resource manager, a placement request, which identifies resources needed for execution of an application; determining a policy associated with the application; generating a first contact list for the first resource manager based on the determined policy for the application; and searching resources in the distributed datacenter, based on the first contact list, to attempt to meet the identified resources of the placement request.

Abstract: A device for determining at least one position of a mobile terminal includes at least one memory apparatus, a magnetometer sensor unit, a classification unit, and a position-determining unit to determine the position of the mobile terminal. The classification unit is configured to determine states, in particular operating states, of at least one electric motor and/or a vehicle driven by means of at least one electric motor using the magnetometer sensor data. The classification unit is also configured to store the determined states in the at least one memory apparatus. The position-determining unit reads out the states from the at least one memory apparatus and determines the at least one position of the mobile terminal with the help of the states.

Abstract: A method and system for a content broker, including a unified object index, where the content broker is coupled to the unified object index and receives, from a requesting entity, a request to perform an action on an object and the object is stored in the content repository. The method further including obtaining the object associated with the request from a content repository, determining, using the unified object index, a normalized object type associated with the object, obtaining a governance rule based on the normalized object type, and servicing the request using the governance rule.

Abstract: An event processing system, method, and computer program product are provided. A plurality of records are stored, including a plurality of events of different event types for a plurality of customers. In use, an indication is received in connection with one or more aspects associated with one or more of the events for one or more of the customers. Based on such indication, one or more subsets of the events of one or more of the records are identified. In some optional embodiments, such one or more event subsets are then processed to reduce noise therein, resulting in fewer events in the one or more event subsets. To this end, a result of the processing may be displayed in a variety of ways for a variety of purposes.

Abstract: Innovations in the area of query processing for a database management system (“DBMS”) are presented herein. For example, for a database query, a query engine generates query code in an imperative language (such as a procedural, scripting language) based on query code in a declarative language (such as a structured query language). The query engine can embed the imperative-language query code in an intermediate representation of the database query, which is executed by the DBMS. In many instances (e.g., for non-linear operations of a database query), the imperative-language query code can be executed by the DBMS more quickly and efficiently than the original declarative-language query code. The DBMS returns results of the execution of the database query.

Abstract: According to an aspect, a database system for integrating calculation models into execution plans includes a first engine configured to parse a query to be applied on a database. The first engine is configured to invoke a second engine during query compilation. The second engine is configured to instantiate a calculation model based on the query, and the second engine is configured to derive a converted calculation model by converting the calculation model into a format compatible with the first engine. The first engine is configured to incorporate the converted calculation model into an execution plan during the query compilation and execute the query on the database according to execution plan.

Abstract: One embodiment of the present invention provides a system for forwarding packets with hierarchically structured variable-length identifiers (HSVLIs) in a content-centric network (CCN). During operation, the system receives a packet with an HSVLI and determines, based on the HSVLI, a plurality of ports to which the packet should be forwarded. The plurality of ports include a set of individual port groups, and a respective port group includes one or more individual physical ports. The system derives a forwarding strategy based on the set of individual port groups and the one or more individual physical ports. The forwarding strategy is expressed as a formula in conjunctive normal form that indicates a logical conjunction among the set of port groups and a logical disjunction among the one or more individual physical ports. The system then forwards the packet using the derived forwarding strategy.

Abstract: A management server includes a meta rule for identifying an event to be a root cause and a failure recovery method that corresponds to the meta rule for an event capable of occurring in a plurality of node apparatuses, and also displays a cause event to be a root cause of an event detected by the management server, and a method for recovering from this cause event.

Abstract: A design verification problem includes a design description and a property to be verified. Feature data is identified from the design verification problem and a result is predicted for the design verification problem based on the feature data. A plurality of verification engines is then orchestrated based on the prediction. Supervised machine learning may be used for the result prediction. Feature data and verification results from a plurality of training test cases are used to train a classifier to create a prediction model. The prediction model uses the feature data of the design verification problem to make a result prediction for the design verification model.

Abstract: The present invention is directed to methods and apparatus for predicting the quantum state, including the dynamics of such quantum state in so far as it represents a subject embedded in a community of community subjects. In the quantum representation adopted herein the internal states of all subjects are assigned to quantum subject states defined with respect to an underlying proposition about an item that can be instantiated by an object, a subject or by an experience. Contextualization of the proposition about the item is identified with a basis (eigenbasis of a spectral decomposition) referred to herein as the social value context. The dynamics are obtained from quantum interactions on a graph onto which the quantum states of all the subjects are mapped by a surjective mapping dictated by subject interconnections and subject-related data, including the social graph and information derived from “big data”.

Abstract: An information processing apparatus includes a receiving unit configured to receive a utilization request for one of plural services provided by a computer; a service attribute information storage unit configured to store service attribute information of each of the services, the service attribute information including information indicating a type of the service and information indicating an evaluation of a content of the service; and a service recommending unit configured to search the service attribute information storage unit for the service attribute information corresponding to the type of the requested service, and determine a utilization-recommended service based on the evaluation information in the service attribute information retrieved from the service attribute information storage unit.

Abstract: Systems and methods for verifying membership in one or more sets that are subsets of a global set are provided. The method compromises representing members of the global set by mapping each member to a distinct Boolean variable of length d, wherein 2d is not less than the number of members in the global set; representing each of the given subsets of the global set by a Boolean expression which evaluates to a first value for any of the assignments to the Boolean variables which represent members of the subset, and which evaluates to a second value for any of the assignments to the Boolean variables which represent members of the global set that are not members of the subset.

Abstract: A method for solving the reconfiguration planning problem transforms the requirement that an invariant is always preserved into a constraint on the times at which the configuration parameters change. The method then solves this constraint to obtain the required reconfiguration plan. When this constraint is strengthened with a synthesis constraint, it is ensured that any final configuration that is computed is also reachable. An extension of the method allows parameters to take on multiple intermediate values.

Abstract: To enable efficient abduction even for observations that are faulty or inadequately modeled, a relaxed abduction problem is proposed in order to explain the largest possible part of the observations with as few assumptions as possible. On the basis of two preference orders over a subset of observations and a subset of assumptions, tuples can therefore be determined such that the theory, together with the subset of assumptions, explains the subset of observations. The formulation as a multi-criteria optimization problem eliminates the need to offset assumptions made and explained observations against one another. Due to the technical soundness of the approach, specific properties of the set of results (such as correctness, completeness etc.), can be checked, which is particularly advantageous in safety-critical applications.

Abstract: In particular embodiments, a method includes accessing first binary decision diagrams (BDDs) representing data streams from sensors, selecting portions from the first BDDs based on ease-of-analysis, and constructing a second BDD by performing an OR operation between the selected portions of the first BDDs.

Abstract: Methods, apparatus, and computer software product for making a decision based on the semantics of formal logic are provided. In an exemplary embodiment, two custom computing apparatuses are used to resolve the satisfiability of a logical formula and provide an example. In this embodiment, the two custom computing apparatuses operate in concert to explore the space of possible satisfying examples. This Abstract is provided for the sole purpose of complying with the Abstract requirement rules. This Abstract is submitted with the explicit understanding that it will not be used to interpret or to limit the scope or the meaning of the claims.

Abstract: A knowledge-based system under uncertainties and/or incompleteness, referred to as augmented knowledge base (AKB) is provided, including constructing, reasoning, analyzing and applying AKBs by creating objects in the form E?A, where A is a rule in a knowledgebase and E is a set of evidences that supports the rule A. A reasoning scheme under uncertainties and/or incompleteness is provided as augmented reasoning (AR).

Abstract: A system for exchanging click-through traffic between web sites of interested exchange partners on the Internet employs an intermediary web site for registering interested exchange partners and conducting a trial process for click-through traffic between exchange partners' web sites during a trial period prior to opening a bidding process of the interested exchange partners for an exchange partner's click-through traffic. Each exchange partner's web site is linked to the intermediary web site by embedding a links code which points to an addressable file stored with the intermediary web site containing the link content of each interested exchange partner's web site to be displayed in the links area on an exchange partner's web site during the trial process. The results of the exchange trials are compared with metrics for the exchange parameters that inform the exchange participants of the success of their interaction.

Abstract: In the disclosed nondeterministic computing apparatus, a user problem to be solved is translated into an equivalent system of clause polynomial equations (CPEQS) in GF(2). A process for finding an inconsistency in CPEQS is disclosed, which performs elementary equation (or row) operations, such as Gaussian forward eliminations, for each variable v in CPEQS by treating different monomials as different single variables in v-order. The result is examined for two kinds of equations: an inconsistent equation 1=0 and an equation which left-hand side has constant monomial 1 and v occurs in all the other monomials such that v occurs at least once while its right-hand side is 0 to find v=1. To find v=0, a substitution of v with v?1 is performed on CPEQS in advance. If either 1=0, or, x=1 and x=0 simultaneously for some variable x in CPEQS, then CPEQS is inconsistent; otherwise CPEQS is consistent.

Abstract: In particular embodiments, a method includes accessing first binary decision diagrams (BDDs) representing data streams from sensors, selecting portions from the first BDDs based on ease-of-analysis, and constructing a second BDD by performing an OR operation between the selected portions of the first BDDs.

Abstract: Systems and methods for verifying membership in one or more sets that are subsets of a global set are provided. The method compromises representing members of the global set by mapping each member to a distinct Boolean variable of length d, wherein 2d is not less than the number of members in the global set; representing each of the given subsets of the global set by a Boolean expression which evaluates to a first value for any of the assignments to the Boolean variables which represent members of the subset, and which evaluates to a second value for any of the assignments to the Boolean variables which represent members of the global set that are not members of the subset.

Abstract: A system and method is provided for translating one or more logical expressions E is TRUE, or statements of the form IF E1 is TRUE THEN E2 is TRUE, to a set of linear constraints. Examples in accordance with the present invention contribute to systems and methods for solving optimization problems that include constraints in the form of arbitrarily complex logical relationships between binary variables. Examples are also applicable to solving general optimization problems that have arbitrarily complex relationships between sets of linear constraints. The systems and methods combine simplification and ordering of logical expressions, factorization, direct translations of expressions, substitution of auxiliary variables, and substitution of auxiliary variables for phrases that would otherwise lead to an unacceptable number of linear constraints.

Abstract: Clock gating circuit is determined by transforming a clock gating opportunity function to a non-Boolean function and constraining inputs of the non-Boolean function. The non-Boolean function may be a ternary function. Constraining the inputs may be achieved by introducing control variables and a cardinality constraint associated with their values. The non-Boolean function may be utilized to approximate universal quantification of an input assigned with a non-Boolean value, such as “don't care” value. The non-Boolean function may be utilized to provide an ALL SAT solution of a Boolean function using a SAT solver.

Abstract: A method for solving the reconfiguration planning problem transforms the requirement that an invariant is always preserved into a constraint on the times at which the configuration parameters change. The method then solves this constraint to obtain the required reconfiguration plan. When this constraint is strengthened with a synthesis constraint, it is ensured that any final configuration that is computed is also reachable. An extension of the method allows parameters to take on multiple intermediate values.

Abstract: Policies can combine the efficiency of rule sets with the flexible expression power of workflow engines, as well as advantages of other programming languages and engines. Consistent modelling of policy rules is provided across different levels, such as network, control, and service levels. In one system, a policy module can orchestrate rule set and workflow engines in order to evaluate different conditions of a policy. In another embodiment, a hybrid language can be used that allows rule set and other variables to be used in a business process container, workflow and other variables to be used in a rule set container, rule set and business process variables to be used in other containers. In this way, a subset of conditions in a policy can be evaluated using multiple languages and/or engines in order to enforce or evaluate a policy.

Abstract: Among other things, one or more techniques and/or systems are disclosed for mediating tasks in real-time for safety-related concerns. A nature for a safety-related primary task, such as contextual elements of the task, is determined; and a nature of a secondary task that draws attention away from the primary task is also determined. A risk factor for a potential lack of cognitive resources which may be needed by the primary task is determined by applying the nature of the primary task and the nature of the secondary task to a trained risk factor model. The risk factor is applied to one or more safety-related systems in real-time, for example, to mitigate potential safety concerns.

Abstract: An information processing apparatus includes a receiving unit configured to receive a utilization request for one of plural services provided by a computer; a service attribute information storage unit configured to store service attribute information of each of the services, the service attribute information including information indicating a type of the service and information indicating an evaluation of a content of the service; and a service recommending unit configured to search the service attribute information storage unit for the service attribute information corresponding to the type of the requested service, and determine a utilization-recommended service based on the evaluation information in the service attribute information retrieved from the service attribute information storage unit.

Abstract: A computerized method for evaluating and reporting a cause of a performance change in a building management system is shown and described. The method includes receiving an indication of a fault for building equipment of the building management system and determining a root cause for the fault by traversing a causal relationship model including the building equipment and other devices of the building management system.

Abstract: Clock gating circuit is determined by transforming a clock gating opportunity function to a non-Boolean function and constraining inputs of the non-Boolean function. The non-Boolean function may be a ternary function. Constraining the inputs may be achieved by introducing control variables and a cardinality constraint associated with their values. The non-Boolean function may be utilized to approximate universal quantification of an input assigned with a non-Boolean value, such as “don't care” value. The non-Boolean function may be utilized to provide an ALL SAT solution of a Boolean function using a SAT solver.

Abstract: A system and method for automatic formal verification of an executable model includes an assertion monitor configured to verify a system against an assertion in a specification. The assertion monitor includes a parser configured to generate a propositional formula representing the assertion in the specification using Boolean propositions, a filter configured to generate a run of the system using truth assignments for the propositional symbols, and a trace verifier configured to verify the assertion using the run of the system using truth assignments for the propositional symbols and the propositional formula.

Abstract: Complex nested if-then statement on data objects in a digital computer are organized as a plurality of logical case statements; for each case statement, a set of binary condition arrays is provided and for each data object a condition set. Case statements are executed on the data objects for which a condition array from the set of binary condition arrays matches the condition set for the data object.

Abstract: The present invention relates to a method and system for workflow management to automate the creation of event-task entries directly from flowcharts. The method and system of the present invention includes an entry described as MFIN. A MFIN is defined as a flowchart of a process that can be triggered by one or more events. When flowcharts are finalized, they are “published”, in which the system automatically parses the flowcharts, and populates a “published flowcharts table” with information regarding the tasks required to process each event, together with logical decisions, and timers (for tickler notifications) to be started. Instances of the MFINs are executed upon the occurrence of one or more events by looking up the entry in the “published flowcharts table” for that event, and triggering the specified tasks for the specified users.

Abstract: A method, system and software arrangement in accordance with an exemplary embodiment of the present invention are provided to extract descriptive narrative from numerical experimental data augmented with ontological controlled vocabulary. One exemplary application of such system, method and software arrangement is in organizing gene-expression time course data in terms of biological processes that may be activated and deactivated as the biological system responds to its normal or perturbed environment. The present invention may also have biological applications to drug-or-vaccine discovery, understanding behavior of a cell in an altered diseased state (e.g., cancer, neuro-degeneration or auto-immune disease, etc.), genetically modifying a natural wild-type organism, genetic-engineering, etc. Other exemplary applications may include understanding neural behavior, market behavior of a population of users interacting on the Internet, etc.

Abstract: A method for analyzing system-problems, comprising the steps of: accepting from a user an input describing a system having a problem; parsing the user input to create a boolean representation of the system, the boolean representation comprising a series of equations; determining that the boolean representation comprises an unsatisfiable series of equations; for each equation in the series of equations, performing the steps of: creating a modified series of equations by removing the equation from the series of equations; and determining if the modified series of equations is satisfiable, and, if the modified series of equations is satisfiable, deriving a solution wording from the removed equation.

Abstract: A rule packaging system and method to define and/or package parameters, attributes, enumerations of a prime rule in a reduced canonical form suitable for propositional logic manipulation using, for example, zero-suppressed binary decision diagrams. The reduced form of the prime rule is subsequently used by applying a series of user inputs to determine a result that preferably includes conflict and selection advice to guide the user to satisfaction. Elective events, such as but not limited to the display of messages or the performance of calculations, may optionally be packaged along with the prime rule or components thereof, and presented during execution to help guide an end user to satisfaction or compliancy when choosing among possible configuration parameters. The apparatus automates determination of a complex rule having a combinatorial exploded number of rule components, or a combinatorial number of possible outcomes, exceeding computational capacity of present day computing systems.

Abstract: One embodiment of the invention is a method for generating a database model from a set of business rules. For a business rule given as input, an empty list of fact types is created. A determination of whether the business rule is a definitional rule defining that one or more propositions become true upon occurrence of an event is made. If the business rule is a definitional rule, the fact type of each of the propositions is added to the list of fact types. Otherwise, a determination of whether the business rule is an authorization rule for provision of information that comprises one or more authorized provisions of information corresponding to one or more fact types is made. If the business rule is an authorization rule for provision of information, the corresponding fact types are added to the list of fact types. For each fact type in the list of fact types, the fact type having at least one role, the role having a type, if the type of the role is not a lexical type, the type is added to a list of types.

Abstract: Methods and systems for creation, processing, and use of compound features during data analysis and feature recognition are disclosed herein. In a preferred embodiment, the present invention functions to apply a new level of data discrimination during data analysis and feature recognition events such that features are more easily discerned from the remainder of the data pool using processing techniques that are more conducive to human visualizations, perceptions, and/or interpretations of data. This is accomplished using an example tool that allows previously processed and identified features (hereafter “known features”) to be aggregated so as to aid the system in recognizing abstract data features, preferably using Boolean operators and user-assigned hit weight values across desired cluster ranges surrounding analyzed data elements.

Abstract: The present invention provides a system and method for building and analyzing a quantitative model from qualitative tacit knowledge. In one aspect of the present invention, there is provided a system for creating and analyzing a model of a user's semantic knowledge. The semantic knowledge model is based on cause and effect relationships as defined by the user. In another aspect of the present invention, there is provided a system for creating and analyzing a model of a user's episodic knowledge. The episodic knowledge model is based on the user's past experiences, including recalled stimuli and responses. The semantic and episodic models are used to describe the users internal mental model.

Abstract: In order to provide for more efficient QBF satisfiability determination, the formula to be checked is transformed into one formula which is equi-satisfiable, and one which is equi-tautological. The conjunction or disjunction of these two formulas, then, is used to determine satisfiability, with the result being that a determination of satisfiability is more easily achieved. A conjunctive normal form transformation of the initial formula yields a group of clauses, only one of which must be unsatisfiable for the formula to be unsatisfiable. A disjunctive normal form transformation of the initial formula yields a group of cubes, only one of which must be satisfiable in order for the formula to be determined to be satisfiable.

Abstract: A communication system for implementing personalizable and customizable features, comprising a tuple space, and a plurality of user agents representing the features, the user agents communicating with each other via assertions posted to the tuple space in order to implement the features while avoiding feature interactions, each of the features being structured as a set of deontic task trees having a parent node with an obliged inherent action and a plurality of child nodes with respective node actions performed according to a predetermined sequence, the results of which are reported back to the parent node, the parent node placing deontic modalities on the behavior of the child nodes such that successful implementation of the feature results from successful occurrence of the inherent action and composed success of the node actions of the children nodes.

Abstract: Systems, methods and articles solve computationally complex problems. Example embodiments provide data query language features that may be used to express optimization problems. An expression of an optimization problem in the provided data query language may be transformed into a primitive problem that is equivalent to the optimization problem. An optimization solver may be invoked to provide a solution to the primitive problem. Analog processors such as quantum processors as well as digital processors may be used to solve the primitive problem. This abstract is provided to comply with rules requiring an abstract, and is submitted with the intention that it will not be used to interpret or limit the scope or meaning of the claims.

Abstract: When an alarm condition relating to a performance goal of a storage system is detected, a storage management system invokes an N-step lookahead engine for simulating operation of the storage system when there are multiple actions that could be taken by the storage system for eliminating the alarm condition. The N-step lookahead engine generates N possible system states based on a current state of the storage system. The N possible states are based on a cost model of each of the multiple actions. Each cost model is based on an action, a behavior implication of the action, a resource implication of the action and a transient cost of the action. An action is selected that generates a system state that optimizes the stability, a prerequisite and a transient cost of invoking the selected action.

Abstract: A logic circuit includes at least one register and a corresponding comparator coupled to the register and an input data node. A multiplexer is coupled to the register. A control block is coupled to the multiplexer, the comparator, the input node and an input control node.

Abstract: A XLANG/s compiler recognizes a statement in XLANG/s code to make an assumption as to the success or failure of a specified transaction. The assignment states of variables are tracked and changes to such states are recorded. While processing XLANG/s code, the compiler determines whether the assignment state of a particular correlation, operation or the like is correct for the transaction being performed. If not, the compiler may generate an error message. Moreover, by using declarative assumptions such as if(succeeded(T)) or if(!succeeded(T)), definite-assignment analysis of shared state variables may cross transactional boundaries.

Abstract: Complex nested if-then statement on data objects in a digital computer are organized as a plurality of logical case statements; for each case statement, a set of binary condition arrays is provided and for each data object a condition set. Case statements are executed on the data objects for which a condition array from the set of binary condition arrays matches the condition set for the data object.

Abstract: A method for generating a workflow on a computer. Assessment data, e.g. defining a need, is obtained from a user. Based thereon, a workflow including a logical sequence of interdependent steps to be made is created using an assessment system. A number of workflow steps are presented to the user in a logical order, and results from the progress of one or more steps may be gathered. The workflow may be modified thereon, if needed, using sub-solutions, logic rules, inference rules and said results by adding and/or removing steps to/from said workflow based on a list of purposes and knowledge of the order in which some or all steps must be made. After modifying the workflow, the presentation thereof is started by the next or more unfinished steps which are not dependent on an unfinished step, thereby forming an adaptive procedure.

Abstract: A method has been developed for generating, refining and determining the consequences of complex systems of multiple cause and effect relationships. The novel method is applicable to biological systems as well as man-made systems, as it is based on the collecting and using observed behaviors as well as previous understood mechanism or relationships. The method is particularly useful in multi-variable system with significant interactions among sub-components, especially when there is limited expertise or complete understanding of all the components and their respective relationships interactions. In these cases the method provides guidance for future experiments that develop further expertise. The method has particular power and benefit as it provides for a distinction and comparison of the merits of conducting further experiments based on defined criteria.