会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Methods of using a silicon nanoparticle fluid to control in situ a set of dopant diffusion profiles
    • 使用硅纳米颗粒流体原位控制一组掺杂剂扩散分布的方法
    • US08163587B2
    • 2012-04-24
    • US12506811
    • 2009-07-21
    • Giuseppe ScarderaDmitry PoplavskyyMichael BurrowsSunil Shah
    • Giuseppe ScarderaDmitry PoplavskyyMichael BurrowsSunil Shah
    • H01L21/22
    • H01L21/2255H01L31/068Y02E10/547
    • 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., and for a second time period of about 5 minutes to about 35 minutes. The method also includes heating the substrate in a drive-in ambient to a third temperature of between about 800° C. and about 1100° C.
    • 公开了一种在衬底上形成多掺杂结的方法。 所述方法包括提供掺杂有硼原子的衬底,所述衬底包括前衬底表面,以及以油墨图案在所述前衬底表面上沉积墨,所述油墨包括一组纳米颗粒和一组溶剂。 该方法还包括将烘烤环境中的基材加热至约200℃至约800℃的第一温度和约3分钟至约20分钟的第一时间段,以便产生致密化的膜 墨水图案。 该方法还包括在具有沉积环境的扩散炉中将衬底暴露于掺杂剂源,沉积环境包括POCl 3,载体N2气体,主N 2气体和反应性O 2气体,其中载气N2气体 至反应性O 2气体的摩尔比为约1:1至约1.5:1,第二温度为约700℃至约1000℃,第二时间为约5分钟至约35分钟。 该方法还包括将驱动环境中的衬底加热至约800℃至约1100℃的第三温度。
    • 3. 发明授权
    • Dual cookie security system
    • 双重Cookie安全系统
    • US07779103B1
    • 2010-08-17
    • US11609841
    • 2006-12-12
    • Andrew B. FikesMichael BurrowsMarius SchilderRobert C. Pike
    • Andrew B. FikesMichael BurrowsMarius SchilderRobert C. Pike
    • G06F15/16
    • G06F21/6263
    • 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.
    • 一个或多个服务器接收来自客户端的请求并发送响应。 响应的至少一部分包括由一个或多个服务器产生的cookie,以及至少一个接收到的请求的子集,包括先前由一个或多个服务器生成并发送给具有对先前处理的请求的响应的客户端的cookie。 每个Cookie包括相应的用户标识符。 一个或多个服务器分析接收到的cookie以检测第一条件,其指示相应的多个客户端可以使用具有共享用户标识符的cookie。 在检测到第一条件时,一个或多个服务器向相应多个客户端中的至少一个客户端发送包括具有与共享用户标识符不同的用户标识符的新cookie的响应。
    • 6. 发明授权
    • Decompression of block-sorted data
    • 块排序数据的解压缩
    • US07254689B1
    • 2007-08-07
    • US10892988
    • 2004-07-15
    • Sean M. DorwardSean QuinlanMichael Burrows
    • Sean M. DorwardSean QuinlanMichael Burrows
    • G06F12/00G06F13/00G06F13/28
    • G06F12/0802G06F2212/401
    • 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.
    • 在本发明的一个实施例中,通过确保通过映射阵列T的多个路径对应的多于一组的操作正由处理器处理,来提高对块分类压缩数据的解码的计算效率。 包括来自多组操作的指令的操作序列确保如果在映射阵列中的任何给定的查找操作上的高速缓存未命中导致较慢的主存储器访问,则存在流水线中的另一操作。 以这种方式,处理器利用率得到改善。 虽然操作序列中的操作集合独立于另一操作,但是由于主存储器访问所需的长时间,将存在多个主存储器访问操作的重叠。
    • 7. 发明申请
    • Super-resolution based on frequency domain interferometric processing of sparse multi-sensor measurements
    • 基于稀疏多传感器测量的频域干涉处理的超分辨率
    • US20060077091A1
    • 2006-04-13
    • US11130746
    • 2005-05-17
    • Pei-Rin WuMichael BurrowsGordon Dryden
    • Pei-Rin WuMichael BurrowsGordon Dryden
    • G01S13/90
    • G01S13/88G01S13/89G01S15/87G01S17/87
    • 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. The estimation system follows the mutual coherent sub-system to reconcile the ambiguous and unambiguous range estimates so as to obtain a target signature with a super-resolution defined by a frequency offset between the first and second sub-bands.
    • 一种用于获得具有第一和第二相干收发器,相互相干子系统和估计系统的目标散射体的频域干涉超分辨率的系统。 第一和第二相干收发器可操作以分别产生在第一和第二子带内彼此分离预定频率差的多个第一和第二采样信号。 相互相干子系统耦合到第一和第二相干收发器以接收第一和第二采样信号的相位和幅度,以便从一对第一和第二采样信号和无歧义范围中评估模糊范围估计 从一对第一和/或第二采样信号估计。 估计系统遵循相互相干子系统以协调不明确和明确的范围估计,以便获得具有由第一和第二子带之间的频率偏移定义的超分辨率的目标签名。
    • 8. 发明申请
    • Web page connectivity server construction
    • 网页连接服务器构建
    • US20050033745A1
    • 2005-02-10
    • US10737729
    • 2003-12-16
    • Janet WienerMichael Burrows
    • Janet WienerMichael Burrows
    • G06F17/30
    • G06F17/30861G06F17/3061Y10S707/99942Y10S707/99943Y10S707/99945
    • 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.
    • 一种用于构建用于收集,排列和存储定义万维网(Web)上页面连通性的数据的服务器的过程。 过程输入是一组压缩的ASCII链接文件,其中每个链接文件是一系列源URL和对应的目标URL。 临时的URL_info表被创建和初始化。 读取链接文件和URL元数据。 将唯一URL的缓冲区从链接文件中排序并写入URL运行。 从URL_info表创建ID索引。 CS_ids被分配给URL并写入ID Index。 创建压缩的URL数据结构和URL索引。 创建主机表。 URL指纹被转换为CS_ids,并且创建初始超时到CS_ids和初始outstart和outlinks表。 压缩的outstarts和outlinks表是从初步表创建的。 随后,基于outstarts和outlinks表创建压缩的instarts和inlinks表。
    • 10. 发明授权
    • Method for optimizing entries for searching an index
    • 优化用于搜索索引的条目的方法
    • US5852820A
    • 1998-12-22
    • US689542
    • 1996-08-09
    • Michael Burrows
    • Michael Burrows
    • G06F17/30
    • G06F17/30622Y10S707/99932Y10S707/99933Y10S707/99934Y10S707/99943
    • A computerized method optimizes an index of information stored as records of a database in response to queries made to the index. The index is generated by storing index entries in a memory. Each index entry includes a word entry immediately followed by one or more location entries. The word entry encodes a unique portion of information of the records, and the location entries encode occurrences of the unique portion of information in the records. A query phrase is processed, the phrase corresponds to a concatenation of adjacent portions of indexed information. A measure of the amount of time required to process the phrase is recorded in a journal. Periodically, the journal is processed and new index entries are generated for the phrases if the processing of the phrase exceeds some predetermined threshold time.
    • 计算机化方法优化响应于对索引的查询而存储为数据库的记录的信息索引。 索引是通过将索引条目存储在内存中来生成的。 每个索引条目包括一个单词条目,紧接着一个或多个位置条目。 单词条目对记录的信息的唯一部分进行编码,并且位置条目编码记录中唯一部分信息的出现。 处理查询短语,该短语对应于索引信息的相邻部分的级联。 处理短语所需的时间量的度量记录在日记中。 定期地,如果短语的处理超过某个预定的阈值时间,则处理该日记并为该短语生成新的索引条目。