| Entries |
| Document | Title | Date |
|---|
| 20080215520 | METHOD AND SYSTEM FOR INDEXING AND SERIALIZING DATA - The present invention provides a computer implemented method, an apparatus, and a computer usable program product for indexing data. A controller identifies a set of data to be indexed, wherein a set of data structure trees represents the set of data. The controller merges the set of data structure trees to form a unified tree, wherein the unified tree contains a node for each unit of data in the set of data. The controller assigns an identifier to the node for each unit of data in the set of data that describes the node within the unified tree. The controller then serializes the unified tree to form a set of sequential series that represents the set of data structure trees, wherein the set of sequential series forms an index for the set of data. | 09-04-2008 |
| 20080222073 | Loose coupling of pattern components - A computer-implemented method, system, and computer program product for generating an application is disclosed. A pattern module associated with an application pattern is provided. The pattern module includes a model of the application pattern, a design time component to provide content for the model, and a runtime component to execute the operation associated with the model based with the content. A set of dependencies among the model, the design time component, and the runtime component is determined. A set of interfaces is then generated to couple the model, the design time component, and the runtime component based on the set of dependencies. | 09-11-2008 |
| 20080228688 | PRODUCTION RULE SYSTEM AND METHOD - A production rule system includes a condition part array including an arrangement of condition part elements. Each of the condition part elements includes a condition value corresponding to an evaluation of one of a plurality of condition parts. A production part array includes an arrangement of production part elements, each of the production part elements comprising one of a plurality of production parts corresponding to an executable action. A data structure selectively associates at least one of the condition part elements with each of the production part elements to define a plurality of rules. The production part associated with a given rule of the plurality of rules can be executed depending on the condition value for the at least one of the condition part elements in the given rule. A self-adaptive mechanism can be employed in the system to improve system performance and computational efficiency. | 09-18-2008 |
| 20080228689 | Content recommendations - Content recommendations are described. In an implementation, feedback collected from a user is used to determine favored characteristics of particular items of musical content. One or more other items of content, which are not music, are identified that correspond to the favored characteristics. The identified one or more other items of content are recommended to the user. | 09-18-2008 |
| 20080228690 | System and method for calculating a metric of a sub-transaction on an IP network - A system and method of calculating a metric for a sub-transaction that is included in a transaction on an IP network. | 09-18-2008 |
| 20080249974 | Method, apparatus and computer program for registering a respective target network system state form each one of a plurality of programs - It is disclosed a method comprising registering a respective target network system state from each one of a plurality of programs, each of the plurality of programs comprising a first program state, detecting a current network system state, selecting one or more of the plurality of programs based on a result matching the detected current network system state against the registered target network system states, and commanding transition of the selected one or more programs from the first program state to a second program state different from the first program state. | 10-09-2008 |
| 20080256014 | Editing and Compiling Business Rules - A component in a graph-based computation having data processing components connected by linking elements representing data flows is updated by receiving a rule specification, generating a transform for transforming data based on the rule specification, associating the transform with a component in the graph-based computation, and in response to determining that a new rule specification has been received or an existing rule specification has been edited, updating the transform associated with the component in the graph-based computation according to the new or edited rule specification. | 10-16-2008 |
| 20080256015 | Matching educational game players in a computerized learning environment - A system for matching users of learning application programs is provided. As one example, a learning service program can assess the performance of a user based on their interaction with at least one learning application program. Where the user requests an interactive session with other users for a particular learning application program, a learning service program can perform matching of the plurality of users according to the users' assessed abilities in the learning activities involved to achieve multi-user interaction that promotes learning by each of the users. | 10-16-2008 |
| 20080275836 | DYNAMIC USER PROMPTING FOR PERTINENT CLINICAL INFORMATION - A method for dynamically prompting a caregiver for pertinent information about a patient uses a computer or processor operating as a rule-based system. The method includes receiving a first data input triggering a rule in a first rule queue requiring both a first data input and at least a second data input. The method further includes determining that the second data input is not available or is outdated, placing the rule in a second rule queue for later execution, and, when the second data input is available within a selected period of time, executing the rule, or otherwise, after the selected period of time, sending an electronic message to a caregiver to take action to provide the second data input. | 11-06-2008 |
| 20080275837 | METHOD AND SYSTEM FOR APPROXIMATE STRING MATCHING - A method and system for approximate string matching are provided for generating approximate matches whilst supporting compounding and correction rules. The method for approximate string matching of an input pattern to a trie data structure, includes traversing a trie data structure to find approximate partial and full character string matches of the input pattern. Traversing a node of the trie data structure to process a character of the string applies any applicable correction rules to the character, wherein each correction rule has an associated cost, adjusted after each character processed. The method includes accumulating costs as a string of characters is gathered, and restricting the traverse through the trie data structure according to the accumulated cost of a gathered string and potential costs of applicable correction rules. | 11-06-2008 |
| 20080288436 | DATA PATTERN MATCHING TO REDUCE NUMBER OF WRITE OPERATIONS TO IMPROVE FLASH LIFE - A processing engine examines data to determine whether the received data is a sector filled with zero value data that may be mapped to a physical storage location already filled with zero value data. If the management software does not find the received data to be just zeros, the data is compared with stored patterns that are mapped to compressed encodings that correspond to the received data. The management software learns new data patterns and creates compressed encodings for future use. In a read mode the management software reverses the process to provide data stored in the memory device. | 11-20-2008 |
| 20080301081 | Method and apparatus for generating configuration rules for computing entities within a computing environment using association rule mining - A method and apparatus for generating computer configuration rules comprising receiving configuration data regarding a plurality of computers, analyzing the configuration data to determine associations within the configuration data, and generating configuration rules from a result of the analysis. | 12-04-2008 |
| 20080313123 | Using a Browser Plug-In to Implement a Behavioral Web Graph - A method for creating a behavioral network graph has steps for (a) creating a program for tracking and reporting network navigation activity; (b) installing the program on a plurality of network-capable appliances operated by a plurality of persons; (c) tracking the network navigation activity of the persons operating the appliances; (d) recording a collecting data concerning the network navigation activity; and (e) using the collected data to formulate a behavioral network graph. | 12-18-2008 |
| 20080319937 | Properties of Data Elements - Methods and computer program products relating to properties of data elements. A computer-implemented method for identifying a property of a data element includes receiving a request for at least one sought property of a data element. The data element is configured for use in semantically identifying information portions in electronic communications. The sought property is to be valid in a context defined by at least one context value indicated by the request. The method includes identifying the at least one sought property by evaluating at least one logical rule that defines at least one property of the data element as being valid for a specified context. The method includes generating an output in response to the request that indicates the at least one sought property. | 12-25-2008 |
| 20090006302 | Methods and Apparatus for Capturing and Detecting Inconsistencies in Relational Data Using Conditional Functional Dependencies - Methods and apparatus are provided for detecting data inconsistencies. Methods are disclosed for determining whether a set of conditional functional dependencies are consistent; determining a minimal cover of a set of conditional functional dependencies and detecting a violation of one or more conditional functional dependencies in a set of conditional functional dependencies. The conditional functional dependencies comprise one or more constraints that data in a database must satisfy including at least one pattern with data values. | 01-01-2009 |
| 20090024554 | Method For Matching Electronic Advertisements To Surrounding Context Based On Their Advertisement Content - A system for selecting electronic advertisements from an advertisement pool to match the surrounding content is disclosed. To select advertisements, the system takes an approach to content match that focuses on capturing subtler linguistic associations between the surrounding content and the content of the advertisement. The system of the present invention implements this goal by means of simple and efficient semantic association measures dealing with lexical collocations such as conventional multi-word expressions like “big brother” or “strong tea”. The semantic association measures are used as features for training a machine learning model. In one embodiment, a ranking SVM (Support Vector Machines) trained to identify advertisements relevant to a particular context. The trained machine learning model can then be used to rank advertisements for a particular context by supplying the machine learning model with the semantic association measures for the advertisements and the surrounding context. | 01-22-2009 |
| 20090055343 | Pattern detection - Apparatus for detecting a pattern in a data stream comprises a pattern matching device for receiving the data stream. The pattern matching device comprises one or more rule engines, each rule engine operating under a plurality of state transition rules encoding a plurality of patterns, a first state transition rule including a wildcard state component and a wildcard input component, a second state transition rule including a wildcard state component and a specified input component, and a third state transition rule including a specified state component and a specified input component, the first, second and third rules having differing priorities, and at least one state transition rule including an output component indicating a pattern match. The apparatus is arranged to pass the data stream to each rule engine, and is further arranged to output a signal indicating a pattern match when a state transition rule indicates a pattern match. | 02-26-2009 |
| 20090063385 | Sequential mode in a Rete engine - Some embodiments of a sequential mode in a Rete rule engine have been presented. In one embodiment, a Rete rule engine is configured to enter into a sequential mode. Using the Rete rule engine configured, a rule set having a set of rules is evaluated against a set of data objects in a stateless manner. | 03-05-2009 |
| 20090083210 | EXCHANGE OF SYNCRONIZATION DATA AND METADATA - Systems and methods that disclose alternative patterns for exchange of synchronization data and/or metadata, e.g., ‘knowledge’, to enhance performance of synchronization processes are disclosed. Accordingly, the innovation discloses synchronization mechanisms that employ exchange of data and metadata to alleviate a requirement of a complete ‘round-trip’ when synchronizing data. ‘Knowledge’ can be provided which informs a provider of data changes, modifications, additions or deletions. The ‘knowledge’ can lower expense and/or increase efficiencies of the synchronization exchanges by enabling informed decision-making related to enumerating changes within the synchronization processes. | 03-26-2009 |
| 20090106183 | EXTENDED FINITE STATE AUTOMATA AND SYSTEMS AND METHODS FOR RECOGNIZING PATTERNS USING EXTENDED FINITE STATE AUTOMATA - Deterministic finite automata (DFAs) are popular solutions to deep packet inspection because they are fast and DFAs corresponding to multiple signatures are combinable into a single DFA. Combining such DFAs causes an explosive increase in memory usage. Extended finite automata (XFAs) are an alternative to DFAs that avoids state-space explosion problems. XFAs extend DFAs with a few bytes of “scratch memory” used to store bits and other data structures that record progress. Simple programs associated with automaton states and/or transitions manipulate this scratch memory. XFAs are deterministic in their operation, are equivalent to DFAs in expressiveness, and require no custom hardware support. Fully functional prototype XFA implementations show that, for most signature sets, XFAs are at least 10,000 times smaller than the DFA matching all signatures. XFAs are 10 times smaller and 5 times faster or 5 times smaller and 20 times faster than systems using multiple DFAs. | 04-23-2009 |
| 20090112788 | SYSTEM AND METHOD FOR KNOWLEDGE STORAGE IN AN AUTONOMIC NETWORK - An indication of an occurrence of an event is received. A first ontology ( | 04-30-2009 |
| 20090119242 | System, Apparatus, and Method for Internet Content Detection - A method of detecting content communicated via a network is provided consisting of the steps of: classifying the content into a first category and a second category by means of a classification process; detecting one or more behaviour parameters of a user accessing the content, where the behaviour patterns are associated with the content either consisting of first category content or second category content; and further classifying the content into first category content and second category content based on the behaviour parameters detected for the user. The first category content generally consists of restricted or illegal content, and the second category content generally consists of unrestricted or legal content. The classification process consists of a pattern recognition technique that includes a training phase and a testing phase. The training phase provides statistical properties of a plurality of data objects which are labelled prior to testing as either restricted or unrestricted. The testing phase determines whether one or more data objects of content communicated via the network constitute restricted content or unrestricted content. A related system, network apparatus and computer program is provided. | 05-07-2009 |
| 20090132457 | DATA COMPARISON USING DIFFERENT TIME PERIODS IN DATA SEQUENCES - Data for a first time period in a primary data sequence is compared with data for a second time period in each of a set of secondary data sequences. The durations of the first and second time periods are correlated, and the first time period is different from the second time period. To this extent, the data in the primary data sequence during the first time period provides a template for assigning a ranking to each secondary data sequence based on the corresponding data for the second time period. | 05-21-2009 |
| 20090138425 | BUSINESS OPTIMIZATION ENGINE - A system and method for optimizing enterprise applications driven by business processes is provided. The system includes a data repository, an extractor to perform real time extraction of process life cycle information from business solutions integrating heterogeneous independent business applications, the extractor storing the extracted information in the data repository, an analyzer to identify usage patterns in the extracted information, and an optimizer to optimize the extracted information and to create exportable output usable by external tools. The analyzer can employ user-defined algorithms and/or rules to identify the usage patterns. The optimizer can use process simulation mechanism, what-if analysis, data stored in the data repository, data stored in a rule repository, and user input data, in any combination, to optimize the extracted information. | 05-28-2009 |
| 20090150321 | Method, Apparatus and Computer Program Product for Developing and Utilizing User Pattern Profiles - A method, apparatus and computer program product are provided for generating and utilizing a user pattern profile. In this regard, the user pattern profile can include information regarding service selections made on a user node and movements of a user. The generated user pattern profile can compared to a threshold profile, and based on the results of the comparison, an action can be undertaken. | 06-11-2009 |
| 20090157588 | APPARATUS AND METHOD FOR EVALUATING THE PREDICTABILITY OF A PASS PHRASE - A computer readable storage medium includes executable instructions to identify sub-string repetition in a pass phrase. A sub-string index is generated. The number of bits required to represent each character in the pass phrase is determined. An entropy value is assigned to each character in the pass phrase. A total entropy value for the pass phrase is computed to provide an indication of pass phrase quality. | 06-18-2009 |
| 20090192970 | CONTENT AND CONTEXT BASED HANDLING OF INSTANT MESSAGES - 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. | 07-30-2009 |
| 20090192971 | Analysis supporting apparatus, analysis supporting method, and analysis supporting program - 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. | 07-30-2009 |
| 20090198639 | BUSINESS PROCESS ANALYZER - 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. | 08-06-2009 |
| 20090216702 | Mechanism to abstract fact types from a rule engine - 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. | 08-27-2009 |
| 20090222396 | ADAPTIVE MULTI-LEVELS DICTIONARIES AND SINGULAR VALUE DECOMPOSITION TECHNIQUES FOR AUTONOMIC PROBLEM DETERMINATION - 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. Feedback, responsive to the output of the problem determination, is provided to trigger the recalculation of the index of each associated term in the dictionaries, resulting in gradual evolution of the dictionaries to accumulate expert knowledge. | 09-03-2009 |
| 20090222397 | Beta node indexing in a rule engine - 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. | 09-03-2009 |
| 20090240645 | System and method for identifying conflicting network access rules and creating a resolved consequence - 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. | 09-24-2009 |
| 20090254507 | Storage Controller and Duplicated Data Detection Method Using Storage Controller - 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. | 10-08-2009 |
| 20090271356 | SITUATION-AWARE THRESHOLDING FOR RECOMMENDATION - 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. | 10-29-2009 |
| 20090292665 | Computer System and Computer-Facilitated Method for Nucleic Acid Sequence Alignment and Analysis - 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. | 11-26-2009 |
| 20090307174 | CONNECTION OF VALUE NETWORKS WITH INFORMATION TECHNOLOGY INFRASTRUCTURE AND DATA VIA APPLICATIONS AND SUPPORT PERSONNEL - 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. | 12-10-2009 |
| 20090307175 | PARALLEL PATTERN MATCHING ON MULTIPLE INPUT STREAMS IN A DATA PROCESSING SYSTEM - 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. | 12-10-2009 |
| 20090327199 | STATEFUL, CONTINUOUS EVALUATION OF RULES BY A STATE CORRELATION ENGINE - 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. | 12-31-2009 |
| 20100030719 | METHODS AND APPARATUS RELATED TO BIOINFORMATICS DATA ANALYSIS - 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. | 02-04-2010 |
| 20100036790 | SYSTEM, METHOD AND COMPUTER PROGRAM FOR FACET ANALYSIS - 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. | 02-11-2010 |
| 20100063952 | Music Information Processing Apparatus, Music Delivering System, And Music Information Processing Method That Can Satisfy A Request From A User - In a music information processing apparatus, a characteristic quantity acquiring unit reads out a music file from a music tune file storage unit and acquires a characteristic quantity of a music tune. A class value providing unit provides a class value for each music tune based on the characteristic quantity. The distribution acquiring unit forms a music tune assembly based on bibliography information read from the music tune file by a bibliography information acquiring unit, and acquires the distribution information of class values for each music tune assembly. The distribution information is stored into an analysis result storage unit, and an evaluation unit reads out distribution information based on user input, and evaluates the similarity between music tune assemblies or between a tune and a music tune assembly. An output unit recommends or reproduces a music tune assembly or a music tune according to the preference of a user. | 03-11-2010 |
| 20100070449 | DEPLOYMENT PATTERN REALIZATION WITH MODELS OF COMPUTING ENVIRONMENTS - Deployment pattern matching is implemented by accessing a target computing environment model that captures environment modeling parameters relating to resources and resource-resource relationships of a corresponding computing environment and expressing the target computing environment model as a model graph defined by target resource elements and resource-to-resource relationship links. Deployment pattern matching is further implemented by accessing a realization pattern that captures deployment parameters relating to resources and resource-resource relationships of a deployment of interest and expressing the realization pattern as a pattern graph defined by conceptual resource elements and constraints arranged by resource-to-resource relationship links and constraint links. The realization pattern is then evaluated against the target computing environment model by executing at least one pattern matching algorithm that attempts to match the pattern graph to the model graph and information corresponding to results of the evaluation are conveyed. | 03-18-2010 |
| 20100070450 | METHOD OF BUILDING A DATA INTEGRATION ENVIRONMENT - A method of building a data integration environment is provided. According to one embodiment of the invention as applied to a computer network, the method comprising: identifying the data integration environment and the policies that apply to it, negotiating with the environment, and generating a new interface rule set enabling information to be passed in dependence thereon between the system which is made part of the integration environment and the integration environment. The method can be usefully applied in UAV networks, robot networks as well as in networks of fixed sensors. The invention finds utility in various important applications such as in network-enabled capability and in rapid integration of systems. | 03-18-2010 |
| 20100076919 | METHOD AND APPARATUS FOR PATTERN MATCHING - A method of pattern matching is provided, including: determining whether there is flow status information corresponding to a current pattern for a transmission flow to which a current segment belongs; if yes, performing pattern matching for the current segment by taking the flow status information as assistant information of the pattern matching; otherwise, creating the flow status information corresponding to the current pattern for the transmission flow and performing pattern matching for the current segment by taking the flow status information as assistant information of the pattern matching. An apparatus of pattern matching is also provided, including a flow status information configuration module and a pattern matching processing module. The solution of the present invention can avoid the defects caused by flow-reassembly. | 03-25-2010 |
| 20100088266 | RULES BASE SYSTEMS AND METHODS WITH CIRCUMSTANCE TRANSLATION - 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. | 04-08-2010 |
| 20100114811 | DIRECT CONSTRUCTION OF FINITE STATE MACHINES - A method and system for direct construction of a minimal deterministic finite state machine corresponding to a regular expression are provided. The method includes providing a regular expression represented as a regular expression tree with nodes of operators and leaves of elementary character transitions and traversing the regular expression tree recursively to build minimal finite state automata (FSAs) corresponding to the branches of the tree, wherein the FSAs end in a specified tail automaton. The operators are concatenation, alternation, and Kleene closure. A concatenation operation is performed by recursive construction in reverse order wherein each automaton built becomes the tail for the preceding argument of the operation. An alternation operation is performed by recursively building automata corresponding to the arguments of the operation with the same tail and merging them. A Kleene closure operation is performed by: building an automaton terminating in a unique marker; merging the automaton with the tail automaton to form a combined automaton; and traversing the combined automaton to expand the marker into transitions and states to achieve the intended behaviour. | 05-06-2010 |
| 20100138375 | Graph-Based Data Search - Computer based systems and methods for searching data transiting a network using a graph-based search model. A set of rules that describe strings or patterns of data to be identified in the data set, is expressed as a graph. As blocks of the data set are obtained for processing, the state of the graph is updated based upon the value of the received data block. The transition to the next state depends upon both the current state and the received data block. As blocks of data are received and processed, the graph is traversed until one of the rules is identified. | 06-03-2010 |
| 20100205135 | DETERMINING BEST MATCH AMONG A PLURALITY OF PATTERN RULES USING WILDCARDS WITH A TEXT STRING - A method for creating and operating a database for determining the best match of a plurality of rules comprising wildcards and character strings with an input text string. | 08-12-2010 |
| 20100293128 | SYSLOG MESSAGE ROUTING SYSTEMS AND METHODS - A syslog message routing system can include multiple syslog sources, a syslog message routing module, and multiple syslog parsers. The syslog message routing module can receive a syslog message from one of the syslog sources, identify a particular syslog parser to handle the syslog message, and send the syslog message to the selected syslog parser. The syslog message routing module can identify the syslog parser by applying at least one of an application ID-based policy, a unique pattern matching rule policy, and a universal syslog parser policy. | 11-18-2010 |
| 20100306156 | MINIMUM CARDINALITY CANDIDATE GENERATION - This NGDE algorithm incorporates a minimum cardinality candidate diagnosis generator which exploits conflict set reduction rules to dramatically reduce the search space and thus reduce the computational resources required to find minimum cardinality diagnoses. | 12-02-2010 |
| 20100318488 | METHOD AND APPARATUS OF DYNAMIC RULES INSERTION BY AGENTS - An approach is provided for dynamic modification of inference rules and deduction engines in an information base. Authorized agents are allowed to insert, delete or modify inference rules and deduction engines dynamically by signing their input using an authorized signature. Additionally, the functionalities of dynamic modification of inference rules and deduction engines can be provided through a direct application programming interface (API). | 12-16-2010 |
| 20100325080 | PATTERN MATCHING METHOD AND PROGRAM - Columns are rearranged for every column unit so that the values of transition destinations of neighboring columns become closest to each other in accordance with a state transition table that has a current state arranged in a column direction and an input symbol arranged in a row direction and that shows the next state of transition destinations based on the current state and the input symbol, state names are changed to arrange the current state of each column in ascending order in the column rearranged state transition table, and a bit map indicative of changing points of values of column transition destinations and a transition destination table into which continuous same transition destinations are integrated are created for every row in the column rearranged state transition table. | 12-23-2010 |
| 20110022562 | SYSTEM AND METHOD FOR SEMANTIC INFORMATION EXTRACTION FRAMEWORK FOR INTEGRATED SYSTEMS MANAGEMENT - The invention provides an enterprise administration system and method. The system includes a user interface module configured to enter administration terms or select a predetermined script of administration terms, a knowledge base configured to store system information, a meta information module configured to use the system information to store entity-objective indexes, and a workflow mapping module configured to map the administration terms to system information extraction tasks to extract relevant entities and objectives and apply a rule to the extracted entities and objectives for presenting the extracted entities and objectives in a ranked order. | 01-27-2011 |
| 20110035349 | Knowledge Management Environment - According to one embodiment, a computer-readable medium has computer-executable instructions that, when executed by a computer, are configured to define a plurality of management services according to a model. The model structures operations among the plurality of management services according to a knowledge configuration. A knowledge service is defined according to the model. The model assigns the knowledge service to a knowledge store according to the knowledge configuration. The knowledge store contains a plurality of data records. Instances of the plurality of management services are created. The instances of the plurality of management services control access to the knowledge store. An instance of the knowledge service is created. The instance of the knowledge service performs operations on the data records. | 02-10-2011 |
| 20110040714 | KNOWLEDGEBASE PARTITIONING - Some embodiments of knowledgebase partitioning for implementing parallelization in a rule engine have been presented. In one embodiment, a compiler divides a knowledgebase into a set of virtual partitions. The knowledgebase includes a network constructed according to rules added to the knowledgebase. A rule engine may execute the virtual partitions of the partitioned knowledgebase in parallel using threads obtained from a pool of threads. | 02-17-2011 |
| 20110040715 | SYSTEMS AND METHODS FOR CALCULATING A DISTRIBUTION - Systems and methods are provided for calculating a distribution of a quantity over a number of receiver objects. In one implementation, a data processing system is provided that comprises a number of application programs, each of the application programs being adapted to generate a distribution request, storage means for storing a number of rules, each rule being adapted for distribution of at least a portion of the quantity over the receiver objects and for storing an assignment of a sub-set of the rules to each application program, each rule within one of the sub-sets of rules having an assigned priority of execution and each sub-set of rules having an assigned identifier. The data processing system may also comprise distribution calculation means for receiving the distribution request from one of the application programs, the distribution request comprising the identifier of the sub-set of rules assigned to the one of the application programs, the quantity to be distributed, and the identifiers of receiver objects over which the quantity is to be distributed, the distribution calculation means being adapted to access the storage means for execution of the sub-set of rules assigned to the one of the application programs in the order of the priorities assigned to the rules within the sub-set of rules. | 02-17-2011 |
| 20110066583 | CONTROLLING FORWARD CHAINING EXECUTION IN A RULES SYSTEM - Detailed herein is a technology which, among other things, provides for forward chaining in a ruleset. In one approach to this technology, a first rule is examined, to identifying a data object associated with it. A second rule is identified, also associated with the data object. The relationship between the two rules is determined, where execution of the second rule will modify the data object, which, in turn, will alter the outcome of the first rule. | 03-17-2011 |
| 20110071976 | RETAIL AUTOMOTIVE AFTERMARKET PARTS ASSORTMENT PLANNING - Identifying parts for an assortment. Receiving data characterizing: storage capacity by part category, parts in the category, rules applicable to the category. Assembling rule sets requiring compliance with each rule for a part to be a rule set group member. Receiving data prioritizing rule sets. Beginning with highest priority rule set, proceeding by order of rule set priority, determining if each part is rule set group member. For parts not a member of the rule set group, determining if each of those parts is a member of the next highest priority rule set group. Receiving data for prioritizing parts in a rule set group. Allocating parts to the assortment beginning with the highest prioritized part in the highest prioritized rule set group, and continuing in order of part priority within a rule set group, then continuing through subsequently prioritized rule set groups until inventory storage capacity is reached. | 03-24-2011 |
| 20110078106 | METHOD AND SYSTEM FOR IT RESOURCES PERFORMANCE ANALYSIS - There is disclosed a method of monitoring an infrastructure comprising managed units, the method comprising the steps of: acquiring data associated with a first performance indicator from a first managed unit; determining a first quantized distribution function of at least a subset of pieces of data of the acquired data of the first managed unit; determining if the first quantized distribution function verifies one or a plurality of predefined rules describing particular distribution functions of performance indicators. | 03-31-2011 |
| 20110167030 | STATE MACHINE COMPRESSION FOR SCALABLE PATTERN MATCHING - A method for processing data includes encoding a finite automaton, which includes states and transitions between the states that express a plurality of predefined patterns, by grouping the states of the automaton into sets according to a common property shared by the states in each set, and assigning codes to the states according to the grouping. The codes are stored in an electronic memory, along with rules that are associated with the patterns. The automaton is traversed in order to identify one or more of the patterns in an input sequence of data elements by iteratively reading out the codes from the memory responsively to the data elements and to the codes that have been previously read out. Upon identifying a given pattern in the input sequence, an associated action is performed. | 07-07-2011 |
| 20110173149 | MATCHING METADATA SOURCES USING RULES FOR CHARACTERIZING MATCHES - Processing metadata includes storing, in a data storage system, a specification for each of multiple sources, each specification including information identifying one or more data elements of the corresponding source; and processing, in a data processing system coupled to the data storage system, data elements from the sources, including generating a set of rules for each source based on a corresponding one of the stored specifications, and matching data elements of different sources and determining a quality metric characterizing a given match between a first data element of a first source and a second data element of a second source according to the set of rules generated for the first source and the set of rules generated for the second source. | 07-14-2011 |
| 20110178973 | Web Content Rewriting, Including Responses - A content rewriting system is described herein that allows web site administrators to setup rewriting of web responses in an easy and efficient manner. The system provides a configuration schema and an efficient workflow that enables web administrators to easily setup rules to modify HTML or other content without having a high performance penalty or losing flexibility. The content rewriting system applies regular expressions or wildcard patterns to a response to locate and replace the content parts based on the rewriting logic expressed by outbound rewrite rules. The system parses an initial response generated by a web application, applies one or more outbound rules to rewrite the response, and provides the rewritten response to a client that submitted a request for the response. | 07-21-2011 |
| 20110208682 | PERFORMANCE EVALUATING APPARATUS, PERFORMANCE EVALUATING METHOD, AND PROGRAM - A performance evaluating apparatus for a rule is provided, which is capable of evaluating a business value of a rule applied to the operation and management of an information system through autonomous control. The performance evaluating apparatus for a rule collects, respectively before activation processing that is prescribed by a rule and after completion of the execution of the processing, a rule execution history and a system state information indicating a state of a monitored information system that is necessary for calculation of the business value. The business value is calculated from the collected system state information and rule execution history by a given calculation formula. | 08-25-2011 |
| 20110264616 | SYSTEMS AND METHODS FOR AUTOMATICALLY RESOLVING INTERACTION BETWEEN PROGRAMMABLE PARAMETERS - This document discusses, among other things, a system capable of resolving interactions between programmable parameters for operation of a medical device. Programming these devices is a difficult task when many parameters are involved. The disclosed systems and methods attempt to reduce and minimize constraint violations between interdependent parameters using an initial set of parameter values supplied by user (typically a physician) input or calculated automatically, and constraint violations describing invalid parameter values. If possible, a set of parameter values with less egregious constraint violations is generated and may be displayed to the user. A user is prompted to accept the set of parameter values and program the medical device. | 10-27-2011 |
| 20110270792 | METHOD AND APPARATUS FOR HYPOTHESIS TESTING - A decision stream in a hypothesis testing problem may be obtained by comparing a received data stream to a threshold. The threshold may be generated from a noise subset of the data stream based on certain characteristics of observed data. The probability distribution of the noise subset along with characteristics of the data stream may be used in determining the threshold. The determination of the threshold may be adaptive to maintain a user prescribed probability of error. A decision state machine may be used to control the manner in which noise characteristics are used to guide the hypothesis testing, increase the detection rate, and reduce the probability of error. The decision state machine evaluates the decision stream to determine falsely classified data samples and reclassify such items appropriately. The decision state machine may filter the decision stream to ensure that a lower decision error rate is achieved. | 11-03-2011 |
| 20110307436 | PATTERN TREE-BASED RULE LEARNING - A pattern tree is constructed based on a plurality of key-value pairs representing portions of a data set. In some implementations, the pattern tree may be used for learning one or more rules for interacting with a source of the data set. | 12-15-2011 |
| 20110313963 | RECRUITING SYSTEM - A recruiting system for use in determining suitability of at least one recruitment candidate for at least one job position, or suitability of at least one job position for at least one recruitment candidate, the system including at least one server configured to:
| 12-22-2011 |
| 20110320397 | IMPULSE REGULAR EXPRESSION MATCHING - Disclosed is a method and apparatus for matching regular expressions. A buffer of symbols giving a number of the last occurrence positions of each symbol is maintained. When two constants match on either side of a regular expression operator, the buffer of symbols is queried to determine if a member of the complement of the regular expression operator occurred between the two constants. If so, then the operator was not satisfied. If not, then the operator was satisfied. | 12-29-2011 |
| 20120030161 | RELATIONSHIP DETECTOR, RELATIONSHIP DETECTION METHOD, AND RECORDING MEDIUM - For a group of elements defined with a first relationship between elements stored in a first data memory unit and a second relationship therebetween different from the first relationship stored in a second data memory unit, a relationship detector includes a first distance calculating unit that calculates a predetermined first distance between the two elements belonging to the group in the first relationship, a second distance calculating unit that calculates a predetermined second distance between the two elements belonging to the group in the second relationship, and an unpredictability calculating unit that calculates a dissociation level between the first distance and the second distance between the two elements belonging to the group through a predetermined rule. | 02-02-2012 |
| 20120036100 | EXTRACTION OF ATTRIBUTES AND VALUES FROM NATURAL LANGUAGE DOCUMENTS - One or more classification algorithms are applied to at least one natural language document in order to extract both attributes and values of a given product. Supervised classification algorithms, semi-supervised classification algorithms, unsupervised classification algorithms or combinations of such classification algorithms may be employed for this purpose. The at least one natural language document may be obtained via a public communication network. Two or more attributes (or two or more values) thus identified may be merged to form one or more attribute phrases or value phrases. Once attributes and values have been extracted in this manner, association or linking operations may be performed to establish attribute-value pairs that are descriptive of the product. In a presently preferred embodiment, an (unsupervised) algorithm is used to generate seed attributes and values which can then support a supervised or semi-supervised classification algorithm. | 02-09-2012 |
| 20120089551 | SYSTEM AND METHOD FOR COMPOSITE DISTANCE METRIC LEVERAGING MULTIPLE EXPERT JUDGMENTS - A system and method for a composite distance metric leveraging multiple expert judgments includes inputting a data distribution of multiple expert judgments stored on a computer readable storage medium. Base distance metrics are converted into neighborhoods for comparison, wherein each base distance metric represents an expert. The neighborhoods are combined to leverage the local discriminalities of all base distance metrics by applying at least one iterative process to output a composite distance metric. | 04-12-2012 |
| 20120109871 | REPRODUCING APPARATUS AND METHOD, AND COMPUTER PROGRAM - A reproducing apparatus ( | 05-03-2012 |
| 20120143811 | MULTI-DIMENSIONAL TUPLE SUPPORT IN RULE ENGINES - Some embodiments of a method to support multi-dimensional tuples in rule engines have been presented. A rule engine running on a processing device can evaluate facts in a working memory stored on a data storage device against a rule with repetitions. The rule engine may create a multi-dimensional tuple to hold a set of the facts that matches the rule. The multi-dimensional tuple has a set of elements and an index for each of the elements. Each element of the multi-dimensional tuple is a single fact or a tree structure for holding a set of facts of a repetition group that matches the rule with repetitions. | 06-07-2012 |
| 20120143812 | MULTI-RESULT SET CALCULATION SUPPORT IN RULE ENGINES - Some embodiments of a method to support multi-result set calculation in a rule engine have been presented. A rule engine can compile a set of rules to build a network for evaluating facts against the rules. The rules include at least one rule requiring multiple calculations to be executed for the same set of facts. The rule engine can create a single multi-result set calculation node for this rule in the network. The multi-result set calculation node can generate a set of results and add the set of results to a tuple to be propagated to a second node connected to an output of the multi-result set calculation node. | 06-07-2012 |
| 20120150788 | AUTOMATED FACILITIES MANAGEMENT SYSTEM - An automated facilities management system has the ability to predict occupant behavior by identifying recurring patterns in the way that people use buildings and comparing them with environmental characteristics. This technology is not limited to human behavior patterns, but extends to any mechanical systems or data points that tend to vary in recurring patterns. The data processing is carried out by rules engines triggered by relational database modifications. | 06-14-2012 |
| 20120158635 | STORAGE EFFICIENT PROGRAMMABLE STATE MACHINE - A state machine includes a rule selector. The rule selector receives input data, and one or more transition rules. The one or more transition rules including a next state. The state machine also includes a character classifier communicatively coupled to the rule selector. The character classifier includes a plurality of base classes. The character classifier receiving the input data, and sending one or more of the plurality of base classes to the rule selector in response to receiving the input data. The rule selector selects one of the one or more transition rules in response to determining that the input data and one of the plurality of base classes correspond to the transition rule. The current state of the state machine is then set to the next state of the selected one of the one or more transition rules. | 06-21-2012 |
| 20120191638 | EFFICIENT SERVICE RULES CREATION THROUGH SUBJECTIVE LOGIC AND TEMPORAL PATTERN RECOGNITION - A method for generating service rules corresponding to business data is disclosed. A plurality of business related data is gathered from various sources. The data is combined using a subjective logic technique. The data is then evaluated for temporal patterns. Finally a set of service rules corresponding to the combined business data are developed. | 07-26-2012 |
| 20120203729 | MULTIPLE HASH SCHEME FOR USE IN A PATTERN MATCHING ACCELERATOR - A pattern matching accelerator (PMA) for assisting software threads to find the presence and location of strings in an input data stream that match a given pattern. The patterns are defined using regular expressions that are compiled into a data structure comprised of rules subsequently processed by the PMA. The patterns to be searched in the input stream are defined by the user as a set of regular expressions. The patterns to be searched are grouped in pattern context sets. The sets of regular expressions which define the pattern context sets are compiled to generate a rules structure used by the PMA hardware. The rules are compiled before search run time and stored in main memory, in rule cache memory within the PMA or a combination thereof. For each input character, the PMA executes the search and returns the search results. | 08-09-2012 |
| 20120203730 | PATTERN MATCHING ENGINE FOR USE IN A PATTERN MATCHING ACCELERATOR - A pattern matching accelerator (PMA) for assisting software threads to find the presence and location of strings in an input data stream that match a given pattern. The patterns are defined using regular expressions that are compiled into a data structure comprised of rules subsequently processed by the PMA. The patterns to be searched in the input stream are defined by the user as a set of regular expressions. The patterns to be searched are grouped in pattern context sets. The sets of regular expressions which define the pattern context sets are compiled to generate a rules structure used by the PMA hardware. The rules are compiled before search run time and stored in main memory, in rule cache memory within the PMA or a combination thereof. For each input character, the PMA executes the search and returns the search results. | 08-09-2012 |
| 20120271787 | RULE REASONER, AND DYNAMIC MATERIALIZATION METHOD FOR WILD PATTERN RULES INCLUDING THE SAME - Rule reasoner includes: a Rete network builder for receiving ontology, including ontology instance represented by triple and ontology schema defining classes and properties of the triple, and reasoning rule, building Rete network corresponding to the ontology and the reasoning rule, selecting clue pattern corresponding to wild pattern rule with reference to the ontology schema when reasoning rule having wild pattern is received, rewriting the wild pattern rule with reference to the clue pattern, and adding test node, alpha memory node, and wild rule node so that the rewritten wild pattern rule is incorporated; a Rete network implementer for generating reasoned triple by implementing the Rete network built by the Rete network builder or generating reasoning rule where the wild pattern rule is dynamically materialized; and a Rete network expander expanding the Rete network by inputting the new reasoning rule, generated by the Rete network implementer, to the Rete network builder. | 10-25-2012 |
| 20120278270 | SELECTING SOLUTION FOR CARBON EMISSION PREDICTION - A computer-implemented method, apparatus, and system for selecting a solution for carbon emission prediction. The method includes the steps of: obtaining historical records of carbon emission and a current demand for carbon emission, locating from the historical records of carbon emission a best matching historical record with respect to the current demand and selecting, based on the located best matching historical record, one of (i) a data prediction solution record and (ii) a rule prediction solution, where at least one step is carried out using a computer device. | 11-01-2012 |
| 20120284222 | COMPILING PATTERN CONTEXTS TO SCAN LANES UNDER INSTRUCTION EXECUTION CONSTRAINTS - A technique for determining scan lanes is provided. For a set of patterns, a number of scan lanes is estimated to be utilized on an accelerator. The number of the scan lanes estimated for the set of patterns is iteratively incremented to optimize a throughput of the accelerator. The set of patterns is distributed to the number of the scan lanes as a distribution, and each one of the scan lanes has a predetermined number of engines. A size of a memory space is evaluated that is needed for the distribution to distribute the set of patterns onto the number of scan lanes. | 11-08-2012 |
| 20120323837 | SELECTING SOLUTION FOR CARBON EMISSION PREDICTION - A computer-implemented method, apparatus, and system for selecting a solution for carbon emission prediction. The method includes the steps of: obtaining historical records of carbon emission and a current demand for carbon emission, locating from the historical records of carbon emission a best matching historical record with respect to the current demand and selecting, based on the located best matching historical record, one of (i) a data prediction solution record and (ii) a rule prediction solution, where at least one step is carried out using a computer device. | 12-20-2012 |
| 20130013549 | HARDWARE-ASSISTED APPROACH FOR LOCAL TRIANGLE COUNTING IN GRAPHS - A method and apparatus are provided for hardware-assisted local triangle counting in a graph. The method includes converting vertex relationships of the graph into rule patterns. The method also includes compiling the rule patterns into a binary file, wherein the rule patterns are organized into a finite state machine. The method further includes loading at least a part of the binary file and a search string to be compared there against into a hardware pattern matching accelerator. The method additionally includes receiving a number of matching outputs from the pattern matching accelerator. | 01-10-2013 |
| 20130080369 | Methods and Systems for Applications for Z-numbers - Generally, decisions are based on information. To be useful, information must be reliable. Basically, the concept of a Z-number relates to the issue of reliability of information. A Z-number, Z, has two components, Z=(A,B). The first component, A, is a restriction (constraint) on the values which a real-valued uncertain variable, X, is allowed to take. The second component, B, is a measure of reliability (certainty) of the first component. Typically, A and B are described in a natural language, for example: (about 45 minutes, very sure). Z-number has many applications, especially in the realms of economics, decision analysis, risk assessment, prediction, anticipation, rule-based characterization of imprecise functions and relations, and biomedicine. Different methods, applications, and systems are discussed. Other Fuzzy concepts are also discussed. | 03-28-2013 |
| 20130080370 | Methods and Systems for Applications for Z-numbers - Generally, decisions are based on information. To be useful, information must be reliable. Basically, the concept of a Z-number relates to the issue of reliability of information. A Z-number, Z, has two components, Z=(A,B). The first component, A, is a restriction (constraint) on the values which a real-valued uncertain variable, X, is allowed to take. The second component, B, is a measure of reliability (certainty) of the first component. Typically, A and B are described in a natural language, for example: (about 45 minutes, very sure). Z-number has many applications, especially in the realms of economics, decision analysis, risk assessment, prediction, anticipation, rule-based characterization of imprecise functions and relations, and biomedicine. Different methods, applications, and systems are discussed. Other Fuzzy concepts are also discussed. | 03-28-2013 |
| 20130085979 | TESTING FOR RULE-BASED SYSTEMS - A non-transitory computer-readable medium tangibly embodied in a storage device encoded with instructions that, when executed on a processor, perform a method in a computer system for testing a rule-driven system, the method comprising detecting a potential read-write error or a potential write-write error in the rule-driven system, generating test results based on the detecting, and reporting the test results. | 04-04-2013 |
| 20130132325 | Scalable, Rule-Based Processing - A system, method and computer program product for scalable, rule-based processing, including an automaton builder for constructing automatons corresponding to trigger rules and word lists that are employed by the trigger rules, and a rule evaluator for evaluating any of the trigger rules with respect to an input document by selecting any of the automatons to evaluate a given one of the trigger rules, parsing the input document using the selected automatons, determining whether conditions of the given trigger rule are met, and identifying any actions that are associated with the given trigger rule. | 05-23-2013 |
| 20130132326 | RULES ENGINE ECOSYSTEM - An object cache framework client selects a rule-set object in an object cache framework. The rule-set object comprises a rule-set (set of business rules). The object cache framework client evaluates criteria of the rule-set against properties of a plurality of rules engines. The object cache framework client determines if the properties of a rules engine, from a plurality of rules engines, satisfy the criteria of the rule-set. The object cache framework client supplies the rule-set object to the rules engine for execution of the rule-set. | 05-23-2013 |
| 20130138597 | TREE STRUCTURED DATA TRANSFORM - A transformation process determines whether a predicate of a rule matches a given node of tree structured data containing a set of nodes and, when the predicate of a rule matches the given node, applies a function of an identified rule to the node to generate a compound result and an interim mutated output document, and when the compound result contains a next node, determines whether the next node is compared with the predicate of a next rule. The transform process includes determining that the next node is processed by a next rule, using the interim mutated output document as input, and determining whether a predicate of a rule matches the next node in a set of nodes. When the predicate of a rule matches the next node, a function of an identified rule is applied to the next node to generate a compound result and interim mutated output document. When the compound result does not contain a next node, a final mutated output document is generated. | 05-30-2013 |
| 20130144830 | METHOD AND DEVICE FOR DISTRIBUTING PATTERNS TO SCANNING ENGINES FOR SCANNING PATTERNS IN A PACKET STREAM - A method and a device for distributing patterns to scanning engines for scanning packets in a packet stream are provided. The method includes providing a plurality of scanning engines and patterns, calculating a respective distance metric for every pair of patterns, and providing a plurality of distribution functions. Further, the method includes calculating a respective sum of the calculated distance metrics for distributing the patterns for each of the distribution functions, and utilizing the sums for selecting a distribution function of the D distribution functions for distributing the patterns to the M scanning engines. A device for implementing the method is also provided. | 06-06-2013 |
| 20130159239 | METHODS AND SYSTEMS FOR DATA ANALYSIS IN A STATE MACHINE - A device includes a match element that includes a first data input configured to receive a first result, wherein the first result is of an analysis performed on at least a portion of a data stream by an element of a state machine. The match element also includes a second data input configured to receive a second result, wherein the second result is of an analysis performed on at least a portion of the data stream by another element of the state machine. The match element further includes an output configured to selectively provide the first result or the second result. | 06-20-2013 |
| 20130179390 | DEPLOYMENT PATTERN REALIZATION WITH MODELS OF COMPUTING ENVIRONMENTS - Deployment pattern matching is implemented by accessing a target computing environment model that captures environment modeling parameters relating to resources and resource-resource relationships of a corresponding computing environment and expressing the target computing environment model as a model graph defined by target resource elements and resource-to-resource relationship links. Deployment pattern matching is further implemented by accessing a realization pattern that captures deployment parameters relating to resources and resource-resource relationships of a deployment of interest and expressing the realization pattern as a pattern graph defined by conceptual resource elements and constraints arranged by resource-to-resource relationship links and constraint links. The realization pattern is then evaluated against the target computing environment model by executing at least one pattern matching algorithm that attempts to match the pattern graph to the model graph and information corresponding to results of the evaluation are conveyed. | 07-11-2013 |
| 20130204831 | Identifying associations in data - A method to identify a relationship between at least pairs of variables in a dataset generates a novel measure of dependence, referred to as a Maximal Information Coefficient (MIC), that captures a wide range of interesting associations (not limited to specific function types such as linear, exponential or periodic, or to all functional relationships), and that gives similar scores to equally noisy relationships of different types. MIC is based on the idea that if a relationship exists between two variables, then a grid can be drawn on a scatterplot of the two variables that partitions the data to encapsulate that relationship. | 08-08-2013 |
| 20130204832 | Trend or Pattern Trigger Device - The present invention implements, in a trend or pattern trigger device or system, the generation of hypotheses automatically while considering any collection of data by automatically assessing with templates or charts the presence of patterns in the data without a priori postulation of what the pattern might be. The trend or pattern examination templates or charts contain quantifiable thresholds for data or change in data so that trends or patterns in data can be discerned inductively and automatically without preconceived notions of what or where the patterns or trends might be. | 08-08-2013 |
| 20130226855 | GRAPH GENERATION METHOD FOR GRAPH-BASED SEARCH - Computer based method for generation of a graph representation of a rule set for searching data transiting a network using a graph-based search model. A set of rules that describe strings or patterns of data to be identified in the data set, is expressed as a graph. As blocks of the data set are obtained for processing, the state of the graph is updated based upon the value of the received data block. The transition to the next state depends upon both the current state and the received data block. As blocks of data are received and processed, the graph is traversed until one of the rules is identified. | 08-29-2013 |
| 20130297551 | SYSTEM AND METHOD FOR PROVIDING INTELLIGENT LOCATION INFORMATION - A method and system that includes extracting event models from at least one personal planning source of a user, wherein a parameter of an event model includes event location; periodically receiving location information of at least one mobile device of the user; storing the location information in a location log; a pattern worker module maintaining user location patterns through the location log; generating a location prediction from the extracted event models and the user location patterns; a first content worker module checking if the location prediction meets a set of content requirements; if the set of content requirements is satisfied, initiating content retrieval from at least one service; and pushing the content to the mobile device. | 11-07-2013 |
| 20130304690 | REDUCING FALSE POSITIVES IN DATA VALIDATION USING STATISTICAL HEURISTICS - To validate data, a plurality of strings that match a predetermined regular expression is extracted from the data. A validated subset of the strings is identified. To determine whether the validated subset has been falsely validated, it is determined whether the validated subset satisfies each of one or more predetermined criteria relative to the plurality of strings. In one embodiment, the subset is determined to be falsely validated if at least one of the criteria is satisfied. In another embodiment, the subset is determined to be falsely validated if all of the criteria are satisfied. The data are released only if the subset is determined to be falsely validated. | 11-14-2013 |
| 20130339288 | DETERMINING DOCUMENT CLASSIFICATION PROBABILISTICALLY THROUGH CLASSIFICATION RULE ANALYSIS - A classification application identifies patterns and evidences within representative documents. The application constructs a classification rule according to an entity and an affinity determined from the patterns and evidences. The application processes the representative documents with the classification rule to evaluate whether the rules meet acceptance requirements. Subsequent to a successful evaluation, the application identifies confidence levels for patterns and evidences within other documents. | 12-19-2013 |
| 20140012797 | FEATURE AND DEPLOYMENT RECOMMENDATION SYSTEMS AND METHODS FOR CONTENT MANAGEMENT SYSTEMS TO PROVIDE RECOMMENDATIONS FOR ENHANCED FEATURE USAGE BASED ON USAGE PATTERNS - Feature and deployment recommendation systems and methods for content management systems comprises a vendor-site deployment and one or more customer-site deployments. The vendor-site deployment is configured to recommend an adaptation of any of the one or more customer-site deployments. The vendor-site deployment including a customer configuration repository adapted to store content usage metrics received from one or more customer-site deployments, an analytical engine configured to generate content usage patterns based on the stored content usage metrics, and a recommendation engine configured to recommend the adaptation. | 01-09-2014 |
| 20140032472 | SYSTEM, METHOD, AND SOFTWARE PROGRAM PRODUCT FOR ENABLING USERS TO CREATE AND USE RULE PATTERNS TO GENERATE CUSTOM PRODUCT-CONFIGURATION RULES - A configuration system, method, and software program is provided for enabling users to create and use rule patterns to generate custom product-configuration rules. The method includes enabling a designer to submit example rules or template rules for a rule pattern. The designer is then able to select which variables will be customizable in instances of the rule pattern. A modeler is able to select the rule pattern from a rule pattern library as a basis for creating custom configuration rules for a product. In response to the modeler selecting the rule pattern from the library, a user interface is generated in which the customizable fields for each template rule in the rule pattern are displayed and the modeler is able to enter values for the customizable fields. Configuration rules are then generated for the product from the template rules and the values entered by the modeler for the customizable fields. | 01-30-2014 |
| 20140052685 | Context Accumulation Based on Properties of Entity Features - According to one embodiment of the present invention, a system for determining related entities includes at least one processor. The system identifies one or more candidate entities for a data object associated with an entity based on one or more features. The entity and candidate entities are each associated with one or more features and each feature is associated with one or more behaviors. The identified candidate entities related to the entity are determined based on the associated behaviors of the features of the identified candidate entities and the entity. Embodiments of the present invention further include a method and computer program product for determining related entities in substantially the same manner described above. | 02-20-2014 |
| 20140081896 | Creating Stream Processing Flows from Sets of Rules - Techniques for creating a distributed application flow from a set of rules are provided. The techniques include creating a control-flow graph for each rule, creating one or more dependency links between two or more rules, partitioning a resulting graph, wherein the resulting graph comprises one or more control-flow graphs and one or more dependency links, into one or more operators by determining an optimal set of one or more cuts through the resulting graph such that a cost function is minimized, and generating stream processing flow code from the partitioned graph. | 03-20-2014 |
| 20140081897 | UTILIZING A DYNAMIC DATA SOURCE TO AFFECT BUSINESS RULE MANAGEMENT - Dynamic data discovery can identify variables or changes in a business environment which can impact existing business rules and can match identified triggers. A business rule associated with a business rule management system can be identified. The business rule management system can be a component of an enterprise organization. The rule can be an operation, a definition, and a constraint associated with the organization. The organization can be a person, a process, a product, a service, or a computing device. Relevant information can be determined from a dynamic data associated with a data source. The determination can be made through the use of semantic analysis. A business pattern associated with the rule can be semantically matched with a dynamic pattern associated with the information. The pattern can be a semantic pattern of the information. A new business rule can be automatically generated from the dynamic data analysis. | 03-20-2014 |
| 20140089249 | DATA PATTERN ANALYSIS USING OPTIMIZED DETERMINISTIC FINITE AUTOMATION - Techniques for data pattern analysis using deterministic finite automaton are described herein. In one embodiment, a number of transitions from a current node to one or more subsequent nodes representing one or more sequences of data patterns is determined, where each of the current node and subsequent nodes is associated with a deterministic finite automaton (DFA) state. A data structure is dynamically allocated for each of the subsequent nodes for storing information associated with each of the subsequent nodes, where data structures for the subsequent nodes are allocated in an array maintained by a data structure corresponding to the current node if the number of transitions is greater than a predetermined threshold. Other methods and apparatuses are also described. | 03-27-2014 |
| 20140095424 | EVALUATION TARGET OF INTEREST EXTRACTION APPARATUS AND PROGRAM - An evaluation target of interest extraction apparatus of one embodiment extracts a plurality of items for each piece of text information. When the items include an item which matches an evaluation target expression or related expression, the apparatus allocates the evaluation target expression or that of the related expression to the text information as an evaluation target item. The apparatus distinguishes a class from a change in numeric information related to the evaluation target item, and allocates the class to the text information. The apparatus generates a class-attached transaction including the evaluation target item, the items, and the class. The apparatus discovers a pattern from a set of the transactions. | 04-03-2014 |
| 20140108320 | PREFERENCE PREDICTION TOOL - In accordance with some embodiments of the present invention, information about a user's activities and habits may be collected on an ongoing basis with the user's permission. This information about previous history can then tied to inferences that enable predictions about the user's preferences. As a result, when it comes time for the user to make a decision or a selection, information about past history and permissible inferences can be used to automatically provide suggestions for implementing future activities. In addition, in some cases this previous history information can be used to optimize future selections. | 04-17-2014 |
| 20140114900 | COMPUTER-READABLE RECORDING MEDIUM, EXTRACTING DEVICE, AND EXTRACTING METHOD - According to one aspect, a computer-readable recording medium stores therein an extracting program | 04-24-2014 |
| 20140136465 | IMPULSE REGULAR EXPRESSION MATCHING - Disclosed is a method and apparatus for matching regular expressions. A buffer of symbols giving a number of the last occurrence positions of each symbol is maintained. When two constants match on either side of a regular expression operator, the buffer of symbols is queried to determine if a member of the complement of the regular expression operator occurred between the two constants. If so, then the operator was not satisfied. If not, then the operator was satisfied. | 05-15-2014 |
| 20140143200 | SYSTEM AND METHOD FOR DETERMINING FUZZY CAUSE AND EFFECT RELATIONSHIPS IN AN INTELLIGENT WORKLOAD MANAGEMENT SYSTEM - The system and method for determining fuzzy cause and effect relationships in an intelligent workload management system described herein may combine potential causes and effects captured from various different sources associated with an information technology infrastructure with substantially instantaneous feedback mechanisms and other knowledge sources. As such, fuzzy correlation logic may then be applied to the combined information to determine potential cause and effect relationships and thereby diagnose problems and otherwise manage interactions that occur in the infrastructure. For example, information describing potential causes and potential effects associated with an operational state of the infrastructure may be captured and combined, and any patterns among the information that describes the multiple potential causes and effects may then be identified. As such, fuzzy logic may the be applied to any such patterns to determine possible relationships among the potential causes and the potential effects associated with the infrastructure operational state. | 05-22-2014 |
| 20140172766 | SCANNING DATA STREAMS IN REAL-TIME AGAINST LARGE PATTERN COLLECTIONS - Embodiments of the disclosure include a method for partitioning a deterministic finite automaton (DFA) into a plurality of groups. The method includes selecting, with a processing device, a subset of the plurality of states and mapping each state of the subset onto a group of the plurality of groups by assigning one or more transition rules associated with each state to a rule line of the group, wherein each rule line is assigned at most two transition rules and an extended address associated with one of the at most two transition rules. The method also includes iteratively processing each state of the subset mapped onto the group by removing the extended address from each rule line in the group with transition rules referring to a current state if the transition rules in the rule line branch within the group. | 06-19-2014 |
| 20140195474 | METHOD AND SYSTEM FOR IMPROVED PATTERN MATCHING - Method, system and computer program for determining matching between two time series. They use an improved algorithm partially based in Dynamic Time Warping and Information Retrieval techniques, but solving the problems (as computational complexity, memory requirements . . . ) observed in these matching techniques. | 07-10-2014 |
| 20140214749 | SYSTEM AND METHOD FOR DFA-NFA SPLITTING - Cost factors are utilized and may be estimated to determine split points in a DFA-NFA hybrid. The cost factors may comprise NFA start states, DFA backup factor, DFA-NFA token frequency, DFA steps to match, and NFA states to match. Other cost factors may be used as necessary. The cost factors are multiplied by tunable coefficients and summed. NFA states at minimum cost points are determined for entrance states in the NFA. A DFA is compiled from the entrance paths to the entrance states. NFA states and transitions needed only to reach entrance states may be deleted and all remaining NFA states are made available for execution by the NFA engine. An NFA representation of an NFA is examined by bounded depth-first recursion from each start state. | 07-31-2014 |
| 20140214750 | SYSTEMS AND METHODS FOR UTILIZING TELEMATICS DATA - A computer system and method for performing predictive analytics on telematics data regarding an entity. The computer system having a memory configured to store instructions and a processor disposed in communication with the memory. The processor upon execution of the instructions is configured to receive telematics data regarding an entity and analyze the received telematics data to identify a pattern of behavior. A behavioral conclusion and/or meaning is then determined for the entity based on analysis of the received telematics data. | 07-31-2014 |
| 20140244564 | PATTERN-RECOGNITION PROCESSOR WITH MATCHING-DATA REPORTING MODULE - Disclosed are methods and devices, among which is a device that includes a pattern-recognition processor. The pattern-recognition processor may include a matching-data reporting module, which may have a buffer and a match event table. The buffer may be coupled to a data stream and configured to store at least part of the data stream, and the match event table may be configured to store data indicative of a buffer location corresponding with a start of a search criterion being satisfied. | 08-28-2014 |
| 20140279811 | APPARATUS, SYSTEMS, AND METHODS FOR CROWDSOURCING DOMAIN SPECIFIC INTELLIGENCE - The present disclosure provides apparatus, systems, and methods for crowdsourcing domain specific intelligence. The disclosed crowdsourcing mechanism can receive domain specific intelligence as a data processing rule module. For example, a data analytics system can request a crowd of software developers to provide a data processing rule module tailored to process a particular type of information from a particular domain. When the data analytics system receives the data processing rule module from one of the software developers for the particular domain, the data analytics system can use the received data processing rule module to process information associated with the particular domain. | 09-18-2014 |
| 20140297579 | MATCHING CIRCUIT AND METHOD OF CONTROLLING MATCHING CIRCUIT - A matching circuit includes pattern circuits, and a signal path in which the pattern circuits are series-connected, wherein each of the pattern circuits connected to a preceding-stage pattern circuit through the signal path is settable in a first operation mode and in a second operation mode, wherein each of the pattern circuits in the first operation mode generates a result of matching in response to both a result of matching supplied from a preceding-stage pattern circuit and a result obtained by matching data supplied from the preceding-stage pattern circuit against part of a regular expression pattern, and wherein each of the pattern circuits in the second operation mode generates a result of matching in response to a result obtained by matching the data supplied from the preceding-stage pattern circuit against part of a regular expression pattern, without relying on a result of matching supplied from the preceding-stage pattern circuit. | 10-02-2014 |
| 20140304207 | Cognitive Data Delivery Optimizing System - Network performance data is gathered and analyzed to produce network patterns and data delivery strategies. Client devices and other network components report network performance data to a central management system. Data delivery strategies are applied to a portion of a network to deliver content appropriate for network patterns that are associated with the portion of the network. | 10-09-2014 |
| 20140310225 | EFFICIENT DATA PATTERN MATCHING - Exemplary methods, apparatuses, and systems for parsing unstructured data with a plurality of pattern matching rules are disclosed. An optimized pattern matching rule for one or more respective pattern matching rules is derived from an original pattern matching rule. The optimized pattern matching rule includes an extracted text string from the respective pattern matching rule or a less complex pattern match than the respective pattern matching rule. If the extracted text string or pattern is determined to match any of the data to be parsed, application of the original pattern matching rule is bypassed. The original pattern matching rule is applied when the one or more optimized pattern matching rules match the data. | 10-16-2014 |
| 20140310226 | Time Aggregation and Sparse Distributed Representation Encoding for Pattern Detection - A spatial and temporal memory system (STMS) processes input data to detect whether spatial patterns and/or temporal sequences of spatial patterns exist within the data, and to make predictions about future data. The data processed by the STMS may be retrieved from, for example, one or more database fields and is encoded into a distributed representation format using a coding scheme. The performance of the STMS in predicting future data is evaluated for the coding scheme used to process the data as performance data. The selection and prioritization of STMS experiments to perform may be based on the performance data for an experiment. The best fields, encodings, and time aggregations for generating predictions can be determined by an automated search and evaluation of multiple STMS systems. | 10-16-2014 |
| 20140310227 | Pattern Detection Feedback Loop for Spatial and Temporal Memory Systems - A spatial and temporal memory system (STMS) processes input data to detect whether spatial patterns and/or temporal sequences of spatial patterns exist within the data, and to make predictions about future data. The data processed by the STMS may be retrieved from, for example, one or more database fields and is encoded into a distributed representation format using a coding scheme. The performance of the STMS in predicting future data is evaluated for the coding scheme used to process the data as performance data. The selection and prioritization of STMS experiments to perform may be based on the performance data for an experiment. The best fields, encodings, and time aggregations for generating predictions can be determined by an automated search and evaluation of multiple STMS systems. | 10-16-2014 |
| 20140337273 | UPPER MERGED ONTOLOGY FOR IT ARCHITECTURE - An information technology (IT) architecture upper merged ontology which includes an upper merged ontology that is a representation framework for combined knowledge sources that are used in business and information technology; an upper merged ontology knowledge base containing information derived from an analysis of business and technical services pertaining to the IT architecture application; a plurality of semantic web application programming interfaces (APIs) that allow access to the upper merged ontology as a semantic web; a reasoning and constraint language (RaCL) that is a scripting language having the capabilities of model creation, automated reasoning and search and query operations such that scripts developed in the reasoning and constraint language can execute using the semantic web APIs; and a computer processor for representing and performing execution tasks. | 11-13-2014 |
| 20140337274 | SYSTEM AND METHOD FOR ANALYZING BIG DATA IN A NETWORK ENVIRONMENT - An example method for analyzing big data in a network environment is provided and includes extracting a data set from big data stored in a network environment, detecting a pattern in the data set, and enabling labels based on the pattern, where each label indicates a specific condition associated with the big data, and the labels are searched to answer a query regarding the big data. In specific embodiments, detecting the pattern includes capturing gradients between each consecutive adjacent data points in the data set, aggregating the gradients into a gradient data set, dividing the gradient data set into windows, calculating a statistical parameter of interest for each window, aggregating the statistical parameters into a derived data set, and repeating the dividing, the calculating and the aggregating on derived data sets over windows of successively larger sizes until a pattern is detected. | 11-13-2014 |
| 20140358837 | Searching Apparatus Utilizing Sub-word Finite State Machines - An apparatus that searches an input stream having a sequence of N-bit wide data words for a pattern using a plurality of small FSMs is disclosed. The apparatus includes a plurality of sub-word FSMs and a combiner. Each sub-word FSM has an input word size less than N-bits. Each FSM processes a corresponding segment of the N-bit words and generates a match output indicative of a possible match to the pattern when one of the input words to that FSM is received and that FSM moves to a predetermined match state. The combiner receives the match outputs from all of the sub-word FSMs and generates a pattern match output if all of the sub-word FSMs indicate a match to the pattern. The pattern is a variable pattern. In one embodiment, the FSMs are single bit FSMs. | 12-04-2014 |
| 20140358838 | DETECTING ELECTRICITY THEFT VIA METER TAMPERING USING STATISTICAL METHODS - A system and method for detecting anomalous energy usage of building or household entities. The method applies a number of successively stringent anomaly detection techniques to isolate households that are highly suspect for having engaged in electricity theft via meter tampering. The system utilizes historical time series data of electricity usage, weather, and household characteristics (e.g., size, age, value) and provides a list of households that are worthy of a formal theft investigation. Generally, raw utility usage data, weather history data, and household characteristics are cleansed, and loaded into an analytics data mart. The data mart feeds four classes of anomaly detection algorithms developed, with each analytic producing a set of households suspected of having engaged in electricity theft. The system allows a user to select households from each list or a set based on the intersection of all individual sets. | 12-04-2014 |
| 20140358839 | DETECTING ELECTRICITY THEFT VIA METER TAMPERING USING STATISTICAL METHODS - A method for detecting anomalous energy usage of building or household entities. The method applies a number of successively stringent anomaly detection techniques to isolate households that are highly suspect for having engaged in electricity theft via meter tampering. The system utilizes historical time series data of electricity usage, weather, and household characteristics (e.g., size, age, value) and provides a list of households that are worthy of a formal theft investigation. Generally, raw utility usage data, weather history data, and household characteristics are cleansed, and loaded into an analytics data mart. The data mart feeds four classes of anomaly detection algorithms developed, with each analytic producing a set of households suspected of having engaged in electricity theft. The system allows a user to select households from each list or a set based on the intersection of all individual sets. | 12-04-2014 |
| 20140379628 | PRIVACY RISK METRICS IN LOCATION BASED SERVICES - The present disclosure relates generally to mechanisms for the estimation of location privacy risk, comprising: building one or more trajectory models from auxiliary information (e.g., one or more maps, one or more routes); capturing common behavioral patterns (e.g., shortest route(s),/fastest route(s)); identifying, given unlinked trajectories for a plurality of users, most likely linkages using the trajectory model(s); eliminating one or more unlikely linkages based on deviation from the shortest route(s) and/or the fastest route(s); measuring privacy as the percentage of linkages correctly identified; and outputting the measured privacy. | 12-25-2014 |
| 20150026113 | SYSTEM AND METHOD FOR IDENTIFICATION OF DEVIATIONS FROM PERIODIC BEHAVIOR PATTERNS IN MULTIMEDIA CONTENT - A method and system for identification of a deviation from a periodic behavior pattern in a sequence of multimedia content segments are provided. The system comprises receiving the sequence of multimedia content segments; generating at least one signature for each multimedia content segment of the sequence of multimedia content segments; comparing at least two signatures generated for at least two consecutive multimedia content segments to detect a periodic behavior pattern; upon detecting the periodic behavior pattern, comparing at least one signature generated for at least a subsequently received multimedia content segment to at least one signature representing the detected multimedia content segment to identify a deviation from the periodic behavior pattern; and upon identifying the deviation from the periodic behavior pattern, generating a notification with respect to the at least one deviation. | 01-22-2015 |
| 20150039550 | CONSTRUCTION ABORTION OF DFA BASED ON EXPRESSION - DFA construction may be aborted if the DFA will become too big for the computing device to handle or based on user preferences. A DFA may be constructed from an NFA, which is constructed from an expression. The expression may have a total number of operands and operators r. The determination to abort DFA construction may be based on the operands. If the number of DFA nodes constructed is more than a lower threshold and the number of DFA nodes constructed is greater than a function, f(r), the DFA construction may be aborted. If the number of DFA nodes is greater than a higher threshold, the DFA construction may be aborted. The lower threshold may be determined based on computing device capabilities and user preference. The higher threshold may be based on computing device capabilities. | 02-05-2015 |
| 20150081612 | RULE MATCHING METHOD AND APPARATUS - The present invention discloses a rule matching method including: receiving a packet; detecting feature information in content of the packet, and determining whether the detected feature information in the packet conforms to a classification characteristic of one rule group among a plurality of preset rule groups; if yes, determining a state machine corresponding to the one rule group as a first state machine; and determining whether the first state machine is stored in an on-chip memory, and if yes, using the first state machine to match the packet to obtain a matching result; and if no, when an off-chip memory stores the first state machine, loading the first state machine from the off-chip memory into the on-chip memory, and using the first state machine to match the packet to obtain a matching result. Embodiments of the present invention enable a product to achieve better performance. | 03-19-2015 |
| 20150100535 | MEDIA CONTENT RATING MANAGEMENT WITH PATTERN MATCHING - A method according to one embodiment includes the operations of determining a requested playback media content rating; selecting a pattern matching database associated with the requested playback media content rating; scanning one or more frames of media content; and comparing the scanned frames of media content to the pattern matching database to determine matched frames for omission from playback based on the requested playback media content rating. | 04-09-2015 |
| 20150100536 | PARALLEL HARDWARE SEARCHING SYSTEM FOR BUILDING ARTIFICAL INTELLIGENT COMPUTER - An affordable artificial intelligent (AI) computer is invented by combining present computer with a parallel hardware search system. Such a computer can be treated as a Turing Machine. Instead of sequentially processing computer instructions, this computer executes AI logic reasoning The parallel hardware search system use pure parallel hardware to execute virtual B-tree search. Hierarchical page table and hash techniques are also used for very large data volume. The prototype of this invented system is successfully built into a PCIE card which mainly contains a Xilinx's Kintex7 FPGA chip and two DDR3 memory modules. FPGA chip includes: 32 32-bit processing units (PUs), one PCIE controller, one search/delete/insert controller and two DDR3 controllers. | 04-09-2015 |
| 20150112918 | METHOD AND SYSTEM FOR RECOMMENDING CONTENT TO A USER - Method, system, and programs for recommending content to a user. First information related to one or more previous users is first obtained. A model that maps from users to topics of interest is then established based on the first information related to the one or more previous users. Second information related to the current user is also obtained. One or more topics of interest are identified for the current user based on the model. Content is recommended to the current user in accordance with the one or more topics of interest for the current user. Eventually, an updated model is generated by integrating information associated with the current user with the model established based on the first information related to the one or more previous users. The information associated with the current user includes the second information related to the current user. | 04-23-2015 |
| 20150134585 | COMPUTER-BASED EXTRACTION OF COMPLEX BUILDING OPERATION RULES FOR PRODUCTS AND SERVICES - A method for generating an operational rule associated with a building management system includes identifying, with a processing device, a first pattern associated with a series of operational observations corresponding to a property of the building management system, correlating a first contextual attribute with the first pattern, and deriving the operational rule at least in part based on the first pattern and the first contextual attribute. | 05-14-2015 |
| 20150134586 | COMPUTER-BASED EXTRACTION OF COMPLEX BUILDING OPERATION RULES FOR PRODUCTS AND SERVICES - A method for generating an operational rule associated with a building management system includes identifying, with a processing device, a first pattern associated with a series of operational observations corresponding to a property of the building management system, correlating a first contextual attribute with the first pattern, and deriving the operational rule at least in part based on the first pattern and the first contextual attribute. | 05-14-2015 |
| 20150142719 | AUTOMATICALLY SELF-LEARNING BIDIRECTIONAL SYNCHRONIZATION OF A SOURCE SYSTEM AND A TARGET SYSTEM - A method and associated system for an automatically self-learning audit of a bidirectional synchronization means for synchronizing a source system and a target system. A processor identifies a mismatch between an element of production data of the source system and an analogous production-data element of the target system. If the mismatch is caused by an issue known to the synchronization means, the processor takes corrective action known to resolve the mismatch. Otherwise, the processor attempts to identify a resolution and, if successful, applies the resolution, teaches the resolution to the synchronization mechanism, records the solution, and resends data from the correct system to the incorrect system. If unable to identify a resolution, the processor implements a next-best solution that allows continued operation despite the unresolved mismatch. The processor then generates a report of the mismatch and continues searching for other mismatches in the loaded data models. | 05-21-2015 |
| 20150294228 | SYSTEM AND METHOD OF PREDICTING FUTURE DEMAND OF A CHARGING STATION - A system and method of predicting future demand of a charging station include collecting probe data from a plurality of electric vehicles. The probe data includes charging activity history of the plurality of electric vehicles. A usage pattern of a charging station is determined based on the probe data for the charging station. A future demand for the charging station is predicted by applying the usage pattern to a factor associated with a requesting electric vehicle. The predicted future demand for the charging station is provided to the requesting electric vehicle. | 10-15-2015 |
| 20150310341 | RULES BASED DATA PROCESSING SYSTEM AND METHOD - Systems, methods and mediums are described for processing rules and associated bags of facts generated by an application in communication with a processing engine, database and rule engine that process the bags of facts in view of the rules and generate one or more rule-dependent responses to the application which performs one or more work flows based on the responses. The rule engine may apply forward-chaining, backward-chaining or a combination of forward-chaining and backward-chaining to process the rules and facts. Numerous novel applications that work in conjunction with the processing engine, database and rule engine are also described. | 10-29-2015 |
| 20150310342 | OVERLAY AUTOMATA APPROACH TO REGULAR EXPRESSION MATCHING FOR INTRUSION DETECTION AND PREVENTION SYSTEM - Embodiments are described for automata models for use in deep packet inspection. Various embodiments are described for a new automata model, Overlay DFA (ODFA), which captures state replication in DFAs. Additional embodiments include combining the ODFA model with a D2FA model to provide an Overlay Delayed Input DFA (OD2FA). As the DFA model captures transition sharing, the OD2FA model captures both state replication and transition sharing. Algorithms are disclosed for efficiently constructing the OD2FA model and for implementing the OD2FA model in Ternary Content Addressable Memory (TCAM). | 10-29-2015 |
| 20150324702 | PREDICTIVE PATTERN PROFILE PROCESS - A system and method for providing a prediction is disclosed. A series of historical data or profiles are collected and stored on a database. Using software to provide a first set of predictive patterns from the historical profiles and a second set of predictive patters from the first set of predictive patterns from which the prediction for a particular subject such as sales can be provided. | 11-12-2015 |
| 20150339575 | INFERENCE ENGINE - System, program product and method for generating entailments, the system comprising an input component to obtain input data; a comparator comparing input data to a group of term sets comprising key words, definitions, and relationships for areas of interest; a term selector to select terms and load into memory; an inference rule selector to select, based on selected terms and input data, inference rules; a historical data selector to select, based on the selected terms and the selected inference rules, a subset of historical data; a rules engine to generate new entailments based on the input data, subset of historical data, selected terms, and inference rules; repeating steps for each entailment; a storing component to store the input data and new entailments; obtaining output data based on the input data, the new entailments, the subset of historical data, the output data, for user utilization. | 11-26-2015 |
| 20150339581 | FACILITATING ACCESS BY AN EXPERT ENGINE AND A TRANSACTION FACILITY TO LIFE OCCURRENCE ECOSYSTEM RESOURCES - A method is disclosed herein in accordance with an embodiment of the present invention. The method may include deriving at a mobile transaction platform a multi-dimensional context from one or more user transactions and determining at least one life occurrence based, at least in part, on the multi-dimensional context. The one or more user transactions may be conducted through the mobile transaction platform. The one or more user transactions may be stored on a third-party source. In an aspect, the at least one life occurrence has yet to occur. In another aspect of the invention, the life occurrence has already occurred. The multi-dimensional context may include at least one of user location information and life occurrence location information. The multi-dimensional context may include at least one of a time of life occurrence and a current time. | 11-26-2015 |
| 20150347914 | METHOD FOR DATA PARALLEL INFERENCE AND APPARATUS THEREOF - Exemplary embodiments of the present invention relate to a method and apparatus for big data parallel inference. A method for data parallel inference according to an embodiment of the present invention comprises generating a predetermined network comprising a pattern network and a join network based on rule files and a predetermined algorithm; performing a pattern matching test for input data in parallel on a plurality of pattern matching means by loading the pattern network to each of the plurality of pattern matching means and distributing the inputted data to the plurality of pattern matching means; and inferring new data by performing a join matching test for the data which has passed the pattern matching test. According to embodiments of the present invention, new data can be inferred by analyzing accurately and fast big data. | 12-03-2015 |
| 20150356449 | USER LOCATION INTEREST INFERENCES - One or more techniques and/or systems are provided for identifying a location interest inference for a first user. A first set of user signals (e.g., search history, social network posts, etc.) associated with the first user may be evaluated to identify a first user location interest pattern indicative of location interests of the first user. Social signals (e.g., phone calls, emails, photo tags, shared content, etc.) between the first user and other users may be evaluated to identify a second user having a social activity relevance score above a relationship threshold with respect to the first user. A second user location interest pattern may be generated for the second user based upon user signals associated with the second user. The first user location interest pattern and the second user location interest pattern may be aggregated to create the location interest inference indicative of refined locational interests of the first user. | 12-10-2015 |
| 20160004973 | BUSINESS TRIZ PROBLEM EXTRACTOR AND SOLVER SYSTEM AND METHOD - A computer-based method to identify and solve problems that exist in a real-world system by cross-functional, cross-industry logic methods and technology-enabled infrastructure to facilitate inventive business problem solving through integrated system and method to (1) extract system problem and formulate TRIZ contradiction inputs, (2) refine the problem statement, (3) search TRIZ business matrix and apply the TRIZ business principles, (4) formulate solutions, (5) apply domain context, (6) generate outputs, and refine the system to enhanced stated for future iterations. More particularly, the present invention allows users to state problems in plain language (English or other), audio, images, video, sensor data, or other information format. The system then analyzes the information and performs semantic information extraction to translate the human-stated problems to Resource Description Framework (RDF) data model ontological subject-predicate-object expressions (triples, in RDF terminology). The problem statement defined in RDF format, is based on the Business TRIZ Engine compatible parameters, which allows general solutions to be determined. These general solutions are augmented with domain-, environmental-, and Organization-specific information to produce domain-specific solutions. Extracted problems and problem solutions are integrated back into the system. | 01-07-2016 |
| 20160092779 | IMPLEMENTATIONS OF, AND METHODS OF USE FOR A PATTERN MEMORY ENGINE APPLYING ASSOCIATIVE PATTERN MEMORY FOR PATTERN RECOGNITION - Computer-readable storage memory may include a) input memory having addressable blocks of random access memory storing an input data pattern, b) pattern input address memory having addressable blocks of random access memory, each of the addressable blocks storing a predetermined address of the input memory, c) current state address memory comprising a block of random access memory storing a current state address, and d) at least one next state memory having addressable blocks of random access memory, each of the addressable blocks storing predetermined data determining a next state address. The pattern input address memory and the at least one next state memory may each be sized with at least a number of addressable blocks as a maximum state address storable in the current state address memory. The current state address may index an addressable block of the pattern input address memory and the at least one next state memory. | 03-31-2016 |
| 20160104068 | MATCH ENGINE FOR DETECTION OF MULTI-PATTERN RULES - Methods, systems and computer program products are disclosed for detecting patterns in a data stream that match multi-pattern rules. One embodiment of the invention provides a method of recognizing a specified group of patterns in a data stream. The method comprises identifying a rule for said specified group of patterns in the data stream, and using a first array of finite state machines to scan the data stream for at least some of the patterns in the specified group. For patterns in the specified group that are found in the data stream by the first array of finite state machines, pattern identifiers are sent to a second array of finite state machines. The second array of finite state machines determines if the specified group of patterns is in the data stream in accordance with the identified rule by, at least in part, using said pattern identifiers. | 04-14-2016 |
| 20160140317 | DETERMINING TREATMENT COMPLIANCE USING PASSIVELY CAPTURED ACTIVITY PERFORMANCE PATTERNS - Methods and systems are described for unobtrusively monitoring patient activity to determine compliance of the patient with a prescribed regimen for treating a brain-related disorder. Patient activity associated with routine activities is detected with an activity sensor at the patient location, and activity data is transmitted to a monitoring location. The activity sensor and other components at the patient location may be incorporated into, or associated with, a cell phone, computing system, game system, appliance, or vehicle system, for example. Patient activity is processed at the patient location and/or monitoring location to identify activity parameters and/or patterns that indicate whether the patient has complied with the prescribed treatment regimen. Patient identity may be determined through biometric identification or other authentication techniques. The system may provide a report to an interested party, for example a medical care provider or insurance company, regarding compliance of the patient with the prescribed treatment regimen. | 05-19-2016 |
| 20160148109 | System for Motion Analytics and Method for Analyzing Motion - A system for motion analytics includes acceleration sensors and selectively infrared sensors or microphones. The system also includes a processor and display device. The processor identifies test scores obtained by subjects. The processor also computes degrees of similarities in the real-time physical movements between the at least two groups of subjects using the acceleration sensors, and an amount of time during which some subjects among the at least two groups of subject are engaged in communication using the infrared sensors and/or the microphones. Further, the processor analyzes a correlation between the test scores and the degrees of similarities, and between the test scores and the amount of communication time. The processor then predicts an improvement in the test scores based on patterns in the analysis of the correlation. The predicted improvement of the test scores is then displayed on the display device. | 05-26-2016 |
| 20160148111 | EVENT ANALYSIS APPARATUS, EVENT ANALYSIS METHOD AND COMPUTER PROGRAM PRODUCT - An associated event group preparation unit calculates a degree of association between the events on the basis of an event matrix, and prepares an associated event group for each event. A cause-and-effect relationship model establishment unit establishes a probabilistic cause-and-effect relationship model by a Bayesian network on the basis of the event matrix, for each associated event group. An improvement candidate pattern receiving unit receives a setting of an improvement candidate pattern in which a condition of an event to be set as an improvement candidate is determined by attributes of the base point event and the associated event and a conditional probability between the base point event and the associated event. A pattern analysis unit extracts a probabilistic cause-and-effect relationship model conforming to any one of the set improvement candidate patterns, from the established probabilistic cause-and-effect relationship models for each event. | 05-26-2016 |
| 20160180232 | PREDICTION DEVICE, PREDICTION METHOD, AND NON-TRANSITORY COMPUTER READABLE STORAGE MEDIUM | 06-23-2016 |
| 20160379124 | SYSTEM AND METHOD OF PROACTIVE SELF-CARE FOR ELECTRONIC DEVICES - A method is provided for creating pattern-problem pairs for proactive diagnosis of device issues. A plurality of problem reports are received from problem devices, each having parameters associated with a device profile. The problem reports are parsed to standardize and normalize terms. The parsed problem reports are analyzed to identify common problems in a set of such problem devices where there is a common set of parameters in a pattern. If the frequency of the problems in the set of devices exceeds a threshold, the parsed problem is associated with the pattern for future proactive diagnosis of a target device having the pattern, even without a problem report from the target device. A method of proactively diagnosing a potential problem on a device using such pattern-problem pairs is also provided. | 12-29-2016 |
