会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • DISTRIBUTED DRONE FLIGHT PATH BUILDER SYSTEM
    • 分布式飞行员飞行员建筑物系统
    • US20160325832A1
    • 2016-11-10
    • US15092004
    • 2016-04-06
    • Manu Shukla
    • Manu Shukla
    • B64C39/02G08G5/00
    • B64C39/024B64C2201/12B64C2201/141G08G5/0013G08G5/0026G08G5/0034G08G5/006G08G5/0069
    • Drones have become ubiquitous in performing risky and labor intensive areal tasks cheaply and safely. To allow them to be autonomous, their flight plan needs to be pre-built for them. Existing works do not precalculate flight paths but instead focus on navigation through camera based image processing techniques, genetic or geometric algorithms to guide the drone during flight. That makes flight navigation complex and risky. We present automated flight plan builder DIFPL which pre-builds flight plans for drones to survey a large area. The flight plans are built for subregions and fed into drones which allow them to navigate autonomously. DIFPL employs distributed paradigm on Hadoop MapReduce framework. Distribution is achieved by processing sections or subregions in parallel. Experiments performed with network and elevation datasets validate the efficiency of DIFPL in building optimal flight plans.
    • 无人机在廉价而安全地执行危险和劳动密集型地面任务方面变得普遍存在。 为了让他们自主,他们的飞行计划需要为他们预先建造。 现有作品不会对飞行路径进行预先计算,而是侧重于通过基于相机的图像处理技术的导航,遗传或几何算法来指导飞行中的无人机。 这使得飞行导航复杂和冒险。 我们提供自动化飞行计划制造商DIFPL,它为无人机的飞行计划制定了大面积调查。 这些飞行计划是为次区域建造的,并进入无人机,允许他们自主航行。 DIFPL在Hadoop MapReduce框架上采用分布式范例。 分配是通过并行处理部分或次区域来实现的。 使用网络和高程数据集进行的实验验证了DIFPL在建立最佳飞行计划方面的效率。
    • 2. 发明申请
    • DISTRIBUTED STORYTELLING FRAMEWORK FOR INTELLIGENCE ANALYSIS
    • 分布式智能分析框架
    • US20160292151A1
    • 2016-10-06
    • US15092020
    • 2016-04-06
    • Manu Shukla
    • Manu Shukla
    • G06F17/28
    • G06F17/2785G06F16/345H04L51/32
    • Aspects of the present disclosure relate to a distributed storytelling framework. A server receives an adjacency list comprising a set of nodes linked together by edges. The server converts the adjacency list to a set of generated storylines, each storyline being represented as a key-value pair. A key represents a first node and a value represents a second node linked to the first node by an edge. The server combines first and second storylines, of the set of generated storylines, to generate an additional storyline in response to a value from a first storyline matching a key from a second storyline. The additional storyline includes a single key and multiple values, and is added to the set of generated storylines. The server repeats combining storylines, of the set of generated storylines, to generate additional storylines. The server provides an output corresponding to at least one of the generated storylines.
    • 本公开的方面涉及分布式故事框架。 服务器接收包括通过边缘链接在一起的一组节点的邻接列表。 服务器将邻接列表转换为一组生成的故事情节,每个故事情节表示为键值对。 密钥表示第一节点,值表示通过边缘链接到第一节点的第二节点。 该服务器将所生成的故事集合中的第一和第二故事情节相结合,以响应来自与第二故事情节相匹配的键的第一故事情节的值产生额外的故事情节。 额外的故事情节包括单个键和多个值,并被添加到一组生成的故事情节。 服务器重复组合故事情节,产生故事情节,以产生额外的故事情节。 服务器提供对应于所生成的故事情节中的至少一个的输出。
    • 7. 发明授权
    • System and method for dynamically generating an invisible hierarchy in a planning system
    • 在规划系统中动态生成不可见层次的系统和方法
    • US06456997B1
    • 2002-09-24
    • US09548131
    • 2000-04-12
    • Manu Shukla
    • Manu Shukla
    • G06F1730
    • G06Q10/06Y10S707/99931
    • A planning system and method for dynamically generating an invisible hierarchy during a planning session in an OLAP type tool. The planning system comprises: (1) a loading mechanism for loading a plan segment, wherein the plan segment is a portion of a plan cube and comprises data, rules, and a defined hierarchy within a dimension; (2) a checking mechanism for determining whether any of the rules associated with the plan segment reference data outside of the plan segment; and (3) a mechanism for creating an invisible hierarchy, wherein the invisible hierarchy comprises the defined hierarchy and at least one ancestor of a top member of the defined hierarchy.
    • 在OLAP类型工具中的规划会话期间动态生成不可见层次的规划系统和方法。 规划系统包括:(1)用于加载计划段的加载机构,其中所述计划段是计划立方体的一部分,并且包括维度内的数据,规则和定义的层次; (2)用于确定与所述计划段相关联的任何规则是否参考所述计划段之外的数据的检查机制; 和(3)用于创建不可见层级的机制,其中所述不可见层级包括所述定义的层次结构和所述定义层次结构的顶层成员的至少一个祖先。