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

arXiv 2022年

作者： Li, Chengqing Lu, Xiaoxiong Tan, Kai Chen, Guanrong The School of Computer Science Xiangtan University Hunan Xiangtan411105 China The School of Mathematics and Computational Science Xiangtan University Xiangtan411105 China The Key Laboratory of Intelligent Computing & Information Processing Ministry of Education Xiangtan University Hunan Xiangtan411105 China The Department of Electrical Engineering City University of Hong Kong Hong Kong

Understanding the underlying graph structure of a nonlinear map over a particular domain is essential in evaluating its potential for real applications. In this paper, we investigate the structure of the associated functional graph of Chebyshev permutation polynomials over a ring pk, with p being a prime number greater than three, where every number in the ring is considered as a vertex and the existing mapping relation between two vertices is regarded as a directed edge. Based on some new properties of Chebyshev polynomials and their derivatives, we disclose how the basic structure of the functional graph evolves with respect to parameter k. First, we present a complete and explicit form of the length of a path starting from any given vertex. Then, we show that the strong patterns of the functional graph that the number of cycles of any given length always remains constant as k increases. Moreover, we rigorously prove the rules on the elegant structure of the functional graph and verify them experimentally. Our results could be useful for studying the emergence of the complexity of a nonlinear map in digital computers and security analysis of its cryptographic *** Codes 94A55 Copyright © 2022, The Authors. All rights reserved.

关键词： Chebyshev polynomials

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Comprehensive Survey of Few-shot Learning: Evolution, Applications, Challenges, and Opportunities

arXiv

引用

arXiv 2022年

作者： Song, Yisheng Wang, Ting Mondal, Subrota K. Sahoo, Jyoti Prakash The Engineering Research Center of Software/Hardware Co-design Technology and Application Ministry of Education The Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai200062 China The Faculty of Information Technology Macau University of Science and Technology Macao China The Department of Computer Science & Information Technology Institute of Technical Education and Research Siksha 'o' Anusandhan University India

Few-shot learning (FSL) has emerged as an effective learning method and shows great potential. Despite the recent creative works in tackling FSL tasks, learning valid information rapidly from just a few or even zero samples still remains a serious challenge. In this context, we extensively investigated 200+ latest papers on FSL published in the past three years, aiming to present a timely and comprehensive overview of the most recent advances in FSL along with impartial comparisons of strengths and weaknesses of the existing works. For the sake of avoiding conceptual confusion, we first elaborate and compare a set of similar concepts including few-shot learning, transfer learning, and meta-learning. Furthermore, we propose a novel taxonomy to classify the existing work according to the level of abstraction of knowledge in accordance with the challenges of FSL. To enrich this survey, in each subsection we provide in-depth analysis and insightful discussion about recent advances on these topics. Moreover, taking computer vision as an example, we highlight the important application of FSL, covering various research hotspots. Finally, we conclude the survey with unique insights into the technology evolution trends together with potential future research opportunities in the hope of providing guidance to follow-up research. © 2022, CC BY.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

Robust Self-Expression Learning with Adaptive Noise Perception

SSRN

引用

SSRN 2023年

作者： Wang, Yangbo Zhou, Jie Lu, Jianglin Wan, Jun Gao, Can Lin, Qingshui College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China SZU Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen518060 China SMILE Lab Department of ECE College of Engineering Northeastern University Boston02115 United States School of Information and Safety Engineering Zhongnan University of Economics and Law Wuhan430073 China Basic Teaching Department Liaoning Technical University Huludao125105 China

Self-expression learning methods often obtain a coefficient matrix to measure the similarity between pairs of samples. However, directly using the raw data to represent each sample under the self-expression framework may not be ideal, as noise points are inevitably involved in the process of representing clean samples. To address this issue, this work proposes a novel self-expression model called robust Self-Expression learning with adaptive Noise Perception (SENP). SENP decomposes each sample into a clean part and a noisy part, and samples with large self-expression losses can be recognized as the noise points. A reliable coefficient matrix can then be learned by using only the clean points to reconstruct the clean part of each sample. By simultaneously detecting the noisy part of each sample and noise points, and adaptively mitigating their negative impacts, the representative ability of the generated coefficient matrix is improved. Moreover, inspired by the solution of non-negative matrix factorization (NMF), an effective algorithm is formed to optimize SENP. Extensive experiments on well-known benchmark datasets demonstrate the superiority of SENP compared to several state-of-the-art methods. © 2023, The Authors. All rights reserved.

