会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 74. 发明授权
    • Method and apparatus for efficient aggregate computation over data streams
    • 用于数据流高效汇总计算的方法和装置
    • US08832073B2
    • 2014-09-09
    • US11770926
    • 2007-06-29
    • Kanthi Chikguntakal NagarajNaidu Kundrapu Venkata MarayyaRajeev RastogiScott Satkin
    • Kanthi Chikguntakal NagarajNaidu Kundrapu Venkata MarayyaRajeev RastogiScott Satkin
    • G06F17/30
    • G06F17/30463G06F17/30412G06F17/30454G06F17/30548G06F17/30864
    • Improved techniques are disclosed for processing data stream queries wherein a data stream is obtained, a set of aggregate queries to be executed on the data stream is obtained, and a query plan for executing the set of aggregate queries on the data stream is generated. In a first method, the generated query plan includes generating at least one intermediate aggregate query, wherein the intermediate aggregate query combines a subset of aggregate queries from the set of aggregate queries so as to pre-aggregate data from the data stream prior to execution of the subset of aggregate queries such that the generated query plan is optimized for computational expense based on a given cost model. In a second method, the generated query plan includes identifying similar filters in two or more aggregate queries of the set of aggregate queries and combining the similar filters into a single filter such that the single filter is usable to pre-filter data input to the two or more aggregate queries.
    • 公开了用于处理数据流查询的改进技术,其中获得数据流,获得要在数据流上执行的一组聚合查询,并且生成用于在数据流上执行聚合查询集合的查询计划。 在第一种方法中,生成的查询计划包括生成至少一个中间聚合查询,其中中间聚合查询组合来自聚合查询集合的聚合查询的子集,以便在执行之前从数据流预聚合数据 聚合查询的子集,使得生成的查询计划基于给定的成本模型被优化用于计算费用。 在第二种方法中,所生成的查询计划包括在集合查询集合的两个或多个聚合查询中识别类似的过滤器,并将类似的过滤器组合成单个过滤器,使得单个过滤器可用于预先过滤输入到两个 或更多聚合查询。
    • 76. 发明授权
    • Automated transformation of specifications for devices into executable modules
    • 将设备规范自动转换为可执行模块
    • US08356085B2
    • 2013-01-15
    • US10600995
    • 2003-06-20
    • Ben JaiGokul Chander PrabhakarRajeev Rastogi
    • Ben JaiGokul Chander PrabhakarRajeev Rastogi
    • G06F15/177
    • H04L41/0886H04L41/0213H04L41/0866
    • A number of configuration elements are associated with a number of devices. Information about input configuration elements is accessed. An input configuration element is associated with one or more input rules. It is determined which of the configuration elements could be accessed by the input rules and any call chains emanating from the rules. Output rules are determined by using the accessed configuration elements, the input rules, and the way the input rule manipulates its accessed configuration elements. Each output rule may be derived from an input rule and corresponds to the same input configuration element associated with that input rule. An executable module is generated that is adapted to access at least a given one of the input configuration elements and to trigger one or more of the output rules corresponding to the given input configuration element. Read and write sets for rules are determined, and the triggered output rules ensure that restrictions associated with a configuration element are not violated.
    • 许多配置元素与多个设备相关联。 访问有关输入配置元素的信息。 输入配置元素与一个或多个输入规则相关联。 确定哪些配置元素可以被输入规则和从规则发出的任何调用链访问。 输出规则通过使用访问的配置元素,输入规则以及输入规则操纵其访问的配置元素的方式来确定。 每个输出规则可以从输入规则导出,并且对应于与该输入规则相关联的相同输入配置元素。 生成可执行模块,其适于访问至少一个给定的一个输入配置元素,并且触发对应于给定输入配置元素的一个或多个输出规则。 确定规则的读取和写入集合,并且触发的输出规则确保与配置元素相关联的限制不被违反。
    • 77. 发明申请
    • METHOD AND SYSTEM FOR MAXIMIZING CONTENT SPREAD IN SOCIAL NETWORK
    • 用于最大化社会网络中的内容传播的方法和系统
    • US20120259915A1
    • 2012-10-11
    • US13080661
    • 2011-04-06
    • Rushi Prafull BhattRajeev RastogiVineet Shashikant ChaojiSayan Ranu
    • Rushi Prafull BhattRajeev RastogiVineet Shashikant ChaojiSayan Ranu
    • G06F15/16
    • G06Q50/01
    • A method, a system and a computer program product for maximizing content spread in a social network are provided. Samples of edges are generated from an initial candidate set of edges. Each edge of the samples of edges has a probability value for content flow. Further, a subset of edges is determined from the samples of edges based on gain corresponding to each edge. Also, each node of the subset of edges is having at least one of less than ‘K’ or equal to ‘K’ incoming edges. Further, the probability of each edge, of the subset of edges, may be incremented. Furthermore, a final set of edges may be determined by ensuring ‘K’ incoming edges. The ‘K’ incoming edges may be ensured by removing one or more incoming edges when a number of the incoming edges for a node of the final set is greater than ‘K’ incoming edge.
    • 提供了一种用于最大化社交网络中的内容传播的方法,系统和计算机程序产品。 边缘样本从初始候选边缘集合生成。 边缘样本的每个边缘都具有内容流的概率值。 此外,基于与每个边缘相对应的增益,从边缘样本确定边缘子集。 此外,边缘子集的每个节点具有小于K或等于K个入口边缘中的至少一个。 此外,可以增加边缘子集中的每个边缘的概率。 此外,可以通过确保K个进入边缘来确定最终的边缘集合。 当最终集合的节点的进入边缘的数量大于K个进入边缘时,可以通过去除一个或多个进入边缘来确保K个进入边缘。