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

Segment EDF: A Scheduling Policy With Tight Deterministic Latency Under Multi-Hop Networks

IEEE/ACM Transactions on Networking 2024年

作者： Xiao, Wenli Zhao, Shizhen Wang, Xinbing Zhou, Chenghu Shanghai Jiao Tong University John Hopcroft Center for Computer Science Shanghai200240 China Shanghai Jiao Tong University Department of Electronic Engineering Shanghai200240 China State Key Laboratory of Resources and Environmental Information System Beijing100101 China

We investigate tight end-to-end delay guarantees for real-time flows with stochastic arrivals in multi-hop networks. The existing multi-hop scheduling policy either only serves for real-time flows with deterministic arrivals or cannot offer a tight end-to-end delay guarantee for multi-hop flows. In this paper, we prove a closed-form formula, which offers a sufficient and necessary condition for the EDF (Earliest Deadline First) scheduling policy to meet all the end-to-end deadlines for flows with stochastic arrivals in converge-cast tree networks. To the best of our knowledge, this is the first formula that characterizes the exact schedulability region for EDF in multi-hop networks. Moving beyond converge-cast tree networks to general multi-hop networks, we introduce the Segment EDF approach. This method partitions a general network into multiple converge-cast networks using a novel concept called the critical links. By determining segment deadlines within the schedulability region of each converge-cast tree, Segment EDF offers a tight end-to-end delay guarantee for each flow. We present a theoretical analysis showcasing the superior performance of Segment EDF over the existing scheduling policy of hop-by-hop EDF. Furthermore, we evaluate the performance of Segment EDF based on two key metrics: guaranteed flow completion time and admission ratio, in both real-world and synthetic networks. Our simulation results show that Segment EDF can provide 61.31%-96.4% tighter end-to-end delay guarantee and increase admission ratio by about 3.52%-107.59% for sequential arrival flow set and 1.04%-95.50% for batch arrival flow set than hop-by-hop EDF. © 1993-2012 IEEE.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Granule Density-Based Outlier Detection with Multi-Scale Granular Balls

arXiv

引用

arXiv 2025年

作者： Gao, Can Tan, Xiaofeng Zhou, Jie Ding, Weiping Pedrycz, Witold The College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen518060 China The National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China The School of Artificial Intelligence and Computer Science Nantong University Nantong226019 China The Faculty of Data Science City University of Macau Macau999078 China The Department of Electrical and Computer Engineering University of Alberta Edmonton Canada Systems Research Institute Polish Academy of Sciences Warsaw Poland The Department of Electrical and Computer Engineering King Abdulaziz University Jeddah Saudi Arabia The Department of Computer Engineering Istinye University Istanbul Turkey

Outlier detection refers to the identification of anomalous samples that deviate significantly from the distribution of normal data and has been extensively studied and used in a variety of practical tasks. However, most unsupervised outlier detection methods are carefully designed to detect specified outliers, while real-world data may be entangled with different types of outliers. In this study, we propose a fuzzy rough sets-based multi-scale outlier detection method to identify various types of outliers. Specifically, a novel fuzzy rough sets-based method that integrates relative fuzzy granule density is first introduced to improve the capability of detecting local outliers. Then, a multi-scale view generation method based on granular-ball computing is proposed to collaboratively identify group outliers at different levels of granularity. Moreover, reliable outliers and inliers determined by the three-way decision are used to train a weighted support vector machine to further improve the performance of outlier detection. The proposed method innovatively transforms unsupervised outlier detection into a semi-supervised classification problem and for the first time explores the fuzzy rough sets-based outlier detection from the perspective of multi-scale granular balls, allowing for high adaptability to different types of outliers. Extensive experiments carried out on both artificial and UCI datasets demonstrate that the proposed outlier detection method significantly outperforms the state-of-the-art methods, improving the results by at least 8.48% in terms of the Area Under the ROC Curve (AUROC) index. The source codes are released at https://***/Xiaofeng-Tan/MGBOD. © 2025, CC BY.

关键词： Granulation

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Recording Architecture for Three-Dimensional Magnetic Recording

arXiv

引用

arXiv 2025年

作者： Jian, Yugen Luo, Ke Chen, Jincai Fong, Xuanyao Wuhan National Laboratory for Optoelectronics Huazhong University of Science and Technology Wuhan430074 China Department of Electrical and Computer Engineering National University of Singapore Singapore117583 Singapore School of Computer of Science and Technology Huazhong University of Science and Technology Wuhan430074 China Key Laboratory of Information Storage System Engineering Research Center of Data Storage Systems and Technology Ministry of Education of China Wuhan430074 China

