Support device for endoscopic suturless anastomosis
    32.
    发明授权
    Support device for endoscopic suturless anastomosis 有权
    支持内窥镜无肛门吻合装置

    公开(公告)号:US06743243B1

    公开(公告)日:2004-06-01

    申请号:US09623496

    申请日:2000-11-20

    CPC classification number: A61B17/11 A61B17/1114 A61B2017/1135 A61B2017/1139

    Abstract: A support device for endoscopic suturless anastomosis between tubular organs include at least a first tubular member provided with a longitudinal slit which permits introduction of the organs to be anastomosed in the device and additional second tubular members in physical continuity with the first tubular member through an opening on the first tubular member. The size of the opening is substantially equal to the luminal area of the second member. The inner and outer diameters of any radial cross section of the second members are constant along its length. The device allows apposition of the two tubular organs to be anastomosed in a variety of spatial patterns and their fixation to each other without sutures or clips, either manually or via remote control, and the creation of luminal continuity between them.

    Abstract translation: 用于管状器官之间的内窥镜无痛吻合的支撑装置包括至少第一管状构件,其设置有纵向狭缝,所述第一管状构件允许将待吻合的器官引入装置中,并且附加的第二管状构件与第一管状构件物理连续地通过开口 在第一管状构件上。 开口的尺寸基本上等于第二构件的管腔面积。 第二构件的任何径向横截面的内径和外径沿其长度是恒定的。 该装置允许两个管状器官的并置以各种空间图案吻合并且彼此固定而不用手动或经由远程控制的缝线或夹子,并且在它们之间产生管腔连续性。

    Method and system to pre-fetch compressed memory blocks using pointers
    33.
    发明授权
    Method and system to pre-fetch compressed memory blocks using pointers 失效
    使用指针预取压缩内存块的方法和系统

    公开(公告)号:US06654867B2

    公开(公告)日:2003-11-25

    申请号:US09864036

    申请日:2001-05-22

    CPC classification number: G06F12/08 G06F2212/401 H03M7/30

    Abstract: A method and system for parallel fetch and decompression of compressed data blocks is disclosed. A method first accesses a table of pointers specifying the location of compressed data to obtain a pointer. Using the pointer, the method reads a pointer in the first block of data, the pointer specifying the location of the next block of compressed data in a chain of compressed data blocks. The method also transfers the rest of the first compressed data block to be decompressed. The method then fetches the next compressed data block using the second pointer while decompressing the first compressed data block. Using a pointer in each successive compressed data block in the chain, the method pre-fetches the next compressed data block while the previous compressed data block is being decompressed.

    Abstract translation: 公开了一种用于压缩数据块的并行获取和解压缩的方法和系统。 一种方法首先访问指定压缩数据位置的指针表以获得指针。 使用指针,该方法读取第一数据块中的指针,该指针指定压缩数据块链中下一个压缩数据块的位置。 该方法还传送要解压缩的第一个压缩数据块的其余部分。 然后,该方法在解压缩第一压缩数据块时使用第二指针获取下一压缩数据块。 在链中的每个连续的压缩数据块中使用指针,该方法在先前压缩的数据块被解压缩时预取下一个压缩数据块。

    Virtual memory system utilizing data compression implemented through a device

    公开(公告)号:US06516397B2

    公开(公告)日:2003-02-04

    申请号:US09829496

    申请日:2001-04-09

    CPC classification number: G06F12/08 G06F12/12 G06F2212/401

    Abstract: A method of operating a data processing system having a main memory divided into memory pages that are swapped into and out of main memory when the main memory becomes short. The data processing system has an operating system that sends page store commands specifying memory pages to be stored in a swap file and page retrieve commands specifying memory pages to be retrieved from the swap file and stored in the main memory. The present invention provides a swap driver that utilizes compression code for converting one of the memory pages that is to be swapped out of main memory to a compressed memory page. The data processing memory includes a compressed page region that is used to store the compressed memory pages. A page table in the compressed page region specifies the location of each compressed page and the page address corresponding to that page. The swap driver compresses at least one of the memory pages specified in one of the page store commands to provide a corresponding compressed memory page and causes that compressed memory page to be stored in the compressed page region. The swap driver also searches the page table for a page identified in one of the retrieve commands. The swap driver causes that page to be moved to a corresponding area of main memory after decompressing the page if the swap driver finds an entry in the page table indicating that the page is stored in the compressed page region.

    Cluster determination for circuit implementation
    36.
    发明授权
    Cluster determination for circuit implementation 失效
    电路实现的集群确定

    公开(公告)号:US5991524A

    公开(公告)日:1999-11-23

    申请号:US835947

    申请日:1997-04-14

    CPC classification number: G06F17/505

    Abstract: Provided are a method, article of manufacture, and apparatus for identifying candidate clusters for matching to cells in a technology library. An automated design system comprises a computer configured to extract a portion of a circuit, levelize it, select a first node, identify the realizable clusters at the inputs of the first node, and combine the first node with realizable clusters at the inputs to produce candidate clusters. A dummy cluster is used at each input to represent using the input as a fanin. The system takes the cross product of the sets, and the first node is merged with each element of the cross product to produce a set of candidate clusters. The candidate clusters are then checked for realizability by comparing them to cells in the technology library, which includes dummy cells to facilitate mapping to large cells in the technology library. A set of realizable clusters is produced for the first node. The system applies the same process to successive nodes in the levelized circuit, including in the intermediate set the sets of realizable clusters for preceding nodes.

    Abstract translation: 提供了用于识别与技术库中的单元匹配的候选聚类的方法,制品和装置。 一种自动化设计系统,包括:计算机,被配置为提取电路的一部分,使其平坦化,选择第一节点,识别在第一节点的输入端处的可实现集群,以及将第一节点与可实现的集群组合在一起以产生候选 集群。 在每个输入处使用虚拟集群来表示使用输入作为扇区。 系统采用集合的交叉乘积,并且第一节点与交叉产品的每个元素合并以产生一组候选集群。 然后通过将候选聚类与技术库中的单元进行比较来检查候选聚类,其中包括虚拟单元以便于映射到技术库中的大单元。 为第一个节点生成一组可实现的集群。 该系统将相同的过程应用到等级化电路中的连续节点,包括在中间设置前面节点的可实现集群集合。

    System to cancel ghosts generated by multipath transmission of
