Patents by Inventor Michael Burrows

Michael Burrows 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: 20060144942
    Abstract: A drug administration system includes a cradle attached about an intravenous injection port having a flange extending therefrom. The cradle supports first drug administration information in the nature of machine and human readable code, for example, barcode. A syringe including a needle includes a flange extending from the syringe. The syringe supports second drug administration information in machine and/or human readable form. A scanner module is constructed to slidably receive the flange of the cradle and syringe whereby the syringe needle is aligned with the intravenous injection port. The module may be provided with an electronic scanning system for identifying the first and second drug administration information, as well as determining the amount of the drug being administered from the syringe to the injection port by monitoring movement of the syringe plunger. The information and data may be stored within the module for uploading to a remote location.
    Type: Application
    Filed: March 6, 2006
    Publication date: July 6, 2006
    Applicant: DocuSys, Inc.
    Inventors: Robert Evans, Michael Burrow
  • Patent number: 7068192
    Abstract: A system and method for encoding and decoding variable-length data includes storing data values in a data structure including a data field and a tag field. The data field includes one or more variable-length data subfields capable of storing variable-length data (e.g., 1 to N bytes of data). In some embodiments, the data subfields and the tag field of the data structure each start on a byte boundary which simplifies decoding. The tag field includes one or more tag subfields, each corresponding to the one or more data subfields. Each tag subfield includes one or more tag bits which indicate the length of the data stored in the corresponding data subfield. Unpacking or decompressing data values from the data structure can be achieved by using a look-up table of offsets and masks, thus reducing the number of bit operations needed to unpack data values from the data structure.
    Type: Grant
    Filed: August 13, 2004
    Date of Patent: June 27, 2006
    Assignee: Google Inc.
    Inventors: Jeffrey Dean, Michael Burrows, Gauthaum K. Thambidorai, Olcan Sercinoglu
  • Publication number: 20060077091
    Abstract: A system for obtaining frequency domain interferometric super-resolution of a target scatterer, having a first and a second coherent transceivers, a mutual coherent sub-system and an estimation system. The first and second coherent transceivers are operative to produce a plurality of first and second sampling signals separated from each other by a predetermined frequency difference within the first and second sub-band, respectively. The mutual coherent sub-system is coupled to the first and second coherent transceivers to receive phase and amplitude of the first and second sampling signals, so as to evaluate an ambiguous range estimate from a pair of the first and second sampling signals and an unambiguous range estimate from a pair of the first and/or second sampling signals.
    Type: Application
    Filed: May 17, 2005
    Publication date: April 13, 2006
    Inventors: Pei-Rin Wu, Michael Burrows, Gordon Dryden
  • Patent number: 7028039
    Abstract: A web crawler system includes a central processing unit for performing computations in accordance with stored procedures and a network interface for accessing remotely located computers via a network. A web crawler module downloads pages from remotely located servers via the network interface. A first link processing module obtains page link information from the downloaded page; the page link information includes for each downloaded page a row of page identifiers of other pages. A second link processing module encodes the rows of page identifies in a space efficient manner. It arranges the rows of page identifiers in a particular order. For each respective row it identifies a prior row, if any, that best matches the respective row in accordance with predefined row match criteria, determines a set of deletes representing page identifiers in the identified prior row not in the respective row, and determines a set of adds representing page identifiers in the respective row not in the identifier prior row.
    Type: Grant
    Filed: January 18, 2001
    Date of Patent: April 11, 2006
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Michael Burrows, Keith H. Randall, Raymond P. Stata, Rajiv G. Wickremesinghe
  • Patent number: 6963869
    Abstract: An indexer indexes a database of documents, and a search engine searches the database of documents. Nesting level information stored in index entries is used to identify, and match together, start and end meta words comprising fields at assorted nesting levels within a document. Based on a query specifying words to be found within fields, spatial criteria are applied to the identified meta words to determine if the specified words are found within the specified fields. A subset of the documents have nested fields, and each nested field has an associated start meta word and end meta word. Each meta word has an associated nesting level. Each document is indexed by parsing the document to determine locations within the document of words and meta words, as well as the nesting level associated with each meta word. An index is generated that has word entries, meta word entries, and generic meta word entries.
    Type: Grant
    Filed: January 7, 2002
    Date of Patent: November 8, 2005
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventor: Michael Burrows
  • Patent number: 6961930
    Abstract: The performance of an executing computer program on a computer system is monitored using latency sampling. The program has object code instructions and is executing on the computer system. At intervals, the execution of the computer program is interrupted including delivering a first interrupt. In response to at least a subset of the first interrupts, a latency associated with a particular object code instruction is identified, and the latency is stored in a first database. The particular object code instruction is executed by the computer such that the program remains unmodified.
    Type: Grant
    Filed: March 31, 2000
    Date of Patent: November 1, 2005
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Carl A. Waldspurger, Michael Burrows
  • Publication number: 20050210258
    Abstract: Methods and systems are provided for a cancellation server maintaining a database of identifiers of cryptographic puzzles. A cryptographic puzzle is created from a unique identifier and a timestamp, and is attached to an electronic mail message, along with the puzzle's solution. The recipient verifies that the solution is correct and that the timestamp is current, and further queries the cancellation server with the puzzle identifier. If the identifier does not exist in the database, then the recipient knows the received message is legitimate. If the identifier already appears in the database, the received message can be automatically removed from the recipient's computer.
    Type: Application
    Filed: March 22, 2004
    Publication date: September 22, 2005
    Applicant: Microsoft Corporation
    Inventors: Andrew Birrell, Michael Burrows, Edward Wobber
  • Publication number: 20050165750
    Abstract: A document indexing system utilizes two indexes. An infrequent word index is maintained separately from a frequent word index to map the locations of words that occur infrequently in the indexed documents. The infrequent word index may be stored and partitioned differently than the frequent word index to promote efficiency.
    Type: Application
    Filed: January 20, 2004
    Publication date: July 28, 2005
    Inventors: Darren Shakib, Gaurav Sareen, Michael Burrows
  • Publication number: 20050033745
    Abstract: A process for constructing a server for collecting, arranging and storing data that defines the connectivity of pages on the World Wide Web (Web). The process input is a set of compressed ASCII links files, wherein each links file is a series of source URLs and corresponding destination URLs. A temporary URLs_info Table is created and initialized. The links files and URLs metadata are read. Buffers of unique URLs are sorted and written from the links files into URL runs. An ID Index is created from the URL_info table. CS_ids are assigned to URLs and written to the ID Index. Both a compressed URL data structure and a URL Index are created. A Host Table is created. URL fingerprints are converted to CS_ids, and preliminary outstarts to CS_ids and preliminary outstarts and outlinks tables are created. Compressed outstarts and outlinks tables are created from the preliminary tables. Subsequently, compressed instarts and inlinks tables are created based on the outstarts and outlinks tables.
    Type: Application
    Filed: December 16, 2003
    Publication date: February 10, 2005
    Inventors: Janet Wiener, Michael Burrows
  • Publication number: 20040243827
    Abstract: A method for managing access control of a resource includes storing a revocation list containing a list of revoked capabilities and their corresponding groups; storing a group list containing a list of valid groups; receiving a capability revocation request to revoke a specified capability; selecting a revocation method from among a plurality of revocation methods, including an individual capability revocation method and a group revocation method; revoking the specified capability by invalidating the group to which the specified capability belongs if the group revocation method is selected; and revoking the specified capability by invalidating only the specified capability if the individual capability revocation method is selected.
    Type: Application
    Filed: May 30, 2003
    Publication date: December 2, 2004
    Inventors: Marcos K. Aguilera, Minwen Ji, Mark David Lillibridge, John Philip MacCormick, Erwin Oertli, David Godbe Andersen, Michael Burrows, Timothy P. Mann, Chandramohan A. Thekkath
  • Publication number: 20040243569
    Abstract: A computer implemented method performs constrained searching of an index of a database. The information of the database is stored as a plurality of records. A unique location is assigned to each indexable portion of information of the database. Index entries are written to a memory where each index entry includes a word entry representing a unique indexable portion of information, and one or more location entries for each occurrence of the unique indexable portion information. The index entries are sorted according to a collating order of the word entries, and sequentially according to the location entries of each index entry. A query is parsed to generate a first term and a second term related by an AND logical operator, the AND operator requires that a first index entry corresponding to the first term and a second index entry corresponding to the second term both have locations in the same record to satisfy a query.
    Type: Application
    Filed: April 20, 2004
    Publication date: December 2, 2004
    Applicant: Overture Services, Inc.
    Inventor: Michael Burrows
  • Publication number: 20040243828
    Abstract: A system for protecting data integrity in a network attached block-device, such as a disk or a disk array, includes a capability issuer module coupled to a metadata server. The capability-issuer module creates capability data in accordance with a predetermined set of rules, and issues the capability data to the client over a secured channel. The capability data includes a group identifier, a capability identifier, a block-device identifier, a list of extents for specifying a range of blocks to which access is granted, an access mode for indicating the type of access allowed, and a cryptographic string for preventing forgery of capabilities by unauthorized parties. A capability checker module coupled to a network attached block-device verifies that the client's block access request is consistent with the capability data issued, and that the capability data is authentic. Upon verifying the client's capability data, the client's block access request is granted and executed at the network-attached block-device.
    Type: Application
    Filed: May 30, 2003
    Publication date: December 2, 2004
    Inventors: Marcos K. Aguilera, Minwen Ji, Mark Lillibridge, John Philip MacCormick, Erwin Oertli, David Godbe Andersen, Michael Burrows, Timothy P. Mann, Chandramohan A. Thekkath
  • Patent number: 6745194
    Abstract: A technique for deleting duplicate records referenced in an index of a database is disclosed. In one embodiment, the technique may be realized by receiving a record; determining a fingerprint for the record; comparing the fingerprint of the record with fingerprints of previously indexed records; and, when the comparing act determines that the fingerprint of the current received record is the same as at least one of the fingerprints of any of the previously indexed records, identifying the current record as a record to be deleted.
    Type: Grant
    Filed: August 3, 2001
    Date of Patent: June 1, 2004
    Assignee: Alta Vista Company
    Inventor: Michael Burrows
  • Publication number: 20040093371
    Abstract: A resource may be abused if its users incur little or no cost. For example, e-mail abuse is rampant because sending an e-mail has negligible cost for the sender. Such abuse may be discouraged by introducing an artificial cost in the form of a moderately expensive computation. Thus, the sender of an e-mail might be required to pay by computing for a few seconds before the e-mail is accepted. Unfortunately, because of sharp disparities across computer systems, this approach may be ineffective against malicious users with high-end systems, prohibitively slow for legitimate users with low-end systems, or both. Starting from this observation, we identify moderately hard, memory bound functions that most recent computer systems will evaluate at about the same speed, and we explain how to use them for protecting against abuses.
    Type: Application
    Filed: November 8, 2002
    Publication date: May 13, 2004
    Applicant: Microsoft Corporation.
    Inventors: Michael Burrows, Martin Abadi, Mark Steven Manasse, Edward P. Wobber, Daniel Ron Simon
  • Patent number: 6701317
    Abstract: A process for constructing a server for collecting, arranging and storing data that defines the connectivity of pages on the World Wide Web (Web). The process input is a set of compressed ASCII links files, wherein each links file is a series of source URLs and corresponding destination URLs. A temporary URLs_info Table is created and initialized. The links files and URLs metadata are read. Buffers of unique URLs are sorted and written from the links files into URL runs. An ID Index is created from the URL_info table. CS_ids are assigned to URLs and written to the ID Index. Both a compressed URL data structure and a URL Index are created. A Host Table is created. URL fingerprints are converted to CS_ids, and preliminary outstarts to CS_ids and preliminary outstarts and outlinks tables are created. Compressed outstarts and outlinks tables are created from the preliminary tables. Subsequently, compressed instarts and inlinks tables are created based on the outstarts and outlinks tables.
    Type: Grant
    Filed: September 19, 2000
    Date of Patent: March 2, 2004
    Assignee: Overture Services, Inc.
    Inventors: Janet Lynn Wiener, Michael Burrows
  • Patent number: 6662364
    Abstract: A system and method for implementing mutual exclusion locks (mutexes) is provided. Mutexes of the present invention designate whether they are to be synchronized using fast nonatomic load/store sequences or, alternatively, expensive atomic hardware instructions. When a requesting thread requests a target mutex, the target mutex is synchronized using the method designated by the target mutex. In some embodiments, the designated synchronization method may be changed to the atomic method when the requesting thread is not the thread associated with the target mutex. In other embodiments, the designated synchronization method may be determined by a heuristic function. For example, the synchronization method may be changed to the atomic method when a mutex request counter, which penalizes thread changes, underflows.
    Type: Grant
    Filed: November 5, 1999
    Date of Patent: December 9, 2003
    Assignee: Hewlett-Packard Company, L.P.
    Inventors: Michael Burrows, Mark Thierry Vandervoorde, Sanjay Ghemawat
  • Publication number: 20030140035
    Abstract: An indexer indexes a database of documents, and a search engine searches the database of documents. Nesting level information stored in index entries is used to identify, and match together, start and end meta words comprising fields at assorted nesting levels within a document. Based on a query specifying words to be found within fields, spatial criteria are applied to the identified meta words to determine if the specified words are found within the specified fields. A subset of the documents have nested fields, and each nested field has an associated start meta word and end meta word. Each meta word has an associated nesting level. Each document is indexed by parsing the document to determine locations within the document of words and meta words, as well as the nesting level associated with each meta word. An index is generated that has word entries, meta word entries, and generic meta word entries.
    Type: Application
    Filed: January 7, 2002
    Publication date: July 24, 2003
    Inventor: Michael Burrows
  • Patent number: 6598051
    Abstract: A connectivity server for a collecting, arranging and representing data defining the interconnection of pages on the World Wide Web (Web). A URL Database stores URLs and associates a fingerprint and CS_id with each URL. The URL Database interface is operable to translate between any two of a URL, a fingerprint, and a Host_id. A Host Database associates a Host_id with each distinct hostname in the URL Database. The Host Database interface is operable to accept a Host_id and return a number equal to the number of URLs on the respective host and to return the CS_ids of those URLs. A Link Database stores links between source URLs and destination URLs. The Link Database interface is operable to retrieve, for a given CS_id, the number of inlinks to and outlinks from the URL corresponding to the CS_id.
    Type: Grant
    Filed: September 19, 2000
    Date of Patent: July 22, 2003
    Assignee: Altavista Company
    Inventors: Janet L. Wiener, Raymond P. Stata, Michael Burrows
  • Publication number: 20030126590
    Abstract: A data-type checker dynamically verifies program operation. The data-type checker, while executing a specified computer program, maintains a shadow array that has entries corresponding to respective memory locations used by the specified computer program. Each entry of the shadow array indicates a data type of the corresponding respective memory location. While executing the specified computer program, the data-type checker executes each of a set of instructions of the computer program. For the execution of each instruction in a subset of the set of instructions of the computer program, the data-type checker determines whether execution of the instruction is inconsistent with an entry of the shadow array and, if so, generates a report. The data-type checker then executes the instruction, and updates the shadow array in accordance with execution of the instruction.
    Type: Application
    Filed: December 28, 2001
    Publication date: July 3, 2003
    Inventors: Michael Burrows, Stephen Neil Freund
  • Publication number: 20030023458
    Abstract: A system and method for providing medical care to a patient via a virtual call center, regardless of the patient's location and a medical care agent's location, is disclosed. A patient digital processor allows a patient to provide a patient profile to the medical care system that is received by a medical care digital processor. A medical care agent digital processor allows a medical care agent to provide their characteristics to the medical care digital processor. Upon patient initiation, the medical care processor analyzes the patient profile to determine an appropriate medical care agent to address the patient's medical queries. A connection is then made between the patient digital processor and the medical care agent digital processor to allow “real time” interaction. Additional medical care agents may be added to the connection for additional medical analysis and input.
    Type: Application
    Filed: July 27, 2001
    Publication date: January 30, 2003
    Applicant: Cyber-Care, Inc.
    Inventors: John Haines, Michael Burrow, John Peifer, Andrew Hopper, Stephen Ratzel