scispace - formally typeset
Search or ask a question
Institution

Huawei

CompanyShenzhen, China
About: Huawei is a company organization based out in Shenzhen, China. It is known for research contribution in the topics: Terminal (electronics) & Node (networking). The organization has 41417 authors who have published 44698 publications receiving 343496 citations. The organization is also known as: Huawei Technologies & Huawei Technologies Co., Ltd..


Papers
More filters
Proceedings ArticleDOI
15 Apr 2018
TL;DR: In this paper, the authors proposed two age-optimal trajectories, referred to as the Max-AoIoptimal and Ave AoI-Optimal, to minimize the average AoI of all the ground sensor nodes.
Abstract: Unmanned aerial vehicle (UAV)-aided data collection is a new and promising application in many practical scenarios. In this work, we study the age-optimal trajectory planning problem in UAV-enabled wireless sensor networks, where a UAV is dispatched to collect data from the ground sensor nodes (SNs). The age of information (AoI) collected from each SN is characterized by the data uploading time and the time elapsed since the UAV leaves this SN. We attempt to design two age-optimal trajectories, referred to as the Max-AoI-optimal and Ave-AoI-optimal trajectories, respectively. The Max-AoI-optimal trajectory planning is to minimize the age of the ‘oldest’ sensed information among the SNs. The Ave-AoI-optimal trajectory planning is to minimize the average AoI of all the SNs. Then, we show that each age-optimal flight trajectory corresponds to a shortest Hamiltonian path in the wireless sensor network where the distance between any two SNs represents the amount of inter-visit time. The dynamic programming (DP) method and genetic algorithm (GA) are adopted to find the two different age-optimal trajectories. Simulation results validate the effectiveness of the proposed methods, and show how the UAV's trajectory is affected by the two AoI metrics.

179 citations

Proceedings ArticleDOI
30 Nov 2009
TL;DR: Simulations results for raw and coded bit-error probability indicate that significant performance gain is achieved over random sequences and that the loss compared to the single-user bound can be kept small.
Abstract: We present sets of spreading sequences that are specifically designed to suit a belief-propagation multiuser detection structure, recently presented for overloaded system scenarios. On one hand, our sequences are of the low-density type; on the other their distance spectrum properties ensure good performance in AWGN channels. Simulations results for raw and coded bit-error probability indicate that significant performance gain is achieved over random sequences and that the loss compared to the single-user bound can be kept small.

179 citations

Proceedings ArticleDOI
01 Sep 2018
TL;DR: Two capsule-based architectures are proposed: IntentC CapsNet that extracts semantic features from utterances and aggregates them to discriminate existing intents, and IntentCapsNet-ZSL which gives IntentCpsNet the zero-shot learning ability to discriminate emerging intents via knowledge transfer from existing intent.
Abstract: User intent detection plays a critical role in question-answering and dialog systems. Most previous works treat intent detection as a classification problem where utterances are labeled with predefined intents. However, it is labor-intensive and time-consuming to label users’ utterances as intents are diversely expressed and novel intents will continually be involved. Instead, we study the zero-shot intent detection problem, which aims to detect emerging user intents where no labeled utterances are currently available. We propose two capsule-based architectures: IntentCapsNet that extracts semantic features from utterances and aggregates them to discriminate existing intents, and IntentCapsNet-ZSL which gives IntentCapsNet the zero-shot learning ability to discriminate emerging intents via knowledge transfer from existing intents. Experiments on two real-world datasets show that our model not only can better discriminate diversely expressed existing intents, but is also able to discriminate emerging intents when no labeled utterances are available.

178 citations

Proceedings ArticleDOI
Simone Mangiante1, Guenter Klas1, Amit Navon2, Zhuang GuanHua2, Ju Ran2, Marco Dias Silva1 
11 Aug 2017
TL;DR: A Field Of View (FOV) rendering solution at the edge of a mobile network, designed to optimize the bandwidth and latency required by VR 360° video streaming is presented.
Abstract: VR/AR is rapidly progressing towards enterprise and end customers with the promise of bringing immersive experience to numerous applications. Soon it will target smartphones from the cloud and 360° video delivery will need unprecedented requirements for ultra-low latency and ultra-high throughput to mobile networks. Latest developments in NFV and Mobile Edge Computing reveal already the potential to enable VR streaming in cellular networks and to pave the way towards 5G and next stages in VR technology. In this paper we present a Field Of View (FOV) rendering solution at the edge of a mobile network, designed to optimize the bandwidth and latency required by VR 360° video streaming. Preliminary test results show the immediate benefits in bandwidth saving this approach can provide and generate new directions for VR/AR network research.

177 citations

Proceedings ArticleDOI
14 May 2016
TL;DR: In this article, a large corpus of bug fix commits (ca. 7,139) from 10 different Java projects, and focus on its language statistics, evaluating the naturalness of buggy code and the corresponding fixes.
Abstract: Real software, the kind working programmers produce by the kLOC to solve real-world problems, tends to be “natural”, like speech or natural language; it tends to be highly repetitive and predictable. Researchers have captured this naturalness of software through statistical models and used them to good effect in suggestion engines, porting tools, coding standards checkers, and idiom miners. This suggests that code that appears improbable, or surprising, to a good statistical language model is “unnatural” in some sense, and thus possibly suspicious. In this paper, we investigate this hypothesis. We consider a large corpus of bug fix commits (ca. 7,139), from 10 different Java projects, and focus on its language statistics, evaluating the naturalness of buggy code and the corresponding fixes. We find that code with bugs tends to be more entropic (i.e. unnatural), becoming less so as bugs are fixed. Ordering files for inspection by their average entropy yields cost-effectiveness scores comparable to popular defect prediction methods. At a finer granularity, focusing on highly entropic lines is similar in cost-effectiveness to some well-known static bug finders (PMD, FindBugs) and or- dering warnings from these bug finders using an entropy measure improves the cost-effectiveness of inspecting code implicated in warnings. This suggests that entropy may be a valid, simple way to complement the effectiveness of PMD or FindBugs, and that search-based bug-fixing methods may benefit from using entropy both for fault-localization and searching for fixes.

177 citations


Authors

Showing all 41483 results

NameH-indexPapersCitations
Yu Huang136149289209
Xiaoou Tang13255394555
Xiaogang Wang12845273740
Shaobin Wang12687252463
Qiang Yang112111771540
Wei Lu111197361911
Xuemin Shen106122144959
Li Chen105173255996
Lajos Hanzo101204054380
Luca Benini101145347862
Lei Liu98204151163
Tao Wang97272055280
Mohamed-Slim Alouini96178862290
Qi Tian96103041010
Merouane Debbah9665241140
Network Information
Related Institutions (5)
Alcatel-Lucent
53.3K papers, 1.4M citations

90% related

Bell Labs
59.8K papers, 3.1M citations

88% related

Hewlett-Packard
59.8K papers, 1.4M citations

87% related

Microsoft
86.9K papers, 4.1M citations

87% related

Intel
68.8K papers, 1.6M citations

87% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
202319
202266
20212,069
20203,277
20194,570
20184,476