Abstract: In one embodiment, one or more processor-readable media can be configured to store code representing instructions that when executed by one or more processors can cause the one or more processors to select a first relationship rule based on a first combination of parameters including a first parameter, and based on a hierarchical position of the first parameter within a hierarchical structure of a set of parameters from a biological category. A first statistical value can be defined based on a plurality of test values and based on the first relationship rule. A second statistical value can be defined based on a second relationship rule and based on a second combination of parameters. The second relationship rule can be selected based on a hierarchical position of the second parameter within the hierarchical structure of the set of parameters.

Abstract: A method for rapidly determining feasibility of a force optimization problem and for rapidly solving a feasible force optimization problem is disclosed. The method comprises formulating the force optimization problem or force feasibility problem as a convex optimization problem, formulating a primal barrier subproblem associated with the convex optimization problem, and solving the primal barrier subproblem. The method and related methods may also be used to solve each problem in a set of force optimization problems, determine the minimum or maximum force required to satisfy any of a set of force optimization problems, solve a force closure problem, compute a conservative contact force vector, or solve a feasible force optimization problem with bidirectional forces.

Abstract: In a management of taxonomic information, a name that specifies an organism is identified. Based on the name and a database of organism names or classifications, another name that specifies the organism and that represents a link between pieces of biological identification information in the database, or a classification for the organism, is determined. Based on the other name or the classification, information associated with the organism is identified.

Abstract: A method and apparatus for efficient indexed storage for unstructured content have been disclosed.

Abstract: A system for temporal data mining includes a computer readable medium having an application configured to receive at an input module a temporal data series and a threshold frequency. The system is further configured to identify, using a candidate identification and tracking module, one or more occurrences in the temporal data series of a candidate episode and increment a count for each identified occurrence. The system is also configured to produce at an output module an output for those episodes whose count of occurrences results in a frequency exceeding the threshold frequency.

Abstract: Rule based data object matching to determine if two or more objects are similar to allow the objects to be merged into one master data object. The rules explicitly state what conditions are required to consider two or more objects equal. The certainty of the rule may be specified. Examples for the certainty are automatic, manual high, medium and low probability. For example, the certainty “automatic” specifies that the objects can be considered matches and no additional manual verification is needed. The certainty “manual low probability” specifies that there is a low probability that the objects are matches and that a manual verification is needed. Matching rules may be grouped by priority. If matches are not found, the next highest priority group of rules is processed. Hierarchical matching rules may be specified that are able to express similarity of objects considering structured objects containing sub-objects in a hierarchical manner.

Abstract: A system for temporal data mining includes a computer readable medium having an application configured to receive at an input module a temporal data series having events with start times and end times, a set of allowed dwelling times and a threshold frequency. The system is further configured to identify, using a candidate identification and tracking module, one or more occurrences in the temporal data series of a candidate episode and increment a count for each identified occurrence. The system is also configured to produce at an output module an output for those episodes whose count of occurrences results in a frequency exceeding the threshold frequency.

Abstract: Methods and apparatus, including computer program products, related to stateful, continuous evaluation of event-condition-action rules by a state correlation engine. In general, one or more events may be determined to have occurred and an event-condition-action cycle may be caused to be processed for the events. The event-condition-action cycle may include evaluating condition networks based on a state of execution of the state correlation engine that includes the events, where the state of execution is based on a state of execution before the events, and enabling the actions to be executed if evaluation of the condition networks with the state of execution is to result in one or more actions being enabled.

Abstract: A solution for controlling access to Uniform Resource Identifier (URI) identified resources can receive a request for a resource identified by a URI. The URI associated with the request can be compared against at least one previously established security rule. The security rule can include an exclusion comparison operator and a regular expression defining a pattern. A determination as to whether to grant a requester access to the resource can be based at least in part upon results of the comparing of the URI against the previously established security rule.

Abstract: The invention provides, in one aspect, a method of finding a rule in a rules base that includes a plurality of rule entries, each having a rule and an associated objective and one or more associated circumstances. A rule finder accesses the rules base in response to a request, with a specified objective and with specified circumstances, by searching the rules base for a matching entry. Where the search fails, the rule finder searches one or more translation tables for entries having first circumstances matching those specified in the request that resulted in the failure. If found, the rule finder repeats the search of the rules base with the specified objective and with a second (or “map-to”) circumstances from matching entries in the translation tables. The rule finder can return, e.g., to an application program that issued the request, a rule found during that repeat search of the rules base.

