公开(公告)号：US20190042311A1

公开(公告)日：2019-02-07

申请号：US16153099

申请日：2018-10-05

Applicant: HUAWEI TECHNOLOGIES CO., LTD.

Inventor： Jiansheng WEI ,  Guowei HUANG ,  Liqun DENG

IPC: G06F9/50 ,  G06F19/18

Abstract: The present disclosure relates to a resource allocation method for gene analysis. In one example method, a parameter value that is of the target chromosome region and that is used for resource allocation is obtained according to a sequenced read in a target chromosome region. A computing resource is allocated, according to the parameter value that is of the target chromosome region and that is used for resource allocation, to an operation in a cleansing and variant calling task that is in the gene analysis and that is performed on the sequenced read in the target chromosome region.

公开(公告)号：US20220075958A1

公开(公告)日：2022-03-10

申请号：US17530197

申请日：2021-11-18

Applicant: Huawei Technologies Co., Ltd.

Inventor： Yulong ZENG ,  Jiansheng WEI ,  Yasheng WANG ,  Liqun DENG ,  Anqi CUI

IPC: G06F40/30 ,  G06N5/00 ,  G06F40/289

Abstract: The present invention discloses a missing semantics complementing method in the field of natural language processing in the artificial intelligence field, including: obtaining a question statement and a historical dialog statement; resolving a to-be-resolved item in the question statement based on the historical dialog statement and location information of the to-be-resolved item, to obtain a resolved question statement; determining whether a component in the question statement is ellipted, and if a component in the question statement is ellipted, complementing the ellipted component based on the historical dialog statement, to obtain a question statement after ellipsis resolution; merging the resolved question statement and the question statement after ellipsis resolution, to obtain a merged question statement; and determining a target complemented question statement from the resolved question statement, the question statement after ellipsis resolution, and the merged question statement.

公开(公告)号：US20190228014A1

公开(公告)日：2019-07-25

申请号：US16370343

申请日：2019-03-29

Applicant: HUAWEI TECHNOLOGIES CO., LTD.

Inventor： Wenjie LIU ,  Jiansheng WEI ,  Xiaofei ZHANG ,  Lei CHEN

IPC: G06F16/2453 ,  G06F16/2455 ,  G06F16/22

Abstract: A control method for performing a multi-table join operation and a corresponding apparatus are disclosed. Fields in a table whose fields participating in a theta join operation and used in the query statement meet a first preset condition are decomposed, to obtain a plurality of first field groups, so that the theta join operation can be implemented in steps in a form of the plurality of field groups. This can reduce a data amount of Cartesian product calculation during one join operation, greatly reduce network transmission overheads, computing overheads, and memory overheads, and improve execution efficiency.

公开(公告)号：US20190227853A1

公开(公告)日：2019-07-25

申请号：US16369564

申请日：2019-03-29

Applicant: HUAWEI TECHNOLOGIES CO., LTD.

Inventor： Guowei HUANG ,  Liqun DENG ,  Jiansheng WEI

IPC: G06F9/50

Abstract: Embodiments of the present invention related to in Artificial Intelligence field and disclose a computing resource allocation method, a related device, and a MapReduce-based distributed system. The system includes a management node and a target computing node. The management node is configured to: obtain M computing tasks, and establish a resource assessment model; and send one or more computing tasks of the M computing tasks and information about the resource assessment model to the target computing node. The target computing node is configured to: receive the one or more computing tasks and the information about the resource assessment model, and, substitute input data of the computing stage into the resource assessment model to compute a resource size of a computing resource required for the computing stage; and compute the input data by using a computing resource that is of the resource size and that is in a preset resource pool.

公开(公告)号：US20190184573A1

公开(公告)日：2019-06-20

申请号：US16276576

申请日：2019-02-14

Applicant: HUAWEI TECHNOLOGIES CO., LTD.

Inventor： Sixiao YANG ,  Heng LIAO ,  Maosheng HUANG ,  Jiansheng WEI ,  Dawei HUO ,  Wenhua SUN

IPC: B25J11/00 ,  G06N20/00 ,  G06K9/00

CPC classification number: B25J11/001 ,  G06F3/01 ,  G06K9/00335 ,  G06N20/00

Abstract: The present invention provides a robot control method, and the method includes: collecting interaction information of a companion target, and obtaining digital person information of a companion person (101), where the interaction information includes interaction information of a sound or an action of the companion target toward the robot, and the digital person information includes a set of digitized information of the companion person; and determining, by using the interaction information and the digital person information, a manner of interacting with the companion target (103); generating, based on the digital person information of the companion person and by using a machine learning algorithm, an interaction content corresponding to the interaction manner (105); and generating a response action toward the companion target based on the interaction manner and the interaction content (107).

公开(公告)号：US20190050531A1

公开(公告)日：2019-02-14

申请号：US16159715

申请日：2018-10-15

Applicant: HUAWEI TECHNOLOGIES CO., LTD.

Inventor： Liqun DENG ,  Jiansheng WEI ,  Jun ZHANG

IPC: G06F19/22 ,  C12Q1/6869 ,  C40B40/08 ,  C12Q1/6827 ,  G06F19/18 ,  G06F19/20 ,  G06F19/24 ,  G06F19/28

Abstract: A DNA sequence processing method and device are used to resolve a prior-art problem of low-efficiency mutation detection on a DNA sample. The method includes: performing alignment computation on each read in the read group according to a reference sequence of a chromosome to obtain an alignment result record of the read relative to the reference sequence; determining a chromosome region in which each read is located; and merging alignment result records of reads located in a same chromosome region into one intermediate result file; determining a target sequence file of each chromosome region according to the N intermediate result files corresponding to the chromosome region; and determining mutation site information of each chromosome region according to the target sequence file of the chromosome region.

公开(公告)号：US20170017407A1

公开(公告)日：2017-01-19

申请号：US14801421

申请日：2015-07-16

Applicant: Huawei Technologies Co., Ltd.

Inventor： Jiansheng WEI ,  Junhua ZHU

IPC: G06F3/06 ,  G06F12/02

CPC classification number: G06F3/0608 ,  G06F3/0641 ,  G06F3/068 ,  G06F12/023 ,  G06F2212/1044

Abstract: Embodiments of the present invention provide a data object processing method and apparatus, which can divide a data object into one or more blocks; calculate a sample compression ratio of each block, aggregate neighboring consecutive blocks with a same sample compression ratio characteristic into one data segment, and obtain the sample compression ratio of each of the data segments; and select, according to a length range to which a length of each of the data segments belongs and a compression ratio range to which the sample compression ratio of each of the data segments belongs, an expected length to divide the data segment into data chunks, where the sample compression ratio of each of the data segments uniquely belongs to one of the compression ratio ranges, and the length of each of the data segments uniquely belongs to one of the length ranges.

Abstract translation: 本发明的实施例提供一种数据对象处理方法和装置，其可以将数据对象划分成一个或多个块; 计算每个块的采样压缩比，将具有相同采样压缩比特性的相邻连续块聚集成一个数据段，并获得每个数据段的采样压缩比; 并且根据每个数据段的长度所属的长度范围和每个数据段的采样压缩比所属的压缩比范围，选择预定长度以将数据段划分为数据块， 其中每个数据段的采样压缩比唯一地属于压缩比范围中的一个，并且每个数据段的长度唯一地属于一个长度范围。