Having Specific Pattern Matching Or Control Technique Patents (Class 706/48)
  • Patent number: 7788641
    Abstract: A system (and method) for identifying concerns includes a specifying device for specifying at least one initial concern, and an identifying device for identifying at least one related concern having a relationship with at least one initial concern.
    Type: Grant
    Filed: March 17, 2004
    Date of Patent: August 31, 2010
    Assignee: International Business Machines Corporation
    Inventors: Peri L. Tarr, Harold L. Ossher, Stanley M. Sutton, Jr., William H. Harrison
  • Patent number: 7788205
    Abstract: A plurality of stochastic models is built that predict the probabilities of state transitions for components in a complex system. The models are trained using output observations from the system at runtime. The overall state and health of the system can be determined at runtime by analyzing the distribution of current component states among the possible states. Subsequent to a low level component failure, the state transition probability stochastic model for the failed component can be analyzed by uncovering the previous states at N time intervals prior to the failure. The resulting state transition path for the component can be analyzed for the causes of the failure. Additionally, component failures resulting from the failure, or worsening state transition, in other components can be diagnosed by uncovering the previous states at the N times prior to the failure for multiple components in the system and then analyzing the state transition paths for correlations to the failed component.
    Type: Grant
    Filed: May 12, 2006
    Date of Patent: August 31, 2010
    Assignee: International Business Machines Corporation
    Inventors: Nanchariah Raghuveera Chalasani, Ajamu A. Wesley, Javed Rahman, Balan Subramanian
  • Patent number: 7788206
    Abstract: Compressing state transition instructions may achieve a reduction in the binary instruction footprint of a state machine. In certain embodiments, the compressed state transition instructions are used by state machine engines that use one or more caches in order to increase the speed at which the state machine engine can execute a state machine. In addition to reducing the instruction footprint, the use of compressed state transition instructions as discussed herein may also increase the cache hit rate of a cache-based state machine engine, resulting in an increase in performance.
    Type: Grant
    Filed: April 30, 2008
    Date of Patent: August 31, 2010
    Assignee: LSI Corporation
    Inventors: Robert James McMillen, Michael D. Ruehle
  • Patent number: 7788198
    Abstract: A strategy is described for detecting anomalies in the operation of a data processing environment. The strategy relies on parameter information to detect the anomalies in a detection operation, the parameter information being derived in a training operation. The parameter information is selected such that the detection of anomalies is governed by both a desired degree of sensitivity (determining how inclusive the detection operation is in defining anomalies) and responsiveness (determining how quickly the detection operation reports the anomalies). The detection operation includes specific algorithms for determining undesired trending and spiking in the performance data.
    Type: Grant
    Filed: December 14, 2006
    Date of Patent: August 31, 2010
    Assignee: Microsoft Corporation
    Inventors: Yaodong Liu, Cary L. Mitchell, John Dunagan, Dana K. Fujimoto
  • Publication number: 20100217572
    Abstract: The invention relates to a method for the automatic pattern recognition in a sequence of electronic data by means of a electronic data processing in a data processing system, during which the sequence of electronic data is compared with parameterised model data representing at least one sample sequence, in an analysis and where at least one sample sequence is recognised if training data is processed to a set of characteristic vectors of the same length and with the same information content, from which the parameterised model data is derived, by means of a dynamic time warping method during the formation of the parameterised model data, if it has been established during the analysis that the model data enclosed by the parameterised model data, which are allocated to at least one sample sequence, occurs with a level of similarity exceeding the similarity threshold.
    Type: Application
    Filed: July 31, 2008
    Publication date: August 26, 2010
    Applicant: TECHNISCHE UNIVERSITAT BERLIN
    Inventors: Clemens Guhmann, Steffen Kuhn
  • Publication number: 20100217737
    Abstract: computer software and method for managing business rules that can include creating a business rule and storing it on a disk or in a database or rule archive. The rules can be expressed in natural language, keywords, equations, or any other form. The invention also includes the ability to search for rules, edit rules and validate rules according to business various business rule patterns or predetermined validation criteria. As stated, rules can be created from keywords or expressed directly in natural language. There is no need to parse a rule for content since whether a rule can actually be coded can be decided by a coding group. Rules can be marked active or inactive and edited rules can be marked with version tracking. An optional feature of the invention is to send a message to everyone in an organization affected by a rule when it has been changed.
    Type: Application
    Filed: February 20, 2009
    Publication date: August 26, 2010
    Inventor: Ajay Shama
  • Patent number: 7783588
    Abstract: A context modeling architecture that includes a context representation portion, which adapted to represent context as features, is provided. The features are specifiable at runtime of an application including the context representation portion.
    Type: Grant
    Filed: October 19, 2005
    Date of Patent: August 24, 2010
    Assignee: Microsoft Corporation
    Inventors: William D. Ramsey, Jianfeng Gao, Sanjeev Katariya
  • Patent number: 7779156
    Abstract: Methods and systems for operation upon one or more data processors for efficiently processing communications based upon reputation of an entity associated with the communication.
    Type: Grant
    Filed: January 24, 2007
    Date of Patent: August 17, 2010
    Assignee: McAfee, Inc.
    Inventors: Dmitri Alperovitch, Sven Krasser, Paul Judge, Lamar Lorenzo Willis
  • Publication number: 20100205135
    Abstract: A method for creating and operating a database for determining the best match of a plurality of rules comprising wildcards and character strings with an input text string.
    Type: Application
    Filed: March 7, 2008
    Publication date: August 12, 2010
    Applicant: BARRACUDA INC.
    Inventor: Subrahmanyam ONGOLE
  • Publication number: 20100205293
    Abstract: The subject innovation relates to systems and/or methodologies for comprehensive policy based service delivery. A policy plane is provided as a comprehensive way to manage operator policies for most all IP and/or service flows (e.g., IMS and non-IMS) under varying network conditions, while keeping in view user preferences, user subscriptions, service requirements, terminal capabilities (e.g., including converged terminals), network capabilities (e.g., 3gpp and non-3gpp accesses inter-working with 3gpp), session transfer policies, service aware roaming, and so forth. The policy plane can be generated through harmonization of existing components (e.g., discussed infra), and creation of new policy aspects where desired (e.g., policies for identity and charging management in personal area network, etc.). The policy plane works to close gaps between standards, operator requirements, and user requirements.
    Type: Application
    Filed: May 19, 2009
    Publication date: August 12, 2010
    Applicant: AT&T MOBILITY II LLC
    Inventors: Q. James Hu, Farooq Bari
  • Publication number: 20100204923
    Abstract: A method for selecting the most accurate lie detection method from a group of methods, the method includes the steps of: (a) collecting the results from different methods of conducting lie detection tests; (b) plotting the results on a polar graph; c) computing the “random chance” point on the graph for each method's results; (d) fitting a quadratic curve to the defined points for each method; (e) computing the area beneath each method's curve; (f) mapping the area to a log-base-2 score; and (g) choosing as the most accurate method the method with a higher log-base-2 score.
    Type: Application
    Filed: February 9, 2010
    Publication date: August 12, 2010
    Inventor: Bruce Alan White
  • Publication number: 20100192225
    Abstract: In general, techniques are described for efficiently implementing application identification within network devices. In particular, a network device includes a control unit that stores data defining a group Deterministic Finite Automata (DFA) and an individual DFA. The group DFA is formed by merging non-explosive DFAs generated from corresponding non-explosive regular expressions (regexs) and fingerprint DFAs (f-DFAs) generated from signature fingerprints extracted from explosive regexs. The non-explosive regexs comprise regexs determined not to cause state explosion during generation of the group DFA, the signature fingerprints comprise segments of explosive regexs that uniquely identifies the explosive regexs, and the explosive regexs comprise regexs determined to cause state explosion during generation of the group DFA.
    Type: Application
    Filed: January 28, 2009
    Publication date: July 29, 2010
    Applicant: Juniper Networks, Inc.
    Inventors: Qingming Ma, Bryan Burns, Ricardo Oliveira
  • Patent number: 7761400
    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.
    Type: Grant
    Filed: July 21, 2006
    Date of Patent: July 20, 2010
    Inventor: John Reimer
  • Publication number: 20100179671
    Abstract: A system, method, and computer readable-media for creating a stable synthetic neural system. The method includes training an intellectual choice-driven synthetic neural system (SNS), training an emotional rule-driven SNS by generating emotions from rules, incorporating the rule-driven SNS into the choice-driven SNS through an evolvable interface, and balancing the emotional SNS and the intellectual SNS to achieve stability in a nontrivial autonomous environment with a Stability Algorithm for Neural Entities (SANE). Generating emotions from rules can include coding the rules into the rule-driven SNS in a self-consistent way. Training the emotional rule-driven SNS can occur during a training stage in parallel with training the choice-driven SNS. The training stage can include a self assessment loop which measures performance characteristics of the rule-driven SNS against core genetic code.
    Type: Application
    Filed: January 14, 2009
    Publication date: July 15, 2010
    Applicant: NATIONAL AERONAUTICS AND SPACE ADMINISTRATION
    Inventor: Steven A. Curtis
  • Publication number: 20100179928
    Abstract: A system and method 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.
    Type: Application
    Filed: January 12, 2010
    Publication date: July 15, 2010
    Applicant: AlphaTRAC. Inc.
    Inventor: Charles Reed Hodgin
  • Patent number: 7752153
    Abstract: Detailed herein is a technology which, among other things, provides for forward chaining in a ruleset. In one approach to this technology, a first rule is examined, to identifying a data object associated with it. A second rule is identified, also associated with the data object. The relationship between the two rules is determined, where execution of the second rule will modify the data object, which, in turn, will alter the outcome of the first rule.
    Type: Grant
    Filed: August 29, 2006
    Date of Patent: July 6, 2010
    Assignee: Microsoft Corporation
    Inventors: Jurgen A. Willis, Donald J. McCrady, John A. Rummell
  • Patent number: 7743011
    Abstract: In a weighted finite state network process, a finite state network object is stored. The finite state network object includes arcs, and each arc has an associated weight stored as a weight-defining finite state network object. The finite state network object is applied to an input. The applying includes combining weights of one or more arcs matching the input using finite state network-combining operations.
    Type: Grant
    Filed: December 21, 2006
    Date of Patent: June 22, 2010
    Assignee: Xerox Corporation
    Inventor: Kenneth R. Beesley
  • Patent number: 7734560
    Abstract: A computer-implemented method, system, and computer program product for generating an application is disclosed. A pattern module associated with an application pattern is provided. The pattern module includes a model of the application pattern, a design time component to provide content for the model, and a runtime component to execute the operation associated with the model based with the content. A set of dependencies among the model, the design time component, and the runtime component is determined. A set of interfaces is then generated to couple the model, the design time component, and the runtime component based on the set of dependencies.
    Type: Grant
    Filed: August 23, 2006
    Date of Patent: June 8, 2010
    Assignee: SAP AG
    Inventors: Frank Seeger, Markus Cherdron, Holger Koser, Ulf Fildebrandt, Markus Muenkel, Jade Sripad
  • Publication number: 20100138418
    Abstract: A method and apparatus for reproducing content by using metadata are provided. In the method, a metadata file and a content file are obtained, wherein the metadata file comprises at least one of learned content reproduction pattern information and reproduction management information; the content file is reproduced based on the at least one of the learned content reproduction pattern information and the reproduction management information of the metadata file; and the metadata file is updated based on the at least one of the learned content reproduction pattern information and the reproduction management information.
    Type: Application
    Filed: November 27, 2009
    Publication date: June 3, 2010
    Applicant: SAMSUNG ELECTRONICS CO., LTD.
    Inventors: Sun-hee YOUM, Ju-hee SEO, Seung-ji YANG, Hwa-jung KIM, Woo-sung SHIM
  • Publication number: 20100138375
    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.
    Type: Application
    Filed: December 1, 2008
    Publication date: June 3, 2010
    Applicant: THE BOEING COMPANY
    Inventors: Brian D. Hanner, Jason Amanatullah, Timothy Chung-Ming Wu
  • Publication number: 20100131800
    Abstract: A diagnostic device which detects a fault and estimates its cause on the basis of the degree of variation of each attribute of data containing a plurality of attributes obtained by measuring a diagnosis subject. A diagnosis subject variation degree pattern generation means (110) calculates the degree of variation of each attribute of the diagnosis subject data containing the attributes obtained by measuring the diagnosis subject and generates a diagnosis subject variation degree pattern which is a combination of the degrees of variation of the attributes. A reference variation degree pattern storage device (150) stores a reference variation degree pattern composed of the degrees of variation of the attributes in association with the type of the fault and the diagnosis event of the type of the cause.
    Type: Application
    Filed: March 21, 2008
    Publication date: May 27, 2010
    Applicant: NEC CORPORATION
    Inventors: Ryohei Fujimaki, Takayuki Nakata, Akinori Satou, Hidenori Tsukahara
  • Patent number: 7725407
    Abstract: Embodiments herein provide a method, computer program product, etc. of measuring a large population of web pages for compliance to content standards that require human judgment to evaluate. The method performs an automated analysis of a web space, comprising gathering information about structure and content of the web space. The performing of the automated analysis further comprises creating first data and second data. Specifically, the creating of the first data comprises creating page-relationship data based on a directory tree structure of servers in the web space or link distances amongst pages in the web space. The creating of the second data comprises analyzing web page content, comprising creating compliance-indicating data and/or content structure data for pages in the web space. In addition, the performing of the automated analysis can comprise performing the automated analysis on a web space that lacks objective standards violations that can be identified using software.
    Type: Grant
    Filed: February 27, 2006
    Date of Patent: May 25, 2010
    Assignee: International Business Machines Corporation
    Inventors: P Matthew Bronstad, Matthew C King, James Thatcher
  • Patent number: 7720786
    Abstract: A system and method of identifying loose patterns using a smart multiset intersection operation are provided. Data segments are received from a data segmentation algorithm and sorted into corresponding multisets. A retain operation may be performed on the multisets. A normalization operation is then performed on the repeating elements in the multisets to identify the loose pattern. The loose pattern is stored in a database.
    Type: Grant
    Filed: May 25, 2007
    Date of Patent: May 18, 2010
    Assignee: Samsung Electronics Co., Ltd.
    Inventor: Kong Posh Bhat
  • Publication number: 20100117683
    Abstract: Enabling scheduling of single cycle as well as scheduling multi-cycle rules in a synchronous digital system whose behavior is governed by an asynchronous system specification (e.g., a TRS) provides a way to allow complex actions at state transitions of the asynchronous system without requiring that the complex actions be synthesized in logic that must be performed in a single clock cycle. For example, a relatively infrequent action may include a critical timing path that determines the maximum clock frequency of the system. By allowing that infrequent action to take multiple clock cycles, even if that action takes more absolute time, other actions may take less absolute time by virtue of being able to operate the synchronous system at a higher clock rate. The overall system may then operate more quickly (e.g., as measured by the average number of rules applied per unit of absolute time).
    Type: Application
    Filed: November 9, 2009
    Publication date: May 13, 2010
    Applicant: Massachusetts Institute of Technology
    Inventors: Michal Karczmarek, Arvind Mithal, Muralidaran Vijayaraghavan
  • Patent number: 7716153
    Abstract: Methods and systems for enhancing and/or improving one's memory are disclosed. In one embodiment of the invention, a computer-implemented memory assistance system is comprised of a client and a memory assistance server. The memory assistance server includes a signal processing server to receive and process media signals (e.g., audio, video, or photographs) and associated data received from the client. The signal processing server includes a variety of servers or services for processing signals and/or data. Each signal processing server or service identifies characteristics of the received media signal that are relevant to aiding a user in recalling and/or reinforcing an existing memory of a particular event or fact. In addition, the memory assistance server includes presentation logic to generate one or more media clips from the received media signal.
    Type: Grant
    Filed: November 15, 2006
    Date of Patent: May 11, 2010
    Assignee: Reqall, Inc.
    Inventor: Sunil Vemuri
  • Patent number: 7716155
    Abstract: Techniques are disclosed for predicting the future behavior of data streams through the use of current trends of the data stream. By way of example, a technique for predicting the future behavior of a data stream comprises the following steps/operations. Statistics are obtained from the data stream. Estimated statistics for a future time interval are generated by using at least a portion of the obtained statistics. A portion of the estimated statistics are utilized to generate one or more representative pseudo-data records within the future time interval. Pseudo-data records are utilized for forecasting of at least one characteristic of the data stream.
    Type: Grant
    Filed: June 10, 2008
    Date of Patent: May 11, 2010
    Assignee: International Business Machines Corporation
    Inventor: Charu C. Aggarwal
  • Publication number: 20100114652
    Abstract: An automated computer system for generating a geographically-localized media plan including a number of selected media buyable units (MBUs) is provided. The system implements the following functions: receiving client-defined information and a number of business rules; receiving a number of MBUs each having a relative value and including a first and second MBU associated with a first media product option and a third and fourth MBU associated with a second media product option; applying an optimization algorithm to the client-defined information, the number of business rules and the number of MBU relative values to obtain a number of selected MBUs included in a geographically-localized media plan; and outputting the geographically-localized media plan for use by a client in media planning. The first MBU associated with a first geography.
    Type: Application
    Filed: October 31, 2008
    Publication date: May 6, 2010
    Applicant: VALASSIS COMMUNICATIONS, INC.
    Inventors: Daniel D. Sherr, Mary Rainer Stewart, Debra L. Donohue, Lucy Miller Clark, Emily A. Westfall, Karen F. Kula, Therese Mulvey, Chris Kaul, Alireza Jahan Parvar, Erin E. O'Loughlin, Steve Worona, Nancy E. Curmi, Karen Strnad
  • Publication number: 20100114811
    Abstract: A method and system for direct construction of a minimal deterministic finite state machine corresponding to a regular expression are provided. The method includes providing a regular expression represented as a regular expression tree with nodes of operators and leaves of elementary character transitions and traversing the regular expression tree recursively to build minimal finite state automata (FSAs) corresponding to the branches of the tree, wherein the FSAs end in a specified tail automaton. The operators are concatenation, alternation, and Kleene closure. A concatenation operation is performed by recursive construction in reverse order wherein each automaton built becomes the tail for the preceding argument of the operation. An alternation operation is performed by recursively building automata corresponding to the arguments of the operation with the same tail and merging them.
    Type: Application
    Filed: October 31, 2008
    Publication date: May 6, 2010
    Inventor: Branimir Lambov
  • Patent number: 7707135
    Abstract: A method of implicitly forming a context in a dialogue with a computer includes forming megacategories linking one or more attributes to one of a plurality of response templates. The method also includes determining a megacategory by comparing attributes having true variables from a previous input to attributes having true variables in the present input and selecting an appropriate response template corresponding to the megacategory.
    Type: Grant
    Filed: March 4, 2003
    Date of Patent: April 27, 2010
    Assignee: Kurzweil Technologies, Inc.
    Inventors: Matthew Bridges, Raymond C. Kurzweil
  • Patent number: 7702601
    Abstract: An expert system is used to recommend a customized solution for a customer. The expert system includes a set of scenarios each of which includes default facts and is associated with a detailed rule base that when applied in isolation to the default facts fully determines a prototype solution. A particular scenario is selected from the set based at least on user input. A customized solution is generated by applying the detailed rule base associated with the particular scenario to facts based at least on the user input and any default facts of the particular scenario that complement and do not conflict with the facts that are based at least on the user input. The customized solution is iteratively refined.
    Type: Grant
    Filed: December 7, 2006
    Date of Patent: April 20, 2010
    Assignee: International Business Machines Corporation
    Inventors: Peter C. Boyle, Alexander K. MacAulay
  • Patent number: 7698294
    Abstract: A content object indexing process including creating a content object knowledge index, calculating a description vector of a target content object, and indexing the target content object by searching for the description vector in the content object knowledge database. It may be difficult to search for an exact content object such as a music file or academic researcher as a conventional search index may not include related hierarchical information. A content object indexing process may add hierarchical information taken from a content object knowledge index and incorporate the hierarchical information to the index entry for a specific content object. An application of such a content object indexing process may be a world wide web search engine.
    Type: Grant
    Filed: January 11, 2006
    Date of Patent: April 13, 2010
    Assignee: Microsoft Corporation
    Inventors: Wei-Ying Ma, Lie Lu, Ji-Rong Wen, Zhiwei Li, Zaiqing Nie, Hsiao-Wuen Hon
  • Publication number: 20100088266
    Abstract: The invention provides, in one aspect, a method of finding a rule in a rules base that includes a plurality of rule entries, each having a rule and an associated objective and one or more associated circumstances. A rule finder accesses the rules base in response to a request, with a specified objective and with specified circumstances, by searching the rules base for a matching entry. Where the search fails, the rule finder searches one or more translation tables for entries having first circumstances matching those specified in the request that resulted in the failure. If found, the rule finder repeats the search of the rules base with the specified objective and with a second (or “map-to”) circumstances from matching entries in the translation tables. The rule finder can return, e.g., to an application program that issued the request, a rule found during that repeat search of the rules base.
    Type: Application
    Filed: November 16, 2009
    Publication date: April 8, 2010
    Applicant: PEGASYSTEMS INC.
    Inventor: Alan Trefler
  • Patent number: 7693810
    Abstract: A computer based method and system generates alerts based on the detection of an advanced scenario in a data set. The system and method may take data related to events and entities, transform the data, and apply advanced scenarios to the data to produce matches that reflect the occurrence of an advanced scenario and the behavior of interest. The advanced scenarios can be defined to cover specific product lines and services, lines of businesses, and combinations thereof. The advanced scenarios can be defined to be indicative of a behavior class, or a specific behavior which is part of a behavior class. Alerts produced by the system can be grouped, prioritized and routed such that the appropriate users are notified in a timely manner. The system and method can be applied to a variety of industries including financial and health care, and can detect both illicit and licit behaviors of interest.
    Type: Grant
    Filed: March 4, 2003
    Date of Patent: April 6, 2010
    Assignee: Mantas, Inc.
    Inventors: Steven Kirk Donoho, Tomasz Grzegorz Dybala, James Joseph Hayden, Linda Hagen Grote, William Edgar Brooks, Jr.
  • Publication number: 20100076919
    Abstract: A method of pattern matching is provided, including: determining whether there is flow status information corresponding to a current pattern for a transmission flow to which a current segment belongs; if yes, performing pattern matching for the current segment by taking the flow status information as assistant information of the pattern matching; otherwise, creating the flow status information corresponding to the current pattern for the transmission flow and performing pattern matching for the current segment by taking the flow status information as assistant information of the pattern matching. An apparatus of pattern matching is also provided, including a flow status information configuration module and a pattern matching processing module. The solution of the present invention can avoid the defects caused by flow-reassembly.
    Type: Application
    Filed: November 16, 2007
    Publication date: March 25, 2010
    Applicant: HANGZHOU H3C TECHNOLOGIES CO. LTD.
    Inventors: Zhongliang Chen, Lida Zhang
  • Publication number: 20100076981
    Abstract: A method and apparatus for efficient indexed storage for unstructured content have been disclosed.
    Type: Application
    Filed: November 30, 2009
    Publication date: March 25, 2010
    Applicant: Nahava Inc.
    Inventor: Russell T. Nakano
  • Publication number: 20100070450
    Abstract: A method of building a data integration environment is provided. According to one embodiment of the invention as applied to a computer network, the method comprising: identifying the data integration environment and the policies that apply to it, negotiating with the environment, and generating a new interface rule set enabling information to be passed in dependence thereon between the system which is made part of the integration environment and the integration environment. The method can be usefully applied in UAV networks, robot networks as well as in networks of fixed sensors. The invention finds utility in various important applications such as in network-enabled capability and in rapid integration of systems.
    Type: Application
    Filed: October 31, 2007
    Publication date: March 18, 2010
    Inventor: Sean Michael Barker
  • Publication number: 20100070449
    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.
    Type: Application
    Filed: September 12, 2008
    Publication date: March 18, 2010
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: William C. Arnold, Tamar Eilam, Michael H. Kalantar, Alexander V. Konstantinou, Alexander A. Totok
  • Publication number: 20100063952
    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.
    Type: Application
    Filed: August 31, 2009
    Publication date: March 11, 2010
    Applicant: Sony Computer Entertainment Inc.
    Inventors: Akira Sassa, Katsu Saito, Makoto Akabane
  • Patent number: 7676444
    Abstract: A search engine for selectively perform iterative compare operations between a searchable pattern and S overlapping substrings of an input string of characters includes a memory for storing a bitmap having S next success size (NSS) bits, wherein each NSS bit indicates whether an associated substring including a corresponding unique number of the input characters is to be compared with the searchable pattern in successive compare operations, and includes a compare circuit for selectively performing the successive compare operations in response to the NSS bits.
    Type: Grant
    Filed: March 21, 2007
    Date of Patent: March 9, 2010
    Assignee: NetLogic Microsystems, Inc.
    Inventors: Srinivasan Venkatachary, Pankaj Gupta
  • Publication number: 20100058313
    Abstract: A method, computer program product, and system for updating a computer system may include collecting data describing usage characteristics on a customer computer system. Available updates may be stored on a support system together with one or more relevant rules. A recommendation engine may be used to analyze the data describing usage characteristics and to recommend one or more changes based on evaluation of one or more relevant rules for each available update. Changes having one or more attributes and one or more successor relationships to recommend for installation in the computer system may be selected.
    Type: Application
    Filed: August 11, 2009
    Publication date: March 4, 2010
    Inventors: Uwe Hansmann, Klaus Rindtorff
  • Patent number: 7672986
    Abstract: A public graphic library coupled to a WAN offers access to a database of graphics, while another graphic library inside the firewall of an enterprise network provides graphics to users in an enterprise. Transferring graphics from the public graphic library to the enterprise graphic library enables enterprise users to access content residing on the public graphic library while the enterprise network is disconnected or otherwise isolated from the WAN. A remote library director in a drawing software program directs communication between a user computer and either the public graphic library or the enterprise graphic library. The configuration of this director specifies the library from which a user accesses graphics.
    Type: Grant
    Filed: February 12, 2004
    Date of Patent: March 2, 2010
    Assignee: Microsoft Corporation
    Inventors: Brent Gilbert, Mai-lan Tomsen Bukovec, Owen Edwards, Cynthia Christine Shelly
  • Publication number: 20100050269
    Abstract: Whether a combination method defined in an output rule satisfies a combination condition of each content specified in a play list is judged in order of priority defined in a priority list. Based on the judgment result, the output rule is edited in such a manner that the combination condition of each content specified in the play list is satisfied. The resources of the combination target contents specified in the play list are combined in accordance with the combination method of the edited output rule.
    Type: Application
    Filed: August 21, 2009
    Publication date: February 25, 2010
    Inventors: Kenji Odaka, Yoshiki Terashima, Satoshi Ozaki, Shirou Wakayama, Keiichi Teramoto, Eiji Tokita
  • Publication number: 20100050085
    Abstract: A system and method for obtaining and deriving medical data related to patient inspiratory and cxpiratory flows and for displaying the data. A data acquisition processor acquires patient medical data related to inspiratory and expiratory volume from a ventilator. A data processor maps the data related to inspiratory and expiratory flow onto a flow data object. A display displays the flow data object comprising inspiratory objects for displaying information representative of the inspiratory flow and expiratory objects for displaying information representative of the expiratory flow.
    Type: Application
    Filed: September 28, 2007
    Publication date: February 25, 2010
    Applicant: DRAEGER MEDICAL SYSTEMS, INC.
    Inventors: George T. Blike, M. Christina De Mur
  • Patent number: 7668664
    Abstract: A computer-implemented method as follows. Providing a list of target sequences associated with one or more organisms. Providing a list of candidate prototype sequences suspected of hybridizing to one or more of the target sequences. Generating a collection of probes corresponding to each candidate prototype sequence, each collection of probes having a set of probes for every subsequence. The sets consist of the corresponding subsequence and every variation of the corresponding subsequence formed by varying a center nucleotide of the corresponding subsequence. Generating a set of fragments corresponding to each target sequence. Calculating the binding free energy of each fragment with a perfect complimentary sequence of the fragment. Determining which extended fragments are perfect matches to any of the probes. Assembling a base call sequence corresponding to each candidate prototype sequence.
    Type: Grant
    Filed: August 22, 2007
    Date of Patent: February 23, 2010
    Assignee: The United States of America as represented by the Secretary of the Navy
    Inventors: Anthony P. Malanoski, Zheng Wang, Baochuan Lin, David A Stenger, Joel M Schnur
  • Patent number: 7668796
    Abstract: Systems, methods and apparatus are provided through which in some embodiments, automata learning algorithms and techniques are implemented to generate a more complete set of scenarios for requirements based programming. More specifically, a CSP-based, syntax-oriented model construction, which requires the support of a theorem prover, is complemented by model extrapolation, via automata learning. This may support the systematic completion of the requirements, the nature of the requirement being partial, which provides focus on the most prominent scenarios. This may generalize requirement skeletons by extrapolation and may indicate by way of automatically generated traces where the requirement specification is too loose and additional information is required.
    Type: Grant
    Filed: September 28, 2006
    Date of Patent: February 23, 2010
    Assignee: The United States of America as represented by the Administrator of the National Aeronautics and Space Administration
    Inventors: Michael G. Hinchey, Tiziana Margaria, James L. Rash, Christopher A. Rouff, Bernard Steffen
  • Patent number: 7668795
    Abstract: A data analyzer stores data values at any one of N stages while associating the data values with a plurality of data elements respectively and stores association weighting information among the data elements, selects one of the data elements as a target data at random and computes an input stimulus value concerned with the target data on the basis of the association weighting information between the target data and the other data elements and the data values of the other data elements, and updates the data value of the target data on the basis of the computed input stimulus value in such a manner that a threshold decided in accordance with a current data value associated with the target data and varying according to each data value is compared with the input stimulus value to determine whether the data value needs to be changed or not, and that the data value is updated when a decision is made that the data value needs to be changed.
    Type: Grant
    Filed: August 29, 2005
    Date of Patent: February 23, 2010
    Assignee: Fuji Xerox Co., Ltd.
    Inventors: Hiroshi Okamoto, Yukihiro Tsuboshita
  • Patent number: 7664713
    Abstract: A method and apparatus based on transposition to speed up learning computations on sparse data are disclosed. For example, the method receives an support vector comprising at least one feature represented by one non-zero entry. The method then identifies at least one column within a matrix with non-zero entries, wherein the at least one column is identified in accordance with the at least one feature of the support vector. The method then performs kernel computations using successive list merging on the at least one identified column of the matrix and the support vector to derive a result vector, wherein the result vector is used in a data learning function.
    Type: Grant
    Filed: December 31, 2006
    Date of Patent: February 16, 2010
    Assignee: AT&T Corp.
    Inventor: Patrick Haffner
  • Patent number: 7664570
    Abstract: The safety in robotic operations is enhanced and the floor space in a factory or the like is effectively utilized. A virtual safety barrier 50 including the trajectory of movement of a work or tool 7 mounted on a wrist 5 of a robot 1 in operation is defined in a memory. At least two three-dimensional spatial regions S (S1 to S3) including a part of the robot including the work or tool are defined. Predicted positions of the defined three-dimensional spatial regions obtained by trajectory calculations are matched with the virtual safety barrier 50, and if the predicted position of any one of the defined three-dimensional spatial regions based on trajectory calculations is included in the virtual safety barrier 50, a control is effected to stop the movement of the robot arms 3 and 4.
    Type: Grant
    Filed: April 22, 2004
    Date of Patent: February 16, 2010
    Assignee: Toyota Jidosha Kabushiki Kaisha
    Inventors: Kazutsugu Suita, Morihiko Okura
  • Publication number: 20100036790
    Abstract: Automated facet analysis of input information selected from a domain of information in accordance with a source data structure is described. Facet analysis may proceed by discovering at least one of facets, facet attributes, and facet attribute hierarchies of the input information using pattern augmentation and statistical analyses to identify patterns of facet attribute relationships in the input information.
    Type: Application
    Filed: September 9, 2009
    Publication date: February 11, 2010
    Applicant: Primal Fusion, Inc.
    Inventors: Peter SWEENEY, Zhengrong YAO
  • Patent number: 7660779
    Abstract: The present invention provides a unique system and method that can employ machine learning techniques to automatically fill one or more fields across a diverse array of web forms. In particular, one or more instrumented tools can collect input or entries of form fields. Machine learning can be used to learn what data corresponds to which fields or types of fields. The input can be sent to a central repository where other databases can be aggregated as well. This input can be provided to a machine learning system to learn how to predict the desired outputs. Alternatively or in addition, learning can be performed in part by observing entries and then adapting the autofill component accordingly. Furthermore, a number of features of database fields as well as constraints can be employed to facilitate assignments of database entries to form values—particularly when the web form has never been seen before by the autofill system.
    Type: Grant
    Filed: May 12, 2004
    Date of Patent: February 9, 2010
    Assignee: Microsoft Corporation
    Inventors: Joshua T Goodman, Carl M Kadie, David M Chickering, Donald E Bradford, Dane A Glasgow