Abstract: When transmitting an on-road location on a digital map, an information provider transmits, as on-road location information, string of coordinates information representing the road shape of a road section including the on-road location having a predetermined length, additional information including at least one information item chosen from a group of the attribute information on the road including the road location and detailed information on the nodes in the road section, and relative information indicating the on-road location in the road section. Receiving party receiving this on-road location information performs shape matching to identify the road section on a digital map and uses relative data to identify the on-road location in this road section. The receiving party can identify the road shape with high accuracy even when only a small amount of string of coordinates data is available. This makes it possible to reduce the data transmission amount and identify an on-load location with high accuracy.

Abstract: A method and a system for relating of a value network analysis of a mission to a knowledge base of dependencies of data objects, applications and information technology resources required for achieving of such mission, such method used for optimization of provisioning for information technology resources and for prioritizing of control of data and application security and integrity of such mission.

Abstract: A method, system and computer program product for performing pattern matching in parallel for a plurality of input streams. The method includes calculating a memory address in a translation table responsive to a current input value, a current state and current state information. A transition rule is retrieved from the transition rule table at the memory address, the transition rule including a test input value, a test current state, and next state information. It is determined if the current input value and the current state match the test input value and the test current state. The current state information is updated with the next state information in response to determining that the current input value and the current state match the test input value and the test current state. The current state information is updated with contents of a default transition rule in response to determining that the current input value and the current state do not match the test input value and the test current state.

Abstract: Described is a system and method for determining a classification of an application that includes initiating a stress test on the application, the stress test including a predetermined number of stress events, wherein the stress events are based on a network impairment. A response by the application to each stress event is identified and the application is classified as a function of the response into one of a first classification and a second classification, the first classification indicative of a normal application and the second classification indicative of an undesired application. If, the application is in the second classification, a network response procedure is executed.

Abstract: A system and method for learning models from scarce and/or skewed training data includes partitioning a data stream into a sequence of time windows. A most likely current class distribution to classify portions of the data stream is determined based on observing training data in a current time window and based on concept drift probability patterns using historical information.

Abstract: Providing for arbitration and dynamic downloading of microcode at a controller associated with electrically erasable non-volatile memory is described herein. By way of example, a download agent can be provided to a module of such non-volatile memory. Characteristics of the memory module and/or specifications of a host application can be utilized to select one or more memory control modules from a group of such control modules. A selected control module(s) can be installed at the controller via the download agent to provide non-default management of raw memory. Further, arbitration of multiple control modules can be implemented to select among various mechanisms to control/manage raw memory. Arbitration can be based, for instance, on specifications of a host device application. Accordingly, great flexibility and control of raw non-volatile memory can be provided for a host device at an application level.

Abstract: System and method for identifying a pattern. A method of the invention compiles a pattern description where the pattern description defines a series of a first event and a second event relating to the first event. The first event is received and includes a type parameter data, a time parameter data, and a substance parameter data. A system of the invention includes a script component for associating or attaching a first script to the first event. The first script defines the type, time, and substance parameters of the second event as a function of the parameters of the first event according to the pattern description. A pattern recognition engine executes the attached first script and the executed script identifies the second event and thereby identifies the pattern.

Abstract: The present invention relates to a computer system and methods of computer-facilitated data analysis for providing reliable DNA alignments. More specifically, the invention relates to the automation of alignment and naming of mitochondrial DNA sequences for use in forensic analysis. The methods of the present invention provide consistency of sequence nomenclature by minimizing alignment ambiguities, thus providing a common functional system within and among laboratories.

Abstract: The subject disclosure pertains to systems and methods for facilitating training of machine learning systems utilizing pairwise training. The number of computations required during pairwise training is reduced by grouping the computations. First, a score is generated for each retrieved data item. During processing of the data item pairs, the scores of the data items in the pair are retrieved and used to generate a gradient for each data item. Once all of the pairs have been processed, the gradients for each data item are aggregated and the aggregated gradients are used to update the machine learning system.

Abstract: This document discusses, among other things, a user interface capable of resolving interactions between programmable parameters for operation of a personal medical device. Programming these devices is a difficult task when many parameters are involved. The medical device interface attempts to reduce and minimize constraint violations between interdependent parameters using an initial set of parameter values supplied by user (typically a physician) input, and constraint violations describing invalid parameter values. A user is given the option to select one or more parameters to remain constant. If possible, a set of parameter values with less egregious constraint violations is displayed to the user. A user is prompted to accept the set of parameter values and program the medical device.

