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

Data-driven Optimization of Complex Systems (DOCS), International Conference on

作者： Shangshang Yang Cheng Zhen Ye Tian Haiping Ma Yuanchao Liu Panpan Zhang Xingyi Zhang Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Artificial Intelligence Anhui University Hefei China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Institutes of Physical Science and Information Technology Anhui University Hefei China State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang China

Cognitive diagnosis models (CDMs) with high generalization are essential for intelligent education systems to reveal students' knowledge states in multiple datasets. However, existing CDMs' architectures are designed dependent on researcher expertise and experience from observing and summarizing partial students' learning behaviors, which makes handcrafted models not cover all learning behaviors well and thus limits their generalization. To develop generalized CDMs, this paper proposes an evolutionary neural architecture search to design CDMs' architectures effective on multiple datasets automatically. Specifically, we first formulate the search task as a multi-objective optimization problem (MOP), which maximizes model performance on multiple datasets containing learning behaviors as many as possible to ensure model generalization. Then, an expressive search space is devised to contain as many potential architectures as possible, where each architecture is denoted by a unified form, taking three given inputs and integrating them in a linear or no-linear manner for prediction. Finally, an evolutionary algorithm with a tailored deduplication strategy is employed to solve the MOP, where each architecture is further represented by a single-root computation tree for easy optimization. Experiments on multiple datasets demonstrate the generalization and effectiveness of the best architecture searched by the proposed approach, and the searched architecture also holds as good interpretability as handcrafted architectures.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multimodal Graph Neural Network for Recommendation with Dynamic De-redundancy and Modality-Guided Feature De-noisy

arXiv

引用

arXiv 2024年

作者： Mo, Feng Xiao, Lin Song, Qiya Gao, Xieping Liang, Eryao Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University China

Graph neural networks (GNNs) have become crucial in multimodal recommendation tasks because of their powerful ability to capture complex relationships between neighboring nodes. However, increasing the number of propagation layers in GNNs can lead to feature redundancy, which may negatively impact the overall recommendation performance. In addition, the existing recommendation task method directly maps the preprocessed multimodal features to the low-dimensional space, which will bring the noise unrelated to user preference, thus affecting the representation ability of the model. To tackle the aforementioned challenges, we propose Multimodal Graph Neural Network for Recommendation (MGNM) with Dynamic De-redundancy and Modality-Guided Feature De-noisy, which is divided into local and global interaction. Initially, in the local interaction process,we integrate a dynamic de-redundancy (DDR) loss function which is achieved by utilizing the product of the feature coefficient matrix and the feature matrix as a penalization factor. It reduces the feature redundancy effects of multimodal and behavioral features caused by the stacking of multiple GNN layers. Subsequently, in the global interaction process, we developed modality-guided global feature purifiers for each modality to alleviate the impact of modality noise. It is a two-fold guiding mechanism eliminating modality features that are irrelevant to user preferences and captures complex relationships within the modality. Experimental results demonstrate that MGNM achieves superior performance on multimodal information denoising and removal of redundant information compared to the state-of-the-art methods. Copyright © 2024, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

An Efficient Authentication and key Agreement Scheme for CAV Internal Applications 19th

An Efficient Authentication and Key Agreement Scheme for C...

引用

19th EAI International Conference on Collaborative computing: Networking, Applications and Worksharing, CollaborateCom 2023

作者： Li, Yang Zhang, Qingyang Cao, Wenwen Cui, Jie Zhong, Hong Anhui Province Key Laboratory of Cyberspace Security Situation Awareness and Evaluation Hefei230037 China School of Computer Science and Technology Anhui University Hefei230039 China Anhui Engineering Laboratory of IoT Security Technologies Anhui University Hefei230039 China Institute of Physical Science and Information Technology Anhui University Hefei230039 China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei230039 China

ISBN: (纸本)9783031545276

