In the rescue operations the full time of action plays important role. It is a sum of planning, travel, and manipulation (in the action place) phases times. The time minimization of first two phases by autonomous vehicle for remote action is considered in the paper. For known a priori map the path planning consists of local optimal decision collected next in the general algorithm of the optimal path. Such approach significantly reduces time of path planning. The robot features and known sparse obstacles reduce the allowable robot speeds. The time of travel is calculated from allowable velocity profile. So, it can be used to estimate the travel performance. Genetic algorithm and random search-based methods for path finding with travel time optimization are exploited and compared in the paper. All the proposed time optimisation solutions of rescue operation are checked during computer simulations and results of simulation are presented.

Recent advances in quantum computing systems attract tremendous attention. Commercial companies, such as IBM, Amazon, and IonQ, have started to provide access to noisy intermediate-scale quantum computers. Researchers and entrepreneurs attempt to deploy their applications that aim to achieve a quantum speedup. Grover’s algorithm and quantum phase estimation are the foundations of many applications with the potential for such a speedup. While these algorithms, in theory, obtain marvelous performance, deploying them on existing quantum devices is a challenging task. For example, quantum phase estimation requires extra qubits and a large number of controlled operations, which are impractical due to low-qubit and noisy hardware. To fully utilize the limited onboard qubits, we develop a distributed application with a key-value data structure based on Grover’s algorithm called IQuCS . Consider a database with duplicates. By encoding each element to a binary type with a unique key and forming a key-value pair, we can count the number of occurrences of each element in the database based on quantum computing. We have optimized the operation process by filtering data points to make it more efficient. To determine the effect of this optimization, we evaluate it with datasets of different sizes and with different numbers of duplicates. With the assistance of classical computers, IQuCS can reduce the problem set for each query. Due to this reduction, IQuCS requires fewer qubits. Through the iterative management, IQuCS achieves a reduction of qubit virtualized consumption, up to 66.2%, with reasonable accuracy.

The speech entailed in human voice comprises essentially para-linguistic information used in many voice-recognition applications. Gender voice-recognition is considered one of the pivotal parts to be detected from a given voice, a task that involves certain complications. In order to distinguish gender from a voice signal, a set of techniques have been employed to determine relevant features to be utilized for building a model from a training set. This model is useful for determining the gender (i.e, male or female) from a voice signal. The contributions are involved in two folds: (i) providing analysis information about well-known voice signal features using a prominent dataset, (ii) studying various machine learning models of different theoretical families to classify the voice gender, and (iii) using three prominent feature selection algorithms to find promisingly optimal features for improving classification models. Experimental results show the importance of sub-features over others, which are vital for enhancing the efficiency of classification models performance. Experimentation reveals that the best recall value is equal to 99.97%; 99.7% of two models of Deep Learning (DL) and Support Vector Machine (SVM) and with feature selection the best recall value is 100% for SVM techniques.

Enhancing the effectiveness of search and rescue operation at sea is always a duty of utmost importance of the coastal states. The search area for distressed objects can be determined by using Monte Carlo simulation, combined with the Median-Filter. Once the search area has been identified, the success of search and rescue operations depends on the sweeping ability of search and rescue vessel at the probability area of the distress object with the minimum time. This is the important element to the success of the search and rescue operation as it minimizes the risk and cost for Search and rescue team. In this article, the authors study and propose the use of Bacterial Foraging Optimization Algorithm (BFOA) to calculate the optimal search and co-ordination route for many search and rescue vessels in Vietnam sea. The simulation results show that it is quite consistent with reality and BFOA can be effectively applied to determine a quick search.

A metering roundabout where traffic is controlled by traffic lights with phase times influenced by queue detector occupancy might be the solution to enhance performance when there are unbalanced traffic flows at roundabouts. There have, however, been minimal studies on how the distance of the queue detector from the stop line affects signal phase time durations and the queuing lengths. This research, therefore, seeks to develop a Cuckoo Search/Local search Algorithm using parameters such as arrival volumes, conflicting volumes, detector distance and phase time to investigate the relationship of signal setting, detector location and queuing formulations. Also, some additional statistical tests were performed for the fitness of the data. In order to conduct solid model validations, model output data was compared against the AIMSUN model. The results from the analyses demonstrated that the queue detector distance can affect phase time durations and vehicle queuing lengths on the controlling approach as well as queuing lengths on the metered approach. This study showed that, based on the study for the Old Belair Road roundabout in Adelaide, South Australia, the total queue length (controlling + metered) will be minimized when the detector is relocated at 209 meters from the roundabout stop line, giving longer phase green times and resulting in decreased intersection queuing lengths.

This paper presents a cooperative parallel tabu search meta-heuristic for the vehicle routing problem with time windows. It is based on the scheme in which several search threads cooperate by asynchronously exchanging information on the best solutions identified. The exchanges are performed through a mechanism called adaptive memory which holds and manages a pool of solutions. This enforces the asynchronous strategy of information exchanges and ensures the independence of the individual search threads. Each of these independent threads implements a tabu search meta-heuristic. Comprehensive computational experiments and comparisons to best known solutions show that the proposed cooperative parallel tabu search algorithm is able to achieve 48 new best solutions on VRPTW benchmark instances.

Nowadays genetic algorithm (GA) is greatly used in engineering pedagogy as an adaptive technique to learn and solve complex problems and issues. It is a meta-heuristic approach that is used to solve hybrid computation challenges. GA utilizes selection, crossover, and mutation operators to effectively manage the searching system strategy. This algorithm is derived from natural selection and genetics concepts. GA is an intelligent use of random search supported with historical data to contribute the search in an area of the improved outcome within a coverage framework. Such algorithms are widely used for maintaining high-quality reactions to optimize issues and problems investigation. These techniques are recognized to be somewhat of a statistical investigation process to search for a suitable solution or prevent an accurate strategy for challenges in optimization or searches. These techniques have been produced from natural selection or genetics principles. For random testing, historical information is provided with intelligent enslavement to continue moving the search out from the area of improved features for processing of the outcomes. It is a category of heuristics of evolutionary history using behavioral science-influenced methods like an annuity, gene, preference, or combination (sometimes refers to as hybridization). This method seemed to be a valuable tool to find solutions for problems optimization. In this paper, the author has explored the GAs, its role in engineering pedagogies, and the emerging areas where it is using, and its implementation.

The deployment of a Static Synchronous Compensator within a microgrid can facilitate voltage and reactive power regulation, leading to enhanced stability and reliability. Within a microgrid setting, a STATCOM can effectively balance power supply and demand, and mitigate voltage fluctuations caused by the intermittent nature of renewable energy sources. To ensure the successful integration of a STATCOM within a microgrid, coordinating the control system with other Distributed Energy Resources, especially when multiple control strategies are employed, can be a challenging task. Therefore, a meticulously designed control system is indispensable to guarantee the microgrid’s efficient and effective operation. The use of GA in LSTM tuning can accelerate the process of finding optimal hyperparameters for a specific task, obviating the necessity for time-consuming and computationally expensive grid search or manual tuning. This method can be particularly advantageous when handling large data sets and complex models. In this paper, an attempt has been made to model the STATCOM to communicate with the microgrid tuned using LSTM-GA for effective calculation of real and reactive power support during grid disturbances.

We have developed an application aiming at federated search for EU and Hungarian legislation and jurisdiction. It now contains above 1 million documents, with daily updates. The database holds documents downloaded from the EU sources EUR-Lex and Curia Online as well as public jurisdiction documents from the Constitutional Court of Hungary and The National Office for The Judiciary. The application is termed Justeus. Justeus provides comprehensible search possibilities. Besides free text and metadata (dropdown list) searches, it features hierarchical data structures (concept hierarchy trees) of directory codes and classification as well as subject terms. Justeus collects all links of a particular document to other documents (court judgements citing other case law documents as well as legislation, national court decisions referring to EU regulation etc.) as tables and directed graph networks. Choosing a document, its relations to other documents are visualized in real time as a network. Network graphs help in identifying key documents influencing or referred by many other documents (legislative and/or jurisdictive) and sets of documents predominantly referring to each other (citation networks).

The urgency of the COVID19 pandemic caused a surge in related scientific literature. This surge made the manual exploration of scientific articles time-consuming and inefficient. Therefore, a range of exploratory search applications have been created to facilitate access to the available literature. In this survey, we give a short description of certain efforts in this direction and explore the different approaches that they used.

The Vehicle Routing Problem (VRP) and its variants are found in many fields, especially logistics. In this study, we introduced an adaptive method to a complex VRP. It combines multi-objective optimization and several forms of VRPs with practical requirements for an urban shipment system. The optimizer needs to consider terrain and traffic conditions. The proposed model also considers customers' expectations, shipper considerations as goals, and the common goal like transportation cost. We offered compromise programming to approach the multi-objective problem by decomposing the original multi-objective problem into a minimized distance-based problem. We designed a hybrid version of the Genetic algorithm with the Local Search algorithm to solve the proposed problem. We evaluate the effectiveness of the proposed algorithm with the Tabu Search algorithm, the original Genetic algorithm on the tested dataset. The results show that our method is an effective decision-making tool for the multi-objective VRP and an effective solver for the new variation of VRP.

