期刊文献+
共找到38,798篇文章
< 1 2 250 >
每页显示 20 50 100
Evolutionary Neural Architecture Search and Its Applications in Healthcare 被引量:1
1
作者 Xin Liu Jie Li +3 位作者 Jianwei Zhao Bin Cao Rongge Yan Zhihan Lyu 《Computer Modeling in Engineering & Sciences》 SCIE EI 2024年第4期143-185,共43页
Most of the neural network architectures are based on human experience,which requires a long and tedious trial-and-error process.Neural architecture search(NAS)attempts to detect effective architectures without human ... Most of the neural network architectures are based on human experience,which requires a long and tedious trial-and-error process.Neural architecture search(NAS)attempts to detect effective architectures without human intervention.Evolutionary algorithms(EAs)for NAS can find better solutions than human-designed architectures by exploring a large search space for possible architectures.Using multiobjective EAs for NAS,optimal neural architectures that meet various performance criteria can be explored and discovered efficiently.Furthermore,hardware-accelerated NAS methods can improve the efficiency of the NAS.While existing reviews have mainly focused on different strategies to complete NAS,a few studies have explored the use of EAs for NAS.In this paper,we summarize and explore the use of EAs for NAS,as well as large-scale multiobjective optimization strategies and hardware-accelerated NAS methods.NAS performs well in healthcare applications,such as medical image analysis,classification of disease diagnosis,and health monitoring.EAs for NAS can automate the search process and optimize multiple objectives simultaneously in a given healthcare task.Deep neural network has been successfully used in healthcare,but it lacks interpretability.Medical data is highly sensitive,and privacy leaks are frequently reported in the healthcare industry.To solve these problems,in healthcare,we propose an interpretable neuroevolution framework based on federated learning to address search efficiency and privacy protection.Moreover,we also point out future research directions for evolutionary NAS.Overall,for researchers who want to use EAs to optimize NNs in healthcare,we analyze the advantages and disadvantages of doing so to provide detailed guidance,and propose an interpretable privacy-preserving framework for healthcare applications. 展开更多
关键词 Neural architecture search evolutionary computation large-scale multiobjective optimization distributed parallelism healthcare
下载PDF
Cooperative UAV search strategy based on DMPC-AACO algorithm in restricted communication scenarios 被引量:1
2
作者 Shiyuan Chai Zhen Yang +3 位作者 Jichuan Huang Xiaoyang Li Yiyang Zhao Deyun Zhou 《Defence Technology(防务技术)》 SCIE EI CAS CSCD 2024年第1期295-311,共17页
Improvement of integrated battlefield situational awareness in complex environments involving dynamic factors such as restricted communications and electromagnetic interference(EMI)has become a contentious research pr... Improvement of integrated battlefield situational awareness in complex environments involving dynamic factors such as restricted communications and electromagnetic interference(EMI)has become a contentious research problem.In certain mission environments,due to the impact of many interference sources on real-time communication or mission requirements such as the need to implement communication regulations,the mission stages are represented as a dynamic combination of several communication-available and communication-unavailable stages.Furthermore,the data interaction between unmanned aerial vehicles(UAVs)can only be performed in specific communication-available stages.Traditional cooperative search algorithms cannot handle such situations well.To solve this problem,this study constructed a distributed model predictive control(DMPC)architecture for a collaborative control of UAVs and used the Voronoi diagram generation method to re-plan the search areas of all UAVs in real time to avoid repetition of search areas and UAV collisions while improving the search efficiency and safety factor.An attention mechanism ant-colony optimization(AACO)algorithm is proposed for UAV search-control decision planning.The search strategy is adaptively updated by introducing an attention mechanism for regular instruction information,a priori information,and emergent information of the mission to satisfy different search expectations to the maximum extent.Simulation results show that the proposed algorithm achieves better search performance than traditional algorithms in restricted communication constraint scenarios. 展开更多
关键词 Unmanned aerial vehicles(UAV) Cooperative search Restricted communication Mission planning DMPC-AACO
下载PDF
Optimal search path planning of UUV in battlefeld ambush scene
3
作者 Wei Feng Yan Ma +3 位作者 Heng Li Haixiao Liu Xiangyao Meng Mo Zhou 《Defence Technology(防务技术)》 SCIE EI CAS CSCD 2024年第2期541-552,共12页
Aiming at the practical application of Unmanned Underwater Vehicle(UUV)in underwater combat,this paper proposes a battlefield ambush scene with UUV considering ocean current.Firstly,by establishing these mathematical ... Aiming at the practical application of Unmanned Underwater Vehicle(UUV)in underwater combat,this paper proposes a battlefield ambush scene with UUV considering ocean current.Firstly,by establishing these mathematical models of ocean current environment,target movement,and sonar detection,the probability calculation methods of single UUV searching target and multiple UUV cooperatively searching target are given respectively.Then,based on the Hybrid Quantum-behaved Particle Swarm Optimization(HQPSO)algorithm,the path with the highest target search probability is found.Finally,through simulation calculations,the influence of different UUV parameters and target parameters on the target search probability is analyzed,and the minimum number of UUVs that need to be deployed to complete the ambush task is demonstrated,and the optimal search path scheme is obtained.The method proposed in this paper provides a theoretical basis for the practical application of UUV in the future combat. 展开更多
关键词 Battlefield ambush Optimal search path planning UUV path Planning Probability of cooperative search
下载PDF
Enhanced Differentiable Architecture Search Based on Asymptotic Regularization
4
作者 Cong Jin Jinjie Huang +1 位作者 Yuanjian Chen Yuqing Gong 《Computers, Materials & Continua》 SCIE EI 2024年第2期1547-1568,共22页
In differentiable search architecture search methods,a more efficient search space design can significantly improve the performance of the searched architecture,thus requiring people to carefully define the search spa... In differentiable search architecture search methods,a more efficient search space design can significantly improve the performance of the searched architecture,thus requiring people to carefully define the search space with different complexity according to various operations.Meanwhile rationalizing the search strategies to explore the well-defined search space will further improve the speed and efficiency of architecture search.With this in mind,we propose a faster and more efficient differentiable architecture search method,AllegroNAS.Firstly,we introduce a more efficient search space enriched by the introduction of two redefined convolution modules.Secondly,we utilize a more efficient architectural parameter regularization method,mitigating the overfitting problem during the search process and reducing the error brought about by gradient approximation.Meanwhile,we introduce a natural exponential cosine annealing method to make the learning rate of the neural network training process more suitable for the search procedure.Moreover,group convolution and data augmentation are employed to reduce the computational cost.Finally,through extensive experiments on several public datasets,we demonstrate that our method can more swiftly search for better-performing neural network architectures in a more efficient search space,thus validating the effectiveness of our approach. 展开更多
关键词 Differentiable architecture search allegro search space asymptotic regularization natural exponential cosine annealing
下载PDF
Bridge Bidding via Deep Reinforcement Learning and Belief Monte Carlo Search
5
作者 Zizhang Qiu Shouguang Wang +1 位作者 Dan You MengChu Zhou 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2024年第10期2111-2122,共12页
Contract Bridge,a four-player imperfect information game,comprises two phases:bidding and playing.While computer programs excel at playing,bidding presents a challenging aspect due to the need for information exchange... Contract Bridge,a four-player imperfect information game,comprises two phases:bidding and playing.While computer programs excel at playing,bidding presents a challenging aspect due to the need for information exchange with partners and interference with communication of opponents.In this work,we introduce a Bridge bidding agent that combines supervised learning,deep reinforcement learning via self-play,and a test-time search approach.Our experiments demonstrate that our agent outperforms WBridge5,a highly regarded computer Bridge software that has won multiple world championships,by a performance of 0.98 IMPs(international match points)per deal over 10000 deals,with a much cost-effective approach.The performance significantly surpasses previous state-of-the-art(0.85 IMPs per deal).Note 0.1 IMPs per deal is a significant improvement in Bridge bidding. 展开更多
关键词 Contract Bridge reinforcement learning search
下载PDF
A Lightweight, Searchable, and Controllable EMR Sharing Scheme
6
作者 Xiaohui Yang Peiyin Zhao 《Computers, Materials & Continua》 SCIE EI 2024年第4期1521-1538,共18页
Electronic medical records (EMR) facilitate the sharing of medical data, but existing sharing schemes suffer fromprivacy leakage and inefficiency. This article proposes a lightweight, searchable, and controllable EMR ... Electronic medical records (EMR) facilitate the sharing of medical data, but existing sharing schemes suffer fromprivacy leakage and inefficiency. This article proposes a lightweight, searchable, and controllable EMR sharingscheme, which employs a large attribute domain and a linear secret sharing structure (LSSS), the computationaloverhead of encryption and decryption reaches a lightweight constant level, and supports keyword search andpolicy hiding, which improves the high efficiency of medical data sharing. The dynamic accumulator technologyis utilized to enable data owners to flexibly authorize or revoke the access rights of data visitors to the datato achieve controllability of the data. Meanwhile, the data is re-encrypted by Intel Software Guard Extensions(SGX) technology to realize resistance to offline dictionary guessing attacks. In addition, blockchain technology isutilized to achieve credible accountability for abnormal behaviors in the sharing process. The experiments reflectthe obvious advantages of the scheme in terms of encryption and decryption computation overhead and storageoverhead, and theoretically prove the security and controllability in the sharing process, providing a feasible solutionfor the safe and efficient sharing of EMR. 展开更多
关键词 LIGHTWEIGHT keyword search large attribute domain CONTROLLABILITY blockchain
下载PDF
Privacy-Preserving Multi-Keyword Fuzzy Adjacency Search Strategy for Encrypted Graph in Cloud Environment
7
作者 Bin Wu Xianyi Chen +5 位作者 Jinzhou Huang Caicai Zhang Jing Wang Jing Yu Zhiqiang Zhao Zhuolin Mei 《Computers, Materials & Continua》 SCIE EI 2024年第3期3177-3194,共18页
In a cloud environment,outsourced graph data is widely used in companies,enterprises,medical institutions,and so on.Data owners and users can save costs and improve efficiency by storing large amounts of graph data on... In a cloud environment,outsourced graph data is widely used in companies,enterprises,medical institutions,and so on.Data owners and users can save costs and improve efficiency by storing large amounts of graph data on cloud servers.Servers on cloud platforms usually have some subjective or objective attacks,which make the outsourced graph data in an insecure state.The issue of privacy data protection has become an important obstacle to data sharing and usage.How to query outsourcing graph data safely and effectively has become the focus of research.Adjacency query is a basic and frequently used operation in graph,and it will effectively promote the query range and query ability if multi-keyword fuzzy search can be supported at the same time.This work proposes to protect the privacy information of outsourcing graph data by encryption,mainly studies the problem of multi-keyword fuzzy adjacency query,and puts forward a solution.In our scheme,we use the Bloom filter and encryption mechanism to build a secure index and query token,and adjacency queries are implemented through indexes and query tokens on the cloud server.Our proposed scheme is proved by formal analysis,and the performance and effectiveness of the scheme are illustrated by experimental analysis.The research results of this work will provide solid theoretical and technical support for the further popularization and application of encrypted graph data processing technology. 展开更多
关键词 PRIVACY-PRESERVING adjacency query multi-keyword fuzzy search encrypted graph
下载PDF
Spatial search weighting information contained in cell velocity distribution
8
作者 马一凯 李娜 陈唯 《Chinese Physics B》 SCIE EI CAS CSCD 2024年第2期522-528,共7页
Cell migration plays a significant role in physiological and pathological processes.Understanding the characteristics of cell movement is crucial for comprehending biological processes such as cell functionality,cell ... Cell migration plays a significant role in physiological and pathological processes.Understanding the characteristics of cell movement is crucial for comprehending biological processes such as cell functionality,cell migration,and cell–cell interactions.One of the fundamental characteristics of cell movement is the specific distribution of cell speed,containing valuable information that still requires comprehensive understanding.This article investigates the distribution of mean velocities along cell trajectories,with a focus on optimizing the efficiency of cell food search in the context of the entire colony.We confirm that the specific velocity distribution in the experiments corresponds to an optimal search efficiency when spatial weighting is considered.The simulation results indicate that the distribution of average velocity does not align with the optimal search efficiency when employing average spatial weighting.However,when considering the distribution of central spatial weighting,the specific velocity distribution in the experiment is shown to correspond to the optimal search efficiency.Our simulations reveal that for any given distribution of average velocity,a specific central spatial weighting can be identified among the possible central spatial weighting that aligns with the optimal search strategy.Additionally,our work presents a method for determining the spatial weights embedded in the velocity distribution of cell movement.Our results have provided new avenues for further investigation of significant topics,such as relationship between cell behavior and environmental conditions throughout their evolutionary history,and how cells achieve collective cooperation through cell-cell communication. 展开更多
关键词 cell migration foraging efficiency random walk spatial search weight
下载PDF
Study on Joint Method of 3D Acoustic Emission Source Localization Simplex and Grid Search Scanning
9
作者 Liu Wei-jian Wang Hao-nan +4 位作者 Xiao Yang Hou Meng-jie Dong Sen-sen Zhang Zhi-zeng Lu Gao-ming 《Applied Geophysics》 SCIE CSCD 2024年第3期456-467,617,共13页
Acoustic emission(AE)source localization is a fundamental element of rock fracture damage imaging.To improve the efficiency and accuracy of AE source localization,this paper proposes a joint method comprising a three-... Acoustic emission(AE)source localization is a fundamental element of rock fracture damage imaging.To improve the efficiency and accuracy of AE source localization,this paper proposes a joint method comprising a three-dimensional(3D)AE source localization simplex method and grid search scanning.Using the concept of the geometry of simplexes,tetrahedral iterations were first conducted to narrow down the suspected source region.This is followed by a process of meshing the region and node searching to scan for optimal solutions,until the source location is determined.The resulting algorithm was tested using the artificial excitation source localization and uniaxial compression tests,after which the localization results were compared with the simplex and exhaustive methods.The results revealed that the localization obtained using the proposed method is more stable and can be effectively avoided compared with the simplex localization method.Furthermore,compared with the global scanning method,the proposed method is more efficient,with an average time of 10%–20%of the global scanning localization algorithm.Thus,the proposed algorithm is of great significance for laboratory research focused on locating rupture damages sustained by large-sized rock masses or test blocks. 展开更多
关键词 acoustic emission simplex form grid search scan locating the epicenter
下载PDF
Even Search in a Promising Region for Constrained Multi-Objective Optimization
10
作者 Fei Ming Wenyin Gong Yaochu Jin 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2024年第2期474-486,共13页
In recent years, a large number of approaches to constrained multi-objective optimization problems(CMOPs) have been proposed, focusing on developing tweaked strategies and techniques for handling constraints. However,... In recent years, a large number of approaches to constrained multi-objective optimization problems(CMOPs) have been proposed, focusing on developing tweaked strategies and techniques for handling constraints. However, an overly finetuned strategy or technique might overfit some problem types,resulting in a lack of versatility. In this article, we propose a generic search strategy that performs an even search in a promising region. The promising region, determined by obtained feasible non-dominated solutions, possesses two general properties.First, the constrained Pareto front(CPF) is included in the promising region. Second, as the number of feasible solutions increases or the convergence performance(i.e., approximation to the CPF) of these solutions improves, the promising region shrinks. Then we develop a new strategy named even search,which utilizes the non-dominated solutions to accelerate convergence and escape from local optima, and the feasible solutions under a constraint relaxation condition to exploit and detect feasible regions. Finally, a diversity measure is adopted to make sure that the individuals in the population evenly cover the valuable areas in the promising region. Experimental results on 45 instances from four benchmark test suites and 14 real-world CMOPs have demonstrated that searching evenly in the promising region can achieve competitive performance and excellent versatility compared to 11 most state-of-the-art methods tailored for CMOPs. 展开更多
关键词 Constrained multi-objective optimization even search evolutionary algorithms promising region real-world problems
下载PDF
Database Search Behaviors: Insight from a Survey of Information Retrieval Practices
11
作者 Babita Trivedi Brijender Dahiya +2 位作者 Anjali Maan Rajesh Giri Vinod Prasad 《Intelligent Information Management》 2024年第5期195-218,共24页
This study examines the database search behaviors of individuals, focusing on gender differences and the impact of planning habits on information retrieval. Data were collected from a survey of 198 respondents, catego... This study examines the database search behaviors of individuals, focusing on gender differences and the impact of planning habits on information retrieval. Data were collected from a survey of 198 respondents, categorized by their discipline, schooling background, internet usage, and information retrieval preferences. Key findings indicate that females are more likely to plan their searches in advance and prefer structured methods of information retrieval, such as using library portals and leading university websites. Males, however, tend to use web search engines and self-archiving methods more frequently. This analysis provides valuable insights for educational institutions and libraries to optimize their resources and services based on user behavior patterns. 展开更多
关键词 Information Retrieval Database search User Behavior Patterns
下载PDF
Research on Evacuation Path Planning Based on Improved Sparrow Search Algorithm
12
作者 Xiaoge Wei Yuming Zhang +2 位作者 Huaitao Song Hengjie Qin Guanjun Zhao 《Computer Modeling in Engineering & Sciences》 SCIE EI 2024年第5期1295-1316,共22页
Reducing casualties and property losses through effective evacuation route planning has been a key focus for researchers in recent years.As part of this effort,an enhanced sparrow search algorithm(MSSA)was proposed.Fi... Reducing casualties and property losses through effective evacuation route planning has been a key focus for researchers in recent years.As part of this effort,an enhanced sparrow search algorithm(MSSA)was proposed.Firstly,the Golden Sine algorithm and a nonlinear weight factor optimization strategy were added in the discoverer position update stage of the SSA algorithm.Secondly,the Cauchy-Gaussian perturbation was applied to the optimal position of the SSA algorithm to improve its ability to jump out of local optima.Finally,the local search mechanism based on the mountain climbing method was incorporated into the local search stage of the SSA algorithm,improving its local search ability.To evaluate the effectiveness of the proposed algorithm,the Whale Algorithm,Gray Wolf Algorithm,Improved Gray Wolf Algorithm,Sparrow Search Algorithm,and MSSA Algorithm were employed to solve various test functions.The accuracy and convergence speed of each algorithm were then compared and analyzed.The results indicate that the MSSA algorithm has superior solving ability and stability compared to other algorithms.To further validate the enhanced algorithm’s capabilities for path planning,evacuation experiments were conducted using different maps featuring various obstacle types.Additionally,a multi-exit evacuation scenario was constructed according to the actual building environment of a teaching building.Both the sparrow search algorithm and MSSA algorithm were employed in the simulation experiment for multiexit evacuation path planning.The findings demonstrate that the MSSA algorithm outperforms the comparison algorithm,showcasing its greater advantages and higher application potential. 展开更多
关键词 Sparrow search algorithm optimization and improvement function test set evacuation path planning
下载PDF
Research on intelligent search-and-secure technology in accelerator hazardous areas based on machine vision
13
作者 Ying-Lin Ma Yao Wang +1 位作者 Hong-Mei Shi Hui-Jie Zhang 《Nuclear Science and Techniques》 SCIE EI CAS CSCD 2024年第4期96-107,共12页
Prompt radiation emitted during accelerator operation poses a significant health risk,necessitating a thorough search and securing of hazardous areas prior to initiation.Currently,manual sweep methods are employed.How... Prompt radiation emitted during accelerator operation poses a significant health risk,necessitating a thorough search and securing of hazardous areas prior to initiation.Currently,manual sweep methods are employed.However,the limitations of manual sweeps have become increasingly evident with the implementation of large-scale accelerators.By leveraging advancements in machine vision technology,the automatic identification of stranded personnel in controlled areas through camera imagery presents a viable solution for efficient search and security.Given the criticality of personal safety for stranded individuals,search and security processes must be sufficiently reliable.To ensure comprehensive coverage,180°camera groups were strategically positioned on both sides of the accelerator tunnel to eliminate blind spots within the monitoring range.The YOLOV8 network model was modified to enable the detection of small targets,such as hands and feet,as well as larger targets formed by individuals near the cameras.Furthermore,the system incorporates a pedestrian recognition model that detects human body parts,and an information fusion strategy is used to integrate the detected head,hands,and feet with the identified pedestrians as a cohesive unit.This strategy enhanced the capability of the model to identify pedestrians obstructed by equipment,resulting in a notable improvement in the recall rate.Specifically,recall rates of 0.915 and 0.82were obtained for Datasets 1 and 2,respectively.Although there was a slight decrease in accuracy,it aligned with the intended purpose of the search-and-secure software design.Experimental tests conducted within an accelerator tunnel demonstrated the effectiveness of this approach in achieving reliable recognition outcomes. 展开更多
关键词 search and secure Machine vision CAMERA Human body parts recognition Particle accelerator Hazardous area
下载PDF
基于ElasticSearch的医疗数据检索系统的设计与实现
14
作者 汪睿 胡外光 +1 位作者 胡珊珊 周颖 《信息技术》 2024年第4期76-82,共7页
随着医疗技术的发展,医疗业务场景越加复杂,由此产生的医疗数据也越来越多,其来源复杂,结构多变,信息冗余,数据不完整。这些特性使得系统在进行检索时,无法快速、有效、精确地查询数据。为了解决这个问题,设计并实现了基于ElasticSearc... 随着医疗技术的发展,医疗业务场景越加复杂,由此产生的医疗数据也越来越多,其来源复杂,结构多变,信息冗余,数据不完整。这些特性使得系统在进行检索时,无法快速、有效、精确地查询数据。为了解决这个问题,设计并实现了基于ElasticSearch的医疗数据检索系统。该系统将医疗数据进行标准化,填补缺失值,选取合适的分词算法进行分词,将处理后的数据存入ElasticSearch中,同时使用SpringBoot构建系统应用,消耗多个医疗基础业务系统产生的数据,最终形成统一的医疗数据检索系统,给用户提供便捷、精确的查询服务。 展开更多
关键词 lasticsearch 医疗数据 文本分词 全文检索 分布式搜索
下载PDF
A Discrete Multi-Objective Squirrel Search Algorithm for Energy-Efficient Distributed Heterogeneous Permutation Flowshop with Variable Processing Speed
15
作者 Liang Zeng Ziyang Ding +1 位作者 Junyang Shi Shanshan Wang 《Computers, Materials & Continua》 SCIE EI 2024年第10期1757-1787,共31页
In the manufacturing industry,reasonable scheduling can greatly improve production efficiency,while excessive resource consumption highlights the growing significance of energy conservation in production.This paper st... In the manufacturing industry,reasonable scheduling can greatly improve production efficiency,while excessive resource consumption highlights the growing significance of energy conservation in production.This paper studies the problem of energy-efficient distributed heterogeneous permutation flowshop problem with variable processing speed(DHPFSP-VPS),considering both the minimum makespan and total energy consumption(TEC)as objectives.A discrete multi-objective squirrel search algorithm(DMSSA)is proposed to solve the DHPFSPVPS.DMSSA makes four improvements based on the squirrel search algorithm.Firstly,in terms of the population initialization strategy,four hybrid initialization methods targeting different objectives are proposed to enhance the quality of initial solutions.Secondly,enhancements are made to the population hierarchy system and position updating methods of the squirrel search algorithm,making it more suitable for discrete scheduling problems.Additionally,regarding the search strategy,six local searches are designed based on problem characteristics to enhance search capability.Moreover,a dynamic predator strategy based on Q-learning is devised to effectively balance DMSSA’s capability for global exploration and local exploitation.Finally,two speed control energy-efficient strategies are designed to reduce TEC.Extensive comparative experiments are conducted in this paper to validate the effectiveness of the proposed strategies.The results of comparing DMSSA with other algorithms demonstrate its superior performance and its potential for efficient solving of the DHPFSP-VPS problem. 展开更多
关键词 Distributed heterogeneous permutation flowshop problem squirrel search algorithm muli-objective optimization ENERGY-EFFICIENT variable processing speed
下载PDF
An Improved Artificial Rabbits Optimization Algorithm with Chaotic Local Search and Opposition-Based Learning for Engineering Problems and Its Applications in Breast Cancer Problem
16
作者 Feyza AltunbeyÖzbay ErdalÖzbay Farhad Soleimanian Gharehchopogh 《Computer Modeling in Engineering & Sciences》 SCIE EI 2024年第11期1067-1110,共44页
Artificial rabbits optimization(ARO)is a recently proposed biology-based optimization algorithm inspired by the detour foraging and random hiding behavior of rabbits in nature.However,for solving optimization problems... Artificial rabbits optimization(ARO)is a recently proposed biology-based optimization algorithm inspired by the detour foraging and random hiding behavior of rabbits in nature.However,for solving optimization problems,the ARO algorithm shows slow convergence speed and can fall into local minima.To overcome these drawbacks,this paper proposes chaotic opposition-based learning ARO(COARO),an improved version of the ARO algorithm that incorporates opposition-based learning(OBL)and chaotic local search(CLS)techniques.By adding OBL to ARO,the convergence speed of the algorithm increases and it explores the search space better.Chaotic maps in CLS provide rapid convergence by scanning the search space efficiently,since their ergodicity and non-repetitive properties.The proposed COARO algorithm has been tested using thirty-three distinct benchmark functions.The outcomes have been compared with the most recent optimization algorithms.Additionally,the COARO algorithm’s problem-solving capabilities have been evaluated using six different engineering design problems and compared with various other algorithms.This study also introduces a binary variant of the continuous COARO algorithm,named BCOARO.The performance of BCOARO was evaluated on the breast cancer dataset.The effectiveness of BCOARO has been compared with different feature selection algorithms.The proposed BCOARO outperforms alternative algorithms,according to the findings obtained for real applications in terms of accuracy performance,and fitness value.Extensive experiments show that the COARO and BCOARO algorithms achieve promising results compared to other metaheuristic algorithms. 展开更多
关键词 Artificial rabbit optimization binary optimization breast cancer chaotic local search engineering design problem opposition-based learning
下载PDF
基于Elasticsearch的挂号系统设计与实现
17
作者 曹勐琪 于泓涛 梁振 《中国医学装备》 2024年第2期109-113,共5页
目的:设计并实现基于Elasticsearch的挂号系统,解决传统挂号系统预约挂号方式单一和搜索挂号平台信息片面等问题,以满足患者日益增长的多元化和智能化就诊需求。方法:采用浏览器与服务器(B/S)架构实现挂号系统设计,前端使用有机对象描... 目的:设计并实现基于Elasticsearch的挂号系统,解决传统挂号系统预约挂号方式单一和搜索挂号平台信息片面等问题,以满足患者日益增长的多元化和智能化就诊需求。方法:采用浏览器与服务器(B/S)架构实现挂号系统设计,前端使用有机对象描述语言(NOODL)渲染界面,并通过Typescript实现函数方法和接口数据交互,Elasticsearch搜索引擎实现高效的搜索功能。后端通过基于边的云对象存储(ECOS)系统处理数据请求,并将业务数据存储在MySQL数据库中。系统包括应用层、服务层和存储层3层架构,可实现登录注册、搜索预约、链接预约、扫码预约、医生设置预约信息等功能。结果:基于Elasticsearch的挂号系统可实现线上搜索预约、医院专属链接预约、扫码预约等多种预约挂号方式,适用于Web和移动设备等多个平台。截止2023年6月,系统拥有医生219人,服务19903例患者,完成预约62737次,为患者就医节省大量时间,提高了医院运转效率。结论:基于Elasticsearch的挂号系统能够满足患者的多元化和智能化就诊需求,为患者提供全面、准确及智能的预约诊疗服务,有效提高诊疗效率。 展开更多
关键词 Elasticsearch搜索引擎 有机对象描述语言(NOODL) 搜索预约 多元化预约方式 综合性挂号平台
下载PDF
An Improved Bounded Conflict-Based Search for Multi-AGV Pathfinding in Automated Container Terminals
18
作者 Xinci Zhou Jin Zhu 《Computer Modeling in Engineering & Sciences》 SCIE EI 2024年第6期2705-2727,共23页
As the number of automated guided vehicles(AGVs)within automated container terminals(ACT)continues to rise,conflicts have becomemore frequent.Addressing point and edge conflicts ofAGVs,amulti-AGVconflict-free path pla... As the number of automated guided vehicles(AGVs)within automated container terminals(ACT)continues to rise,conflicts have becomemore frequent.Addressing point and edge conflicts ofAGVs,amulti-AGVconflict-free path planning model has been formulated to minimize the total path length of AGVs between shore bridges and yards.For larger terminalmaps and complex environments,the grid method is employed to model AGVs’road networks.An improved bounded conflict-based search(IBCBS)algorithmtailored to ACT is proposed,leveraging the binary tree principle to resolve conflicts and employing focal search to expand the search range.Comparative experiments involving 60 AGVs indicate a reduction in computing time by 37.397%to 64.06%while maintaining the over cost within 1.019%.Numerical experiments validate the proposed algorithm’s efficacy in enhancing efficiency and ensuring solution quality. 展开更多
关键词 Automated terminals multi-AGV multi-agent path finding(MAPF) conflict based search(CBS) AGV path planning
下载PDF
Improved Scatter Search Algorithm for Multi-skilled Personnel Scheduling of Ship Block Painting
19
作者 Guanglei Jiao Zuhua Jiang +1 位作者 Jianmin Niu Wenjuan Yu 《Journal of Harbin Institute of Technology(New Series)》 CAS 2024年第1期1-15,共15页
This paper focuses on the optimization method for multi-skilled painting personnel scheduling.The budget working time analysis is carried out considering the influence of operating area,difficulty of spraying area,mul... This paper focuses on the optimization method for multi-skilled painting personnel scheduling.The budget working time analysis is carried out considering the influence of operating area,difficulty of spraying area,multi-skilled workers,and worker’s efficiency,then a mathematical model is established to minimize the completion time. The constraints of task priority,paint preparation,pump management,and neighbor avoidance in the ship block painting production are considered. Based on this model,an improved scatter search(ISS)algorithm is designed,and the hybrid approximate dynamic programming(ADP)algorithm is used to improve search efficiency. In addition,the two solution combination methods of path-relinking and task sequence combination are used to enhance the search breadth and depth. The numerical experimental results show that ISS has a significant advantage in solving efficiency compared with the solver in small scale instances;Compared with the scatter search algorithm and genetic algorithm,ISS can stably improve the solution quality. Verified by the production example,ISS effectively shortens the total completion time of the production,which is suitable for scheduling problems in the actual painting production of the shipyard. 展开更多
关键词 ship painting personnel scheduling multi⁃skilled workers scatter search task constraints
下载PDF
Improving path planning efficiency for underwater gravity-aided navigation based on a new depth sorting fast search algorithm
20
作者 Xiaocong Zhou Wei Zheng +2 位作者 Zhaowei Li Panlong Wu Yongjin Sun 《Defence Technology(防务技术)》 SCIE EI CAS CSCD 2024年第2期285-296,共12页
This study focuses on the improvement of path planning efficiency for underwater gravity-aided navigation.Firstly,a Depth Sorting Fast Search(DSFS)algorithm was proposed to improve the planning speed of the Quick Rapi... This study focuses on the improvement of path planning efficiency for underwater gravity-aided navigation.Firstly,a Depth Sorting Fast Search(DSFS)algorithm was proposed to improve the planning speed of the Quick Rapidly-exploring Random Trees*(Q-RRT*)algorithm.A cost inequality relationship between an ancestor and its descendants was derived,and the ancestors were filtered accordingly.Secondly,the underwater gravity-aided navigation path planning system was designed based on the DSFS algorithm,taking into account the fitness,safety,and asymptotic optimality of the routes,according to the gravity suitability distribution of the navigation space.Finally,experimental comparisons of the computing performance of the ChooseParent procedure,the Rewire procedure,and the combination of the two procedures for Q-RRT*and DSFS were conducted under the same planning environment and parameter conditions,respectively.The results showed that the computational efficiency of the DSFS algorithm was improved by about 1.2 times compared with the Q-RRT*algorithm while ensuring correct computational results. 展开更多
关键词 Depth Sorting Fast search algorithm Underwater gravity-aided navigation Path planning efficiency Quick Rapidly-exploring Random Trees*(QRRT*)
下载PDF
上一页 1 2 250 下一页 到第
使用帮助 返回顶部