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

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

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

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

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

Abstract: 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: access rule data representing: one or more rules associated with the position, at least one rule value for each rule, and one or more model attributes for each rule, the model attributes being associated with a model candidate for the position; access candidate data representing a candidate profile with one or more candidate attributes of the recruitment candidate; determine matching ones of the rules based on whether the candidate attributes match the model attributes of each rule; and generate data representing a matching metric value, representing the suitability of the recruitment candidate for the position, based on the rule values that correspond to the matching rules.

Abstract: A computer-implemented process for detecting and predicting events occurring to a person, includes: observing, using a sensor, a reading of a parameter of a body part of the person which is one of: horizontal location, vertical height, orientation, velocity, and time of observation, wherein the reading corresponds to less information than needed to define the person's posture; receiving the reading into a computer memory; determining from the received reading a pattern of behavior; detecting a change in behavior; identifying from the change in behavior a combination of one or more readings corresponding to an abnormal event; and producing an alert signal when the combination of one or more readings corresponding to the abnormal event is identified. The process may be practiced using a computing machine including a computer memory; a sensor; and a computer processor.

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

Abstract: A method and system that provide for decision support and/or training support in crisis decision-making situations are provided. In one implementation, for example, a method identifies patterns from known cases based on information from a crisis event. Each of the known cases includes attributes and at least one outcome. The method also identifies a first subset of the known cases that relate to the identified patterns from the known cases. The method also analyzes the identified patterns to determine a cue that, if answered, will provide a second subset of the known cases including a more converged range of decision outcomes than the first subset.

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

Abstract: An apparatus, and corresponding method, for performing a search for a match of at least one expression in an input stream is presented. A graph including a number of interconnected nodes is generated. A compiler may assign at least one starting node and at least one ending node. The starting node includes a location table with node position information of an ending node and a sub-string value associated with the ending node. Using the node position information and a string comparison function, intermediate nodes located between the starting and ending nodes may be bypassed. The node bypassing may reduce the number of memory accesses required to read the graph.

Abstract: A computer-implemented method and non-transitory article of manufacture tangibly embodying computer readable instructions 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, selecting, based on the located best matching historical record, one of (i) a data prediction solution record and (ii) a rule prediction solution, and calculating a demand gap between the current demand and the best matching historical record as a best matching demand gap, where at least one step is carried out using a computer device.

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

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

Abstract: Emotion data is added to tags. The emotion data is generated by a user upon accessing content. The emotion data is obtained from measurable physiological parameters that reflect the user's emotions while accessing the content. The emotion data can be used to provide services.

Abstract: A computer system provides a way to automatically generate compound commands that perform tasks made up of multiple simple commands. A compound command generation mechanism monitors consecutive user commands and compares the consecutive commands a user has taken to a command sequence identification policy. If the user's consecutive commands satisfy the command sequence identification policy the user's consecutive commands become a command sequence. If the command sequence satisfies the compound command policy, the compound generation mechanism can generate a compound command for the command sequence automatically or prompt an administrator to allow the compound command to be generated. Generating a compound command can be done on a user by user basis or on a system wide basis. The compound command can then be displayed to the user to execute so that the command sequence is performed by the user selecting the compound command for execution.

Abstract: Methods and circuits for disrupting integrated circuit function. The circuits include finite state machines connected to memory arrays. The finite state machines are sensitive to a predetermined sequence of addresses sent to the memory array or the time between a series of memory array errors detected by an error detection circuit. Upon detection of the pre-set addresses or errors the finite state machines either (i) enable or disable specific circuit functions or (ii) disrupt the operation of the integrated circuit.

Abstract: A computer system is protected against harmful activity of a privileged user. A risk agent is deployed which is communicatively coupled to a risk engine, the risk engine being operative in response to queries to perform model-based risk assessments of activities and to provide responses conveying risk assessment results. The risk agent monitors computer system activity of the privileged user to detect initiation of a sensitive operation, and formulates and sends a query to the risk engine requesting risk assessment. The risk agent takes an appropriate control action based on a risk assessment result in a response to a query. The control action may be one of allowing the sensitive operation to proceed; preventing the sensitive operation from proceeding; issuing a notification that the sensitive computer operation is proceeding; and obtaining further confirmation as a condition to allowing the sensitive operation to proceed.

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

