公开(公告)号：US20120083054A1

公开(公告)日：2012-04-05

申请号：US13239814

申请日：2011-09-22

Applicant: Andreas Meisel ,  Michael Burrows ,  Homer Antoniadis

Inventor： Andreas Meisel ,  Michael Burrows ,  Homer Antoniadis

IPC: H01L21/66

CPC classification number: H01L31/1804 ,  H01L22/12 ,  H01L31/022425 ,  Y02E10/547 ,  Y02P70/521

Abstract: The disclosure relates to a method of aligning a set of patterns on a substrate, which includes depositing on the substrate's surface a set of silicon nanoparticles, which includes a set of ligand molecules including a set of carbon atoms. The method involves forming a first set of regions where the nanoparticles are deposited, while the remaining portions of the substrate surface define a second set of regions. The method also includes densifying the set of nanoparticles into a thin film to form a set of silicon-organic zones on the substrate's surface, wherein the first and the second set of regions have respectively first and second reflectivity values, such that the ratio of the second reflectivity value to the first reflectivity value is greater than about 1.1.

Abstract translation: 本公开涉及一种在衬底上对准一组图案的方法，其包括在衬底表面上沉积一组硅纳米颗粒，其包括一组包含一组碳原子的配体分子。 该方法包括形成沉积纳米颗粒的第一组区域，而衬底表面的其余部分限定第二组区域。 该方法还包括将该组纳米颗粒致密化成薄膜以在基底表面上形成一组硅 - 有机区域，其中第一和第二组区域分别具有第一和第二反射率值，使得 第一反射率值的第二反射率值大于约1.1。

公开(公告)号：US08048814B2

公开(公告)日：2011-11-01

申请号：US12468540

申请日：2009-05-19

Applicant: Andreas Meisel ,  Michael Burrows ,  Homer Antoniadis

Inventor： Andreas Meisel ,  Michael Burrows ,  Homer Antoniadis

IPC: H01L21/47

CPC classification number: H01L31/1804 ,  H01L22/12 ,  H01L31/022425 ,  Y02E10/547 ,  Y02P70/521

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.

Abstract translation: 公开了一种在衬底上对准一组图案的方法，该衬底包括衬底表面。 该方法包括在衬底表面上沉积一组硅纳米颗粒，所述纳米颗粒组包括一组包含一组碳原子的配体分子，其中形成第一组区域，其中沉积硅纳米颗粒，其余部分 衬底表面限定第二组区域。 所述方法还包括将所述一组硅纳米颗粒致密化成薄膜，其中在基底表面上形成一组硅 - 有机区，其中所述第一组区具有第一反射率值，并且所述第二组区具有第二反射率 值。 该方法还包括用照明源照射衬底表面，其中第二反射率值与第一反射率值的比值大于约1.1。

公开(公告)号：US20100136718A1

公开(公告)日：2010-06-03

申请号：US12468540

申请日：2009-05-19

Applicant: Andreas Meisel ,  Michael Burrows ,  Homer Antoniadis

Inventor： Andreas Meisel ,  Michael Burrows ,  Homer Antoniadis

IPC: H01L21/66 ,  B05C19/00

CPC classification number: H01L31/1804 ,  H01L22/12 ,  H01L31/022425 ,  Y02E10/547 ,  Y02P70/521

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.

Abstract translation: 公开了一种在衬底上对准一组图案的方法，该衬底包括衬底表面。 该方法包括在衬底表面上沉积一组硅纳米颗粒，所述纳米颗粒组包括一组包含一组碳原子的配体分子，其中形成第一组区域，其中沉积硅纳米颗粒，其余部分 衬底表面限定第二组区域。 所述方法还包括将所述一组硅纳米颗粒致密化成薄膜，其中在基底表面上形成一组硅 - 有机区，其中所述第一组区具有第一反射率值，并且所述第二组区具有第二反射率 值。 该方法还包括用照明源照射衬底表面，其中第二反射率值与第一反射率值的比值大于约1.1。