关键词： Non-negative matrix factorization

来源：评论

学校读者我要写书评

暂无评论

A Text Multi-label Classification Scheme Based on Resampling and Ensemble Learning 8th

A Text Multi-label Classification Scheme Based on Resampling...

引用

8th International Conference on Artificial Intelligence and Security , ICAIS 2022

作者： Wang, Tianhao Weng, Tianrang Ji, Jiacheng Zhong, Mingjun Zhang, Baili School of Computer Science and Engineering Southeast University Nanjing211189 China Key Laboratory of Computer Network and Information Integration in Southeast University Ministry of Education Nanjing211189 China Research Center for Judicial Big Data Supreme Count of China Nanjing211189 China Department of Computing Science University of Aberdeen AberdeenAB24 3UE United Kingdom

ISBN: (纸本)9783031067600

The medical dispute cases are professional and closely related to medicine. Therefore, the mediation of cases in practice depends heavily on similar historical cases. Multi-label classification of legal documents can efficiently filter irrelevant historical cases, which helps to recommend the similar historical cases faster and better. However, the imbalance and label symbiosis of the data set directly affect multi-label classification of legal documents. Therefore, a multi-label classification scheme based on resampling and ensemble learning is presented in this paper The scheme includes two parts: in the first part, in order to reduce the impact of label symbiosis on resampling, a resampling algorithm based on the average sparsity of the label set is proposed improve the imbalance of the data set;in the second one, a multi-label classification algorithm based on ensemble learning is proposed to train multiple base classifiers and combine each base classifier with a voting strategy of one vote. It can effectively improve the effect of multi-label classification. The experimental results show that the scheme proposed in this paper can improve the effect of multi-label classification and is not only suitable for legal documents but also applicable for other text data sets with imbalanced classes and label symbiosis problems. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Data-Driven Structural Design Optimization for Petal-Shaped Auxetics Using Isogeometric Analysis

引用

computer Modeling in engineering & sciences 2020年第2期122卷 433-458页

作者： Yingjun Wang Zhongyuan Liao Shengyu Shi Zhenpei Wang Leong Hien Poh National Engineering Research Center of Novel Equipment for Polymer Processing the Key Laboratory of Polymer Processing Engineering of the Ministry of Education(South China University of Technology)Guangdong Provincial Key Laboratory of Technique and Equipment for Macromolecular Advanced ManufacturingSouth China University of TechnologyGuangzhou510641China. Institute of High Performance Computing(IHPC) Agency for ScienceTechnology and Research(A*STAR)1 Fusionopolis Way138632Singapore. Department of Civil and Environmental Engineering National University of Singapore 1 Engineering Drive 2E1A 07-03117576Singapore

Focusing on the structural optimization of auxetic materials using data-driven methods,a back-propagation neural network(BPNN)based design framework is developed for petal-shaped auxetics using isogeometric *** a NURBSbased parametric modelling scheme with a small number of design variables,the highly nonlinear relation between the input geometry variables and the effective material properties is obtained using BPNN-based fitting method,and demonstrated in this work to give high accuracy and *** BPNN-based fitting functions also enable an easy analytical sensitivity analysis,in contrast to the generally complex procedures of typical shape and size sensitivity approaches.

关键词： Data-driven BP neural network petal-shaped auxetics negative Poisson’s ratio structural design isogeometric analysis.

来源：评论

学校读者我要写书评

暂无评论

Robust Fault Diagnosis of Drilling Machinery Under Complex Working Conditions Based on Carbon Intelligent Industrial Internet of Things

引用

IEEE Internet of Things Journal 2025年