Abstract: A system, apparatus and method are provided that enable the receipt of answers to questions from users and to make those answers persistent within a generalized database schema. A set of one or more middleware entities and components are provided to process the user's answers that are submitted to the system. The middleware entities differentiate one user from another user by use of a session. Different sets of questions are grouped into encounters, and the answers to the questions for a particular encounter are given a unique identifier. The unique identifier can be used to identify the user and/or the particular encounter. The answers to the questions can be retrieved and viewed in numerous ways, such as by user, by encounter, by question, by question type, by answer, by answer type, etc. The selection of database schema and the structure of the middleware enables the system to handle any answer to any question without requiring the restructuring of the database or database schema.

Abstract: Hashing and pattern matching are used in an information processing system to process incoming messages from a network such as an Ethernet-based network. Using hashing and pattern matching increases the efficiency of message acceptance and rejection without increasing software-based processor tasks. A hash function and a pattern matching function are performed on a message received by an information processing system, and the message is selectively accepted based on at least one of a hash result and a pattern matching result. The incoming message can be searched for the existence of patterns and the absence of the patterns. The incoming message can be searched for the existence of multiple patterns. The results of pattern matching can be used not only for acceptance and rejection of messages, but also for other post-receipt tasks such as selective storage of incoming messages according to identified relative priorities or absolute criticality of messages having particular pattern matches.

Abstract: Systems and methods using iterative particle reduction for localization and pattern recognition are disclosed. In one embodiment, a method for localization of a plurality of sensor nodes includes establishing a set of particles representing candidate positions for the plurality of sensor nodes; iteratively reducing the set of particles using a plurality of particle reduction iterations, wherein each particle reduction iteration eliminates at least some particles based on at least one constraint and a set of remaining particles from a prior iteration; and after performing the plurality of particle reduction iterations, determining a set of probable locations of the plurality of sensor nodes based on a final set of particles.

Abstract: In one embodiment, data relating to usage patterns of the user is stored, wherein the data includes information as to items which were used and the context in which they were used. The data is then clustered into clusters of data points. Then a centroid is determined for each of the clusters. A cluster similar to a current context of the user is selected by comparing a data point representing the current context of the user to one or more of the centroids. For each of one or more items, a threshold based on values for a plurality of the centroids with respect to the corresponding item, wherein a threshold is used to compare with centroid value of an item in a selected cluster to determine whether to recommend the item.

Abstract: Automated facet analysis of input information selected from a domain of information in accordance with a source data structure is described. Facet analysis may proceed by discovering at least one of facets, facet attributes, and facet attribute hierarchies of the input information using pattern augmentation and statistical analyses to identify patterns of facet attribute relationships in the input information.

Abstract: In accordance with one embodiment of the present invention, there are provided mechanisms and methods for implementing concurrent generation of an a-box and a t-box for use in a computing environment comprising a knowledge system. A t-box comprises categories and relationships about the categories and an a-box, comprising assertions of individual instances of the categories of the t-box. With these mechanisms and methods, it is possible to process structured information into a form usable by a knowledge engine.

Abstract: A system and method for generating and validating a user profile (25) for a user based on a static profile (10) and a dynamic profile (15) of the user. The method and system compresses the dynamic rules (15) into aggregated rules so that the user can view a comparatively small number of the aggregated rules and select the desired rules from the aggregated rules based on user desired criteria. The method and system validates user rules (60) using a processing device, which are retrieved from a storage device. The user rules are separated into at least one subset of a user set. Then, it is determined if a particular rule of the at least one subset is one of acceptable, unacceptable and undecided based on a defined criteria (415). If the particular rules of the at least one subset are acceptable, the particular rules of the at least one subset are provided (e.g. assigned) to a corresponding user (435).

Abstract: The evaluation of a policy can be delayed until all rules criteria needed for evaluation are available. Also, new types of rules criteria can be registered without requiring changes to a rules engine. A policy manager allows rules to be evaluated and decisions made at different stages of the request handling. The policy manager facilitates interaction with the rules engine until all criteria are evaluated. The policy manager also allows modules developed by third parties to provide notification when criteria can be decided and thus complete evaluation.

Abstract: A system for capturing, synthesizing, analyzing, and reporting drug performance data. The system can comprise one or more electronic data processors and a data communications interface connected with the one or more processors for accessing a plurality of databases containing drug analysis and best-practice guidelines, patient data, and demographic data. The system can also include a situational modeler configured to execute on the electronic data processor in order to integrate the best-practice guidelines, patient data, and demographic data, create best-practice templates for analysis, based upon the integration of the guidelines, patient data, and demographic data, analyze the best-practice guidelines, patient data, and demographic data, and generate a series of reports and analyses to determine drug performance, based upon the analysis.

