专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US10010308B2 System and method for CT-guided needle biopsy 有权
公开(公告)号：US10010308B2
公开(公告)日：2018-07-03
申请号：US14232979
申请日：2012-07-20
申请人： Yu Zhou , Kaarvannan Thiruvalluvan , Lukasz Krzeminski , William H. Moore , Zhigang Xu , Zhengrong Liang
发明人： Yu Zhou , Kaarvannan Thiruvalluvan , Lukasz Krzeminski , William H. Moore , Zhigang Xu , Zhengrong Liang
IPC分类号： A61B6/03 , A61B10/04 , A61B10/02 , A61B6/00 , A61B8/08 , G01R33/28 , G01R33/48 , A61B34/30 , G06T7/246 , A61B34/20 , A61B90/00
CPC分类号： A61B10/04 , A61B6/032 , A61B6/486 , A61B6/506 , A61B6/5217 , A61B8/0841 , A61B10/0233 , A61B34/20 , A61B34/30 , A61B90/39 , A61B2010/045 , A61B2034/2057 , A61B2034/2063 , A61B2090/374 , A61B2090/3762 , A61B2090/3937 , G01R33/285 , G01R33/4812 , G01R33/4814 , G06T7/251 , G06T2207/10081 , G06T2207/30064
摘要： An image-guided system and method for performing needle biopsy on a moving lung nodule of a body is provided. CT images of the lung nodule are obtained to generate a motion model, based on which an optimal needle advancing path is determined. The motion of the lung nodule and the motion of a fiducial marker attached to the body are correlated. The motion of the fiducial marker is tracked and monitored by a camera to determine a position of the lung nodule based on the correlation. A time for advancing the needle is determined based on a motion attribute of the reference. The needle is advanced by a robotic needle manipulator at the predetermined time along the path to accomplish the needle placement.

2. 发明申请

US20150073259A1 SYSTEM AND METHOD FOR CT-GUIDED NEEDLE BIOPSY 有权
标题翻译： CT指导针生物系统与方法
公开(公告)号：US20150073259A1
公开(公告)日：2015-03-12
申请号：US14232979
申请日：2012-07-20
申请人： Yu Zhou , Kaarvannan Thiruvalluvan , Lukasz Krzeminski , William H. Moore , Zhigang Xu , Zhengrong Liang
发明人： Yu Zhou , Kaarvannan Thiruvalluvan , Lukasz Krzeminski , William H. Moore , Zhigang Xu , Zhengrong Liang
IPC分类号： A61B10/04 , A61B19/00 , A61B10/02 , G01R33/28 , G01R33/48 , A61B8/08 , G06T7/20 , A61B6/03
CPC分类号： A61B10/04 , A61B6/032 , A61B6/486 , A61B6/506 , A61B6/5217 , A61B8/0841 , A61B10/0233 , A61B34/20 , A61B34/30 , A61B90/39 , A61B2010/045 , A61B2034/2057 , A61B2034/2063 , A61B2090/374 , A61B2090/3762 , A61B2090/3937 , G01R33/285 , G01R33/4812 , G01R33/4814 , G06T7/251 , G06T2207/10081 , G06T2207/30064
摘要： An image-guided system and method for performing needle biopsy on a moving lung nodule of a body is provided. CT images of the lung nodule are obtained to generate a motion model, based on which an optimal needle advancing path is determined. The motion of the lung nodule and the motion of a fiducial marker attached to the body are correlated. The motion of the fiducial marker is tracked and monitored by a camera to determine a position of the lung nodule based on the correlation. A time for advancing the needle is determined based on a motion attribute of the reference. The needle is advanced by a robotic needle manipulator at the predetermined time along the path to accomplish the needle placement.
摘要翻译：提供了一种用于对身体的移动的肺结节进行针刺活检的图像引导系统和方法。获得肺结节的CT图像以产生运动模型，基于此确定最佳针推进路径。肺结节的运动和附着于身体的基准标记的运动是相关的。基准标记的运动由相机进行跟踪和监测，以根据相关性确定肺结节的位置。基于参考的运动属性确定推进针的时间。该针在机器人针机械手沿着路径的预定时间前进，以完成针放置。