Three-dimensional magnetic recording (3DMR) is a highly promising approach to achieving ultra-large data storage capacity in hard disk drives. One of the greatest challenges for 3DMR lies in performing sequential and correct writing of bits into the multi-layer recording medium. In this work, we have proposed a hierarchical recording architecture based on layered heat-assisted writing with a multi-head array. The feasibility of the architecture is validated in a dual-layer 3DMR system with FePt-based thin films via micromagnetic simulation. Our results reveal the magnetization reversal mechanism of the grains, ultimately attaining appreciable switching probability and medium signal-to-noise ratio (SNR) for each layer. In particular, an optimal head-to-head distance is identified as the one that maximizes the medium SNR. Optimizing the system’s noise resistance will improve the overall SNR and allow for a smaller optimal head-to-head distance, which can pave the way for scaling 3DMR to more recording layers. Copyright © 2025, The Authors. All rights reserved.

关键词： Hard disk storage

来源：评论

学校读者我要写书评

暂无评论

High Efficiency Wiener Filter-based Point Cloud Quality Enhancement for MPEG G-PCC

引用

IEEE Transactions on Circuits and systems for Video Technology 2025年

作者： Wei, Yuxuan Wang, Zehan Guo, Tian Liu, Hao Shen, Liquan Yuan, Hui Shandong University School of Control Science and Engineering Jinan250061 China Ministry of Education Key Laboratory of Machine Intelligence and System Control Jinan250061 China Yantai University School of Computer and Control Engineering Yantai264005 China Shanghai University Shanghai Institute for Advanced Communication and Data Science Shanghai200072 China

Point clouds, which directly record the geometry and attributes of scenes or objects by a large number of points, are widely used in various applications such as virtual reality and immersive communication. However, due to the huge data volume and unstructured geometry, efficient compression of point clouds is very crucial. The Moving Picture Expert Group is establishing a geometry-based point cloud compression (G-PCC) standard for both static and dynamic point clouds in recent years. Although lossy compression of G-PCC can achieve a very high compression ratio, the reconstruction quality is relatively low, especially at low bitrates. To mitigate this problem, we propose a high efficiency Wiener filter that can be integrated into the encoder and decoder pipeline of G-PCC to improve the reconstruction quality as well as the rate-distortion performance for dynamic point clouds. Specifically, we first propose a basic Wiener filter, and then improve it by introducing coefficients inheritance and variance-based point classification for the Luma component. Besides, to reduce the complexity of the nearest neighbor search during the application of the Wiener filter, we also propose a Morton code-based fast nearest neighbor search algorithm for efficient calculation of filter coefficients. Experimental results demonstrate that the proposed method can achieve average Bjøntegaard delta rates of -6.1%, -7.3%, and -8.0% for Luma, Chroma Cb, and Chroma Cr components, respectively, under the condition of lossless-geometry-lossy-attributes configuration compared to the latest G-PCC encoding platform (i.e., geometry-based solid content test model version 7.0 release candidate 2) by consuming affordable computational complexity. © 2025 IEEE. All rights reserved.

关键词： Wiener filtering

来源：评论

学校读者我要写书评

暂无评论

PIR: Remote Sensing Image-Text Retrieval with Prior Instruction Representation Learning

arXiv

引用

arXiv 2024年

作者： Pan, Jiancheng Ma, Muyuan Ma, Qing Bai, Cong Chen, Shengyong The Ministry of Education Key Laboratory for Earth System Modeling Department of Earth System Science Tsinghua University Beijing10084 China The College of Computer Science and Technology Zhejiang University of Technology Hangzhou310023 China The College of Science Zhejiang University of Technology Hangzhou310023 China The School of Computer Science and Engineering Tianjin University of Technology Tianjin300384 China

Remote sensing image-text retrieval constitutes a foundational aspect of remote sensing interpretation tasks, facilitating the alignment of vision and language representations. This paper introduces a prior instruction representation (PIR) learning paradigm that draws on prior knowledge to instruct adaptive learning of vision and text representations. Based on PIR, a domain-adapted remote sensing image-text retrieval framework PIR-ITR is designed to address semantic noise issues in vision-language understanding tasks. However, with massive additional data for pre-training the vision-language foundation model, remote sensing image-text retrieval is further developed into an open-domain retrieval task. Continuing with the above, we propose PIR-CLIP, a domain-specific CLIP-based framework for remote sensing image-text retrieval, to address semantic noise in remote sensing vision-language representations and further improve open-domain retrieval performance. In vision representation, we utilize the prior-guided knowledge of the remote sensing scene recognition by building a belief matrix to select key features for reducing the impact of semantic noise. In text representation, we use the previous time step to cyclically activate the current time step to enhance text representation capability. A cluster-wise Affiliation Loss (AL) is proposed to constrain the inter-classes and to reduce the semantic confusion zones in the common subspace. Comprehensive experiments demonstrate that PIR could enhance vision and text representations and outperform the state-of-the-art methods of closed-domain and open-domain retrieval on two benchmark datasets, RSICD and RSITMD. Copyright © 2024, The Authors. All rights reserved.