Abstract: A storage controller of the present invention narrows down the target for data comparison by comparing hash codes beforehand and rapidly detects duplicated data. A hash value setting unit sets a hash code in data received from a host. Hash code-attached data is stored in a logical volume. A microprocessor unit compares the hash codes for each comparison-targeted data. When hash codes match with one another, a data comparator compares the target data, and determines whether or not the data is duplicated data. When duplicated data is detected, the microprocessor unit removes the duplicated data.

Abstract: A method of selectively identifying conflicting network access rules within a knowledge base containing a plurality of network access rules, each rule having a condition portion and a consequence portion, and creating a corresponding resolved consequence, including the steps of comparing the condition portions of the rules, determining conflicting rules to be rules with matching condition portions and differing consequence portions, and analyzing the consequence portions of each of the conflicting rules to define the resolved consequence to be executed when the condition portion in any of the conflicting rules is executed.

Abstract: An information reproducing apparatus includes: a content storage configured to store content which includes a plurality of resources and a utilization condition of the resources; a scenario storage configured to store a scenario which includes output rules each defining a way of combining one or more resources selected from the plurality of resources and a play list defining an order of reading the output rules; a reading out unit configured to read out the scenario and the content from the storages; a condition processing unit configured to perform processing for satisfying the utilization condition in the content; and an information combining unit configured to read the output rules in the order specified by the play list, combine the one or more resources according to respective one of the output rules and output combined resources for the respective one of the output rules.

Abstract: Systems and methods for matching objects against a set of rules are described. The present invention is a novel rule execution algorithm that generally operates with greater efficiency than known algorithms. The algorithm uses a test analyzer to determine the relationships that exist between pairs of tests within a ruleset. Each rule is then translated into loops and tests, and merged into a unified series of loops and tests using the output of the test analyzer. The algorithm then generates pattern matching code corresponding to the unified series of loops and tests for evaluation by a virtual machine, and auxiliary code that provides object manipulations and rule actions at the service of the pattern matching code. In its runtime, the algorithm loads objects into the pattern matching code through an access interface. The pattern matching code is then executed by the virtual machine against the loaded objects.

Abstract: A system and method for autonomic problem determination. Events and problems associated with the events are received from a computing resource and are expressed as entries in an event-problem matrix. Expert knowledge is expressed as entries in one or more multi-level structure dictionaries. The system and method enables dynamic interaction between the events in the matrix and the current dictionaries with its entries being updated continuously to maximize correlation among the events and problems. The index of each term in the dictionary is used to calculate the weight of each event in the matrix wherein events having frequent association with a specific problem will be given a higher weight in the matrix. Using singular value decomposition (SVD), the weighted events enable an accelerated and accurate convergence to a set of specific associated problems.

Abstract: Some embodiments of alpha node hashing in an exemplary rule engine have been presented. In one embodiment, constraints are added into a constraint set in response to requests from one or more users of a rule engine. The rule engine then determines which constraints within the constraint set are mutually exclusive. Furthermore, the rule engine dynamically enables hashing of facts asserted into a working memory of the rule engine in response to a current number of the mutually exclusive constraints.

Abstract: Some embodiments of beta node indexing in an exemplary rule engine have been presented. In one embodiment, a rule engine creates a network based on a set of rules. The network includes at least one multiple-input node, such as a beta node having two inputs. The beta node further includes a memory associated with each input. The rule engine may generate a single index for at least one of the memories of the beta node based on a set of predetermined attributes of elements within the memory. Examples of the elements include tuples and data objects. The index includes a set of composite keys, each having a value of each of the attributes.

Abstract: A systematic method of generating a neuro-fuzzy structure a system comprises: recording data relating sample system outputs to sample system inputs, granulating the data to identify rules relating the inputs to the outputs, measuring information loss during the granulation process to enable identification of an optimum number of rules, and constructing the network so that it has a plurality of processing elements corresponding to the rules.

Abstract: Some embodiments of a fact type abstraction mechanism of a rule engine have been presented. In one embodiment, a fact type abstraction layer is provided to a rule engine core to allow the rule engine core to access facts of multiple different types. Further, the rule engine core is used to process the facts of multiple different types against a predetermined set of rules without converting the facts of multiple different types into a native type.

Abstract: The invention described herein provides a method and apparatus for storing information in a memory structure and determining mathematical invariants in the memory structure. These invariants are then used to predict nested data patterns given only a few data elements or given incomplete data elements. The method uses a Memory Recognition Engine (MRE) that memorizes everything it processes. The MRE method can be applied to any problem where data sequences are involved that generate patterns only or nested patterns.