Flexible implementations of Monte Carlo Tree Search (MCTS), combined with domain specific knowledge and hybridization with other search algorithms, can be a very powerful for the solution of problems in complex planning. We introduce mctreesearch4j, a standard MCTS implementation written as a standard JVM library following key design principles of object oriented programming. We define key class abstractions allowing the MCTS library to flexibly adapt to any well defined Markov Decision Process or turn-based adversarial game. Furthermore, our library is designed to be modular and extensible, utilizing class inheritance and generic typing to standardize custom algorithm definitions. We demon- strate that the design of the MCTS implementation provides ease of adaptation for unique heuristics and customization across varying Markov Decision Process (MDP) domains. In addition, the implementation is reasonably performant and accurate for standard MDP’s. In addition, via the implementation of mctreesearch4j, the nuances of different types of MCTS algorithms are discussed.

A number of challenging combinatorial optimization problems in logistics, transportations, aeronautics, and astronautics can be modeled as orienteering problems (OPs). To address the classic OP and its real-world variants, a parallel adaptive local-search algorithm based on competition and evolution (Palace) is proposed in this paper. In this algorithm, the parallelism runs proper local-search metaheuristics and operators to obtain the population per generation; then the competition grades those metaheuristics and operators to highlight the outperforming and eliminate the underperforming; also, the evolution explores large solution space and reproduces the best solutions for next generation. In this manner, the parallelism, competition, and evolution are organized in an easy-to-use algorithm and enable the expansibility, adaptivity, and exploration abilities, respectively. The Palace is examined on the classic and real-world Benchmarks about the OP, the time-dependent/independent OP with time windows, and the unmanned aerial vehicle and agile earth observation satellite planning. As a result, the Palace shows good performance in applicability and effectiveness in comparison with the state-of-the-art algorithms.

The application of movement-detection sensors is crucial for understanding surface movement and tectonic activities. The development of modern sensors has been instrumental in earthquake monitoring, prediction, early warning, emergency commanding and communication, search and rescue, and life detection. There are numerous sensors currently being utilized in earthquake engineering and science. It is essential to review their mechanisms and working principles thoroughly. Hence, we have attempted to review the development and application of these sensors by classifying them based on the timeline of earthquakes, physical or chemical mechanisms of sensors, and location of sensor platforms. In this study, we analyzed all available sensor platforms that have been widely used in recent years, with satellites and UAVs being among the most used. The findings of our study will be useful for future earthquake response and relief efforts, as well as research aimed at reducing earthquake disaster risks.

In the software development process, the decision-maker (DM) has a range of problems inherent to its function. Wrong choices during software planning can bring great risk to the project. Therefore, the planning of software releases to be delivered to the customer should be well done. This is not an easy task because releases are made up of many requirements that contain complex variables that must be considered, such as precedence, cost, requirement stability, among other features that make the requirements-selection process challenging. To make this process less exhaustive, DM can use tools that facilitate this work. In software engineering, we can find fields of research specialists in this context, such as Search-Based Software Engineering (SBSE). The SBSE makes use of advanced metaheuristics to search for optimal solutions or the closest to it. In this work, we try to use another field of research to solve this same problem type, the Verbal Decision Analysis (VDA). To do this, we elaborate a workflow that will use the same source data, execute two solutions using the two search fields (SBSE and VDA) and compare the results. In the end, we evaluated and commented on the results.

The capacitated team orienteering problem with time windows (CTOPTW) is a NP-hard combinatorial optimization problem. In the CTOPTW, a set of customers is given each with a profit, a demand, a service time and a time window. A homogeneous fleet of vehicles is available for serving customers and collecting their associated profits. Each vehicle is constrained by a maximum tour duration and a limited capacity. The CTOPTW is concerned with the determination of a preset number of vehicle tours that begin and end at a depot, visit each customer no more than once while satisfying the time duration, time window and vehicle capacity constraints on each tour. The objective is to maximize the total profit collected. In this study we propose an iterated local search (ILS) algorithm to deal with the CTOPTW. ILS is a single solution based meta-heuristic that successively invokes a local search procedure to explore the solution space. A perturbation operator is used to modify the current local optimum solution in order to provide a starting solution for the local search procedure. As different problems and instances have different characteristics, the success of the ILS is highly dependent on the local search procedure, the perturbation operator(s) and the perturbation strength. The basic ILS uses a single perturbation operator and the perturbation strength remains the same during the optimization process. To address these issues, we use three different perturbation operators and a varying perturbation strength which changes as the algorithm progresses. The idea is to assign a larger perturbation strength in the early stages of the search in order to focus on exploring the search space. The perturbation strength is gradually decreased so that we focus more on exploitation. The computational results show that the proposed ILS algorithm is able to generate high quality solutions on the CTOPTW benchmark instances taken from the scientific literature, demonstrating its efficiency in terms of both the solution quality and computational time. Moreover, the proposed ILS produces 21 best known results and 5 new best solutions.

Existing one-shot neural architecture search (NAS) methods have to conduct a search over a giant super-net, which leads to the huge computational cost. To reduce such cost, in this paper, we propose a method, called FTSO, to divide the whole architecture search into two sub-steps. Specifically, in the first step, we only search for the topology, and in the second step, we search for the operators. FTSO not only reduces NAS’s search time from days to 0.68 seconds, but also significantly improves the found architecture's accuracy. Our extensive experiments on ImageNet show that within 18 seconds, FTSO can achieve a 76.4% testing accuracy, 1.5% higher than the SOTA, PC-DARTS. In addition, FTSO can reach a 97.77% testing accuracy, 0.27% higher than the SOTA, with nearly 100% (99.8%) search time saved, when searching on CIFAR10.

Aiming at the problems that are poor generalization performance, low retrieval accuracy and large time consumption of existing content-based image retrieval system, the hierarchical image retrieval method based on multi feature fusion is proposed in this paper. The retrieval accuracy rates on Corel5K, UKbeach and Holidays are 68.23(Top 1), 3.73(N-S) and 88.20(mAp), respectively. The experimental results show that the method proposed in this paper can effectively improve the deficiency of single feature retrieval and save time significantly in the premise of a small amount of loss of accuracy.

With the outbreak of the COVID-19 disease, the research community is producing unprecedented efforts dedicated to better understand and mitigate the affects of the pandemic. In this context, we review the data integration efforts required for accessing and searching genome sequences and metadata of SARS-CoV2, the virus responsible for the COVID-19 disease, which have been deposited into the most important repositories of viral sequences. Organizations that were already present in the virus domain are now dedicating special interest to the emergence of COVID-19 pandemics, by emphasizing specific SARS-CoV2 data and services. At the same time, novel organizations and resources were born in this critical period to serve specifically the purposes of COVID-19 mitigation, while setting the research ground for contrasting possible future pandemics. Accessibility and integration of viral sequence data, possibly in conjunction with the human host genotype and clinical data, are paramount to better understand the COVID-19 disease and mitigate its effects.

The full impact of COVID-19 on policing, crime and disorder is slowly being fully unraveled. However, there remains a number of areas of policing that are yet to be examined in detail. Two of these areas include the impact on the intrinsically linked, volume of police recorded intelligence reports, and the use of stop and search. In this study we examine them symbiotically and frame them in the context of the intelligence led policing model, in particular in an effort to understand how national lockdowns in the United Kingdom affected both proactive policing approaches and the underpinning intelligence cycle. To achieve this, we use data from freedom of information requests regarding the annual levels of recorded police intelligence over a 10-year period for 20 police services. To supplement this, we examine overall national monthly volumes of stop and search activity over a 5-year period. Finally, we then use a case study approach of 3 police services to further explore changes in the conduct of stop and search such as the officer defined ethnicity, grounds for search and disposal outcomes. The findings indicate that both recorded intelligence reports and stop and search increased dramatically during periods of lockdown, despite widespread decreases in crime and social mobility. Changes in proportional impact are identified for White and Black citizens, searches for controlled drugs and the no further action disposal, but these are not consistent across police services. Potential causes and implications are then discussed and again, framed within the context of the impact on the intelligence led policing model and wider policing environment.

Efficient quality evaluation provides support for the timely and good maintenance of the lane line marking. This paper searches and optimizes the back propagation(BP) network model which referred to the analytic hierarchy process(AHP) model structure, as well as the number of nodes in the middle layer network. Based on this, a comprehensive evaluation method of multi-dimensional lane line quality such as shape, color and contrast is established. The experimental results show that the parameters of the model are more simplified, and the scoring and classification results of lane lines are more accurate.

This article investigates the information matching efficiency of the sponsored auction mechanism of search engine platform by implementing consumer purchase strategy. Then we examine the incentive mechanism for sellers to report product quality truthfully under information asymmetry and the reason how product quality signal could improve information matching efficiency of the sponsored auction mechanism. Using the data collected from Baidu search engine, we empirically test the theoretical research results. Our main research finding: under information asymmetry and without product quality signal mechanism, the equilibrium of bidding rank cannot match the consumer purchase strategy at all, causing the consumer welfare to suffer double losses due to the adverse selection of sellers. In the contrast, the search engine could improve partially the information matching efficiency of the sponsored search auction mechanism by identifying the product quality signal brought by the sellers with the highest product quality. However, the search engine has no incentive to design product quality signal for sellers.

Photogrammetry involves aerial photography of the earth’s surface and subsequently processing the images to provide a more accurate depiction of the area (Orthophotography). It’s used by the Spanish Instituto Geográfico Nacional to update road cartography but requires a significant amount of manual labor due to the need to perform visual inspection of all tiled images. Deep Learning techniques (artificial neural networks with more than one hidden layer) can perform road detection but it is still unclear how to find the optimal network architecture. Our system applies grammar guided genetic programming to the search of deep neural network architectures. In this kind of evolutive algorithm all the population individuals (here candidate network architectures) are constrained to rules specified by a grammar that defines valid and useful structural patterns to guide the search process. Grammar used includes well-known complex structures (e.g. Inception-like modules) combined with a custom designed mutation operator (dynamically links the mutation probability to structural diversity). Pilot results show that the system is able to design models for road detection that obtain test accuracies similar to that reached by state of the art models when evaluated over a dataset from the Spanish National Aerial Orthophotography Plan.

