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).

  • Patent number: 8048814
    Abstract: A method of aligning a set of patterns on a substrate, the substrate including a substrate surface, is disclosed. The method includes depositing a set of silicon nanoparticles on the substrate surface, the set of nanoparticles including a set of ligand molecules including a set of carbon atoms, wherein a first set of regions is formed where the silicon nanoparticles are deposited and the remaining portions of the substrate surface define a second set of regions. The method also includes densifying the set of silicon nanoparticles into a thin film wherein a set of silicon-organic zones are formed on the substrate surface, wherein the first set of regions has a first reflectivity value and the second set of regions has a second reflectivity value. The method further includes illuminating the substrate surface with an illumination source, wherein the ratio of the second reflectivity value to the first reflectivity value is greater than about 1.1.
    Type: Grant
    Filed: May 19, 2009
    Date of Patent: November 1, 2011
    Assignee: Innovalight, Inc.
    Inventors: Andreas Meisel, Michael Burrows, Homer Antoniadis
  • Publication number: 20110003464
    Abstract: A method of forming a multi-doped junction on a substrate is disclosed. The method includes providing the substrate doped with boron atoms, the substrate comprising a front substrate surface, and depositing an ink on the front substrate surface in an ink pattern, the ink comprising a set of nanoparticles and a set of solvents. The method further includes heating the substrate in a baking ambient to a first temperature of between about 200° C. and about 800° C. and for a first time period of between about 3 minutes and about 20 minutes in order to create a densified film ink pattern. The method also includes exposing the substrate to a dopant source in a diffusion furnace with a deposition ambient, the deposition ambient comprising POCl3, a carrier N2 gas, a main N2 gas, and a reactive O2 gas, wherein a ratio of the carrier N2 gas to the reactive O2 gas is between about 1:1 to about 1.5:1, at a second temperature of between about 700° C. and about 1000° C.
    Type: Application
    Filed: July 21, 2009
    Publication date: January 6, 2011
    Inventors: Giuseppe Scardera, Dmitry Poplavskyy, Michael Burrows, Sunil Shah
  • Patent number: 7779103
    Abstract: One or more servers receive requests from clients and send responses. At least a subset of the responses including cookies produced by the one or more servers, and at least a subset of the received requests including cookies that were previously produced by the one or more servers and sent to the clients with responses to previously processed requests. Each of the cookies includes a respective user identifier. The one or more servers analyzing the received cookies to detect a first condition, which indicates that a respective plurality of clients may be using cookies that have a shared user identifier. Upon detecting the first condition, the one or more servers send at least one of the clients of the respective plurality of clients a response that includes a new cookie having a user identifier that is distinct from the shared user identifier.
    Type: Grant
    Filed: December 12, 2006
    Date of Patent: August 17, 2010
    Assignee: Google Inc.
    Inventors: Andrew B. Fikes, Michael Burrows, Marius Schilder, Robert C. Pike
  • Patent number: 7769792
    Abstract: A tokenspace repository stores documents as a sequence of tokens. In each of a sequence of non-overlapping epochs, execution of a respective set of queries against the repository is initiated in a plurality of threads. During each epoch, entries identifying portions of the repository to be deleted are added to a respective epoch-specific list. The system or process maintains a respective epoch-specific count of the number of threads that potentially reference any of the portions of the repository identified by entries in the respective epoch-specific list; and it also maintains the epoch-specific count of each prior epoch whose epoch-specific count is not equal to a predefined final value. After the end of each epoch, when the corresponding epoch-specific count reaches the predefined final value, the system or process deletes from the repository all portions of the repository corresponding to the entries in the corresponding epoch-specific list.
    Type: Grant
    Filed: February 10, 2006
    Date of Patent: August 3, 2010
    Assignee: Google Inc.
    Inventors: Michael Burrows, Jeffrey A. Dean
  • Publication number: 20100167510
    Abstract: A method of forming a multi-doped junction is disclosed. The method includes providing a first substrate and a second substrate. The method also includes depositing a first ink on a first surface of each of the first substrate and the second substrate, the first ink comprising a first set of nanoparticles and a first set of solvents, the first set of nanoparticles comprising a first concentration of a first dopant. The method further includes depositing a second ink on a second surface of each of the first substrate and the second substrate, the second ink comprising a second set of nanoparticles and a second set of solvents, the second set of nanoparticles comprising a second concentration of a second dopant. The method also includes placing the first substrate and the second substrate in a back to back configuration; and heating the first substrate and the second substrate in a first drive-in ambient to a first temperature and for a first time period.
    Type: Application
    Filed: November 25, 2009
    Publication date: July 1, 2010
    Inventors: Maxim Kelman, Michael Burrows, Dmitry Poplavskyy, Giuseppe Scardera, Daniel Kray, Elena Rogojina
  • Publication number: 20100136718
    Abstract: A method of aligning a set of patterns on a substrate, the substrate including a substrate surface, is disclosed. The method includes depositing a set of silicon nanoparticles on the substrate surface, the set of nanoparticles including a set of ligand molecules including a set of carbon atoms, wherein a first set of regions is formed where the silicon nanoparticles are deposited and the remaining portions of the substrate surface define a second set of regions. The method also includes densifying the set of silicon nanoparticles into a thin film wherein a set of silicon-organic zones are formed on the substrate surface, wherein the first set of regions has a first reflectivity value and the second set of regions has a second reflectivity value. The method further includes illuminating the substrate surface with an illumination source, wherein the ratio of the second reflectivity value to the first reflectivity value is greater than about 1.1.
    Type: Application
    Filed: May 19, 2009
    Publication date: June 3, 2010
    Inventors: Andreas Meisel, Michael Burrows, Homer Antoniadis
  • Patent number: 7660993
    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: Grant
    Filed: March 22, 2004
    Date of Patent: February 9, 2010
    Assignee: Microsoft Corporation
    Inventors: Andrew D. Birrell, Michael Burrows, Edward Pearce Wobber
  • Patent number: 7634517
    Abstract: A tokenspace repository stores documents as a sequence of tokens. A first version of a document is stored in the repository, within an accessible range of the repository. When a second version of the document is received, the second version is also stored in the repository and the accessible range of the repository is modified to include both the first version and the second version of the document. Then the first version of the document is invalidated. Queries are executed against the repository in a plurality of threads without interruption during the operations of receiving the second version of the document, storing the second version of the document in the repository, modifying the accessible range of the repository, and invalidating the first version of the document.
    Type: Grant
    Filed: February 10, 2006
    Date of Patent: December 15, 2009
    Assignee: Google Inc.
    Inventors: Michael Burrows, Jeffrey A. Dean
  • Patent number: 7617226
    Abstract: A tokenspace repository stores documents as a sequence of tokens. The tokenspace repository, as well as the inverted index for the tokenspace repository, uses a data structure that has a first end and a second end and allows for insertions at the second end and deletions from the front end. A document in the tokenspace repository is updated by inserting the updated version into the repository at the second end and invalidating the earlier version. Invalidated documents are not deleted immediately; they are identified in a garbage collection list for later garbage collection. The tokenspace repository is treadmilled to shift invalidated documents to the front end, at which point they may be deleted and their storage space recovered.
    Type: Grant
    Filed: February 10, 2006
    Date of Patent: November 10, 2009
    Assignee: Google Inc.
    Inventors: Michael Burrows, Jeffrey A. Dean
  • Patent number: 7567973
    Abstract: Each of a plurality of data items is stored in a table data structure. The table structure includes a plurality of columns. Each of the columns is associated with one of a plurality of locality groups. Each locality group is stored as one or more corresponding locality group files that include the data items in the columns associated with the respective locality group. In some embodiments, the columns of the table data structure may be grouped into groups of columns and each group of columns is associated with one of a plurality of locality groups. Each locality group is stored as one or more corresponding locality group files that include the data items in the group of columns associated with the respective locality group.
    Type: Grant
    Filed: August 5, 2005
    Date of Patent: July 28, 2009
    Assignee: Google Inc.
    Inventors: Michael Burrows, Fay Wen Chang, Jeffrey A. Dean, Andrew B. Fikes, Sanjay Ghemawat, Wilson C. Hsieh, Deborah Anne Wallach
  • Patent number: 7529834
    Abstract: A method for backing up data in a plurality of computers connected via a network. The method includes forming partnerships between the plurality of computers such that each computer in a partnership commits under agreements to help backup the data of its partners. The method further includes periodically verifying that previously backed up data is being retained by the computers committed to act as backup partners in accordance with the agreements. In another embodiment, the method provides a distributed cooperative backing up of data in a system that includes a loose confederation of computers connected via a network. In this embodiment the method includes selecting computers as potential backup partners from among the loose confederation of computers connected via the network based on predetermined criteria, and negotiating a reciprocal backup partnership agreement between the computers based on predetermined requirements, including backup requirements.
    Type: Grant
    Filed: September 22, 2000
    Date of Patent: May 5, 2009
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Andrew David Birrell, Mark David Lillibridge, Michael Burrows, Michael Acheson Isard
  • Publication number: 20090113251
    Abstract: A method for analyzing the performance of a video game uses a diagnostic tool that is associated with application code of the video game. The diagnostic tool is activated when the video game is in operation, and real-time performance data is captured and displayed. A warning is generated when a performance metric violates a pre-set condition. The warning may be displayed on a display screen that is used to provide information for rectifying the violation.
    Type: Application
    Filed: October 26, 2007
    Publication date: April 30, 2009
    Applicant: Microsoft Corporation
    Inventors: Andrew Goossen, Parham Mohadjer, Matthew Kimball, John Howard Palevich, Juan Carlos Arevalo Baeza, Jason Matthew Gould, Matthew Lee, Michael Burrows, Karen Elaine Stevens, David Aronson
  • Patent number: 7428524
    Abstract: Each of a plurality of data items is stored in a table data structure. A row identifier and column identifier are associated with each respective data item, and each respective item is stored at a logical location in the table data structure specified by its row identifier and column identifier. A plurality of data items is stored in a cell of the table data structure, and a timestamp is associated with each of the plurality of data items stored in the cell. Each of the data items stored in the cell has the same row identifier, the same column identifier, and a distinct timestamp. In some embodiments, each row identifier is a string of arbitrary length and arbitrary value. Similarly, in some embodiments each column identifier is a string of arbitrary length and arbitrary value.
    Type: Grant
    Filed: August 5, 2005
    Date of Patent: September 23, 2008
    Assignee: Google Inc.
    Inventors: Michael Burrows, Fay Wen Chang, Jeffrey A. Dean, Andrew B. Fikes, Sanjay Ghemawat, Wilson C. Hsieh, Deborah Anne Wallach
  • Patent number: 7406460
    Abstract: A technique for ranking records of a database is disclosed. In one particular exemplary embodiment, the technique may be realized as a method for ranking records of a database located during a search of an index to the database performed in response to a query, wherein the index has a plurality of index entries, and wherein each index entry has a weight.
    Type: Grant
    Filed: April 20, 2004
    Date of Patent: July 29, 2008
    Assignee: Overture Services, Inc.
    Inventor: Michael Burrows
  • Patent number: 7383574
    Abstract: Undesirable behavior patterns of computers on a network impact network performance. A system and method are provided for limiting the impact of undesirable behavior of computers on the network. The network, through which packets of data are interchanged between the computers, includes one or more forwarding devices that are controlled or instructed by one or more packet traffic monitors. Each of the packet traffic monitors is configured for monitoring the packets; for determining if the information about the pattern of behavior from any of the computers is trustworthy; for determining, upon discovering that one or more of the patterns of behavior is undesirable, a type of the undesirable pattern behavior; and for determining a proper action for mitigating that type of undesirable behavior. The proper action is performed by mitigation means controlling the one or more forwarding devices.
    Type: Grant
    Filed: November 16, 2001
    Date of Patent: June 3, 2008
    Assignee: Hewlett Packard Development Company L.P.
    Inventors: Michael Burrows, Raymond P. Stata, Jeffrey Clifford Mogul
  • Patent number: 7293016
    Abstract: Indexed documents are arranged in the index according to a static ranking and partitioned according to static ranking. Index queries reference the first partition and move to a subsequent partition when a static rank for the subsequent partition is higher than a weighted portion of the target score added to a weighted portion of a dynamic rank corresponding to the relevance of the results set generated thus far. By changing the weight of the target score and dynamic ranks in the subsequent partition score, searches can be stopped when no more relevant results will be found in the next partition.
    Type: Grant
    Filed: January 22, 2004
    Date of Patent: November 6, 2007
    Assignee: Microsoft Corporation
    Inventors: Darren Shakib, Gaurav Sareen, Michael Burrows
  • Patent number: 7260583
    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: December 16, 2003
    Date of Patent: August 21, 2007
    Assignee: Overture Services, Inc.
    Inventors: Janet Lynn Wiener, Michael Burrows
  • Patent number: 7254689
    Abstract: In an embodiment of the present invention, the computational efficiency of decoding of block-sorted compressed data is improved by ensuring that more than one set of operations corresponding to a plurality of paths through a mapping array T are being handled by a processor. This sequence of operations, including instructions from the plurality of sets of operations, ensures that there is another operation in the pipeline if a cache miss on any given lookup operation in the mapping array results in a slower main memory access. In this way, the processor utilization is improved. While the sets of operations in the sequence of operations are independent of another other, there will be an overlap of a plurality of the main memory access operations due to the long time required for main memory access.
    Type: Grant
    Filed: July 15, 2004
    Date of Patent: August 7, 2007
    Assignee: Google Inc.
    Inventors: Sean M. Dorward, Sean Quinlan, Michael Burrows
  • Publication number: 20070033354
    Abstract: Each of a plurality of data items is stored in a table data structure. A row identifier and column identifier are associated with each respective data item, and each respective item is stored at a logical location in the table data structure specified by its row identifier and column identifier. A plurality of data items is stored in a cell of the table data structure, and a timestamp is associated with each of the plurality of data items stored in the cell. Each of the data items stored in the cell has the same row identifier, the same column identifier, and a distinct timestamp. In some embodiments, each row identifier is a string of arbitrary length and arbitrary value. Similarly, in some embodiments each column identifier is a string of arbitrary length and arbitrary value.
    Type: Application
    Filed: August 5, 2005
    Publication date: February 8, 2007
    Inventors: Michael Burrows, Fay Chang, Jeffrey Dean, Andrew Fikes, Sanjay Ghemawat, Wilson Hsieh, Deborah Wallach
  • Patent number: 7149801
    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: Grant
    Filed: November 8, 2002
    Date of Patent: December 12, 2006
    Assignee: Microsoft Corporation
    Inventors: Michael Burrows, Martin Abadi, Mark Steven Manasse, Edward P. Wobber, Daniel Ron Simon