3. 发明授权

US08341342B1 Storage system with incremental multi-dimensional RAID 有权
标题翻译：带增量多维RAID的存储系统
公开(公告)号：US08341342B1
公开(公告)日：2012-12-25
申请号：US13428817
申请日：2012-03-23
申请人： Jeffrey S. Bonwick , William H. Moore
发明人： Jeffrey S. Bonwick , William H. Moore
IPC分类号： G06F12/00
CPC分类号： G06F11/1076 , G06F2211/1057
摘要： A method for storing data including receiving a request to write data and in response the request, selecting a RAID grid location in a RAID grid to write the data. The method further includes writing the data to memory, updating a data structure to indicate that the RAID grid location is filled, identifying a parity value in the RAID grid to update, where the parity value is associated with a second RAID grid location in the RAID grid, updating the parity value using the data and the parity value to obtain an updated parity value and storing the updated parity value in the memory. Prior to the first data grid being filled determining a physical address in persistent storage corresponding to the RAID grid location and writing the data to the first physical address.
摘要翻译：一种用于存储数据的方法，包括接收写入数据的请求，并且响应该请求，在RAID网格中选择RAID网格位置以写入数据。该方法还包括将数据写入存储器，更新数据结构以指示RAID网格位置被填充，识别RAID网格中的奇偶校验值进行更新，其中奇偶校验值与RAID中的第二RAID网格位置相关联网格，使用数据和奇偶校验值来更新奇偶校验值，以获得更新的奇偶校验值，并将更新的奇偶校验值存储在存储器中。在第一数据网格被填充之前，确定与RAID网格位置相对应的持久存储器中的物理地址，并将数据写入第一物理地址。

4. 发明申请

US20110178997A1 METHOD AND SYSTEM FOR ATTRIBUTE ENCAPSULATED DATA RESOLUTION AND TRANSCODING 有权
标题翻译：用于属性数据分解和传输的方法和系统
公开(公告)号：US20110178997A1
公开(公告)日：2011-07-21
申请号：US12688458
申请日：2010-01-15
申请人： Darrin P. Johnson , William H. Moore , Eric C. Saxe
发明人： Darrin P. Johnson , William H. Moore , Eric C. Saxe
IPC分类号： G06F17/00
CPC分类号： G06F17/30091
摘要： A computer readable medium having software instructions that, when executed, perform a method for preserving data stored in a file system with a plurality of files. The method involves determining whether storage capacity of the file system has reached a threshold level, wherein the threshold level is stored in at least one of a plurality of size-reducing policies, obtaining a criterion from the at least one size-reducing policy, identifying a subset of the plurality of files that match the criterion, accessing metadata of each of the identified subset of files, wherein the metadata of each of the identified subset of files comprises at least one option for reducing a size of the file, and performing a size-reducing action to reduce a size of each of the identified subset of files based on the option for reducing the size of each of the identified subset of files and the criterion.
摘要翻译：一种具有软件指令的计算机可读介质，所述软件指令在执行时执行用于保存存储在具有多个文件的文件系统中的数据的方法。该方法包括确定文件系统的存储容量是否已经达到阈值水平，其中阈值水平存储在多个减小尺寸的策略中的至少一个中，从至少一个减小尺寸的策略获得标准，识别所述多个文件的与所述标准相匹配的子集，访问所识别的每个所述文件的元数据，其中所识别的每个所述文件的元数据包括用于减小所述文件大小的至少一个选项，基于用于减小所识别的每个文件的大小的大小的选项和标准来减小每个所识别的文件子集的大小的减小大小的动作。

5. 发明授权

