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.

We confidently approach current issues in Green Finance (GF) from the perspective of an international organization, where the first author has previous experience as a support assistant. In fact, the economy of the EU (European Union) is deeply involved in the changing needs related to the dramatic consequences of climate change and environmental degradation, which has placed the needs of a more sustainable economy at the top of the international agenda. The environmental, social and governance (ESG) aspects are marginally addressed to arouse a major interest in questions raised by green financial products which require long-term profit expectations, and which above all contain a margin of risk that is difficult to calculate in the landscape of traditional financial instruments. Through a careful approach akin to artificial intelligence research methods, we attempt to “materialize” at least the most visible clues of this fashionable economic shift through what we call SMC (sustainable material culture) objects. The presented SMC objects serve as tangible representations of sustainable practices and can promote awareness and action incorporating into everyday life and business practices a powerful reminder and catalyst for a shift towards more sustainable investment and consumption patterns.

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.

The rapid advancements and the merging of hybrid quantum-classical computing, artificial intelligence (AI), machine learning (ML), and deep learning (DL) pose a potentially unseen and significant threat to encryption that may impact Post-Quantum Cryptography (PQC) transition timelines. There is a direct hybrid quantum-classical computing threat on cryptography, and there is also a direct threat AI/ML on cryptography. However, the synergistic combination of these technologies presents known and unknown threats that need attention, focus action, and research. This paper reviews Grover's Adaptive Search (GAS), which combines Grover's Algorithm with adaptive techniques to optimize search further, potentially making it even more efficient for attacking encryption. This work also examines the quantum-accelerated Harrow-Hassidim-Lloyd (HHL) Algorithm, designed to solve systems of linear equations exponentially faster than classical algorithms in certain conditions. The HHL algorithm can solve some lattice-based problems, which have implications for lattice-based encryption. This technological confluence and its potential impact on cryptography and encryption necessitate a proactive and coordinated approach to developing and implementing quantum-resistant AI/ML cryptographic solutions. This paper reviews the technological confluence and its potential implications for classical cryptography and PQC transition timelines and calls for further research.

The Internet of Medical Things(IoMT) has powerful cloud computing ability and efficient data collection ability, which can improve the accuracy and convenience of medical work. As most communications are over open networks, data should encrypted before uploading to ensure the confidentiality of sensitive user data. Searching for encrypted data has become a challenging problem. Public key Encryption with Keyword Search (PEKS) supports the search of encrypted data and provides data privacy protection. PEKS has become a trendy technology, but PEKS still has the following problems: 1. The cloud server, as a semi-honest but curious third party, is likely to return some wrong search results to save computing and bandwidth resources. 2. The single keyword search inevitably produces irrelevant results, wasting computing and bandwidth resources. 3. Most PEKS schemes use bilinear pairing, so the computational efficiency is relatively low. 4. PEKS schemes based on Public Key Infrastructure (PKI) or identity-based cryptography inevitably face problems with certificate management or key escrow. 5. Most PEKS schemes face serious security threats such as Keyword Guessing Attacks (KGA) and File Injection Attacks (FIA). To solve the above problems, we propose a new certificateless verifiable bilinear pair-free conjunctive keyword search encryption scheme(CLVPFCKS) for IoMT using multi-signature.

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.

Microarray gene expression-based detection and classification of medical conditions have been prominent in research studies over the past few decades. However, extracting relevant data from the high-volume microarray gene expression with inherent nonlinearity and inseparable noise components raises significant challenges during data classification and disease detection. So, this paper proposes a two-level strategy involving feature extraction and selection methods before the classification step. The feature extraction step utilizes Short Term Fourier Transform (STFT), and the feature selection step employs Particle Swarm Optimization (PSO) and Harmonic Search (HS) metaheuristic methods. The classifiers employed are Non-Linear Regression, Gaussian Mixture Model, Softmax Discriminant, Naive Bayes, SVM (Linear), SVM (Polynomial), and SVM (RBF). The two-level extracted relevant features are compared with raw data classification results, including Convolutional Neural Network (CNN) Methodology. Among the methods, STFT with PSO feature selection and SVM (RBF) classifier produced the highest accuracy of 94.47%.

This article introduces a novel approach, termed the Asymmetric Probabilistic Tsetlin (APT) Machine, which incorporates the Stochastic Point Location (SPL) algorithm with the Asymmetric Steps technique into the Tsetlin Machine (TM). APT introduces stochasticity into the state transitions of Tsetlin Automata (TA) by leveraging the SPL algorithm, thereby enhancing pattern recognition capabilities. To enhance random search processes, we introduced a decaying normal distribution into the procedure. Meanwhile, the Asymmetric Steps approach biases state transition probabilities towards specific input patterns, further elevating operational efficiency. The efficacy of the proposed approach is assessed across diverse benchmark datasets for classification tasks. The performance of APT is compared with traditional machine learning algorithms and other Tsetlin Machine models, including the Asymmetric Tsetlin (AT) Machine, characterized by deterministic rules for Asymmetric transitions, and the Classical Tsetlin (CT) Machine, employing deterministic rules for symmetric transitions. Strikingly, the introduced APT methodology demonstrates highly competitive outcomes compared to established machine learning methods. Notably, both APT and AT exhibit state-of-the-art performance, surpassing the Classical Tsetlin Machine, emphasizing the efficacy of asymmetric models for achieving superior outcomes. Remarkably, APT exhibits even better performance than AT, particularly in handling complex datasets.

We introduce linear probing hashing schemes that construct a hash table of size $n$, with constant load factor $\alpha$, on which the worst-case unsuccessful search time is asymptotically almost surely $O(\log \log n)$. The schemes employ two linear probe sequences to find empty cells for the keys. Matching lower bounds on the maximum cluster size produced by any algorithm that uses two linear probe sequences are obtained as well.

Chatbots have gained widespread popularity for their task automation capabilities and consistent availability in various domains, including education. However, their ability to adapt to the continuously evolving and dynamic nature of knowledge is limited. This research investigates the implementation of an internet wizard to enhance the knowledge base of an open-domain question-answering chatbot. The proposed approach leverages search engines, particularly Google, and its features, including feature snippets, knowledge graph, and organic search, in conjunction with data science and natural language models. This mechanism empowers the chatbot to dynamically access the extensive and up-to-date knowledge available on the web, enabling the provision of real-time and pertinent answers to user queries sourced from web documents. A pilot study in a higher education context evaluated the chatbot's mechanism and features, confirming its proficiency in generating responses across a broad range of educational and non-educational topics. Positive feedback and high user satisfaction validate these findings. Notably, the chatbot's dynamic feature of retrieving related or follow-up questions from search engines significantly enhances student engagement and facilitates exploration of supplementary information beyond the curriculum.

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.