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

arXiv 2023年

作者： Cheng, Hao Kong, Shufeng Deng, Yanchen Liu, Caihua Wu, Xiaohu An, Bo Wang, Chongjun State Key Laboratory for Novel Software Technology Nanjing University China School of Software Engineering Sun Yat-Sen University China School of Computer Science and Engineering Nanyang Technological University Singapore School of Artificial Intelligence Guilin University of Electronic Technology China National Engineering Research Center of Mobile Network Technologies Beijing University of Posts and Telecommunications China

Core-selecting combinatorial auctions (CAs) restrict the auction result in the core such that no coalitions could improve their utilities by engaging in collusion. The minimum-revenue-core (MRC) rule is a widely used core-selecting payment rule to maximize the total utilities of all bidders. However, the MRC rule can suffer from severe unfairness since it ignores individuals’ utilities. To address this limitation, we propose to explore the leximin principle to achieve fairness in core-selecting CAs since the leximin principle prefers to maximize the utility of the worst-off;the resulting bidder-leximin-optimal (BLO) payment rule is then theoretically analyzed and an effective algorithm is further provided to compute the BLO outcome. Moreover, we conduct extensive experiments to show that our algorithm returns fairer utility distributions and is faster than existing algorithms of core-selecting payment rules. Copyright © 2023, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Optimizing Link-Identified Forwarding Framework in LEO Satellite Networks

Optimizing Link-Identified Forwarding Framework in LEO Satel...

引用

International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)

作者： Hefan Zhang Zhiyuan Wang Shan Zhang Qingkai Meng Hongbin Luo School of Computer Science and Engineering Beihang University Beijing China Zhongguancun Laboratory Beijing China State Key Laboratory of Virtual Reality Technology and Systems State Key Laboratory of Software Development Environment Institute of Artificial Intelligence Beihang University Beijing China

Low earth orbit (LEO) satellite networks have the potential to provide low-latency communication with global coverage. To unleash this potential, it is crucial to achieve efficient data delivery. In this paper, we analyze the topology characteristics of LEO satellite networks, and propose a source-route-style forwarding framework. Specifically, we leverage the deterministic neighbor relationship and identify all the unidi-rectional inter-satellite links (ISLs). Moreover, our framework utilizes the in-packet bloom filter (BF) to store the source-route-style forwarding information. This way, the source satellite could encode multiple ISL identifiers into the BF, which actually specifies the forwarding path. The intermediate satellites only need to check whether the outgoing ISLs are encoded and forward packets accordingly. Due to false positives caused by BF, the more ISLs are encoded at a time, the more redundant forwardings emerge. To reduce forwarding overhead, we take into account segment encoding, allowing the source and intermediate satellites to encode part of ISLs towards the destination. Overall, segment encoding seeks the right balance between forwarding overhead and encoding delay. We characterize a wide range of segment encoding policy in a unified framework, and derive the expected forwarding overhead in a closed-form. The segment encoding design is formulated as a binary non-linear programming, which is NP-hard. To overcome the challenge, we leverage its decomposable structure, and propose an efficient algorithm to solve it optimally. Finally, we validate our analytical results via packet-level experiments. Results also show that our proposed segment encoding policy significantly reduces the queuing delay compared to source encoding.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Low Self-Noise Fiber Optic Gyroscope Based on Dual-polarization Configuration for Geophysical Rotation Sensing

A Low Self-Noise Fiber Optic Gyroscope Based on Dual-polariz...

引用

2021 Asia Communications and Photonics Conference, ACP 2021

作者： Chen, Yanjun Cao, Yuwen Wang, Wenbo He, Yan Zhou, Tong Li, Zhengbin State Key Laboratory of Advanced Optical Communication Systems and Networks School of Electronics Engineering and Computer Science Peking University Beijing100871 China School of Software and Microelectronics Peking University Beijing102600 China

A fiber optic gyroscope based on dual-polarization configuration_is designed and realized. The 24-hour stability test shows aself-noise level of 3 × 10−9 rad/s/√Hz within the frequency range of 0.001Hz to 1Hz. &... 详细信息

