会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 61. 发明授权
    • Insertion device for an endoscope
    • 内窥镜插入装置
    • US06869393B2
    • 2005-03-22
    • US10246401
    • 2002-09-19
    • John Butler
    • John Butler
    • A61B1/01A61B1/31A61B1/00
    • A61B1/00151A61B1/00135A61B1/12A61B1/31
    • An insertion device (82) to aid introduction of an overtube (90) into a colon over a previously inserted colonoscope (2). The insertion device (82) comprises an elongate tubular sheath (80), which defines a lumen to receive the colonoscope (2) and the overtube (90), a band (61) of resilient material to hold the sheath (80) to the colonoscope (2) during introduction of the colonoscope (2) with the insertion device (82) mounted thereto into a colon, and an inflatable holder (81) for gripping the sheath (80) to the colonoscope (2) during insertion of the overtube (90) into the sheath (80). The holder (81) is deflated to release the grip on the colonoscope (2) and the insertion device (82) is at least partially removed from the colon after the overtube (90) has been inserted into the colon.
    • 一种用于辅助将外套管(90)引入到先前插入的结肠镜(2)中的结肠中的插入装置(82)。 插入装置(82)包括细长的管状护套(80),其限定用于容纳结肠镜(2)和外套管(90)的内腔,弹性材料带(61),以将护套(80)保持在 在将结肠镜(2)引入结肠镜(2)期间,将插入装置(82)安装到结肠中的结肠镜(2)和用于在外套管插入期间将护套(80)夹持到结肠镜(2)的可充气保持器 (90)进入护套(80)。 在将外套管(90)插入结肠后,保持器(81)放气以释放结肠镜(2)上的把手并且插入装置(82)至少部分地从结肠中移除。
    • 62. 发明授权
    • Binned remembered sets
    • 装箱记忆集
    • US06868488B2
    • 2005-03-15
    • US10324844
    • 2002-12-20
    • Alexander T. Garthwaite
    • Alexander T. Garthwaite
    • G06F12/00G06F12/02
    • G06F12/0269Y10S707/99953Y10S707/99957
    • A garbage collector that performs collection incrementally in accordance with the train algorithm employs remembered sets to keep track of locations where references to objects in respective car sections were written. The remembered sets are implemented as multi-level hash tables. The entries in the top-level hash table are pointers to constituent hash tables in which entries representing the reference locations are placed. When a constituent hash table becomes full, the collector thins it by allocating a new constituent table, transferring some of the previously full table's entries to the new table, and dividing further reference-location-representing entries among them in accordance with a hash function having an expanded range.
    • 根据列车算法逐步执行收集的垃圾回收器使用记忆集来跟踪对相应轿厢区域中的对象的引用的位置。 记忆集被实现为多级哈希表。 顶级哈希表中的条目是指向组成哈希表的指针,其中放置了表示引用位置的条目。 当组成散列表变满时,收集器通过分配一个新的组成表,将一些先前的完整表的条目传送到新表,并根据具有 扩大范围。
    • 63. 发明授权
    • Method and apparatus for interconnecting wired-AND buses
    • 用于互连有线和总线的方法和装置
    • US06842806B2
    • 2005-01-11
    • US09866889
    • 2001-05-29
    • Joseph J. Ervin
    • Joseph J. Ervin
    • G06F13/40G06F13/00
    • G06F13/404G06F13/4022
    • One or more bus bridges are used to partition a large I2C bus into smaller bus segments. By programming address bitmaps that are internal to each bridge, the various bus segments can be made to appear as one logical bus. In addition, the bus topology can be designed to maximize the ability to isolate faults within a given segment, thereby improving the ability of technicians to diagnose problems in very large I2C implementations. In one embodiment, the invention is a unidirectional bus bridge which is designed so that two such bridges can be used in parallel (facing in opposite directions) to implement a fully bi-directional bus bridge. In another embodiment, I2C slave addresses are replicated in a single logical I2C bus by addressing a tunnel command to a bridge, which command contains an address and causes the bridge to which it is addressed to forward the contained address.
    • 使用一个或多个总线桥将大型I 2 C总线划分成较小的总线段。 通过编程每个桥接器内部的地址位图,可以使各种总线段显示为一条逻辑总线。 此外,总线拓扑可以被设计为最大化隔离给定段内的故障的能力,从而提高技术人员在非常大的I2C实现中诊断问题的能力。 在一个实施例中,本发明是一种单向总线桥,其被设计成使得两个这样的桥可以并联使用(面向相反的方向)以实现完全双向的总线桥。 在另一个实施例中,I 2 C从机地址通过寻址到桥的隧道命令而在单个逻辑I 2 C总线中复制,该命令包含地址并且使其所寻址的桥转发所包含的 地址。
    • 64. 发明授权
    • Method and apparatus for configuring multiple segment wired-AND bus systems
    • 用于配置多段有线AND总线系统的方法和装置
    • US07149838B2
    • 2006-12-12
    • US09867129
    • 2001-05-29
    • Joseph J. Ervin
    • Joseph J. Ervin
    • G06F13/36
    • G06F13/4045
    • A special bus master, called a configuration host, “walks” a bus system to discover the bus topology and bus bridges that form that topology. Once the bridges have been located, the configuration host assigns a bridge ID to each bridge and enters information into internal bridge registers that control the flow of information between bus segments. The configuration host also populates an address bitmap in each bridge in order to complete the bus system configuration. In one embodiment, the bus topology is a tree configuration and the configuration host performs a recursive procedure that configures each branch of the tree. During this configuration process the internal bridge registers and address bitmap in each bridge are populated.
    • 一个特殊的总线主机,称为配置主机,“走”一个总线系统,发现构成该拓扑的总线拓扑和总线桥。 一旦找到了桥,配置主机将为每个桥分配一个桥ID,并将信息输入到控制总线段之间的信息流的内部桥寄存器中。 配置主机还填充每个桥中的地址位图,以完成总线系统配置。 在一个实施例中,总线拓扑是树配置,并且配置主机执行配置树的每个分支的递归过程。 在此配置过程中,填充每个桥中的内部桥寄存器和地址位图。
    • 66. 发明授权
    • Remembered-set scrubbing to remove stale entries in an incremental garbage collector
    • 记忆集擦除以删除增量垃圾收集器中的陈旧条目
    • US07072918B2
    • 2006-07-04
    • US10395449
    • 2003-03-24
    • Alexander T. Garthwaite
    • Alexander T. Garthwaite
    • G06F17/30
    • G06F12/0276Y10S707/99957
    • A computer system, method and software for detecting and purging stale entries from remembered sets associated with incrementally collectible regions used in an incremental garbage collection technique like the Trains algorithm is described. Stale entries are detected by a number of techniques, and then purged, eliminated, or scrubbed. These techniques make use of the summarized information about regions such as cards or incrementally collectible regions that indicate age of allocation, time a region was last scanned, last time an entry was inserted into a remembered set, as well as how far forward or backward objects in a given region refer in a generation.
    • 描述了一种计算机系统,方法和软件,用于检测和清除与诸如列车算法之类的增量垃圾收集技术中使用的增量收集区域相关联的记忆集的陈旧条目。 通过多种技术检测陈旧的条目,然后清除,消除或擦洗。 这些技术利用关于诸如卡或递增可收集区域的区域的汇总信息,这些区域指示分配的年龄,上次扫描的时间,上次将记录插入到记忆集中的时间,以及前进或后退的对象 在一个给定的地区,在一代人中引用。
    • 67. 发明授权
    • Better placement of objects reachable from outside a generation managed by the train algorithm
    • 从火车算法管理的一代外部可以更好地放置物体
    • US07072905B2
    • 2006-07-04
    • US10313657
    • 2002-12-06
    • Alexander T. Garthwaite
    • Alexander T. Garthwaite
    • G06F17/30
    • G06F12/0276Y10S707/99944Y10S707/99945Y10S707/99953
    • A garbage collector for more efficient placement of objects referenced from external references. The expected life times of these objects is measured by trial and error, by the class or type, by how often the object has been evacuated or the external reference processed, by the stability and longevity of the root source, or by the prolificness of the class or type of object. The measured value is held in the header of each object in an AGE field available for this purpose. These objects may be evacuated into existing trains or into new trains, or into a combination of existing and new trains. When new trains are created the trains are distributed among the existing trains according to a distribution contour that may be linear, normal, gamma or any other contour that might be found useful. Also, when new trains are created the youngest train must be a new train. When objects are evacuated into existing trains the objects are placed in trains according the survivability of the objects with the longer-lived objects placed proportionally in the younger trains. The objects are evacuated into the new trains from oldest to youngest trains according to the value in the AGE field. The higher the value the younger the train. A threshold on the AGE value may be established such that when the threshold is reached, the objects are evacuated into the youngest new train.
    • 一个垃圾回收器,用于更有效地放置从外部引用引用的对象。 这些物体的预期寿命是通过试验和误差,类别或类型,物体被疏散或外部参考物处理的频率,根源的稳定性和寿命,或由 类或类型的对象。 测量值保存在可用于此目的的AGE字段中的每个对象的标题中。 这些物体可能被撤离到现有的火车或新列车中,或者组合到现有的和新的列车中。 当新列车被创建时,根据可能是线性,正常,伽马或任何其他可能被发现有用的轮廓的分布轮廓,在现有列车之间分配列车。 此外,当新列车创建时,最小的火车必须是新的列车。 当物体撤离到现有火车中时,物体按照物体的生存能力放置在列车中,而较长寿命的物体按比例放置在较小的火车上。 这些物品根据AGE领域的价值从最旧到最早的列车撤离到新列车中。 火车越小越贵。 可以建立AGE值的阈值,使得当达到阈值时,物体被排空到最年轻的新列车中。
    • 68. 发明授权
    • Collection-tick mechanism for a collector based on the train algorithm
    • 基于列车算法的收集器的收集剔除机制
    • US07069280B2
    • 2006-06-27
    • US10313768
    • 2002-12-06
    • Alexander T. Garthwaite
    • Alexander T. Garthwaite
    • G06F17/30
    • G06F12/0276Y10S707/99943Y10S707/99944Y10S707/99957
    • A garbage collector employs the train algorithm to collect a generation in a dynamically allocated heap. When direct allocation of an object into the generation results in the need to allocate a new car section, the collector makes a determination of whether a new collection increment or interval needs to be initiated. It makes this determination by comparing the amount of new allocation in that generation with a threshold value. During each collection increment, it updates the threshold value by determining how much can occur during the next collection increment without exceeding an allowable pause time. It then projects from that value how much memory-space reclamation is likely to occur. From that likely amount of reclamation, it arrives at a limit on the permitted amount of allocation.
    • 垃圾收集器采用列车算法在动态分配的堆中收集一代。 当将对象直接分配到生成中导致需要分配新的汽车部分时,收集器确定是否需要启动新的收集增量或间隔。 它通过将该代中的新分配量与阈值进行比较来确定。 在每次收集增量期间,它通过确定在下一次收集增加期间可以发生多少,而不超过允许的暂停时间来更新阈值。 然后从该值预测可能发生多少内存空间回收。 从可能的填海量来看,这是允许的分配数量的限制。
    • 70. 发明授权
    • Parallel card table scanning and updating
    • 并行卡表扫描和更新
    • US07058781B2
    • 2006-06-06
    • US10366959
    • 2003-02-14
    • David L. Detlefs
    • David L. Detlefs
    • G06F12/00
    • G06F12/0276Y10S707/99953Y10S707/99957
    • During a collection interval, if a multi-threaded generational, copying garbage collector finds that a card contains a reference to a younger generation, it gives a corresponding card table entry a youngergen value selected from a plurality of youngergen values at the beginning of the interval as the “current” youngergen value. The youngergen value chosen for a given collection interval differs from the one that was chosen for the previous collection interval. As a result, a collector thread is able to distinguish between a card in which a reference to the younger generation remained at the end of the previous interval and one identified by some other thread during the current interval as referring to a young-generation object. In that way, the thread is able to avoid unnecessary scanning.
    • 在收集间隔期间,如果多线程世代复制垃圾回收器发现卡片包含对年轻一代的引用,则它给出相应的卡片表条目在间隔开始时从多个幼发生值中选择的幼年值 作为“当前”年轻人的价值。 为给定的收集间隔选择的年龄变化值与之前收集间隔所选择的值不同。 结果,集线器线程能够区分在前一间隔结束时保持对较新一代的引用的卡和在当前时间间隔期间由指定年轻代对象的其他线程识别的卡。 这样线程就能避免不必要的扫描。