Extracting protobeams for cancer radiation therapy

    公开(公告)号:US09987501B1

    公开(公告)日:2018-06-05

    申请号:US15370953

    申请日:2016-12-06

    CPC classification number: A61N5/103 A61N2005/1087

    Abstract: A method and system are provided. The method includes condensing, by a processor, an original voxel-beamlet matrix stored in a memory device into a reduced dataset for proton beam simulation and therapy. The original voxel-beamlet matrix has a row for each of a plurality of voxels in a three-dimensional patient volume and a column for each of a plurality of radiation beamlets. The condensing step includes determining protobeams to be extracted from the original voxel-beamlet matrix. The protobeams are columns (i) selected from the original voxel-beamlet matrix based on comparisons performed between the columns in the original voxel-beamlet matrix or (ii) created by combining at least some of the columns in the original voxel-beamlet matrix, in a matrix condensing process. The condensing step further includes extracting the protobeams from the original voxel-beamlet matrix. The condensing step also includes storing the protobeams as the reduced dataset in the memory device.

    FAST AND ACCURATE PROTON THERAPY DOSE CALCULATIONS
    2.
    发明申请
    FAST AND ACCURATE PROTON THERAPY DOSE CALCULATIONS 有权
    快速和准确的方案治疗剂量计算

    公开(公告)号:US20150352374A1

    公开(公告)日:2015-12-10

    申请号:US14596940

    申请日:2015-01-14

    Abstract: Simulating particle beam interactions includes identifying a set of n functions F1, F2, . . . , Fn corresponding to a plurality of different physical aspects of a particle beam, performing simulations of each Fi using a full physics model, selecting for each Fi a distribution function fi that models relevant behavior and reducing computation of the full physics model for each Fi by replacing Fi with a distribution function fi. The computation reduction includes comparing a set of simulations wherein each fi replaces its respective Fi to determine if relevant behavior is accurately modeled and selecting one of fi or Fi for each n, for a Monte Carlo simulation based on a runtime and accuracy criteria.

    Abstract translation: 模拟粒子束相互作用包括识别一组n个函数F1,F2。 。 。 ,Fn对应于粒子束的多个不同物理方面,使用完整物理模型对每个Fi进行模拟,为每个Fi选择分配函数fi,其分配函数fi模拟相关行为,并减少每个Fi的完整物理模型的计算 用分配功能fi代替Fi。 计算减少包括比较一组模拟,其中每个fi替换其各自的Fi以确定相关行为是否被精确地建模,并且基于运行时间和准确度准则为蒙特卡罗模拟选择每个n的fi或Fi中的一个。

    Reordering the output of recirculated transactions within a pipeline
    3.
    发明授权
    Reordering the output of recirculated transactions within a pipeline 有权
    重新排列流水线内再循环交易的输出

    公开(公告)号:US09086871B2

    公开(公告)日:2015-07-21

    申请号:US14037891

    申请日:2013-09-26

    CPC classification number: G06F9/30138 G06F9/30101 G06F9/3867 G06F9/46

    Abstract: A mechanism is provided for recirculating transactions within a pipeline while reordering outputs. A set of transactions associated with a block of data is received and each transaction in the set of transactions is processed via the pipeline. For each transaction processed via the pipeline, responsive to the transaction exiting the pipeline, a determination is made as to whether the transaction needs further processing. Responsive to the transaction needing further processing, the transaction is re-circulated via the pipeline forming a recirculated transaction.

    Abstract translation: 提供了一种用于在管道内再循环事务的机制,同时重新排序输出。 接收与数据块相关联的一组事务,并且经由流水线处理事务集合中的每个事务。 对于通过流水线处理的每个事务,响应于退出流水线的事务,确定事务是否需要进一步处理。 响应于需要进一步处理的交易,交易通过管道重新流通,形成再循环交易。

    High bandwidth compression to encoded data streams
    4.
    发明授权
    High bandwidth compression to encoded data streams 有权
    高带宽压缩到编码数据流

    公开(公告)号:US08704686B1

    公开(公告)日:2014-04-22

    申请号:US13733354

    申请日:2013-01-03

    CPC classification number: H03M7/3086

    Abstract: A mechanism is provided in a data processing system for pipelined compression of multi-byte frames. The mechanism combines a current cycle of data in an input data stream with at least a portion of a next cycle of data in the input data stream to form a frame of data. The mechanism identifies a plurality of matches in a plurality of dictionary memories. Each match matches a portion of a given substring in the frame of data. The mechanism identifies a subset of matches from the plurality of matches that provides a best coverage of the current cycle of data. The mechanism encodes the frame of data into an encoded output data stream.

    Abstract translation: 在用于多字节帧的流水线压缩的数据处理系统中提供了一种机制。 该机制将输入数据流中的当前数据周期与输入数据流中的下一个周期的数据的至少一部分组合以形成数据帧。 该机构识别多个字典存储器中的多个匹配。 每个匹配匹配数据帧中给定子字符串的一部分。 该机制识别来自提供当前数据周期的最佳覆盖的多个匹配中的匹配子集。 该机制将数据帧编码为编码的输出数据流。

    Persistent logical to virtual table

    公开(公告)号:US10942659B2

    公开(公告)日:2021-03-09

    申请号:US16429871

    申请日:2019-06-03

    Abstract: Techniques for persisting a logical address-to-virtual address table in a solid state storage device are presented. An example method includes receiving a request to write data to a logical block address (LBA) in a memory component of the solid state storage device. The data is written to a location identified by a virtual block address (VBA) in the solid state storage device. The VBA is stored in a rotating dump table in a reserved logical unit of the solid state storage device. A mapping between the LBA and the VBA is stored in a rotating journal table located in the reserved logical unit. The rotating journal table is buffered such that a number of journal entries are stored in a buffer until a threshold number of journal entries are committed to the rotating journal table. A pointer to a current address in the rotating journal is stored in the buffer.

    Reordering the Output of Recirculated Transactions Within a Pipeline
    7.
    发明申请
    Reordering the Output of Recirculated Transactions Within a Pipeline 有权
    在管道内重新排序循环交易的输出

    公开(公告)号:US20150089128A1

    公开(公告)日:2015-03-26

    申请号:US14037891

    申请日:2013-09-26

    CPC classification number: G06F9/30138 G06F9/30101 G06F9/3867 G06F9/46

    Abstract: A mechanism is provided for recirculating transactions within a pipeline while reordering outputs. A set of transactions associated with a block of data is received and each transaction in the set of transactions is processed via the pipeline. For each transaction processed via the pipeline, responsive to the transaction exiting the pipeline, a determination is made as to whether the transaction needs further processing. Responsive to the transaction needing further processing, the transaction is re-circulated via the pipeline forming a recirculated transaction.

    Abstract translation: 提供了一种用于在管道内再循环事务的机制,同时重新排序输出。 接收与数据块相关联的一组事务,并且经由流水线处理事务集合中的每个事务。 对于通过流水线处理的每个事务,响应于退出流水线的事务,确定事务是否需要进一步处理。 响应于需要进一步处理的交易,交易通过管道重新流通,形成再循环交易。

    Selective recompression of a string compressed by a plurality of diverse lossless compression techniques
    8.
    发明授权
    Selective recompression of a string compressed by a plurality of diverse lossless compression techniques 有权
    通过多种不同的无损压缩技术压缩的字符串的选择性重新压缩

    公开(公告)号:US09106252B2

    公开(公告)日:2015-08-11

    申请号:US13780652

    申请日:2013-02-28

    CPC classification number: H03M7/3059 H03M7/6047 H03M7/607

    Abstract: In response to receiving an input string to be compressed, a plurality of diverse lossless compression techniques are applied to the input string to obtain a plurality of compressed strings. The plurality of diverse lossless compression techniques include a template-based compression technique and a non-template-based compression technique. A most compressed string among the plurality of compressed strings is selected. A determination is made regarding whether or not the most compressed string was obtained by application of the template-based compression technique. In response to determining that the most compressed string was obtained by application of the template-based compression technique, the most compressed string is compressed utilizing the non-template-based compression technique to obtain an output string and outputting the output string. In response to determining that the most compressed string was not obtained by application of the template-based compression technique, the most compressed string is output as the output string.

    Abstract translation: 响应于接收要压缩的输入串,将多种多样的无损压缩技术应用于输入串以获得多个压缩字符串。 多种多样的无损压缩技术包括基于模板的压缩技术和非基于模板的压缩技术。 选择多个压缩字符串中最压缩的字符串。 通过应用基于模板的压缩技术来确定最压缩的串是否被获得。 响应于通过应用基于模板的压缩技术获得最压缩的字符串,利用非基于模板的压缩技术来压缩最压缩字符串以获得输出字符串并输出输出字符串。 响应于确定通过应用基于模板的压缩技术不能获得最压缩的字符串,则最压缩的字符串作为输出字符串输出。

    Data compression utilizing longest common subsequence template
    9.
    发明授权
    Data compression utilizing longest common subsequence template 有权
    使用最长公共子序列模板的数据压缩

    公开(公告)号:US09106251B2

    公开(公告)日:2015-08-11

    申请号:US13780735

    申请日:2013-02-28

    CPC classification number: H03M7/30 H03M7/607

    Abstract: In response to receipt of an input string, an attempt is made to identify, in a template store, a closely matching template for use as a compression template. In response to identification of a closely matching template that can be used as a compression template, the input string is compressed into a compressed string by reference to a longest common subsequence compression template. Compressing the input string includes encoding, in a compressed string, an identifier of the compression template, encoding substrings of the input string not having commonality with the compression template of at least a predetermined length as literals, and encoding substrings of the input string having commonality with the compression template of at least the predetermined length as a jump distance without reference to a base location in the compression template. The compressed string is then output.

    Abstract translation: 响应于输入字符串的接收,尝试在模板存储器中识别紧密匹配的模板以用作压缩模板。 响应于可以用作压缩模板的紧密匹配的模板的识别,通过参考最长的公共子序列压缩模板将输入字符串压缩成压缩字符串。 压缩输入字符串包括在压缩字符串中编码压缩模板的标识符,将与压缩模板具有至少预定长度的压缩模板不一致的输入字符串的子串编码为文字,以及编码具有共同性的输入字符串的子串 至少具有预定长度的压缩模板作为跳跃距离,而不参考压缩模板中的基本位置。 然后输出压缩字符串。

Patent Agency Ranking