An Improved Artificial Rabbits Optimization Algorithm with Chaotic Local Search and Opposition-Based Learning for Engineering Problems and Its Applications in Breast Cancer Problem

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.

Unmanned Aerial Vehicle Inspection Routing and Scheduling for Engineering Management

Technological advancements in unmanned aerial vehicles(UAVs)have revolutionized various industries,enabling the widespread adoption of UAV-based solutions.In engineering management,UAV-based inspection has emerged as a highly efficient method for identifying hidden risks in high-risk construction environments,surpassing traditional inspection techniques.Building on this foundation,this paper delves into the optimization of UAV inspection routing and scheduling,addressing the complexity introduced by factors such as no-fly zones,monitoring-interval time windows,and multiple monitoring rounds.To tackle this challenging problem,we propose a mixed-integer linear programming(MILP)model that optimizes inspection task assignments,monitoring sequence schedules,and charging decisions.The comprehensive consideration of these factors differentiates our problem from conventional vehicle routing problem(VRP),leading to a mathematically intractable model for commercial solvers in the case of large-scale instances.To overcome this limitation,we design a tailored variable neighborhood search(VNS)metaheuristic,customizing the algorithm to efficiently solve our model.Extensive numerical experiments are conducted to validate the efficacy of our proposed algorithm,demonstrating its scalability for both large-scale and real-scale instances.Sensitivity experiments and a case study based on an actual engineering project are also conducted,providing valuable insights for engineering managers to enhance inspection work efficiency.

An Improved Bald Eagle Search Algorithm with Cauchy Mutation and Adaptive Weight Factor for Engineering Optimization

The Bald Eagle Search algorithm(BES)is an emerging meta-heuristic algorithm.The algorithm simulates the hunting behavior of eagles,and obtains an optimal solution through three stages,namely selection stage,search stage and swooping stage.However,BES tends to drop-in local optimization and the maximum value of search space needs to be improved.To fill this research gap,we propose an improved bald eagle algorithm(CABES)that integrates Cauchy mutation and adaptive optimization to improve the performance of BES from local optima.Firstly,CABES introduces the Cauchy mutation strategy to adjust the step size of the selection stage,to select a better search range.Secondly,in the search stage,CABES updates the search position update formula by an adaptive weight factor to further promote the local optimization capability of BES.To verify the performance of CABES,the benchmark function of CEC2017 is used to simulate the algorithm.The findings of the tests are compared to those of the Particle Swarm Optimization algorithm(PSO),Whale Optimization Algorithm(WOA)and Archimedes Algorithm(AOA).The experimental results show that CABES can provide good exploration and development capabilities,and it has strong competitiveness in testing algorithms.Finally,CABES is applied to four constrained engineering problems and a groundwater engineeringmodel,which further verifies the effectiveness and efficiency of CABES in practical engineering problems.

Weighted PageRank Algorithm Search Engine Ranking Model for Web Pages

As data grows in size,search engines face new challenges in extracting more relevant content for users’searches.As a result,a number of retrieval and ranking algorithms have been employed to ensure that the results are relevant to the user’s requirements.Unfortunately,most existing indexes and ranking algo-rithms crawl documents and web pages based on a limited set of criteria designed to meet user expectations,making it impossible to deliver exceptionally accurate results.As a result,this study investigates and analyses how search engines work,as well as the elements that contribute to higher ranks.This paper addresses the issue of bias by proposing a new ranking algorithm based on the PageRank(PR)algorithm,which is one of the most widely used page ranking algorithms We pro-pose weighted PageRank(WPR)algorithms to test the relationship between these various measures.The Weighted Page Rank(WPR)model was used in three dis-tinct trials to compare the rankings of documents and pages based on one or more user preferences criteria.Thefindings of utilizing the Weighted Page Rank model showed that using multiple criteria to rankfinal pages is better than using only one,and that some criteria had a greater impact on ranking results than others.

Comparison of Websites Employing Search Engine Optimization and Live Data