ISBN: (纸本)9781957171005

关键词： Gyroscopes

来源：评论

学校读者我要写书评

暂无评论

A simulated annealing method for minimum initial marking estimation in labeled Petri nets: Applications and comparative studies

引用

Proceedings of the Institution of Mechanical Engineers. Part I: Journal of Systems and Control engineering 2025年

作者： Yue, Hao Wang, Can Hu, Hesuan Chen, Junjie Wang, Min Pang, Shanchen College of Computer Science and Technology China University of Petroleum (East China) Qingdao China Shandong Key Laboratory of Intelligent Oil & Gas Industrial Software Qingdao China School of Electro-Mechanical Engineering Xidian University Xian China School of Computer Science and Engineering College of Engineering Nanyang Technological University Singapore Singapore School of Information Engineering Yangzhou University Jiangsu Yangzhou China State Key Laboratory of Chemical Safety Qingdao China

state estimation plays an important role in the field of system supervisory control. With the increase in the scale and complexity of practical systems, problems of state/event estimation for discrete event systems in Petri nets have attracted significant attention. One of the well-studied problems is how to estimate the minimum initial markings (MIMs) in a known labeled Petri net based on the observation of its event sequence. The existing approaches have disadvantages such as (1) much higher computational complexity in order to increase the MIM quantity;and (2) much fewer MIMs in order to decrease the computational complexity. In this paper, a variant of simulated annealing (SA) algorithm is developed to determine the set of MIMs. We take advantage of SA for global search in the problem’s search space to find initial markings that are minimal in their token counts, and then use the selection strategy of SA to determine MIMs from them. Finally, the effectiveness of the proposed method is illustrated through two simulation experiments of industrial applications. Comparisons with existing work are conducted to demonstrate the merits of our method. © IMechE 2025.

关键词： Discrete event systems initial marking estimation labeled Petri nets Petri nets simulated annealing supervisory control

来源：评论

学校读者我要写书评

暂无评论

Diving into Continual Ultra-fine-grained Visual Categorization

Diving into Continual Ultra-fine-grained Visual Categorizati...

引用

Proceedings of the Digital Image Computing: Technqiues and Applications (DICTA)

作者： Pengcheng Zhang Xiaohan Yu Xiao Bai Jin Zheng Xiaoyu Wu Yongsheng Gao School of Computer Science and Engineering State Key Laboratory of Software Development Environment Jiangxi Research Institute Beihang University Beijing China Institute for Integrated and Intelligent Systems Griffith University Nathan Australia

Recent advance in ultra-fine-grained visual categorization (ultra-FGVC) has significantly boosted the capability of deep neural networks for ultra-FGVC tasks. However, building models for continually learning to recognize increasing ultra-fine-grained categories is still under-explored. This limits the application of ultra-FGVC techniques in real-world production. To this, we take the first attempt for continual ultra-FGVC. By evaluating existing continual learning methods on the constructed continual ultra-FGVC benchmark, we observe that the main bottleneck lies in the limited model plasticity for incrementally adapting to new tasks. This can be caused by excessive anti-forgetting constraints as the difficult ultra-FGVC task requires substantial update of parameters, and over-fitting on early tasks given that the ultra-fine-grained categories are with very few training samples. To tackle these problems, we propose a joint self-supervised learning and prompting model. The prompt-based continual learning framework offers proper anti-forgetting operation by fixed pretrained vision transformer and adaptive prompt selection. By jointly optimizing the learnable prompts with an adversarial self-supervised loss, the over-fitting on each continual learning task is mitigated. Extensive experiments demonstrate that the proposed method outperforms existing continual learning methods on the challenging continual ultra-FGVC problem.

关键词：

来源：评论

学校读者我要写书评

暂无评论

UT-GAN: A Novel Unpaired Textual-Attention Generative Adversarial Network for Low-Light Text Image Enhancement

