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

作者： Nguyen, Trong-The Qiao, Yu Pan, Jeng-Shyang Chu, Shu-Chuan Chang, Kuo-Chi Xue, Xingsi Dao, Thi-Kien Intelligent Information Processing Research Center Fujian University of Technology Fujian Fuzhou China Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology Fujian China College of Computer Science and Engineering Shandong University of Science and Technology Qingdao China Department of Information Technology University of Manage and Technology Haiphong Viet Nam

Metaheuristic algorithms have been applied widely for real-world problems in many fields, e.g., engineering, financial, healthcare. Bats algorithm (BA) is a recent metaheuristic algorithm with considering as a robust optimization method that can outperform existing algorithms. However, when dealing with complicated combinatorial problems such as traveling salesman problems (TSP), the BA can be fallen in a local optimum. This paper proposes a new hybridizing Parallel BA (HPBA) with a mutation in local-search to escape such its drawback scenario for TSP. A graph theory mutation method is used to embed for hybridizing BA with exploiting similarities among individuals. The proposed method is extensively evaluated in TSP with series instances of the benchmark from TSPLIB to test its performance. The compared experimental result with the previous method and the best-known solutions (B.K.S) in the literature shows that the proposed approach offers competitive results. © 2020 - IOS Press and the authors. All rights reserved.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

Improved hybrid query tree anti-collision algorithm 8th

Improved hybrid query tree anti-collision algorithm

引用

8th International Conference on computer Engineering and Networks, CENet 2018

作者： Deng, Hongwei Li, Lang Liang, Xiaoman School of Computer Science and Technology Hengyang Normal University HengyangHunan421002 China School of Information Science and Engineering Central South University ChangshaHunan410083 China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang421002 China

ISBN: (纸本)9783030146795

An improved algorithm based on the hybrid query tree (HQT) algorithm is proposed in this work. Tags are categorized according to the combined information of the highest bit of collision and second-highest bit of collision. Then, these tags are used to decide the postponement of several delayed-response time slots, to diminish the collision probability. The performance analysis results show that this algorithm is superior to the query tree (QT) and HQT algorithms. It reduces the query time and system communication traffic and improves the tag identification efficiency. © Springer Nature Switzerland AG 2020.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

On Fixed-Order Book Thickness Parameterized by the Pathwidth of the Vertex Ordering 14th

On Fixed-Order Book Thickness Parameterized by the Pathwidth...

引用

14th International Conference on Algorithmic Aspects in information and Management, AAIM 2020

作者： Liu, Yunlong Chen, Jie Huang, Jingui Wang, Jianxin Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha410081 China School of Computer Science and Engineering Central South University Changsha410083 China

ISBN: (纸本)9783030576011

Given a graph (Formula Presented) and a fixed linear order (Formula Presented) of V, the problem fixed-order book thickness asks whether there is a page assignment (Formula Presented) such that (Formula Presented) is a k-page book embedding of G. Recently, Bhore et al.(GD2019) presented an algorithm parameterized by the pathwidth of the vertex ordering (denoted by (Formula Presented)). In this paper, we first re-analyze the running time for Bhore et al.’s algorithm, and prove a bound of (Formula Presented) improving on Bhore et al.’s bound of (Formula Presented). We further show that this parameterized problem does not admit a polynomial kernel unless NP (Formula Presented) coNP/poly. Finally, we show that the general fixed-order book thickness problem, in which a budget of at most c crossings over all pages was given, admits an algorithm running in time (Formula Presented). © 2020, Springer Nature Switzerland AG.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

Fall Detection Based on Person Detection and Multi-target Tracking

Fall Detection Based on Person Detection and Multi-target Tr...

引用

IEEE International Symposium on information (IT) in Medicine and Education, ITME

作者： Teng Xu Jian Chen Zuoyong Li Yuanzheng Cai School of Electronic Electrical Engineering and Physics Fujian University of Technology Fuzhou China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control College of Computer and Control Engineering Minjiang University Fuzhou China

ISBN: (纸本)9781728194202

Recently, official statistics reported that the Chinese population aged 60 and above has been 26.402 million, which accounts for 18.70% of total population. It is urgent to develop fall detection technologies for alleviating the risk causing by falling of elder person. In this paper, we propose a real-time, high-precision, and deep learning-based fall detection method with automatic person detection and tracking. Specifically, the proposed method first improves the YOLOv3 network to more efficiently detect person and extract feature maps of the object. Then, it inputs the extracted feature maps from the YOLOv3 into a multi-target tracking network for cascade matching and IOU matching in a Deep SORT algorithm, respectively. Next, it improves YOLOv5 network to detect posture anomalies. Finally, it refines the detected posture anomalies for obtaining the final fall detection result. Experimental results show that the proposed method simultaneously improves accuracy and efficiency of the fall detection.