公开(公告)号：US07617226B1

公开(公告)日：2009-11-10

申请号：US11352025

申请日：2006-02-10

Applicant: Michael Burrows ,  Jeffrey A. Dean

Inventor： Michael Burrows ,  Jeffrey A. Dean

IPC: G06F17/30 ,  G06F7/00

CPC classification number: G06F17/30067 ,  Y10S707/99942 ,  Y10S707/99943 ,  Y10S707/99953

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.

Abstract translation: 令牌空间存储库将文档存储为一系列令牌。 令牌空间存储库以及令牌空间存储库的反向索引使用的数据结构具有第一端和第二端，并允许在第二端插入和从前端删除。 通过将更新后的版本插入到第二个版本的存储库并使较早的版本无效，可以更新令牌空间存储库中的文档。 无效的文件不会立即删除; 它们被标识在垃圾收集列表中以供稍后的垃圾收集。 令牌空间存储库能够将无效文档转移到前端，此时它们可能会被删除，并恢复其存储空间。

公开(公告)号：US07529834B1

公开(公告)日：2009-05-05

申请号：US09668643

申请日：2000-09-22

Applicant: Andrew David Birrell ,  Mark David Lillibridge ,  Michael Burrows ,  Michael Acheson Isard

Inventor： Andrew David Birrell ,  Mark David Lillibridge ,  Michael Burrows ,  Michael Acheson Isard

IPC: G06F15/173 ,  G06F15/16 ,  G06F11/00

CPC classification number: G06F11/1464 ,  Y10S707/99953

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. Once the negotiations are complete and the agreements are made, the method proceeds to form partnerships between the computers. The computers become backup partners by agreeing to cooperatively provide backup services to each other so that a distributed cooperative backing up of data can be administered in the absence of central control. The method further includes periodically backing up data at the backup partners, where the data being backed up is encoded. The method also includes periodically verifying that previously backed up data is retained by the backup partners. Another aspect of the invention is a distributed cooperative backup system that includes a network and a loose confederation of computers connected via the network. A plurality of computers from among the loose confederation of computers is configured for distributed cooperative backing up of data and for functioning as backup partners. Each computer of the plurality of computers has a storage that can be used for providing reciprocal backup services. Each computer of the plurality of computers respectively also has a computer readable medium embodying computer program code configured to cause the computer to perform functions comparable to the method steps as described above.

公开(公告)号：US07293016B1

公开(公告)日：2007-11-06

申请号：US10762823

申请日：2004-01-22

Applicant: Darren Shakib ,  Gaurav Sareen ,  Michael Burrows

Inventor： Darren Shakib ,  Gaurav Sareen ,  Michael Burrows

IPC: G06F17/30 ,  G06F7/00

CPC classification number: G06F17/30864 ,  G06F17/30622 ,  Y10S707/99933 ,  Y10S707/99937 ,  Y10S707/99943

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.

Abstract translation: 索引文件根据静态排序排列在索引中，并根据静态排名进行分区。 索引查询引用第一个分区并移动到后续分区，当后续分区的静态排名高于添加到对应于迄今为止生成的结果集的相关性的动态排名的加权部分的目标分数的加权部分 。 通过在随后的分区分数中更改目标分数和动态排名的权重，可以在下一个分区中找不到更多的相关结果时停止搜索。

公开(公告)号：US07149801B2

公开(公告)日：2006-12-12

申请号：US10290879

申请日：2002-11-08

Applicant: Michael Burrows ,  Martin Abadi ,  Mark Steven Manasse ,  Edward P. Wobber ,  Daniel Ron Simon

Inventor： Michael Burrows ,  Martin Abadi ,  Mark Steven Manasse ,  Edward P. Wobber ,  Daniel Ron Simon

IPC: G06F15/173 ,  H04K1/00

CPC classification number: H04L63/126 ,  H04L51/12

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.

