Abstract: The present invention pertains to specifying, analyzing and evaluating systems such as distributed content distribution networks. Systems and methods are provided to predict how new deployments and changes to existing architectures will impact the networks. A network design may prepare a “what-if” scenario and the impact of this scenario may be predicted. Various tools are provided to determine relevant network variables and collect data about such variables, to learn what dependencies may exist among relevant variables, to prepare an input distribution and to output a predicted impact for the what-if scenario. Thus, a system designer is able to see a predicted impact that a network change or new deployment will have without having to resort to back of the envelope calculation or costly field deployments.

Abstract: A method and system for truth discovery may implement a methodology that accounts for accuracy of sources and dependency between sources. The methodology may be based on Bayesian probability calculus for determining which data object values published by sources are likely to be true. The method may be recursive with respect to dependency, accuracy, and actual truth discovery for a plurality of sources.

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 set of objects having facts is established. Facts of objects having positions in an order are identified. Some facts explicitly describe the positions in the linear order, while are facts do not explicitly describe the positions. The facts are presented in the order on a linear graph, such as a timeline. Facts of the objects describing geographic positions are presented on a map.

Abstract: Systems, methods and apparatus are provided through which in some embodiments, domain knowledge is translated into a knowledge-based system. In some embodiments, a formal specification is derived from rules of a knowledge-based system, the formal specification is analyzed, and flaws in the formal specification are used to identify and correct errors in the domain knowledge, from which a knowledge-based system is translated.

Abstract: Systems, methods and apparatus are provided through which in some embodiments an informal specification is translated without human intervention into a formal specification. In some embodiments the formal specification is a process-based specification. In some embodiments, the formal specification is translated into a high-level computer programming language which is further compiled into a set of executable computer instructions.

Abstract: A system and method for producing semantically-rich representations of texts to amplify and sharpen the interpretations of texts. The method relies on the fact that there is a substantial amount of semantic content associated with most text strings that is not explicit in those strings, or in the mere statistical co-occurrence of the strings with other strings, but which is nevertheless extremely relevant to the text. This additional information is used to both sharpen the representations derived directly from the text string, and also to augment the representation with content that, while not explicitly mentioned in the string, is implicit in the text and, if made explicit, can be used to support the performance of text processing applications including document indexing and retrieval, document classification, document routing, document summarization, and document tagging.

Abstract: Systems and methods for auditing knowledge-based projects or methods wherein the users participate in and contribute to generating an automatically updating community data set for obtaining information for evaluating and comparing a target project to best practices and relevant comparables from within the community data to audit likelihood of success and to predict the outcome of the knowledge-based project, and to identify components for improvement or modification to improve the outcome.

Abstract: Systems and methods for deriving a predicate by constructing a logic formula from information recorded during test execution, optimizing the logic formula and computing the logical implication of the optimized logic formula. Systems and methods for deriving an assertion from a logical implication by substituting each predicate in the logical implication with corresponding design elements from a hardware design description, inserting the design elements into a target template, inserting a context-sensitive input of the target template based on design elements in the hardware design description and creating an instance name for an instantiation of the target template. Systems and methods for generating a set of clauses that are implied by a disjunctive normal formula of a set of cubes.

Abstract: Techniques for detecting patterns in data streams. A pattern to be detected may be specified using a regular expression. Events received in data streams are then processed during runtime to detect occurrences of the pattern specified by the regular expression in the data stream. If the pattern to be matched belongs to a certain predetermined class of patterns, then a pattern matching technique that is customized for that class of patterns is used during the runtime events processing.

Abstract: A website may allow users to rate content items displayed thereon. The user ratings associated with the content items may be weighted according to user rating weight. The rating weight of a particular user may be based, in whole or part, upon whether the user consistently rates content items similarly to one or more “expert” raters. The experts may be selected based on various factors including: professional training, experience, reputation on the website, or the like. If a particular user consistently rates content items similarly to the experts, the user may be given a high rating weight. Users whose ratings consistently diverge from the ratings assigned by the experts may be given a lower rating weight. The weights may be displayed in connection with a user profile, or may be hidden from the user community. The rating weights may be used in calculating an overall rating of a particular content item.

Abstract: The transformation of a symbolic representation using an inverted match that represents an inverted form of a specific kind of non-linear match. The match is inverted around a particular reaction variable and merged on that variable after determining that the match represents a specific kind of non-linear identity that has at least one associative commutative operator, and in which each variable has one instance, except for the reaction variable, which has multiple instances in the match, at least one of the instances not being a direct argument of an associative commutative operator. The inverted match may then be applied to the symbolic expression to thereby transform the symbolic expression.