关键词： Visual languages

来源：评论

学校读者我要写书评

暂无评论

Intelligent Intra- and Inter-Channel Nonlinearity Compensation for Terabit-Per-Lambda 16QAM Long-Haul Transmission

Intelligent Intra- and Inter-Channel Nonlinearity Compensati...

引用

Asia Communications and Photonics Conference and Exhibition (ACP)

作者： Xiansong Fang Lingjun Zhou Yixiao Zhu Jiayu Zheng Xiang Cai Fan Zhang State Key Laboratory of Advanced Optical Communication System and Networks School of Electronics Peking University Beijing China School of Electronic and Computer Engineering Peking University Shenzhen China State Key Laboratory of Advanced Optical Communication System and Networks Shanghai Jiao Tong University Shanghai China Pengcheng Laboratory Shenzhen China

We experimentally demonstrate the combination of learned modified DBP and adaptive equalizer to compensate for intra- and inter-channel nonlinearity, in an $8\times 125\text{Gbaud}$ 16QAM system over 1600km SSMF, sh...

关键词：

来源：评论

学校读者我要写书评

暂无评论

Joint DNN Partition and Thread Allocation Optimization for Energy-Harvesting MEC systems

Joint DNN Partition and Thread Allocation Optimization for E...

引用

Design, Automation and Test in Europe Conference and Exhibition

作者： Yizhou Shi Liying Li Yue Zeng Peijin Cong Junlong Zhou School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing China National Key Laboratory for Novel Software Technology Nanjing University Nanjing China National Mobile Communications Research Laboratory Southeast University Nanjing China Key Laboratory of Embedded System and Service Computing (Tongji University) Ministry of Education Shanghai China

ISBN: (数字)9783982674100

ISBN: (纸本)9798331534646

Deep neural networks (DNNs) have demonstrated exceptional performance, leading to diverse applications across various mobile devices (MDs). Considering factors like portability and environmental sustainability, an increasing number of MDs are adopting energy harvesting (EH) techniques for power supply. However, the computational intensity of DNNs presents significant challenges for their deployment on these resource-constrained devices. Existing approaches often employ DNN partition or offloading to mitigate the time and energy consumption associated with running DNNs on MDs. Nonetheless, existing methods frequently fall short in accurately modeling the execution time of DNNs, and do not consider to use thread allocation for further latency and energy consumption optimization. To solve these problems, we propose a dynamic DNN partition and thread allocation method to optimize the latency and energy consumption of running DNNs on EH-enabled MDs. Specifically, we first investigate the relationship between DNN inference latency and allocated threads and establish an accurate DNN latency prediction model. Based on the prediction model, a DRL-based DNN partition (DDP) algorithm is designed to find the optimal partitions for DNNs. A thread allocation (TA) algorithm is proposed to reduce the inference latency. Experimental results from our test-bed platform demonstrate that compared to four benchmarking methods, our scheme can reduce DNN inference latency and energy consumption by up to 37.3% and 38.5%.

关键词： Energy consumption Instruction sets Heuristic algorithms Artificial neural networks Predictive models Prediction algorithms Inference algorithms Partitioning algorithms Resource management Optimization

来源：评论

学校读者我要写书评

暂无评论

DDPS: Dynamic Differential Pricing-based Edge Offloading system with Energy Harvesting Devices

arXiv

引用

arXiv 2024年

作者： Xue, Hai Xia, Yun Xiong, Neal N. Zhang, Di Pei, Songwen School of Optical- Electrical and Computer Engineering University of Shanghai for Science and Technology Shanghai200093 China Department of Computer Science and Mathematics Sul Ross State University AlpineTX79830 United States School of Electrical and Information Engineering Zhengzhou University the Henan International Joint Laboratory of Intelligent Health Information System the National Telemedicine Center National Engineering Laboratory for Internet Medical Systems and Applications Zhengzhou450001 China

