会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Data overlay, self-organized metadata overlay, and application level multicasting
    • 数据覆盖,自组织元数据覆盖和应用级多播
    • US07418454B2
    • 2008-08-26
    • US10826674
    • 2004-04-16
    • Yu ChenZheng ZhangXing XieShiding Lin
    • Yu ChenZheng ZhangXing XieShiding Lin
    • G06F17/30G06F7/00
    • H04L67/2804H04L67/2819H04L67/327Y10S707/99942Y10S707/99943
    • A data overlay is built as a data structure on a logical space defined by a distributed hash table (DHT) in a peer-to-peer network. The data overlay includes a tree having tree nodes that each have a zone mapped to a corresponding DHT node in the logical space of the DHT. The logical space of the DHT is mapped to machines, each of which corresponds to one or more of more of the tree node zones. The tree nodes are hierarchically situated by tree node zone size and my available resource so that tasks are performed by machines in the peer-to-peer network according to the respective abilities of the machines to supply the tasks' demand. The tree, which self-organizes and self-heals on the same scale as the underlying DHT, is used together and disseminate information from and to the DHT nodes using the hierarchy of the tree nodes.
    • 在由对等网络中的分布式哈希表(DHT)定义的逻辑空间上构建数据覆盖层作为数据结构。 数据覆盖包括具有树节点的树,每个树节点具有映射到DHT的逻辑空间中的相应DHT节点的区域。 DHT的逻辑空间被映射到机器,每个机器对应于一个或多个更多的树节点区域。 树节点由树节点区域大小和可用资源分层位置,使得任务由对等网络中的机器根据机器提供任务需求的相应能力执行。 与DHT相同的规模自我组织和自我修复的树被一起使用,并使用树节点的层次结构向DHT节点传播信息。
    • 3. 发明授权
    • System and method for providing content-oriented services to content providers and content consumers
    • 向内容提供者和内容消费者提供面向内容的服务的系统和方法
    • US07809813B2
    • 2010-10-05
    • US10184438
    • 2002-06-28
    • Wei-Ying MaYu ChenLiang SunXing XieChun YuanHongjiang Zhang
    • Wei-Ying MaYu ChenLiang SunXing XieChun YuanHongjiang Zhang
    • G06F15/173
    • H04L67/2814G06F17/3089G06F17/30905H04L67/16H04L67/2819H04L67/306H04L67/322H04L67/327H04L69/329
    • A content service network for providing content-oriented services over the Internet or similar networks comprises a service delivery overlay having a plurality of application servers and a content delivery network overlay having a plurality of service-enabled proxies in content delivery paths between content providers and content consumers. The service delivery overlay and the content delivery network collaborate to provide content-oriented processing, such as adaptive video delivery, content personalization, language translation, etc. The content service network accepts subscriptions from content providers and content consumer. For each subscription, service instructions including service binding data for binding the subscribed services with the subscriber's identity are generated and distributed to the service-enabled proxies. When a service-enabled proxy detects that a message passing therethrough requires a subscribed service, it retrieves service instructions for the service and renders the service either by making a remote call to an application service or by invoking a local execution module.
    • 用于通过因特网或类似网络提供面向内容的服务的内容服务网络包括具有多个应用服务器的服务传递覆盖层和在内容提供者和内容之间的内容传递路径中具有多个服务使能代理的内容传送网络覆盖 消费者 服务提供覆盖和内容传送网络协同提供面向内容的处理,例如自适应视频传递,内容个性化,语言翻译等。内容服务网络接受来自内容提供商和内容消费者的订阅。 对于每个订阅,生成包括用于将订阅的服务与用户身份绑定的服务绑定数据的服务指令,并将其分发给支持服务的代理。 当启用服务的代理检测到通过其中的消息需要订阅服务时,它检索服务的服务指​​令,并通过对应用程序服务进行远程调用或通过调用本地执行模块来呈现服务。
    • 4. 发明授权
    • Route computation based on route-oriented vehicle trajectories
    • 基于路线导向车辆轨迹的路线计算
    • US09261376B2
    • 2016-02-16
    • US12712053
    • 2010-02-24
    • Yu ZhengYin LouChengyang ZhangXing Xie
    • Yu ZhengYin LouChengyang ZhangXing Xie
    • G01C21/36G01S19/42G06F17/30G01C21/34
    • G01C21/3484G01C21/10G01C21/16G01S19/42
    • Techniques for providing a route based on route-oriented vehicle trajectories are described. This disclosure describes receiving GPS logs and extracting route-oriented vehicle trajectory content from the GPS log data to pertain to a single trip. Next, the process maps each route-oriented vehicle trajectory to a corresponding road segment to construct a landmark graph. A landmark is a road segment frequently visited by route-oriented vehicles. The process includes receiving a user query with a starting point and a destination point; searching the landmark graph for a sequence of landmarks with corresponding transition times and a least amount of travel time. Then the process identifies and connects sets of road segments between each pair of consecutive landmarks, and displays a route to a user with a nearest landmark to the starting point, other landmarks along the route, and another nearest landmark to the destination point.
    • 描述了基于路线导向的车辆轨迹提供路线的技术。 本公开描述了从GPS日志数据接收GPS日志并提取面向路线的车辆轨迹内容以涉及单次旅行。 接下来,该过程将每个面向路线的车辆轨迹映射到相应的路段以构建地标图。 地标是路线导向车辆经常访问的路段。 该过程包括以起始点和目的地点接收用户查询; 搜索具有相应过渡时间和最少旅行时间量的地标序列的地标图。 然后,该过程识别并连接每对连续地标之间的道路段,并且显示到具有到起点的最近地标的用户的路线,沿着路线的其他地标以及到达目的地点的另一最近地标的路线。
    • 7. 发明授权
    • Incremental feature indexing for scalable location recognition
    • 用于可扩展位置识别的增量特征索引
    • US08447120B2
    • 2013-05-21
    • US12245710
    • 2008-10-04
    • Rongrong JiXing Xie
    • Rongrong JiXing Xie
    • G06K9/68
    • G06F17/3028G06F17/30265
    • Described is a technology in which an image retrieval system is updated incrementally as new image data becomes available. Updating is incrementally performed and only triggered when the new image data is large enough or diverse enough relative to the image data currently in use for image retrieval. Incremental updating updates the leaf nodes of a vocabulary tree based upon the new image data. Each leaf node's feature frequency is evaluated against upper and/or lower threshold values, to modify the nodes of the tree based on the feature frequency. Upon completion of the incremental updating, a server that performed the incremental updating is switched to an active state with respect to handling client queries for image retrieval, and another server that was actively handling client queries is switched to an inactive state, awaiting a subsequent incremental updating before switching back to active state.
    • 描述了当新的图像数据变得可用时图像检索系统被逐步更新的技术。 更新被递增地执行,并且仅当新图像数据相对于当前用于图像检索的图像数据足够大或足够多时被触发。 增量更新基于新的图像数据更新词汇树的叶节点。 根据上限和/或下限阈值评估每个叶节点的特征频率,以基于特征频率修改树的节点。 在完成增量更新后,执行增量更新的服务器将切换到处理用于图像检索的客户端查询的活动状态,并且正在处理客户机查询的另一个服务器切换到非活动状态,等待后续增量 在切换回活动状态之前进行更新。
    • 9. 发明授权
    • Learning transportation modes from raw GPS data
    • 从原始GPS数据学习交通模式
    • US08015144B2
    • 2011-09-06
    • US12037305
    • 2008-02-26
    • Yu ZhengLonghao WangLike LiuXing Xie
    • Yu ZhengLonghao WangLike LiuXing Xie
    • G06F9/44G06N7/02G06N7/06
    • G01C21/3423G01C21/20G06N99/005G08G1/0112
    • Described is a technology by which raw GPS data is processed into segments of a trip, with a predicted mode of transportation (e.g., walking, car, bus, bicycling) determined for each segment. The determined transportation modes may be used to tag the GPS data with transportation mode information, and/or dynamically used. Segments are first characterized as walk segments or non-walk segments based on velocity and/or acceleration. Features corresponding to each of those walk segments or non-walk segments are extracted, and analyzed with an inference model to determine probabilities for the possible modes of transportation for each segment. Post-processing may be used to modify the probabilities based on transitioning considerations with respect to the transportation mode of an adjacent segment. The most probable transportation mode for each segment is selected.
    • 描述了一种将原始GPS数据处理成行程段的技术,其中为每个段确定了预测的运输方式(例如步行,汽车,公交车,骑自行车)。 确定的运输模式可以用于使用运输模式信息来标记GPS数据,和/或动态地使用。 首先基于速度和/或加速度将细分特征描述为步行段或非步行段。 提取对应于每个步行段或非步行段的特征,并用推理模型分析以确定每个段的可能运输模式的概率。 可以使用后处理来基于相对于相邻段的传送模式的转换考虑来修改概率。 选择每个段最可能的运输模式。