This study compares websites that take live data into account using search engine optimization(SEO).A series of steps called search engine optimization can help a website rank highly in search engine results.Static websites and dynamic websites are two different types of websites.Static websites must have the necessary expertise in programming compatible with SEO.Whereas in dynamic websites,one can utilize readily available plugins/modules.The fundamental issue of all website holders is the lower level of page rank,congestion,utilization,and exposure of the website on the search engine.Here,the authors have studied the live data of four websites as the real-time data would indicate how the SEO strategy may be applied to website page rank,page difficulty removal,and brand query,etc.It is also necessary to choose relevant keywords on any website.The right keyword might assist to increase the brand query while also lowering the page difficulty both on and off the page.In order to calculate Off-page SEO,On-page SEO,and SEO Difficulty,the authors examined live data in this study and chose four well-known Indian university and institute websites for this study:www.caluniv.ac.in,www.jnu.ac.in,www.iima.ac.in,and www.iitb.ac.in.Using live data and SEO,the authors estimated the Off-page SEO,On-page SEO,and SEO Difficulty.It has been shown that the Off-page SEO of www.caluniv.ac.in is lower than that of www.jnu.ac.in,www.iima.ac.in,and www.iitb.ac.in by 9%,7%,and 7%,respectively.On-page SEO is,in comparison,4%,1%,and 1%more.Every university has continued to keep up its own brand query.Additionally,www.caluniv.ac.in has slightly less SEO Difficulty compared to other websites.The final computed results have been displayed and compared.

Design and implementation of semantic search engine Smartch

To integrate reasoning and text retrieval, the architecture of a semantic search engine which includes several kinds of queries is proposed, and the semantic search engine Smartch is designed and implemented. Based on a logical reasoning process and a graphic user-defined process, Smartch provides four kinds of search services. They are basic search, concept search, graphic user-defined query and association relationship search. The experimental results show that compared with the traditional search engine, the recall and precision of Smartch are improved. Graphic user-defined queries can accurately locate the information of user needs. Association relationship search can find complicated relationships between concepts. Smartch can perform some intelligent functions based on ontology inference.

Ontology mapping approach using web search engine

A new mapping approach for automated ontology mapping using web search engines （such as Google） is presented. Based on lexico-syntactic patterns, the hyponymy relationships between ontology concepts can be obtained from the web by search engines and an initial candidate mapping set consisting of ontology concept pairs is generated. According to the concept hierarchies of ontologies, a set of production rules is proposed to delete the concept pairs inconsistent with the ontology semantics from the initial candidate mapping set and add the concept pairs consistent with the ontology semantics to it. Finally, ontology mappings are chosen from the candidate mapping set automatically with a mapping select rule which is based on mutual information. Experimental results show that the F-measure can reach 75% to 100% and it can effectively accomplish the mapping between ontologies.

A High-Performance and Flexible Chemical Structure&Data Search Engine Built on CouchDB&ElasticSearch

Computer-assisted chemical structure searching plays a critical role for efficient structure screening in cheminformatics. We designed a high-performance chemical structure & data search engine called DCAIKU, built on CouchDB and ElasticSearch engines. DCAIKU converts the chemical structure similarity search problem into a general text search problem to utilize off-the-shelf full-text search engines. DCAIKU also supports flexible document structures and heterogeneous datasets with the help of schema-less document database. Our evaluations show that DCAIKU can handle both keyword search and structural search against millions of records with both high accuracy and low latency. We expect that DCAIKU will lay the foundation towards large-scale and cost-effective structural search in materials science and chemistry research.

Scheduling in a Meta Search Engine by Genetic Algorithm

The meta search engines provide service to the users by dispensing the users' requests to the existing search engines. The existing search engines selected by meta search engine determine the searching quality. Because the performance of the existing search engines and the users' requests are changed dynamically, it is not favorable for the fixed search engines to optimize the holistic performance of the meta search engine. This paper applies the genetic algorithm (GA) to realize the scheduling strategy of agent manager in our meta search engine, GSE(general search engine), which can simulate the evolution process of living things more lively and more efficiently. By using GA, the combination of search engines can be optimized and hence the holistic performance of GSE can be improved dramatically.