Abstract: A system and method of enabling identification of a right event sound (ES) corresponding to an impact related event is described. The instant invention facilitates the identification of the most appropriate sound for an impact related audio-video event thereby enabling the content producers to mix it with the video content and provide the viewers a near life like experience. The instant invention further provides a method to create an Audio-Video Database Library (AVD) to initialize the system. A method of determining the intensity of impact for an event in terms of pixels traversed by the impact object as evaluated across the video frames before, at and after the frame of impact is also discussed herein.

Abstract: Parallel compression is performed on an input data stream by processing circuitry. The processing circuitry includes hashing circuitry, match engines, pipeline circuitry and a match selector. The hashing circuitry identifies multiple locations in one or more history buffers for searching for a target data in the input data stream. The match engines perform multiple searches in parallel for the target data in the one or more history buffers. The pipeline circuitry performs pipelined searches for multiple sequential target data in the input data stream in consecutive clock cycles. Then the match selector selects a result from the multiple searches and pipelined searches to compress the input data stream.

Abstract: This invention is a system and a method for operating a storage server that provides read or write access to a data in a data network using a new architecture. The method of processing I/Os in response to a request by a client of the storage server executes one or more services communicated by a policy engine. The I/Os received from the application are tagged and catalogued to create co-related I/O patterns. The policy engine is then updated with the results of processing the I/Os after executing services on those I/Os.

Abstract: In an embodiment, a technique for analyzing a model, either statically or dynamically, to check 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 a data store prior to reading the data store, reading the data store prior to writing the data store, writing to the data store multiple times prior to reading the data store, reading the data store multiple times before writing 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 the analyzing. The result may be output.

Abstract: The present invention relates to a system for mapping external inputs and internal goals toward actions that solve problems or elicit external rewards. The present invention allows an instructor to test and train an agent to perform dynamic task selection (executive control) by using a schema that computes the agent's emotional and motivational states from reward/punishment inputs and sensory inputs (visual, auditory, kinematic, tactile, olfactory, somatosensory, and motor inputs). Specifically, the invention transforms the sensory inputs into unimodal and bimodal spatio-temporal schemas that are combined with the reward/punishment inputs and with the emotional and motivation states to create an external/internal schema (EXIN schema), that provides a compressed representation assessing the agent's emotions, motivations, and rewards. The invention uses the EXIN schema to create a motor schema to be executed by the agent to dynamically perform the task selected by the instructor.

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

Abstract: A method of determining a command line validity includes maintaining a block network address database including block network address information; receiving a command line from a terminal of a user; extracting network address information included in the command line; determining whether the network address information is the block network address information, with reference to the block network address database; generating log information associated with the command line in case that the network address information is not the block network address information as the result of the determination, in which the log information comprises at least one of the network address information included in the command line, input time point information with respect to the input time point of the command line, and request content information; recording the log information in a log database; and determining the validity of the command line by using the log information.

Abstract: An approach for building an ontology is provided. Based on a grammar, extracted complex triples are syntactically transformed to identify core terms. The syntactically transformed complex triples are semantically transformed into simplified triples referring to new terms that conceptualize the core adjectives, adverbs and verbs, and assigning the core terms to respective definitions and keys in a reference ontology, thereby retaining the semantics of the complex triples. Based on a meta-schema of the reference ontology, an enrichment transformation of the simplified triples is performed to create simplified and enriched triples by adding relations derived from a correspondence each term in the simplified triples has with the reference ontology and by adding representations of semantics of reference ontology definitions of the terms. The simplified and enriched triples are stored as an ontology representing knowledge in an application providing the free-form text from which the complex triples were extracted.

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

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

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

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

Abstract: The parallel kinematic machine (PKM) trajectory planning method is operable via a data-driven neuro-fuzzy multistage-based system. Offline planning based on robot kinematic and dynamic models, including actuators, is performed to generate a large dataset of trajectories, covering most of the robot workspace and minimizing time and energy, while avoiding singularities and limits on joint angles, rates, accelerations and torques. The method implements an augmented Lagrangian solver on a decoupled form of the PKM dynamics in order to solve the resulting non-linear constrained optimal control problem. Using outcomes of the offline-planning, the data-driven neuro-fuzzy inference system is built to learn, capture to and optimize the desired dynamic behavior of the PKM. The optimized system is used to achieve near-optimal online planning with a reasonable time complexity. The effectiveness of the method is illustrated through a set of simulation experiments proving the technique on a 2-degrees of freedom planar PKM.

Abstract: A system and method provides a natural language interface to world-wide web content. Either in advance or dynamically, webpage content is parsed using a parsing algorithm. A person using a telephone interface can provide speech information, which is converted to text and used to automatically fill in input fields on a webpage form. The form is then submitted to a database search and a response is generated. Information contained on the responsive webpage is extracted and converted to speech via a text-to-speech engine and communicated to the person.

