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

arXiv 2024年

作者： Liu, Saichao Sun, Geng Li, Jiahui Liang, Shuang Wu, Qingqing Wang, Pengfei Niyato, Dusit The College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China The College of Computing and Data Science Nanyang Technological University 639798 Singapore The School of Information Science and Technology Northeast Normal University Changchun130117 China The Department of Electronic Engineering Shanghai Jiao Tong University Shanghai200240 China The School of Computer Science and Technology Dalian University of Technology Dalian116024 China

In this paper, we investigate an unmanned aerial vehicle (UAV)-assistant air-to-ground communication system, where multiple UAVs form a UAV-enabled virtual antenna array (UVAA) to communicate with remote base stations by utilizing collaborative beamforming. To improve the work efficiency of the UVAA, we formulate a UAV-enabled collaborative beamforming multi-objective optimization problem (UCBMOP) to simultaneously maximize the transmission rate of the UVAA and minimize the energy consumption of all UAVs by optimizing the positions and excitation current weights of all UAVs. This problem is challenging because these two optimization objectives conflict with each other, and they are non-concave to the optimization variables. Moreover, the system is dynamic, and the cooperation among UAVs is complex, making traditional methods take much time to compute the optimization solution for a single task. In addition, as the task changes, the previously obtained solution will become obsolete and invalid. To handle these issues, we leverage the multi-agent deep reinforcement learning (MADRL) to address the UCBMOP. Specifically, we use the heterogeneous-agent trust region policy optimization (HATRPO) as the basic framework, and then propose an improved HATRPO algorithm, namely HATRPO-UCB, where three techniques are introduced to enhance the performance. Simulation results demonstrate that the proposed algorithm can learn a better strategy compared with other methods. Moreover, extensive experiments also demonstrate the effectiveness of the proposed techniques. Copyright © 2024, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Multi-focus image fusion based on fully convolutional networks

引用

Frontiers of Information Technology & Electronic engineering 2020年第7期21卷 1019-1033页

作者： Rui GUO Xuan-jing SHEN Xiao-yu DONG Xiao-li ZHANG Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchun 130012China College of Computer Science and Technology Jilin UniversityChangchun 130012China

We propose a multi-focus image fusion method, in which a fully convolutional network for focus detection(FD-FCN) is constructed. To obtain more precise focus detection maps, we propose to add skip layers in the network to make both detailed and abstract visual information available when using FD-FCN to generate maps. A new training dataset for the proposed network is constructed based on dataset CIFAR-10. The image fusion algorithm using FD-FCN contains three steps: focus maps are obtained using FD-FCN, decision map generation occurs by applying a morphological process on the focus maps, and image fusion occurs using a decision map. We carry out several sets of experiments, and both subjective and objective assessments demonstrate the superiority of the proposed fusion method to state-of-the-art algorithms.

关键词： Multi-focus image fusion Fully convolutional networks Skip layer Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Bounding-box deep calibration for high performance face detection

arXiv

引用

arXiv 2021年

作者： Luo, Shi Li, Xiongfei Zhang, Xiaoli College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

Modern convolutional neural networks (CNNs)‐based face detectors have achieved tremendous strides due to large annotated datasets. However, misaligned results with high detection confidence but low localization accuracy restrict the further improvement of detection performance. In this paper, the authors first predict high confidence detection results on the training set itself. Surprisingly, a considerable part of them exist in the same misalignment problem. Then, the authors carefully examine these cases and point out that annotation misalignment is the main reason. Later, a comprehensive discussion is given for the replacement rationality between predicted and annotated bounding‐boxes. Finally, the authors propose a novel Bounding‐Box Deep Calibration (BDC) method to reasonably replace misaligned annotations with model predicted bounding‐boxes and offer calibrated annotations for the training set. Extensive experiments on multiple detectors and two popular benchmark datasets show the effectiveness of BDC on improving models' precision and recall rate, without adding extra inference time and memory consumption. Our simple and effective method provides a general strategy for improving face detection, especially for light‐weight detectors in real‐time situations. © 2021, CC BY.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Divergent Projection Analysis for Unsupervised Dimensionality Reduction

引用

Procedia Computer Science 2022年 199卷 384-391页

作者： Shanshan Wang Lan Bai Xu Chen Zhen Wang Yuan-Hai Shao School of Mathematical Sciences Inner Mongolia University Hohhot 010021 P.R. China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 P.R. China School of Management Hainan University Haikou 570228 P.R. China

Principal component analysis (PCA) has been extended to a series of classical methods in dimensionality reduction for unsu¬pervised learning. However, the differences among the projected data samples may not be sufficient by PCA, causing problems both in data visualization and recognition. Though some nonlinear dimensionality reduction methods have been proposed to preserve the samples’ differences, their nonlinear mappings hide the relationships among the data features, e.g., Isometric mapping (Isomap) and Locally Linear Embedding (LLE). In this paper, we propose a linear dimensionality reduction method, called Divergent Projection Analysis (DPA), to preserve the largest differences among the samples. Our DPA projects the sam¬ples into a low-dimensional space such that any two projected samples have a certain distance, resulting in solving a nonconvex optimization problem. The nonconvex problem is solved by the subgradient descent algorithm and particle swarm optimiza¬tion algorithm, and their solution qualities are compared in the experiments. Experiments on a synthetic dataset and three face recognition problems confirm the effectiveness of the proposed method compared with other state-of-the-art methods.