作者： Fang, Kai Tong, Lianghuai Xu, Xiaojie Cai, Jijing Peng, Xueyuan Omar, Marwan Bashir, Ali Kashif Wang, Wei Xi'an Jiaotong University College of Energy and Power Engineering Xi'an710049 China Quzhou Academy of Metrology and Quality Inspection Quzhou324000 China Zhejiang A and F University College of Mathematics and Computer Science Hangzhou311300 China Illinois Institute of Technology Information Technology and Management United States Manchester Metropolitan University Department of Computing and Mathematics United Kingdom Chitkara University Institute of Engineering and Technology Chitkara University Centre for Research Impact and Outcome Punjab Rajpura140401 India Shenzhen MSU-BIT University Guangdong-Hong Kong-Macao Joint Laboratory for Emotion Intelligence and Pervasive Computing Artificial Intelligence Research Institute Shenzhen518172 China Beijing Institute of Technology School of Medical Technology Beijing100081 China

As sustainable development gains attention, integrating carbon-intelligent computing into fault diagnosis systems has emerged as a critical strategy to reduce energy consumption and carbon footprints. This approach uses Artificial Intelligence (AI) and the Internet of Things (IoT) to optimize task scheduling, aligning it with low-carbon energy sources based on time and location. In fault diagnosis, energy-intensive tasks such as data processing and model inference can be scheduled during periods of abundant renewable energy, thereby minimizing emissions. However, drilling machines operate under complex conditions that generate non-stationary noise, which distorts signals and complicates fault diagnosis. Therefore, this paper combines Bidirectional Long Short-Term Memory (BiLSTM) with the Kolmogorov-Arnold Network (KAN) and integrates Wavelet Transform and Convolutional Autoencoder, proposing a highly robust fault diagnosis model for drilling machines, named WCBK. The Wavelet Transform converts pressure timeseries data, which contains fault information, into time-frequency images, facilitating the detection of fault frequency components. The Convolutional Autoencoder preserves essential features while removing noise by learning low-dimensional representations of the signal, effectively capturing local features in time-frequency images through local connections to enhance denoising performance. Finally, the composite deep learning network, which combines BiLSTM and KAN, achieves highly robust fault diagnosis under complex working conditions. The effectiveness of the proposed WCBK model was validated through ablation experiments, experiments on different individuals, experiments on different parts, and model adaptability evaluations. In experiments involving different individuals and parts, the WCBK model improved fault diagnosis accuracy by 10.9% and 8.8%, respectively, compared to existing models. © 2014 IEEE.

关键词： Drilling machines (machine tools)

来源：评论

学校读者我要写书评

暂无评论

Entanglement-Induced Barren Plateaus

引用

PRX Quantum 2021年第4期2卷 040316-040316页

作者： Carlos Ortiz Marrero Mária Kieferová Nathan Wiebe Data Sciences and Analytics Group Pacific Northwest National Laboratory Richland Washington 99354 USA Centre for Quantum Computation and Communication Technology Centre for Quantum Software and Information University of Technology Sydney New South Wales 2007 Australia Department of Computer Science University of Toronto Ontario M5S 1A1 Canada High Performance Computing Group Pacific Northwest National Laboratory Richland Washington 99354 USA

We argue that an excess in entanglement between the visible and hidden units in a quantum neural network can hinder learning. In particular, we show that quantum neural networks that satisfy a volume law in the entanglement entropy will give rise to models that are not suitable for learning with high probability. Using arguments from quantum thermodynamics, we then show that this volume law is typical and that there exists a barren plateau in the optimization landscape due to entanglement. More precisely, we show that for any bounded objective function on the visible layers, the Lipshitz constants of the expectation value of that objective function will scale inversely with the dimension of the hidden subsystem with high probability. We show how this can cause both gradient-descent and gradient-free methods to fail. We note that similar problems can happen with quantum Boltzmann machines, although stronger assumptions on the coupling between the hidden and/or visible subspaces are necessary. We highlight how pretraining such generative models may provide a way to navigate these barren plateaus.

关键词： Machine learning Quantum algorithms

来源：评论

学校读者我要写书评

暂无评论

Exploring Separable Attention for Multi-Contrast MR Image Super-Resolution

arXiv

引用

arXiv 2021年

