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

Enhancing Security in Distributed Drone-Based Litchi Fruit Recognition and Localization Systems

Computers, Materials & Continua 2025年第2期82卷 1985-1999页

作者： Liang Mao Yue Li Linlin Wang Jie Li Jiajun Tan Yang Meng Cheng Xiong Guangdong-Hong Kong-Macao Greater Bay Area Artificial Intelligence Application Technology Research Institute Shenzhen Polytechnic UniversityShenzhen518055China School of Computer Science and Software Engineering University of Science and Technology LiaoningAnshan114051China

This paper introduces an advanced and efficient method for distributed drone-based fruit recognition and localization, tailored to satisfy the precision and security requirements of autonomous agricultural operations. Our method incorporates depth information to ensure precise localization and utilizes a streamlined detection network centered on the RepVGG module. This module replaces the traditional C2f module, enhancing detection performance while maintaining speed. To bolster the detection of small, distant fruits in complex settings, we integrate Selective Kernel Attention (SKAttention) and a specialized small-target detection layer. This adaptation allows the system to manage difficult conditions, such as variable lighting and obstructive foliage. To reinforce security, the tasks of recognition and localization are distributed among multiple drones, enhancing resilience against tampering and data manipulation. This distribution also optimizes resource allocation through collaborative processing. The model remains lightweight and is optimized for rapid and accurate detection, which is essential for real-time applications. Our proposed system, validated with a D435 depth camera, achieves a mean Average Precision (mAP) of 0.943 and a frame rate of 169 FPS, which represents a significant improvement over the baseline by 0.039 percentage points and 25 FPS, respectively. Additionally, the average localization error is reduced to 0.82 cm, highlighting the model’s high precision. These enhancements render our system highly effective for secure, autonomous fruit-picking operations, effectively addressing significant performance and cybersecurity challenges in agriculture. This approach establishes a foundation for reliable, efficient, and secure distributed fruit-picking applications, facilitating the advancement of autonomous systems in contemporary agricultural practices.

关键词： Objective detection deep learning machine learning

来源：评论

学校读者我要写书评

暂无评论

African Bison Optimization Algorithm:A New Bio-Inspired Optimizer with Engineering applications

引用

Computers, Materials & Continua 2024年第10期81卷 603-623页

作者： Jian Zhao Kang Wang Jiacun Wang Xiwang Guo Liang Qi School of Science University of Science and Technology LiaoningAnshan114051China Team of Artificial Intelligence Theory and Application University of Science and Technology LiaoningAnshan114051China Department of Computer Science and Software Engineering Monmouth UniversityWest Long BranchNJ 07764USA Information and Control Engineering College Liaoning Petrochemical UniversityFushun113000China Department of Computer Science and Technology Shandong University of Science and TechnologyQingdao266590China

This paper introduces the African Bison Optimization(ABO)algorithm,which is based on biological *** is inspired by the survival behaviors of the African bison,including foraging,bathing,jousting,mating,and *** foraging behavior prompts the bison to seek a richer food source for *** bison find a food source,they stick around for a while by bathing *** jousting behavior makes bison stand out in the population,then the winner gets the chance to produce offspring in the mating *** eliminating behavior causes the old or injured bison to be weeded out from the herd,thus maintaining the excellent *** above behaviors are translated into ABO by mathematical *** assess the reliability and performance of ABO,it is evaluated on a diverse set of 23 benchmark functions and applied to solve five practical engineering problems with *** findings from the simulation demonstrate that ABO exhibits superior and more competitive performance by effectively managing the trade-off between exploration and exploitation when compared with the other nine popular metaheuristics algorithms.

关键词： Optimization metaheuristics African bison optimization engineering problems

来源：评论

学校读者我要写书评

暂无评论

Masked hybrid attention with Laplacian query fusion and tripartite sequence matching for medical image segmentation

引用

Neural Computing and applications 2025年第8期37卷 5891-5911页

作者： Ekong, Favour Yu, Yongbin Patamia, Rutherford Agbeshi Sarpong, Kwabena Ukwuoma, Chiagoziem C. Wang, Xiangxiang Ukot, Akpanika Robert Cai, Jingye School of Information and Software Engineering University of Electronic Science and Technology of China Sichuan Chengdu611731 China College of Nuclear Technology and Automation Engineering Chengdu University of Technology Sichuan Chengdu610059 China Sichuan Engineering Technology Research Center for Industrial Internet Intelligent Monitoring and Application Chengdu University of Technology Sichuan Chengdu610059 China