Abstract: A hybrid machine learning methodology and system for classification that combines classical random forest (RF) methodology with discriminant analysis (DA) techniques to provide enhanced classification capability. A DA technique which uses feature measurements of an object to predict its class membership, such as linear discriminant analysis (LDA) or Andersen-Bahadur linear discriminant technique (AB), is used to split the data at each node in each of its classification trees to train and grow the trees and the forest. When training is finished, a set of n DA-based decision trees of a discriminant forest is produced for use in predicting the classification of new samples of unknown class.

Abstract: A method for identifying companies with specific business objectives that includes using existing sources of company firmographic data to identify a broad set of companies and associated websites, crawling the websites associated with the identified companies and indexing web site content for each of the identified companies with the specific business objective to realize indexed web content. The method further includes joining the company firmographic data with the indexed web content using a business objective common identifier to generate a store of joined structured firmographic data and indexed web content and presenting a display image representation of the store of joined structured firmographic data and indexed web content for user review. The display image further receives user input to score each of said companies identified therein, and using a search interface, querying the store of scored, joined structured firmographic data and indexed web content.

Abstract: The present invention provides a set of analog circuit modules and procedures for assembling them into circuits that represent fundamental expressions and operations in mathematics, and more specifically to circuits for performing computations on problems formulated as constraints in Set Theory. In this invention, physical analogues of mathematical sets are realized by the current flowing through electronic circuit devices, or by the voltage across such devices. A circuit assembled from set analogue devices appropriately connected together can generate analogues of the basic operations in Set Theory, such as intersection, union, complement, difference, subset, etc. Using these basic circuit modules, the analogues of arbitrarily complex expressions and operations can be obtained by combination. A complete circuit that is the analogue of Set Theory expressions defining the problem specification can be assembled by requiring the circuit and the Set Theory expressions to have the same topology.

Abstract: A system is disclosed for reconciling opinions generated by agents with respect to one or more predicates. The disclosed system may use observed variables and a probabilistic model including latent parameters to estimate a truth score associated with each of the predicates. The truth score, as well as one or more of the latent parameters of the probabilistic model, may be estimated based on the observed variables. The truth score generated by the disclosed system may enable publishers to reliably represent the truth of a predicate to interested users.

Abstract: A computer-implemented method of analysing symbols in a computer system, and a computer program and apparatus therefor are provided. The symbols conform to a specification for the symbols. The specification is codified into a set of computer-readable rules. The symbols are analysed using the computer-readable rules to obtains patterns of the symbols by: determining the path that is taken by the symbols through the rules that successfully terminates, and grouping the symbols according to said paths.

Abstract: A method for rule compliance situation checking is provided. The method in one aspect, includes the steps of: a) building a rule model for predefined rules and building a business operational model for business processes; b) normalizing vocabularies in the rule model and the business operational model; c) checking whether the rule model is satisfied by the business operational model; and d) outputting a report on checking results. The present invention also provides a corresponding system for rule compliance checking. The rule compliance checking of the present invention allows users to perform fast and effective automatic checking of rule compliance, avoid interference of man-made factors in checking process to a great extent and thus guarantee veracity of checking results.

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 method of encoding knowledge is disclosed, which can be used to automatically detect problems in software application deployments. The method includes accessing a source of knowledge describing a problem known to occur in deployments of a particular software application, and which identifies a plurality of conditions associated with the problem. An encoded representation of the knowledge source is generated according to a predefined knowledge encoding methodology. The encoded representation is adapted to be applied automatically by a computer to analyze data representing a current state of a monitored deployment of the software application to detect whether the conditions and the problem exist therein.

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: Embodiments are provided to predict and suggest one or more candidates. Words, acronyms, compound words, phrases, and other textual and symbolic representations can be predicted and suggested to a user as part of an input process or other user operation. In an embodiment, a number of textual candidates can be predicted based in part on user input and data stored in a store component. The number of predicted textual candidates can be suggested to a user as a number of suggested textual candidates. Embodiments enable a user to select an appropriate textual candidate from the number of suggested textual candidates, while reducing a number of associated user operations.

Abstract: An automated signature detection system and method of use and, more particularly, a predictive modeling component configured to accurately predict maintenance events for optical elements used in lithographic tools. The system comprises at least one module configured to analyze data associated with power illumination at a surface. The at least one module also is configured to fit a curve to the analyzed data using an exponentially based decay model.

Abstract: A method for building a rulebase includes receiving a plurality of rulebase components. The method also includes merging the rulebase components to create a consolidated rulebase.

Abstract: A fault diagnosis system for diagnosing faults in complex equipment. The system includes means for storing a set of diagnostic signatures which relates a set of known faults which may occur in the equipment to respective fault symptoms which are deemed indicative of said known faults; and means for processing the diagnostic signatures and a set of fault symptoms identified for a current state of the equipment to calculate diagnostic data for identifying a fault causing the current state of the equipment. The diagnostic data includes a plurality of values which are indicative of different relative non-zero likelihoods of each of a plurality of different known faults causing the current state of the equipment.

