Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: Provided is a mobile terminal including a movement sensor that detects a movement of a user and outputs movement information, acquires information on a building existing at a current location or information on buildings existing in a vicinity of the current location, analyses the movement information output from the movement sensor, and detects a first behavior pattern corresponding to the movement information from multiple first behavior patterns obtained by classifying behaviors performed by the user over a relatively short period of time, and analyses the information on a building or buildings and the first behavior pattern, and detects a second behavior pattern corresponding to the information on a building or buildings and the first behavior pattern from multiple second behavior patterns obtained by classifying behaviors performed by the user over a relatively long period of time.

Abstract: Sea characteristics are determined by using a buoy with multiple tilt switches configured to sense at plural tilt angles of the buoy. The tilt switches provide binary outputs of tilt data corresponding to the tilt angles. The binary outputs are received by a processor and are compared with sample patterns of tilt data. The comparison is used to provide an output corresponding to sea conditions.

Abstract: A method for profiling network traffic of a network. The method includes obtaining a signature library comprising a plurality of signatures corresponding to a plurality of behavioral models, generating, based on a first pre-determined criterion, a group behavioral model associated with the signature library, wherein the group behavioral model represents a common behavior of a plurality of historical flows identified from the network traffic, wherein each of the plurality of signatures correlates to a subset of the plurality of historical flows, selecting a flow in the network traffic for including in a target flow set, wherein the flow matches the group behavioral model without matching any of the plurality of behavioral models, analyzing the target flow set to generate a new signature, and adding the new signature to the signature library. Further, each behavioral model is generated from a kernel constructed using boosting of decision tree learning methods.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: An information processing apparatus includes an input unit configured to input an annotation of at least one of an underline, a box, a character, a character string, a symbol and a symbol string to a displayed document, an annotation recognition unit configured to recognize a type of the annotation and a coverage of the annotation in the document, an intention estimation unit configured to estimate intention of a user based on the type of the annotation and information in the coverage, an action storage unit configured to store a plurality of actions, an action selection unit configured to select an action to be performed for the document from the action storage based on the intention estimated by the intention estimation unit, and an execution unit configured to execute the action selected by the action selection unit.

Abstract: Various embodiments of the present disclosure provide methods, systems, and devices for monitoring one or more utilities consumed within a monitored area. At least certain disclosed methods include detecting an amount of a first utility consumed by a load associated with a device. An amount of a second utility consumed by a load associated with the device is detected. The identity of the device is determined based on the amount of the first and second utility consumed. In further disclosed methods, a utility monitoring method is disclosed that includes measuring an amount of a utility consumed by a first device at a first time and an amount of a utility consumed by a second device at a second time. The identity of the first device is determined based on the measured consumption of the first and second devices at the first and second time. In certain implementations, the electricity meter uses an effective variance analysis of the conductance waveform on an electrical circuit to identify specific appliances.

Abstract: Aspects of the subject matter described herein relate to semaphores. In aspects, a feedback mechanism is described that uses a semaphore to attempt to maximize throughput of a computer system. Throughput is tracked over periods of time. At or after the end of a period of time, the throughput of the period of time together with other data is used to determine whether a max count for a semaphore is to be changed and by how much. This monitoring of throughput and modifying of the max count may continue over subsequent periods of time to attempt to maximize throughput.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: Methods and systems for robotic determination of a response to conflicting commands are provided. The robot may evaluate scenarios using variables related to the contextual/situational data for event outcomes from which the robot can determine which of two or more actions to take, as by prioritizing the actions in order of importance.

Abstract: Various implementations are disclosed for routing messages according to a routing order, where sequences (e.g., sub-sections or subsets) of the routing order are progressively and/or iteratively resolved during a run-time of the message routing operation(s). The resolution of a sequence may involve determining identity information of recipients that were previously only described within the sequence in relation to one another, in relation to the group, or in relation to a type of routing order. Further, the resolution(s) of the sequences may depend at least in part on responses received from recipients of the message during execution of earlier (resolved) sequences of the message routing operations. In this way, message routing may occur dynamically, so that, for example, new recipients may be added, or a (new) message order may otherwise be realized or implemented, during the run-time of the routing operation.

