Data management system, method, terminal and medium based on hybrid storage

    公开(公告)号:US11741053B2

    公开(公告)日:2023-08-29

    申请号:US17144094

    申请日:2021-01-07

    CPC classification number: G06F16/1847 G06F16/148 G06F16/178 G06F16/185

    Abstract: This application provides a data management system, method, terminal, and medium based on hybrid storage. The data management system includes: a first file system mount module, to mount at least one user-mode file system; a second file system mount module, to mount at least two independent back-end file systems based on the user-mode file system for storing hot data and cold data respectively; a data label module, to label the hot or cold attribute of the data in a user data request; a file system selection module, to store the data in the corresponding back-end file system and/or take the data out from the corresponding back-end file system according to the hot or cold attribute of the data.

    RIPPLE PUSH METHOD FOR GRAPH CUT
    113.
    发明公开

    公开(公告)号:US20230195793A1

    公开(公告)日:2023-06-22

    申请号:US17799278

    申请日:2021-09-22

    CPC classification number: G06F16/9024

    Abstract: A ripple push method for a graph cut includes: obtaining an excess flow ef(v) of a current node v; traversing four edges connecting the current node v in top, bottom, left and right directions, and determining whether each of the four edges is a pushable edge; calculating, according to different weight functions, a maximum push value of each of the four edges by efw=ef(v)*W, where W denotes a weight function; and traversing the four edges, recording a pushable flow of each of the four edges, and pushing out a calculated flow. The ripple push method explores different push weight functions, and significantly improves the actual parallelism of the push-relabel algorithm.

    NEURAL OPACITY POINT CLOUD
    115.
    发明申请

    公开(公告)号:US20230071559A1

    公开(公告)日:2023-03-09

    申请号:US17980754

    申请日:2022-11-04

    Inventor: Cen WANG Jingyi Yu

    Abstract: A method of rendering an object is provided. The method comprises: encoding a feature vector to each point in a point cloud for an object, wherein the feature vector comprises an alpha matte; projecting each point in the point cloud and the corresponding feature vector to a target view to compute a feature map; and using a neural rendering network to decode the feature map into a RGB image and the alpha matte and to update the feature vector.

    MULTI-VIEW NEURAL HUMAN RENDERING
    117.
    发明申请

    公开(公告)号:US20230027234A1

    公开(公告)日:2023-01-26

    申请号:US17951405

    申请日:2022-09-23

    Inventor: Minye WU Jingyi YU

    Abstract: An image-based method of modeling and rendering a three-dimensional model of an object is provided. The method comprises: obtaining a three-dimensional point cloud at each frame of a synchronized, multi-view video of an object, wherein the video comprises a plurality of frames; extracting a feature descriptor for each point in the point cloud for the plurality of frames without storing the feature descriptor for each frame; producing a two-dimensional feature map for a target camera; and using an anti-aliased convolutional neural network to decode the feature map into an image and a foreground mask.

    Optimized reconfiguration algorithm based on dynamic voltage and frequency scaling

    公开(公告)号:US11537774B2

    公开(公告)日:2022-12-27

    申请号:US17595194

    申请日:2021-06-09

    Inventor: Rui Li Yajun Ha

    Abstract: An optimized reconfiguration algorithm based on dynamic voltage and frequency scaling (DVFS) is provided, which mainly has the following contributions. The optimized reconfiguration algorithm based on DVFS proposes a DVFS-based reconfiguration method, which schedules user tasks according to a degree of parallelism (DOP) of the user tasks so as to reconfigure more parallel user tasks, thereby achieving higher reliability. The optimized reconfiguration algorithm based on DVFS proposes a K-means-based heuristic approximation algorithm, which minimizes the delay of the DVFS-based reconfiguration scheduling algorithm. The optimized reconfiguration algorithm based on DVFS proposes a K-means-based method, which reduces memory overhead caused by DVFS-based reconfiguration scheduling. The optimized reconfiguration algorithm based on DVFS improves the reliability of a field programmable gate array (FPGA) system and minimizes the area overhead of a hardware circuit.

    ANTI-CXCR2 ANTIBODIES AND USES THEREOF

    公开(公告)号:US20220332835A1

    公开(公告)日:2022-10-20

    申请号:US17640309

    申请日:2020-09-03

    Abstract: Provided are anti-CXCR2 antibodies and antigen-binding fragments thereof. The antibodies or fragments thereof specifically bind to N-terminal, extracellular domain of the CXCR2 protein. In various example, the antibodies or fragments thereof include a VH CDR1 of SEQ ID NO: 1, a VH CDR2 of SEQ ID NO: 2, a VH CDR3 of SEQ ID NO: 3, or any one of SQ ID NO: 7-14, a VL CDR1 of SEQ ID NO: 4, a VL CDR2 of SEQ ID NO: 5, and a VL CDR3 of SEQ ID NO: 6, or variants of each thereof. Methods of using the antibodies or fragments thereof for treating and diagnosing diseases such as cancer and inflammatory diseases are also provided.

    Efficient K-nearest neighbor search algorithm for three-dimensional (3D) lidar point cloud in unmanned driving

    公开(公告)号:US11430200B2

    公开(公告)日:2022-08-30

    申请号:US17593852

    申请日:2021-06-09

    Inventor: Hao Sun Yajun Ha

    Abstract: An efficient K-nearest neighbor search algorithm for three-dimensional (3D) lidar point cloud in unmanned driving and a use of the foregoing K-nearest neighbor search algorithm in a point cloud map matching process in the unmanned driving are provided. A novel data structure for fast K-nearest neighbor search is used, such that each voxel or sub-voxel includes a proper quantity of points to reduce redundant search. The novel K-nearest neighbor search algorithm is based on a double segmentation voxel structure (DSVS) and a field programmable gate array (FPGA). By means of the novel K-nearest neighbor search algorithm, nearest neighbors are searched for only in a neighboring expected area near a search point, thereby reducing search of redundant points. In addition, an optimized data transmission and access policy is used, which makes the algorithm more fit the characteristic of the FPGA.

Patent Agency Ranking