US07743225B2 Ditto blocks 有权
标题翻译：同上个块
公开(公告)号：US07743225B2
公开(公告)日：2010-06-22
申请号：US11406590
申请日：2006-04-19
申请人： Jeffrey S. Bonwick , William H. Moore , Matthew A. Ahrens
发明人： Jeffrey S. Bonwick , William H. Moore , Matthew A. Ahrens
IPC分类号： G06F12/00 , G06F13/00 , G06F13/28
CPC分类号： G06F3/065 , G06F3/061 , G06F3/0644 , G06F3/0683 , G06F11/1435 , G06F11/2056
摘要： A method for storing a data block in a storage pool, including receiving a write operation for the data block, writing the data block into the storage pool, determining a first indirect block to store in the storage pool, wherein the first indirect block references the data block, writing the first indirect block to a first location in the storage pool, creating a copy of the first indirect block, and writing the copy of first indirect block to a second location in the storage pool.
摘要翻译：一种用于将数据块存储在存储池中的方法，包括接收对数据块的写入操作，将数据块写入存储池，确定存储在存储池中的第一间接块，其中第一间接块引用数据块，将所述第一间接块写入所述存储池中的第一位置，创建所述第一间接块的副本，以及将所述第一间接块的副本写入所述存储池中的第二位置。

6. 发明授权

US07716519B2 Method and system for repairing partially damaged blocks 有权
标题翻译：修复部分损坏块的方法和系统
公开(公告)号：US07716519B2
公开(公告)日：2010-05-11
申请号：US11406578
申请日：2006-04-19
申请人： William H. Moore , Jeffrey S. Bonwick
发明人： William H. Moore , Jeffrey S. Bonwick
IPC分类号： G06F11/00
CPC分类号： G11B20/1803 , G06F11/1076 , G06F2211/1014 , G06F2211/1059 , G11B20/1833
摘要： A method for reconstructing a logical block, wherein the logical block comprises a first set of sectors. The method including obtaining a copy of the logical block comprising a second set of sectors, determining which of the sectors in the first set of sectors are identical to sectors in the second set of sectors to obtain identical sectors, selecting a first combination of non-identical sectors from the first set of sectors and the second set of sectors, combining a copy of each of the identical sectors with the first combination of non-identical sectors to obtain a first reconstructed logical block, calculating a first checksum for the first reconstructed logical block, and determining whether the first calculated checksum is equal to the stored checksum associated with the first logical block.
摘要翻译：一种用于重建逻辑块的方法，其中所述逻辑块包括第一组扇区。该方法包括获得包括第二组扇区的逻辑块的副本，确定第一组扇区中的哪个扇区与第二组扇区中的扇区相同以获得相同的扇区，选择非均匀扇区的第一组合，从第一组扇区和第二组扇区相同的扇区，将每个相同扇区的副本与非相同扇区的第一组合组合以获得第一重构逻辑块，计算第一重构逻辑的第一校验和并且确定所述第一计算的校验和是否等于与所述第一逻辑块相关联的所存储的校验和。

7. 发明授权

US07533225B1 Method and apparatus for enabling adaptive endianness 有权
标题翻译：实现自适应字节顺序的方法和装置
公开(公告)号：US07533225B1
公开(公告)日：2009-05-12
申请号：US10919886
申请日：2004-08-17
申请人： Jeffrey S. Bonwick , William H. Moore , Matthew A. Ahrens
发明人： Jeffrey S. Bonwick , William H. Moore , Matthew A. Ahrens
IPC分类号： G06F13/00
CPC分类号： G06F13/4027
摘要： A method for reading a block, involving receiving a request to obtain the block, wherein the request comprises a block pointer, determining a block endianness by reading an endianness bit, obtaining the block using the block pointer, and byte-swapping data in the block to obtain a byte-swapped block, if a host endianness does not match the block endianness.
摘要翻译：一种用于读取块的方法，包括接收获得所述块的请求，其中所述请求包括块指针，通过读取字节序位确定块的字节顺序，使用块指针获取块，以及块中的字节交换数据以获得一个字节交换的块，如果一个主机字节不匹配块的字节顺序。

8. 发明授权

