会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 11. 发明授权
    • Extensible framework for transferring session state
    • 可扩展的会话状态转移框架
    • US07415522B2
    • 2008-08-19
    • US10917843
    • 2004-08-12
    • Sanjay KaluskarSreenivas Gollapudi
    • Sanjay KaluskarSreenivas Gollapudi
    • G06F15/16G06F12/00
    • G06F17/30575H04L67/148
    • Techniques allow a client to be switched from a session on a server to another session on another server in a way that is a transparent to the application for which the initial session was established. Thus, under transparent session migration, a client is switched between sessions without executing application instructions tailored to accomplish the migration. Instead, a client-side interface component, through which the application interacts with the server, handles details of migration, modifying the internal state of the client-side interface component to effect the same. Legacy applications do not have to be modified in order to institute techniques described herein.
    • 技术允许客户端以对初始会话建立的应用程序透明的方式从服务器上的会话切换到另一个服务器上的另一个会话。 因此,在透明会话迁移下,客户端在会话之间切换,而不执行为完成迁移而定制的应用程序指令。 相反,应用程序与服务器交互的客户端接口组件处理迁移的细节,修改客户端接口组件的内部状态来实现。 传统的应用程序不需要修改,以便建立这里描述的技术。
    • 18. 发明授权
    • Large graph measurement
    • 大图测量
    • US08583667B2
    • 2013-11-12
    • US13314555
    • 2011-12-08
    • Sreenivas Gollapudi
    • Sreenivas Gollapudi
    • G06F17/30G06F7/00
    • G06F17/30876G06F17/30873
    • As provided herein, a pairwise distance between nodes in a large graph can be determined efficiently. URL-sketches are generated for respective nodes in an index by extracting labels from respective nodes, which provide a reference to a link between the nodes, aggregating the labels into sets for respective nodes, and storing the sets of labels as URL-sketches. Neighborhood-sketches are generated for the respective nodes in the index using the URL-sketches, by determining a neighborhood for a node and generating a sketch using labels that are associated with the respective neighboring nodes. A distance between two nodes is determined by computing an approximate number of paths and an approximate path length between the two nodes, using the neighborhood sketches for the two nodes.
    • 如本文所提供的,可以有效地确定大图中的节点之间的成对距离。 通过从相应节点提取标签,提供对节点之间的链接的引用,将标签聚集到各个节点的集合中,并将标签集合存储为URL草图,从而为索引中的相应节点生成URL草图。 通过使用URL草图,通过确定节点的邻域并使用与各个相邻节点相关联的标签生成草图来为索引中的相应节点生成邻域草图。 通过使用两个节点的邻域草图计算两个节点之间的近似路径数和两个节点之间的近似路径长度来确定两个节点之间的距离。