Medical image segmentation is pivotal in computer-aided diagnosis systems, demanding high precision and contextual understanding. Vision Transformer-based approaches have gained much attention recently due to their excellent performance and ability to capture long-range dependencies in medical images. However, research shows they suffer from inadequate multi-scale feature integration, poor object localization, and inconsistent mask predictions, leading to sub-optimal segmentation performance. This paper addresses these challenges by redefining semantic medical image segmentation through learnable object queries within an enhanced transformer framework with a masked hybrid attention querying mechanism, optimizing multi-scale feature fusion, object localization, and instance-specific segmentation. First, this study presents a novel transformer-based masked hybrid attention mechanism using Laplacian query fusion on learnable query features and incorporating a novel tripartite sequence matching technique as part of the enhanced decoder block to improve the consistency of mask predictions and optimize decoder queries. The designed hybrid multi-head self- and cross-attention mechanisms aim to selectively integrate multi-scale features, ensuring optimal feature combinations for precise segmentation. Secondly, multiple class tokens are incorporated to improve object localization and capture class-specific characteristics within the transformer framework, leveraging the transformer decoders’ ability to learn distinct instance representations. Experimental results and extensive ablation studies demonstrate the effectiveness of the proposed approach on three publicly available datasets, obtaining better segmentation results compared to various state-of-the-art approaches using various evaluation metrics. Specifically, the proposed model achieves a Dice Score of 95.25%, 92.75%, and 85.25% on LUNA, ISIC, and DRIVE datasets, respectively. © The Author(s), under exclusive licence

关键词： Laplace transforms

来源：评论

学校读者我要写书评

暂无评论

Construction of PCOS Prediction Model based on BP Neural Network 6

Construction of PCOS Prediction Model based on BP Neural Net...

引用

6th International Conference on Mobile Computing and Sustainable Informatics, ICMCSI 2025

作者： Hu, Xianqing Yadav, Amit Khan, Asif Sah, Abhishek Pratap Azam, Sami School of Computer and Software Chengdu Neusoft University Chengdu China Faculty of Science and Technology Charles Darwin University NT Australia Department of Computer Application Integral University Lucknow India School of Management Science and Engineering University of Electronic Science and Technology of China Chengdu China

ISBN: (纸本)9798331522667

Polycystic ovary syndrome (PCOS), a common endocrine-metabolic disorder affecting about 10-13% of women during reproductive age worldwide, often leads to irregular menstruation, infertility, obesity, and long-term health risks such as diabetes and cardiovascular disease. In this paper, clinical data from PCOS patients and healthy control group were collected from ten hospitals containing 37 key indicators such as age, weight, BMI, menstrual cycle, etc. BP (Back Propagation) Neural Network prediction models were constructed and compared using the collected data and the cross-validation method was used for parameter tuning. It was found that BP Neural Network performed particularly well on the test set, and both demonstrated high prediction accuracy and generalization ability which provided strong evidence for the early identification and early valuable intervention opportunities for PCOS patients. © 2025 IEEE.

关键词： Prediction models

来源：评论

学校读者我要写书评

暂无评论

Archer: Adaptive Memory Compression with Page-Association-Rule Awareness for High-Speed Response of Mobile Devices 23

Archer: Adaptive Memory Compression with Page-Association-Ru...

引用

23rd USENIX Conference on File and Storage Technologies, FAST 2025

作者： Li, Changlong Zhu, Zongwei Wang, Chao Liu, Fangming Xu, Fei Sha, Edwin H.-M. Zhou, Xuehai School of Computer Science and Technology East China Normal University China Jianghuai Advance Technology Center Hefei230026 China MoE Engineering Research Center of Hardware/Software Co-Design Technology and Application China School of Software Engineering University of Science and Technology of China Hefei230026 China Suzhou Institute for Advanced Research University of Science and Technology of China Suzhou215123 China Huazhong University of Science and Technology China Peng Cheng Laboratory China

ISBN: (纸本)9781939133458

In mobile systems, memory can be compressed page-by-page to save space. This approach is widely adopted because memory data is accessed by page. However, this paper shows that the system response speed is significantly limited by page-grained compression. In this paper, we observe that approximately a quarter of anonymous memory pages are highly correlated, even though the association is implicit. Inspired by this, we propose Archer, an association-rule-aware memory compression framework in mobile systems. Archer demonstrates that memory in mobile devices should be compressed using flexible granularity, rather than relying solely on traditional page compression. To further integrate association-rule mining techniques into system design, we redesign the LRU mechanism and propose an adaptive memory compression region. Experimental results show that the average app launching speed is 1.55x faster when enabling Archer, and the average photographic speed and frame rate increase by 1.42x and 1.31x, respectively, compared to the state-of-the-art. © 2025 FAST. All Rights Reserved.

关键词： Portable equipment

来源：评论

学校读者我要写书评

暂无评论