UT-GAN: A Novel Unpaired Textual-Attention Generative Advers...

引用

IEEE International Conference on Image Processing

作者： Minglong Xue Zhengyang He Yanyi He Peiqi Xie Xin Feng School of Computer Science and Engineering Chongqing University of Technology Chongqing P.R. China State Key Laboratory for Novel Software Technology Nanjing University Nanjing P.R. China

How to balance lighting and texture details to achieve the desired visual effect remains the bottleneck of existing low-light image enhancement methods. In this paper, we propose a novel Unpaired Textual-attention Generative Adversarial N network (UT-GAN) for low-light text image enhancement task. UT-GAN first uses the Zero-DCE net for initial illumination recovery and our TAM module is proposed to translate text information into a textual attention mechanism for the overall network, emphasizing attention to the details of text regions. Moreover, the method constructs an AGM-Net module to mitigate noise effects and fine-tune the illumination. Experiments show that UT-GAN outperforms existing methods in qualitative and quantitative evaluation on the widely used the low-light datasets LOL and SID.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Adaptive Sparse Convolutional Networks with Global Context Enhancement for Faster Object Detection on Drone Images

arXiv

引用

arXiv 2023年

作者： Du, Bowei Huang, Yecheng Chen, Jiaxin Huang, Di State Key Laboratory of Software Development Environment Beihang University Beijing China School of Computer Science and Engineering Beihang University Beijing China Hangzhou Innovation Institute Beihang University Hangzhou China

Object detection on drone images with low-latency is an important but challenging task on the resource-constrained unmanned aerial vehicle (UAV) platform. This paper investigates optimizing the detection head based on the sparse convolution, which proves effective in balancing the accuracy and efficiency. Nevertheless, it suffers from inadequate integration of contextual information of tiny objects as well as clumsy control of the mask ratio in the presence of foreground with varying scales. To address the issues above, we propose a novel global context-enhanced adaptive sparse convolutional network (CEASC). It first develops a context-enhanced group normalization (CE-GN) layer, by replacing the statistics based on sparsely sampled features with the global contextual ones, and then designs an adaptive multilayer masking strategy to generate optimal mask ratios at distinct scales for compact foreground coverage, promoting both the accuracy and efficiency. Extensive experimental results on two major benchmarks, i.e. VisDrone and UAVDT, demonstrate that CEASC remarkably reduces the GFLOPs and accelerates the inference procedure when plugging into the typical state-of-the-art detection frameworks (e.g. RetinaNet and GFL V1) with competitive performance. Code is available at https://***/Cuogeihong/CEASC. Copyright © 2023, The Authors. All rights reserved.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Adaptive Sparse Convolutional Networks with Global Context Enhancement for Faster Object Detection on Drone Images

Adaptive Sparse Convolutional Networks with Global Context E...

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Bowei Du Yecheng Huang Jiaxin Chen Di Huang State Key Laboratory of Software Development Environment Beihang University Beijing China School of Computer Science and Engineering Beihang University Beijing China Hangzhou Innovation Institute Beihang University Hangzhou China

Object detection on drone images with low-latency is an important but challenging task on the resource-constrained unmanned aerial vehicle (UAV) platform. This paper investigates optimizing the detection head based on the sparse convolution, which proves effective in balancing the accuracy and efficiency. Nevertheless, it suffers from inadequate integration of contextual information of tiny objects as well as clumsy control of the mask ratio in the presence of foreground with varying scales. To address the issues above, we propose a novel global context-enhanced adaptive sparse convolutional network (CEASC). It first develops a context-enhanced group normalization (CE-GN) layer, by replacing the statistics based on sparsely sampled features with the global contextual ones, and then designs an adaptive multi-layer masking strategy to generate optimal mask ratios at distinct scales for compact foreground coverage, promoting both the accuracy and efficiency. Extensive experimental results on two major benchmarks, i.e. VisDrone and UAVDT, demonstrate that CEASC remarkably reduces the GFLOPs and accelerates the inference procedure when plugging into the typical state-of-the-art detection frameworks (e.g. RetinaNet and GFL V1) with competitive performance. Code is available at https://***/Cuogeihong/CEASC.

