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

IEEE International Conference on Multimedia and Expo (ICME)

作者： Feihu Jiang Chuan Qin Jingshuai Zhang Kaichun Yao Xi Chen Dazhong Shen Chen Zhu Hengshu Zhu Hui Xiong University of Science and Technology of China Career Science Lab BOSS Zhipin PBC School of Finance Tsinghua University Institute of Software Chinese Academy of Sciences Shanghai Artificial Intelligence Laboratory The Thrust of Artificial Intelligence The Hong Kong University of Science and Technology (GuangZhou) The Department of Computer Science and Engineering The Hong Kong University of Science and Technology Guangzhou HKUST Fok Ying Tung Research Institute

ISBN: (数字)9798350390155

ISBN: (纸本)9798350390162

In the contemporary era of widespread online recruitment, resume understanding has been widely acknowledged as a fundamental and crucial task, which aims to extract structured information from resume documents automatically. Compared to the traditional rule-based approaches, the utilization of recently proposed pre-trained document understanding models can greatly enhance the effectiveness of resume understanding. The present approaches have, however, disregarded the hierarchical relations within the structured information presented in resumes, and have difficulty parsing resumes in an efficient manner. To this end, in this paper, we propose a novel model, namely ERU, to achieve efficient resume understanding. Specifically, we first introduce a layout-aware multi-modal fusion transformer for encoding the segments in the resume with integrated textual, visual, and layout information. Then, we design three self-supervised tasks to pre-train this module via a large number of unlabeled resumes. Next, we fine-tune the model with a multi-granularity sequence labeling task to extract structured information from resumes. Finally, extensive experiments on a real-world dataset clearly demonstrate the effectiveness of ERU.

关键词： Visualization Resumes Layout Transformers Feature extraction Encoding data mining labeling Recruitment

来源：评论

学校读者我要写书评

暂无评论

Fractional discrete neural networks with variable order: solvability, finite time stability and synchronization

引用

The European Physical Journal Special Topics 2024年 1-14页

作者： Hioual, Amel Alomari, Saleh Al-Tarawneh, Hassan Ouannas, Adel Grassi, Giuseppe Laboratory of Dynamical Systems and Control University of Oum El-Bouaghi Oum El Bouaghi Algeria Faculty of Science and Information Technology Software Engineering Jadara University Irbid Jordan Department of Data Sciences and Artificial Intelligence Al-Ahliyya Amman University Amman Jordan Department of Mathematics and Computer Science University of Oum EL-Bouaghi Oum El Bouaghi Algeria Dipartimento Ingegneria Innovazione Universita del Salento Lecce Italy

Research in the field of dynamic behaviors in neural networks with variable-order differences is currently a thriving area, marked by various significant discoveries. However, when it comes to discrete-time neural networks featuring fractional variable-order nonlocal and nonsingular kernels, there has been limited exploration. This paper stands as one of the initial contributions to this subject, focusing primarily on the topics of stability and synchronization in finite-time within discrete neural networks. The research employs the nabla ABC variable-order difference operator, with a primary approach involving the investigation of a novel Gronwall inequality using the Atangana-Baleanu difference variable-order sum operator. This analysis leads to the development of a uniqueness theorem and a criterion for the stability in finite-time of variable-order discrete neural networks. Furthermore, the requirements stemming from this type of stability and the novel Gronwall inequality serve as the foundation for establishing the conditions necessary for achieving finite-time synchronization in these networks, employing a specific control using state feedback method. Finally, the study utilizes numerical solutions to validate the obtained results.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Integrating Sensing, Communication, and Computation in the Sky

Integrating Sensing, Communication, and Computation in the S...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Yao Tang Guangxu Zhu Wei Xu Man Hon Cheung Tat-Ming Lok Shuguang Cui Department of Information Engineering The Chinese University of Hong Kong Hong Kong Shenzhen Research Institute of Big Data Shenzhen China Peng Cheng Laboratory Shenzhen China National Mobile Communications Research Lab Southeast University Nanjing China Department of Computer Science City University of Hong Kong Hong Kong School of Science and Engineering (SSE) Future Network of Intelligence Institute (FNii) The Chinese University of Hong Kong (Shenzhen) Shenzhen China