关键词： Unsupervised learning Dimensionality reduction Linear dimensionality reduction Largest differences Nonconvex optimization

来源：评论

学校读者我要写书评

暂无评论

A Task Processing Efficiency Improvement Scheme Based on Cloud-Edge Architecture in Dense Computing Environments

SSRN

引用

SSRN 2022年

作者： Feng, Jiahui Qi, Jingze Liu, Yuanning Liu, Zhen College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China Graduate School of Engineering Nagasaki Institute of Applied Science 536 Aba-machi Nagasaki851-0193 Japan

As cloud-edge architecture combines low latency and high-performance computing, it has a wider range of application scenarios. Considering that, how to reasonably allocate tasks to the edge cloud or the central cloud and how to select appropriate virtual machines (VMs) for tasks are two key aspects affecting the efficiency of cloud-edge architecture. For the former, the ARDT algorithm is proposed, which dynamically adjusts the optimal threshold by predicting the number of real-time edge-end devices. For the latter, we design the DBMR algorithm based on the Max-Fit algorithm, in which we propose a structure of blocking to reduce the time complexity of the original algorithm from O(n2) to O(n(n-m)). Experimental results show that the ARDT-DBMR algorithm optimizes the average processing time and task failure rate by 30%-40% compared with the baseline algorithms and other advanced algorithms and significantly improves the problem of abnormal fluctuations in VM utilization in dense computing environments. © 2022, The Authors. All rights reserved.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Automatic Detection of Lumbar Spondylolisthesis and Instability Using Supine Magnetic Resonance Images

SSRN

引用

SSRN 2023年

作者： Liu, Zewen Zhang, Han Zhao, Hang Liu, Yuwu Zhang, Chi Shi, Xiaohu College of Software Jilin University Changchun130021 China Guangyuan Central Hospital China College of Computer Science and Technology Jilin University Changchun130021 China Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Changchun130021 China

Background and Objective: Lumbar spondylolisthesis is a condition in which one vertebra is displaced relative to the vertebra below it. Lumbar instability can be divided into static and dynamic spondylolisthesis depending on whether the degree of slippage changes significantly in images taken in different postures. Usually, the degree of slippage of lumbar instability is not obvious on magnetic resonance (MR) images taken in the supine position;therefore, it is easy to miss the detection of spondylolisthesis with lumbar instability based on slippage. This feature of lumbar instability also poses a challenge for the automatic detection of dynamic spondylolisthesis, particularly in supine MR images. This study aimed to develop a two-stage model for the automatic detection of spondylolisthesis and lumbar instability using supine MR ***: Specifically, we used You Only Look Once (YOLO) to detect and crop consecutive images near the intervertebral discs (IVDs) on both sagittal and transverse axis magnetic resonance images, and then classified the cropped images using weight-sharing convolutional neural networks (CNNs). Consistency regularization and a new contrast loss function ware also developed to improve the robustness. The MR data we used includes 108 mixed samples of lumbar instability and spondylolisthesis (39 cases of lumbar instability and 69 cases of spondylolisthesis) and 182 normal ***: We found that YOLO could detect the complete image sequence between L1 and S1 with 97.24% accuracy (ACC). Compared with the ground truth labels, the mean of intersection over union (mIOU) is 84.58%. In addition, the ACC and mIoU for transverse axis image are 98.62% and 85.71% respectively. In the classification stage, CNN achieved a maximum ACC of 97.9% with transverse axis image as inputs and using consistency ***: While MR images offer a wider range of applications in disease detection compared to X-rays, the identification of con

关键词： Stability

来源：评论

学校读者我要写书评

暂无评论

Resource Scheduling for UAVs-aided D2D Networks: A Multi-objective Optimization Approach

arXiv

引用

arXiv 2023年

作者： Pan, Hongyang Liu, Yanheng Sun, Geng Wang, Pengfei Yuen, Chau College of Computer Science and Technology Jilin University Changchun130012 China Pillar Singapore University of Technology and Design Singapore487372 Singapore Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China School of Computer Science and Technology Dalian University of Technology Dalian116024 China School of Electrical and Electronics Engineering Nanyang Technological University Singapore639798 Singapore

