检索结果-内蒙古大学图书馆

Automatic Repeat Request Design in AoI-Aware Broadcast With Heterogeneous Direct and Relay-Assisted Users

IEEE Internet of Things Journal 2025年

作者： Wang, Xueer Pan, Haoyuan Chan, Tse-Tin Li, Jianqiang Shenzhen University College of Computer Science and Software Engineering Shenzhen China The Education University of Hong Kong Department of Mathematics and Information Technology Hong Kong Shenzhen University National Engineering Laboratory for Big Data System Computing Technology The College of Computer Science and Software Engineering Shenzhen China

This paper investigates the design of automatic repeat request (ARQ) protocols in age of information (AoI)-aware broadcast systems with heterogeneous users, including both direct and relay-assisted users. In this setup, a direct user receives status updates directly via a single-hop link, while a relay-assisted user can receive status updates through either a direct single-hop link or a two-hop relay-assisted link. While ARQ is commonly used to ensure reliable transmission in error-prone wireless networks, previous studies suggest that ARQ does not improve the average AoI in single-hop networks. However, its impact on AoI in systems with relays, particularly those involving heterogeneous users, remains unclear. We address this gap by analyzing the average AoI under different ARQ strategies, introducing a transmission limit k ≥ 0 at the relay. Here, k = 0, k = 1, and k > 1 correspond to non-relay, non-ARQ-at-relay, and truncated-ARQ-at-relay strategies, respectively. Utilizing a unified Markov chain framework that models the transmission processes for each user type, we derive the theoretical average AoI. Our results show that the direct user benefits most from non-relay and non-ARQ strategies, similar to single-hop systems. In contrast, the relay-assisted user achieves optimal performance with truncated-ARQ-at-relay, leveraging both direct and relay-assisted links. For the overall system, applying a non-ARQ-at-relay approach strikes a balance in AoI between the direct and relay-assisted users, leading to a more stable and lower system-wide average AoI. © 2014 IEEE.

关键词： Mobile telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

Collaborative wi-fi fingerprinting indoor positioning using near relation 24

Collaborative wi-fi fingerprinting indoor positioning using ...

引用

2020 24th ISPRS Congress - Technical Commission IV on Spatial Information Science

作者： Wang, Y. Wang, W. Li, X. Zhang, W. Guo, R. National Engineering Laboratory for Big Data System Computing Technology Guangdong Key Laboratory of Urban Informatics Shenzhen Key Laboratory of Spatial Smart Sensing and Services Research Institute for Smart Cities School of Architecture and Urban Planning Shenzhen University Shenzhen China

Indoor positioning is of great importance to the era of mobile computing. Currently, much attention has been paid to RSS-based location for that it can provide position information without additional equipment. However, this method suffers from many challenges: (1) fingerprint ambiguity;(2) labor-intensive of fingerprint collection;(3) low efficiency of fingerprint matching. To get over these drawbacks, we provide a collaborative WiFi fingerprinting indoor positioning method using near relation. The base idea of this method is that interpolation method is used to enrich sparse Wi-Fi fingerprint. Near relation boundary is provided and Wi-Fi fingerprints is constrained to this region to reduce fingerprint ambiguity, which also can improve the efficiency of fingerprint matching. Extensive experiments show that a positioning accuracy of 3.8m can be achieved with the near relation under 1m interpolation density. © 2020 Authors.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

µVulDeePecker: A deep learning-based system for multiclass vulnerability detection

arXiv

引用

arXiv 2020年

作者： Zou, Deqing Wang, Sujuan Xu, Shouhuai Li, Zhen Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Big Data Security Engineering Research Center School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China Shenzhen Huazhong University of Science and Technology Research Institute Shenzhen518057 China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Big Data Security Engineering Research Center School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Department of Computer Science University of Texas at San Antonio San AntonioTX78249 United States

Fine-grained software vulnerability detection is an important and challenging problem. Ideally, a detection system (or detector) not only should be able to detect whether or not a program contains vulnerabilities, but also should be able to pinpoint the type of a vulnerability in question. Existing vulnerability detection methods based on deep learning can detect the presence of vulnerabilities (i.e., addressing the binary classification or detection problem), but cannot pinpoint types of vulnerabilities (i.e., incapable of addressing multiclass classification). In this paper, we propose the first deep learning-based system for multiclass vulnerability detection, dubbed µVulDeePecker. The key insight underlying µVulDeePecker is the concept of code attention, which can capture information that can help pinpoint types of vulnerabilities, even when the samples are small. For this purpose, we create a dataset from scratch and use it to evaluate the effectiveness of µVulDeePecker. Experimental results show that µVulDeePecker is effective for multiclass vulnerability detection and that accommodating control-dependence (other than data-dependence) can lead to higher detection capabilities. Copyright © 2020, The Authors. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Towards Lightweight Serverless computing via Unikernel as a Function

Towards Lightweight Serverless Computing via Unikernel as a ...

引用

International Workshop on Quality of Service

