会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • BROADCAST MESSAGING IN PEER TO PEER OVERLAY NETWORK
    • 对等覆盖网络中的广播消息传送
    • WO2007120213A3
    • 2007-12-27
    • PCT/US2006044661
    • 2006-11-17
    • SONY COMPUTER ENTERTAINMENT INCTAKEDA YUTAKABERKEY HOWARDWHITE PAYTON RVASS ATTILA
    • TAKEDA YUTAKABERKEY HOWARDWHITE PAYTON RVASS ATTILA
    • H04L12/18
    • H04L12/1854
    • Broadcast messages are efficiently directed to nodes of an overlay network. Broadcast messages include an End ID parameter specifying the range of key values for nodes that should receive the broadcast message. Each node of an overlay network maintains a list of finger nodes and their respective key values. Upon receiving a broadcast message, a node assigns a finger node a new End ID value based upon the End ID value of the broadcast message or the key value of an adjacent finger node. The node compares a finger node's new End ID value with the finger node's key value to determine whether to forward the broadcast message to that finger node. A broadcast message forwarded to a finger node includes an End ID parameter equal to the new End ID value determined for the finger node. Nodes can aggregate response messages from its finger nodes.
    • 广播消息被有效地引导到覆盖网络的节点。 广播消息包括一个End ID参数,用于指定应接收广播消息的节点的键值范围。 覆盖网络的每个节点维护一个手指节点列表及其各自的键值。 在接收到广播消息时,节点基于广播消息的结束ID值或相邻手指节点的密钥值为节点分配新的结束ID值。 该节点将手指节点的新的结束ID值与手指节点的键值进行比较,以确定是否将广播消息转发到该手指节点。 被转发到指状节点的广播消息包括等于为该指状节点确定的新的结束ID值的结束ID参数。 节点可以聚合来自其手指节点的响应消息。
    • 4. 发明申请
    • PREDICTIVE USER INTERFACE
    • 预测用户界面
    • WO2007009096A3
    • 2009-04-16
    • PCT/US2006027525
    • 2006-07-13
    • SONY COMPUTER ENTERTAINMENT INCBATES JOHN PWHITE PAYTON RTAKEDA YUTAKA
    • BATES JOHN PWHITE PAYTON RTAKEDA YUTAKA
    • G06F17/30
    • G06F3/0236G06F3/0237G06F3/04817Y10S707/99935
    • A user interface enables the input of text and other complicated inputs by identifying entities having an increased likelihood of being selected and decreasing the precision needed to select these entities. The user interface displays a set of entities in a radial pattern. The user manipulates a pointer with a joystick or other input device to select entities. The entities having a higher selection probabilities are allocated more space in the pattern than the other entities. The entities having a higher selection probabilities may also be emphasized with visual cues. Selection probabilities may be determined by comparing a sequence of entities previously selected, such as a partially input word, with a set of commonly selected sequences of entities, such as a set of words commonly used by users. The user interface can display a list of words corresponding with a sequence of selected entities, including characters from different writing systems.
    • 用户接口通过识别具有增加的可能性被选择的实体并且降低选择这些实体所需的精度来实现文本和其他复杂输入的输入。 用户界面以径向模式显示一组实体。 用户使用操纵杆或其他输入设备操纵指针以选择实体。 具有较高选择概率的实体在模式中被分配比其他实体更多的空间。 具有更高选择概率的实体也可以用视觉线索强调。 可以通过将先前选择的实体的序列(例如部分输入的字)与一组常用的实体序列(诸如用户通常使用的一组单词)进行比较来确定选择概率。 用户界面可以显示与选定实体的序列相对应的单词列表,包括来自不同书写系统的字符。
    • 5. 发明专利
    • Sub-task processor distribution scheduling
    • 子任务处理器分配调度
    • JP2008027442A
    • 2008-02-07
    • JP2007184406
    • 2007-07-13
    • Sony Computer Entertainment Inc株式会社ソニー・コンピュータエンタテインメント
    • BATES JOHN PWHITE PAYTON R
    • G06F9/50
    • G06F9/5044G06F2209/5017
    • PROBLEM TO BE SOLVED: To provide a distributed computing method for distributing computing tasks among multiple processors.
      SOLUTION: The method comprises: a step of generating a task for a local node; a step of dividing the task into one or more subtasks; a step of determining an optimum number x of nodes for performing the one or more sub-tasks, based at least partly on parameters relating to performance of a group of the sub-tasks in a group of nodes accessible by the local node; and a step of determining, based on the number x, whether to perform the task at the local node or distribute the task among one or more distributed nodes accessible by the local node.
      COPYRIGHT: (C)2008,JPO&INPIT
    • 要解决的问题:提供一种用于在多个处理器之间分配计算任务的分布式计算方法。 解决方案:该方法包括:为本地节点生成任务的步骤; 将任务划分为一个或多个子任务的步骤; 至少部分地基于与本地节点可访问的一组节点中的一组子任务的性能相关的参数来确定用于执行所述一个或多个子任务的节点的最佳数量x的步骤; 以及基于数量x确定是否在本地节点执行任务或者在本地节点可访问的一个或多个分布式节点之间分发任务的步骤。 版权所有(C)2008,JPO&INPIT