Abstract: An adaptive parser capable of automatically reordering expressions such that more commonly matched expressions are tested earlier than less commonly matched expressions; by reordering the expressions in this manner, less frequently matched expressions are less frequently tested, or may not be tested at all, thereby lowering the overall number of tests and increasing the amount of data that can be parsed in a given time period.

Abstract: A location of a missing object is predicted based on past sightings of objects including the missing object, and a new sighting of the objects except for the missing object. For a respective given object in the objects, the past sightings are memorized based on respective distances of respective remaining objects from the respective given object. Distance-based memorization may take place using an agent or associative memory for a respective given object. Then, for a respective given object, except for the missing object, a distance of the missing object from the respective given object is predicted, based on the past sightings that have been memorized and the new sighting, to obtain candidate locations for the missing object. The candidate locations are then disambiguated, to predict the location of the missing object.

Abstract: A system and method that are directed towards developing a computer user interface employing a Personal Support Infrastructure (PSI) stack. The PSI stack is arranged to represent various layers of a human being employing a holistic approach. In one embodiment, the PSI stack may enable organization, development, and solicitation of requirements for the development of a human-machine interface, such as for a mobile device, and the like. In one embodiment, the PSI stack is configured as a data structure that may be populated with elicitations oriented towards developing the set of human-machine interface requirements.

Abstract: A system and method for analyzing enterprise applications driven by business processes is provided. The method for analyzing business processes comprises the steps of obtaining process data, serializing the process data, identifying patterns in the serialized process data, creating analyzed process data based on the identified patterns, and publishing the analyzed process data. In addition, the patterns can be identified using one or more of user-defined algorithms, rules, and reference process models, and the user-defined algorithms can be plug-ins. Also, information regarding the analyzed process data can be displayed.

Abstract: An analysis supporting apparatus that supports a product analyzing operation, includes a model-data generating unit that generates model data regarding an analysis model of an analysis target component in association with component hierarchy data representing a hierarchy of components forming an analysis target product; a model-data updating unit that reflects results of an analyzing process in the model data; and a simplified-model generating unit that generates, based on a rule registered in advance, simplified model data from the model data in which the results of the analyzing process have been reflected by the model-data updating unit.

Abstract: Instant message systems are enhanced by establishing at least one handling rule that is evaluated in an instant messaging environment, each established handling rule defining a condition based upon at least one of identified content or identified context, and a corresponding event handling action to be performed within the instant message environment. Upon identifying an instant message conversation within the instant message environment between a user and a correspondent, each handling rule is evaluated and the event handling action of an associated handling rule is performed if it is determined that the condition of handling rule is satisfied. Further, an indication that the corresponding event action was performed is conveyed to a corresponding user.

Abstract: A key attribute may be selected for a set of objects in a fact repository. A candidate attribute is identified and objects having an attribute-value pair with the candidate attribute are gathered. The candidate attribute is selected as a key attribute if the names of the gathered objects and the values of the objects for the candidate attribute satisfy predefined criteria. For instance, objects may be merged into one object if they have same or similar names and have the same value for a key attribute.

Abstract: Methods and apparatus, including computer program products, for inference processing in a fact-based business automation system, including receiving a rule set as a single package, generating a dependency graph for the rule set, and generating a sequence of processing logic for optimal processing of inputted facts.

Abstract: An implementation of SVM functionality integrated into a relational database management system (RDBMS) 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 database management system comprises data stored in the database management system and a processing unit comprising a client application programming interface operable to provide an interface to client software, a build unit operable to build a support vector machine model on at least a portion of the data stored in the database management system, and an apply unit operable to apply the support vector machine model using the data stored in the database management system. The database management system may be a relational database management system.

Abstract: Computational decision making systems and methods are provided for delivering scenario specific information. A decision making scenario has a number of variables and associated values. Input variables may be matched to data objects to find a match or the closest match. Decision information embodying the outcome of a decision making process may be associated with a grouped data object and the decision information associated with the best matching grouped data object or objects is provided.

Abstract: A method for solving a constraint satisfaction problem (CSP) comprises identifying a first illegal combination associated with at least one variable, wherein the first illegal combination contradicts at least one constraint; grouping the first illegal combination with a second illegal combination, in response to determining that the first and second illegal combinations contradict the same constraint; identifying at least one failure explanation for each group of illegal combinations, wherein the failure explanation is associated with at least one illegal combination in said group to provide a reason for a contradicted constraint associated with the illegal combination; assigning a value to each variable in the given domain to solve the CSP within the limitations defined by the constraints in a solution path; and generating a result, in response to determining that at least one assigned value to a variable contradicts a constraint.