作者： Bo Tan Haikun Liu Jia Rao Xiaofei Liao Hai Jin Yu Zhang National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China The University of Texas at Arlington

ISBN: (数字)9781728168876

ISBN: (纸本)9781728168883

Serverless computing, also known as “Function as a Service (FaaS)”, is emerging as an event-driven paradigm of cloud computing. In the FaaS model, applications are programmed in the form of functions that are executed and managed separately. Functions are triggered by cloud users and are provisioned dynamically through containers or virtual machines (VMs). The startup delays of containers or VMs usually lead to rather high latency of response to cloud users. Moreover, the communication between different functions generally relies on virtual net devices or shared memory, and may cause extremely high performance overhead. In this paper, we propose Unikernel-as-a-Function (UaaF), a much more lightweight approach to serverless computing. Applications are abstracted as a combination of different functions, and each function are built as an unikernel in which the function is linked with a specified minimum-sized library operating system (LibOS). UaaF offers extremely low startup latency to execute functions, and an efficient communication model to speed up inter-functions interactions. We exploit an new hardware technique (namely VMFUNC) to invoke functions in other unikernels seamlessly (mostly like inter-process communications), without suffering performance penalty of VM Exits. We implement our proof-of-concept prototype based on KVM and deploy UaaF in three unikernels (MirageOS, IncludeOS, and Solo5). Experimental results show that U aaF can significantly reduce the startup latency and memory usage of serverless cloud applications. Moreover, the VMFUNC-based communication model can also significantly improve the performance of function invocations between different unikernels.

关键词： Cloud computing FAA Libraries Containers Task analysis Computer architecture Virtual machine monitors

来源：评论

学校读者我要写书评

暂无评论

Locate who you are: Matching geo-location to text for user identity linkage

arXiv

引用

arXiv 2021年

作者： Shao, Jiangli Wang, Yongqing Gao, Hao Shen, Huawei Li, Yangyang Cheng, Xueqi Data Intelligence System Research Center Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences National Engineering Lab for Risk Perception and Prevention China Academic Electronic and Information Technology

Nowadays, users are encouraged to activate across multiple online social networks simultaneously. User identity linkage, which aims to reveal the correspondence among different accounts across networks, has been regarded as a fundamental problem for user profiling, marketing, cybersecurity, and recommendation. Existing methods mainly address the prediction problem by utilizing profile, content, or structural features of users in symmetric ways. However, encouraged by online services, information from different social platforms may also be asymmetric, such as geo-locations and texts. It leads to an emerged challenge in aligning users with asymmetric information across networks. Instead of similarity evaluation applied in previous works, we formalize correlation between geo-locations and texts and propose a novel user identity linkage framework for matching users across networks. Moreover, our model can alleviate the label scarcity problem by introducing external text-location pairs. Experimental results on real-world datasets show that our approach outperforms existing methods and achieves state-of-the-art results. © 2021, CC BY-NC-ND.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

Partitioning large-scale property graph for efficient distributed query processing 21

Partitioning large-scale property graph for efficient distri...

引用

21st IEEE International Conference on High Performance computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on data Science and systems, HPCC/SmartCity/DSS 2019

作者： Pang, Haohan Gan, Peng Yuan, Pingpeng Jin, Hai Hua, Qiangsheng National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab. Clusters and Grid Computing Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9781728120584

Recently, many communities have published their domain knowledge in the form of graphs. A significant trend is that the relations between pairs of nodes in the graph have become so complex that these data can be treated as property graphs. Complex properties imply semantic constraints which can distinguish elements of property graph into different semantic-related aspects. If the property graph can be partitioned according to these aspects, cross-partition communication would be reduced when evaluating SPARQL queries, for the reason that a query can often be evaluated in a single aspect. Conventional graph partition methods, however, pay little attention to semantic constraints in property graphs. To solve this problem, we propose a new property graph partition method for query optimization. First, we propose the property semantic reachable path as basic partition element, with which to capture the semantic-related aspects in a property graph. Second, to combine paths into partitions, we develop a space-efficient algorithm which merges vertices rather than entire paths. Extensive experiments over representative property graph data confirm the effectiveness of our semantic awareness approach. The performance of our approach is comparable with leading competitors, in terms of load balance, data redundancy, and network overhead. © 2019 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Meta-Chain: User-Aware Cross-Layer Space Allocation Strategy for Blockchain Storage systems: Work-in-Progress

Meta-Chain: User-Aware Cross-Layer Space Allocation Strategy...

引用

International Conference on Hardware/Software Codesign and system Synthesis (CODES)

作者： Jing Liao Zhengda Li Yi Wang College of Computer Science and Software Engineering The National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China

ISBN: (数字)9781728191980

ISBN: (纸本)9781728191997

