Abstract: A method and system to minimize redundancy in testing a new software system by utilizing a knowledge base is provided. The knowledge base may be represented in a form of a decision tree including leaf nodes which store previously tested optimal configurations. When the knowledge base does not contain an optimal configuration for the new software, an optimal solution for the new software system may be determined by adding a further decision tree branch to the initial decision tree. A desirable tree branch may be selected from a table including a predetermined set of desirable tree branches for each category of software. As a result, the number of solutions to be tested on the input software may be limited and cost and effort to run redundant tests on a software system may be reduced.

Abstract: A data processing apparatus includes an input unit that receives input data, a calculating unit that calculates a feature vector, a selection receiving unit that presents processing options to a user and receives a user selection, a storing unit stores processing history information, and a predictor constructing unit that constructs a predictor for an identifying algorithm that predicts optimal processing for input data based on processing history information stored in a history database. An optimal function predicting unit predicts optimal processing based on a feature vector calculated for new data by using the predictor and an evaluating unit evaluates work efficiency for the predicted optimal processing, wherein the evaluating unit is configured to evaluate work efficiency for the optimal processing based on a prediction accuracy of the predictor and a user specific working time that is required for each user to select one of the processing options with the selection receiving unit.

Abstract: A method of payload estimation of weight bearing machinery, the method comprising the steps of: (a) creating a series of Kalman filter approximations to the weight bearing machinery for different levels of payload; (b) determining from the series an approximation to the current operating characteristics of the weight bearing machinery; and, (c) utilizing the parameters derived from the step (b) to determine an estimated payload of the weight bearing machinery.

Abstract: A Delta Framework program (DF) automatically detects and prevents breaking scenarios during an automated software build by identifying a build artifact from a list of build artifacts in a repository; comparing the build artifact to a current software build; identifying a delta between the build artifact and the current software build; determining whether the delta has a link to a rule in the rules database; responsive to the artifact having a link to a rule, determining whether the rule identifies a breaking scenario; responsive to the rule identifying the breaking scenario, taking an action specified by the rule.

Abstract: In one embodiment, the present invention includes a method for identifying a deformable object of a scene of a computer game that is visible by an artificial intelligence (AI) character of the game, requesting a speculative physics simulation associated with the deformable object to determine a result of an action to the deformable object by the AI character, and selecting an action to be performed by the AI character, where the selection is based at least in part on the speculative physics simulation. Other embodiments are described and claimed.

Abstract: Embodiments of the invention provide an RBE that uses a logical abstraction for a set of application rules that allows the rules to be implemented, presented and modified efficiently. For one embodiment, rules logic for implementing a set of application rules is stored. The rules logic is specified by a processing sequence using one or more application factors, each of which has one or more application factor values. A plurality of entries corresponding to each application factor is separately stored. Each entry contains a data point set having one or more data points and a result corresponding to the data point set. Each of the one or more data points of a data point set corresponds to a distinct factor value.

Abstract: An exemplary method for optimizing a continuous density hidden Markov model (CDHMM) includes imposing a constraint for discriminative training, approximating an objective function as a smooth function of CDHMM parameters and performing a constrained line search on the smoothed function to optimize values of the CDHMM parameters. Various other methods, devices and systems are disclosed.

Abstract: The present invention tests computer systems for defects that are able to cause performance and functional problems. An agent application is first installed on a user's system. The agent application then retrieves problem data from the expert system library pertinent to the user's operating environment. The agent application tests the user's system for each problem description within a downloaded data structure from the expert system library. If a problem is discovered, a script attempts to remediate the problem and/or notifies the user, describing the issue. If an unknown problem arises, a feedback mechanism expands the expert system library by sending a notification that a problem was discovered. The feedback is then utilized to increase the total knowledge in the expert system library. Then when another user with a similar or the same setup is tested, the agent application will recognize the issue and will take the appropriate remedial actions.

Abstract: A computer implemented data processor system shifts a semantic network topology to increase efficiency in disambiguating a contextual meaning of natural language symbols.

Abstract: A computer implemented data processor system automatically disambiguates a contextual meaning of natural language symbols to enable precise meanings to be stored for later retrieval from a natural language database, so that natural language database design is automatic, to enable flexible and efficient natural language interfaces to computers, household appliances and hand-held devices.

Abstract: A method of optimizing a function of a parameter includes associating, with an objective function for initial value of parameters, an auxiliary function of parameters that could be optimized computationally more efficiently than an original objective function, obtaining parameters that are optimum for the auxiliary function, obtaining updated parameters by taking a weighted sum of the optimum of the auxiliary function and initial model parameters.