Unmanned Aerial Vehicle (UAV)-mounted edge devices are particularly advantageous for federated edge learning (FEEL) due to their flexibility and mobility in efficient data collection. In UAV-assisted FEEL, sensing, computation, and communication are coupled and compete for limited onboard resources, and UAV deployment also affects sensing and communication performance. Therefore, the joint design of UAV deployment and resource allocation is crucial to achieving the optimal training performance. In this paper, we address the problem of joint UAV deployment design and resource allocation for FEEL via a concrete case study of human motion recognition based on wireless sensing. Due to the nonideal sensing channels, we consider the probabilistic sensing model. Then, we derive the upper bound of the FEEL training loss as a function of the sensing probability. We formulate a training time minimization problem by jointly optimizing UAV deployment, integrated sensing, computation, and communication (ISCC) resources under a desirable optimality gap constraint. To solve this challenging mixed-integer non-convex problem, we propose our algorithm based on the alternating optimization technique. Simulation results demonstrate that our algorithm outperforms other baselines regarding convergence rate and testing accuracy.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Depth-Aware Multi-Modal Fusion for Generalized Zero-Shot Learning

Depth-Aware Multi-Modal Fusion for Generalized Zero-Shot Lea...

引用

IEEE International Conference on Industrial Informatics (INDIN)

作者： Weipeng Cao Xuyang Yao Zhiwu Xu Yinghui Pan Yixuan Sun Dachuan Li Bohua Qiu Muheng Wei Guangdong Laboratory of Artificial Intelligence and Digital Economy (Shenzhen) Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China College of Computer Science and Software Engineering Shenzhen University Shenzhen China Stony Brook University New York United States Research Institute of Trustworthy Autonomous Systems Southern University of Science and Technology Shenzhen China Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China ZhenDui Industry Artificial Intelligence Co. Ltd Shenzhen China Department of Automation Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China

ISBN: (数字)9798331527471

ISBN: (纸本)9798331527488

Realizing Generalized Zero-Shot Learning (GZSL) based on large models is emerging as a prevailing trend. However, most existing methods merely regard large models as black boxes, solely leveraging the features output by the final layer while disregarding potential performance enhancements from other layers. Indeed, numerous researchers have visually depicted variations in the features learned across different layers of neural networks. Motivated by this observation, we propose a Vision Transformer (ViT)-based GZSL method named Depth-Aware Multi-Modal ViT (DAM2ViT), which exploits multi-level features of ViT. DAM2ViT incorporates a multi-modal interaction block to align semantic information of categories across multiple layers, thereby augmenting the model's capacity to learn associations between visual and semantic spaces. Extensive experiments conducted on three benchmark datasets (i.e., CUB, SUN, AWA2) have showcased that DAM2ViT achieves competitive results compared to state-of-the-art methods.

关键词： Visualization Adaptation models Semantics Zero shot learning Neural networks Termination of employment Transformers Market research Sun Optimization

来源：评论

学校读者我要写书评

暂无评论

A data-Driven Approach Towards software Regression Testing Quality Optimization

A Data-Driven Approach Towards Software Regression Testing Q...

引用

Information Technology (ACIT)

作者： Abdallah Moubayed Nouh Alhindawi Jamal Alsakran MohammadNoor Injadat Mohammad Kanan Computer Engineering Department and Interdisciplinary Research Center for Intelligent Secure Systems King Fahd University of Petroleum & Minerals Dhahran Saudi Arabia School of Computing and Augmented Intelligence Arizona State University Gilbert Arizona USA Department of Software Engineering Jadara University Irbid Jordan Fairleigh Dickinson University Canada Data Science & Artificial Intelligence Department Zarqa University Zarqa Jordan Department of Industrial Engineering University of Business and Technology Jeddah Saudi Arabia

ISBN: (数字)9798331540012

ISBN: (纸本)9798331540029

software testing is very important in software development to ensure its quality and reliability. As software systems have become more complex, the number of test cases has increased, which presents the challenge of executing all the tests in a limited time frame. Various test case prioritization techniques have been introduced to solve this problem. These methods aim to identify and implement the most critical tests first. In this paper, we propose an implementation of a dynamic test case prioritization strategy to improve software quality by increasing code coverage with special attention to edge case handling. Edge case test prioritization is a technique that improves test efficiency by selecting extreme case scenarios that can reveal critical bugs or unexpected behavior early in development, improving overall software reliability and dependability. In order to prioritize test cases, this paper presents a regression-based method that makes use of machine learning algorithms. The approach leverages previous performance data to optimize regression testing efficiency by examining variables like test time and execution status. Performance evaluations, when compared against industry standards and cutting-edge techniques, show how effective these algorithms are at correctly prioritizing test cases and identifying faults. This study offers simplified yet reliable solutions for regression testing optimization by shedding light on the efficacy of regression algorithms, such as Random Forest and decision trees.