Current LSM-Tree-based blockchain storage system will assign the data from multiple system users to the same disk drive. This will lead to the inefficient usage of physical spaces in disk and cause extra compaction operations for LSM - Tree. This paper presents Meta-Chain , a user-aware cross-layer space allocation strategy for blockchain storage systems. As a cross-layer design, Meta-Chain redesigns the organization of LSM - Tree and utilizes the rich functionalities provided by open-channel SSD. Experimental results show that Meta-Chain can effectively reduce write amplification and extend the lifetime of SSD in comparison with representative schemes.

关键词： Disk drives Blockchain Organizations Compaction Resource management

来源：评论

学校读者我要写书评

暂无评论

Image super-resolution via dynamic network

arXiv

引用

arXiv 2023年

作者： Tian, Chunwei Zhang, Xuanyu Zhang, Qi Yang, Mingming Ju, Zhaojie School of Software Northwestern Polytechnical University Xi’an710129 China National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology Xi’an710129 China Research & Development Institute Northwestern Polytechnical University Shenzhen China School of Economics and Management Harbin Institute of Technology at Weihai Weihai264209 China Tencent AI lab Shenzhen China School of Computing University of Portsmouth PortsmouthPO1 3HE United Kingdom

Convolutional neural networks depend on deep network architectures to extract accurate information for image super-resolution. However, obtained information of these convolutional neural networks cannot completely express predicted high-quality images for complex scenes. In this paper, we present a dynamic network for image super-resolution (DSRNet), which contains a residual enhancement block, wide enhancement block, feature refinement block and construction block. The residual enhancement block is composed of a residual enhanced architecture to facilitate hierarchical features for image super-resolution. To enhance robustness of obtained super-resolution model for complex scenes, a wide enhancement block achieves a dynamic architecture to learn more robust information to enhance applicability of an obtained super-resolution model for varying scenes. To prevent interference of components in a wide enhancement block, a refinement block utilizes a stacked architecture to accurately learn obtained features. Also, a residual learning operation is embedded in the refinement block to prevent long-term dependency problem. Finally, a construction block is responsible for reconstructing high-quality images. Designed heterogeneous architecture can not only facilitate richer structural information, but also be lightweight, which is suitable for mobile digital devices. Experimental results show that our method is more competitive in terms of performance, recovering time of image super-resolution and complexity. The code of DSRNet can be obtained at https://***/hellloxiaotian/DSRNet. Copyright © 2023, The Authors. All rights reserved.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

Sample hardness based gradient loss for long-tailed cervical cell detection

arXiv

引用

arXiv 2022年

作者： Liu, Minmin Li, Xuechen Gao, Xiangbo Chen, Junliang Shen, Linlin Wu, Huisi Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University China Shenzhen Institute of Artificial Intelligence of Robotics of Society Shenzhen China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen518060 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China University of California Irvine United States

Due to the difficulty of cancer samples collection and annotation, cervical cancer datasets usually exhibit a long-tailed data distribution. When training a detector to detect the cancer cells in a WSI (Whole Slice Image) image captured from the TCT (Thinprep Cytology Test) specimen, head categories (e.g. normal cells and inflammatory cells) typically have a much larger number of samples than tail categories (e.g. cancer cells). Most existing state-of-the-art long-tailed learning methods in object detection focus on category distribution statistics to solve the problem in the long-tailed scenario, without considering the "hardness" of each sample. To address this problem, in this work we propose a Grad-Libra Loss that leverages the gradients to dynamically calibrate the degree of hardness of each sample for different categories, and re-balance the gradients of positive and negative samples. Our loss can thus help the detector to put more emphasis on those hard samples in both head and tail categories. Extensive experiments on a long-tailed TCT WSI image dataset show that the mainstream detectors, e.g. RepPoints, FCOS, ATSS, YOLOF, etc. trained using our proposed Gradient-Libra Loss, achieved much higher (7.8%) mAP than that trained using cross-entropy classification loss. Copyright © 2022, The Authors. All rights reserved.

关键词： Cytology

来源：评论

学校读者我要写书评

暂无评论

Modeling heterogeneous edges to represent networks with graph auto-encoder

arXiv

引用

arXiv 2021年

作者： Wang, Lu Song, Yu Huang, Hong Ye, Fanghua Shi, Xuanhua Jin, Hai National Engineering Research Center for Big Data Technology and System Wuhan China Service Computing Technology and Systems Laboratory Wuhan China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Computer Science University College London London United Kingdom

In the real world, networks often contain multiple relationships among nodes, manifested as the heterogeneity of the edges in the networks. We convert the heterogeneous networks into multiple views by using each view to describe a specific type of relationship between nodes, so that we can leverage the collaboration of multiple views to learn the representation of networks with heterogeneous edges. Given this, we propose a regularized graph auto-encoders (RGAE) model, committed to utilizing abundant information in multiple views to learn robust network representations. More specifically, RGAE designs shared and private graph auto-encoders as main components to capture high-order nonlinear structure information of the networks. Besides, two loss functions serve as regularization to extract consistent and unique information, respectively. Concrete experimental results on realistic datasets indicate that our model outperforms state-of-the-art baselines in practical applications. © 2021, CC BY.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：