Abstract: A method that imputes missing values while building a predictive model. A population of solutions is created using a data set comprising missing values, wherein each solution comprises parameters of each of the predictive models and the missing values of a data set. Each of the solutions in a population is checked for fitness. After the fitness is checked, the solutions in a population are genetically evolved to establish a successive population of solutions. The process of evolving and checking fitness is continued until a stopping criterion is reached.

Abstract: Events may be identified by storing information in response to activating an event stamp function. As a result of activating the event function, the information collected may immediately be compared to event information in a database. Alternatively, the information collected may later be compared to event information in a database. One or more candidates for the event of interest may be automatically or manually retrieved, and the user may decide whether a candidate event of the one or more candidates correspond to the event of interest. Alternatively, a purchase of an item related to the event may be automatically made in response to activating the event stamp.

Abstract: 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.

Abstract: A computer-implemented method of determining an allocation plan for a cargo stowage problem of allocating a set of cargo items to a set of cargo item positions of a vessel, each cargo item position being suitable for receiving a cargo item. The method comprises constructing an expression indicative of one or more constraints to be satisfied by said allocation plan, constructing a cost function indicative of a cost of an updated allocation plan relative to a current allocation plan of said cargo stowage problem, iteratively updating a current allocation plan from an initial allocation plan to an updated allocation plan so as to decrease said cost function under said one or more constraints.

Abstract: 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.

Abstract: A file format corresponding to each configuration file is identified. Each configuration file is parsed into a single tree structure with the corresponding file format. The single tree structure is modified with an Application Program Interface (API). The configuration file is bidirectionally updated to reflect the modified single tree structure while preserving the file format of each configuration file. The file format includes instructions on how each entry in each configuration file is to be mapped into the single tree structure.

Abstract: 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.

Abstract: Image processing method that includes the steps of considering each image point as a node of an artificial neural network, and of processing the image as function of values of the nodes and of connections of each image point undergoing processing with neighboring image points, the image points of the processed image being obtained by iterative evolution steps of parameters defining the appearance as evolution steps of the value of nodes or by iterative evolution steps of values of the set of connections or by a combination of the evolutions, wherein the processing occurs by evolution iterative steps that are functions of connections of neighboring image points with the image point under examination, each of the neighboring image points being further considered as neighboring one or more or all adjacent image points, the functions providing immediate feedback contributions for determining appearance values of all other image points.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A method and apparatus for automatically classifying an unknown web site to improve internet browsing control is described. In one embodiment, a method for classifying an unknown web site to control internet browsing comprising processing web site control data associated with at least one user that requested access to an unknown web site, wherein the web site control data comprises a web browsing behavior history and applying at least one metric to the web browsing behavior history to classify the unknown website.

Abstract: An automated technique compares two sets of documents (such as two source codebases) to automatically determine documents within each set that are similar to one another. The technique constructs a matrix relating pairs of documents from the first and second sets of documents to lines that occur in both documents in each of the pairs of documents. A similarity score is calculated for each of the pairs of documents based on the lines from the matrix.

Abstract: A system and method of displaying presentation slides. In one aspect, the system and method provides presentation slides based on a user request for information. Both the request information and the slides are associated with identifiers. A set of slides is chosen by determining whether there are any corresponding identifiers between the request for information and the presentation slides. The slides are also chosen such that the set of slides does not include any slides associated with identifiers which are a proper subset of the identifiers of any other slide in the set.

Abstract: Various embodiments described herein include one or more of systems, software, and methods to receive and automatically route forum postings to individuals tasked with responding to the postings. Some such embodiments extract keywords from the text of such postings and use the extracted keywords and keyword-responder mappings to identify a responder capable of responding to the posting. Some embodiments include generating or updating keyword-responder mappings by identifying keywords included in posting responses made by each responder.