作者： Feng, Chun-Mei Yan, Yunlu Yu, Kai Xu, Yong Yang, Jian Shao, Ling Fu, Huazhu The Shenzhen Key Laboratory of Visual Object Detection and Recognition Harbin Institute of Technology Shenzhen518055 China The Institute of High Performance Computing A*STAR Singapore138632 Singapore The PCA Laboratory Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Nanjing University of Science and Technology Nanjing210094 China The Jiangsu Key Laboratory of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China Terminus Group China

Super-resolving the Magnetic Resonance (MR) image of a target contrast under the guidance of the corresponding auxiliary contrast, which provides additional anatomical information, is a new and effective solution for fast MR imaging. However, current multi-contrast super-resolution (SR) methods tend to concatenate different contrasts directly, ignoring their relationships in different clues, e.g., in the high-intensity and low-intensity regions. In this study, we propose a separable attention network (comprising high-intensity priority attention and low-intensity separation attention), named SANet. Our SANet could explore the areas of high-intensity and low-intensity regions in the "forward" and "reverse" directions with the help of the auxiliary contrast, while learning clearer anatomical structure and edge information for the SR of a target-contrast MR image. SANet provides three appealing benefits: (1) It is the first model to explore a separable attention mechanism that uses the auxiliary contrast to predict the high-intensity and low-intensity regions regions, diverting more attention to refining any uncertain details between these regions and correcting the fine areas in the reconstructed results. (2) A multi-stage integration module is proposed to learn the response of multi-contrast fusion at multiple stages, get the dependency between the fused representations, and boost their representation ability. (3) Extensive experiments with various state-of-the-art multi-contrast SR methods on fastMRI and clinical in vivo datasets demonstrate the superiority of our model. © 2021, CC BY.

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

Pre-Equalization Aided Grant-Free Massive Access in Massive MIMO System

arXiv

引用

arXiv 2025年

作者： Wang, Yueqing Mei, Yikun Gao, Zhen Wan, Ziwei Ning, Boyu Mi, De Muhaidat, Sami School of Information and Electronics Beijing Institute of Technology Beijing100081 China MIIT Key Laboratory of Complex-Field Intelligent Sensing Beijing Institute of Technology Beijing100081 China Jiaxing314019 China Advanced Technology Research Institute Beijing Institute of Technology Jinan250307 China National Key Laboratory of Wireless Communications University of Electronic Science and Technology of China Chengdu611731 China School of Computing and Digital Technology Birmingham City University BirminghamB55JU United Kingdom KU 6G Research Center Department of Computer and Information Engineering Khalifa University Abu Dhabi United Arab Emirates

The spatial diversity and multiplexing advantages of massive multi-input-multi-output (mMIMO) can significantly improve the capacity of massive non-orthogonal multiple access (NOMA) in machine type communications. However, state-of-the-art grant-free massive NOMA schemes for mMIMO systems require accurate estimation of random access channels to perform activity detection and the following coherent data demodulation, which suffers from excessive pilot overhead and access latency. To address this, we propose a pre-equalization aided grant-free massive access scheme for mMIMO systems, where an iterative detection scheme is conceived. Specifically, the base station (BS) firstly activates one of its antennas (i.e., beacon antenna) to broadcast a beacon signal, which facilitates the user equipment (UEs) to perform downlink channel estimation and pre-equalize the uplink random access signal with respect to the channels associated with the beacon antenna. During the uplink transmission stage, the BS detects UEs’ activity and data by using the proposed iterative detection algorithm, which consists of three modules: coarse data detection (DD), data-aided channel estimation (CE), and fine DD. In the proposed algorithm, the joint activity and DD is firstly performed based on the signals received by the beacon antenna. Subsequently, the DD is further refined by iteratively performing data-aided CE module and fine DD module using signals received by all BS antennas. Our simulation results demonstrate that the proposed scheme outperforms state-of-the-art mMIMO-based grant-free massive NOMA schemes with the same access latency. Simulation codes are provided to reproduce the results in this article: https://***/owenwang517/tvt-2025. Copyright © 2025, The Authors. All rights reserved.

关键词： Channel estimation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：