Profile clustering for homogenous instance analysis

    公开(公告)号:US11115494B1

    公开(公告)日:2021-09-07

    申请号:US16801435

    申请日:2020-02-26

    IPC分类号: H04L29/08

    摘要: Techniques for profile clustering for homogenous instance analysis are described herein. An aspect includes collecting for each of a plurality of homogenous instances in a cloud computing environment, respective profiling information, the profiling information comprising counter data. Another aspect includes identifying a code unit for analysis. Another aspect includes aggregating counters corresponding to the code unit for each of the plurality of homogenous instances from the respective profiling information. Another aspect includes determining a cluster comprising a subset of the plurality of homogenous instances based on the aggregated counters.

    TRAJECTORY SIMILARITY SEARCH
    2.
    发明申请

    公开(公告)号:US20210165410A1

    公开(公告)日:2021-06-03

    申请号:US16701228

    申请日:2019-12-03

    摘要: A computer-implemented method, a computer system, and a computer program product for trajectory similarity search is provided. The present invention may include, in response to receiving, by one or more processors, a search request for at least one trajectory similar to a query trajectory, determining, by one or more processors, a respective similarity between a query trajectory and a plurality of trajectories by calculating, in a synchronized way, a spatial distance measure and a time difference measure between the query trajectory and the plurality of trajectories. The present invention may further include, identifying, by one or more processors, the at least one trajectory from the plurality of trajectories based on the respective similarity between the query trajectory and the plurality of trajectories.

    Directed graph compression
    3.
    发明授权

    公开(公告)号:US10579679B2

    公开(公告)日:2020-03-03

    申请号:US15828878

    申请日:2017-12-01

    IPC分类号: G06F16/901 G06F7/36 G06F17/30

    摘要: In one embodiment of the present disclosure, an original graph including nodes is obtained. The nodes of the original graph are reordered to generate a reordered graph. Non-zero elements in an adjacency matrix for the reordered graph are clustered as compared with an adjacency matrix for the original graph. The adjacency matrix for the reordered graph is encoded with integers. The integers correspond to non-empty blocks in the adjacency matrix for the reordered graph.

    DIRECTED GRAPH COMPRESSION
    4.
    发明申请

    公开(公告)号:US20200034389A1

    公开(公告)日:2020-01-30

    申请号:US16595535

    申请日:2019-10-08

    IPC分类号: G06F16/901 G06F7/36

    摘要: In one embodiment of the present disclosure, an original graph including nodes is obtained. The nodes of the original graph are reordered to generate a reordered graph. Non-zero elements in an adjacency matrix for the reordered graph are clustered as compared with an adjacency matrix for the original graph. The adjacency matrix for the reordered graph is encoded with integers. The integers correspond to non-empty blocks in the adjacency matrix for the reordered graph.

    Proactive change verification
    6.
    发明授权

    公开(公告)号:US11182269B2

    公开(公告)日:2021-11-23

    申请号:US16589246

    申请日:2019-10-01

    IPC分类号: G06F11/00 G06F11/34 G06F11/30

    摘要: A computer-implemented method for proactive change verification is provided. Aspects include analyzing runtime execution characteristics from a plurality of base activity metrics and a plurality of experimental activity metrics and creating a plurality of activity pairs wherein each activity pair comprises a base activity metric and its corresponding experimental activity metric. Aspects also include identifying significant activity pairs from the plurality of activity pairs wherein the experimental activity significantly deviates from its corresponding base activity and classifying significant activity pairs by deviation type. Aspects further include sorting activity pairs by their impact and removing activity pairs that have an impact of less than a threshold amount, wherein the threshold amount is based on the deviation type. Aspects also include correlating interacting impactful activity pairs temporally and prioritizing impactful activity pairs using experimental activity deviations and displaying the impactful activity pairs.

    DATA PROCESSING WITH TAGS
    7.
    发明申请

    公开(公告)号:US20200159854A1

    公开(公告)日:2020-05-21

    申请号:US16197852

    申请日:2018-11-21

    IPC分类号: G06F17/30

    摘要: A source code defining record structure of data is received. The source code includes data tags which provide information for processing to be performed on the data. Data tagging metadata is generated based on the source code, and the data tagging metadata includes record structure information and the data tags. And data is processed according to the data tagging metadata.

    Control flow analysis utilizing function dominator trees
    8.
    发明授权
    Control flow analysis utilizing function dominator trees 有权
    利用功能支配树进行控制流分析

    公开(公告)号:US09176842B2

    公开(公告)日:2015-11-03

    申请号:US13721185

    申请日:2012-12-20

    IPC分类号: G06F9/45 G06F11/34 G06F9/44

    摘要: A method for control flow analysis according to an embodiment of the present invention includes: acquiring an original function call tree of a program, wherein nodes of the original function call tree represent functions and a parent/child relation between the nodes represents a calling relation; generating a corresponding function dominator tree from the calling relation, wherein nodes of the function dominator tree represent the functions and a parent/child relation between the nodes represents a dominator relation, wherein a first function dominates a second function if all the invocations to the second function are originated by the first function; and simplifying the original function call tree according to the function dominator tree so as to obtain a simplified function call tree. According to an embodiment of the present invention, the function call tree for control flow analysis can be simplified.

    摘要翻译: 根据本发明实施例的控制流分析方法包括:获取程序的原始函数调用树,其中原始函数调用树的节点表示函数,并且节点之间的父/子关系表示调用关系; 从所述调用关系生成相应的函数支配树,其中所述函数支配树的节点表示所述函数,并且所述节点之间的父/子关系表示支配关系,其中如果对所述第二函数的所有调用都是第一函数,则第一函数支配第二函数 功能起源于第一功能; 并根据功能支配树简化原函数调用树,以获得简化的函数调用树。 根据本发明的实施例,可以简化用于控制流分析的功能调用树。

    CONTROL FLOW ANALYSIS
    9.
    发明申请
    CONTROL FLOW ANALYSIS 有权
    控制流量分析

    公开(公告)号:US20130174127A1

    公开(公告)日:2013-07-04

    申请号:US13721185

    申请日:2012-12-20

    IPC分类号: G06F11/34

    摘要: A method for control flow analysis according to an embodiment of the present invention includes: acquiring an original function call tree of a program, wherein nodes of the original function call tree represent functions and a parent/child relation between the nodes represents a calling relation; generating a corresponding function dominator tree from the calling relation, wherein nodes of the function dominator tree represent the functions and a parent/child relation between the nodes represents a dominator relation, wherein a first function dominates a second function if all the invocations to the second function are originated by the first function; and simplifying the original function call tree according to the function dominator tree so as to obtain a simplified function call tree. According to an embodiment of the present invention, the function call tree for control flow analysis can be simplified.

    摘要翻译: 根据本发明实施例的控制流分析方法包括:获取程序的原始函数调用树,其中原始函数调用树的节点表示函数,并且节点之间的父/子关系表示调用关系; 从所述调用关系生成相应的函数支配树,其中所述函数支配树的节点表示所述函数,并且所述节点之间的父/子关系表示支配关系,其中如果对所述第二函数的所有调用都是第一函数,则第一函数支配第二函数 功能起源于第一功能; 并根据功能支配树简化原函数调用树,以获得简化的函数调用树。 根据本发明的实施例,可以简化用于控制流分析的功能调用树。

    Trustable web searching verification in a blockchain

    公开(公告)号:US10691763B2

    公开(公告)日:2020-06-23

    申请号:US15349299

    申请日:2016-11-11

    IPC分类号: G06F16/9535

    摘要: Providing web search results which are verifiable via the blockchain may offer transparency into valid web pages and their availability when conducting a search. One example method of operation may include performing a plurality of web page interactions by a plurality of network node devices operating on a network, validating existence of valid web pages, detecting invalid web pages based on the plurality of web page interactions, and storing a valid page package with the valid web pages in a blockchain.