The data of applications in connected and autonomous vehicles are important, which is usually collected by service providers to improve their services, such as object detection model. But, wireless communication is susceptible to various kinds of attacks. Thus, the data of the application module needs to be securely shared to the corresponding service provider. However, current schemes are with limited performance while a service provider collects multiple application data at the same time. By adopting signcryption and chaotic map, an efficient authentication and key agreement scheme is proposed, while batch authentication is achieved for efficient message authentication of multiple applications, and the efficient revocation is realized based on Chinese remainder theorem under the assistance of trusted execution environment supported vehicle computing/communication unit. The formal security proof shows that the scheme is secure under the random oracle model, and the experiment results shows that the scheme is more efficient than related schemes and can meet the requirements of CAV. © ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2024.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Virtual Machine Migration Algorithm in Data Centers 3

Energy-Efficient Virtual Machine Migration Algorithm in Data...

引用

3rd International conference on Computer, Big Data and Artificial Intelligence, ICCBDAI 2022

作者： Wu, Xiaodong Zeng, Taisheng School of Mathmatics and Computer Science Quanzhou Normal University Fujian Province Quanzhou362000 China Fujian Provincial Key Laboratory of Intensive Computing Fujian Province Quanzhou362000 China Key Laboratory of Intelligent Computing and Information Processing Fujian Province University Fujian Province Quanzhou362000 China

The issue of data center power consumption is becoming increasingly serious. One of the most effective techniques for increasing resource utilization and lowering power consumption is virtual machine consolidation. This paper proposes a threshold-based energy-efficient and SLA-aware algorithm for virtual machine migration and consolidation. Based on statistics and analysis of historical virtual machine status, the algorithm dynamically obtains the upper CPU utilization threshold of the physical servers and identifies whether to perform the virtual machine migration, so as to reduce the number of active hosts to save energy. The experimental results demonstrate that the proposed algorithm has better comprehensive performance. When compared to the existing algorithm, our method can effectively decrease energy consumption and SLA violations. © Published under licence by IOP Publishing Ltd.

关键词： Electric power utilization

来源：评论

学校读者我要写书评

暂无评论

Research and Implementation of Chinese Resume Named Entity Recognition Method Based on BLDC 4

Research and Implementation of Chinese Resume Named Entity R...

引用

4th International Conference on Image processing and intelligent Control, IPIC 2024

作者： Chen, Min Wei, Bin Yu, Hongzhi Wan, Fucheng Feng, Yulin Lu, Baoqing Key Laboratory of Linguistic and Cultural Computing Ministry of Education Northwest Minzu University Gansu Lanzhou730000 China Key Laboratory of Minzu Languages and Cultures Intelligent Information Processing Northwest Minzu University Gansu Province Gansu Lanzhou730000 China Lanzhou Technology and Business College Lanzhou China

ISBN: (纸本)9781510682313

Aiming at the semantic complexity and the difficulty of capturing long-distance dependencies in the task of named entity recognition in Chinese resume text, a BLDC (BERT-BiLSTM-Dense-CRF)-based named entity recognition method for Chinese resumes is investigated. The model first uses the pre-trained BERT-Base-Chinese model to obtain the semantic information of the text, then learns the contextual information of the sequence through the BiLSTM layer, followed by mapping the output of BiLSTM to the label space through the Dense layer, and finally uses the CRF layer to consider the dependencies between the labels for sequence annotation. Experimental results on public datasets show that the method outperforms other models in terms of precision, recall, and F1 value, and effectively improves the performance of named entity recognition in Chinese resume text. © 2024 SPIE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Wind Vector Inversion of ADS-B Data Based on Improved PSO-PF Algorithm

Wind Vector Inversion of ADS-B Data Based on Improved PSO-PF...

引用

International Conference on Guidance, Navigation and Control, ICGNC 2022

作者： Chen, Wantong Wu, Duo Ren, Shiyu Diao, Tianru Tianjin Key Laboratory of Intelligent Signal and Image Processing Civil Aviation University of China Tianjin300300 China School of Electronic Information and Automation Civil Aviation University of China Tianjin300300 China

ISBN: (纸本)9789811966125

At present, inversing wind vector from aircraft trajectory captured by automatic dependent surveillance-broadcast (ADS-B) is one of the main solutions to obtain wind field in aviation meteorology. However, some algorithms in this scheme still have some shortcomings, especially the poor performance when the aircraft turns at a small angle. In this paper, the geometric structure of ADS-B data is used to improve particle swarm optimized particle filter algorithm (PSO-PF) to inverse wind vectors in small area of single aircraft data and large area of multi-aircraft data respectively. The mean absolute error of wind estimation under different turning angles is evaluated. Experimental results show that the algorithm is feasible, and it still has a good inversion effect when the aircraft turns at a small angle. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Aircraft

