会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Transactional independent persister cloning system
    • 交易独立持久克隆系统
    • US08549113B2
    • 2013-10-01
    • US13015282
    • 2011-01-27
    • Mario H LichtsinnHovey Raymond Strong, Jr.
    • Mario H LichtsinnHovey Raymond Strong, Jr.
    • G06F15/16
    • G06F9/4856
    • A computer program product, including a computer readable storage medium to store a computer readable program, wherein the computer readable program, when executed by a processor within a computer, causes the computer to perform operations for moving data stored on a transactional semantic independent persister in a distributed environment. The operations include: receiving an indicator to move data stored by the persister at a first node of the distributed environment to a second node of the distributed environment, wherein the data corresponds to a source; and cloning the persister at the first node to a cloned persister at the second node in response to receiving the indicator, wherein the cloning includes: moving data stored by the persister at the first node to the cloned persister; and moving remaining data in a data stream between the source and the persister at the first node to the cloned persister.
    • 一种计算机程序产品,包括用于存储计算机可读程序的计算机可读存储介质,其中所述计算机可读程序在由计算机内的处理器执行时使得所述计算机执行用于移动存储在事务语义独立的存储器上的数据的操作 分布式环境。 操作包括:接收指示符,将由分支环境的第一节点处的持久存储器存储的数据移动到分布式环境的第二节点,其中数据对应于源; 以及响应于接收到所述指示符,将所述第一节点处的所述持久性克隆到所述第二节点处的克隆的持续器,其中所述克隆包括:将所述第一节点处的所述持续器存储的数据移动到所述克隆的持续器; 以及将数据流中的剩余数据移动到第一节点处的源和持续器之间的克隆持续器。
    • 4. 发明授权
    • Method for synchronizing use of dual and solo locking for two competing
processors responsive to membership changes
    • 同时使用响应于会员资格变更的两个竞争性处理器的双重和单独锁定的方法
    • US6105099A
    • 2000-08-15
    • US203102
    • 1998-11-30
    • Richard Francis FreitasDivyesh JadavDeepak Kenchammana-HosekoteJaishankar Moothedath MenonHovey Raymond Strong, Jr.
    • Richard Francis FreitasDivyesh JadavDeepak Kenchammana-HosekoteJaishankar Moothedath MenonHovey Raymond Strong, Jr.
    • G06F9/46G06F12/00G06F12/14
    • G06F9/52
    • To satisfy host requests, two competing processors self-manage access to a shared resource. Each processor maintains a lock table listing that processor's access state regarding the shared resource. Each processor repeatedly sends the other processor a state announcement message representing the processor's state. These include birth cry, heartbeat, or death knell messages. Whenever certain join-entry conditions apply to a processor, the processor performs a JOIN operation to evaluate and attempt to synchronize its lock table with the other processor's lock table. If data is needed from the other processor's lock table, the processor changes its state announcement message to birth cry. If the processor successfully synchronizes its lock table with the other processor, the JOIN operation dictates DUAL mode for that processor. If the synchronization attempt fails, SOLO results. When JOIN completes, the processor operates in its chosen mode. In DUAL, the processor's state announcement message is heartbeat, signifying healthy operation. In DUAL, the processors cooperatively establish temporary single-processor locks on the shared resource to satisfy host requests. In SOLO, a processor sets its state announcement message to death knell, advising the other processor not to access the shared resource. Also in SOLO, the processor attempts to "acquire" the shared resource by storing a predetermined identifier thereon. In SOLO, a processor refrains from accessing the shared resource unless it has acquired it.
    • 为了满足主机请求,两个竞争的处理器自我管理对共享资源的访问。 每个处理器维护一个锁表,列出处理器关于共享资源的访问状态。 每个处理器重复地向其他处理器发送表示处理器状态的状态通知消息。 这些包括出生哭泣,心跳或死亡消息。 每当某个加入条件适用于处理器时,处理器执行JOIN操作来评估并尝试将其锁定表与其他处理器的锁定表同步。 如果需要其他处理器的锁定表的数据,处理器将其状态通知消息改变为出生哭泣。 如果处理器将其锁定表与其他处理器成功同步,则JOIN操作将指定该处理器的DUAL模式。 如果同步尝试失败,SOLO结果。 当JOIN完成时,处理器以其所选模式运行。 在DUAL中,处理器的状态通知信号是心跳,意味着健康运行。 在DUAL中,处理器在共享资源上协作建立临时单处理器锁以满足主机请求。 在SOLO中,处理器将其状态通知消息设置为死机,建议另一个处理器不要访问共享资源。 同样在SOLO中,处理器尝试通过在其上存储预定的标识符来“获取”共享资源。 在SOLO中,处理器除非已获取共享资源,否则不会访问共享资源。
    • 5. 发明授权
    • Determining a purpose of a document
    • 确定文件的目的
    • US09292601B2
    • 2016-03-22
    • US11971673
    • 2008-01-09
    • Larry Lee ProctorHovey Raymond Strong, Jr.Renjie TangRuoyi Zhou
    • Larry Lee ProctorHovey Raymond Strong, Jr.Renjie TangRuoyi Zhou
    • G06F3/00G06F17/30
    • G06F17/30719
    • A method of summarizing a document includes a step of extracting one or more sections of the document. The method also includes a step of separating at least one of the one or more extracted sections into one or more subsections based at least in part on a conjunctive structure of the section, wherein each subsection comprises one or more terms. The method also includes steps of determining whether one or more terms within a designated set of terms are present within at least one of the one or more subsections and, responsive to a determination that one or more terms within the designated set of terms are present within at least one of the one or more subsections, removing the one or more terms from the one or more subsections. The method also includes a step of aggregating at least a portion of the one or more sections into a summary of the document.
    • 总结文档的方法包括提取文档的一个或多个部分的步骤。 该方法还包括至少部分地基于该部分的连接结构将一个或多个提取部分中的至少一个分离成一个或多个子部分的步骤,其中每个子部分包括一个或多个术语。 所述方法还包括以下步骤:确定所指定的一组术语中的一个或多个术语是否存在于所述一个或多个子部分的至少一个部分内,以及响应于确定所述指定术语集合内的一个或多个术语存在于 所述一个或多个子部分中的至少一个,从所述一个或多个子部分移除所述一个或多个条款。 该方法还包括将该一个或多个部分的至少一部分聚集成文档的摘要的步骤。
    • 7. 发明授权
    • Method and apparatus for accessing shared resources with asymmetric safety in a multiprocessing system
    • 用于在多处理系统中访问具有不对称安全性的共享资源的方法和装置
    • US06748438B2
    • 2004-06-08
    • US08971276
    • 1997-11-17
    • John Davis PalmerHovey Raymond Strong, Jr.Eliezer Upfal
    • John Davis PalmerHovey Raymond Strong, Jr.Eliezer Upfal
    • G06F1516
    • H04L67/10
    • In a multiprocessing system, access to a shared resource is arbitrated among multiple computing nodes. The shared resources has a membership view resulting from a predetermined membership protocol performed by the shared resource and the computing nodes. Preferably, this membership protocol includes a termination condition guaranteeing asymmetric safety among all members of the multiprocessing system. The shared resource arbitrates access to itself by fencing computing nodes outside shared resource's membership view. In one embodiment, the shared resource may comprise a data storage facility, such as a disk drive. Illustratively, computation of the shared resource's membership view may employ a procedure where each computing node subscribes to the resource during prescribed membership intervals.
    • 在多处理系统中,在多个计算节点之间仲裁对共享资源的访问。 共享资源具有由共享资源和计算节点执行的预定成员协议产生的成员关系视图。 优选地,该会员协议包括保证多处理系统的所有成员之间的非对称安全性的终止条件。 共享资源通过围绕共享资源成员资格视图外的计算节点来仲裁对其自身的访问。 在一个实施例中,共享资源可以包括诸如磁盘驱动器的数据存储设施。 说明性地,共享资源的成员关系视图的计算可以采用其中每个计算节点在规定的成员关系间隔期间预订资源的过程。
    • 8. 发明授权
    • Method and apparatus for ordered reliable multicast with asymmetric