Unmanned aerial vehicles (UAVs)-aided device-to-device (D2D) networks have attracted great interests with the development of 5G/6G communications, while there are several challenges about resource scheduling in UAVs-aided D2D networks. In this work, we formulate a UAVs-aided D2D network resource scheduling optimization problem (NetResSOP) to comprehensively consider the number of deployed UAVs, UAV positions, UAV transmission powers, UAV flight velocities, communication channels, and UAV-device pair assignment so as to maximize the D2D network capacity, minimize the number of deployed UAVs, and minimize the average energy consumption over all UAVs simultaneously. The formulated NetResSOP is a mixed-integer programming problem (MIPP) and an NP-hard problem, which means that it is difficult to be solved in polynomial time. Moreover, there are trade-offs between the optimization objectives, and hence it is also difficult to find an optimal solution that can simultaneously make all objectives be optimal. Thus, we propose a non-dominated sorting genetic algorithm-III with a Flexible solution dimension mechanism, a Discrete part generation mechanism, and a UAV number adjustment mechanism (NSGA-III-FDU) for solving the problem comprehensively. Simulation results demonstrate the effectiveness and the stability of the proposed NSGA-III-FDU under different scales and settings of the D2D networks. Copyright © 2023, The Authors. All rights reserved.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

Improved fluid search optimization-based real-time weed mapping

引用

Information Processing in Agriculture 2020年第3期7卷 403-417页

作者： Chengcheng Chen Shengsheng Wang Xianchang Wang Helong Yu Ruyi Dong College of Computer Science and Technology Jilin UniversityChangchun 130012China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun 130012China College of Information Technology Jilin Agricultural UniversityChangchun 130118China Chengdu Kestrel Artificial Intelligence Institute Chengdu 611730China

In the field of agriculture,variable-rate herbicide spraying(VRHS)technology has been used to solve the low efficiency of pesticides and crop chemical *** key of VRHS is the quick and precise identification of weeds from field images,which forms a weed *** search optimization(FSO)was able to simplify the threshold optimization process to create a weed map,which simulated the fluid flowing from high pressure to low pressure,but it is time consuming and often converges ***,an explosion mechanism and a twophase optimization were introduced to improve the FSO-based segmentation *** of segmentation weeds from a corn field at seedling growth stage showed that the IFSO algorithm obtained the best accuracy of 93.3%and the least running time of 0.019 s,compared with the standard PSO,GA,and FSO algorithms.

关键词： Variable-rate herbicide spraying Weed map Fluid search optimization algorithm Otsu

来源：评论

学校读者我要写书评

暂无评论

Fast Explainable Recommendation Model by Combining Fine-Grained Sentiment in Review Data

引用

computational Intelligence and Neuroscience 2022年第0期2022卷 4940401页

作者： Wang, Ying He, Xin Wang, Hongji Sun, Yudong Wang, Xin College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Ministry of Education Changchun130012 China College of Artificial Intelligence Jilin University Changchun130012 China

With the rapid development of e-commerce, recommendation system has become one of the main tools that assists users in decision-making, enhances user's experience, and creates economic value. Since it is difficult to explain the implicit features generated by matrix factorization, explainable recommendation system has attracted more and more attention recently. In this paper, we propose an explainable fast recommendation model by combining fine-grained sentiment in review data (FSER, (Fast) Fine-grained Sentiment for Explainable Recommendation). We innovatively construct user-rating matrix, user-aspect sentiment matrix, and item aspect-descriptive word frequency matrix from the review-based data. And the three matrices are reconstructed by matrix factorization method. The reconstructed results of user-aspect sentiment matrix and item aspect-descriptive word frequency matrix can provide explanation for the final recommendation results. Experiments in the Yelp and Public Comment datasets demonstrate that, compared with several classical models, the proposed FSER model is in the optimal recommendation accuracy range and has lower sparseness and higher training efficiency than tensor models or neural network models;furthermore, it can generate explanatory texts and diagrams that have high interpretation quality. © 2022 Ying Wang et al.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Practical two-party privacy-preserving neural network based on secret sharing

arXiv

引用

arXiv 2021年

作者： Ge, Zhengqiang Zhou, Zhipeng Guo, Dong Li, Qiang College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education Jilin University Changchun China

Neural networks, with the capability to provide efficient predictive models, have been widely used in medical, financial, and other fields, bringing great convenience to our lives. However, the high accuracy of the model requires a large amount of data from multiple parties, raising public concerns about privacy. Privacy-preserving neural network based on multi-party computation is one of the current methods used to provide model training and inference under the premise of solving data privacy. In this study, we propose a new two-party privacy-preserving neural network training and inference framework in which privacy data is distributed to two non-colluding servers. We construct a preprocessing protocol for mask generation, support and realize secret sharing comparison on 2PC, and propose a new method to further reduce the communication rounds. Based on the comparison protocol, we construct building blocks such as division and exponential, and realize the process of training and inference that no longer needs to convert between different types of secret sharings and is entirely based on arithmetic secret sharing. Compared with the previous works, our work obtains higher accuracy, which is very close to that of plaintext training. While the accuracy has been improved, the runtime is reduced, considering the online phase, our work is 5× faster than SecureML, 4.32-5.75× faster than SecureNN, and is very close to the current optimal 3PC implementation, FALCON. For secure inference, as far as known knowledge is concerned, we should be the current optimal 2PC implementation, which is 4-358× faster than other works. © 2021, CC BY.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：