关键词： software testing Machine learning algorithms software algorithms software quality software systems software reliability Regression tree analysis Optimization Standards software development management

来源：评论

学校读者我要写书评

暂无评论

Training Artificial Neural Networks by Coordinate Search Algorithm

Training Artificial Neural Networks by Coordinate Search Alg...

引用

IEEE Symposium Series on Computational intelligence (SSCI)

作者： Ehsan Rokhsatyazdi Shahryar Rahnamayan Sevil Zanjani Miyandoab Azam Asilian Bidgoli H.R. Tizhoosh Nature-Inspired Computational Intelligence (NICI) Lab Department of Electrical Computer and Software Engineering Ontario Tech University Oshawa ON Canada Department of Engineering Brock University St. Catharines ON Canada Faculty of Science Wilfrid Laurier University Waterloo ON Canada Department of Artificial Intelligence and Informatics Mayo Clinic Rhazes Lab Rochester MN USA

Training Artificial Neural Networks (ANNs) poses a challenging and critical problem in machine learning. Despite the effectiveness of gradient-based learning methods, such as Stochastic Gradient Descent (SGD), in training neural networks, they do have several limitations. For instance, they require differentiable activation functions, and cannot optimize a model based on several independent non-differentiable loss functions simultaneously; for example, the F1-score, which is used during testing, can be used during training when a gradient-free optimization algorithm is utilized. Furthermore, the training (i.e., optimization of weights) in any DNN can be possible with a small size of the training dataset. To address these concerns, we propose an efficient version of the gradient-free Coordinate Search (CS) algorithm, an instance of General Pattern Search (GPS) methods, for training (i.e., optimizing) neural networks. The proposed algorithm can be used with non-differentiable activation functions and tailored to multi-objective/multi-loss problems. Finding the optimal values for weights of ANNs is a large-scale optimization problem. Therefore instead of finding the optimal value for each variable, which is the common technique in classical CS, we accelerate optimization and convergence by bundling the variables (i.e., weights). In fact, this strategy is a form of dimension reduction for optimization problems. Based on the experimental results, the proposed method is comparable with the SGD algorithm, and in some cases, it outperforms the gradient-based approach. Particularly, in situations with insufficient labeled training data, the proposed CS method performs better. The performance plots demonstrate a high convergence rate, highlighting the capability of our suggested method to find a reasonable solution with fewer function calls. As of now, the only practical and efficient way of training ANNs with hundreds of thousands of weights is gradient-based algorithms such

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-Objective Binary Coordinate Search for Feature Selection

Multi-Objective Binary Coordinate Search for Feature Selecti...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Sevil Zanjani Miyandoab Shahryar Rahnamayan Azam Asilian Bidgoli Nature-Inspired Computational Intelligence (NICI) Lab Department of Electrical Computer and Software Engineering Ontario Tech University Oshawa ON Canada Department of Engineering Brock University St. Catharines ON Canada Faculty of Science Wilfrid Laurier University Waterloo ON Canada

A supervised feature selection method selects an appropriate but concise set of features to differentiate classes, which is highly expensive for large-scale datasets. Therefore, feature selection should aim at both minimizing the number of selected features and maximizing the accuracy of classification, or any other task. However, this crucial task is computationally highly demanding on many real-world datasets and requires a very efficient algorithm to reach a set of optimal features with a limited number of fitness evaluations. For this purpose, we have proposed the binary multi-objective coordinate search (MOCS) algorithm to solve large-scale feature selection problems. To the best of our knowledge, the proposed algorithm in this paper is the first multi-objective coordinate search algorithm. In this method, we generate new individuals by flipping a variable of the candidate solutions on the Pareto front. This enables us to investigate the effectiveness of each feature in the corresponding subset. In fact, this strategy can play the role of crossover and mutation operators to generate distinct subsets of features. The reported results indicate the significant superiority of our method over NSGA-II, on five real-world large-scale datasets, particularly when the computing budget is limited. Moreover, this simple hyper-parameter-free algorithm can solve feature selection much faster and more efficiently than NSGA-II.

关键词：

来源：评论

学校读者我要写书评

暂无评论