关键词： Deep learning Sociology Education Object detection Aging Feature extraction Real-time systems

来源：评论

学校读者我要写书评

暂无评论

Real-Time Detection of Tea Chrysanthemums in Complex Outdoor Scenes 26

Real-Time Detection of Tea Chrysanthemums in Complex Outdoor...

引用

26th International Conference on Industrial technology, ICIT 2025

作者： Zang, Siyang Shu, Lei Han, Ru Zhang, Feiya Zhang, Zhijun Deng, Der-Jiunn College of Artificial Intelligence Nanjing Agricultural University Nanjing210031 China School of Environmental Science and Engineering Guangdong University of Petrochemical Technology Guangdong Provincial Key Laboratory for Green Agricultural Production and Intelligent Equipment Maoming525000 China School of Engineering University of Lincoln LincolnLN67TS United Kingdom National Changhua University of Education Department of Computer Science and Information Engineering Changhua50007 Taiwan

ISBN: (纸本)9798331521950

Picking robots have emerged as a pivotal focus in smart agriculture, with precise target position detection being a key element for realizing robotic picking. However, detecting tea chrysanthemums presents various challenges, including their dynamic appearance, complex environmental conditions, susceptibility to occlusion and lighting variations, and the requirement for real-time embedded systems. When applied to complex outdoor scenes for Tea chrysanthemum targets, existing detection models suffer from drawbacks such as missed detections, low accuracy, and slow processing speeds. To address these challenges, we introduce YOLO-VTC (You Only Look Once-Varieties of Tea Chrysanthemum), a lightweight deep-learning model optimized for the Jetson Xavier NX platform. Detection experiments were conducted on image data capturing eight varieties of tea chrysanthemums in complex outdoor scenes collected in 2023. Results demonstrate that YOLO-VTC achieves an average accuracy of 86.60% and a peak accuracy of 97.10%, surpassing other lightweight networks with remarkable performance. Notably, the model effectively maintains a compact size of 6.58MB and has been successfully deployed on edge device platforms. © 2025 IEEE.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

A Time-Driven Cloudlet Placement Strategy for Workflow Applications in Wireless Metropolitan Area Networks

Research Square

引用

Research Square 2021年

作者： Zhang, Jianshan Li, Ming Zheng, Xianghan Hsu, Ching-Hsien College of Mathematics and Computer Science Fuzhou University Fuzhou China Fujian Provincial Key Laboratory Network Computing and Intelligent Information Processing Fuzhou China Department of Computer Science and Information Engineering Asia University Taichung Taiwan

With the rapid development of mobile technology, mobile applications have increasing requirements for computational resources, and mobile devices can no longer meet these requirements. Mobile edge computing (MEC) has emerged in this context and has brought innovation into the working mode of traditional cloud computing. By provisioning edge server placement, the computing power of the cloud centre is distributed to the edge of the network. The abundant computational resources of edge servers compensate for the lack of mobile devices and shorten the communication delay between servers and users. Constituting a specific forms of edge servers, cloudlets have been widely studied within academia and industry in recent years. However, existing studies have mainly focused on computation offloading for general computing tasks under fixed cloudlet placement positions. They ignored the impact on computation offloading results from cloudlet placement positions and data dependencies among mobile application components. In this paper, we study the cloudlet placement problem based on Workflow Applications (WAs) in Wireless Metropolitan Area Networks (WMANs). We devise a cloudlet placement strategy based on a Particle swarm optimization algorithm using Genetic algorithm operators with the Encoding Library updating mode (PGEL), which enables the cloudlet to be placed in appropriate positions. The simulation results show that the proposed strategy can obtain a near-optimal cloudlets placement scheme, and compared with other classic algorithms, this algorithm can reduce the execution time of WAs by 15.04%-44.99%. © 2021, CC BY.

关键词： computation offloading

来源：评论

学校读者我要写书评

暂无评论

A many-objective evolutionary algorithm based on rotation and decomposition

引用

Swarm and Evolutionary Computation 2021年 60卷

作者： Zou, Juan Liu, Jing Yang, Shengxiang Zheng, Jinhua Key Laboratory of Hunan Province for Internet of Things and Information Security Xiangtan University XiangtanHunan411105 China Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Information Engineering College of Xiangtan University XiangtanHunan411105 China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang421002 China School of Computer Science and Informatics De Montfort University LeicesterLE1 9BH United Kingdom