US07469320B2 Adaptive replacement cache 有权
标题翻译：自适应替换缓存
公开(公告)号：US07469320B2
公开(公告)日：2008-12-23
申请号：US11417078
申请日：2006-05-03
申请人： Jeffrey S. Bonwick , William H. Moore , Mark J. Maybee , Matthew A. Ahrens
发明人： Jeffrey S. Bonwick , William H. Moore , Mark J. Maybee , Matthew A. Ahrens
IPC分类号： G06F12/00
CPC分类号： G06F12/122 , G06F12/0802 , G06F12/123
摘要： A method for caching a block, which includes receiving a request to store the block in a cache and determining whether the cache is able to expand. If the cache is not able to expand, then determining whether evictable blocks are present in the cache and, if evictable blocks are present in the cache determining whether a total size of the evictable blocks is greater than or equal to a size of the block, evicting a sufficient number of the evictable blocks from the cache and storing the block in the cache, if the total size of the evictable blocks is greater than or equal to the size of the block, and activating a cache throttle, if the total size of the evictable blocks is less than the size of the block.
摘要翻译：一种用于缓存块的方法，其包括接收将所述块存储在高速缓存中并且确定所述高速缓存是否能够扩展的请求。如果高速缓存不能扩展，则确定可缓存块是否存在于高速缓存中，并且如果可缓存的块存在于高速缓存中，确定可驱动块的总大小是否大于或等于块的大小，如果所述可驱动块的总大小大于或等于所述块的大小，并将所述块存储在所述高速缓存中，则将所述可驱动块的足够数量从所述高速缓存中驱出并将所述块存储在所述高速缓存中，并且如果所述块的总大小可驱动的块小于块的大小。

9. 发明申请

US20080104150A1 Method and system for priority-based allocation in a storage pool 有权
标题翻译：存储池中基于优先级分配的方法和系统
公开(公告)号：US20080104150A1
公开(公告)日：2008-05-01
申请号：US11591425
申请日：2006-10-31
申请人： William H. Moore , Darrin P. Johnson , Jeffrey S. Bonwick , Tabriz I. Holtz
发明人： William H. Moore , Darrin P. Johnson , Jeffrey S. Bonwick , Tabriz I. Holtz
IPC分类号： G06F17/30
CPC分类号： G06F3/0638 , G06F3/0608 , G06F3/064 , G06F3/0683 , Y10S707/99956
摘要： A method for priority-based allocation in a storage pool involves receiving a request to write a data item in the storage pool, where the storage pool includes multiple metaslabs, and where each of the metaslabs includes a contiguous region of data. The method further involves determining a target metaslab selected from the multiple metaslabs by comparing multiple allocation priorities, where each of the allocation priorities is associated with one of the metaslabs, allocating a block to the target metaslab, and writing the block to the target metaslab, where the block includes a portion of the data item.
摘要翻译：用于存储池中基于优先级分配的方法包括接收在存储池中写入数据项的请求，其中存储池包括多个元数据库，并且其中每个元数据包括数据的连续区域。该方法还包括通过比较多个分配优先级来确定从多个元搜索中选择的目标元模型，其中每个分配优先级与元数据库之一相关联，向目标元数据分配块，并将该块写入目标元数据库，其中块包括数据项的一部分。

10. 发明授权

US07305537B1 Method and system for I/O scheduler activations 有权
标题翻译：用于I / O调度程序激活的方法和系统
公开(公告)号：US07305537B1
公开(公告)日：2007-12-04
申请号：US11069176
申请日：2005-03-01
申请人： William H. Moore , Jeffrey S. Bonwick
发明人： William H. Moore , Jeffrey S. Bonwick
IPC分类号： G06F12/00
CPC分类号： G06F3/0659 , G06F3/0611 , G06F3/0683
摘要： A method for storing data, that includes receiving a request to store data in a storage pool, queuing the request in an Input/Output (I/O) queue, and issuing the request from the I/O queue upon receipt of a completion interrupt from the storage pool.
摘要翻译：一种用于存储数据的方法，包括接收将数据存储在存储池中的请求，将请求排队在输入/输出（I / O）队列中，以及在接收到完成中断时从I / O队列发出请求从存储池。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式