关键词：

来源：评论

学校读者我要写书评

暂无评论

IWRN:A Robust Blind Watermarking Method for Artwork Image Copyright Protection Against Noise Attack 39

IWRN:A Robust Blind Watermarking Method for Artwork Image Co...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Kou, Feifei Yao, Yuhan Yao, Siyuan Wang, Jiahao Shi, Lei Li, Yawen Kang, Xuejing School of Computer Science National Pilot School of Software Engineering BUPT Beijing 100876 China Key Laboratory of Trustworthy Distributed Computing and Service BUPT Ministry of Education Beijing 100876 China School of Economics and Management BUPT Beijing 100876 China State Key Laboratory of Media Convergence and Communication CUC Beijing 100024 China State Key Laboratory of Intelligent Game Yangtze River Delta Research Institute of NPU Taicang 215400 China

ISBN: (纸本)157735897X

Adding imperceptible watermarks to artwork images, such as paintings and photographs, can effectively safeguard the copyright of these images without compromising their usability. However, existing blind watermarking techniques encounter two major challenges in addressing this task: imperceptibility and robustness, particularly when subjected to various noise attacks. In this paper, we propose a blind watermarking method for artwork image copyright protection, IWRN, which can ensure both the Imperceptibility of the Watermark and Robustness against Noise attacks. For imperceptibility, we design a Learnable Wavelet Network (LWN) to adaptively embed the watermark into the high-frequency region where the watermark has better invisibility. For robustness, we establish a Deform-Attention based Invertible Neural Network (DA-INN) with a decoding optimization, which offers the advantage of computational reversion, and combines the deform-attention mechanism and decoding optimization to enhance the model’s resistance against noises. Additionally, we design a Joint Contrast Learning (JCL) mechanism to improve imperceptibility and robustness simultaneously. Experiments show that our IWRN outperforms other state-of-the-art blind watermarking methods, achieves an average performance of 46.74 PSNR and 99.91% accuracy across three datasets when facing 12 kinds of noise attacks. © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

A Method of Multidimensional software Aging Prediction Based on Ensemble Learning: A Case of Android Os

SSRN

引用

SSRN 2023年

作者： Nie, Yuge Chen, Yulei Jiang, Yujia Wu, Huayao Yin, Beibei Cai, Kai-Yuan Beihang University School of Automation Science and Electrical Engineering Beijing100083 China Nanjing University State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing210023 China

Context: software aging refers to the phenomenon of performance degradation, increasing failure rate, or system crash due to resource consumption and error accumulation in software systems running for a long time. Precisely predicting software aging is crucial for enabling proactive measures before the situation substantially deteriorates. Previous machine learning (ML) methods for predicting aging predominantly rely on a single ML modeland a single labeling metric to attain their objectives. Furthermore, a common limitation shared by these methods is that training and prediction data stem from identical operational profiles. This could pose challenges for these models in delivering the desired performance when confronted with diverse user scenarios. Objective: In this paper, we aim to find a method that can both consistently and precisely predict aging trends across a wide range of application scenarios. Method: We propose a method of multidimensional software aging prediction based on ensemble learning called MSAP. Unlike the previous full-process single-threaded approaches, in the framework of MSAP, five dimensions including datasets, labeling metrics, labeling thresholds, algorithms, and model decisions are extracted and diversified to protest against diverse user scenarios and aging situations. Results: When subjected to identical workloads, MSAP demonstrates comparable performance to the majority of unidimensional models, albeit without significant prominence. Under different workloads, MSAP consistently outperforms unidimensional models whose performance drops dramatically in terms of precision, maintaining a notable lead while exhibiting minimal fluctuations. Conclusion: MSAP exhibits exceptional stability while concurrently upholding outstanding prediction precision across a spectrum of user scenarios. Therefore, it has better generalization characteristics and application prospects. © 2023, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：