Huawei Technologies Co., Limited

Hongbo Zhang

Guangyu Shi

Alexander Vladimirovich Slesarenko

Xiangyang Xu

Liufei Wen

Xun Yang

Yang Zhang

Cheng He

Zhefeng Yan

Qinghai Wang

Yasheng Wang

Xiaosong Liu

Mikhail Levin

Yongjun Dai

Alexey Romanov

Shueng-han Gary Chan

Anton Yurievich Orlov

Vyacheslav Anatolievich Dubeyko

Alexey Vasilyevich Romanov

Mikhail Petrovich Levin

Shueng-Han Gary Chan

Hearing-aid set

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.

Transformer and switch-mode power supply

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 (S); determining a first characteristic and a second characteristic (S); 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 (S); obtaining each historical case in a database and a characteristic vector corresponding to each historical case (S); 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 (S).

Search method and apparatus

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.

Method for constructing a graph data structure

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.

Method and device for determination of garbage collector thread number and activity management in log-structured file systems

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.

Method for compiling a source code

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.

Method and system for assigning a computational block of a software program to cores of a multi-processor system

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.

Cooperative caching method and apparatus

A pre-processing method and system for cooperative communication are provided. The method includes: after obtaining channel matrices collected by a Base Station (BS), obtaining Multiple-Input Multiple-Output (MIMO) Cooperation Area (CA) information, in which the MIMO CA information includes cooperation information between BSs, and the cooperation information between the BSs is used to determine an interference relation between MIMO CAs; combining the channel matrices of a User Equipment (UE) according to the interference relation between the MIMO CAs; and performing pre-coding computation of the UE by using the combined channel matrices.

Pre-processing method, system, and apparatus for cooperative communication

Disclosed are a method and an apparatus for controlling data storage. The method includes: obtaining the number of copies of to-be-placed media content; inputting user set information, server set information, media traffic demand information, and network topology information that are collected into a joint optimization model that is based on server selection and traffic engineering to perform joint optimization, and obtaining output information; performing statistics collection on the output information to obtain user access statistics of the to-be-placed media content on each cache device; and placing, according to the user access statistics of the media content and the number of copies, the copies of the to-be-placed media content so that the copies of the to-be-placed media content are preferentially placed on a cache device having large user access statistics. Embodiments of the present invention also provide an apparatus for controlling data storage.

Method and apparatus for controlling data storage

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.

Growing community of inventors

Shenzhen, China

Hongbo Zhang