Abstract: A method and system for determining whether to alter a firewall configuration. Message flow data associated with a message packet blocked by a firewall is received. The packet was blocked based on the firewall not having a message flow rule that permitted passage of the message packet. Risk values associated with a source network, destination network and destination port are identified by the message flow data. Based on the risk values, an electronic recommendation indicating whether to add to the firewall a message flow rule that permits the message flow to pass is determined and generated.

Abstract: An implementation of SVM functionality improves efficiency, time consumption, and data security, reduces the parameter tuning challenges presented to the inexperienced user, and reduces the computational costs of building SVM models. A computer program product for support vector machine processing in a computer system comprises computer program instructions for storing data, providing an interface to client software, building a support vector machine model on at least a portion of the stored data, based on a plurality of model-building parameters, estimating values for at least some of the model-building parameters, and applying the support vector machine model using the stored data to generate a data mining output.

Abstract: The invention comprises an article and method for transforming a complex or large decision tree having multiple variables; multiple values for each variable; and, multiple outcomes for each combination of variables and their associated values, into a compact, efficient graphical representation to provided enhanced ease of use and interaction by a human user. More particularly, the invention comprises a computationally efficient method for transforming an input decision tree into an optimal compact representation by computing a particular ordering of variables in the decision tree that first leads to a Directed Acyclic Graph, or “DAG,” with a minimum number of nodes. The method then converts the DAG into an exception-based DAG, or “EDAG,” with exactly one exception, having an optimal, minimum number of nodes with increased comprehensibility for a user.

Abstract: Apparatus, and an associated method, for determining viability of transformation of a conventional computer system arrangement into a virtualized arrangement. A virtualization engine is provided that includes an assessor and a scorer. The assessor carries out an assessment process, such as a system assessment, a component assessment, and a cost assessment that assesses the viability of the transformation. And, a scorer provides a quantifiable score of the assessment results. The score is used in the decision-making process to decide whether to transform the arrangement into the virtualized arrangement.

Abstract: A knowledge-based system and methods to matchmaking and social network extension are disclosed. The system is configured to allow users to specify knowledge profiles, which are collections of concepts that indicate a certain topic or area of interest selected from an. The system utilizes the knowledge model as the semantic space within which to compare similarities in user interests. The knowledge model is hierarchical so that indications of interest in specific concepts automatically imply interest in more general concept. Similarity measures between profiles may then be calculated based on suitable distance formulas within this space.

Abstract: One embodiment of the present invention provides a system that constructs a functional relationship approximation from a set of data points through nonparametric regression. During operation, the system receives a training data set in an n-dimensional space. Next, the system defines a set of regression primitives in the n-dimensional space, wherein a regression primitive in the set passes through N data points in the training data set, wherein N?n. The system then logically combines the set of regression primitives to produce a convex envelope F, such that for each point p in the n-dimensional space: (1) F(p)=0, if p is on the convex envelope; (2) F(p)<0, if p is inside the convex envelope; and (3) F(p)>0, if p is outside the convex envelope. The system next obtains the functional relationship approximation by computing an argument of the minimum of F in the n-dimensional space. The system subsequently uses the functional relationship approximation to classify data.

Abstract: System and method for managing a biofuel production process. An integrated dynamic multivariate predictive model is provided that includes a continuous process model representing a continuous process of the biofuel production process, a batch process model representing a batch process of the biofuel production process, and a continuous simulation framework. The batch process model interacts with the continuous process model as a nonlinear continuous process via the framework using bridging equations. An objective is received, as is constraint information specifying constraints for the biofuel production process, where the constraints are in terms of the framework, and process information related to the batch and continuous processes.

Abstract: A server having a database sequentially registers a plurality of Japanese messages to be translated into the database. In parallel to the registration, the server provides a first translation terminal with Japanese messages already registered, acquires English messages translated by the first translation terminal, and sequentially registers the acquired English messages in the database in association with corresponding Japanese messages. In parallel to the processes, the server provides individual second translation terminals with English messages already registered, acquires multilingual messages translated by the second translation terminals, and sequentially registers the acquired multilingual messages in the database in association with corresponding English messages.

Abstract: The scale-parameter calculating program implements a method of calculating scale parameters, each of which is for use in normalization of a distribution of values of each of explanatory variables in calculation of inter-explanatory variable distances, to predict a value of a objective variable of an unknown case by extracting one or more known cases similar to the unknown case from known cases based on inter-case distances. The inter-case distances is obtained based on the inter-explanatory distances, each of the inter-explanatory variable distances is a distance between each of the known cases and the unknown case taken for each of explanatory variables, each of the cases includes the explanatory variables each expressed by a numerical value and the objective variable expressed by a character string. Each of the known cases is a case that has a known objective variable value while the unknown case has an unknown objective variable value.

Abstract: The performance of a computer-controlled system (1) operating under the control of a first process (2), is monitored (4) by comparison (5) with a predetermined set of requirements (15, 25), to identify whether the performance of the system (1) meets the predetermined requirements. If the performance does not meet those requirements, an alternative program (22) may be selected, or generated from program elements stored in a library (60), to replace the current controller process (2).

