Search

The study of non-human animals' communication systems generally relies on the transcription of vocal sequences using a finite set of discrete units. This set is referred to as a vocal repertoire, which is specific to a species or a sub-group of a species. When conducted by human experts, the formal description of vocal repertoires can be laborious and/or biased. This motivates computerised assistance for this procedure, for which machine learning algorithms represent a good opportunity. Unsupervised clustering algorithms are suited for grouping close points together, provided a relevant representation. This paper therefore studies a new method for encoding vocalisations, allowing for automatic clustering to alleviate vocal repertoire characterisation. Borrowing from deep representation learning, we use a convolutional auto-encoder network to learn an abstract representation of vocalisations. We report on the quality of the learnt representation, as well as of state of the art methods, by quantifying their agreement with expert labelled vocalisation types from 8 datasets of other studies across 6 species (birds and marine mammals). With this benchmark, we demonstrate that using auto-encoders improves the relevance of vocalisation representation which serves repertoire characterisation using a very limited number of settings. We also publish a Python package for the bioacoustic community to train their own vocalisation auto-encoders or use a pretrained encoder to browse vocal repertoires and ease unit wise annotation., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Best et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

In this work, we develop a new set of Bayesian models to perform registration of real-valued functions. A Gaussian process prior is assigned to the parameter space of time warping functions, and a Markov chain Monte Carlo (MCMC) algorithm is utilized to explore the posterior distribution. While the proposed model can be defined on the infinite-dimensional function space in theory, dimension reduction is needed in practice because one cannot store an infinite-dimensional function on the computer. Existing Bayesian models often rely on some pre-specified, fixed truncation rule to achieve dimension reduction, either by fixing the grid size or the number of basis functions used to represent a functional object. In comparison, the new models in this paper randomize the truncation rule. Benefits of the new models include the ability to make inference on the smoothness of the functional parameters, a data-informative feature of the truncation rule, and the flexibility to control the amount of shape-alteration in the registration process. For instance, using both simulated and real data, we show that when the observed functions exhibit more local features, the posterior distribution on the warping functions automatically concentrates on a larger number of basis functions. Supporting materials including code and data to perform registration and reproduce some of the results presented herein are available online., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Lu et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

In systems biology, the accurate reconstruction of Gene Regulatory Networks (GRNs) is crucial since these networks can facilitate the solving of complex biological problems. Amongst the plethora of methods available for GRN reconstruction, information theory and fuzzy concepts-based methods have abiding popularity. However, most of these methods are not only complex, incurring a high computational burden, but they may also produce a high number of false positives, leading to inaccurate inferred networks. In this paper, we propose a novel hybrid fuzzy GRN inference model called MICFuzzy which involves the aggregation of the effects of Maximal Information Coefficient (MIC). This model has an information theory-based pre-processing stage, the output of which is applied as an input to the novel fuzzy model. In this preprocessing stage, the MIC component filters relevant genes for each target gene to significantly reduce the computational burden of the fuzzy model when selecting the regulatory genes from these filtered gene lists. The novel fuzzy model uses the regulatory effect of the identified activator-repressor gene pairs to determine target gene expression levels. This approach facilitates accurate network inference by generating a high number of true regulatory interactions while significantly reducing false regulatory predictions. The performance of MICFuzzy was evaluated using DREAM3 and DREAM4 challenge data, and the SOS real gene expression dataset. MICFuzzy outperformed the other state-of-the-art methods in terms of F-score, Matthews Correlation Coefficient, Structural Accuracy, and SS_mean, and outperformed most of them in terms of efficiency. MICFuzzy also had improved efficiency compared with the classical fuzzy model since the design of MICFuzzy leads to a reduction in combinatorial computation., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Nakulugamuwa Gamage et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