Rapid search and localization for nuclear sources can be an important aspect in preventing human harm from illicit material in dirty bombs or from contamination. In the case of a single mobile radiation detector, there are numerous challenges to overcome such as weak source intensity, multiple sources, background radiation, and the presence of obstructions, i.e., a non-convex environment. In this work, we investigate the sequential decision making capability of deep reinforcement learning in the nuclear source search context. A novel neural network architecture (RAD-A2C) based on the actor critic (A2C) framework and a particle filter gated recurrent unit for localization is proposed. Performance is studied in a randomized 20 x 20 m convex and non-convex environment across a range of signal-to-noise ratio (SNR)s for a single detector and single source. RAD-A2C performance is compared to both an information-driven controller that uses a bootstrap particle filter and to a gradient search (GS) algorithm. We find that the RAD-A2C has comparable performance to the information-driven controller across SNR in a convex environment and at lower computational complexity per action. The RAD-A2C far outperforms the GS algorithm in the non-convex environment with greater than 95% median completion rate for up to seven obstructions.

Considering the significant advancements in autonomous vehicle technology, research in this field is of interest to researchers. To automatic parking, controlling steer angle, gas hatch, and brakes need to be learned. Due to the increase in the number of cars and road traffic, car parking space has decreased. Its main reason is information error. Because the driver does not receive the necessary information or receives it too late, he cannot take appropriate action against it. This paper uses two phases: the first phase, for goal coordination, was used genetic algorithms and the Cuckoo search algorithm was used to increase driver information from the surroundings. Using the Cuckoo search algorithm and considering the limitations, it increases the driver’s level of information from the environment. Also, by exchanging information through the application, it enables the information to reach the driver much more quickly and the driver reacts appropriately at the right time. The suggested protocol is called the MODM-based solution. Here, the technique is assessed through extensive simulations performed in the NS-3 environment. Based on the simulation outcomes, it is indicated that the parking system performance metrics are enhanced based on the detection rate, false-negative rate, and false-positive rate.

ABSTRACT Background Ubiquitination plays an important role in protein post-translational processes and has been found to be involved in a number of regulatory functions including proteasome degradation, DNA repair, transcription, signal transduction, endocytosis, and sorting. As the identification of ubiquitination site is critical to furthering our understanding of the mechanism of ubiquitination, various experimental and machine learning methods have been used to conduct this task. It has been an important but challenging task to improve the accuracy of ubiquitination site prediction. In this research, we explore the possibility of improving the prediction performance of machine learning by incorporating grid search in the training process. Method We developed grid search procedures for each of six widely used machine learning methods including NB, LR, DT, SVM, LASSO, and KNN, and applied them to ubiquitination site prediction using the six PCP datasets that were previously developed. For each of the ML methods, we developed a set of values for each of the tunable hyperparameters available to the method. These sets of values then can be combined to form a large grid of hyperparameter settings, and each of these settings is used in the grid search. We integrated 5-fold cross-validation in grid search to train and test ML models and applied an additional independent validation procedure by conducting a pre-training 80-20 sample split. We evaluated the performance of the six methods by comparing them side by side for each of the six datasets. We also compared the grid search results with the results that were previously published without doing grid search. To optimize the prediction performance, we trained 1.1 million ML models in total through grid search. Results We compared the overall prediction performance of these six methods, as well as their prediction performance when working with balanced vs. imbalanced data, and large-scale vs. small-scale data. From the perspective of dataset, we find that the overall performance of every PCP dataset has been significantly improved in this study compared to the previous study, with the percentage increase of the average AUC of all six datasets ranging from 7.9% (PCP-4) up to 17.0% (PCP-1). From the perspective of method, we find that three out of four methods significantly benefit from grid search comparing to their previously published non-grid search results, with the maximum AUC improvement as high as 47% (LASSO on PCP-5), 43.3% (NB on PCP-1), and 33.7% (SVM on PCP-6). SVM overall ranks number one, followed by KNN as the number two performer based on their average AUCs on all datasets. But these two also ranked the top two (KNN 76 days and SVM 15 days) in terms of the total running time that they need to do grid search. We also find that SVM, KNN, and DT tend to handle small-scale and imbalanced datasets better, while LR, and LASSO are doing well with large-scale and balanced datasets. NB is more sensitive to data imbalance while less sensitive to the size of a dataset. Conclusions Our results show that using grid search has improved the performance of ubiquitination prediction significantly. We find that the performance of a method is closely related to its hyperparameter setting and the type of data it handles. Even though SVM is on average an outperformer, none of the methods can provide the best performance for all datasets. When sufficient computing resources are well accessible, grid search is an effective way to identify both a top performing model for a machine learning method and a suitable machine learning method for a particular dataset.

There is an increasing trend that Unmanned Combat Air Vehicles (UCAVs) are employed to complete different combat missions in modern wars. This paper investigates a UCAV routing problem, which simultaneously considers the decisions for the configuration of weapons carried by the UCAV subject to its capacity and the allocation of weapons to the targets subject to their destroying requirements. An integer linear programming model is developed to formulate the problem. An adaptive large neighborhood search (ALNS) heuristic is proposed to solve the problem, in which seven neighborhood structures are designed and employed. Randomly generated instances covering the small, medium and large sizes are used to test the proposed ALNS algorithm. CPLEX is also utilized to solve the small-size instances, whose results are compared with that obtained by the ALNS algorithm. And the extensive experimental results confirm the effectiveness and superiority of the proposed ALNS algorithm.

This paper presents a new algorithm for semi-supervised action recognition using adaptive feature analysis. We model the samples of the same action as the same manifold and those of different actions as different manifolds, and integrate feature correlation mining and visual similarity mining into a joint framework. By maximizing the separability between different classes based on the labeled data, the proposed algorithm learns multiple features from labeled data and utilizes the intrinsic geometric structure of the data distribution between labeled and unlabeled data to boost the recognition. We introduce Projected Barzilai-Borwein (PBB) to train a subspace projection matrix as classifier. Extensive experiments on three benchmark datasets demonstrate that our algorithm outperforms the existing semi-supervised action recognition algorithms when there are a few labeled training samples.

This study aims to understand the temporal and spatial characteristics of public concern for "children's mental health" in China in the context of the COVID-19 epidemic. Baidu Index is a research tool to collect and analyze massive data of Chinese netizens' behaviors. Using Baidu Index as the research tool, this paper analyzes the trend and distribution of Chinese netizens' attention to "children's mental health" from December 1st, 2019 to March 20th, 2022 from three aspects of trend research, need map, and crowd portrait. The study found that since the outbreak of COVID-19, the search trend of "children's mental health" has shown a cyclical change, peak in May and valley around the Spring Festival and National Day, and stable in other periods. "Mental health", "handwritten newspaper on mental health" and "youth mental health" are the most popular buzzwords among the public. The groups concerned of "children's mental health" is mainly distributed in Guangdong, Jiangsu, Beijing, and the majority are women between 30 and 39 years old. Meanwhile, search trend for "mental health" are like that for "children's mental health." The factors influencing the search volume change of "children's mental health" include Chinese traditional holidays, Spring Festival, National Day, Chinese Mental Health Day, and policies and instructions on children's mental health issued by the PRC Ministry of Education. The public would like to know about "mental health", "handwritten newspaper on mental health" and "adolescent mental health".

Metaheuristic algorithms are widely used as optimization methods, due to their global exploration and exploitation characteristics, which obtain better results than a simple heuristic. The Stochastic Fractal Search (SFS) is a novel method inspired by the process of stochastic growth in nature and the use of the fractal mathematical concept. Considering the chaotic-stochastic diffusion property, an improved Dynamic Stochastic Fractal Search (DSFS) optimization algorithm is presented. The DSFS algorithm was tested with benchmark functions, such as the multimodal, hybrid and composite functions, to evaluate the performance of the algorithm with dynamic parameter adaptation with type-1 and type-2 fuzzy inference models. The main contribution of the article is the utilization of fuzzy logic in the adaptation of the diffusion parameter in a dynamic fashion. This parameter is in charge of creating new fractal particles, and the diversity and iteration are the input information used in the fuzzy system to control the values of diffusion.

The adoption of Machine Learning (ML) for building emulators for complex physical processes has seen an exponential rise in the recent years. While neural networks are good function approximators, optimizing the hyper-parameters of the network to reach a global minimum is not trivial, and often needs human knowl- edge and expertise. In this light, automatic ML or autoML methods have gained large interest as they automate the process of network hyper-parameter tuning. In addition, Neural Architecture Search (NAS) has shown promising outcomes for improving model performance. While autoML methods have grown in popularity for image, text and other applications, their effectiveness for high-dimensional, complex scientific datasets remains to be investigated. In this work, a data driven emulator for turbulence closure terms in the context of Large Eddy Simulation (LES) models is trained using Artificial Neural Networks and an autoML frame- work based on Bayesian Optimization, incorporating priors to jointly optimize the hyper-parameters as well as conduct a full neural network architecture search to converge to a global minima, is proposed. Additionally, we compare the effect of using different network weight initializations and optimizers such as ADAM, SGDM and RMSProp, to explore the best performing setting. Weight and function space similarities during the optimization trajectory are investigated, and critical differences in the learning process evolution are noted and compared to theory. We observe ADAM optimizer and Glorot initialization consistently performs better, while RMSProp outperforms SGDM as the latter appears to have been stuck at a local minima. Therefore, this autoML BayesOpt framework provides a means to choose the best hyper-parameter settings for a given dataset.

