-
公开(公告)号：US12046409B2
公开(公告)日：2024-07-23
申请号：US16611092
申请日：2017-05-05
Applicant: Huawei Technologies Co., Ltd.
Inventor： Hongbo Zhang , Yongjun Dai , Xiaosong Liu , Qinghai Wang
CPC classification number: H01F27/289 , H01F27/24 , H01F27/361
Abstract: A transformer and a switch-mode power supply are provided. The transformer includes: a magnetic core structure; several windings that surround a same magnetic cylinder in the magnetic core structure in a stacked manner, where the several windings include at least one primary-side winding and at least one secondary-side winding; and an electromagnetic shielding layer that is disposed between at least two adjacent windings, where the two adjacent windings are a primary-side winding and a secondary-side winding, and the electromagnetic shielding layer is made of a magnetic material. The electromagnetic shielding layer of the transformer can suppress a noise current of the winding, to reduce noise.
-
公开(公告)号：US20160139894A1
公开(公告)日：2016-05-19
申请号：US15004018
申请日：2016-01-22
Applicant: HUAWEI TECHNOLOGIES CO., LTD.
CPC classification number: G06F8/433 , G06F8/34 , G06F8/44 , G06F9/4552
Abstract: The disclosure relates to a method for constructing a graph data structure as an intermediate representation of source code for a compiler configured for compiling the source code into executable machine code running on a processor of a computer system, wherein program operations of the source code are represented in an object-oriented programming language by objects of classes that form a hierarchy growing from a base node class of the graph data structure, the method comprising: producing new nodes of the graph data structure by calling factory methods associated with existing nodes of the graph data structure based on a factory method design pattern implemented in the nodes of the graph data structure, wherein the nodes of the graph data structure are identified by symbols; and using the symbols as proxies of the nodes of the graph data structure according to a proxy design pattern.
Abstract translation: 本公开涉及一种用于构建图形数据结构的方法，该图形数据结构用作编译器的源代码的中间表示，所述编译器被配置为将源代码编译成在计算机系统的处理器上运行的可执行机器代码，其中代码的程序操作被表示 在面向对象的编程语言中，由形成从图形数据结构的基本节点类形成的分层的类的对象，该方法包括：通过调用与该图的现有节点相关联的工厂方法来生成图形数据结构的新节点 基于在图形数据结构的节点中实现的工厂方法设计模式的数据结构，其中图形数据结构的节点由符号标识; 并根据代理设计模式使用符号作为图形数据结构的节点的代理。
-
公开(公告)号：US20250013875A1
公开(公告)日：2025-01-09
申请号：US18885379
申请日：2024-09-13
Applicant: HUAWEI TECHNOLOGIES CO., LTD.
Inventor： Alexander Imani Cowen-Rivers , Yilun Yang , Shaoyu Yang , Rasul Tutunov , Aivar Sootla , Haitham Bou Ammar , Hongbo Zhang
IPC: G06N3/0985 , B60W60/00 , G06N3/045 , G06N7/01
Abstract: An apparatus is provided for determining improved motion planner hyperparameters. The apparatus is configured to: receive a data pair comprising a set of hyperparameters and a utility score defining a utility of a motion planner outcome resulting from the set of hyperparameters; provide a model defining a relationship between the hyperparameters and the utility score; generate trial hyperparameters using a guidance objective configured to evaluate a quality of trial sets of hyperparameters in dependence on the model; determine a trial outcome of the motion planner based on the trial hyperparameters; and determine a new utility score of the trial hyperparameters based on comparing the trial outcome with truth data. The apparatus therefore optimises currently deployed hyperparameters by comparison with truth data in order to provide hyperparameters that can produce realistic motion planning trajectories and outperform currently deployed hyperparameters.
-
公开(公告)号：US10365902B2
公开(公告)日：2019-07-30
申请号：US15445706
申请日：2017-02-28
Applicant: Huawei Technologies Co., Ltd.
Inventor： Alexander Vladimirovich Slesarenko , Alexey Romanov , Hongbo Zhang
Abstract: The invention relates to a method for compiling a source code to a program code, the method comprising: providing a pattern graph based on the source code, the pattern graph corresponding to an intermediate representation of the source code according to a set of rules in a first programming language, wherein the set of rules comprises a specific replacement rule directing a pattern graph to be replaced by a corresponding replacement graph assigned to the pattern graph, replacing the pattern graph by the replacement graph assigned to the pattern graph, and generating the program code based on the replacement graph.
-
公开(公告)号：US10162679B2
公开(公告)日：2018-12-25
申请号：US15088974
申请日：2016-04-01
Applicant: Huawei Technologies Co., Ltd.
IPC: G06F9/50
Abstract: A method for assigning a computational block of a software program to cores of a multi-processor system includes: evaluating a first number of available cores of a first type of the multi-processor system and a second number of available cores of a second type of the multi-processor system; determining a first number of loops of the computational block for binding with the cores of the first type and a second number of loops of the computational block for binding with the cores of the second type; binding the first number of loops with the cores of the first type and binding the second number of loops with the cores of the second type; and executing the loops of the computational block according to the binding.
-
Patent Agency Ranking
公开(公告)号：US09532083B2
公开(公告)日：2016-12-27
申请号：US13907503
申请日：2013-05-31
Applicant: Huawei Technologies Co., Ltd.
Inventor： Hongbo Zhang , Guangyu Shi , Zhefeng Yan , Shueng-han gary Chan
IPC: H04N7/173 , H04N7/16 , H04N21/231 , H04N21/2225 , H04N21/237 , H04N21/24 , H04L29/08
CPC classification number: H04N21/23106 , H04L67/2842 , H04N21/2225 , H04N21/23116 , H04N21/237 , H04N21/24
Abstract: Embodiments of the present invention disclose a cooperative caching method and apparatus, relating to the field of network technologies, to improve the local hit ratio without increasing the local server costs. The technical solution provided in the present invention includes: obtaining, according to cache information, end-to-end delay between a local server and a neighbor server, and popularity in a cache list, a consolidated gain value of a cached video segment and a consolidated gain value of a candidate video segment in the local server; and replacing the cached video segment with the candidate video segment when the consolidated gain value of the cached video segment and the consolidated gain value of the candidate video segment in the local server meet a replacement condition.
Abstract translation: 本发明的实施例公开了与网络技术领域相关的协作缓存方法和装置，以提高本地命中率而不增加本地服务器成本。 本发明提供的技术方案包括：根据缓存信息获取本地服务器和邻居服务器之间的端到端延迟，以及缓存列表中的流行度，缓存视频段的合并增益值和 本地服务器中候选视频段的合并增益值; 并且当本地服务器中的缓存的视频段的合并增益值和候选视频段的合并增益值满足替换条件时，用候选视频段替换高速缓存的视频段。
-
公开(公告)号：US09003029B2
公开(公告)日：2015-04-07
申请号：US13721530
申请日：2012-12-20
Applicant: Huawei Technologies Co., Ltd.
Inventor： Hongbo Zhang , Guangyu Shi , Liufei Wen , Xiangyang Xu
IPC: H04L12/26 , H04L12/24 , H04L12/701 , H04L29/08
CPC classification number: H04L43/0876 , H04L41/0896 , H04L41/12 , H04L45/00 , H04L67/327
Abstract: Embodiments of the present invention disclose a method, an apparatus and a system for joint optimization. The method for joint optimization includes: decomposing the joint optimization of an entire network into the joint optimization performed in each sub-network, regarding a bandwidth requirement for a server off the sub-network as a bandwidth requirement for a virtual server on a port, iteratively performing the joint optimization in each sub-network, and applying results of the joint optimization in the network. In the embodiments of the present invention, the bandwidth requirement for the server off the sub-network is regarded as the bandwidth requirement for the virtual server on the port, the joint optimization is iteratively performed in each sub-network, and the results of the joint optimization are applied in the network, so that the joint optimization of the entire network is performed in parallel.
Abstract translation: 本发明的实施例公开了一种用于联合优化的方法，装置和系统。 联合优化方法包括：将关于子网的服务器的带宽要求作为端口上的虚拟服务器的带宽要求，将整个网络的联合优化分解为在每个子网中执行的联合优化， 迭代地执行每个子网中的联合优化，并将联合优化的结果应用于网络中。 在本发明的实施例中，将离开子网的服务器的带宽要求视为端口上虚拟服务器的带宽需求，在每个子网中迭代执行联合优化， 联合优化在网络中应用，从而并行执行整个网络的联合优化。
-
公开(公告)号：US11210292B2
公开(公告)日：2021-12-28
申请号：US16396381
申请日：2019-04-26
Applicant: HUAWEI TECHNOLOGIES CO., LTD.
Inventor： Yasheng Wang , Yang Zhang , Hongbo Zhang
IPC: G06F16/00 , G06F16/2455 , G16H10/60
Abstract: Embodiments of the present invention relate to the field of computer technologies, and provide a search method and apparatus to resolve a problem that a reference text, of a text in a professional field, that is determined by using the prior art has relatively low accuracy. The method includes: obtaining n named entities in a current to-be-analyzed target case (S300); determining a first characteristic and a second characteristic (S301); generating, based on the first characteristic and the second characteristic and according to a preset vector generation rule, a target characteristic vector corresponding to the target case (S302); obtaining each historical case in a database and a characteristic vector corresponding to each historical case (S303); and separately calculating a similarity between the target characteristic vector and the characteristic vector corresponding to each historical case, and selecting a historical case whose similarity result meets a preset condition as a reference case (S304).
-
公开(公告)号：US10896029B2
公开(公告)日：2021-01-19
申请号：US15004018
申请日：2016-01-22
Applicant: HUAWEI TECHNOLOGIES CO., LTD.
Abstract: The disclosure relates to a method for constructing a graph data structure as an intermediate representation of source code for a compiler configured for compiling the source code into executable machine code running on a processor of a computer system, wherein program operations of the source code are represented in an object-oriented programming language by objects of classes that form a hierarchy growing from a base node class of the graph data structure, the method comprising: producing new nodes of the graph data structure by calling factory methods associated with existing nodes of the graph data structure based on a factory method design pattern implemented in the nodes of the graph data structure, wherein the nodes of the graph data structure are identified by symbols; and using the symbols as proxies of the nodes of the graph data structure according to a proxy design pattern.
-
公开(公告)号：US10802718B2
公开(公告)日：2020-10-13
申请号：US15957599
申请日：2018-04-19
Applicant: HUAWEI TECHNOLOGIES CO., LTD.
Inventor： Vyacheslav Anatolievich Dubeyko , Hongbo Zhang
Abstract: A method for garbage collection of a volume in a log-structured file system is disclosed. The volume comprises a plurality of segments. Each of the segments comprises a plurality of blocks. An invalid block count of each of the segments is determined. The invalid block count is used as an index for ordering the segments in a garbage collection queue. A plurality of range areas are determined for the index. A migration rate of each range area is determined, and the migration rate of a given range area reflects an intensity of segment migration into/out of the given range area. A negative migration rate reflects a segment migration into the given range area. Garbage collection is performed based upon the migration rate.
-
-
-
-
-
-
-
-
-
Search Results
12
records
(took 0.019 seconds)