GIRP: Energy-Efficient QoS-Oriented Microservice Resource Provisioning via Multi-Objective Multi-Task Reinforcement Learning

引用

IEEE Transactions on Mobile Computing 2025年第7期24卷 5793-5807页

作者： Yuan, Honggang Wang, Ting Fu, Min Shi, Yuanming East China Normal University MoE Engineering Research Center of Software/Hardware Co-design Technology and Application Shanghai Key Laboratory of Trustworthy Computing Shanghai200062 China National University of Singapore Department of Electrical and Computer Engineering 117583 Singapore ShanghaiTech University School of Information Science and Technology Shanghai201210 China

Microservice architecture has revolutionized web service development by facilitating loosely coupled and independently developable components distributed as containers or virtual machines. While existing studies emphasize end-to-end latency, this paper investigates energy-efficient quality-of-service (QoS)-oriented microservice provisioning, focusing on both QoS satisfaction and power consumption (PC) conservation. We propose the Green and Intelligent Resource Provision (GIRP) architecture, integrating a data-driven energy-latency-aware resource allocation and scheduling manager to balance latency and PC. To reconcile the trade-offs involved, a dual-objective optimization problem is formulated to minimize latency and energy use by selecting proper servers, allocating CPU cores, and determining service replicas. To address challenges with discrete variables, dual objectives, and implicit mappings, we leverage a model-free deep deterministic policy gradient-based reinforcement learning algorithm. Specifically, we develop a multi-task agent via the Multi-gate Mixture-of-Experts model to simultaneously make two separate actions regarding CPU core numbers and service replica numbers, followed by a single-task agent to determine service scheduling. Extensive experiments on the DeathStarBenchmark testbed validate GIRP's effectiveness, demonstrating approximately 52% resource savings and a 43% reduction in PC compared to leading methods like Sinan, Firm, and heuristic-based algorithms. These results highlight GIRP's capability to optimize microservice orchestration by balancing end-to-end latency and power efficiency. © 2025 IEEE. All rights reserved.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

A High-capacity Information Hiding Scheme Based on Blakley Secret Sharing 4

A High-capacity Information Hiding Scheme Based on Blakley S...

引用

4th International Symposium on Artificial Intelligence and Intelligent Manufacturing, AIIM 2024

作者： Zhou, Jincheng Li, Yue Shen, Yujie Tang, Dan Cai, Hongliang Gong, Jing Bai, Ningchao School of Software Engineering Chengdu University of Information Technology Chengdu China Sichuan Province Engineering Technology Research Center of Support Software of lnformatization Application Chengdu China School of Computer Science and Engineering Sichuan University of Science & Engineering Yibin China Sichuan Provincial Big Data Technical Service Center Chengdu China

ISBN: (纸本)9798331541729

A high-capacity reversible information hiding scheme based on Blakley secret sharing is proposed to address the issues of low embedding rate and weak disaster recovery performance of images when using reversible information hiding to protect data in scenarios with large data transmission. The scheme employs Euclidean division and a two-dimensional modulus function to establish a robust mapping relationship between the secret information and the pixels of the cover image. Subsequently, the values derived from the preprocessing of the secret information are incorporated into the secret sharing method proposed by Blakley as the elements of the secret vector. The proposed scheme exploits the disaster-tolerance property of the secret sharing method and enhances the redundancy of the secret-carrying encrypted image, thereby improving the embedding rate and security of the algorithm while maintaining the security of the secret sharing. © 2024 IEEE.

关键词： Euclidean division Information hiding Modulus function Secret sharing

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Shop Scheduling Using Space-Cooperation Multi-Objective Optimization

IEEE Transactions on Sustainable Computing

引用

IEEE Transactions on Sustainable Computing 2024年第3期10卷 601-615页

作者： Ding, Jiepin Xia, Jun Yang, Yaning Zhou, Junlong Chen, Mingsong Li, Keqin East China Normal University MoE Engineering Research Center of Software/Hardware Co-Design Technology and Application Shanghai200062 China Ningxia Normal University School of Physics and Electronic Information Engineering Guyuan756500 China Nanjing University of Science and Technology School of Computer Science and Engineering Nanjing210094 China State University of New York Department of Computer Science New PaltzNY12561 United States