Foveal vision loss has been shown to reduce efficient visual search guidance due to contextual cueing by incidentally learned contexts. However, previous studies used artificial (T among L-shape) search paradigms that prevent the memorization of a target in a semantically meaningful scene. Here, we investigated contextual cueing in real-life scenes that allow explicit memory of target locations in semantically rich scenes. In contrast to the contextual cueing deficits in artificial scenes, contextual cueing in patients with age-related macular degeneration (AMD) did not differ from age-matched normal-sighted controls. We discuss this in the context of visuospatial working memory demands for which both eye-movement control in the presence of central vision loss and for memory-guided search may compete. Memory-guided search in semantically rich scenes may depend less on visuospatial working memory than search in abstract displays, potentially explaining intact contextual cueing in the former but not the latter. In a practical sense, our findings may indicate that Patients with AMD are less deficient than expected after previous lab experiments. This shows the usefulness of realistic stimuli in experimental clinical research.

A crucial role is played by personal biomedical data when it comes to maintaining proficient access to health records by patients as well as health professionals. However, it is difficult to get a unified view pertaining to health data that have been scattered across various health center/hospital sections. To be specific, health records are distributed across many places and cannot be found integrated easily. In recent years, blockchain is regarded as a promising explanation that helps to achieve individual biomedical information sharing in a secured way along with privacy preservation, because of its benefit of immutability. This research work put forwards a blockchain-based managing scheme that helps to establish interpretation improvements pertaining to electronic biomedical systems. In this scheme, two blockchain were employed to construct the base of it, where the second blockchain algorithm is used to generate a secure sequence for the hash key that generated in first blockchain algorithm. The adaptively feature enable the algorithm to use multiple data types and combine between various biomedical images and text records as well. All the data, including keywords, digital records as well as the identity of patients are private key encrypted along with keyword searching capability so as to maintain data privacy preservation, access control and protected search. The obtained results which show the low latency (less than 750 ms) at 400 requests / second indicate the ability to use it within several health care units such as hospitals and clinics.

With the development of IoT technology, various information resources, such as social resources and physical resources, are deeply integrated for different comprehensive applications. Social networking, car networking, medical services, video surveillance and other forms of IoT information Service model gradually change people's daily life. Facing the vast amounts of IoT information data, IoT search technology is used to quickly find accurate information to meet real-time search needs of users. However, IoT search requires to use a large number of user privacy Information, such as personal health information, location information, social relations information, to provide personalized services. User privacy information will meet security problems if an effective access control mechanism is missing during the IoT search process. Access control mechanism can effectively monitor the access activities of resources, and ensure authorized users to access information resources under legitimate conditions. This survey examines the growing literature on access control for IoT search. Problems and challenges of access control mechanism are analyzed to facilitate the adoption of access control solutions in real-life settings. This paper aims to provides theoretical, methodological and technical guidance for IoT search access control mechanism in large-scale dynamic heterogeneous environment. Based on the literature study, we also analyzed future development direction of access control in the age of IoT.

In recent decades, attention has been directed at anemia classification for various medical purposes, such as thalassemia screening and predicting iron deficiency anemia (IDA). In this study, a new method has been successfully tested for discrimination between IDA and β-thalassemia trait (β-TT). The method is based on a Dynamic Harmony Search (DHS). Complete blood count (CBC), a fast and inexpensive laboratory test, is used as the input of the system. Other models, such as a genetic programming method called structured representation on genetic algorithm in non-linear function fitting (STROGANOFF), an artificial neural network (ANN), an adaptive neuro-fuzzy inference system (ANFIS), a support vector machine (SVM), k-nearest neighbor (KNN), and certain traditional methods, are compared with the proposed method.

University course scheduling (UCS) is one of the most important and time-consuming issues that all educational institutions face yearly. Most of the existing techniques to model and solve UCS problems have applied approximate methods, which are different in terms of efficiency, performance, and optimization speed. Accordingly, this research aims to apply an exact optimization method to provide an optimal solution to the course scheduling problem. In other words, in this research, an integer programming model is presented to solve the USC problem. In this model, hard and soft constraints include the facilities of classrooms, courses of different levels and compression of students' curriculum, courses outside the faculty and planning for them, and the limited time allocated to the professors. The objective is to maximize the weighted sum of allocating available times to professors based on their preferences in all periods. To evaluate the presented model's feasibility, it is implemented using the GAMS software. Finally, the presented model is solved in a larger dimension using a real data set from a college in China and compared with the current program in the same college. The obtained results show that considering the mathematical model's constraints and objective function, the faculty courses' timetable is reduced from 4 days a week to 3 working days. Moreover, master courses are planned in two days, and the courses in the educational groups do not interfere with each other. Furthermore, by implementing the proposed model for the real case study, the maximum teaching hours of the professors are significantly reduced. The results demonstrate the efficiency of the proposed model and solution method in terms of optimization speed and solution accuracy.

Maritime search and rescue is a crucial component of the national emergency response system, which currently mainly relies on Unmanned Aerial Vehicles (UAVs) to detect the objects. Most traditional object detection methods focus on boosting the detection accuracy while neglecting the detection speed of the heavy model. However, it is also essential to improve the detection speed which can provide timely maritime search and rescue. To address the issues, we propose a lightweight object detector named Shuffle-GhostNet-based detector (SG-Det). First, we construct a lightweight backbone, named Shuffle-GhostNet, which enhances the information flow between channel groups by redesigning the correlation group convolution and introducing the channel shuffle operation. Second, we propose an improved feature pyramid model, namely BiFPN-tiny, which has a lighter structure while being capable of reinforcing small object features. Furthermore, we incorporate the atrous spatial pyramid pooling module (ASPP) to the network, which employs atrous convolution with different sampling rates to obtain multi-scale information. Finally, we generate three sets of bounding boxes at different scales – large, medium, and small – to detect objects of different sizes. Compared with other lightweight detectors, SG-Det achieves better tradeoffs across performance metrics, and enables real-time detection with an accuracy rate of over 90% for maritime objects, which shows that it can be better meet the actual requirements of maritime search and rescue.

A thermal load dispatch problem minimizes the number of objectives viz operating cost and emission of gaseous pollutants together while allocating the power demand among the committed generating units subject to physical and technological system constraints. A stochastic thermal load dispatch problem is undertaken while taking into consideration, the uncertainties, errors in data measurements and nature of load demand which is random. Owing to uncertain load demand, variance due to mismatch of power demand termed as risk, is considered as another conflicting objective to be minimized. Generally multiobjective problems generate a set of non-inferior solutions are generated and supplied to a decision maker to select the best solution from the set of non-inferior solutions. This paper proposes opposition-based greedy heuristic search (OGHS) method to generate a set of non-inferior solutions. Opposition-based learning is applied to generate initial population to select good candidates. Migration to maintain diversity in the set of feasible solutions is also based on opposition-based learning. Mutation strategy is implemented by perturbing the genes heuristically in parallel and better one solution is sought for each member. Feasible solutions are achieved heuristically by modifying the generation-schedules in such a manner that violation of operating generation limits are avoided. The OGHS method is simple to implement and provides global solutions derived from the randomness of the population generated without tuning of parameters. Decision maker exploits fuzzy membership functions to decide the final decision. Validity of the method has been demonstrated by analysing systems in different scenarios consisting of six generators and forty generators.

This work presents a multi-start algorithm for solving the capacitated vehicle routing problem with two-dimensional loading constraints (2L-CVRP) allowing for the rotation of goods. Researches dedicated to graph theory and symmetry considered the vehicle routing problem as a classical application. This problem has complex aspects that stimulate the use of advanced algorithms and symmetry in graphs. The use of graph modeling of the 2L-CVRP problem by undirected graph allowed the high performance of the algorithm. The developed algorithm is based on metaheuristics such as the Constructive Genetic Algorithm (CGA), to construct promising initial solutions; a Tabu Search (TS), to improve the initial solutions on the routing problem; and a Large Neighborhood Search (LNS), for the loading subproblem. Although each one of these algorithms allowed to solve parts of the 2L-CVRP, the combination of these three algorithms to solve this problem was unprecedented in the scientific literature. In our approach, a parallel mechanism for checking the loading feasibility of routes was implemented using multi-threading programming to improve the performance. Additionally, memory structures, like hash-tables, were implemented to save time by storing and querying previously evaluated results for the loading feasibility of routes. For benchmarks, tests were done on well-known instances available in the literature. The results proved that the framework matched or outperformed most of the previous approaches. As the main contribution, this work brings higher quality solutions for large-size instances of the pure CVRP. This paper involves themes related to the symmetry journal, mainly complex algorithms, graphs, search strategies, complexity, graph modeling, and genetic algorithms. In addition, the paper especially focuses on topic-related aspects of special interest of the community involved in symmetry studies, such as, graph algorithms and graph theory.

Recent studies suggest that the developmental curves in adolescence, related to the development of executive functions, could be fitted to a non-linear trajectory of development with progressions and retrogressions. Therefore, the present study proposes to analyze the pattern of development in Perceptual Inhibition (PI), considering all stages of adolescence (early, middle, and late) in intervals of one year. To this aim, we worked with a sample of 275 participants between 10 and 25 years, who performed a joint visual and search task (to measure PI). We have fitted exGaussian functions to the probability distributions of the mean response time across the sample and performed a covariance analysis (ANCOVA). The results showed that the 10- to 13-year-old groups performed similarly in the task and differ from the 14- to 19-year-old participants. We found significant differences between the older group and all the rest of the groups. We discuss the important changes that can be observed in relation to the nonlinear trajectory of development that would show the PI during adolescence.

