Patents by Inventor Prashant Parikh

Prashant Parikh has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20120084258
    Abstract: A computer implemented method includes monitoring blocks of data on a storage device that are changing as the computer operates. On detecting a computer shut down event, a copy of changes to the monitored blocks are saved. Upon startup of the computer, a backup of the changed blocks of data is performed.
    Type: Application
    Filed: October 4, 2010
    Publication date: April 5, 2012
    Applicant: Computer Associates Think, Inc.
    Inventors: Pratap Karonde, Prashant Parikh
  • Publication number: 20120016841
    Abstract: A system and method include creating a full backup copy of selected data from a storage device. A series of incremental backups are created over time following the creation of the full backup copy. The oldest incremental backup is merged into the full backup at a desired time.
    Type: Application
    Filed: July 16, 2010
    Publication date: January 19, 2012
    Applicant: Computer Associates Think, Inc.
    Inventors: Pratap Karonde, Prashant Parikh
  • Patent number: 7991784
    Abstract: A method, performed in a character entry system involves computing contextual associations between multiple character strings based upon occurrence of character strings relative to each other in documents present in the system, wherein the computing contextual associations involves i) identifying pertinent documents present in the system, ii) creating a list of character strings contained within documents in the system; and iii) creating an interrelationship between the character strings to contents of the system; in response to the user inputting a specified threshold of individual characters, identifying at least one selectable character string from among the character strings used in creating the computed contextual associations that can complete the incomplete input character string in context; providing the identified at least one selectable character string to a user for selection; and receiving, in the system, the user's selection and completing the incomplete input character string based upon the sele
    Type: Grant
    Filed: November 20, 2009
    Date of Patent: August 2, 2011
    Inventor: Prashant Parikh
  • Patent number: 7689617
    Abstract: A method performed in a system involves, at a node within the system, receiving an input from a user, determining that the input contains an unknown word, presenting at least one response to the user, and based upon at least one additional input from the user, learning one or more associations for the unknown word.
    Type: Grant
    Filed: February 24, 2006
    Date of Patent: March 30, 2010
    Inventor: Prashant Parikh
  • Publication number: 20100070855
    Abstract: A method, performed in a character entry system involves computing contextual associations between multiple character strings based upon occurrence of character strings relative to each other in documents present in the system, wherein the computing contextual associations involves i) identifying pertinent documents present in the system, ii) creating a list of character strings contained within documents in the system; and iii) creating an interrelationship between the character strings to contents of the system; in response to the user inputting a specified threshold of individual characters, identifying at least one selectable character string from among the character strings used in creating the computed contextual associations that can complete the incomplete input character string in context; providing the identified at least one selectable character string to a user for selection; and receiving, in the system, the user's selection and completing the incomplete input character string based upon the sele
    Type: Application
    Filed: November 20, 2009
    Publication date: March 18, 2010
    Inventor: Prashant Parikh
  • Patent number: 7630980
    Abstract: A method, performed in a character entry system, for interrelating character strings so that incomplete input character strings can be completed by a selection of a presented character string involves computing contextual associations between multiple character strings based upon co-occurrence of character strings relative to each other in documents present in the character entry system, in response to inputting of a specified threshold of individual characters, identifying at least one selectable character string from among the computed contextual associations that can compete the incomplete input character string in context; and providing the identified at least one selectable character string to a user for selection.
    Type: Grant
    Filed: January 21, 2005
    Date of Patent: December 8, 2009
    Inventor: Prashant Parikh
  • Publication number: 20090228680
    Abstract: A method comprises obtaining a plurality of variable size chunks of data, calculating a first hash for each variable size chunk of data, determining a length representation for each variable size chunk of data, determining a second hash of a subset of each variable size chunk of data, and forming a signature of each variable size chunk of data that is comprised of the first hash, the length representation and the second hash.
    Type: Application
    Filed: May 30, 2008
    Publication date: September 10, 2009
    Applicant: CA, Inc.
    Inventors: Chandra Reddy, Pratap Karonde, Prashant Parikh
  • Publication number: 20090228484
    Abstract: A computer implemented method and system obtains current signatures of data chunks and performs a proximity search of a library of previous signatures as a function of the likely location of corresponding data chunks. A full search of the library of previous signatures for those current signatures not found in the proximity search is also performed.
    Type: Application
    Filed: May 30, 2008
    Publication date: September 10, 2009
    Applicant: CA, Inc.
    Inventors: Chandra Reddy, Prashant Parikh, Liqiu Song
  • Publication number: 20090228522
    Abstract: A system and method obtain a set of data and identify successive subsets of data within the set of data. A boundary identifying hash is calculated on a subset of data and compared with a boundary indicating value. If the calculated boundary identifying hash matches the boundary indicating value, a natural boundary is identified in the set of data.
    Type: Application
    Filed: May 30, 2008
    Publication date: September 10, 2009
    Applicant: CA, Inc.
    Inventors: Chandra Reddy, Pratap Karonde, Prashant Parikh
  • Publication number: 20090228533
    Abstract: A system and method include selecting a file for potential backing up. A metadata signature is calculated on the selected file. The metadata signature of the selected file is compared to a metadata signature of a corresponding file already backed up. The file is only backed up the file if the signatures do not match.
    Type: Application
    Filed: May 30, 2008
    Publication date: September 10, 2009
    Applicant: CA, Inc.
    Inventors: Chandra Reddy, Prashant Parikh
  • Patent number: 7370056
    Abstract: A method performed in a system having multiple navigable nodes interconnected in a hierarchical arrangement involves receiving an input containing at least one word identifiable with at least one keyword, identifying at least one node, other than the first node, not directly connected to the first node, but associated with the at least one keyword, and jumping to the identified node. A transaction processing system having a hierarchical arrangement of nodes and is configured for user navigation among the nodes. The system has an inverted index correlating keywords with at least some nodes in the arrangement so that when the user provides an input in response to a verbal description and the response includes a meaningful word correlatable with a keyword, the system will identify at least one node correlated to the meaningful word by the inverted index and jump to that node without first traversing any other node.
    Type: Grant
    Filed: March 11, 2004
    Date of Patent: May 6, 2008
    Assignee: Noema, Inc.
    Inventors: Prashant Parikh, Stanley Peters
  • Patent number: 7260567
    Abstract: A method performed in a system having multiple navigable nodes interconnected in a hierarchical arrangement involves receiving an input containing at least one word identifiable with at least one keyword, identifying at least one node, other than the first node, not directly connected to the first node, but associated with the at least one keyword, and jumping to the identified node. A transaction processing system having a hierarchical arrangement of nodes and is configured for user navigation among the nodes. The system has an inverted index correlating keywords with at least some nodes in the arrangement so that when the user provides an input in response to a verbal description and the response includes a meaningful word correlatable with a keyword, the system will identify at least one node correlated to the meaningful word by the inverted index and jump to that node without first traversing any other node.
    Type: Grant
    Filed: March 11, 2004
    Date of Patent: August 21, 2007
    Assignee: Noema, Inc.
    Inventors: Prashant Parikh, Stanley Peters
  • Patent number: 7257574
    Abstract: A method performed in connection with an arrangement of nodes representable as a graph, and an inverted index containing a correlation among keywords and nodes such that at least some nodes containing a given keyword are indexed to that given keyword, involves receiving a word, searching the inverted index to determine whether the word is a keyword and, if the word is a keyword, jumping to a node identified in the inverted index as correlated to that keyword, otherwise, learning a meaning for the word based upon reaching a result node and applying at least one specified rule such that a new input containing the word can be received thereafter and the word from the new input will be treated according to the learned meaning.
    Type: Grant
    Filed: September 14, 2004
    Date of Patent: August 14, 2007
    Inventor: Prashant Parikh
  • Patent number: 7231379
    Abstract: A method performed in a system having multiple navigable nodes interconnected in a hierarchical arrangement involves receiving an input containing at least one word identifiable with at least one keyword, identifying at least one node, other than the first node, not directly connected to the first node, but associated with the at least one keyword, and jumping to the identified node. A transaction processing system having a hierarchical arrangement of nodes and is configured for user navigation among the nodes. The system has an inverted index correlating keywords with at least some nodes in the arrangement so that when the user provides an input in response to a verbal description and the response includes a meaningful word correlatable with a keyword, the system will identify at least one node correlated to the meaningful word by the inverted index and jump to that node without first traversing any other node.
    Type: Grant
    Filed: November 19, 2002
    Date of Patent: June 12, 2007
    Assignee: Noema, Inc.
    Inventors: Prashant Parikh, Stanley Peters
  • Publication number: 20070036288
    Abstract: A method and apparatus for establishing telephone connections to a called party which has been assigned a personalized number as well as a “plain old telephone service” (POTS) number. A caller dials directing information to indicate that a personalized number and not a POTS number is being supplied by the caller. A database system for serving a switch having intelligent network capabilities translates from that personalized number to the POTS number assigned to the called party. The public switched telephone network, using that POTS number, establishes a connection between the caller and the called party in accordance with the principles of the prior art. If the caller is not connected to a switch having intelligent network capabilities, the caller dials a directing code to access a switch having intelligent network capabilities and the latter switch accesses the database system to translate from the personalized number to the POTS number.
    Type: Application
    Filed: July 18, 2005
    Publication date: February 15, 2007
    Inventor: Prashant Parikh
  • Publication number: 20070011158
    Abstract: A personal information database in which a particular field (or fields) of an individual's personal information record that a requester receives is determined by the context of the transaction. When an e-mail application accesses the database, for example, the PID (personal identification of a database subscriber) identifies the database subscriber (and hence the record ID). The fact that an e-mail application is requesting information identifies the context of the transaction (e-mail address request). Thus, only the e-mail address is provided to the requester. The same inherent selection of particular information fields by context occurs if a cellular telephone system accesses the database (mobile telephone number field), the USPS (United States Postal Service) accesses the database (postal address fields), or a web browser accesses the database (web site URL field).
    Type: Application
    Filed: July 6, 2005
    Publication date: January 11, 2007
    Inventor: Prashant Parikh
  • Publication number: 20060217953
    Abstract: A method, performed in a character entry system, for interrelating character strings so that an incomplete input character string can be completed by selection of a presented character string involves computing relationship scores for individual character strings in the system from documents present in the character entry system, in response to inputting of a string of individual characters that exceeds a specified threshold, identifying at least one selectable character string from among contextual associations that can complete the input character string in context based upon an overall ranking score computed as a function of at least two other scores, and providing the identified at least one selectable character string to a user for selection.
    Type: Application
    Filed: June 8, 2006
    Publication date: September 28, 2006
    Inventor: Prashant Parikh
  • Publication number: 20060200442
    Abstract: A method performed in a system involves, at a node within the system, receiving an input from a user, determining that the input contains an unknown word, presenting at least one response to the user, and based upon at least one additional input from the user, learning one or more associations for the unknown word.
    Type: Application
    Filed: February 24, 2006
    Publication date: September 7, 2006
    Inventor: Prashant Parikh
  • Publication number: 20060167872
    Abstract: A method, performed in a character entry system, for interrelating character strings so that incomplete input character strings can be completed by a selection of a presented character string involves computing contextual associations between multiple character strings based upon co-occurrence of character strings relative to each other in documents present in the character entry system, in response to inputting of a specified threshold of individual characters, identifying at least one selectable character string from among the computed contextual associations that can compete the incomplete input character string in context; and providing the identified at least one selectable character string to a user for selection.
    Type: Application
    Filed: January 21, 2005
    Publication date: July 27, 2006
    Inventor: Prashant Parikh
  • Publication number: 20050060304
    Abstract: A method performed in connection with an arrangement of nodes representable as a graph, and an inverted index containing a correlation among keywords and nodes such that at least some nodes containing a given keyword are indexed to that given keyword, involves receiving a word, searching the inverted index to determine whether the word is a keyword and, if the word is a keyword, jumping to a node identified in the inverted index as correlated to that keyword, otherwise, learning a meaning for the word based upon reaching a result node and applying at least one specified rule such that a new input containing the word can be received thereafter and the word from the new input will be treated according to the learned meaning.
    Type: Application
    Filed: September 14, 2004
    Publication date: March 17, 2005
    Inventor: Prashant Parikh