Agricultural Market Name Geo-Locating System Based on an Administrative Ontology and Web Search Engine

The problem of associating the agricultural market names on web sites with their locations is essential for geographical analysis of the agricultural products. In this paper, an algorithm which employs the administrative ontology and the statistics from the search results were proposed. The experiments with 100 market names collected from web sites were conducted. The experimental results demonstrate that the algorithm proposed obtains satisfactory performance in resolving the problem above, thus the effectiveness of the method is verified.

Current Application of Search Engines and Their Developing Trend

FAN Xiao-wen School of Pharmacy, Shenyang Pharmaceutical University, Shenyang,110016The basic types of current search engines which can help users to perfume laborious information-gathering tasks on Internet is proposed. Basically, the search engines can be classified into index engine, directory engine and agent engine on WWW information service. The key technologies of web mine, automatic classifying of documents and ordering regulation of feedback information are discussed. Finally, the developing trend of search engines is pointed out by analyzing their practical application on World Wide Web.

Research on the User Interest Modeling of Personalized Search Engine

At present, how to enable Search Engine to construct user personal interest model initially, master user＇s personalized information timely and provide personalized services accurately have become the hotspot in the research of Search Engine area. Aiming at the problems of user model＇s construction and combining techniques of manual customization modeling and automatic analytical modeling, a User Interest Model （UIM） is proposed in the paper. On the basis of it, the corresponding establishment and update algorithms of User lnterest Profile （UIP） are presented subsequently. Simulation tests proved that the UIM proposed and corresponding algorithms could enhance the retrieval precision effectively and have superior adaptability.

A Novel Search Engine for Internet of Everything Based on Dynamic Prediction

In recent years, with the rapid development of sensing technology and deployment of various Internet of Everything devices, it becomes a crucial and practical challenge to enable real-time search queries for objects, data, and services in the Internet of Everything. Moreover, such efficient query processing techniques can provide strong facilitate the research on Internet of Everything security issues. By looking into the unique characteristics in the IoE application environment, such as high heterogeneity, high dynamics, and distributed, we develop a novel search engine model, and build a dynamic prediction model of the IoE sensor time series to meet the real-time requirements for the Internet of Everything search environment. We validated the accuracy and effectiveness of the dynamic prediction model using a public sensor dataset from Intel Lab.

A Cooperative Schema between Web Sever and Search Engine for Improving Freshness of Web Repository

Because the web is huge and web pages are updated frequently, the index maintained by a search engine has to refresh web pages periodically. This is extremely resource consuming because the search engine needs to crawl the web and download web pages to refresh its index, Based on present technologies of web refreshing, we present a cooperative schema between web server and search engine for maintaining freshness of web repository. The web server provides metadata defined through XML standard to describe web sites. Before updating the web page the crawler visits the meta-data files. If the meta-data indicates that the page is not modified, then the crawler will not update it. So this schema can save bandwidth resource. A primitive model based on the schema is implemented. The cost and efficiency of the schema are analyzed.

A Case Study of Search Engine on World Wide Web for Chemical Fiber Engineering

Search engine is an effective approach to promote the service quality of the World Wide Web. On terms of the analysis of search engines at home and abroad, the developing principle of search engines is given according to the requirement of Web information for chemical fiber engineering. The implementation method for the communication and dynamic refreshment of information on home page of the search engines are elaborated by using programming technology of Active Server Page 3.0 (ASP3.0). The query of chemical fiber information and automatic linking of chemical fiber Web sites can be easily realized by the developed search engine under Internet environment according to users' requirement.

Harmony search optimization applied to reservoir engineering assisted history matching