Early prediction of thermal loads plays an essential role in analyzing energy-efficient buildings' energy performance. On the other hand, stochastic algorithms have recently shown high proficiency in dealing with this issue. These are the reasons that this work is dedicated to evaluating an innovative hybrid method for predicting the cooling load (CL) in buildings with residential usage. The proposed model is a combination of artificial neural networks and stochastic fractal search (SFS-ANN). Two benchmark algorithms, namely the grasshopper optimization algorithm (GOA) and firefly algorithm (FA), are also considered to be compared with the SFS. The non-linear effect of eight independent factors on the CL is analyzed using each model's optimal structure. Evaluation of the results outlined that all three metaheuristic algorithms (with more than 90 % correlation) can adequately optimize the ANN. In this regard, this tool's prediction error declined by nearly 23, 18, and 36 % by applying the GOA, FA, and SFS techniques. Also, all used accuracy criteria indicated the superiority of the SFS over the benchmark schemes. Therefore, it is inferred that utilizing the SFS along with ANN provides a reliable hybrid model for the early prediction of CL.

In the present-day digital landscape, websites have increasingly relied on digital marketing practices, notably search engine optimization (SEO), as a vital component in promoting sustainable growth. The traffic a website receives directly determines its development and success. As such, website owners frequently engage the services of SEO experts to enhance their website's visibility and increase traffic. These specialists employ premium SEO audit tools that crawl the website's source code to identify structural changes necessary to comply with specific ranking criteria, commonly called SEO factors. Working collaboratively with developers, SEO specialists implement technical changes to the source code and await the results. The cost of purchasing premium SEO audit tools or hiring an SEO specialist typically ranges in the thousands of dollars per year. Against this backdrop, this research endeavors to provide an open-source Python-based Machine Learning SEO software tool to the general public, catering to the needs of both website owners and SEO specialists. The tool analyzes the top-ranking websites for a given search term, assessing their on-page and off-page SEO strategies, and provides recommendations to enhance a website's performance to surpass its competition. The tool yields remarkable results, boosting average daily organic traffic from 10 to 143 visitors.

The telomerase RNA in yeasts is large, usually >1000 nt, and contains functional elements that have been extensively studied experimentally in several disparate species. Nevertheless, they are very difficult to detect by homology-based methods and so far have escaped annotation in the majority of the genomes of Saccharomycotina. This is a consequence of sequences that evolve rapidly at nucleotide level, are subject to large variations in size, and are highly plastic with respect to their secondary structures. Here we report on a survey that was aimed at closing this gap in RNA annotation. Despite considerable efforts and the combination of a variety of different methods, it was only partially successful. While 27 new telomerase RNAs were identified, we had to restrict our efforts to the subgroup Saccharomycetacea because even this narrow subgroup was diverse enough to require different search models for different phylogenetic subgroups. More distant branches of the Saccharomycotina still remain without annotated telomerase RNA.

Automatic recognition methods for non-stationary EEG data collected from EEG sensors play an essential role in neurological detection. The integrative approaches proposed in this study consists of Symlet wavelet processing, a gradient boosting machine, and a grid search optimizer for a three-level classification scheme for normal subjects, intermittent epilepsy, and continuous epilepsy. Fourth-order Symlet wavelets were adopted to decompose the EEG data into five time-frequency sub-bands, whose statistical features were computed and used as classification features. The grid search optimizer was used to automatically find the optimal parameters for training the classifier. The classification accuracy of the gradient boosting machine was compared with that of a support vector machine and a random forest classifier constructed according to previous descriptions. Multiple-index were used to evaluate the Symlet wavelet transform-gradient boosting machine-grid search optimizer classification scheme, which provided better classification accuracy and detection effectiveness than has recently reported in other work on three-level classification of EEG data.

Reasonable trajectory planning is the precondition for the parafoil airdrop system to achieve autonomous accurate homing and safe landing. In order to successfully realize the self-homing of the parafoil airdrop system, a new trajectory optimization design scheme is proposed in this paper. The scheme is based on the parafoil's unique flight and control characteristics and adopts a segmented homing design. Compared with the current common trajectory design method, its core feature is to avoid the problem that the straight-line flight distance before landing is limited by the radius of the height-reducing area and ensure landing accuracy and safety. Firstly, the different starting states of the parafoil airdrop system and the landing requirements were comprehensively considered, and the homing trajectory is reasonably segmented. Based on the requirements of energy control, stable flight, and landing accuracy, the optimal objective function of the trajectory was established, and the trajectory parameters, calculation methods, and constraints were given. Secondly, the cuckoo search algorithm was applied to optimize the objective function to obtain the final home trajectory. Finally, the trajectory planning under different airdrop conditions was simulated and verified. The results showed that the planned trajectories could reach the target point accurately and meet the flight direction requirements, proving the proposed scheme's correctness and feasibility.

Searching for neutrinoless double beta decay is a top priority in particle and astroparticle physics, being the most sensitive test of lepton number violation and the only suitable process to probe the Majorana nature of neutrinos. In order to increase the experimental sensitivity for this particular search, ton-scale detectors operated at nearly zero-background conditions with a few keV energy resolution are required. In this scenario, cryogenic detectors have proven effective in addressing many of these issues simultaneously. After long technical developments, the CUORE experiment established the possibility to operate large scale detectors based on this technology. Parallel studies pointed out that scintillating cryogenic detectors represent a suitable upgrade for the CUORE design, directed towards higher sensitivities. In this work, we review the recent development of cryogenic detectors, starting from the status of the art and outlying the path toward next-generation experiments.

Image registration has an imperative role in medical imaging. In this work, a grey-wolf optimizer (GWO) based non-rigid demons registration is proposed to support the retinal image registration process. A comparative study of the proposed GWO-based demons registration framework with cuckoo search, firefly algorithm, and particle swarm optimization- based demons registration is conducted. In addition, a comparative analysis of different demons registration methods, such as Wang’s demons, Tang’s demons, and Thirion’s demons which are optimized using the proposed GWO is carried out. The results established the superiority of the GWO-based framework which achieved 0.9977 correlation, and fast processing compared to the use of the other optimization algorithms. Moreover, GWO-based Wang’s demons performed better accuracy compared to the Tang’s demons and Thirion’s demons framework. It also achieved the best less registration error of 8.36×10^-5.

Protein-DNA interactions are critical for the successful functioning of all natural systems. The key role in these interactions is played by processes of protein search for specific sites on DNA. Although it has been studied for many years, only recently microscopic aspects of these processes became more clear. In this work, we present a review on current theoretical understanding of the molecular mechanisms of the protein target search. A comprehensive discrete-state stochastic method to explain the dynamics of the protein search phenomena is introduced and explained. Our theoretical approach utilizes a first-passage analysis and it takes into account the most relevant physical-chemical processes. It is able to describe many fascinating features of the protein search, including unusually high effective association rates, high selectivity and specificity, and the robustness in the presence of crowders and sequence heterogeneity.

We present information theoretic search strategies for single and multi-robot teams to localize the source of biochemical contaminants in turbulent flows. The robots synthesize the information provided by sporadic and intermittent sensor readings to optimize their exploration strategy. By leveraging the spatio-temporal sensing capabilities of a mobile sensing network, our strategies result in control actions that maximize the information gained by the team while optimizing the time spent localizing the position of the biochemical source. By leveraging the team's ability to obtain simultaneous measurements at different locations, we show how a multi-robot team is able to speed up the search process resulting in a collaborative information theoretic search strategy. We validate our proposed strategies in both simulations and experiments.

Navigation systems are considered as a fast and efficient source of road information to drivers. However, they can distract drivers with more potential accidents on the road. This study examined the effect of navigation systems on driver distraction and visual search while driving in different driving conditions. An eye-tracking system was used to collect visual search data from twenty young drivers while using a driving simulator. Several factors were investigated, including the driving environment (urban and rural), the illumination level (day and night), and the display of the navigation system (large and small) as well as their interactions. Several measures related to eye movements were used in this experiment, including percentage of total Global Positioning System (GPS) fixation duration, average duration of GPS fixation, GPS fixation frequency, the percentage of total dwell duration for the road ahead, the frequency of dwelling on the mirrors and driver’s right and left side windows, and the percentage of dwellings on the mirrors and driver’s right and left side windows. Statistical analysis of the collected data was performed with repeated measures analysis of variance (ANOVA). The experiment revealed that the small GPS display creates more distraction in terms of average gaze duration and total gaze duration. Moreover, daytime driving conditions increase distraction. Regarding the driver’s visual search, the study showed that the visual search area is wider and more spread out during the day, which leads to better driving performance. This study will compare small and large navigation displays to determine which one is more effective in reducing driver distractions, and contribute to understanding driver distraction and visual search while using the navigation system display.

This paper considers the application of two selected algorithms (Cuckoo Search CS, Firefly Algorithm FA) to determine and maximize the reliability of a two complex system known from the literature. This system operates with resource constraints. In addition, several classical methods for determining the reliability of systems have been applied. Although the CS algorithm is known for its effectiveness as it uses the Lévy flight, for the presented optimization tasks the FA firefly algorithm in the considered parameter range proved to be more effective. The presented results broaden the existing discussion on the application of nature-inspired algorithms for solving RRAP (Reliability Redundancy Allocation Problem) problems. From this point of view, two described test scenarios can be considered as a suitable tool for validating other algorithms in RRAP problems. Not only the values of the criterion functions can be compared, but also other introduced parameters and statistical analyse of variance (ANOVA) with post-hoc RIR Tuckey test was discussed.