television signals
    37.
    发明授权
    System to cancel ghosts generated by multipath transmission of television signals 失效
    系统消除由多路传输电视信号产生的重影

    公开(公告)号:US5341177A

    公开(公告)日:1994-08-23

    申请号:US891058

    申请日:1992-06-01

    CPC classification number: H04N5/211

    Abstract: A ghost-canceling reference signal for inclusion in a television signal is provided by cyclically inserting ones of extended-length complementary-sequence pairs into a prescribed scan line in each of the vertical blanking intervals of successive fields of the television signal. By definition, a pair of binary (.+-.1) sequences of similar length to each other are complementary sequences only if the sum of the linear autocorrelation functions of the sequences is identically zero for all shifts other than zero but provides a high correlation gain at zero shift. A television receiver is described for receiving television signals containing such ghost-canceling reference signals, separating the ghosted complementary-sequence pairs from the received television signals, linearly correlating the ghosted complementary-sequences with corresponding ghost-free complementary-sequences previously stored in the receiver, and adjusting the filtering parameters of ghost-canceling video filters in accordance with the sum of the linear correlation results.

    Abstract translation: 通过在电视信号的连续场的每个垂直消隐间隔的每个垂直消隐间隔中将扩展长度互补序列对中的一个循环插入到规定的扫描线中来提供包含在电视信号中的重影消除参考信号。 根据定义,只有对于除零之外的所有移位,序列的线性自相关函数之和相同为零,则彼此相似长度的一对二进制(+/- 1)序列是互补序列,但是提供高的相关增益 零班。 描述了一种用于接收包含这种重影消除参考信号的电视信号的电视接收机,从接收到的电视信号中分离出重影的互补序列对,将重影的互补序列与先前存储在接收机中的相应的无重影互补序列线性相关 ,并根据线性相关结果的和调整重影消除视频滤波器的滤波参数。

    Enhanced communication infrastructure for hierarchical intelligent power distribution grid

    公开(公告)号:US09641026B2

    公开(公告)日:2017-05-02

    申请号:US13155707

    申请日:2011-06-08

    CPC classification number: H02J13/0079 Y02B70/3216 Y04S20/221

    Abstract: The subject specification comprises enhanced communication infrastructure for a multi-tier hierarchical smart distribution grid (SDG). The SDG comprises a specified number of distribution network node controller (DNNC) components employed to desirably control communications and power distribution between respective tiers of the SDG to facilitate efficient power distribution. When communication between the a DNNC in one tier and another DNNC in another tier, is desired, the DNNC can identify available communication channels and respective communication conditions of the available communication channels, and can dynamically select a subset of available data and preferred communication channel, based at least in part on predefined control criteria, to control data transmission loads in the network and facilitate real time control of the SDG. Data can be communicated via the selected communication channel. Respective DNNCs can desirably control power distribution for respective tiers, minimizing upper tier involvement in lower tier power distribution.

    Efficient broadcasting via random linear packet combining
    40.
    发明授权
    Efficient broadcasting via random linear packet combining 有权
    通过随机线性分组组合进行有效的广播

    公开(公告)号:US08953612B2

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

    申请号:US13414235

    申请日:2012-03-07

    CPC classification number: H04L1/0076 H04H20/42 H04L1/0057 H04L69/22 H04W4/06

    Abstract: Embodiments of systems and methods for efficient broadcasting via random linear packet combining are described. A plurality of data packets are received from a data source according to embodiments. The plurality of data packets is divided into a plurality of data blocks, and bits associated with the plurality of data blocks are multiplied by a set of coefficients to generate a plurality of product values. An encoded data packet having a plurality of encoded data blocks may also be generated by linearly combining the plurality of product values for respective data blocks of each of the plurality of data packets into corresponding encoded data blocks of the encoded data packet. Because each encoded data packet includes information about a complete set of data packets, rather than just a subset, less broadcast redundancy may be required.

    Abstract translation: 描述了通过随机线性分组组合进行有效广播的系统和方法的实施例。 根据实施例,从数据源接收多个数据分组。 多个数据分组被分成多个数据块,并且与多个数据块相关联的比特乘以一系列系数以产生多个乘积值。 也可以通过将多个数据分组中的每一个的各个数据块的多个乘积值线性地组合成编码数据分组的相应的编码数据块来生成具有多个编码数据块的编码数据分组。 因为每个编码的数据分组包括关于完整的一组数据分组的信息,而不仅仅是一个子集,所以可能需要较少的广播冗余。

Patent Agency Ranking