Based on the analysis of characteristics and advantages of HSO(harmony search optimization) algorithm, HSO was used in reservoir engineering assisted history matching of Kareem reservoir in Amal field in the Gulf of Suez, Egypt. HSO algorithm has the following advantages:(1) The good balance between exploration and exploitation techniques during searching for optimal solutions makes the HSO algorithm robust and efficient.(2) The diversity of generated solutions is more effectively controlled by two components, making it suitable for highly non-linear problems in reservoir engineering history matching.(3) The integration between the three components(harmony memory values, pitch adjusting and randomization) of the HSO helps in finding unbiased solutions.(4) The implementation process of the HSO algorithm is much easier. The HSO algorithm and two other commonly used algorithms(genetic and particle swarm optimization algorithms) were used in three reservoir engineering history match questions of different complex degrees, which are two material balance history matches of different scales and one reservoir history matching. The results were compared, which proves the superiority and validity of HSO. The results of Kareem reservoir history matching show that using the HSO algorithm as the optimization method in the assisted history matching workflow improves the simulation quality and saves solution time significantly.

基于Elasticsearch的挂号系统设计与实现

目的:设计并实现基于Elasticsearch的挂号系统,解决传统挂号系统预约挂号方式单一和搜索挂号平台信息片面等问题,以满足患者日益增长的多元化和智能化就诊需求。方法:采用浏览器与服务器(B/S)架构实现挂号系统设计,前端使用有机对象描述语言(NOODL)渲染界面,并通过Typescript实现函数方法和接口数据交互,Elasticsearch搜索引擎实现高效的搜索功能。后端通过基于边的云对象存储(ECOS)系统处理数据请求,并将业务数据存储在MySQL数据库中。系统包括应用层、服务层和存储层3层架构,可实现登录注册、搜索预约、链接预约、扫码预约、医生设置预约信息等功能。结果:基于Elasticsearch的挂号系统可实现线上搜索预约、医院专属链接预约、扫码预约等多种预约挂号方式,适用于Web和移动设备等多个平台。截止2023年6月,系统拥有医生219人,服务19903例患者,完成预约62737次,为患者就医节省大量时间,提高了医院运转效率。结论:基于Elasticsearch的挂号系统能够满足患者的多元化和智能化就诊需求,为患者提供全面、准确及智能的预约诊疗服务,有效提高诊疗效率。

PID Parameters for Tuning and Optimization of a Turbine EngineBased on the Simplex Search Method

A PID parameters tuning and optimization method for a turbine engine based on the simplex search method was proposed. Taking time delay of combustion and actuator into account, a simulation model of a PID control system for a turbine engine was developed. A performance index based on the integral of absolute error （IAE） was given as an objective function of optimization. In order to avoid the sensitivity that resulted from the initial values of the simplex search method, the traditional Ziegler-Nichols method was used to tune PID parameters to obtain the initial values at first, then the simplex search method was applied to optimize PID parameters for the turbine engine. Simulation results indicate that the simplex search method is a reasonable and effective method for PID controller parameters tuning and optimization.

A Feedback-Based Web Search Engine

Web search engines are very useful information service tools in the Internet. The current web search engines produce search results relating to the search terms and the actual information collected by them. Since the selections of the search results cannot affect the future ones, they may not cover most people’s interests. In this paper, feedback information produced by the user’s accessing lists will be represented by the rough set and can reconstruct the query string and influence the search results. And thus the search engines can provide self-adaptability. Key words WWW - search engine - query reconstruction - feedback CLC number TP 311. 135.4 Foundation item: Supported by the National Natural Science Fundation of China (60373066). National Grand Fundamental Research 973 Program of China (2002CB31200). Opening Foundation of State Key Laboratory of Software Engineering in Wuhan University, Opening Foundation of Jiangsu Key Laboratory of Computer Information Processing Technology in Soochow UniversityBiography: ZHANG Wei-feng (1975-), male, Ph.D. research direction: artificial intelligence, search engine, data mining, network language.

A dynamic knowledge base based search engine

Search engines have greatly helped us to find the desired information from the Internet. Most search engines use keywords matching technique. This paper discusses a Dynamic Knowledge Base based Search Engine （DKBSE）, which can expand the user＇s query using the keywords＇ concept or meaning. To do this, the DKBSE needs to construct and maintain the knowledge base dynamically via the system＇s searching results and the user＇s feedback information. The DKBSE expands the user＇s initial query using the knowledge base, and returns the searched information after the expanded query.