safety in a multiprocessing system
    • 用于多处理系统中具有不对称安全性的有序可靠组播的方法和装置
    • US6092220A
    • 2000-07-18
    • US972111
    • 1997-11-17
    • John Davis PalmerHovey Raymond Strong, Jr.Eliezer Upfal
    • John Davis PalmerHovey Raymond Strong, Jr.Eliezer Upfal
    • G06F11/00G06F11/30
    • G06F11/1425G06F11/0724G06F11/0757H04L41/0893
    • Ordered machine-readable messages are reliably delivered among processing members in a multiprocessing computer system. The system includes multiple processing nodes, each having a unique source-ID and a membership view including one or more of the processing nodes with which it can nominally exchange messages. When a stimulus message is received by a first processing node, the node increments a coordinated local counter (CC). The node also sends a multicast message to all processing nodes in the first node's membership group. The multicast message includes the received stimulus message, the incremented CC value, and the first node's source-ID. The node further sets a timer, exclusively associated with the incremented CC value. When a multicast message is received at a processing node, the node performs a multicast input processing routine. The node sets its CC equal to the greater of its current value or the received multicast message's CC value. The node also sends an acknowledgement message to all processing nodes in its membership group. Also, in response to the multicast message, the node sets a timer, exclusively associated with the received multicast message's CC value. Whenever a node's timer associated with a CC value expires before messages with the same CC value have been received from each of the node's membership group, the node invokes a membership protocol requiring asymmetric safety.
    • 有序的机器可读消息在多处理计算机系统中的处理构件之间可靠地传递。 该系统包括多个处理节点,每个处理节点具有唯一的源ID和成员资格视图,该视图包括一个或多个处理节点,通过该节点可以名义上交换消息。 当第一处理节点接收到刺激消息时,该节点增加协调的本地计数器(CC)。 节点还向第一个节点的成员组中的所有处理节点发送组播消息。 多播消息包括接收到的激励消息,递增的CC值和第一节点的源ID。 该节点进一步设置一个定时器,专门与递增的CC值相关联。 当在处理节点处接收到多播消息时,节点执行多播输入处理例程。 节点将其CC设置为等于其当前值的更大值或接收到的多播消息的CC值。 节点还向其成员组中的所有处理节点发送确认消息。 此外,响应于多播消息,节点设置与所接收的多播消息的CC值专用关联的定时器。 每当节点与CC值相关联的定时器在从节点的成员组中的每一个接收到具有相同CC值的消息之前到期时,节点将调用需要不对称安全性的成员协议。