Abstract: A method of organizing received decision instances based on reference architecture, including determining a respective particular project phase attribute for each of the decision instances, classifying the decision instances, determining a respective scope attribute for each of the decision instances, categorizing the decision instances in accordance with each of the respective scope attributes thereof, for all decision instances with the same categorization and with the same classification, ordering the corresponding decision instances by model elements, modeling directed links between apparently dependent decision instances, analyzing the dependent decision instances to confirm that the decision instances satisfy the apparent dependencies represented by the directed links and producing an error message if a result of the analysis is negative, and generating a real-time updateable and/or modifiable to-do list interface.

Abstract: A method, and computer program product for computing a change plan are presented. A model of a current configuration is identified, the model including modeled system assets and modeled tasks. A request to change the current configuration to a new configuration is received. The request to change the current configuration to generate a plurality of valid strategies to be used in a genetic programming parse tree corresponding to modeled assets and modeled tasks of said model is applied to the model. The request to change the current configuration is applied to at least one of said valid strategies to generate a plurality of potential change plans. The change plans are evolved according to genetic programming principles to a preferred change plan.

Abstract: A lightweight physical design alerter can analyze a workload and determine whether a comprehensive tuning session would result in a configuration improvement over the current configuration. The alerter provides a low-overhead procedure that can run during normal operation of a database management system and produce a notification if a current configuration is less than optimal. The alerter can report lower and upper bounds on the improvements that could be obtained if a comprehensive tuning tool is launched. A lower bound can be justified by generating feasible configurations. The disclosed embodiments can be extended to query updates, materialized views, and other physical design features (e.g., partitioning).

Abstract: Embodiments herein provide a method, computer program product, etc. of measuring a large population of web pages for compliance to content standards that require human judgment to evaluate. The method performs an automated analysis of a web space, comprising gathering information about structure and content of the web space. The performing of the automated analysis further comprises creating first data and second data. Specifically, the creating of the first data comprises creating page-relationship data based on a directory tree structure of servers in the web space or link distances amongst pages in the web space. The creating of the second data comprises analyzing web page content, comprising creating compliance-indicating data and/or content structure data for pages in the web space. In addition, the performing of the automated analysis can comprise performing the automated analysis on a web space that lacks objective standards violations that can be identified using software.

Abstract: A computer implemented data processor system automatically disambiguates a contextual meaning of natural language symbols to enable precise meanings to be stored for later retrieval from a natural language database, so that natural language database design is automatic, to enable flexible and efficient natural language interfaces to computers, household appliances and hand-held devices.

Abstract: The present invention is a method for automatic proving using many-sorted first-order logic. Embodiments of the invention apply a modified method of resolution of first-ordered logic. The method of resolution further comprises: processing at least one first sentence (P1) and at least one second sentence (Q1), wherein each of the at least one first sentence and the at least one second sentence contain literals (Pi, Qi). In addition, the method also restricts a unifying process in the method of resolution; determines the literals (Pi) of the at least one first sentence; negates the literals (Qi) of the at least one second sentence of the restricted unifying process; provides the determined literals (Pi?) and negated literals (Qi?) to the restricted unifying process; chooses a substitution list in the restricted unifying process with a predetermined type; and derives a resolvent sentence in response to the restricted unifying process and the chosen substitution list of predetermined type being unified.

Abstract: There is provided a control apparatus including a function of generating an operation signal applied to a control subject and a model that simulates characteristics of the control subject, a function of receiving an evaluation value signal calculated based on a measurement signal obtained by applying the operation signal to the control subject and the model, and a function of learning to generate the operation signal such that an expected value of the sum of the evaluation value signals obtained from a present state to a future state is either maximum or minimum in which the evaluation value signal calculated based on the measurement signal from the model is calculated by adding a first evaluation value obtained based on a deviation between the measurement signal obtained from the model and a setpoint value, and a second evaluation value obtained based on a difference in characteristics between the model and the control subject.

Abstract: A system for identifying keywords in search results includes a plurality of neurons connected as a neural network, the neurons being associated with words and documents. An activity regulator regulates a minimum and/or maximum number of neurons of the neural network that are excited at any given time. Means for displaying the neurons to a user and identifying the neurons that correspond to keywords can be provided. Means for changing positions of the neurons relative to each other based on input from the user can be provided. The change in position of one neuron changes the keywords. The input from the user can be dragging a neuron on a display device, or changing a relevance of two neurons relative to each other. The neural network can be excited by a query that comprises words selected by a user. The neural network can be a bidirectional network. The user can inhibit neurons of the neural network by indicating irrelevance of a document.

Abstract: A computer-implemented method of determining a common social context can include detecting a collaboration between a plurality of participants. The method can include identifying a plurality of common social contexts and determining a probability that the collaboration belongs to each of the plurality of common social contexts. At least one probability and corresponding common social context can be output.