The retrieval of important information from a dataset requires applying a special data mining technique known as data clustering (DC). DC classifies similar objects into a groups of similar characteristics. Clustering involves grouping the data around k-cluster centres that typically are selected randomly. Recently, the issues behind DC have called for a search for an alternative solution. Recently, a nature-based optimization algorithm named Black Hole Algorithm (BHA) was developed to address the several well-known optimization problems. The BHA is a metaheuristic (population-based) that mimics the event around the natural phenomena of black holes, whereby an individual star represents the potential solutions revolving around the solution space. The original BHA algorithm showed better performance compared to other algorithms when applied to a benchmark dataset, despite its poor exploration capability. Hence, this paper presents a multi-population version of BHA as a generalization of the BHA called MBHA wherein the performance of the algorithm is not dependent on the best-found solution but a set of generated best solutions. The method formulated was subjected to testing using a set of nine widespread and popular benchmark test functions. The ensuing experimental outcomes indicated the highly precise results generated by the method compared to BHA and comparable algorithms in the study, as well as excellent robustness. Furthermore, the proposed MBHA achieved a high rate of convergence on six real datasets (collected from the UCL machine learning lab), making it suitable for DC problems. Lastly, the evaluations conclusively indicated the appropriateness of the proposed algorithm to resolve DC issues., Competing Interests: he authors have declared that no competing interests exist., (Copyright: © 2023 Salih et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Federated Learning (FL), as a new computing framework, has received significant attentions recently due to its advantageous in preserving data privacy in training models with superb performance. During FL learning, distributed sites first learn respective parameters. A central site will consolidate learned parameters, using average or other approaches, and disseminate new weights across all sites to carryout next round of learning. The distributed parameter learning and consolidation repeat in an iterative fashion until the algorithm converges or terminates. Many FL methods exist to aggregate weights from distributed sites, but most approaches use a static node alignment approach, where nodes of distributed networks are statically assigned, in advance, to match nodes and aggregate their weights. In reality, neural networks, especially dense networks, have nontransparent roles with respect to individual nodes. Combined with random nature of the networks, static node matching often does not result in best matching between nodes across sites. In this paper, we propose, FedDNA, a dynamic node alignment federated learning algorithm. Our theme is to find best matching nodes between different sites, and then aggregate weights of matching nodes for federated learning. For each node in a neural network, we represent its weight values as a vector, and use a distance function to find most similar nodes, i.e., nodes with the smallest distance from other sides. Because finding best matching across all sites are computationally expensive, we further design a minimum spanning tree based approach to ensure that a node from each site will have matched peers from other sites, such that the total pairwise distances across all sites are minimized. Experiments and comparisons demonstrate that FedDNA outperforms commonly used baseline, such as FedAvg, for federated learning., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Wang, Zhu. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

To address the problems of low accuracy and slow convergence of traditional multilevel image segmentation methods, a symmetric cross-entropy multilevel thresholding image segmentation method (MSIPOA) with multi-strategy improved pelican optimization algorithm is proposed for global optimization and image segmentation tasks. First, Sine chaotic mapping is used to improve the quality and distribution uniformity of the initial population. A spiral search mechanism incorporating a sine cosine optimization algorithm improves the algorithm's search diversity, local pioneering ability, and convergence accuracy. A levy flight strategy further improves the algorithm's ability to jump out of local minima. In this paper, 12 benchmark test functions and 8 other newer swarm intelligence algorithms are compared in terms of convergence speed and convergence accuracy to evaluate the performance of the MSIPOA algorithm. By non-parametric statistical analysis, MSIPOA shows a greater superiority over other optimization algorithms. The MSIPOA algorithm is then experimented with symmetric cross-entropy multilevel threshold image segmentation, and eight images from BSDS300 are selected as the test set to evaluate MSIPOA. According to different performance metrics and Fridman test, MSIPOA algorithm outperforms similar algorithms in global optimization and image segmentation, and the symmetric cross entropy of MSIPOA algorithm for multilevel thresholding image segmentation method can be effectively applied to multilevel thresholding image segmentation tasks., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Zhang et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Graph drawing, involving the automatic layout of graphs, is vital for clear data visualization and interpretation but poses challenges due to the optimization of a multi-metric objective function, an area where current search-based methods seek improvement. In this paper, we investigate the performance of Jaya algorithm for automatic graph layout with straight lines. Jaya algorithm has not been previously used in the field of graph drawing. Unlike most population-based methods, Jaya algorithm is a parameter-less algorithm in that it requires no algorithm-specific control parameters and only population size and number of iterations need to be specified, which makes it easy for researchers to apply in the field. To improve Jaya algorithm's performance, we applied Latin Hypercube Sampling to initialize the population of individuals so that they widely cover the search space. We developed a visualization tool that simplifies the integration of search methods, allowing for easy performance testing of algorithms on graphs with weighted aesthetic metrics. We benchmarked the Jaya algorithm and its enhanced version against Hill Climbing and Simulated Annealing, commonly used graph-drawing search algorithms which have a limited number of parameters, to demonstrate Jaya algorithm's effectiveness in the field. We conducted experiments on synthetic datasets with varying numbers of nodes and edges using the Erdős-Rényi model and real-world graph datasets and evaluated the quality of the generated layouts, and the performance of the methods based on number of function evaluations. We also conducted a scalability experiment on Jaya algorithm to evaluate its ability to handle large-scale graphs. Our results showed that Jaya algorithm significantly outperforms Hill Climbing and Simulated Annealing in terms of the quality of the generated graph layouts and the speed at which the layouts were produced. Using improved population sampling generated better layouts compared to the original Jaya algorithm using the same number of function evaluations. Moreover, Jaya algorithm was able to draw layouts for graphs with 500 nodes in a reasonable time., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Dib, Rodgers. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Aiming at the shortcomings of the traditional level set model which only has good robustness to the weak boundary and strong noise of the original target image, this paper proposes an improved algorithm based on the no-weight initialization level set model, introducing bilateral filters and using implicit surface level sets to extract and segment the original target image object more accurately, clearly and intuitively in the evolution process. The experimental simulation results show that, compared with the traditional non-reinitialized level set model segmentation method, the improved method can more accurately extract the edge contours of the target image object, and has better edge contour extraction effect, and the original target noise reduction effect of the improved model is better than that of the model before the improvement. The original target image object edge contour takes less time to extract than the conventional non-reinitialized level set model before the improvement., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Zhang et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Pseudo-random number generators (PRNGs) are software algorithms generating a sequence of numbers approximating the properties of random numbers. They are critical components in many information systems that require unpredictable and nonarbitrary behaviors, such as parameter configuration in machine learning, gaming, cryptography, and simulation. A PRNG is commonly validated through a statistical test suite, such as NIST SP 800-22rev1a (NIST test suite), to evaluate its robustness and the randomness of the numbers. In this paper, we propose a Wasserstein distance-based generative adversarial network (WGAN) approach to generating PRNGs that fully satisfy the NIST test suite. In this approach, the existing Mersenne Twister (MT) PRNG is learned without implementing any mathematical programming code. We remove the dropout layers from the conventional WGAN network to learn random numbers distributed in the entire feature space because the nearly infinite amount of data can suppress the overfitting problems that occur without dropout layers. We conduct experimental studies to evaluate our learned pseudo-random number generator (LPRNG) by adopting cosine-function-based numbers with poor random number properties according to the NIST test suite as seed numbers. The experimental results show that our LPRNG successfully converted the sequence of seed numbers to random numbers that fully satisfy the NIST test suite. This study opens the way for the "democratization" of PRNGs through the end-to-end learning of conventional PRNGs, which means that PRNGs can be generated without deep mathematical know-how. Such tailor-made PRNGs will effectively enhance the unpredictability and nonarbitrariness of a wide range of information systems, even if the seed numbers can be revealed by reverse engineering. The experimental results also show that overfitting was observed after about 450,000 trials of learning, suggesting that there is an upper limit to the number of learning counts for a fixed-size neural network, even when learning with unlimited data., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Okada et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

A deep memory bare-bones particle swarm optimization algorithm (DMBBPSO) for single-objective optimization problems is proposed in this paper. The DMBBPSO is able to perform high-precision local search while maintaining a large global search, thus providing a reliable solution to high-dimensional complex optimization problems. Normally, maintaining high accuracy while conducting global searches is an important challenge for single-objective optimizers. Traditional particle swarms optimizers can rapidly lose the diversity during iterations and are unable to perform global searches efficiently, and thus are more likely to be trapped by local optima. To address this problem, the DMBBPSO combines multiple memory storage mechanism (MMSM) and a layer-by-layer activation strategy (LAS). The MMSM catalyzes a set of deep memories to increase the diversity of the particle swarm. For every single particle, both of the personal best position and deep memories will be used in the evaluation process. The LAS enables the particle swarm to avoid premature convergence while enhancing local search capabilities. The collaboration between MMSM and LAS enhances the diversity of the particle swarm, which in turn enhances the robustness of the DMBBPSO. To investigate the optimization ability of the DMBBPSO for single-objective optimization problems, The CEC2017 benchmark functions are used in experiments. Five state-of-the-art evolutionary algorithms are used in the control group. Finally, experimental results demonstrate that the DMBBPSO can provide high precision results for single-objective optimization problems., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Sun et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

This paper presents an innovative methodology to study the application of seasonality (the existence of cyclical patterns) to help predict the level of crime. This methodology combines the simplicity of entropy-based metrics that describe temporal patterns of a phenomenon, on the one hand, and the predictive power of machine learning on the other. First, the classical Colwell's metrics Predictability and Contingency are used to measure different aspects of seasonality in a geographical unit. Second, if those metrics turn out to be significantly different from zero, supervised machine learning classification algorithms are built, validated and compared, to predict the level of crime based on the time unit. The methodology is applied to a case study in Barcelona (Spain), with month as the unit of time, and municipal district as the geographical unit, the city being divided into 10 of them, from a set of property crime data covering the period 2010-2018. The results show that (a) Colwell's metrics are significantly different from zero in all municipal districts, (b) the month of the year is a good predictor of the level of crime, and (c) Naive Bayes is the most competitive classifier, among those who have been tested. The districts can be ordered using the Naive Bayes, based on the strength of the month as a predictor for each of them. Surprisingly, this order coincides with that obtained using Contingency. This fact is very revealing, given the apparent disconnection between entropy-based metrics and machine learning classifiers., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Delgado, Sánchez-Delgado. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

This paper discusses the merging of two optimization algorithms, atom search optimization and particle swarm optimization, to create a hybrid algorithm called hybrid atom search particle swarm optimization (h-ASPSO). Atom search optimization is an algorithm inspired by the movement of atoms in nature, which employs interaction forces and neighbor interaction to guide each atom in the population. On the other hand, particle swarm optimization is a swarm intelligence algorithm that uses a population of particles to search for the optimal solution through a social learning process. The proposed algorithm aims to reach exploration-exploitation balance to improve search efficiency. The efficacy of h-ASPSO has been demonstrated in improving the time-domain performance of two high-order real-world engineering problems: the design of a proportional-integral-derivative controller for an automatic voltage regulator and a doubly fed induction generator-based wind turbine systems. The results show that h-ASPSO outperformed the original atom search optimization in terms of convergence speed and quality of solution and can provide more promising results for different high-order engineering systems without significantly increasing the computational cost. The promise of the proposed method is further demonstrated using other available competitive methods that are utilized for the automatic voltage regulator and a doubly fed induction generator-based wind turbine systems., Competing Interests: Authors have no conflict of interest., (Copyright: © 2023 Izci et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

In the sea of data generated daily, unlabeled samples greatly outnumber labeled ones. This is due to the fact that, in many application areas, labels are scarce or hard to obtain. In addition, unlabeled samples might belong to new classes that are not available in the label set associated with data. In this context, we propose A3SOM, an abstained explainable semi-supervised neural network that associates a self-organizing map to dense layers in order to classify samples. Abstained classification enables the detection of new classes and class overlaps. The use of a self-organizing map in A3SOM allows integrated visualization and makes the model explainable. Along with describing our approach, this paper shows that the method is competitive with other classifiers and demonstrates the benefits of including abstention rules. A use case is presented on breast cancer subtype classification and discovery to show the relevance of our method in real-world medical problems., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Creux et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Several optimization problems can be abstracted into many-objective optimization problems (MaOPs). The key to solving MaOPs is designing an effective algorithm to balance the exploration and exploitation issues. This paper proposes a novel many-objective African vulture optimization algorithm (MaAVOA) that simulating the African vultures' foraging and navigation behaviours to solve the MaOPs. MaAVOA is an updated version of the African Vulture Optimization Algorithm (AVOA), which was recently proposed to solve the MaOPs. A new social leader vulture for the selection process is introduced and integrated into the proposed model. In addition, an environmental selection mechanism based on the alternative pool is adapted to improve the selection process to maintain diversity for approximating different parts of the whole Pareto Front (PF). The best-nondominated solutions are saved in an external Archive based on the Fitness Assignment Method (FAM) during the population evolution. FAM is based on a convergence measure that promotes convergence and a density measure that promotes variety. Also, a Reproduction of Archive Solutions (RAS) procedure is developed to improve the quality of archiving solutions. RAS has been designed to help reach out to the missing areas of the PF that the vultures easily miss. Two experiments are conducted to verify and validate the suggested MaAVOA's performance efficacy. First, MaAVOA was applied to the DTLZ functions, and its performance was compared to that of several popular many-objective algorithms and according to the results, MaAVOA outperforms the competitor algorithms in terms of inverted generational distance and hypervolume performance measures and has a beneficial adaptation ability in terms of both convergence and diversity performance measures. Also, statistical tests are implemented to demonstrate the suggested algorithm's statistical relevance. Second, MaAVOA has been applied to solve two real-life constrained engineering MaOPs applications, namely, the series-parallel system and overspeed protection for gas turbine problems. The experiments show that the suggested algorithm can tackle many-objective real-world applications and provide promising choices for decision-makers., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Askr et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

For the problem of direction-of-arrival (DOA) estimation using a coprime array, there are high spatial spectrum outputs of false alarms caused by the overlap of main and grating lobes from subarrays. In this paper, a DOA estimation method of more than two co-frequency sources for a coprime vector hydrophone array is proposed. The method is based on vector cross terms (VCTs), making full use of the directivity of channel combinations for vector hydrophones. Based on VCTs, the characteristic data point identification method is conducted and ensures that the bearing data with the characteristic can be preserved. For further interference rejection, the paper designs Queue Selection (QS) method based on inverse beamforming. The influence of grating lobes can be weakened with the QS, further improving the accuracy of direction extraction. The algorithm in this work does not require decoherence processing, and the simulation work shows that it achieves stable DOA estimation with a low signal-to-noise ratio (SNR)., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Chen et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Aerial photography is a long-range, non-contact method of target detection technology that enables qualitative or quantitative analysis of the target. However, aerial photography images generally have certain chromatic aberration and color distortion. Therefore, effective segmentation of aerial images can further enhance the feature information and reduce the computational difficulty for subsequent image processing. In this paper, we propose an improved version of Golden Jackal Optimization, which is dubbed Helper Mechanism Based Golden Jackal Optimization (HGJO), to apply multilevel threshold segmentation to aerial images. The proposed method uses opposition-based learning to boost population diversity. And a new approach to calculate the prey escape energy is proposed to improve the convergence speed of the algorithm. In addition, the Cauchy distribution is introduced to adjust the original update scheme to enhance the exploration capability of the algorithm. Finally, a novel "helper mechanism" is designed to improve the performance for escape the local optima. To demonstrate the effectiveness of the proposed algorithm, we use the CEC2022 benchmark function test suite to perform comparison experiments. the HGJO is compared with the original GJO and five classical meta-heuristics. The experimental results show that HGJO is able to achieve competitive results in the benchmark test set. Finally, all of the algorithms are applied to the experiments of variable threshold segmentation of aerial images, and the results show that the aerial photography images segmented by HGJO beat the others. Noteworthy, the source code of HGJO is publicly available at https://github.com/Vang-z/HGJO., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Wang et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Improvement of power amplifier's performance is the desired topic in communication systems. There are many efforts are made to provide good input and output matching, high efficiency, sufficient power gain and appropriate output power. This paper presents a power amplifier with optimized input and output matching networks. In the proposed approach, a new structure of the Hidden Markov Model with 20 hidden states is used for modeling the power amplifier. The widths and lengths of the microstrip lines in the input and output matching networks are defined as the parameters that the Hidden Markov Model should optimize. For validating our algorithm, a power amplifier has been realized based on a 10W GaN HEMT with part number CG2H40010F from the Cree corporation. Measurement results have shown a PAE higher than 50%, a Gain of about 14 dB, and input and output return losses lower than -10 dB over the frequency range of 1.8-2.5 GHz. The proposed PA can be used in wireless applications such as radar systems., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Soruri et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Plant electrophysiological response contains useful signature of its environment and health which can be utilized using suitable statistical analysis for developing an inverse model to classify the stimulus applied to the plant. In this paper, we have presented a statistical analysis pipeline to tackle a multiclass environmental stimuli classification problem with unbalanced plant electrophysiological data. The objective here is to classify three different environmental chemical stimuli, using fifteen statistical features, extracted from the plant electrical signals and compare the performance of eight different classification algorithms. A comparison using reduced dimensional projection of the high dimensional features via principal component analysis (PCA) has also been presented. Since the experimental data is highly unbalanced due to varying length of the experiments, we employ a random under-sampling approach for the two majority classes to create an ensemble of confusion matrices to compare the classification performances. Along with this, three other multi-classification performance metrics commonly used for unbalanced data viz. balanced accuracy, F1-score and Matthews correlation coefficient have also been analyzed. From the stacked confusion matrices and the derived performance metrics, we choose the best feature-classifier setting in terms of the classification performances carried out in the original high dimensional vs. the reduced feature space, for this highly unbalanced multiclass problem of plant signal classification due to different chemical stress. Difference in the classification performances in the high vs. reduced dimensions are also quantified using the multivariate analysis of variance (MANOVA) hypothesis testing. Our findings have potential real-world applications in precision agriculture for exploring multiclass classification problems with highly unbalanced datasets, employing a combination of existing machine learning algorithms. This work also advances existing studies on environmental pollution level monitoring using plant electrophysiological data., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Bhadra et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

The growing popularity of big data analysis and cloud computing has created new big data management standards. Sometimes, programmers may interact with a number of heterogeneous data stores depending on the information they are responsible for: SQL and NoSQL data stores. Interacting with heterogeneous data models via numerous APIs and query languages imposes challenging tasks on multi-data processing developers. Indeed, complex queries concerning homogenous data structures cannot currently be performed in a declarative manner when found in single data storage applications and therefore require additional development efforts. Many models were presented in order to address complex queries Via multistore applications. Some of these models implemented a complex unified and fast model, while others' efficiency is not good enough to solve this type of complex database queries. This paper provides an automated, fast and easy unified architecture to solve simple and complex SQL and NoSQL queries over heterogeneous data stores (CQNS). This proposed framework can be used in cloud environments or for any big data application to automatically help developers to manage basic and complicated database queries. CQNS consists of three layers: matching selector layer, processing layer, and query execution layer. The matching selector layer is the heart of this architecture in which five of the user queries are examined if they are matched with another five queries stored in a single engine stored in the architecture library. This is achieved through a proposed algorithm that directs the query to the right SQL or NoSQL database engine. Furthermore, CQNS deal with many NoSQL Databases like MongoDB, Cassandra, Riak, CouchDB, and NOE4J databases. This paper presents a spark framework that can handle both SQL and NoSQL Databases. Four scenarios' benchmarks datasets are used to evaluate the proposed CQNS for querying different NoSQL Databases in terms of optimization process performance and query execution time. The results show that, the CQNS achieves best latency and throughput in less time among the compared systems. [ABSTRACT FROM AUTHOR]

Aimed at the security authentication problem between Near Field Communication (NFC) devices, this paper uses the technology of asymmetric encryption algorithm, symmetric encryption algorithm, hash function, timestamp and survival period to improve the confidentiality, performance and security of the protocol. The symmetric encryption algorithm encrypts the transmission content, while the asymmetric encryption algorithm encrypts the shared key. The whole authentication process is secure, and the key distribution is secure. The improved NFC device authentication protocol can effectively resist the brute force attack, man-in-the-middle attack and replay attack in the authentication process, it can reduce the number of message transmission in the authentication process, improve the transmission efficiency, enhance the confidentiality, integrity, non-repudiation and improve the security of NFC device authentication. [ABSTRACT FROM AUTHOR]

Background: Oesophageal cancer has significant morbidity and mortality but late diagnosis is common since early signs of disease are frequently misinterpreted. Project DELTA aims to enable earlier detection and treatment through targeted screening using a novel risk prediction algorithm for oesophageal cancer (incorporating risk factors of Barrett's oesophagus including prescriptions for acid-reducing medications (CanPredict)), together with a non-invasive, low-cost sampling device (CytospongeTM). However, there are many barriers to implementation, and this paper identifies key ethical and legal challenges to implementing these personalised prevention strategies for Barrett's oesophagus/oesophageal cancer. Methods: To identify ethical and legal issues relevant to the deployment of a risk prediction tool for oesophageal cancer into primary care, we adopted an interdisciplinary approach, incorporating targeted informal literature reviews, interviews with expert collaborators, a multidisciplinary workshop and ethical and legal analysis. Results: Successful implementation raises many issues including ensuring transparency and effective risk communication; addressing bias and inequity; managing resources appropriately and avoiding exceptionalism. Clinicians will need support and training to use cancer risk prediction algorithms, ensuring that they understand how risk algorithms supplement rather than replace medical decision-making. Workshop participants had concerns about liability for harms arising from risk algorithms, including from potential bias and inequitable implementation. Determining strategies for risk communication enabling transparency but avoiding exceptionalist approaches are a significant challenge. Future challenges include using artificial intelligence to bolster risk assessment, incorporating genomics into risk tools, and deployment by non-health professional users. However, these strategies could improve detection and outcomes. Conclusions: Novel pathways incorporating risk prediction algorithms hold considerable promise, especially when combined with low-cost sampling. However immediate priorities should be to develop risk communication strategies that take account of using validated risk algorithms, and to ensure equitable implementation. Resolving questions about liability for harms arising should be a longer-term objective. [ABSTRACT FROM AUTHOR]

Patients must always communicate with their doctor for checking their health status. In recent years, wireless body sensor networks (WBSNs) has an important contribution in Healthcare. In these applications, energy-efficient and secure routing is really critical because health data of individuals must be forwarded to the destination securely to avoid unauthorized access by malicious nodes. However, biosensors have limited resources, especially energy. Recently, energy-efficient solutions have been proposed. Nevertheless, designing lightweight security mechanisms has not been stated in many schemes. In this paper, we propose a secure routing approach based on the league championship algorithm (LCA) for wireless body sensor networks in healthcare. The purpose of this scheme is to create a tradeoff between energy consumption and security. Our approach involves two important algorithms: routing process and communication security. In the first algorithm, each cluster head node (CH) applies the league championship algorithm to choose the most suitable next-hop CH. The proposed fitness function includes parameters like distance from CHs to the sink node, remaining energy, and link quality. In the second algorithm, we employs a symmetric encryption strategy to build secure connection links within a cluster. Also, we utilize an asymmetric cryptography scheme for forming secure inter-cluster connections. Network simulator version 2 (NS2) is used to implement the proposed approach. The simulation results show that our method is efficient in terms of consumed energy and delay. In addition, our scheme has good throughput, high packet delivery rate, and low packet loss rate. [ABSTRACT FROM AUTHOR]

A novel breast ultrasound tomography system based on a circular array of capacitive micromechanical ultrasound transducers (CMUT) has broad application prospects. However, the images produced by this system are not suitable as input for the training phase of the super-resolution (SR) reconstruction algorithm. To solve the problem, this paper proposes an improved medical image super-resolution (MeSR) method based on the sparse domain. First, we use the simultaneous algebraic reconstruction technique (SART) with high imaging accuracy to reconstruct the image into a training image in a sparse domain model. Secondly, we denoise and enhance the contrast of the SART images to obtain improved detail images before training the dictionary. Then, we use the original detail image as the guide image to further process the improved detail image. Therefore, a high-precision dictionary was obtained during the testing phase and applied to filtered back projection SR reconstruction. We compared the proposed algorithm with previously reported algorithms in the Shepp Logan model and the model based on the CMUT background. The results showed significant improvements in peak signal-to-noise ratio, entropy, and average gradient compared to previously reported algorithms. The experimental results demonstrated that the proposed MeSR method can use noisy reconstructed images as input for the training phase of the SR algorithm and produce excellent visual effects. [ABSTRACT FROM AUTHOR]

This paper proposes SAR imaging algorithm with largest coherence based on the existing SAR imaging algorithm. The basic idea of SAR imaging algorithm in imaging processing is that output signal can have maximum signal-to-noise ratio (SNR) by using the optimal imaging parameters. Traditional imaging algorithm can acquire the best focusing effect, but would bring the decoherence phenomenon in subsequent interference process. Algorithm proposed in this paper is that SAR echo adopts consistent imaging parameters in focusing processing. Although the SNR of the output signal is reduced slightly, their coherence is ensured greatly, and finally the interferogram with high quality is obtained. In this paper, two scenes of Envisat ASAR data in Zhangbei are employed to conduct experiment for this algorithm. Compared with the interferogram from the traditional algorithm, the results show that this algorithm is more suitable for SAR interferometry (InSAR) research and application. [ABSTRACT FROM AUTHOR]

Wearing helmets is essential in two-wheeler traffic to reduce the incidence of injuries caused by accidents. We present FB-YOLOv7, an improved detection network based on the YOLOv7-tiny model. The objective of this network is to tackle the problems of both missed detection and false detection that result from the difficulties in identifying small targets and the constraints in equipment performance during helmet detection. By applying an enhanced Bi-Level Routing Attention, the network can improve its capacity to extract global characteristics and reduce information distortion. Furthermore, we deploy the AFPN framework and effectively resolve information conflict using asymptotic adaptive feature fusion technology. Incorporating the EfficiCIoU loss significantly improves the prediction box's accuracy. Experimental trials done on specific datasets reveal that FB-YOLOv7 attains an accuracy of 87.2% and 94.6% on the mean average precision (mAP@.5). Additionally, it maintains a high level of efficiency with frame rates of 129 and 126 frames per second (FPS). FB-YOLOv7 surpasses the other six widely-used detection networks in terms of detection accuracy, network implementation requirements, sensitivity in detecting small targets, and potential for practical applications. [ABSTRACT FROM AUTHOR]

In order to improve the detection performance of image fusion in focus areas and realize end-to-end decision diagram optimization, we design a multi-focus image fusion network based on deep learning. The network is trained using unsupervised learning and a multi-scale hybrid attention residual network model is introduced to enable solving for features at different levels of the image. In the training stage, multi-scale features are extracted from two source images with different focal points using hybrid multi-scale residual blocks (MSRB), and the up-down projection module (UDP) is introduced to obtain multi-scale edge information, then the extracted features are operated to obtain deeper image features. These blocks can effectively utilize multi-scale feature information without increasing the number of parameters. The deep features of the image are extracted in its test phase, input to the spatial frequency domain to calculate and measure the activity level and obtain the initial decision map, and use post-processing techniques to eliminate the edge errors. Finally, the decision map is generated and optimized, and the final fused image is obtained by combining the optimized decision map with the source image. The comparative experiments show that our proposed model achieves better fusion performance in subjective evaluation, and the quality of the obtained fused images is more robust with richer details. The objective evaluation metrics work better and the image fusion quality is higher. [ABSTRACT FROM AUTHOR]

The application of pattern mining algorithms to extract movement patterns from sports big data can improve training specificity by facilitating a more granular evaluation of movement. Since movement patterns can only occur as consecutive, non-consecutive, or non-sequential, this study aimed to identify the best set of movement patterns for player movement profiling in professional rugby league and quantify the similarity among distinct movement patterns. Three pattern mining algorithms (l-length Closed Contiguous [LCCspm], Longest Common Subsequence [LCS] and AprioriClose) were used to extract patterns to profile elite rugby football league hookers (n = 22 players) and wingers (n = 28 players) match-games movements across 319 matches. Jaccard similarity score was used to quantify the similarity between algorithms' movement patterns and machine learning classification modelling identified the best algorithm's movement patterns to separate playing positions. LCCspm and LCS movement patterns shared a 0.19 Jaccard similarity score. AprioriClose movement patterns shared no significant Jaccard similarity with LCCspm (0.008) and LCS (0.009) patterns. The closed contiguous movement patterns profiled by LCCspm best-separated players into playing positions. Multi-layered Perceptron classification algorithm achieved the highest accuracy of 91.02% and precision, recall and F1 scores of 0.91 respectively. Therefore, we recommend the extraction of closed contiguous (consecutive) over non-consecutive and non-sequential movement patterns for separating groups of players. [ABSTRACT FROM AUTHOR]

Mapper, a topological algorithm, is frequently used as an exploratory tool to build a graphical representation of data. This representation can help to gain a better understanding of the intrinsic shape of high-dimensional genomic data and to retain information that may be lost using standard dimension-reduction algorithms. We propose a novel workflow to process and analyze RNA-seq data from tumor and healthy subjects integrating Mapper, differential gene expression, and spectral shape analysis. Precisely, we show that a Gaussian mixture approximation method can be used to produce graphical structures that successfully separate tumor and healthy subjects, and produce two subgroups of tumor subjects. A further analysis using DESeq2, a popular tool for the detection of differentially expressed genes, shows that these two subgroups of tumor cells bear two distinct gene regulations, suggesting two discrete paths for forming lung cancer, which could not be highlighted by other popular clustering methods, including t-distributed stochastic neighbor embedding (t-SNE). Although Mapper shows promise in analyzing high-dimensional data, tools to statistically analyze Mapper graphical structures are limited in the existing literature. In this paper, we develop a scoring method using heat kernel signatures that provides an empirical setting for statistical inferences such as hypothesis testing, sensitivity analysis, and correlation analysis., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Amézquita et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

An electrocardiograph (ECG) is widely used in diagnosis and prediction of cardiovascular diseases (CVDs). The traditional ECG classification methods have complex signal processing phases that leads to expensive designs. This paper provides a deep learning (DL) based system that employs the convolutional neural networks (CNNs) for classification of ECG signals present in PhysioNet MIT-BIH Arrhythmia database. The proposed system implements 1-D convolutional deep residual neural network (ResNet) model that performs feature extraction by directly using the input heartbeats. We have used synthetic minority oversampling technique (SMOTE) that process class-imbalance problem in the training dataset and effectively classifies the five heartbeat types in the test dataset. The classifier's performance is evaluated with ten-fold cross validation (CV) using accuracy, precision, sensitivity, F1-score, and kappa. We have obtained an average accuracy of 98.63%, precision of 92.86%, sensitivity of 92.41%, and specificity of 99.06%. The average F1-score and Kappa obtained were 92.63% and 95.5% respectively. The study shows that proposed ResNet performs well with deep layers compared to other 1-D CNNs., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Khan et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Understanding handwritten documents is a vital and challenging problem that attracts many researchers in the fields of forensic and authentication science. This paper presents an offline system for text-independent writer identification of handwritten documents. The system extracts a handwritten connected component contour, which in turn is divided into segments of specific length. The system utilizes the concept of a bag of features in the writer recognition domain and considers handwritten contour segments to extract two conceptually simple and effective structural features. These features are the contour point curve angle and the CONtour point CONcavity/CONvexity. The system uses the proposed features to train a k-means clustering algorithm to construct a codebook of size K. The method then uses occurrence histograms of the extracted features in the codebook to create a final feature vector for each handwritten document. The effectiveness of the proposed features is evaluated in the writer identification domain using two widely used classification methods: the nearest neighbor and the support vector machine techniques. The proposed writer identification is evaluated on two large and public datasets from different language domains, the Arabic KHATT and English IAM datasets. The experimental results show that the proposed system outperforms state-of-the-art methods on the IAM dataset and provides competitive results on the KHATT dataset with respect to the identification rate., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Ahmed et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Multi-view data can be generated from diverse sources, by different technologies, and in multiple modalities. In various fields, integrating information from multi-view data has pushed the frontier of discovery. In this paper, we develop a new approach for multi-view clustering, which overcomes the limitations of existing methods such as the need of pooling data across views, restrictions on the clustering algorithms allowed within each view, and the disregard for complementary information between views. Our new method, called CPS-merge analysis, merges clusters formed by the Cartesian product of single-view cluster labels, guided by the principle of maximizing clustering stability as evaluated by CPS analysis. In addition, we introduce measures to quantify the contribution of each view to the formation of any cluster. CPS-merge analysis can be easily incorporated into an existing clustering pipeline because it only requires single-view cluster labels instead of the original data. We can thus readily apply advanced single-view clustering algorithms. Importantly, our approach accounts for both consensus and complementary effects between different views, whereas existing ensemble methods focus on finding a consensus for multiple clustering results, implying that results from different views are variations of one clustering structure. Through experiments on single-cell datasets, we demonstrate that our approach frequently outperforms other state-of-the-art methods., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Zhang et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Stock market prediction is the process of determining the value of a company's shares and other financial assets in the future. This paper proposes a new model where Altruistic Dragonfly Algorithm (ADA) is combined with Least Squares Support Vector Machine (LS-SVM) for stock market prediction. ADA is a meta-heuristic algorithm which optimizes the parameters of LS-SVM to avoid local minima and overfitting, resulting in better prediction performance. Experiments have been performed on 12 datasets and the obtained results are compared with other popular meta-heuristic algorithms. The results show that the proposed model provides a better predictive ability and demonstrate the effectiveness of ADA in optimizing the parameters of LS-SVM., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Chatterjee et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Background: The expectation maximization (EM) algorithm is a common tool for estimating the parameters of Gaussian mixture models (GMM). However, it is highly sensitive to initial value and easily gets trapped in a local optimum., Method: To address these problems, a new iterative method of EM initialization (MRIPEM) is proposed in this paper. It incorporates the ideas of multiple restarts, iterations and clustering. In particular, the mean vector and covariance matrix of sample are calculated as the initial values of the iteration. Then, the optimal feature vector is selected from the candidate feature vectors by the maximum Mahalanobis distance as a new partition vector for clustering. The parameter values are renewed continuously according to the clustering results., Results: To verify the applicability of the MRIPEM, we compared it with other two popular initialization methods on simulated and real datasets, respectively. The comparison results of the three stochastic algorithms indicate that MRIPEM algorithm is comparable in relatively high dimensions and high overlaps and significantly better in low dimensions and low overlaps., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 You et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

The operation of the system's frequency can be strongly impacted by load change, solar irradiation, wind disturbance, and system parametric uncertainty. In this paper, the application of an adaptive controller based on a hybrid Jaya-Balloon optimizer (JBO) for frequency oscillation mitigation in a single area smart μG system is studied. The proposed adaptive control approach is applied to control the flexible loads such as HPs and EVs by using the JBO which efficiently controls the system frequency. The suggested technique uses the power balance equation to provide a dynamic output feedback controller. The main target is to regulate the frequency and power of an islanded single area μG powered by a PV and a diesel generator with integrations of smart bidirectional loads (HPs and EVs) that are controlled by the proposed adaptive controller in presence of electrical random loads. Moreover, the JBO is designed to minimize the effect of the system load disturbance and parameter variations. For a better assessment, the proposed controller using JBO technique is compared with two other methods which are the coefficient diagram method (CDM) and adaptive one using classical the Jaya technique. In the obtained results, the frequency deviation is found as 0.0015 Hz, which is fully acceptable and in the range of the IEEE standards. The MATLAB simulation results reveal that the suggested technique has a substantial advantage over other techniques in terms of frequency stability in the face of concurrent disturbances and parameter uncertainties. The real-time simulation tests are presented using a dSPACE DS1103 connected to another PC via QUARC pid_e data acquisition card and confirmed the MATLAB simulation results., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Ewais et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

This paper describes a new method of classification based on spectral analysis. The motivations behind developing the new model were the failures of the classical spectral cluster analysis based on combinatorial and normalized Laplacian for a set of real-world datasets of textual documents. Reasons of the failures are analysed. While the known methods are all based on usage of eigenvectors of graph Laplacians, a new classification method based on eigenvalues of graph Laplacians is proposed and studied., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Borkowski et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

While linking records across large administrative datasets ["big data"] has the potential to revolutionize empirical social science research, many administrative data files do not have common identifiers and are thus not designed to be linked to others. To address this problem, researchers have developed probabilistic record linkage algorithms which use statistical patterns in identifying characteristics to perform linking tasks. Naturally, the accuracy of a candidate linking algorithm can be substantially improved when an algorithm has access to "ground-truth" examples-matches which can be validated using institutional knowledge or auxiliary data. Unfortunately, the cost of obtaining these examples is typically high, often requiring a researcher to manually review pairs of records in order to make an informed judgement about whether they are a match. When a pool of ground-truth information is unavailable, researchers can use "active learning" algorithms for linking, which ask the user to provide ground-truth information for select candidate pairs. In this paper, we investigate the value of providing ground-truth examples via active learning for linking performance. We confirm popular intuition that data linking can be dramatically improved with the availability of ground truth examples. But critically, in many real-world applications, only a relatively small number of tactically-selected ground-truth examples are needed to obtain most of the achievable gains. With a modest investment in ground truth, researchers can approximate the performance of a supervised learning algorithm that has access to a large database of ground truth examples using a readily available off-the-shelf tool., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Tahamont et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

At present, the applications of multiple unmanned aerial vehicles (UAVs) are becoming more and more widespread, covering many civil and military fields. When performing tasks, UAVs will form a flying ad hoc network (FANET) to communicate to each other. However, subject to high mobility, dynamic topology, and limited energy of FANETs, maintaining stable communication performance is a challenging task. As a potential solution, the clustering routing algorithm divides the entire network into multiple clusters to achieve strong network performance. Meanwhile, the accurate localization of UAV is also strongly required when FANETs are applied in the indoor scenario. In this paper, we propose a firefly swarm intelligence based cooperative localization (FSICL) and automatic clustering (FSIAC) for FANETs. Firstly, we combine the firefly algorithm (FA) and Chan algorithm to better cooperative locate the UAVs. Secondly, we propose the fitness function consisting of link survival probability, node degree-difference, average distance, and residual energy, and take it as the light intensity of the firefly. Thirdly, the FA is put forward for cluster-head (CH) selection and cluster formation. Simulation results indicate that the proposed FSICL algorithm achieves the higher localization accuracy faster, and the FSIAC algorithm achieves the higher stability of clusters, longer link expiration time (LET), and longer node lifetime, all of which improve the communication performance for indoor FANETs., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Chen et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Business angels dominate early-stage investment in firms, but research on their effects on firms is scarce and limited by sample selection. To address sample selection, we propose using population data and we develop an algorithm for identifying business angel investments in such data. We illustrate this novel approach by applying it to detailed and longitudinal total population data for individuals and firms in Sweden. In our application, we focus on a subset of business angels-active business angels who are themselves successful entrepreneurs with a profitable exit. We then study active business angels' effects on firm performance, using population data. Employing a quasi-experimental estimator, we find that the business angels invest in firms that already perform above par. There is also a positive effect on subsequent growth compared with control firms. However, contrary to previous research on business angels, we cannot find any impact on firm survival. Overall, the paper underlines the need to address sample selection when studying business angels and suggests using population data for identification., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Lodefalk, Andersson. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

The Global Navigation Satellite System (GNSS) is unreliable in some situations. To mend the poor GNSS signal, an autonomous vehicle can self-localize by matching a ground image against a database of geotagged aerial images. However, this approach has challenges because of the dramatic differences in the viewpoint between aerial and ground views, harsh weather and lighting conditions, and the lack of orientation information in training and deployment environments. In this paper, it is shown that previous models in this area are complementary, not competitive, and that each model solves a different aspect of the problem. There was a need for a holistic approach. An ensemble model is proposed to aggregate the predictions of multiple independently trained state-of-the-art models. Previous state-of-the-art (SOTA) temporal-aware models used heavy-weight network to fuse the temporal information into the query process. The effect of making the query process temporal-aware is explored and exploited by an efficient meta block: naive history. But none of the existing benchmark datasets was suitable for extensive temporal awareness experiments, a new derivative dataset based on the BDD100K dataset is generated. The proposed ensemble model achieves a recall accuracy R@1 (Recall@1: the top most prediction) of 97.74% on the CVUSA dataset and 91.43% on the CVACT dataset (surpassing the current SOTA). The temporal awareness algorithm converges to R@1 of 100% by looking at a few steps back in the trip history., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Ghanem et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Swarm intelligence algorithms (SI) have an excellent ability to search for the optimal solution and they are applying two mechanisms during the search. The first mechanism is exploration, to explore a vast area in the search space, and when they found a promising area they switch from the exploration to the exploitation mechanism. A good SI algorithm can balance the exploration and the exploitation mechanism. In this paper, we propose a modified version of the chimp optimization algorithm (ChOA) to train a feed-forward neural network (FNN). The proposed algorithm is called a modified weighted chimp optimization algorithm (MWChOA). The main drawback of the standard ChOA and the weighted chimp optimization algorithm (WChOA) is they can be trapped in local optima because most of the solutions update their positions based on the position of the four leader solutions in the population. In the proposed algorithm, we reduced the number of leader solutions from four to three, and we found that reducing the number of leader solutions enhances the search and increases the exploration phase in the proposed algorithm, and avoids trapping in local optima. We test the proposed algorithm on the Eleven dataset and compare it against 16 SI algorithms. The results show that the proposed algorithm can achieve success to train the FNN when compare to the other SI algorithms., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Atta et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

This paper studies the flexible large-scale supplier selection and order allocation problem with various quantity discounts, i.e., no discount, all-unit discount, incremental discount, and carload discount. It fills a literature gap that models usually formulate one or seldom two types because of the modeling and solution difficulty. All suppliers offering the same discount are far from reality, especially when the number of suppliers is large. The proposed model is a variant of the NP-hard knapsack problem. The greedy algorithm, which solves the fractional knapsack problem optimally, is applied to cope with the challenge. Three greedy algorithms are developed using a problem property and two sorted lists. Simulations show the average optimality gaps are 0.1026%, 0.0547%, and 0.0234% and the model can be solved in centiseconds, densiseconds, and seconds for supplier numbers 1000, 10000, and 100000. This allows the full use of data in the big data era., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Qing Wang. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Ancient manuscripts are a rich source of history and civilization. Unfortunately, these documents are often affected by different age and storage related degradation which impinge on their readability and information contents. In this paper, we propose a document restoration method that removes the unwanted interfering degradation patterns from color ancient manuscripts. We exploit different color spaces to highlight the spectral differences in various layers of information usually present in these documents. At each image pixel, the spectral representations of all color spaces are stacked to form a feature vector. PCA is applied to the whole data cube to eliminate correlation of the color planes and enhance separation among the patterns. The reduced data cube, along with the pixel spatial information, is used to perform a pixel based segmentation, where each cluster represents a class of pixels that share similar color properties in the decorrelated color spaces. The interfering, unwanted classes can thus be removed by inpainting their pixels with the background texture. Assuming Gaussian distributions for the various classes, a Gaussian Mixture Model (GMM) is estimated through the Expectation Maximization (EM) algorithm from the data, and then used to find appropriate labels for each pixel. In order to preserve the original appearance of the document and reproduce the background texture, the detected degraded pixels are replaced based on Gaussian conditional simulation, according to the surrounding context. Experiments are shown on manuscripts affected by different kinds of degradations, including manuscripts from the DIBCO 2018 and 2019 publicaly available dataset. We observe that the use of a few PCA dominant components accelerates the clustering process and provides a more accurate segmentation., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Hanif et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

In this paper, a dynamic sub-route-based self-adaptive beam search Q-learning (DSRABSQL) algorithm is proposed that provides a reinforcement learning (RL) framework combined with local search to solve the traveling salesman problem (TSP). DSRABSQL builds upon the Q-learning (QL) algorithm. Considering its problems of slow convergence and low accuracy, four strategies within the QL framework are designed first: the weighting function-based reward matrix, the power function-based initial Q-table, a self-adaptive ε-beam search strategy, and a new Q-value update formula. Then, a self-adaptive beam search Q-learning (ABSQL) algorithm is designed. To solve the problem that the sub-route is not fully optimized in the ABSQL algorithm, a dynamic sub-route optimization strategy is introduced outside the QL framework, and then the DSRABSQL algorithm is designed. Experiments are conducted to compare QL, ABSQL, DSRABSQL, our previously proposed variable neighborhood discrete whale optimization algorithm, and two advanced reinforcement learning algorithms. The experimental results show that DSRABSQL significantly outperforms the other algorithms. In addition, two groups of algorithms are designed based on the QL and DSRABSQL algorithms to test the effectiveness of the five strategies. From the experimental results, it can be found that the dynamic sub-route optimization strategy and self-adaptive ε-beam search strategy contribute the most for small-, medium-, and large-scale instances. At the same time, collaboration exists between the four strategies within the QL framework, which increases with the expansion of the instance scale., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Zhang et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Recently, a lot of Chinese patients consult treatment plans through social networking platforms, but the Chinese medical text contains rich information, including a large number of medical nomenclatures and symptom descriptions. How to build an intelligence model to automatically classify the text information consulted by patients and recommend the correct department for patients is very important. In order to address the problem of insufficient feature extraction from Chinese medical text and low accuracy, this paper proposes a dual channel Chinese medical text classification model. The model extracts feature of Chinese medical text at different granularity, comprehensively and accurately obtains effective feature information, and finally recommends departments for patients according to text classification. One channel of the model focuses on medical nomenclatures, symptoms and other words related to hospital departments, gives different weights, calculates corresponding feature vectors with convolution kernels of different sizes, and then obtains local text representation. The other channel uses the BiGRU network and attention mechanism to obtain text representation, highlighting the important information of the whole sentence, that is, global text representation. Finally, the model uses full connection layer to combine the representation vectors of the two channels, and uses Softmax classifier for classification. The experimental results show that the accuracy, recall and F1-score of the model are improved by 10.65%, 8.94% and 11.62% respectively compared with the baseline models in average, which proves that our model has better performance and robustness., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Li et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

In 2012, Rivaie et al. introduced RMIL conjugate gradient (CG) method which is globally convergent under the exact line search. Later, Dai (2016) pointed out abnormality in the convergence result and thus, imposed certain restricted RMIL CG parameter as a remedy. In this paper, we suggest an efficient RMIL spectral CG method. The remarkable feature of this method is that, the convergence result is free from additional condition usually imposed on RMIL. Subsequently, the search direction is sufficiently descent independent of any line search technique. Thus, numerical experiments on some set of benchmark problems indicate that the method is promising and efficient. Furthermore, the efficiency of the proposed method is demonstrated on applications arising from arm robotic model and image restoration problems., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Salihu et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

In today's society, time is considered more valuable than money, and researchers often have limited time to find relevant papers for their research. Identifying and accessing essential information can be a challenge in this situation. To address this, the personalized suggestion system has been developed, which uses a user's behavior data to suggest relevant items. The collaborative filtering strategy has been used to provide a user with the top research articles based on their queries and similarities with other users' questions, thus saving time by avoiding time-consuming searches. However, when rating data is abundant but sparse, the usual method of determining user similarity is relatively straightforward. Furthermore, it fails to account for changes in users' interests over time resulting in poor performance. This research proposes a new similarity measure approach that takes both user confidence and time context into account to increase user similarity computation. The experimental results show that the proposed technique works well with sparse data, and improves accuracy by 16.2% compared to existing models, especially during prediction. Furthermore, it enhances the quality of recommendations., Competing Interests: The authors declare no conflict of interest., (Copyright: © 2023 T. R. et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Private networks have become popular for secure data sharing and anonymous communication in many domains: enterprise environments, military, journalism, telecommunication, healthcare, to name a few. It has been used with or without internet connection. Its primary purpose is to provide confidentiality, bypass unlawful activities, and protect against common threats such as interception, modification, and censorship. In addition, several private network technologies exist to support secure communications. However, they mostly rely on encryption only. The transmitted data is classified into different confidentiality levels. This research presents a smart private network architecture scheme that transmits constraint-based classified packets. The main directive of this work is the proposed constraint. This constraint is meant to enforce that if two packets belong to the same confidentiality level, they can't be transmitted through the two routers simultaneously. Therefore, the studied problem is an NP-hard problem. This paper presents the following contributions: (i) proposes a new architecture paradigm for outsourcing a constraint-based multi-classified data sharing securely and transmitted through two routers; (ii) introduces several algorithms to prove the feasibility for this NP-Hard problem; and (iii) implements the algorithms solutions using C++ and compares their performance. Different metrics are used to measure the performance of the proposed algorithms. Randomized Longest Transmission time first algorithm [Formula: see text] scored the best algorithm with a percentage of 73.5% and an average gap of 0.002 according to the experimental results. It is remarkable worthy to note that the execution time of all the algorithms is less than 0.001 s., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Sarhan, Jemmali. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Currently, the deep integration of the Internet of Things (IoT) and edge computing has improved the computing capability of the IoT perception layer. Existing offloading techniques for edge computing suffer from the single problem of solidifying offloading policies. Based on this, combined with the characteristics of deep reinforcement learning, this paper investigates a computation offloading optimization scheme for the perception layer. The algorithm can adaptively adjust the computational task offloading policy of IoT terminals according to the network changes in the perception layer. Experiments show that the algorithm effectively improves the operational efficiency of the IoT perceptual layer and reduces the average task delay compared with other offloading algorithms., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Xing et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Recently, The Egyptian health sector whether it is public or private; utilizes emerging technologies such as data mining, business intelligence, Internet of Things (IoT), among many others to enhance the service and to deal with increasing costs and growing pressures. However, process mining has not yet been used in the Egyptian organizations, whereas the process mining can enable the domain experts in many fields to achieve a realistic view of the problems that are currently happening in the undertaken field, and thus solve it. This paper presents application of the process mining techniques in the healthcare field to obtain meaningful insights about its careflows, e.g., to discover typical paths followed by certain patient groups. Also, to analyze careflows that have a high degree of dynamic and complexity. The proposed methodology starts by the preprocess step on the event logs to eliminate outliers and clean the event log. And then apply a set of the popular discovery miner algorithms to discover the process model. Then careflows processes are analyzed from three main perspectives: the control-flow perspective, the performance perspective and, the organizational perspective. That contributes with many insights for the domain experts to improve the existing careflows. Through evaluating the simplicity metric of extracted models; the paper suggested a method to quantify the simplicity metric. The paper used a dataset from a cardiac surgery unit in an Egyptian hospital. The results of the applied process mining techniques provide the hospital managers a real analysis and insights to make the patient journey easier., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Rashed et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)