Since Industry 5.0 emphasizes that manufacturing enterprises should raise awareness of social contribution to achieve sustainable development, more and more meta-heuristic algorithms are investigated to save energy in manufacturing systems. Although non-dominated sorting-based meta-heuristics have been recognized as promising multi-objective optimization methods for solving the energy-efficient flexible job shop scheduling problem (EFJSP), it is hard to guarantee the quality of the Pareto front (e.g., total energy consumption, makespan) due to the lack of population diversity. This is mainly because an improper individual comparison inevitably reduces population diversity, thus limiting exploration and exploitation abilities during population updates. To achieve efficient population evolution, this paper introduces a novel space-cooperation multi-objective optimization (SCMO) method that can effectively solve EFJSP to obtain scheduling schemes with better trade-offs. By cooperatively evaluating the similarity among individuals in both the decision space and objective space, we propose a space-cooperation population update method based on a three-vector representation that can accurately eliminate repetitive individuals to derive higher-quality Pareto solutions. To further improve search efficiency, we propose a difference-driven local search, which selectively changes the positions of operations with higher differences to search for neighbors effectively. Based on the Taguchi method, we conduct experiments to obtain a suitable parameter combination of SCMO. Comprehensive experimental results show that, compared to state-of-the-art methods, our SCMO method achieves the highest HV and NR and the lowest IGD, with an average of 0.990, 0.952, and 0.001, respectively. Meanwhile, compared to traditional local search approaches, our difference-driven local search obtains twice the HV on instance Mk12 and reduces the solving time from 1521s to 475s. © 2016 IEEE.

关键词： Job shop scheduling

来源：评论

学校读者我要写书评

暂无评论

DRL-Based Time-Varying Workload Scheduling With Priority and Resource Awareness

引用

IEEE Transactions on Network and Service Management 2025年第3期22卷 2838-2852页

作者： Liu, Qifeng Fan, Qilin Zhang, Xu Li, Xiuhua Wang, Kai Xiong, Qingyu Chongqing University School of Big Data and Software Engineering Chongqing400044 China Chongqing University Key Laboratory of Dependable Service Computing in Cyber Physical Society of Ministry of Education Chongqing400044 China Nanjing University School of Electronic Science and Engineering Nanjing210023 China Haihe Laboratory of Information Technology Application Innovation Tianjin300072 China Harbin Institute of Technology School of Computer Science and Technology Weihai264209 China Shandong Key Laboratory of Industrial Network Security Weihai264209 China

With the proliferation of cloud services and the continuous growth in enterprises' demand for dynamic multi-dimensional resources, the implementation of effective strategy for time-varying workload scheduling has become increasingly significant. In this paper, we propose a deep reinforcement learning (DRL)-based method for time-varying workload scheduling, aiming to allocate resources efficiently across servers in the cluster. Specifically, we integrate a classifier and queue scorer to construct a priority queue that exploits temporal resource utilization patterns across different workload classes. Then, we design parallel graph attention layers to capture the dimensional features and temporal dynamics of cloud server cluster. Moreover, we propose a DRL algorithm to generate scheduling strategies that can adapt to dynamic environments. Validation on real-world traces from Google cluster demonstrates that our method outperforms existing approaches in key metrics of cloud server cluster management. © 2004-2012 IEEE.

关键词： Cloud platforms

来源：评论

学校读者我要写书评

暂无评论

Long-range Brain Graph Transformer 38

Long-range Brain Graph Transformer

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Yu, Shuo Jin, Shan Li, Ming Sarwar, Tabinda Xia, Feng School of Computer Science and Technology Dalian University of Technology China Ministry of Education China School of Software Dalian University of Technology China Zhejiang Institute of Optoelectronics China Zhejiang Key Laboratory of Intelligent Education Technology and Application Zhejiang Normal University China School of Computing Technologies RMIT University Australia

Understanding communication and information processing among brain regions of interest (ROIs) is highly dependent on long-range connectivity, which plays a crucial role in facilitating diverse functional neural integration across the entire brain. However, previous studies generally focused on the short-range dependencies within brain networks while neglecting the long-range dependencies, limiting an integrated understanding of brain-wide communication. To address this limitation, we propose Adaptive Long-range aware TransformER (ALTER), a brain graph transformer to capture long-range dependencies between brain ROIs utilizing biased random walk. Specifically, we present a novel long-range aware strategy to explicitly capture long-range dependencies between brain ROIs. By guiding the walker towards the next hop with higher correlation value, our strategy simulates the real-world brain-wide communication. Furthermore, by employing the transformer framework, ALERT adaptively integrates both short- and long-range dependencies between brain ROIs, enabling an integrated understanding of multilevel communication across the entire brain. Extensive experiments on ABIDE and ADNI datasets demonstrate that ALTER consistently outperforms generalized state-of-the-art graph learning methods (including SAN, Graphormer, GraphTrans, and LRGNN) and other graph learning based brain network analysis methods (including FBNETGEN, BrainNetGNN, BrainGNN, and BrainNETTF) in neurological disease diagnosis. Cases of long-range dependencies are also presented to further illustrate the effectiveness of ALTER. The implementation is available at https://***/yushuowiki/ALTER. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：