Evolutionary algorithms have shown their promise in addressing multiobjective problems (MOPs). However, the Pareto dominance used in multiobjective optimization loses its effectiveness when addressing many-objective problems (MaOPs), which are defined as having more than three objectives. This is because the Pareto dominance loses its ability to distinguish between individuals. In this paper, a many-objective evolutionary algorithm based on rotation and decomposition is proposed (MaOEA-RD) to overcome the shortcoming of insufficient selection pressure caused by the Pareto dominance. First, the coordinates system is rotated and a hyperplane is established to distinguish between the nondominated individuals. Then, a novel individual selection mechanism incorporating decomposition is adopted to maintain the diversity of the population. In order to compensate for the deficiency of the predefined reference vectors, a reference vector adjustment mechanism is proposed. Experimental studies on several well-known benchmark problems show that the proposed algorithm is competitive compared with nine state-of-the-art many-objective algorithms. © 2020 Elsevier B.V.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Automatic annotation of visual deep neural networks

arXiv

引用

arXiv 2021年

作者： Li, Ming Guo, ChenHao College of Mathematics and Computer Science Fuzhou University Fuzhou350108 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350108 China

computer vision is widely used in the fields of driverless, face recognition and 3D reconstruction as a technology to help or replace human eye perception images or multidimensional data through computers. Nowadays, with the development and application of deep neural networks, the models of deep neural networks proposed for computer vision are becoming more and more abundant, and developers will use the already trained models on the way to solve problems, and need to consult the relevant documents to understand the use of the model. The class model, which creates the need to quickly and accurately find the relevant models that you need. The automatic annotation method of visual depth neural network proposed in this paper is based on natural language processing technology such as semantic analysis, which realizes automatic labeling of model application fields. In the three top international conferences on computer vision: ICCV, CVPR and ECCV, the average correct rate of application of the papers of 72 papers reached 90%, indicating the effectiveness of the automatic labeling system. Copyright © 2021, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

JDSR-GAN: Constructing An Efficient Joint Learning Network for Masked Face Super-Resolution

arXiv

引用

arXiv 2021年

作者： Gao, Guangwei Tang, Lei Wu, Fei Lu, Huimin Yang, Jian The Institute of Advanced Technology Nanjing University of Posts and Telecommunications Nanjing China The Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou China The College of Automation Nanjing University of Posts and Telecommunications Nanjing China The Department of Mechanical and Control Engineering Kyushu Institute of Technology Kitakyushu804-8550 Japan The School of Computer Science and Technology Nanjing University of Science and Technology Nanjing China

With the growing importance of preventing the COVID-19 virus in cyber-manufacturing security, face images obtained in most video surveillance scenarios are usually low resolution together with mask occlusion. However, most of the previous face super-resolution solutions can not efficiently handle both tasks in one model. In this work, we consider both tasks simultaneously and construct an efficient joint learning network, called JDSR-GAN, for masked face super-resolution tasks. Given a low-quality face image with mask as input, the role of the generator composed of a denoising module and super-resolution module is to acquire a high-quality high-resolution face image. The discriminator utilizes some carefully designed loss functions to ensure the quality of the recovered face images. Moreover, we incorporate the identity information and attention mechanism into our network for feasible correlated feature expression and informative feature learning. By jointly performing denoising and face super-resolution, the two tasks can complement each other and attain promising performance. Extensive qualitative and quantitative results show the superiority of our proposed JDSR-GAN over some competitive methods. Copyright © 2021, The Authors. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Efficiently Retrieving Differences between Remote Sets using Counting Bloom Filter

引用

International Journal of Performability Engineering 2019年第7期15卷 1947-1954页

作者： Tian, Xiaomei Zhao, Huihuang Sun, Yaqi Liang, Xiaoman College of Computer Science and Technology Hengyang Normal University Hengyang421002 China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang421002 China

Retrieving differences between remote sets is widely used in set reconciliation and data deduplication. Set reconciliation and data deduplication between two nodes are widely used in various network applications. The basic idea of the difference retrieving problem is that each member of a node pair has an object set and seeks to find all differences between the two remote sets. There are many methods for retrieving difference sets, such as the standard Bloom filter (SBF), counting Bloom filter (CBF), and invertible Bloom filter (IBF). In these methods, based on the standard Bloom filter or its variants, each node represents its objects using a standard Bloom filter or other Bloom filter, which is then exchanged. A receiving node retrieves different objects between the two sets according to the received SBF, CBF, or IBF. We propose a new algorithm for retrieving differences that finds differences between remote sets using counting Bloom filters' deletion operation. The theoretical analyses and experimental results show that the differences can be retrieved efficiently. Only a very small number of differences are missing in the retrieving process, and this false negative rate can be decreased to 0% by adjusting the counting Bloom filter's parameters. © 2019 Totem Publisher, Inc. All rights reserved.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：