In laser-assisted milling, higher temperature in shear zone softens the material potentially resulting in a shift of mean residual stress, which significantly affects the damage tolerance and fatigue performance of product. In order to guide the selection of laser and cutting parameters based on the preferred mean residual stress, inverse analysis is conducted by predicting residual stress based on guessed process parameters, which is defined as the forward problem, and applying iterative gradient search to find process parameters for next iteration, which is defined as the inverse problem. An analytical inverse analysis is therefore proposed for the mean residual stress in laser-assisted milling. The forward problem is solved by analytical prediction of mean residual stress after laser-assisted milling. The residual stress profile is predicted through the calculation of thermal stress, by treating laser beam as heat source, and plastic stress by first assuming pure elastic stress in loading process, then obtaining true stress with kinematic hardening followed by the stress relaxation. The variance-based recursive method is applied to solve inverse problem by updating process parameters to match the measured mean residual stress. Three cutting parameters including depth of cut, feed per tooth, and cutting speed, and two laser parameters including laser-tool distance and laser power, are updated with respected to the minimization of resulting residual stress and measurement in each iteration. Experimental measurements are referred on the laser-assisted milling of Ti-6Al-4V grade 5 and ELI. The percentage difference between experiments and predictions is less than 5% for both materials, and the selection is completed within 50 loops.

The deformation monitoring information of concrete dams contains some high-frequency com-ponents, and the high-frequency components are strongly nonlinear, which reduces the accuracy of dam deformation prediction. In order to solve such problems, this paper proposes a concrete dam deformation monitoring model based on empirical mode decomposition (EMD) combined with wavelet threshold noise reduction and sparrow search algorithm (SSA) optimization of long short-term memory network (LSTM). The model uses EMD combined with wavelet threshold to decompose and denoise the measured deformation data. On this basis, the LSTM model based on SSA optimization is used to mine the nonlinear function relationship between the reconstructed monitoring data and various influencing factors. The example analysis shows that the model has good calculation speed, fitting and prediction accuracy and it can effectively mine the date char-acteristics inherent in the measured deformation, and reduce the influence of noise components on the modeling accuracy.

In this paper, we look at how Artificial Swarm Intelligence can evolve using evolutionary algorithms that try to minimize the sensory surprise of the system. We will show how to apply the free-energy principle, borrowed from statistical physics, to quantitatively describe the optimization method (sensory surprise minimization), which can be used to support lifelong learning. We provide our ideas about how to combine this optimization method with evolutionary algorithms in order to boost the development of specialized Artificial Neural Networks, which define the proprioceptive configuration of particular robotic units that are part of a swarm. We consider how optimization of the free-energy can promote the homeostasis of the swarm system, i.e. ensures that the system remains within its sensory boundaries throughout its active lifetime. We will show how complex distributed cognitive systems can be build in the form of hierarchical modular system, which consists of specialized micro-intelligent agents connected through information channels. We will also consider the co-evolution of various robotic swarm units, which can result in development of proprioception and a comprehensive awareness of the properties of the environment. And finally, we will give a brief outline of how this system can be implemented in practice and of our progress in this area.

Color can direct visual attention to specific locations through bottom-up and top-down mechanisms. Using Continuous Flash Suppression (CFS) as way to investigate the factors that gate access to consciousness, the current study investigated whether color also directly affected the timing of conscious perception. Low or high spatial frequency (SF) gratings with different orientations were shown as targets to the non-dominant eye of human participants. CFS patterns were presented at a rate of 10Hz to the dominant eye to delay conscious perception of the targets, and participants had the task to report the target’s orientation as soon as they could see it. With low-SF targets, two types of color-based effects became evident. First, when the targets and the CFS patterns had different colors, the targets entered consciousness faster than in trials where the targets and CFS patterns had the same color. Second, when participants searched for a specific target color, targets that matched these search settings entered consciousness faster compared to conditions where the target color was irrelevant and could vary from trial to trial. Thus, the current study demonstrates that color is a central feature of human perception and leads to faster conscious perception of visual stimuli through bottom-up and top-down attentional mechanisms.

The influence of neutrosophy in the previous period is constantly growing in many areas of science and technology. Moreover, various applications of the neutrosophic approach have become more common in recent years. Our goal in this research is to utilize the neutrosophy to improve the performance of the Dai-Liao conjugate gradient (CG) method. Specifically, in this research, we propose and investigate a new neutrosophic logic system to calculate the key parameter t involved in the Dai–Liao CG iterations. Theoretical analysis and numerical experience indicate that the efficiency and robustness of the new rule for determining t. Combining the neutrosophy and the Dai-Liao conjugate gradient method, we propose and explore a new Dai-Liao CG iterations for solving large-scale unconstrained optimization models. The global convergence is established under common assumptions and the backtracking line search. Finally, by conducting numerical experiments, computational evidence demonstrates that the new fuzzy neutrosophic Dai-Liao conjugate gradient method is computationally effective and robust.

Election Algorithm (EA) is a powerful metaheuristics model motivated by phenomena of the socio-political mechanism of the presidential election conducted in many countries. EA is selected as a topic of discussion due to its capability and robustness to carry out complex problems in the random-2SAT logic program. This paper utilizes a hybridized EA assimilated with the Hopfield neural network (HNN) in carrying out random logic program (HNN-R2SATEA). The efficiency of the proposed method was compared with the existing traditional exhaustive search (HNN-R2SATES) model and the recently introduced HNN-R2SATICA model. From the result obtained, clearly proven that based on our proposed hybrid model outperformed other existing model based on the Global Minima Ratio (ZM), Mean Absolute Error (MAE), Bayesian Information Criterion (BIC) and Execution Time (ET). The expected outcome portrays that the EA algorithm outperformed the other two algorithms in doing random-kSAT logic program. The results proved the robustness, effectiveness, and compatibility of the HNN-R2SATEA model.

：An effective technology for predicting the end-point phosphorous content of basic oxygen furnace (BOF) can provide theoretical instruction to improve the quality of steel via controlling the hardness and toughness. Given the slightly inadequate prediction accuracy in the existing prediction model, a novel hybrid method was suggested to more accurately predict the end-point phosphorus content by integrating an enhanced sparrow search algorithm (ESSA) and a multi-strategy with a deep extreme learning machine (DELM) as ESSA-DELM in this study. To begin with, the input weights and hidden biases of DELM were randomly selected, resulting in that DELM inevitably had a set of non-optimal or unnecessary weights and biases. Therefore, the ESSA was used to optimize the DELM in this work. For the ESSA, the Trigonometric substitution mechanism and Cauchy mutation were introduced to avoid trapping in local optima and improve the global exploration capacity in SSA. Finally, to evaluate the prediction efficiency of ESSSA-DELM, the proposed model was tested on process data of the converter from the Baogang steel plant. The efficacy of ESSA-DELM was more superior to that of other DELM-based hybrid prediction models and conventional models. The result demonstrated that the hit rate of end-point phosphorus content within ±0.003%, ±0.002%, and ±0.001% was 91.67%, 83.33%, and 63.55%, respectively. The proposed ESSA-DELM model could possess better prediction accuracy compared with other models, which could guide field operations.

The search algorithm based on symbiotic organisms’ interactions is a relatively recent bio-inspired algorithm of the swarm intelligence field for solving numerical optimization problems. It is meant to optimize applications based on the simulation of the symbiotic relationship among the distinct species in the ecosystem. The modified SOS algorithm is developed to solve independent task scheduling problems. This paper proposes a modified symbiotic organisms search based scheduling algorithm for efficient mapping of heterogeneous tasks to access cloud resources of different capacities. The significant contribution of this technique is the simplified representation of the algorithm's mutualism process, which uses equity as a measure of relationship characteristics or efficiency of species in the current ecosystem to move to the next generation. These relational characteristics are achieved by replacing the original mutual vector, which uses an arithmetic mean to measure the mutual characteristics with a geometric mean that enhances the survival advantage of two distinct species. The modified symbiotic organisms search algorithm (G_SOS) aimed to minimize the task execution time (Makespan), response, degree of imbalance and cost and improve the convergence speed for an optimal solution in an IaaS cloud. The performances of the proposed technique have been evaluated using a Cladism toolkit simulator, and the solutions are found to be better than the existing standard (SOS) technique and PSO.

Automated machine learning (AutoML) has been heralded as the next wave in artificial intelligence with its promise to deliver high performance end-to-end machine learning pipelines with minimal effort from the user. However, despite AutoML showing great promise for computer vision tasks, to the best of our knowledge, no study has used AutoML for image-based plant phenotyping. To address this gap in knowledge, we examined the application of AutoML for image-based plant phenotyping using wheat lodging assessment with UAV imagery as an example. We compared the performance of an open-source AutoML framework, AutoKeras in image classification and regression tasks to transfer learning using modern convolutional neural network (CNN) architectures. For image classification which classified plot images as lodged or non-lodged, transfer learning with Xception and DenseNet-201 achieved best classification accuracy of 93.2%, whereas Autokeras had 92.4% accuracy. For image regression which predicted lodging scores from plot images, transfer learning with DenseNet-201 had the best performance (R2=0.8303, RMSE=9.55, MAE=7.03, MAPE=12.54%), followed closely by AutoKeras (R2=0.8273, RMSE=10.65, MAE=8.24, MAPE=13.87%). Interestingly, in both tasks, AutoKeras models had up to 40-fold faster inference times compared to the pretrained CNNs. The merits and drawbacks of AutoML compared to transfer learning for image-based plant phenotyping are discussed.