TSFEDL: A PYTHON LIBRARY FOR TIME SERIES SPATIO-TEMPORAL FEATURE EXTRACTION AND PREDICTION USING DEEP LEARNING (WITH APPENDICES ON DETAILED NETWORK ARCHITECTURES AND EXPERIMENTAL CASES OF STUDY)

arXiv

引用

arXiv 2022年

作者： Aguilera-Martos, Ignacio García-Vico, Ángel M. Luengo, Julián Damas, Sergio Melero, Francisco J. Valle-Alonso, José Javier Herrera, Francisco Department of Computer Science and Artificial Intelligence University of Granada Granada Spain Department of Software Engineering University of Granada Granada Spain Repsol Technology Lab Spain

The combination of convolutional and recurrent neural networks is a promising framework that allows the extraction of high-quality spatio-temporal features together with its temporal dependencies, which is key for time series prediction problems such as forecasting, classification or anomaly detection, amongst others. In this paper, the TSFEDL library is introduced. It compiles 20 state-of-the-art methods for both time series feature extraction and prediction, employing convolutional and recurrent deep neural networks for its use in several data mining tasks. The library is built upon a set of Tensorflow+Keras and PyTorch modules under the AGPLv3 license. The performance validation of the architectures included in this proposal confirms the usefulness of this Python package. Copyright © 2022, The Authors. All rights reserved.

关键词： Python

来源：评论

学校读者我要写书评

暂无评论

A Pairwise Surrogate Model using GNN for Evolutionary Optimization

A Pairwise Surrogate Model using GNN for Evolutionary Optimi...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Vida Gharavian Shahryar Rahnamayan Azam Asilian Bidgoli Masoud Makrehchi Nature-Inspired Computational Intelligence (NICI) Lab Department of Electrical Computer and Software Engineering Ontario Tech University Oshawa ON Canada Department of Engineering Brock University St. Catharines ON Canada Faculty of Science Wilfrid Laurier University Waterloo ON Canada

Optimization problems widely arise in various science and engineering fields and can be computationally expensive in many real-world applications. Evaluation of the fitness function to assess a candidate solution is the main operation in all optimization procedures which can be heavily compute-intensive. Machine learning-based surrogate models can contribute to learning the specific pattern among the decision variables and objective values to consequently reduce the computation time of fitness evaluation. In this study, we have proposed a novel pairwise surrogate model to identify the superiority between candidate solutions in a pairwise comparison despite the fact that most of the surrogate models try to predict the exact fitness value. The proposed idea can significantly help the optimizer to reach better results in a shorter period of time. It seems comparing two candidate solutions for a greedy selection is much easier than approximating fitness values for both. We demonstrated Graph Neural Network (GNN) for this purpose to be trained on a limited number of pairwise ranks and then utilized to compare a pair of candidate solutions. In order to examine the efficacy of our model, we utilized different well-known single-objective optimization benchmarks in dimensions 10,20, and 30. Moreover, the results of the learning-based evaluation are compared with the results from the real fitness evaluation. The results, assessed in terms of the number of fitness calls and the best-found solution, showed that the proposed method is able to decrease the computing cost of fitness evaluation significantly while we achieve a comparable solution. Our model can be tested with any optimization algorithm which employs a comparison-based mechanism among its candidate solutions.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Routing Optimization in Wireless Sensor Networks Based on Reverse Elite Sparrow Search Algorithm

Journal of Network Intelligence

引用

Journal of Network intelligence 2021年第4期6卷 763-775页

作者： Ning, Chun-Yuan Liao, Lyu-Chao Nguyen, Trong-The Huang, Kuan-Chun Pan, Jeng-Shyang Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology Fuzhou350118 China Multimedia Communications Lab University of Information Technology VNU-HCM Viet Nam Department of Industrial and Systems Engineering Chung Yuan Christian University Taoyuan320314 Taiwan College of Computer Science and Engineering Shandong University of Science and Technology Qingdao266590 China

This study suggests a solution to the routing optimization insufficiency based on the reverse elite sparrow search algorithm (RESSA) for energy balancing and network lifetime prolonging in wireless sensor networks (WSN). The node’s consumption and the remaining energy priority to balance consumption in the data forwarding to the cluster head are considered the optimal path evaluation function. The obtained results of the experimental the suggested scheme are compared with the other methods show that the proposed scheme increases data forwarding round numbers and consumes less energy, the remaining energy more, and higher efficiency of node energy consumption. © The Authors.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：