Abstract: A graphical user interface (GUI) is provided for use in conjunction with attribute evaluation utilizing computation rules and a combining policy. The graphical user interface displays a visual representation of the evaluation of attributes. The GUI displays a representation of the evaluation status of attributes and their associated computation rules during execution. The display may be updated dynamically to provide a user with a visual representation of the progression of attribute evaluation. The representation of evaluation status may include representations of the values assigned to, as well as the state of, data items and associated computation rules. States may be visually represented in the display in various ways, such as using various colors or labels associated with the data items and associated computation rules. Further, the particular data items and computation rules for which evaluation status is represented may be user selectable.

Abstract: A computerized method for automatic document classification based on a combined use of the projection and the distance of the differential document vectors to the differential latent semantics index (DLSI) spaces. The method includes the setting up of a DLSI space-based classifier to be stored in computer storage and the use of such classifier by a computer to evaluate the possibility of a document belonging to a given cluster using a posteriori probability function and to classify the document in the cluster. The classifier is effective in operating on very large numbers of documents such as with document retrieval systems over a distributed computer network.

Abstract: The invention presents novel method, apparatus, and data structures for storing, maintaining, and executing processing logic on a computer system. Processing logic is encoded into its distinct, constituent elements that are flexibly linked, facilitating reuse and reconfiguration. Executable responses are selected for an input signal by identifying a correspondence between the input signal and an expression, evaluating the expression to a resulting value, and identifying a correspondence between the expression and its resulting value, and an executable response.

Abstract: Improved human-like realism of computer opponents in racing or motion-related games is provided. The computer driver may be “distracted” by various characteristics, such as nervousness caused by another competitor closing the gap behind a computer driver. The distraction effects may be reflected in the alteration of stimuli to represent the computer driver “missing” stimuli, as though the AI competitor has taken its virtual eyes away from the course in front of its vehicle for an extended time period in order to watch the racing vehicle behind it. In addition, some distractions may be caused by different directional stimuli. When it is determined that an AI driver has glanced into the rear view mirror, visual stimuli from in front of the vehicle may be skipped because a human driver would not be able to simultaneously process visual stimuli from both the front of the vehicle and the rear view mirror.

Abstract: The invention provides systems and methods for determining an efficient frontier, which comprises a collection of security allocations in a portfolio, with multiple, conflicting objectives in a multi-factor portfolio problem. The method includes providing a mathematical model of a relaxation of a problem; generating a sequence of additional constraints; and sequentially applying respective nonlinear risk functions to generate respective adjusted maximum return solutions to obtain an efficient frontier.

Abstract: A system and methods providing for the evaluation of transaction data records to first determine forward link associations between items as reference and related items identified by corresponding “expert” users as a basis for establishing expert database item association rules. The forward link associations are then evaluated to identify back link associations between reference and related items. Back link weights, corresponding to the respective back link associations reflecting the depth and strength of the back linked associations are determined and associated with the forward link associations to provide an augmented basis for subsequently evaluating the association rules collected into an expert database.

Abstract: A method and apparatus are described for computing the value at a given percentile of a population and the percentile of a given value in the population. In the described system, computing efficiencies are achieved by storing received values in “buckets” and performing percentile calculations based on values in the buckets.

Abstract: The invention presents novel method, apparatus, and data structures for storing, maintaining, and executing processing logic on a computer system. Processing logic is encoded into its distinct, constituent elements that are flexibly linked, facilitating reuse and reconfiguration. Executable responses are selected for an input signal by identifying a correspondence between the input signal and an expression, evaluating the expression to a resulting value, and identifying a correspondence between the expression and its resulting value, and an executable response.

Abstract: A device in accordance with the present invention includes drive circuitry (110) coupled to a plant (120). The drive circuitry (110) generates a first set of command signals to transition the state of the plant (120) from an initial state to an intermediate state at a first discrete time. The drive circuitry (110) generates a second set of command signals to transition the state of the plant (120) from the intermediate state to the final state at a second discrete time. A state estimator (130) is coupled to the plant to detect the state of the plant (120). A method for changing the state of a plant (120) is also provided. The method includes the steps of transitioning the plant (120) from a first state to a selected state at one of a plurality of discrete times, each of the discrete times being separated by at least one discrete time interval, and transitioning the plant (120) from the selected state to a final state at another of the plurality of discrete times.

Abstract: A method of operation of an arithmetic and logic unit, a storage medium, and an arithmetic and logic unit introducing a technique and concept of converting a serial structure of decisions having an order dependency to an indeterminate code binary tree which can be processed in parallel so as to simplify the configuration and enable higher speed operation processing.Where a serial structure of decisions having an order dependency is converted to a binary tree structure using decision nodes not having dependency input/outputs as leaves and higher priority determination nodes as the nodes other than the leaves, the decision nodes having dependency input/outputs are replaced by decision nodes not having dependency input/outputs provided with connotation decision nodes and indeterminate code generation nodes.