会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Identifying filter coefficients
    • 识别滤波器系数
    • US07958176B2
    • 2011-06-07
    • US11407639
    • 2006-04-20
    • John R. DouceurRobert P. FitzgeraldJohn W. Miller
    • John R. DouceurRobert P. FitzgeraldJohn W. Miller
    • G06F17/10
    • G06F9/44557G06F9/445
    • Techniques for identifying coefficients are described. A technique collects sample input values to the filter and identifies desired output values from the filter for the collected sample input values. The technique then generates a power spectrum of the collected sample input values and a power spectrum of the identified desired output values. The technique then calculates the difference between the generated power spectra. Finally, the technique identifies coefficients that yield a filter transfer function that closely approximates the calculated differences. A technique identifies coefficients for a finite impulse response filter. The technique collects sample input values for a function and identifies desired output values for the filter for the collected sample input values. The technique then approximates the output values from the input values using a linear fitting technique. Finally, the technique sets the coefficients to values obtained from the linear-fitting technique.
    • 描述用于识别系数的技术。 技术将采样输入值收集到滤波器,并从滤波器识别收集的采样输入值的所需输出值。 然后,该技术产生所收集的采样输入值的功率谱和所识别的期望输出值的功率谱。 然后,该技术计算所产生的功率谱之间的差异。 最后,该技术识别产生近似于计算出的差异的滤波器传递函数的系数。 一种技术识别有限脉冲响应滤波器的系数。 该技术收集函数的样本输入值,并为收集的样本输入值识别滤波器的所需输出值。 然后,该技术使用线性拟合技术从输入值近似输出值。 最后,该技术将系数设置为从线性拟合技术获得的值。
    • 2. 发明授权
    • Method and system for alignment of blocks in a program image
    • 程序图像中块的对齐方法和系统
    • US5903917A
    • 1999-05-11
    • US797589
    • 1997-02-07
    • John R. DouceurRobert P. FitzgeraldJohn W. Miller
    • John R. DouceurRobert P. FitzgeraldJohn W. Miller
    • G06F11/34G06F12/08G06F12/10G06F12/02
    • G06F12/10G06F12/0864
    • A computer system and method for aligning blocks within source program image in accordance with alignment constraints. The source program image is divided in pages. The alignment system receives an indication of which of the blocks are accessed during each time interval while the source program image is executed. The alignment system determines from the received indications which of the pages are accessed during each time interval. The alignment system then identifies the first block of the source program image that has an alignment constraint and repeats the following until all blocks have been aligned. The alignment system identifies a group of contiguous blocks that are adjacent to the identified block such that the identified blocks can be rearranged without increasing the number of pages that are accessed during each time interval. The alignment system then determines an arrangement of the blocks that tends to minimize the amount of padding that is needed to satisfy the alignment constraints. The alignment system then stores the rearranged blocks along with the padding in a destination program image.
    • 一种用于根据对准约束在源程序图像内对准块的计算机系统和方法。 源程序图像分为页面。 在执行源程序图像时,对准系统接收在每个时间间隔期间访问哪个块的指示。 对准系统从接收到的指示确定在每个时间间隔期间访问哪些页面。 对准系统然后识别具有对准约束的源程序图像的第一块,并重复以下操作,直到所有块都对齐。 对准系统识别与所识别的块相邻的一组连续的块,使得可以重新排列所识别的块,而不增加在每个时间间隔期间被访问的页数。 对准系统然后确定倾向于最小化满足对准约束所需的填充量的块的布置。 对准系统然后将重排的块与填充一起存储在目的节目图像中。
    • 4. 发明授权
    • Method and system for improving the layout of a program image using clustering
    • 使用聚类改进程序图像布局的方法和系统
    • US06269477B1
    • 2001-07-31
    • US08931030
    • 1997-09-16
    • Robert P. FitzgeraldJohn W. MillerJohn R. Douceur
    • Robert P. FitzgeraldJohn W. MillerJohn R. Douceur
    • G06F945
    • G06F8/4442
    • A computer system for establishing a program image layout of a computer program. The computer program has basic blocks that each have temporal usage vector indicating time intervals during which the basic block was accessed during an execution of the computer program. For each of the basic blocks, the layout system initializes a cluster to contain that basic block and the layout system repeats the following until one cluster remains that contains all of the basic blocks. For each possible ordered pair of clusters, the layout system determines a metric value for the ordered pair of clusters, the metric value being derived from the temporal usage vectors of the basic blocks of the cluster and estimating an effect on the performance of the computer program when that ordered pair of clusters are position in the program image in that order and contiguously. The layout system then selects the ordered pair whose metric value estimates the smallest effect on the performance of the computer program. The layout system then replaces the clusters of the selected ordered pair of clusters with a new cluster that includes the basic blocks of the selected order pair.
    • 一种用于建立计算机程序的程序图像布局的计算机系统。 计算机程序具有基本块,每个基本块具有指示在执行计算机程序期间访问基本块的时间间隔的时间使用向量。 对于每个基本块,布局系统初始化集群以包含该基本块,并且布局系统重复以下,直到包含所有基本块的一个集群为止。 对于每个可能有序的聚类对,布局系统确定有序聚类对的度量值,度量值是从群集的基本块的时间使用向量导出的,并且估计对计算机程序的性能的影响 当有序对的簇在程序图像中以该顺序并且连续地位置时。 然后,布局系统选择其度量值估计对计算机程序的性能的最小影响的有序对。 然后,布局系统用包括所选订单对的基本块的新集群替换所选择的有序对集群的集群。
    • 5. 发明授权
    • Method and system for incrementally improving a program layout
    • 逐步改进程序布局的方法和系统
    • US06381740B1
    • 2002-04-30
    • US08931151
    • 1997-09-16
    • John W. MillerJohn R. DouceurRobert P. Fitzgerald
    • John W. MillerJohn R. DouceurRobert P. Fitzgerald
    • G06F900
    • G06F8/445
    • A method and system for incrementally improving the layout of a program image of a computer program to reduce the working set. The system iteratively selects pairs of basic blocks and reorders the basic blocks in the range delimited by the selected pair of basic blocks. The system selects the pairs of basic blocks so that the working set of the computer program is improved by reordering the basic block in the range. Thus, during each iteration, the working set is improved. The system continues with these iterations until a termination condition (e.g., number of iterations) is satisfied. In one embodiment, during each iteration the system designates one of the basic blocks as an initial anchor basic block. The system then repeats the following until the same range of basic blocks is identified twice in a row. The system first finds a basic block such that when the basic blocks in the range from the anchor basic block to the found basic block are reordered, the working set is more favorable than reordering any other range that ends with the anchor basic block. The system then designates the found basic block as the new anchor basic block. When the same range is found twice in a row, the system reorders the basic blocks in the range. This process is repeated for each iteration until a termination condition is satisfied. The resulting reordered program image has its working set improved.
    • 一种用于逐步改进计算机程序的程序图像的布局以减少工作集合的方法和系统。 系统迭代地选择一对基本块,并且在由所选择的一对基本块分隔的范围内重新排序基本块。 系统选择基本块对,通过重新排序该范围内的基本块来提高计算机程序的工作集。 因此,在每次迭代期间,改进了工作集。 系统继续进行这些迭代,直到满足终止条件(例如,迭代次数)为止。 在一个实施例中,在每次迭代期间,系统将基本块中的一个指定为初始锚基本块。 然后,系统重复以下操作,直到相同范围的基本块被连续两次识别。 系统首先找到一个基本块,使得当从锚基本块到找到的基本块的范围内的基本块被重新排序时,工作集比重新排序以锚基本块结束的任何其他范围更有利。 然后,系统将找到的基本块指定为新的锚基本块。 当连续两次找到相同的范围时,系统重新排列范围内的基本块。 对于每个迭代重复该过程,直到满足终止条件。 所产生的重新排序的程序图像的工作集改进了。
    • 7. 发明授权
    • Trusted hardware component for distributed systems
    • 分布式系统的可信硬件组件
    • US09455992B2
    • 2016-09-27
    • US12483338
    • 2009-06-12
    • John R. DouceurDavid M LevinJacob R. LorchThomas Moscibroda
    • John R. DouceurDavid M LevinJacob R. LorchThomas Moscibroda
    • G06F15/16H04L29/06H04L9/32
    • H04L63/123H04L9/3247H04L29/06H04L2209/127
    • Techniques for utilizing trusted hardware components for mitigating the effects of equivocation amongst participant computing devices of a distributed system are described herein. For instance, a distributed system employing a byzantine-fault-resilient protocol—that is, a protocol intended to mitigate (e.g., tolerate, detect, isolate, etc.) the effects of byzantine faults—may employ the techniques. To do so, the techniques may utilize a trusted hardware component comprising a non-decreasing counter and a key. This hardware component may be “trusted” in that the respective participant computing device cannot modify or observe the contents of the component in any manner other than according to the prescribed procedures, as described herein. Furthermore, the trusted hardware component may couple to the participant computing device in any suitable manner, such as via a universal serial bus (USB) connection or the like.
    • 在此描述了利用可信硬件组件来减轻分布式系统的参与者计算设备之间的混淆效应的技术。 例如,采用拜占庭故障弹性协议的分布式系统 - 即旨在减轻(例如,容忍,检测,隔离等)拜占庭故障的影响的协议 - 可以采用这些技术。 为了这样做,这些技术可以利用包括非递减计数器和密钥的可信硬件组件。 该硬件组件可能是“可信赖的”,因为如本文所述,相应的参与者计算设备不能以除了根据规定的过程之外的任何方式修改或观察组件的内容。 此外,可信硬件组件可以以任何合适的方式,例如经由通用串行总线(USB)连接等耦合到参与者计算设备。