This work addresses the energy-based source localization problem in wireless sensors networks. Instead of circumventing the maximum likelihood (ML) problem by applying convex relaxations and approximations (like all existing approaches do), we here tackle it directly by the use of metaheuristics. To the best of our knowledge, this is the first time that metaheuristics is applied to this type of problems. More specifically an elephant herding optimization (EHO) algorithm is applied. Through extensive simulations, the key parameters of the EHO algorithm are optimized such that they match the energy decay model between two sensor nodes. A detailed analysis of the computational complexity is presented, as well as performance comparison between the proposed algorithm and existing non-metaheuristic ones. Simulation results show that the new approach significantly outperforms the existing solutions in noisy environments, encouraging further improvement and testing of metaheuristic methods.

This study presents application of demand response strategy in a standalone wind-solar-battery hybrid energy system (HES). Inputs for the designed HES are wind speed, solar radiation, temperature and load demand which is variable with time. In this study, hourly values of meteorological data and hourly load demand are considered in one year. An improved gravitational search algorithm (IGSA) is used to optimize the configuration of the standalone wind-solar-battery hybrid power system. The optimal objectives of the system are cost of the system in life cycle, the loss of power supply probability（LPSP）and the energy excess percentage（EXC）.The effect of demand response on economic benefit and energy storage allocation of the standalone wind-solar-battery system is studied. The obtained optimal configuration of the proposed HES can provide minimal energy cost with excellent performance and reduced waste and unmet load.

Jellyfish search (JS) algorithm impersonates the foraging behavior of jellyfish in the ocean. It is a new developed meta-heuristic algorithm that solves complex and real world optimization problems. The global explore capability and robustness of JS are strong, but JS still has great development space in solving complex optimization problems with high dimensions and multiple local optima. Therefore, an enhanced jellyfish search (EJS) algorithm is developed in this study, and three improvements are made: (i) By adding sine and cosine learning factors, the jellyfish can learn from both random individual and best individual during Type B motion in swarm to enhance the optimization capability and convergence speed; (ii) Adding local escape operator can skip local optimal trap and boost the exploitation ability of JS; (iii) Opposition-based learning operator and quasi-opposition learning operator can increase and strengthen the population distribution more diversified, and better individuals are selected from present and new opposition-solution to participates in the next iteration, which can boost the solution’s quality, meanwhile convergence speed is fasted and its precision is increased. In addition, the performance contrast of the developed EJS and some previous outstanding and advanced methods are evaluated on CEC2017, CEC2019 test suite and six real engineering example of case. It is demonstrated that EJS algorithm escaped the trap of local optimum, enhanced the solution’s quality and the calculation speed. What’s more, the practical engineering applications of EJS algorithm also verify its superiority and effectiveness in solving both constrained and unconstrained optimization problems, and it stretched one’s mind for solving such optimization problems.

It is difficult to capture the real-time online measurement data for biochemical oxygen demand (BOD) in wastewater treatment processes. An optimized extreme learning machine (ELM) based on an improved cuckoo search algorithm (ICS) is proposed in this paper for the design of soft BOD measurement model. In ICS-ELM, the input weights matrices of the extreme learning machine (ELM) and the threshold of the hidden layer are encoded as the cuckoo's nest locations. The best input weights matrices and threshold are obtained by using the strong global search ability of improved cuckoo search (ICS) algorithm. The optimal results can be used to improve the precision of forecasting based on less number of neurons of the hidden layer in ELM. Simulation results show that the soft sensor model has good real-time performance, high prediction accuracy and stronger generalization performance for BOD measurement of the effluent quality compared to other modeling methods such as back propagation (BP) network in most cases.

Ovarian Cancer (OC) is a type of cancer that affects ovaries in women, and is difficult to detect at initial stage due to which it remains as one of the leading causes of cancer death. The ovarian cancer data generated from the Internet of Medical Things (IoMT) was used and a novel approach was proposed for distinguishing the ovarian cancer by utilizing Self Organizing Maps (SOM) and Optimal Recurrent Neural Networks (ORNN). SOM algorithm was utilized for better feature subset selection and was also utilized for separating profitable, understood and intriguing data from huge measures of medical data. In supervised learning techniques, the SOM-based feature selection seems to be a tougher challenge because of the absence of class labels that would guide the search for relevant information to the classifier model. The classification approach can identify ovarian cancer data as benign/malignant. The ovarian cancer detection process can be improved by optimizing the weights of RNN structure using Adaptive Harmony Search Optimization (AHSO). The proposed model in this study can be used to detect cancer at early stages with high accuracy and low Root Mean Square Error (RMSE).

Particle Swarm Optimization (PSO) is a metaheuristic global optimization paradigm that has gained prominence in the last two decades due to its ease of application in unsupervised, complex multidimensional problems which cannot be solved using traditional deterministic algorithms. The canonical particle swarm optimizer is based on the flocking behavior and social co-operation of birds and fish schools and draws heavily from the evolutionary behavior of these organisms. This paper serves to provide a thorough survey of the PSO algorithm with special emphasis on the development, deployment and improvements of its most basic as well as some of the very recent state–of-the-art implementations. Concepts and directions on choosing the inertia weight, constriction factor, cognition and social weights and perspectives on convergence, parallelization, elitism, niching and discrete optimization as well as neighborhood topologies are outlined. Hybridization attempts with other evolutionary and swarm paradigms in selected applications are covered and an up-to-date review is put forward for the interested reader.

This paper realizes early bearing fault warning through bearing fault time series prediction, and proposes a bearing fault time series prediction model based on optimized maximum correlation kurtosis deconvolution (MCKD) and long short-term memory (LSTM) recurrent neural network to ensure bearings operation reliability. The model is based on lifecycle vibration signal of the bearing, to begin, the cuckoo search (CS) is utilized to optimize the parameter filter length L and deconvolution period T of MCKD, taking into account the influence and periodicity of the bearing time series, the fault impact component of the optimized MCKD deconvolution time series is improved. Then select the LSTM learning rate α depending on deconvolution time series. Finally, the dataset obtained through various preprocessing approaches are used to train and predict the LSTM model. The average prediction accuracy of the optimized MCKD-LSTM model is 26 percent higher than that of the original time series, proving the efficiency of this method, and the prediction results track the real fault data well, according to the XI'AN JIAOTONG University XJTU-SY bearing dataset.

Databases are by far the most valuable asset of companies. Since the need was seen not only to count but also to have some type of record of elements such as crops, animals, money, properties and that this record could be consulted and modified according to the situation, that is where the first database was born. , and after that, these databases cannot be disorganized, they also need to be managed and administered under established standards that facilitate their understanding and management not only by their creators but by the other people who subsequently administer them. Databases and database management systems have an interesting evolutionary history that deserves to be analyzed and this is the objective of this document, where it is sought to understand. Along with databases and their management systems, data mining or Data mining arises that in order not to extend ourselves so much, it is the job of finding common patterns in various data sources and in what way they can be used to predict situations or results of various circumstances; We also focus on the other topic that we will present, Oracle data mining, which roughly is to merge data mining with Oracle, which makes it a powerful tool for obtaining information and predicting results based on statistics.In this article we will study and analyze the ideas, concepts and basic examples that make up SGBD and Data Mining and, we will try to go deeper into this topic, the use of decision techniques such as advanced statistical algorithms. We also present a fictitious example of the application of these techniques: predicting which products can be sold based on their relationship with others. we will give a brief explanation of association rules, data mining cycle and the types of learning and the evolution that data mining has had.

Software is playing the most important role in recent vehicle innovation, and consequently the amount of software has been rapidly growing last decades. Safety-critical nature of ships, one sort of vehicles, makes Software Quality Assurance (SQA) has gotten to be a fundamental prerequisite. Just-In-Time Software Defect Prediction (JIT-SDP) aims to conduct software defect prediction (SDP) on commit-level code changes to achieve effective SQA resource allocation. The first case study of SDP in maritime domain reported feasible prediction performance. However, we still consider that the prediction model has still rooms for improvement since the parameters of the model are not optimized yet. Harmony Search (HS) is a widely used music-inspired meta-heuristic optimization algorithm. In this article, we demonstrated that JIT-SDP can produce the better performance of prediction by applying HS-based parameter optimization with balanced fitness value. Using two real-world datasets from the maritime software project, we obtained an optimized model that meets the performance criterion beyond baseline of previous case study throughout various defect to non-defect class imbalance ratio of datasets. Experiments with open source software also showed better recall for all datasets despite we considered balance as performance index. HS-based parameter optimized JIT-SDP can be applied to the maritime domain software with high class imbalance ratio. Finally, we expect that our research can be extended to improve performance of JIT-SDP not only in maritime domain software but also in open source software.

