Having Specific Pattern Matching Or Control Technique Patents (Class 706/48)
  • Patent number: 8782782
    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.
    Type: Grant
    Filed: December 23, 2010
    Date of Patent: July 15, 2014
    Assignee: EMC Corporation
    Inventors: Gregory Dicovitsky, Robert William Bryan
  • Publication number: 20140195474
    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.
    Type: Application
    Filed: December 17, 2013
    Publication date: July 10, 2014
    Inventor: Xavier ANGUERA MIRÓ
  • Patent number: 8768945
    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.
    Type: Grant
    Filed: May 21, 2010
    Date of Patent: July 1, 2014
    Inventor: Vijay Sathya
  • Patent number: 8766827
    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.
    Type: Grant
    Filed: March 29, 2013
    Date of Patent: July 1, 2014
    Assignee: Intel Corporation
    Inventors: Andrew Milne, Sailesh Bissessur, Quinn W. Merrell, Lokpraveen B. Mosur
  • Patent number: 8762305
    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.
    Type: Grant
    Filed: November 2, 2011
    Date of Patent: June 24, 2014
    Assignee: HRL Laboratories, LLC
    Inventors: Suhas E. Chelian, Narayan Srinivasa
  • Patent number: 8762311
    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.
    Type: Grant
    Filed: October 1, 2012
    Date of Patent: June 24, 2014
    Assignee: The MathWorks, Inc.
    Inventors: Matthew Englehart, Peiter J. Mosterman
  • Patent number: 8762583
    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.
    Type: Grant
    Filed: March 26, 2013
    Date of Patent: June 24, 2014
    Assignee: EMC Corporation
    Inventors: Sorin Faibish, Philippe Armangau, Christopher Seibel
  • Publication number: 20140172766
    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.
    Type: Application
    Filed: December 14, 2012
    Publication date: June 19, 2014
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventor: Jan Van Lunteren
  • Patent number: 8756188
    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.
    Type: Grant
    Filed: September 23, 2011
    Date of Patent: June 17, 2014
    Assignee: NHN Business Platform Corporation
    Inventor: Jung Su Kim
  • Patent number: 8751431
    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.
    Type: Grant
    Filed: December 7, 2009
    Date of Patent: June 10, 2014
    Assignee: AT&T Intellectual Property II, L.P.
    Inventors: Nicholas Duffield, Balachaner Krishnamurthy
  • Patent number: 8751432
    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.
    Type: Grant
    Filed: September 2, 2011
    Date of Patent: June 10, 2014
    Inventors: Anker Berg-Sonne, David M. Huselid, Howard A. Nunes, Sumanth Rayancha
  • Patent number: 8747115
    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.
    Type: Grant
    Filed: March 28, 2012
    Date of Patent: June 10, 2014
    Assignee: International Business Machines Corporation
    Inventors: Freddy Lorge, Matthew A. Pantland, Tom Rojahn
  • Patent number: 8738560
    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.
    Type: Grant
    Filed: November 6, 2012
    Date of Patent: May 27, 2014
    Assignee: Cardiac Pacemakers, Inc.
    Inventors: Jeff West, Jay A. Tzucker, Mahesh Maddali, James Kalgren
  • Publication number: 20140143200
    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.
    Type: Application
    Filed: December 27, 2013
    Publication date: May 22, 2014
    Applicant: Novell, Inc.
    Inventors: Jeremy Ray Brown, Jason Allen Sabin, Nathaniel Brent Kranendonk, Kal A. Larsen, Lloyd Leon Burch, Michael Fairbanks, Michael John Jorgensen, Thomas Larry Biggs
  • Publication number: 20140136465
    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.
    Type: Application
    Filed: January 16, 2014
    Publication date: May 15, 2014
    Applicant: LSI CORPORATION
    Inventors: Alexander Podkolzin, Lav Ivanovic, Anatoli Bolotov, Mikhail Grinchuk, Sergey Afonin
  • Patent number: 8718242
    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.
    Type: Grant
    Filed: June 11, 2013
    Date of Patent: May 6, 2014
    Assignee: AT&T Intellectual Property II, L.P.
    Inventors: Srinivas Bangalore, Mazin G. Rahim, Junlan Feng
  • Patent number: 8719212
    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.
    Type: Grant
    Filed: May 9, 2011
    Date of Patent: May 6, 2014
    Assignee: King Fahd University of Petroleum and Minerals
    Inventor: Amar Khoukhi
  • Patent number: 8712949
    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.
    Type: Grant
    Filed: December 2, 2010
    Date of Patent: April 29, 2014
    Assignee: Red Hat, Inc.
    Inventors: Mark Proctor, Edson Tirelli
  • Publication number: 20140114900
    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.
    Type: Application
    Filed: September 26, 2013
    Publication date: April 24, 2014
    Applicant: FUJITSU LIMITED
    Inventors: TAKASHI KATOH, Shinichiro TAGO, Tatsuya ASAI, Hiroaki MORIKAWA, Hiroya INAKOSHI, NOBUHIRO YUGAMI
  • Patent number: 8706666
    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.
    Type: Grant
    Filed: November 7, 2006
    Date of Patent: April 22, 2014
    Assignee: BAE Systems PLC
    Inventor: Nicholas Ian Moss
  • Publication number: 20140108320
    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.
    Type: Application
    Filed: October 16, 2012
    Publication date: April 17, 2014
    Inventors: Jim S. Baca, David Stanasolovich, Joan M. Tafoya, Hong Li, Tomer Rider
  • Patent number: 8694459
    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.
    Type: Grant
    Filed: July 29, 2013
    Date of Patent: April 8, 2014
    Assignee: Z Advanced Computing, Inc.
    Inventor: Lotfi A. Zadeh
  • Patent number: 8694450
    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.
    Type: Grant
    Filed: October 30, 2012
    Date of Patent: April 8, 2014
    Assignee: Splunk Inc.
    Inventors: Michael Joseph Baum, R. David Carasso, Robin Kumar Das, Bradley Hall, Brian Philip Murphy, Stephen Phillip Sorkin, Andre David Stechert, Erik M. Swan, Rory Greene, Nicholas Christian Mealy, Christina Frances Regina Noren
  • Publication number: 20140095424
    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.
    Type: Application
    Filed: December 5, 2013
    Publication date: April 3, 2014
    Applicants: Toshiba Solutions Corporation, Kabushiki Kaisha Toshiba
    Inventors: Shigeaki SAKURAI, Kyoto Makino, Hiroyuki Suzuki
  • Patent number: 8688614
    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.
    Type: Grant
    Filed: March 5, 2009
    Date of Patent: April 1, 2014
    Assignee: Raytheon Company
    Inventor: Howard C. Choe
  • Publication number: 20140089249
    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.
    Type: Application
    Filed: December 4, 2013
    Publication date: March 27, 2014
    Applicant: SONICWALL, INC.
    Inventors: Aleksandr Dubrovsky, Justin Michael Brady, Roman Yanovsky, Boris Yanovsky
  • Patent number: 8682833
    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.
    Type: Grant
    Filed: December 22, 2011
    Date of Patent: March 25, 2014
    Inventor: Hartwell Brown
  • Publication number: 20140081897
    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.
    Type: Application
    Filed: September 16, 2012
    Publication date: March 20, 2014
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: ROMELIA H. FLORES, CHARLET N. GIVENS, SHIJU MATHAI
  • Publication number: 20140081896
    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.
    Type: Application
    Filed: March 9, 2011
    Publication date: March 20, 2014
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Anand Ranganathan, Anton V. Riabov, Octavian Udrea
  • Patent number: 8675487
    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.
    Type: Grant
    Filed: June 28, 2010
    Date of Patent: March 18, 2014
    Assignee: Alcatel Lucent
    Inventors: Kalyan Premchand Siddam, Haiqing Ma, Sachin Lalseta, Fernando Cuervo
  • Patent number: 8676738
    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.
    Type: Grant
    Filed: August 26, 2009
    Date of Patent: March 18, 2014
    Assignee: NEC Corporation
    Inventor: Hideki Kawai
  • Patent number: 8666925
    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.
    Type: Grant
    Filed: January 13, 2011
    Date of Patent: March 4, 2014
    Assignee: Agilent Technologies, Inc.
    Inventor: Lee Barford
  • Patent number: 8660976
    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.
    Type: Grant
    Filed: January 20, 2010
    Date of Patent: February 25, 2014
    Assignee: Microsoft Corporation
    Inventors: Daniel Vasquez Lopez, Ruslan A. Yakushev
  • Publication number: 20140052685
    Abstract: 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.
    Type: Application
    Filed: August 14, 2012
    Publication date: February 20, 2014
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Gregery G. Adair, Robert J. Butcher, Jeffrey J. Jonas
  • Patent number: 8655674
    Abstract: A method of providing personal service assistance in a virtual universe is disclosed. The method provides a customer avatar (CA) access to a personal assistance avatar or personal customer service representative (PCSR) avatar, hereinafter PCSR avatar. Through the PCSR avatar, the CA communicates a need or requests for personal service assistance from a business or organization. The communication of the received request is processed to identify an appropriate business, organization or vendor that meets the need or request. The identified business, organization or vendor is contacted for a representative from the business to accede to the request from the CA. The representative from the business is allowed to assume control of the PCSR avatar to conduct the session necessary for rendering the assistance or transaction. Upon completion of the session, control of the PCSR avatar is reverted to that prior to the session.
    Type: Grant
    Filed: June 24, 2008
    Date of Patent: February 18, 2014
    Assignee: International Business Machines Corporation
    Inventors: Peter G. Finn, Rick A. Hamilton, II, Neil A. Katz, James W. Seaman
  • Patent number: 8655812
    Abstract: A method for non-intrusive event-driven prediction of a metric in a data processing environment is provided in the illustrative embodiments. At least one set of events is observed in the data processing environment, the set of events being generated by several processes executing in the data processing environment. A subset of the set of events are tracked for an observation period, the tracking resulting in bookkeeping information about the subset of events. A pattern of events is detected in the bookkeeping information. The pattern is formed as a tuple representing a process in the several processes, the metric corresponding to the process. A prediction model is selected for the tuple. The prediction model is supplied with the tuple and executed to generate a predicted value of the metric.
    Type: Grant
    Filed: July 16, 2012
    Date of Patent: February 18, 2014
    Assignee: International Business Machines Corporation
    Inventors: Hung-yang Chang, Joachim H. Frank, Christoph Lingenfelder, Liangzhao Zeng
  • Patent number: 8655826
    Abstract: A method and a computer-readable storage medium configured with instructions that when executed to carry out the method, and a computer system configured to carry out the method. The method includes storing a set of rules in computer-interpretable form in a processing system. The rules allow the expression of a range of possibilities for determination of recognition of items of content and a wide range of actions to take when such determination is made. Using the rules, a processing system can recognize content and possibly act on the recognition results, the recognition and acting according to the stored set of rules.
    Type: Grant
    Filed: July 31, 2009
    Date of Patent: February 18, 2014
    Assignee: Motion Picture Laboratories, Inc.
    Inventors: Raymond G. Drewry, James L. Helman, Craig H. Seidel
  • Patent number: 8655827
    Abstract: A questionnaire generation process presents a first subset from a set of questions of the questionnaire and receives first answers from a user. The first answers are used to determine whether the first answers are sufficient to give definite values to conditions of first rules, wherein the first rules have conditions for providing output. When the first answers are not sufficient, the conditions of the first rules can be used to identify a second subset of the questions, wherein the second subset of questions has second answers such that a combination of the first and second answers is sufficient to give definite values to the respective conditions of the first rules, and the second subset of questions can be presented to the user.
    Type: Grant
    Filed: October 29, 2009
    Date of Patent: February 18, 2014
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Siani Pearson, Tomas Sander, Prasad V. Rao
  • Patent number: 8655828
    Abstract: A method of improving the accuracy and computation time of automatic image recognition by the implementation of association graphs and a quantum processor. A method of solving problems using a quantum processor by casting a problem as a quadratic unconstrained binary optimization (“QUBO”) problem, mapping the QUBO problem to the quantum processor, and evolving the quantum processor to produce a solution to the QUBO problem.
    Type: Grant
    Filed: October 28, 2011
    Date of Patent: February 18, 2014
    Assignee: D-Wave Systems Inc.
    Inventor: Geordie Rose
  • Patent number: 8650146
    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.
    Type: Grant
    Filed: June 24, 2010
    Date of Patent: February 11, 2014
    Assignee: LSI Corporation
    Inventors: Alexander Podkolzin, Lav Ivanovic, Anatoli Bolotov, Mikhail Grinchuk, Sergey Afonin
  • Patent number: 8645309
    Abstract: The specification describes data processes for analyzing large data steams for target anomalies. “Sequential dependencies” (SDs) are chosen for ordered data and present a framework for discovering which subsets of the data obey a given sequential dependency. Given an interval G, an SD on attributes X and Y, written as X?G Y, denotes that the distance between the Y-values of any two consecutive records, when sorted on X, are within G. SDs may be extended to Conditional Sequential Dependencies (CSDs), consisting of an underlying SD plus a representation of the subsets of the data that satisfy the SD. The conditional approximate sequential dependencies may be expressed as pattern tableaux, i.e., compact representations of the subsets of the data that satisfy the underlying dependency.
    Type: Grant
    Filed: November 30, 2009
    Date of Patent: February 4, 2014
    Assignee: AT&T Intellectual Property I. L.P.
    Inventors: Lukasz Golab, Howard Karloff, Philip Korn, Divesh Srivastava, Avishek Saha
  • Publication number: 20140032973
    Abstract: A pattern analysis system and method that is robust against errors, misalignments and failures of process that may be caused by unexpected events. By performing multiple, redundant overlapping analyses with different operating characteristics and by actively testing for disagreements and errors, the invention detects errors and either corrects them or at least eliminates their harmful effects. The invention is especially effective in highly constrained situations, such as training a model to a script that is presumed correct or recognition with a highly constrained grammar or language model. In particular, it is effective when unexpected events may be rare but disastrous when they occur. The system and method handle errors that would otherwise be undetected as well as errors that would cause catastrophic failures.
    Type: Application
    Filed: March 13, 2013
    Publication date: January 30, 2014
    Applicant: James K. Baker Revocable Trust
    Inventor: James K. BAKER
  • Publication number: 20140032472
    Abstract: 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.
    Type: Application
    Filed: July 27, 2012
    Publication date: January 30, 2014
    Applicant: SELECTICA, INC.
    Inventors: Vikram V. Kaledhonkar, Uma Maheswari Kandaswamy, Kamaljeet Ahluwalia, Lev Sigal, Rukmini Reddy Muduganti, Koptilin Pavel Vladimirovich, Yurii Logosha
  • Patent number: 8635597
    Abstract: There is described a method for determining the processing sequence of components of a function plan for a sequentially operating automation system. Each component is allocated a component code in a reversible unambiguous manner and, while the components have a signal input and output connection, these should be applicable to a number of various function plans and thus minimize the reaction time of an automation system to process signals. The above is achieved, whereby the signal path in the function plan commences at an initial component in a recursive procedure in the forward direction and returns in the backward direction.
    Type: Grant
    Filed: June 29, 2006
    Date of Patent: January 21, 2014
    Assignee: Siemens Aktiengesellschaft
    Inventor: Andreas Drebinger
  • Patent number: 8635180
    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.
    Type: Grant
    Filed: February 6, 2011
    Date of Patent: January 21, 2014
    Assignee: International Business Machines Corporation
    Inventors: Giora Biran, Christoph Hagleitner, Timothy Hume Heil, Jan Van Lunteren
  • Publication number: 20140012797
    Abstract: 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.
    Type: Application
    Filed: July 5, 2012
    Publication date: January 9, 2014
    Applicant: ORACLE INTERNATIONAL CORPORATION
    Inventors: HARI CHARAN RAMACHANDRA RAO, CHANDRASEKHAR ATLA, GOVINDA RAJ SAMBAMURTHY
  • Patent number: 8626696
    Abstract: 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.
    Type: Grant
    Filed: December 22, 2011
    Date of Patent: January 7, 2014
    Assignee: International Business Machines Corporation
    Inventor: Branimir Z. Lambov
  • Patent number: 8626695
    Abstract: One embodiment accesses a binary decision diagram (BDD) representing a function having 4 variables, variables 1, 2, 3, and 4, wherein the BDD comprises 4 layers, layers 1, 2, 3, and 4, corresponding to the 4 variables, respectively; determines an optimum variable order of the BDD by performing at most 19 layer swaps during at most 13 iterations, wherein each of 6 iterations of the at most 13 iterations comprises: determines a first size of the layers 1 and 2 and a first size of the layers 3 and 4; swaps the layers 1 and 2 and the layers 3 and 4 concurrently; determines a second size of the layers 1 and 2 and a second size of the layers 3 and 4; and determines 1 variable order among 4 variable orders obtained during the iteration that yields a smallest size among the 4 variable orders obtained during the iteration.
    Type: Grant
    Filed: October 11, 2010
    Date of Patent: January 7, 2014
    Assignee: Fujitsu Limited
    Inventors: Stergios Stergiou, Jawahar Jain
  • Patent number: 8615803
    Abstract: A method and system is designed for processing alarms, that have been triggered by a monitoring system such as an intrusion detection system, a firewall, or a network management system, comprising the steps of entering the triggered alarms into an alarm log, evaluating similarity between alarms, grouping similar alarms into alarm clusters, summarizing alarm clusters by means of generalized alarms, counting the covered alarms for each generalized alarm and forwarding generalized alarms for further processing if the number of alarms covered satisfies a predetermined criterion. In the event of high rates of alarm messages, possibly containing many false alarms, a system administrator will therefore not be confronted with a flood of messages with little significance. Instead, only generalized alarms, more meaningful and smaller in number, are presented.
    Type: Grant
    Filed: June 19, 2008
    Date of Patent: December 24, 2013
    Assignee: International Business Machines Corporation
    Inventors: Marc Dacier, Klaus Julisch
  • Publication number: 20130339288
    Abstract: 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.
    Type: Application
    Filed: June 19, 2012
    Publication date: December 19, 2013
    Applicant: Microsoft Corporation
    Inventors: Charles Lamanna, Mauktik Gandhi, Andrey Shur, Abhijat Kanade, Jeffrey Brown, Robledo Pontes-Filho