Mobile edge computing (MEC) paves the way to alleviate the burden of energy and computation of mobile users (MUs) by offloading tasks to the network edge. To enhance the MEC server utilization by optimizing its resource allocation, a well-designed pricing strategy is indispensable. In this paper, we consider the edge offloading scenario with energy harvesting devices, and propose a dynamic differential pricing system (DDPS), which determines the price per unit time according to the usage of computing resources to improve the edge server utilization. Firstly, we propose an offloading decision algorithm to decide whether to conduct the offloading operation and how much data to be offloaded if conducted, the algorithm determines offloading operation by balancing the energy harvested with the energy consumed. Secondly, for the offloading case, we formulate the game between the MUs and the server as a Stackelberg game, and propose a differential pricing algorithm to determine the optimal computing resources required by MUs. Furthermore, the proposed algorithm also reallocates computing resources for delay-sensitive devices while server resources are surplus after the initial allocation, aiming to make full use of the server computing resources. Extensive simulations are conducted to demonstrate the effectiveness of the proposed DDPS scheme. Copyright © 2024, The Authors. All rights reserved.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Attention-based efficient robot grasp detection network

引用

Frontiers of Information Technology & Electronic engineering 2023年第10期24卷 1430-1444页

作者： Xiaofei QIN Wenkai HU Chen XIAO Changxiang HE Songwen PEI Xuedian ZHANG School of Optical-Electrical and Computer Engineering University of Shanghai for Science and TechnologyShanghai 200093China College of Science University of Shanghai for Science and TechnologyShanghai 200093China Shanghai Key Laboratory of Modern Optical System Shanghai 200093China Key Laboratory of Biomedical Optical Technology and Devices of Ministry of Education Shanghai 200093China Shanghai Institute of Intelligent Science and Technology Tongji UniversityShanghai 201210China

To balance the inference speed and detection accuracy of a grasp detection algorithm,which are both important for robot grasping tasks,we propose an encoder–decoder structured pixel-level grasp detection neural network named the attention-based efficient robot grasp detection network(AE-GDN).Three spatial attention modules are introduced in the encoder stages to enhance the detailed information,and three channel attention modules are introduced in the decoder stages to extract more semantic *** lightweight and efficient DenseBlocks are used to connect the encoder and decoder paths to improve the feature modeling capability of AE-GDN.A high intersection over union(IoU)value between the predicted grasp rectangle and the ground truth does not necessarily mean a high-quality grasp configuration,but might cause a *** is because traditional IoU loss calculation methods treat the center part of the predicted rectangle as having the same importance as the area around the *** design a new IoU loss calculation method based on an hourglass box matching mechanism,which will create good correspondence between high IoUs and high-quality grasp *** achieves the accuracy of 98.9%and 96.6%on the Cornell and Jacquard datasets,*** inference speed reaches 43.5 frames per second with only about 1.2×10^(6)*** proposed AE-GDN has also been deployed on a practical robotic arm grasping system and performs grasping *** are available at https://***/robvincen/robot_gradet.

关键词： Robot grasp detection Attention mechanism Encoder-decoder Neural network

来源：评论

学校读者我要写书评

暂无评论

Camouflaged Object Tracking: A Benchmark

arXiv

引用

arXiv 2024年

作者： Guo, Xiaoyu Zhong, Pengzhi Zhang, Hao Huang, Defeng Shao, Huikai Zhao, Qijun Li, Shuiwang The College of Computer Science and Engineering Guilin University of Technology 541006 China Guangxi Key Laboratory of Embedded Technology and Intelligent System Guilin University of Technology 541004 China The School of Automation Science and Engineering Xi’an Jiaotong University Shaanxi Xi’an710049 China The College of Computer Science Sichuan University Sichuan610065 China

Visual tracking has seen remarkable advancements, largely driven by the availability of large-scale training datasets that have enabled the development of highly accurate and robust algorithms. While significant progress has been made in tracking general objects, research on more challenging scenarios, such as tracking camouflaged objects, remains limited. Camouflaged objects, which blend seamlessly with their surroundings or other objects, present unique challenges for detection and tracking in complex environments. This challenge is particularly critical in applications such as military, security, agriculture, and marine monitoring, where precise tracking of camouflaged objects is essential. To address this gap, we introduce the Camouflaged Object Tracking Dataset (COTD), a specialized benchmark designed specifically for evaluating camouflaged object tracking methods. The COTD dataset comprises 200 sequences and approximately 80,000 frames, each annotated with detailed bounding boxes. Our evaluation of 20 existing tracking algorithms reveals significant deficiencies in their performance with camouflaged objects. To address these issues, we propose a novel tracking framework, HiPTrack-MLS, which demonstrates promising results in improving tracking performance for camouflaged objects. COTD and code are avialable at https://***/openat25/ HIPTrack-MLS. © 2024, CC BY-NC-ND.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：