Abstract translation: 如果用户投入很少或没有成本，资源可能会被滥用。 例如，电子邮件滥用是猖獗的，因为发送电子邮件对发件人的成本可以忽略不计。 通过以中等昂贵的计算的形式引入人造成本，可能不鼓励这种滥用。 因此，电子邮件的发件人可能需要在电子邮件被接受之前几秒计算才能付款。 不幸的是，由于计算机系统之间的差异很大，对于具有高端系统的恶意用户来说，这种方法可能无效，对于具有低端系统的合法用户或者两者都是非常缓慢的。 从这个观察开始，我们确定了最近的计算机系统以相同的速度评估的适度硬的记忆绑定功能，我们解释如何使用它们来防止滥用。

公开(公告)号：US07028039B2

公开(公告)日：2006-04-11

申请号：US09766336

申请日：2001-01-18

Applicant: Michael Burrows ,  Keith H. Randall ,  Raymond P. Stata ,  Rajiv G. Wickremesinghe

Inventor： Michael Burrows ,  Keith H. Randall ,  Raymond P. Stata ,  Rajiv G. Wickremesinghe

IPC: G06F7/00

CPC classification number: G06F17/30864 ,  G06F17/3061 ,  Y10S707/99937 ,  Y10S707/99942 ,  Y10S707/99943

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. The second link processing module delta encodes the set of deletes and delta encodes the set of adds for each respective row, and then Huffman codes the delta encoded set of deletes and delta encoded set of adds for each respective row.

公开(公告)号：US20050210258A1

公开(公告)日：2005-09-22

申请号：US10806020

申请日：2004-03-22

Applicant: Andrew Birrell ,  Michael Burrows ,  Edward Wobber

Inventor： Andrew Birrell ,  Michael Burrows ,  Edward Wobber

IPC: G06F13/00 ,  H04L12/58 ,  H04L29/06 ,  H04L29/08 ,  H04L9/00

CPC classification number: H04L63/1458 ,  H04L51/12 ,  H04L67/104 ,  H04L67/1065

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.

Abstract translation: 提供了用于维护密码拼图标识符数据库的取消服务器的方法和系统。 密码拼图是从唯一标识符和时间戳创建的，并附加到电子邮件消息以及拼图的解决方案。 收件人验证解决方案是否正确，并且时间戳是最新的，并且进一步使用拼图标识符查询取消服务器。 如果数据库中不存在标识符，则接收方知道接收到的消息是合法的。 如果标识符已经出现在数据库中，则可以从收件人的计算机中自动删除接收到的消息。

公开(公告)号：US06377530B1

公开(公告)日：2002-04-23

申请号：US09249182

申请日：1999-02-12

Applicant: Michael Burrows

Inventor： Michael Burrows

IPC: G11B390

CPC classification number: G11B31/02 ,  G11B31/003

Abstract: A portable audio player stores a large amount of compressed audio data on an internal disk drive, and loads a portion of this into an internal random access memory (RAM) which requires less power and less time to access. The audio player plays the data stored in RAM and monitors the amount of unplayed data. When the amount of unplayed data falls below a threshold, additional data is copied from the disk drive into RAM. When the portable audio player is turned off, a predetermined amount of audio data is stored in a fast-access non-volatile flash memory unit. When the audio player is turned back on, and play is resumed, a suitable portion of this data can be played while data is being loaded from the disk drive into RAM, thus reducing the amount of time a user must wait before receiving data in response to a play request.

Abstract translation: 便携式音频播放器将大量的压缩音频数据存储在内部磁盘驱动器上，并将其一部分加载到需要更少功率和更少访问时间的内部随机存取存储器（RAM）中。 音频播放器播放存储在RAM中的数据，并监视未播放数据的数量。 当未播放数据量低于阈值时，附加数据将从磁盘驱动器复制到RAM中。 当便携式音频播放器关闭时，预定量的音频数据被存储在快速访问非易失性闪存单元中。 当音频播放器被重新打开并且播放被恢复时，可以在将数据从磁盘驱动器加载到RAM中的同时播放该数据的适当部分，从而减少用户在接收数据之前必须等待的时间量 播放请求。