Abstract: An algorithm that employs modified methods developed for optimizing differential functions but which can also handle the special non-differentiabilities that occur with the L1-regularization. The algorithm is a modification of the L-BFGS (limited-memory Broyden-Fletcher-Goldfarb-Shanno) quasi-Newton algorithm, but which can now handle the discontinuity of the gradient using a procedure that chooses a search direction at each iteration and modifies the line search procedure. The algorithm includes an iterative optimization procedure where each iteration approximately minimizes the objective over a constrained region of the space on which the objective is differentiable (in the case of L1-regularization, a given orthant), models the second-order behavior of the objective by considering the loss component alone, using a “line-search” at each iteration that projects search points back onto the chosen orthant, and determines when to stop the line search.

Abstract: A computer implemented method for ordering a plurality of entities by computing a dissimilarity matrix based on a plurality of probabilities. The pluralities of probabilities are determined based on a plurality of classes. A weighted distance matrix is computed based the dissimilarity matrix. A plurality of rank ordered sequence candidates based at least in part on the sum of weighted distances between neighboring entities in the rank ordered sequence is calculated. Other embodiments are described in the claims.

Abstract: Methods and systems are presented for constructing biological-scale hierarchically structured cortical statistical memory systems using currently available fabrication technology and meta-stable switching devices. Learning content-addressable memory and statistical random access memory circuits are detailed. Additionally, local and global signal modulation of bottom-up and top-down processing for the initiation and direction of behavior is disclosed.

Abstract: Systems and methods that provide a historian integrated as part of an industrial unit and/or product manufactured by the industrial process. A historian integrated as part of the industrial unit itself, can increase data resolution and supply immediate and real time data regarding the industrial unit's operation—while mitigating short comings of conventional PC historians. Moreover, a locator component can detect embedded historians that are distributed on the back plane of an industrial network, and integrated as part thereof.

Abstract: A method and system for graph mining direction-aware proximity measurements. A directed graph includes nodes and directed edges connecting the nodes. A direction-aware proximity measurement is calculated from a first node to a second node or from a first group of nodes to a second group of nodes. The direction-aware proximity measurement from a first node to second node is based on an escape probability from the first node to the second node. Disclosed herein are methods for efficiently calculating one or multiple direction-aware proximity measurements. The direction-aware proximity measurements can be used in performing various graph mining applications.

Abstract: Techniques enable the reduction of bandwidth requirements for peer-to-peer gaming architectures. In some embodiments, these techniques allow differentiation among players to decide which players should receive continuous updates and which should receive periodic updates. For those gaming systems receiving periodic updates, guided artificial intelligence is employed to simulate activity of a game object based on guidance provided by the periodic updates. Conversely, for those gaming systems receiving continuous updates, the continuous updates may be employed to update the activity of the game object rather than simulating the activity.

Abstract: An action efficiency support apparatus includes a detection unit, a storage unit, a calculation unit and a judgment unit. The detection unit detects an activity to acquire activity information. The storage unit stores the activity information. The calculation unit calculates a probability pattern as to presence or absence of the activity in a predetermined period or a probability pattern a frequency of the activity in the predetermined period, based on the activity information. The judgment unit judges an effect of personal action based on the calculated probability pattern.

Abstract: A method and a processing device may be provided for performing efficient weighted consistent sampling. A group of sets having multiple elements with associated weights may be provided. A single hash function may be applied to each of the elements of the group of sets to produce consistent uniformly distributed non-negative random numbers. Transformed values corresponding to each of the elements may be produced by determining a wth root of a value based on applying the hash function to a respective element, where w may be based on a weight associated with the respective element. A minimum transformed value or a maximum transformed value may be determined for each of the sets. Sets having matching ones of the minimum transformed value or the maximum transformed value may be determined. The determined sets may be considered to be similar.

Abstract: In various embodiments, evolutionary expert systems and methods are disclosed. For example, a method for evolving a rule base of an expert system includes creating a set of meta-rules from a set of first rules associated with the expert system, creating a set of one or more generalized virtual rule candidates based on the set of first rules and the set of meta-rules, filtering the set of generalized virtual rule candidates to remove generalized virtual rule candidates that conflict with at least one rule of the set of first rules to form a set of virtual rules, and incorporating at least one virtual rule of the set of virtual rules into the set of first rules to evolve the first set of rules.

Abstract: An enhanced method for displaying assessment and analysis of risks of adverse effects resulting from use of at least one substance of interest, comprising: identifying the at least one substance of interest; selecting a profile related to the safety of the at least one substance of interest, using at least one filter; analyzing the risks of adverse effects resulting from the use of the at least one substance of interest using at least one data mining engine; and displaying the results of the analysis of risks of adverse effects in a format that permits perception of correlations. Such a format is preferably at least one format selected from the group consisting of a radar display for display of correlations, a sortable table, and a sortable line listing and where the format contains elements linked to data regarding the adverse effects.