来源：评论

学校读者我要写书评

暂无评论

Beyond MLE: Convex Learning for Text Generation 37

Beyond MLE: Convex Learning for Text Generation

引用

37th Conference on Neural Information processing Systems, NeurIPS 2023

作者： Shao, Chenze Ma, Zhengrui Zhang, Min Feng, Yang Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China School of Future Science and Engineering Soochow University China

ISBN: (纸本)9781713899921

Maximum likelihood estimation (MLE) is a statistical method used to estimate the parameters of a probability distribution that best explain the observed data. In the context of text generation, MLE is often used to train generative language models, which can then be used to generate new text. However, we argue that MLE is not always necessary and optimal, especially for closed-ended text generation tasks like machine translation. In these tasks, the goal of model is to generate the most appropriate response, which does not necessarily require it to estimate the entire data distribution with MLE. To this end, we propose a novel class of training objectives based on convex functions, which enables text generation models to focus on highly probable outputs without having to estimate the entire data distribution. We investigate the theoretical properties of the optimal predicted distribution when applying convex functions to the loss, demonstrating that convex functions can sharpen the optimal distribution, thereby enabling the model to better capture outputs with high probabilities. Experiments on various text generation tasks and models show the effectiveness of our approach. It enables autoregressive models to bridge the gap between greedy and beam search, and facilitates the learning of non-autoregressive models with a maximum improvement of 9+ BLEU points. Moreover, our approach also exhibits significant impact on large language models (LLMs), substantially enhancing their generative capability on various tasks. Source code is available at https://***/ictnlp/Convex-Learning. © 2023 Neural information processing systems foundation. All rights reserved.

关键词： Maximum likelihood estimation

来源：评论

学校读者我要写书评

暂无评论

An Empirical Study on Neural Networks Pruning: Trimming for Reducing Memory or Workload

An Empirical Study on Neural Networks Pruning: Trimming for ...

引用

Data-driven Optimization of Complex Systems (DOCS), International Conference on

作者： Kaiwen Xiao Xiaodong Cai Ke Xu School of Artificial Intelligence Anhui University Hefei China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Hefei China

Most of existing studies on neural network pruning only consider memory-based pruning strategies. However pruning for computational workload is often more important in hardware deployments due to a greater focus on model computation reductions. In addition, most pruning schemes restore model accuracy during pruning at the expense of adding hyperparameters, extending training time and training complexity. This work proposes a statistical-based globally soft iterative pruning scheme. With little extra calculation, an extremely sparse model can be obtained without additional hyperparameters and extended training time. Moreover, this work proposes the concept of computational intensity to balance model memory and computational workload during pruning. Focusing on memory orientated pruning, we can achieve $\mathbf{303}\times, \mathbf{100}\times$ and $\mathbf{25}\times$ parameter compression on LeNet-5 (MNIST), VGG (CIFAR-10) and AlexNet (ImageNet) models, respectively. In particular, combined with cluster quantization, the LeNet-5 model parameters can be compressed to $\mathbf{3232}\times$ . Focusing on workload orientated pruning, we can reduce the computation by $\mathbf{7}.\mathbf{6}\times$ on the AlexNet model, without accuracy loss, significantly higher than prior work. In addition, in order to verify the versatility of the pruning method, we also migrate the pruning task to the object detection and implement $\mathbf{10}\times$ parameter compression and $\mathbf{2}.\mathbf{8}\times$ computation compression for YOLOv2 with reduced mAP within 1%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Air Pollution Monitoring By Integrating Local and Global Information in Self-Adaptive Multiscale Transform Domain

引用

IEEE Transactions on Multimedia 2025年 27卷 3716-3728页