Abstract: A method to support multi-dimensional tuples in rule engines having rule engine executed by 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.

Abstract: According to one aspect, a computer-readable recording medium stores therein an extracting program 330a causing a computer to execute a process. The process includes based on event data obtained by associating a plurality of events stored in a storage unit and an occurrence time of each event, sequentially adding an event to a first pattern obtained by associating the plurality of events and the occurrence order of each event, and sequentially generating a second pattern which includes the first pattern and occurs in the event data; and extracting a pattern which satisfies a predetermined condition from the generated second pattern.

Abstract: In the present invention, a data processing device for processing streams of network borne data includes content inspection logic configurable to perform pattern matching functions on a received content stream and output match data, and a microengine for executing computer coded instructions, the microengine being coupled to the content inspection logic for configuring the pattern matching function of the content inspection unit in respect of a particular processing job for the received content stream and for processing the content stream independence on the match data. The microengine is adapted to reconfigure dynamically the content inspection logic in dependence on the match data thereby to modify the pattern matching function performed by the content inspection logic on the content stream during the course of a processing job. The present invention provides a novel architecture and method for processing content as it flows through a network.

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

Abstract: Methods and apparatus consistent with the invention provide the ability to organize and build understandings of machine data generated by a variety of information-processing environments. Machine data is a product of information-processing systems (e.g., activity logs, configuration files, messages, database records) and represents the evidence of particular events that have taken place and been recorded in raw data format. In one embodiment, machine data is turned into a machine data web by organizing machine data into events and then linking events together.

Abstract: The current specification covers various new algorithms, methods, and systems for, e.g., image recognition (e.g., for action, gesture, emotion, expression, biometrics, fingerprint, facial, OCR (text recognition), background, relationship, position, pattern, and object), machine learning, training schemes, feature space, clustering, classification, similarity measures, optimization, search engine, ranking, question-answering system, soft (fuzzy or unsharp) boundaries/impreciseness/fuzziness in language, clustering, and recognition, Natural Language Processing (NLP), Computing with Words (CWW), parsing, machine translation, sound and speech recognition, video search and analysis (e.g. tracking), image annotation, geometrical abstraction, image correction, semantic web, context analysis, data reliability (e.g., using Z-number (e.g.

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

Abstract: According to one embodiment, an information processing system is coupled to a number of sensors for receiving information generated by the sensors. The information processing system generates records from the received information and binds the records in a multi-dimensional structure including a temporal dimension and another dimension including other records that share a common criterion. The information processing system compares a particular record against other records to detect an abnormality of the particular record.

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

Abstract: A system and method of presenting benefits to a user of a computing device is provided. The method may include detecting user activities via a computer program executed on the computing device, storing a list of detected user activities in a user history in the computing device, and receiving a list of predefined benefits from at least one remote server. Each of the predefined benefits may include an associated trigger user activity. The method may further include storing the list of predefined benefits in the computing device, and determining a predefined benefit to present to the user based at least on the presence of a trigger user activity for the predefined benefit in the user history, via the computer program in the computing device. The method may further include presenting a matched predefined benefit to the user.

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

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

Abstract: Various exemplary embodiments relate to method of generating PCC rules for managing packet traffic across a network. The method may include: receiving a request message for PCC rules from a requesting network component, authorizing the first requested bandwidth for a first traffic mapping; authorizing a third bandwidth for at least a second traffic mapping wherein the third authorized bandwidth is less than or equal to a second requested bandwidth minus the first requested bandwidth; generating a first PCC rule comprising: a service flow corresponding to the first traffic mapping and the first authorized bandwidth; and generating a second PCC rule comprising: a service flow corresponding to the second traffic mapping and the third authorized bandwidth. Various exemplary embodiments relate to a Policy and Control Rules Node (PCRN) for generating PCC rules. The PCRN may include an interface, service flow extractor, policy engine, rule generator, rules storage and rules manager.

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

Abstract: A method for operating a plurality of processor to determine a sequence of states traversed by a finite state machine in processing an input stream that includes a plurality of characters. The method divides the input stream into a plurality of contiguous sections characterized by a beginning character and an end character. Each section is assigned to a different processor. Each processor determines an end state that the finite state machine would traverse after the end character in the section assigned to that processor has been processed. That end state is provided to a processor that did not process the section associated with that end state. Each processor determines a sequence of states that the finite state machine would traverse if the finite state machine processed the section assigned to that processor using one of said received end states.

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