WNT10B belongs to the family of WNT proteins that are implicated in a range of phenomena that are affected by the Wnt signaling pathway. Recent studies have shown that WNT10B plays a role in colorectal cancer. WNTs have been found to directly affect the stemness of the tumor cells via regulation of ASCL2. Switching off the ASCL2 literally blocks the stemness process of the tumor cells and vice versa. Furthermore, recent findings suggest BVES to be highly suppressed in malignancies and in vitro deletions of BVES show higher Wnt signaling activity to induce stem- ness. WNT10B was found to be highly expressed in such cases. Often, in biology, we are faced with the problem of exploring relevant unknown biological hypotheses in the form of myriads of combination of factors that might be affecting the pathway under certain conditions. For example, WNT10B-ASCL2 is one such 2^nd order combination whose relation needs to be tested under the influence of recently developed porcupine-WNT inhibitor ETC-1922159. The inhibitor is known to suppress PORCN (porcupine) and thus inhibit a range of oncogenes known to be directly or indirectly affected by the Wnts. In a recent unpublished work in bioRxiv, Sinha 1, we had the opportunity to rank these unknown biological hypotheses for down regulated genes at 2^nd order level after the drug was administered. The in silico observations showed that the combination of WNT10B-ASCL2 was assigned a relatively lower rank, thus validating the pipeline’s efficacy with the confirmed wet lab experiment that indicate that both WNT10B and ASCL2 were down regulated after treatment in cancer cells. Here, we take one step further by in silico analysis of the 3rd order combinations of WNT10B-X-X (X can be known or unknown factor), from a range of 100 randomly picked down regulated genes after ETC-1922159 treatment. The pipeline uses the density based HSIC (Hilbert Schmidt Information Criterion) sensitivity index with an rbf (ra- dial basis function) kernel, which is known to be highly effective in sensitivity analysis. Various unknown/unexplored/untested 3^rd order biological hypotheses emerge some of which are con- firmed in wet lab, while others need to be tested. The potential of such ranking is indispensable in the current era of search in a vast combinatorial forest.

With Unmanned Aerial Vehicles (UAV), a swift response to urgent needs like search \& rescue missions or medical deliveries can be realized. Simultaneously, the legislator is establishing so-called geographical zones, which restrict UAV operations to mitigate the air and ground risk to third parties. These geographical zones serve a particular safety interest, but they may also hinder the efficient usage of UAVs on time-critical missions with a range-limiting battery capacity. In this study, we address a facility location problem for up to two UAV hangars with a robust optimization model considering demand hotspots, geographical zones as restricted areas, a standard mission to satisfy battery capacity constraints, and the impact of wind scenarios. To this end, water rescue missions are used exemplary, for which positive and negative location factors for UAV hangars and areas of increased drowning risk as demand points are derived from open-source georeferenced data. Optimal UAV mission trajectories are computed with an A* algorithm considering five different restriction scenarios. As this pathfinding is very time-consuming, binary occupancy grids and image processing algorithms accelerate the computation by identifying either entirely inaccessible or restriction-free connections beforehand. For the optimal UAV hangar locations, we maximize accessibility while minimizing the service time to the hotspots, resulting in a decrease from the average service time of 570.4 s for all facility candidates to 351.1 s for one and 287.2 s for two optimal UAV hangar locations.

The optimization of guide vane closing schemes (OGVCS) of pumped storage hydro unit (PSHU) is the research field of cooperative control and optimal operation of pumped storage, wind power and solar power generation. This paper presents a OGVCS model of PSHU considering the rise rate of the unit rotational speed and the specific node pressure of each hydraulic unit, as well as various complicated hydraulic and mechanical constraints. OGVCS model is formulated as a multi-objective optimization problem to optimize conflictive objectives, i.e., unit rotational speed and water hammer pressure criteria. In order to realize the efficient solution of the OGVCS model, an enhanced multi-objective bacterial-foraging chemotaxis gravitational search algorithm (EMOBCGSA) is proposed to solve this problem, which adopts population reconstruction, adaptive selection chemotaxis operator of local searching strategy and Elite archive set to efficiently solve the multi-objective problem. Especially, novel constraints-handling strategy with eliminating and local search based on violation ranking is used to balance various hydraulic and mechanical constraints. Finally, simulation cases of complex extreme operating conditions (i.e., load rejection and pump outage) of ‘single tube-double units’ type PSHU system are conducted to verify the feasibility and effectiveness of the proposed EMOBCGSA in solving OGVCS problem. The simulation results indicate that the proposed EMOBCGSA can provide lower rise rate of the unit rotational speed and smaller water hammer pressure than other method established recently while considering various complex constraints in OGVCS problem.

DNA repair helps in maintaining the proper and healthy functioning for the cells in the human body. Failure in DNA repair process can lead to aberrations as well as tumorous stages. There are various types of damages that a DNA can go through, one of which is the DNA double strand breaks (DSB) that can be repaired via homologous recombination (HR). RAD51 plays a central role in HR and has been implicated as a negative/poor prognostic marker for colorectal adenocarcinoma, with high expression in colorectal cancer. Mechanistically, RAD51AP1 facilitates RAD51 during the repairing process by binding with RAD51 via two DNA binding sites, thus helping in the D-loop formation in the HR process. Often, in biology, we are faced with the problem of exploring relevant unknown biological hypotheses in the form of myriads of combination of factors that might be affecting the pathway under certain conditions. For example, RAD51AP1-XRCC2 is one such 2^nd order combination whose relation needs to be tested under the influence recently developed Porcupine-WNT inhibitor ETC-1922159. The x-ray repair cross complementing XRCC family is known to work as a mediator or stabilizer for RAD51 during the HR process. The inhibitor is known to suppress Porcupine and thus inhibit a range of oncogenes known to be directly or indirectly affected by the Wnts. In a recent unpublished work in bioRxiv, we had the opportunity to rank these unknown biological hypotheses for down regulated genes at 2^nd order level after the drug was administered. The in silico observations showed that the combination of RAD51AP1-XRCC2 was assigned a relatively lower rank, thus validating the pipeline's efficacy with the confirmed wet lab experiment that indicate that both RAD51AP1 and XRCC2 were down regulated after treatment in cancer cells. Here, we take one step further by in silico analysis of the 3^rd order combinations of RAD51-X-X & RAD51AP1-X-X (X can be known or unknown factor), from a range of 100 randomly picked down regulated genes after ETC-1922159 treatment. The pipeline uses the density based HSIC (Hibert Schmidth Information Criterion) sensitivity index with an rbf (radial basis function) kernel, which is known to be highly effective in sensitivity analysis. Various unknown/unexplored/untested RAD51/RAD51AP1 related 3^rd order biological hypotheses emerge some of which are confirmed in wet lab, while others need to be tested.

Often, in biology, we are faced with the problem of exploring relevant unknown biological hypotheses in the form of myriads of combination of factors that might be affecting the pathway under certain conditions. For example, Brancati et al.1 observe that mutations in poliovirus receptor related protein 4 (PVRL4), encoding cell adhesion molecule nectin-4, causes Ectodermal dysplasia-syndactyly syndrome. Interaction with cad- herins also implies an influence of nectin-4 on Wnt signaling, which plays a relevant role in limb development (Brancati et al.1). However, not much work has been done to explore the relation of Wnts and PVR family. In CRC cells treated with ETC-1922159, both were found up regulated. In a recent unpublished work in Open Science Framework, Sinha2, we had the opportunity to rank these unknown biological hypotheses for both up and down regulated genes at 2nd order level after drug administration. The search engine alloted high nu- merical valued rankings to some combinations of PVR-WNT, thus indicating a possibility of high combinatorial synergy also. The in-silico derived influences can be represented graphically as - PVR w.r.t WNT with PVR <- WNT9A; and WNT w.r.t PVR with WNT-7B/9A <- PVR and WNT4 <- PVRL2; In the light of the recent findings of PVR with IFN (interferon) and the known interactions between IFN and Wnts, there might be a possibilty to explore the bridge of PVR, IFN and WNTs. The 3 fold (PVR - IFN; IFN - WNT; WNT - PVR), 2 way cross family analysis might shed light on the possible combinations that might be of import. Here, we present a 2-way cross family analysis of multiple, such in-silico ranked 2nd order synergistic combinations, after ETC-1922159 treatment of CRC cells. Via this 2-way cross family analysis, we are able to discover through majority voting, the combinations that might of interest to biologists and also derive plausible influences of components of combinations among themselves. Note that these form biological hypotheses which indicate whether a particular combination and the direction of influence within the combination, exist synergistically in CRC cells. Wet lab tests will indicate the veracity of these combinations and if proven true, will lead to further study of mechanism between the components.

\textsc{Background} Often, in biology, we are faced with the problem of exploring relevant unknown biological hypotheses in the form of myriads of combination of factors that might be affecting the pathway under certain conditions. Currently, a major problem in biology is to cherry pick the combinations based on expert advice, literature survey or guesses for investigation. The search and wet lab testing of these combinations costs a lot in terms of time, investment and energy. In a recent development of the PORCN-WNT inhibitor ETC-1922159 for colorectal cancer, a list of down-regulated genes were recorded in a time buffer after the administration of the drug. The regulation of the genes were recorded individually but for a majority, it is still not known which higher ($\geq 2$) order combinations might be playing a greater role in the pathway. \textsc{Results} The pipeline provides a prioritised list of important $2^{nd}$ order combinations of a range of family of genes involved in the Wnt pathway. More specifically, it reveals the various unexplored FZD-WNT combinations that have been untested till now in the pathway. In relation to ETC-1922159 affected combinations, the down-regulation of LGR-RNF family after the drug treatment is evident in these rankings as it takes bottom priorities for LGR5-RNF43 combination. The LGR6-RNF43 takes higher ranking than LGR5-RNF43, indicating that it might not be playing a greater role as LGR5 during the Wnt enhancing signals. These rankings confirm the efficacy of the proposed search engine design. \textsc{Conclusion} A pipeline has been developed to prioritise an $n^{th}$ order combination of factors that affect a signaling pathway. It takes into account the sensitivity indices computed from variance based (SOBOL) and density-kernel based (HSIC) methods to estimate the influence of each factor or combination of factors. These are then fed as feature vectors into a powerful support vector ranking algorithm that produces a ranked list of the interactions/combinations.