作者： Gu, Ke Liu, Yuchen Liu, Hongyan Liu, Bo Qiao, Junfei Lin, Weisi Zhang, Wenjun Beijing University of Technology School of Information Science and Technology Engineering Research Center of Intelligent Perception and Autonomous Control of Ministry of Education Beijing Laboratory of Smart Environmental Protection Beijing Key Laboratory of Computational Intelligence and Intelligent System Beijing Artificial Intelligence Institute Beijing100124 China Massey University School of Mathematical and Computational Sciences New Zealand Nanyang Technological University College of Computing and Data Science Singapore Shanghai Jiao Tong University Institute of Image Communication and Information Processing Shanghai China

As the deadliest form of pollution, air pollution had a prolonged severe damage to the human health and life safety of nearly 99% of the world's population. Facing to the problem that billions of tons of pollutants discharged into the air per year by industrial activities, this paper proposed a novel image-based air pollution monitor (IAPM) by incorporating local and global information in the self-adaptive multiscale transform domain, so as to achieve the timely and effective leakage detection of typical air pollutants from a single image. To be specific, this paper first developed a screen-shaped module according to two significant findings in visual neuroscience, which include the high sensitivity of human eyes to horizontal and vertical stimuli and the center-surround inhibition, by designing and fusing the square module, horizontal strip module and vertical strip module parallelly for simulating the behaviour of human eyes to extract local features. Second, the learnable weights and proportional mapping were applied to incorporate the screen-shaped module and lightweight vision transformer as backbone, towards more richly exploiting and fusing local and global information just as the way a brain perceives external stimuli. Third, a new self-adaptive multiscale transform domain method was devised based on two motivations from the visual characteristics of multiscale perception and the brain characteristics of self-adaptive domain transform to modify the backbone by using the operations of pooling and pointwise convolution. Extensive experiments implemented on the datasets of carbon particulate matters and ethylene leakage confirmed the superior monitoring performance of the proposed IAPM model beyond the state-of-the-art (SOTA) peers by an accuracy gain of about 4%. Furthermore, the proposed IAPM model only required 0.089 GFLOPs and 0.15 million model parameters, remarkably outperforming SOTA competitors in computational efficiency and storage resources. © 1999-2

关键词： Information leakage

来源：评论

学校读者我要写书评

暂无评论

Scale‐wise interaction fusion and knowledge distillation network for aerial scene recognition

引用

CAAI Transactions on Intelligence Technology 2023年第4期8卷 1178-1190页

作者： Hailong Ning Tao Lei Mengyuan An Hao Sun Zhanxuan Hu Asoke K.Nandi School of Computer Science and Technology Xi'an University of Posts and TelecommunicationsShaanxi Key Laboratory of Network Data Analysis and Intelligent ProcessingXi'anChina Xi'an Key Laboratory of Big Data and Intelligent Computing Xi'anChina School of Electronic Information and Artificial Intelligence Shaanxi University of Science and TechnologyXi'anChina School of Computer Central China Normal UniversityWuhanChina Department of Electronic and Electrical Engineering Brunel University LondonLondonUK Xi'an Jiaotong University Xi'anChina

Aerial scene recognition(ASR)has attracted great attention due to its increasingly essential *** of the ASR methods adopt the multi‐scale architecture because both global and local features play great roles in ***,the existing multi‐scale methods neglect the effective interactions among different scales and various spatial locations when fusing global and local features,leading to a limited ability to deal with challenges of large‐scale variation and complex background in aerial scene *** addition,existing methods may suffer from poor generalisations due to millions of to‐belearnt parameters and inconsistent predictions between global and local *** tackle these problems,this study proposes a scale‐wise interaction fusion and knowledge distillation(SIF‐KD)network for learning robust and discriminative features with scaleinvariance and background‐independent *** main highlights of this study include two *** the one hand,a global‐local features collaborative learning scheme is devised for extracting scale‐invariance features so as to tackle the large‐scale variation problem in aerial scene ***,a plug‐and‐play multi‐scale context attention fusion module is proposed for collaboratively fusing the context information between global and local *** the other hand,a scale‐wise knowledge distillation scheme is proposed to produce more consistent predictions by distilling the predictive distribution between different scales during *** experimental results show the proposed SIF‐KD network achieves the best overall accuracy with 99.68%,98.74%and 95.47%on the UCM,AID and NWPU‐RESISC45 datasets,respectively,compared with state of the arts.

关键词： deep learning image analysis image classification information fusion

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：