Patents by Inventor Praveen Krishnamurthy
Praveen Krishnamurthy 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: 20150326226Abstract: Circuits and methods for controlling electrical coupling by a load switch are disclosed. In an embodiment, the load switch includes a pass element, level-shift circuit and low-resistance active path. The pass element is configured to be coupled to a power supply and a load, and is configured to electrically couple the power supply with the load during ON-state and electrically decouple the power supply from the load during OFF-state. The level-shift circuit includes a first transistor and pull-up resistor and is configured to generate a level-shifted signal in response to an enable signal, and enable the ON-state and the OFF-state of the pass element based on first and second voltages of the level-shifted signal. The low-resistance active path is coupled in parallel with the pull-up resistor for shunting the pull-up resistor in the OFF-state by providing a path for a leakage current of the first transistor in the OFF-state.Type: ApplicationFiled: May 7, 2014Publication date: November 12, 2015Applicant: TEXAS INSTRUMENTS INCORPORATEDInventors: Alok Kumar, Fenish Padinjaroot Prakasan, Rajkumar Jayaraman, Kalyan Cherukuri, Praveen Krishnamurthy
-
Publication number: 20140067830Abstract: A system and method for performing similarity searching is disclosed wherein programmable logic devices such as field programmable gate arrays (FPGAs) can be used to implement Bloom filters for identifying possible matches between a query and data. The Bloom filters can be implemented in a parallel architecture where the different parallel Bloom filters share access to the same memory units.Type: ApplicationFiled: August 19, 2013Publication date: March 6, 2014Inventors: Jeremy Daniel Buhler, Roger Dean Chamberlain, Mark Allen Franklin, Kwame Gyang, Arpith Chacko Jacob, Praveen Krishnamurthy, Joseph Marion Lancaster
-
Patent number: 8619978Abstract: A method and a system allow accessing several of a user's controlled access accounts by presenting the credentials of only one of the accounts. The method may include (a) storing the credentials for each of the user's accounts; (b) receiving from the user credentials corresponding to any of the user's accounts; (c) presenting the received credentials to access the corresponding account; and (d) upon successful access of the corresponding account, using the stored credentials to access one or more of the user's accounts without requiring the user to present the corresponding credentials. For each of the user's accounts, the credentials are stored encrypted, using a randomly generated key, common to all the encrypted credentials. In addition, the randomly generated key is encrypted using the credentials of each of the accounts. In that manner, plain-text copies of neither the random key nor the credentials of the accounts need to be stored.Type: GrantFiled: December 21, 2007Date of Patent: December 31, 2013Assignee: PageBites, Inc.Inventors: Ralph Harik, Georges Harik, Praveen Krishnamurthy
-
Patent number: 8515682Abstract: A system and method for performing similarity searching is disclosed. This includes a programmable logic device configured to include a pipeline that comprises a matching stage, the matching stage being configured to receive a data stream comprising a plurality of possible matches between a plurality of data strings and a plurality of substrings of a query string. The pipeline may further include an ungapped extension prefilter stage located downstream from the matching stage, the prefilter stage being configured to shift through pattern matches between the data strings and the plurality of substrings of a query string and provide a score so that only pattern matches that exceed a user defined score will pass downstream from the prefilter stage. The matching stage may include at least one Bloom filter.Type: GrantFiled: March 11, 2011Date of Patent: August 20, 2013Assignee: Washington UniversityInventors: Jeremy Daniel Buhler, Roger Dean Chamberlain, Mark Allen Franklin, Kwame Gyang, Arpith Chacko Jacob, Praveen Krishnamurthy, Joseph Marion Lancaster
-
Publication number: 20110231446Abstract: A system and method for performing similarity searching is disclosed. This includes a programmable logic device configured to include a pipeline that comprises a matching stage, the matching stage being configured to receive a data stream comprising a plurality of possible matches between a plurality of data strings and a plurality of substrings of a query string. The pipeline may further include an ungapped extension prefilter stage located downstream from the matching stage, the prefilter stage being configured to shift through pattern matches between the data strings and the plurality of substrings of a query string and provide a score so that only pattern matches that exceed a user defined score will pass downstream from the prefilter stage. The matching stage may include at least one Bloom filter.Type: ApplicationFiled: March 11, 2011Publication date: September 22, 2011Applicant: Washington UniversityInventors: Jeremy Daniel Buhler, Roger Dean Chamberlain, Mark Allen Franklin, Kwame Gyang, Arpith Chacko Jacob, Praveen Krishnamurthy, Joseph Marion Lancaster
-
Patent number: 7958192Abstract: A method automatically and efficiently propagates information using previously established social methods of communication (e.g., email, instant messaging (IM), social network message posting, and short message services). In conjunction with the method, a system collects and disseminates information on a social network. The system includes: (a) a server for providing a user interface (e.g., a user facing web site) which allows a user to exchange information with one or more external services, wherein the information exchange includes receiving a message from the user that the user intends to disseminate through the external services; (b) a message module which prepares the message received from the user for dissemination; and (c) a communication module coupled to the user interface, the message module and the external services to mediate the information exchange between the user and the external services.Type: GrantFiled: April 25, 2007Date of Patent: June 7, 2011Inventors: Ralph Harik, Georges Harik, Praveen Krishnamurthy
-
Patent number: 7917299Abstract: An apparatus and method for performing similarity searching on a data stream with respect to a query string are disclosed, where the data stream comprises a plurality of data substrings, and where the query string comprises a plurality of query substrings. A programmable logic device is used to filter the data stream to find a plurality of possible matches between the data substrings and a plurality of the query substrings, wherein the data substrings and the query substrings comprise a plurality of characters. From these possible matches, a determination can be made as to a similarity between the query string and at least a portion of the data stream.Type: GrantFiled: February 22, 2006Date of Patent: March 29, 2011Assignee: Washington UniversityInventors: Jeremy Daniel Buhler, Roger Dean Chamberlain, Mark Allen Franklin, Kwame Gyang, Arpith Chacko Jacob, Praveen Krishnamurthy, Joseph Marion Lancaster
-
Patent number: 7840511Abstract: A medical concept is learned about or inferred from a medical transcript. A probabilistic model is trained from medical transcripts. For example, the problem is treated as a graphical model. Discrimitive or generative learning is used to train the probabilistic model. A mutual information criterion can be employed to identify a discrete set of words or phrases to be used in the probabilistic model. The model is based on the types of medical transcripts, focusing on this source of data to output the most probable state of a patient in the medical field or domain. The learned model may be used to infer a state of a medical concept for a patient.Type: GrantFiled: September 5, 2007Date of Patent: November 23, 2010Assignee: Siemens Medical Solutions USA, Inc.Inventors: Romer E. Rosales, Praveen Krishnamurthy, R. Bharat Rao, Harald Steck
-
Publication number: 20100098081Abstract: Methods and systems for performing parallel membership queries to Bloom filters for Longest Prefix Matching, where address prefix memberships are determined in sets of prefixes sorted by prefix length. Hash tables corresponding to each prefix length are probed from the longest to the shortest match in the vector, terminating when a match is found or all of the lengths are searched. The performance, as determined by the number of dependent memory accesses per lookup, is held constant for longer address lengths or additional unique address prefix lengths in the forwarding table given that memory resources scale linearly with the number of prefixes in the forwarding table. For less than 2 Mb of embedded RAM and a commodity SRAM, the present technique achieves average performance of one hash probe per lookup and a worst case of two hash probes and one array access per lookup.Type: ApplicationFiled: September 24, 2009Publication date: April 22, 2010Inventors: Sarang Dharmapurikar, Praveen Krishnamurthy, David Edward Taylor
-
Patent number: 7602785Abstract: The present invention relates to a method and system of performing parallel membership queries to Bloom filters for Longest Prefix Matching, where address prefix memberships are determined in sets of prefixes sorted by prefix length. Hash tables corresponding to each prefix length are probed from the longest to the shortest match in the vector, terminating when a match is found or all of the lengths are searched. The performance, as determined by the number of dependent memory accesses per lookup, is held constant for longer address lengths or additional unique address prefix lengths in the forwarding table given that memory resources scale linearly with the number of prefixes in the forwarding table. For less than 2 Mb of embedded RAM and a commodity SRAM, the present technique achieves average performance of one hash probe per lookup and a worst case of two hash probes and one array access per lookup.Type: GrantFiled: February 9, 2005Date of Patent: October 13, 2009Assignee: Washington UniversityInventors: Sarang Dharmapurikar, Praveen Krishnamurthy, David Edward Taylor
-
Publication number: 20090030932Abstract: A method for identifying friend relationship in one or more on-line social networks includes creating a graph representing friend relationships among multiple participants of the social networks, in which the nodes of the graph represent the participants and each edge of the graph represents an existing friend relationship in the social networks between two of the participants. The resulting graph is then analyzed using, for example, a graph-theoretical technique to identify pairs of nodes that are unconnected in the graph. A score is then assigned between each identified pair of nodes. The score represents the likelihood that the participants corresponding to the identified pair of nodes are real life friends. The score for each identified pair may be computed based on the connectedness of a subgraph of the graph that includes the identified pair of nodes. One example of such a subgraph is a 4-node subgraph.Type: ApplicationFiled: July 21, 2008Publication date: January 29, 2009Inventors: Ralph Harik, Georges Harik, Praveen Krishnamurthy
-
Patent number: 7444515Abstract: The present invention relates to a method and apparatus based on Bloom filters for detecting predefined signatures (a string of bytes) in a network packet payload. A Bloom filter is a data structure for representing a set of strings in order to support membership queries. Hardware Bloom filters isolate all packets that potentially contain predefined signatures. Another independent process eliminates false positives produced by the Bloom filters. The system is implemented on a FPGA platform, resulting in a set of 10,000 strings being scanned in the network data at the line speed of 2.4 Gbps.Type: GrantFiled: August 14, 2003Date of Patent: October 28, 2008Assignee: Washington UniversityInventors: Sarang Dharmapurikar, Praveen Krishnamurthy, Todd Sproull, John Lockwood
-
Publication number: 20080155669Abstract: A method and a system allow accessing several of a user's controlled access accounts by presenting the credentials of only one of the accounts. The method may include (a) storing the credentials for each of the user's accounts; (b) receiving from the user credentials corresponding to any of the user's accounts; (c) presenting the received credentials to access the corresponding account; and (d) upon successful access of the corresponding account, using the stored credentials to access one or more of the user's accounts without requiring the user to present the corresponding credentials. For each of the user's accounts, the credentials are stored encrypted, using a randomly generated key, common to all the encrypted credentials. In addition, the randomly generated key is encrypted using the credentials of each of the accounts. In that manner, plain-text copies of neither the random key nor the credentials of the accounts need to be stored.Type: ApplicationFiled: December 21, 2007Publication date: June 26, 2008Inventors: Ralph Harik, Georges Harik, Praveen Krishnamurthy
-
Publication number: 20080059391Abstract: A medical concept is learned about or inferred from a medical transcript. A probabilistic model is trained from medical transcripts. For example, the problem is treated as a graphical model. Discrimitive or generative learning is used to train the probabilistic model. A mutual information criterion can be employed to identify a discrete set of words or phrases to be used in the probabilistic model The model is based on the types of medical transcripts, focusing on this source of data to output the most probable state of a patient in the medical field or domain.Type: ApplicationFiled: September 5, 2007Publication date: March 6, 2008Applicant: SIEMENS MEDICAL SOLUTIONS USA, INC.Inventors: Romer Rosales, Praveen Krishnamurthy, R. Rao, Harald Steck
-
Publication number: 20070266097Abstract: A method is provided for automatically and efficiently propagating information using previously established social methods of communication (e.g., email, instant messaging (IM), social network message posting, and short message services). In conjunction with the method, a system for collecting and disseminating information on a social network is provided, which includes: (a) a server for providing a user interface (e.g., a user facing web site) which allows a user to exchange information with one or more external services, wherein the information exchange includes receiving a message from the user that the user intends to disseminate through the external services; (b) a message module which prepares the message received from the user for dissemination; and (c) a communication module coupled to the user interface, the message module and the external services to mediate the information exchange between the user and the external services.Type: ApplicationFiled: April 25, 2007Publication date: November 15, 2007Inventors: Ralph Harik, Georges Harik, Praveen Krishnamurthy
-
Publication number: 20070067108Abstract: A system and method for performing biological sequence similarity searching is disclosed. This includes a programmable logic device configured to include a pipeline that comprises a matching stage, the matching stage being configured to receive a data stream comprising a plurality of possible matches between a plurality of biological sequence data strings and a plurality of substrings of a query string. The pipeline may further include a ungapped extension prefilter stage located downstream from the matching stage, the prefilter stage being configured to shift through pattern matches between the biological sequence data strings and the plurality of substrings of a query string and provide a score so that only pattern matches that exceed a user defined score will pass downstream from the prefilter stage. The matching stage may include at least one Bloom filter.Type: ApplicationFiled: February 22, 2006Publication date: March 22, 2007Inventors: Jeremy Buhler, Roger Chamberlain, Mark Franklin, Kwame Gyang, Arpith Jacob, Praveen Krishnamurthy, Joseph Lancaster
-
Publication number: 20050195832Abstract: The present invention relates to a method and system of performing parallel membership queries to Bloom filters for Longest Prefix Matching, where address prefix memberships are determined in sets of prefixes sorted by prefix length. Hash tables corresponding to each prefix length are probed from the longest to the shortest match in the vector, terminating when a match is found or all of the lengths are searched. The performance, as determined by the number of dependent memory accesses per lookup, is held constant for longer address lengths or additional unique address prefix lengths in the forwarding table given that memory resources scale linearly with the number of prefixes in the forwarding table. For less than 2 Mb of embedded RAM and a commodity SRAM, the present technique achieves average performance of one hash probe per lookup and a worst case of two hash probes and one array access per lookup.Type: ApplicationFiled: February 9, 2005Publication date: September 8, 2005Inventors: Sarang Dharmapurikar, Praveen Krishnamurthy, David Taylor
-
Publication number: 20050086520Abstract: The present invention relates to a method and apparatus based on Bloom filters for detecting predefined signatures (a string of bytes) in a network packet payload. A Bloom filter is a data structure for representing a set of strings in order to support membership queries. Hardware Bloom filters isolate all packets that potentially contain predefined signatures. Another independent process eliminates false positives produced by the Bloom filters. The system is implemented on a FPGA platform, resulting in a set of 10,000 strings being scanned in the network data at the line speed of 2.4 Gbps.Type: ApplicationFiled: August 14, 2003Publication date: April 21, 2005Inventors: Sarang Dharmapurikar, Praveen Krishnamurthy, Todd Sproull, John Lockwood