Abstract: A technique for analyzing a model, either statically or dynamically, checks the model for one or more specified patterns with respect to accessing a data store associated with the model. The patterns may include, for example, writing to the data store prior to reading the data store, reading the data store prior to writing to the data store, writing to the data store multiple times prior to reading the data store, reading the data store multiple times before writing to the data store, etc. The model may be an executable graphical model that is generated in a graphical modeling environment. A result may be generated based on analyzing the model and the result may be output.

Abstract: A system, method, and computer-usable medium are disclosed for providing automated processing of returned mailpieces. Recipient data and mailpiece data are processed to generate a mailpiece operation rule, all of which are then encoded to generate a unique identifier. The unique identifier is then indexed to its corresponding recipient data, mailpiece data, and mailpiece operation rule and thereafter associated with a corresponding mailpiece, which is then sent to an intended recipient. If the sent mailpiece is undeliverable to its intended recipient, it is returned and its unique identifier is scanned and then decoded to extract its corresponding recipient data, mailpiece data, and mailpiece operation rule. The extracted mailpiece operation rule is then processed to initiate a corresponding returned mailpiece operation.

Abstract: 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.

Abstract: 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.

Abstract: A method of pattern matching applicable to a transmission flow which is divided into multiple segments 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; creating the flow status information corresponding to the current pattern for the transmission flow if there is no flow status information corresponding to the current pattern for the transmission flow to which the current segment belongs; 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 applicable to a transmission flow which is divided into multiple segments 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.

Abstract: 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.

Abstract: Location information transmission apparatus for exchanging information about the on-road location on a digital map, characterized in that apparatus at an information provider comprises a location information converter for converting transmit on-road location information to road shape data including the on-road location consisting of a string of coordinates representing the road shape of a road section having a length that depends on the situation and relative data indicating the on-road location in the road section, and that apparatus at a party receiving the on-road location information comprises a shape matching section for performing shape matching by using the road shape data, identifying the road section on a digital map and identifying the on-road location in the road section by using the relative data. This makes it possible to correctly exchange information about the location on a digital map without defining node numbers or link numbers on a road network.

Abstract: A distribution of an unobserved class for a classifier with no known training data is learned by first determining, for each known class, known distribution using known training data. Sufficient statistics of the distribution of the unobserved class are determined from the known distributions and the training data associated with each known class. If the known training data and the known distributions are bounded, then update parameters of the distribution of the unobserved class from the sufficient statistics, else update the parameters from sufficient statistics and a priori probability distributions that specify the distributions of the parameters.

Abstract: In an embodiment, a computer system determines that a first rule in a ruleset comprising a plurality of rules is to be executed, where the first rule includes a condition and an action that is to be performed when the first rule's condition is met. The computer system dynamically modifies the first rule's condition to include a portion of software code configured to monitor and receive notifications from a data-change notification system. The computer system executes the dynamically modified first rule and executes a second rule in the ruleset. The computer system receives a notification from the data-change notification system indicating that execution of the second rule's action has modified data values being monitored by the first rule's software code portion and that, as a result of the modification, the first rule is to be re-executed. The computer system also re-executes the first rule based on the received notification.

Abstract: A method, computer program product, and system for variant string matching. A computer implemented method for variant string matching may comprise comparing with a computing device two unidentical strings in a training variant string pair. The two unidentical strings may represent the same item from training data, which may be stored in a memory. The two unidentical strings may be compared to determine if they include an identical substring pair, and a first unidentical substring pair. The computer implemented method may also determine if the first unidentical substring pair includes a first unidentical substring and a second unidentical substring. The computer implemented method may further determine if the first unidentical substring pair is in the training data. The first unidentical substring pair may be entered into the training data as a first variant string pair if it is not in the training data.

Abstract: 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.

Abstract: 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.