The last-mile logistics in cities have become an indispensable part of the urban logistics system. This study aims to explore the effective selection of last-mile logistics nodes to enhance the efficiency of logistics distribution, strengthen the corporate distribution image, and further reduce corporate operating costs and alleviate urban traffic congestion. This paper proposes a clustering-based approach to identify urban logistics nodes from the perspective of geographic information fusion. This method comprehensively considers several key indicators, including the coverage, balance, and urban traffic conditions of logistics distribution. Additionally, we employed a greedy algorithm to identify secondary nodes around primary nodes, thus constructing an effective nodal network. To verify the practicality of this model, we conducted an empirical simulation study using the logistics demand and traffic conditions in the Xianlin District of Nanjing. This research not only identified the locations of primary and secondary logistics nodes but also provided a new perspective for constructing the urban last-mile logistics system, enriching the academic research related to logistics node construction. The results of this study are of significant theoretical and practical importance for optimizing urban logistics networks, enhancing logistics efficiency, and promoting the improvement of urban traffic conditions.

Objectives: Few studies have evaluated and compared artificial intelligence (AI) models for breast cancer detection on the same database. The purpose is to compare the performances of 3 artificial intelligence algorithms on the same dataset at a free operative threshold and to evaluate how the performance is impacted by the chosen threshold. Materials: In this retrospective single-center study, a dataset of 314 2D screening mammograms performed between 2012 and 2020 was established with a prevalence of 19.6% of histologically proven cancer. Three AI constructors using CE (European conformity) marking algorithms have agreed to take part in the study by submitting the cancer-enriched cohort to their algorithm. They chose a free operative threshold to distinguish benign and malignant mammograms. The most suspicious lesion was marked and correctly located by the AI algorithm. Statistical parameters were analyzed and compared between the algorithms. Results: Regarding both sensitivity and specificity, at the chosen threshold, AI 1 had the best compromise between sensitivity (74%) and specificity (79%). AI 2 had a statistically lower sensitivity (52%; p<0.05) with a higher specificity (98.4%) than the other AI algorithms. AI 3 had a nonsignificant sensitivity difference (69.9%) but a significantly lower specificity (45.3%; p<0.001) than the other two. The performances varied depending on the chosen threshold; when the AI 2 threshold was lowered, the sensitivity increased (69.9%), while a higher specificity (86.1%) was maintained. Conclusion: Two AI algorithms stood out in terms of performance when the threshold was optimized, resulting in an acceptable sensitivity and specificity.

In the moist environment of soil-water-air, there is a problem of low accuracy in monitoring Volatile Organic Compounds (VOCs) using a Photoionization Detector (PID). This paper analyzes the reasons for the low accuracy of the traditional Support Vector Machine (SVM) regression method. To address the issue, the PID signal is subjected to feature extraction and Principal Component Analysis (PCA) to reduce the data dimensionality. Moreover, the optimal SVM parameters are selected using a Genetic Algorithm (GA), and a combined approach of SVM regression with PCA and GA is utilized for PID signal regression analysis. And the effectiveness of the method is validated through extensive experiments and simulations. Furthermore, the influence of the sample quantity on the regression accuracy is analyzed, enabling accurate monitoring of VOCs concentration in a moist environment.

The algorithmic complexity vulnerability (ACV) that may lead to denial of service attacks greatly disrupts the security and availability of applications, and due to the widespread use of third-party libraries, its impact may be amplified through the software supply chain. The existing work in the field is dedicated to abstract loop or iterative patterns and fuzzing the entire application to discover algorithm complexity vulnerabilities, but they still face efficiency and effectiveness issues. Our research focuses on: (1) Proposing a representation and extraction method for code features related to algorithmic complexity vulnerabilities, helping analysts quickly understand program logic; (2) Providing a new ACV detecting model, focusing on the spatial complexity anomalies caused by deep recursion structures, and proposing a new filtering method; (3) Aiming at the difficulty of efficiently generating complex-data-type-related payloads using existing symbol execution techniques, a call-chain-guided payload construction method is proposed. We tested third-party components in the open-source Java Maven Repository, identified many unexposed vulnerabilities and 8 of them received CVE (Common Vulnerabilities &amp; Exposures) identifiers, and demonstrated that our method can discover more algorithmic complexity vulnerabilities compared to existing tools with better performance.

An addition sequence is an important operation in many applications of computer science, such as multi-modular exponentiation and outsourcing protocols. Finding an addition sequence for a set of positive integers with the shortest length is challenging due to the high computational time required to find the solution. In this paper, a new metaheuristic algorithm is designed based on the simulated annealing strategy to generate a short addition sequence. The efficiency of the proposed algorithm was proved experimentally by comparing it with the previous exact and heuristic algorithms in terms of running time and the length of the addition sequence.

Predicting and evaluating the vitality level of public spaces of urban design is crucial before new construction and renewal, especially for developing countries, to avoid failures like "ghost neighborhood" and reduce resource waste. However, existing assessment methods for the urban vitality are either static and ignore changes in the time dimension, or rely on historical big data and are unable to predict unbuilt projects. This study combines previous methods and crowds’ characteristics observation in public space, puts forward the crowd-frequency hypothesis and constructs an algorithm, and establishes a time-dimensional urban vitality dynamic prediction model. Taking the Rundle Mall neighborhood in Adelaide, Australia, as an example, the effec-tiveness of the prediction model was proved through on-site observation sampling comparative verification method. In addition, the decision tree model was used to conduct machine learning on the case data, and a set of algorithm programs were obtained that can directly input some basic information to obtain the urban vitality level (high-medium-low) in a certain period. It can be used as a tool to support the design and decision-making processes of urban planners and government officials, providing a low-cost way to achieve sustainable urban vitality construction of late-developing cities directly.

This paper details a design optimization on a hardware accelerator for an on-board real-time SAR imaging system using the Backprojection algorithm, focusing on algorithm-specific approximations intended to reduce the overhead introduced by intensive functions such as the square root, sine, and cosine functions. The main novelty of this work is that new approximations were investigated so that the final image retains high quality regardless of the error in the approximation function. This paper revisits existing approximation methods, such as linear interpolation, polynomial approximation using the Vandermonde matrix, and Chebyshev polynomials, and compares their performance on the algorithm. Results demonstrate that it is possible to maintain the image quality with an SSIM above 0.99 with less 93% LUTs for the square root and less 88% LUTs for the sine and cosine functions using polynomial approximation with the Vandermonde matrix when compared to the HLS baseline functions.

In recent years, ozone (O3) pollution has been rapidly spreading, restricting further improvement of air quality in China. Investigating the interaction of O3 concentration and identifying their driven cities are important for the prevention and control of O3 pollution in China. However, the complex interaction between O3 pollution between the cities and their driven cities has not yet been revealed. In this study, we address this gap based on complex network methods. Specifically, an ozone relational network is constructed using an association calculation method. The driven nodes and spatial clusters were analyzed based on the maximum matching algorithm and the Louvain algorithm. The findings of the study reveal an aggregation phenomenon in the ozone network concerning distance. Furthermore, as the threshold Tc varies, the proportion of driven nodes exhibits a positive correlation. Moreover, a closer threshold value corresponds to a higher coincidence ratio of the driven nodes. The results provide scientific guidance for national O3 pollution prevention and regional synergy formatting. Furthermore, the introduced network-based approaches offer a mythological framework for the study of air pollution in key cities and clusters.

Software-Defined Networking (SDN) is a network implementation paradigm of great importance, as it has a profound impact on the pace of technological progress. While SDN doesn’t directly address the technical complexities of routing, congestion control, traffic engineering, security, mobility, reliability, or real-time communication, it paves the way for innovative solutions to emerge for these and similar challenges. Security is of utmost importance in SDN with Distributed Denial of Service (DDoS) being an attack which creates large scale problems. DDoS creates malicious traffic that resembles normal traffic in order to create service problems. As such, mechanisms that distinguish between benign and malicious traffic is essential, since this is the first step to mitigate the problem of DDoS. In this paper, we take a dataset onboard which exhibits benign and malicious traffic in SDN. There are 23 features that are used for classification purposes. Here we utilise classification procedure based on three methods based Grammatical Evolution applied on the aforementioned data. We provide results that show the efficiency of our approach and show that all three methods exhibits satisfactory results.

Camera malfunctions or loss of storage elements in imaging devices may lead to loss of important image information or random impulse noise interference. Low rank is one of the important prior information in image optimization processing. This paper uses different low-rank constraint models of the image matrices to recover the impulse interference satellite images. Firstly, an overview of image inpainting models based on nuclear norm, truncated nuclear norm, weighted nuclear norm, and matrix-factorization-based F-norm is presented, and corresponding optimiza-tion iterative algorithms are provided. Then, we conducted experiments under three types of pulse interference and provided visual and numerical results. Finally, it is concluded that the WSVT_ADMM method based on the weighted nuclear norm can obtain the best image inpainting results; The UV_ADMM method based on F norm of matrix factorization has the least computa-tion time and can be used for large-scale low-rank matrix computation; The WSVT_ADMM method based on weighted nuclear norm and the TSVT_ ADMM method based on truncated nuclear norms can significantly improve the repair effect compared to the nuclear norm-based methods such as SVT, SVP, and n_ADMM.

Premature ventricular complexes (PVCs) are frequently encountered in clinical practice. The association of PVCs with adverse cardiovascular outcomes in the context of structural heart disease is well established, yet the association between PVCs and cardiovascular outcomes in the absence of structural heart disease is not fully elucidated. Cardiac magnetic resonance (CMR) seems to contribute prognostically in the latter subgroup. PVC- induced myocardial dysfunction refers to the impairment of ventricular function due to the PVCs and is mainly associated with a PVC burden greater than 10%. The surface 12- lead ECG is used to localize the anatomic site of origin and multiple algorithms have been developed to differentiate right ventricular and left ventricular outflow tract (RVOT and LVOT, respectively) origin. Novel algorithms include alternative ECG configurations and lately, sophisticated artificial intelligence methods have been utilized to distinguish the origins of outflow tract arrhythmias. The decision to therapeutically address PVCs should be taken upon the presence of symptoms or the development of PVC- induced myocardial dysfunction. The therapeutic modalities include pharmacological therapy, namely I-C antiarrhythmic drugs and beta blockers, as well as catheter ablation, which demonstrates superior efficacy and safety.

Accurate and reliable measurement of real-world walking activity is clinically relevant, particularly for people with mobility difficulties. Insights on walking can help understand mobility function, disease progression, and fall risks. People living in long-term residential care environments have heterogeneous and often pathological walking patterns, making it difficult for conventional algorithms paired with wearable sensors to detect their walking activity. We designed two walking bout detection algorithms for people living in long-term residential care. Both algorithms used thresholds on the magnitude of acceleration from a 3-axis accelerometer on the lower back to classify data as “walking” or “non-walking”. One algorithm had generic thresholds, while the other used personalized thresholds. To validate and evaluate the algorithms, we compared the classifications of walking/non-walking from our algorithms to the real-time research assistant annotated labels and the classification from an algorithm validated on a healthy population. Both the generic and personalized algorithms had acceptable accuracy (0.83 and 0.82 respectively). The personalized algorithm showed the highest specificity (0.84) of all tested algorithms, meaning it was the best suited to determine input data for gait characteristic extraction. The developed algorithms were almost 60% quicker than the previously developed algorithms, suggesting they are adaptable for real-time processing.

Although ChatGPT promises wide-ranging applications, there is a concern that it is politically biased; in particular, it has a left-libertarian orientation. Nevertheless, in light of recent trends in attempts to reduce such biases, this study re-evaluated the political biases of ChatGPT using political orientation tests and the application programming interface. Moreover, the effects of the languages used in the system as well as gender and race settings were evaluated. The results indicated that ChatGPT had less political bias than previously thought; however, they did not entirely discount the political bias. The languages used in the system and the gender and race settings may induce political biases. These findings enhance our understanding of the political biases of ChatGPT and may be useful for bias evaluation and designing ChatGPT’s operational strategy.

Since the discovery of graphene, due to its excellent optical, thermal, mechanical and electrical properties, it has a broad application prospect in energy, materials, biomedicine, electromagnetism and other fields. A great quantity of researches on the physical mechanism of graphene has been applied to engineering in electromagnetism and optics. To study the properties of graphene, different kinds of numerical methods have been developed for simulating the electromagnetic field effects of graphene, and equivalent boundary conditions have been employed to replace graphene in the computational domain. In this work, the numerical methods with equivalent boundary conditions are reviewed, and some examples are provided to illustrate their applicability.

This paper outlines the detection procedure of intrusion as provided by Tripwire tool along-with the enhancement to be made in design and implementation to achieve the optimum performance level of Tripwire. It operates on effective and swift performance mechanism in order to report the system admin about the possible intrusion detected in the system with security assurance in cutting edge computer structures, which is very important in order to provide the integrity and reliability of information. In order to deal with this emerging issue in the historical research, the basic level of security is provided in the system by making enhancement in the existing tripwire tool for UNIX file system. The proposed methodological working of tripwire makes it more effective by adopting reliable and instantaneous mechanism to deal with specifically anomalies and unwanted access in the UNIX file system.

In this work we derive a generalized series expansion of the acrtangent function by using the enhanced midpoint integration (EMI). Algorithmic implementation of the generalized series expansion utilizes a simple two-step iteration. This approach significantly improves the convergence and requires no surd numbers in computation of the arctangent function.

The development of quantum computers seeks software developers' attention regarding security in the era of Information Technology, software security is the primary goal for our quantitative assessment of software security in the development cycle of software. Security assessment of software is identifying the key security factors of the software. A security elective provides ex-tensive strategies and calculations to ensure product safety. The security assessment is the key factor in surveying, administering, and controlling security to further enhance the nature of safety. It should be acknowledged that assessing security early on in the development process is beneficial in identifying worms, hazards, flaws, and threats. The definition and portrayal of Quantum Computing (QC) in software security will be discussed in this study. Researchers use cryptography calculations to secure our financial institutions, medical devices, military weaponry, planes, ships, vehicles, and pilots. Here authors of this study use the Fuzzy Technique for Order Preference by Similarity to Ideal Situation (FTOPSIS) to quantitatively assess the weight/rank of the quantum enable security alternatives like (Diffie-Hellman key-exchange algorithm, Quantum key distribution algorithm, Deutsch-Jozsa Algorithm, Special Deutsch-Jozsa Algorithm, Grover’s Algorithm and Quantum key distribution algorithm in GHZ state) with security factors like (Confidentiality, Integrity, Authenti-cation, Privacy, Reliability, Maintainability, Authorization, Integrity, Possessions, and Availability). Additionally, they critically analyze and select the six alternatives of quantum-based security algorithms. The nature of safety infers the ability to execute a thing on time in this exploration study, specifically 'software security'.

Stop words are very important for information retrieval and text analysis investigation. This study aimed to automatically analyze and detect stop words in texts in the Uzbek language. Because of the limited availability of methods for automatic search of stop words of texts in Uzbek we analyzed a newly prepared corpus. The Uzbek language belongs to the family of agglutinative languages. As with all agglutinative languages, we can explain that the detection of stop words in Uzbek texts is a more complex process than in inflected languages: In inflected languages, words such as auxiliary words, articles, prepositions can be included in the stop words group. In agglutinative languages, the meanings of such words are hidden in the text. Therefore, it is not appropriate to apply all known methods of stop words detection in inflected languages directly to agglutinative languages. In this work, the “School corpus” which contains 731156 Uzbek words has been investigated. The bigram method of analysis was applied to the corpus. We proposed the collocation method of detecting stop words of the corpus. We proposed the method of automatically detecting stop words of texts in Uzbek. It is shown that the collocation method is 6 times better than the bigram method.

In industrial environments, nesting consists in cutting or extracting pieces from a material sheet, with the purpose of minimizing the surface of the sheet used. This problem is present in different types of industries, such as shipping, aeronautics, woodworking, footwear, and so on. In this work, the aim is to find an acceptable solution to solve complex nesting problems. The research developed is oriented to sacrifice accuracy for speed so as to obtain robust solutions in less computational time. To achieve this, a greedy method and a genetic algorithm have been implemented, being the latter responsible for generating a sequence for the placement of the pieces, where each piece is placed in its current optimal position with the help of a representation system for both the pieces and the material sheet.

A graph based path planning method consisting of off-line part and on-line part for multi-UAV system in windy condition is proposed. In the off-line part, the task area is divided into grids. When two nodes is close enough, they are connected and weighted by the cost, obtained by solving an optimization problem based on difference method, between them. In order to ensure the accuracy of the difference method, the adjacent radius is set to be small enough. In order to ensure the generated paths close to analytical solution, the grid size is set to be much smaller than the adjacent radius. The shortest path algorithm is used to update the adjacent matrix and path matrix. In the on-line part, the target position assignment and optimal velocity can be obtained by accessing the adjacent matrix and path matrix. At the end of this paper, some numerical examples are taken to illustrate the validity of our method and the influence of the parameters.

Glioma accounts for the highest proportion of primary intracranial malignant tumors. Microenvironment enormously influences the process of glioma progression. Our study is to establish an individualized prognostic nomogram for glioma patients with microenvironment signature. Glioma samples of Chinese Glioma Genome Atlas (CGGA) were grouped by the immune and stromal score based on ESTIMATE algorithm. Microenvironment-related genes (MRGs) in glioma were analyzed by R. To determine the best prognostic correlation genes, univariate and multivariate Cox regression analysis were used to analyze MRGs. Use the selected genes (CHI3L1, SOCS3, SLC47A2, COL3A1, SRPX2 and SERPINA3), we established the prognostic risk score model (microenvironment signature) and validated it. Gene Set Enrichment Analysis (GSEA) showed that the high-risk group was mainly enriched in immune and stromal function KEGG pathways. Finally, the nomogram was constructed and evaluated. The receiver operating characteristic (ROC) curve, Calibration plots and decision curve analysis (DCA) of training and validation set indicated the excellent predictive performance of nomogram. In conclusion, the 6-gene microenvironment signature can not only provide directions for the basic research of glioma, but also can be included as an independent prognostic index in nomogram for individual prediction to guide clinical treatment.

model checking techniques are often used for the verification of software systems. Such techniques are accompanied with several advantages. However, state space explosion is one of the drawbacks to model checking. During recent years, several methods have been proposed based on evolutionary and meta-heuristic algorithms to solve this problem. In this paper, a hybrid approach is presented to cope with the SSE problem in model checking of systems modeled by GTS with an ample state space. Most of existence proposed methods that aim to verify systems are applied to detect deadlocks by graph transformations. The proposed approach is based on the fuzzy genetic algorithm and is designed to decline the safety property by verifying the reachability property and detecting deadlocks. In this solution, the state space of the system is searched by a fuzzy genetic algorithm to find the state in which the specified property is refuted/verified. To implement and evaluate the suggested approach, GROOVE is used as a powerful designing and model checking toolset in GTS. The experimental results indicate that the presented hybrid fuzzy method improves speed and performance by comparing other techniques

The reinforcement learning problem of complex action control in the Multi-player wargame is a hot research topic in recent years. In this paper , a game system based on turn-based confrontation is designed and implemented with the state-of-the-art deep reinforcement learning models. Specifically, we first design a Q-learning algorithm to achieve intelligent decision-making, which is based the DQN(Deep Q Network) to model the complex game behaviors. Then, a priori- knowledge based algorithm PK-DQN(Prior Knowledge- Deep Q Network) is introduced to improve the DQN algorithm, which accelerates the convergence speed and stability of the algorithm. The experiments demonstrate, the correctness of the PK-DQN algorithm is validated and its performance surpass the conventional DQN algorithm. Furthermore, the PK-DQN algorithm shows effectiveness in defeating the high level of rule-based opponents, which provides promising results for the exploration of the field of smart chess and intelligent game deduction.

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

Upper confidence bound multi-armed bandit algorithms (UCB) typically rely on concentration in- equalities (such as Hoeffding’s inequality) for the creation of the upper confidence bound. Intu- itively, the tighter the bound is, the more likely the respective arm is or isn’t judged appropriately for selection. Hence we derive and utilise an optimal inequality. Usually the sample mean (and sometimes the sample variance) of previous rewards are the information which are used in the bounds which drive the algorithm, but intuitively the more infor- mation that taken from the previous rewards, the tighter the bound could be. Hence our inequality explicitly considers the values of each and every past reward into the upper bound expression which drives the method. We show how this UCB method fits into the broader scope of other information theoretic UCB algorithms, but unlike them is free from assumptions about the distribution of the data, We conclude by reporting some already established regret information, and give some numerical simulations to demonstrate the method’s effectiveness.

For a positive integer k, a radio k-coloring of a simple connected graph G = (V (G), E(G)) is a mapping | f(u) - f(v)| ≥ k +1-d (u , v ) such that f :V (G)→{0,1, 2,...} for each pair of distinct vertices u and v of G, where d(u, v) is the distance between u and v in G. The span of a radio k-coloring f, rck(f), is the maximum integer it assigns to some vertex of G. The radio k-chromatic number, rck(G) of G is min{rck(f)}, where the minimum is taken over all radio k-colorings f of G. If k is the diameter of G, then rck(G) is known as the radio number of G. In this work, we propose four algorithms (two serial algorithms and their parallel versions) which related to the radio k-coloring problem. One of them is an approximate algorithm that determines an upper bound of the radio number of a given graph. The other is an exact algorithm which finds the radio number of a graph G. The approximate algorithm is a polynomial time algorithm while the exact algorithm is an exponential time algorithm. The parallel algorithms are parallelized using the Message Passing Interface (MPI) standard. The experimental results prove the ability of the proposed algorithms to achieve a speedup 7 for 8 processors.

In this paper, we proposed a high accurate and stable Legendre transform algorithm which can reduce the potential instability for very high order at a very small increase in the computational time. The error analysis of interpolative decomposition for Legendre transform is presented. By employing block partitioning of Legendre-Vandermonde matrix and butterfly algorithm, a new Legendre transform algorithm with computational complexity O(N(logN)^2/loglogN) in theory and less than O(N(logN)^4) in practical application is obtained. Numerical results are provided to demonstrate the efficiency and numerical stability of the new algorithm.

Lightning discharges in electric power networks generate voltage and current surges that are propagated through the electrical network causing damage and shutdowns in the electrical system. To protect the system against these phenomena, surge arresters are very effective and widely used by electrical utilities in their electric grids. This paper presents a methodology for optimized surge arrester allocation based on genetic algorithm (GA), creating a simulation environment in the software ATP (Alternative Transients Program) to implement the proposed methodology. The optimized allocation procedure is based on a fitness function that minimizes the cost of surge arresters and maximizes the number of protected equipment. To carry out this optimized arrester allocation procedure using ATP may demand too much processing time when running large distribution grids. To overcome this difficulty a procedure is proposed to obtain an overvoltage severity description of the grid and select the most critical electric nodes for the incidence of lightning discharges, in the GA allocation procedure. The case study is applied to the IEEE 123-bus electrical feeder to demonstrate the effectiveness of the proposed methodology.

In this paper, a thermodynamic investigation is done on a Kalina-flash cycle. This work is initially validated with the Kalina cycle power plant, Wich is commissioned in Husavic. Low-temperature Kalina-flash is considered for this study. This cycle is working with the ammonia-water mixture. The Kalina-flash cycle was optimized in the view of exergy and thermal efficiency. A multi-objective genetic algorithm is used to accomplish optimization. The optimum values of the objective functions are observed to be 40.20 and 11.70% respectively. At last, The influence of the separator inlet dryness fraction, basic ammonia mass fraction, temperature and flash pressure ratio on the first and second law efficiencies are analysed.

Despite the number of studies on bankruptcy prediction using financial ratios, very little is known about how external audit information can contribute to anticipating financial distress. A handful of papers show that a combination of ratios and audit data can provide significant predictive purposes, but a recent paper by Muñoz-Izquierdo et al. (2018) provided an 80% predictive accuracy solely by using the disclosures of audit reports. We complement this study. Applying an artificial intelligence method (the PART algorithm), we examine the predictive ability of more easily extracted information from the report and suggest a practical implication for each user. Simply by (1) finding the audit opinion, (2) identifying if a matter section exist, (3) and the number of comments disclosed, then any user may predict a bankruptcy situation with the same accuracy as if they had scrutinised the whole report. In addition, we also provide an extended literature review about previous studies on the interaction between bankruptcy prediction and the external audit information.

Nipah virus (NiV) is responsible to cause various outbreaks in Asian countries, with latest from Kerala state of India. Till date there is no drug available despite its urgent requirement. In the current study, we have provided a computational one-stop solution for NiV inhibitors. We have developed “anti-Nipah” web resource, which comprised of a data repository, prediction method, and data visualization modules. The database comprised of 313 (181 unique) inhibitors from different strains and outbreaks of NiV extracted from research articles and patents. However, the quantitative structure–activity relationship (QSAR) based predictors were accomplished using classification approach employing 10-fold cross validation through support vector machine with 120 (68p + 52n) inhibitors. The overall predictor showed the accuracy and Matthew’s correlation coefficient of 88.89% and 0.77 on training/testing dataset respectively. The independent validation dataset also performed equally well. The data visualization modules from chemical clustering and principal component analyses displayed the diversity in the NiV inhibitors. Therefore, our web platform would be of immense help to the researchers working in developing effective inhibitors against NiV. The user-friendly webserver is freely available on URL: http://bioinfo.imtech.res.in/manojk/antinipah/

The resource allocation for tasks in heterogeneous distributed system is a well known NP-hard problem. For the sake of making the makespan is minimized, it is hard to distribute the tasks to proper processors. The problem is even more complex and challenging when the processors have unavailable time and the tasks type are various. This paper investigates a resource allocation problem for hybrid tasks comprising both divisible and bag-of-tasks(BoT) in heterogeneous distributed system when the processors has unavailable time. First, the mathematical model, which minimizes the makespan of the hybrid tasks when the processors have unavailable time, is established. Second, we propose a scheduling algorithm referred to as bag-of-tasks allocate-pull and divisible task allocation (BoTAPDTA) algorithm for handling hybrid tasks on heterogeneous distributed systems. In addition, to solving the optimization model efficiently, a generic algorithm(GA) is proposed. For the sake of reducing the search space and solving the optimization model effectively, a two step scheduling algorithm(TSGA), which first allocate bag-of-tasks(BoT) using generic algorithm and then assign divisible task to processors like BoTAPDTA, is designed. Finally, numerical simulation experiments are conducted, and experimental results indicate the effectiveness of the proposed model and algorithm.

PEM fuel cell is a technology successfully used in the production of energy from hydrogen, allowing the use of hydrogen as an energy vector. It is scalable for stationary and mobile applications. However, the technology demands more research. An important research topic is fault diagnosis and condition monitoring to improve the life and the efficiency and to reduce the operation costs of PEMFC devices. Consequently, there is a need of physical models that let deep analysis. These models must be accurate enough to represent the PEMFC behavior and to allow the identification of different internal signals of a PEM fuel cell. This work presents a PEM fuel cell model that uses the output temperature in a closed loop, so it can represent the thermal and the electrical behavior. The model is used to represent a NEXA Ballard 1.2 kW; therefore it is necessary to fit the coefficients to represent the real behavior. Five optimization algorithms were tested to fit the model, three of them were taken from literature and two were proposed. Finally, the model with the parameters identified was validated with real.

Reservoirs are recognized as one of the most efficient infrastructure components in integrated water resources management and development. At present, with the ongoing advancement of social economy and requirement of water, the water resources shortage problem has worsened, and the operation of reservoirs, in terms of consumption of flood water, has become significantly important. Reservoirs perform both regulation of flood and integrated water resources management, in which the flood limited water level is considered as the most important parameter for trade-off between regulation of flood and conservation. To achieve optimal operating policies for reservoirs, large numbers of simulation and optimization models have been developed in the course of recent decades, which vary notably in their applications and working. Since each model has their own limitations, the determination of fitting model for derivation of reservoir operating policies is challenging and most often there is always a scope for further improvement as the selection of model depends on availability of data. Subsequently, assessment and evaluation associated with the operation of reservoir stays conventional. In the present study, the Soil and Water Assessment Tool (SWAT) models and a Genetic Algorithm model has been developed and applied to two reservoirs in Ganga River basin, India to derive the optimal operational policies. The objective function is set to minimize the annual sum of squared deviation form desired irrigation release and desired storage volume. The decision variables are release for irrigation and other demands (industrial and municipal demands), from the reservoir. As a result, a simulation-based optimization model was recommended for optimal reservoir operation, such as allocation of water, flood regulation, hydropower generation, irrigation demands and navigation and e-flows using a definite combination of decision variables. Since the rule curves are derived through random search it is found that the releases are same as that of demand requirements. Hence based on simulated result, in the present case study it is concluded that GA-derived policies are promising and competitive and can be effectively used operation of the reservoir.

The key links of face recognition are digital image preprocessing, facial feature extraction and pattern recognition, this article aimed at the current problem of slow speed and low recognition accuracy of face recognition , from the above three key links, on the basic of analyzing the therories of Fractional Differential Masks Operator (FDMO), Principal Component Analysis (PCA) and Support Vector Machine (SVM), design a kind of FDMO+PVA+SVM coupling algorithm that applies to face recognition to improve the speed and accuracy of it. To realize FDMO+PCA+SVM coupling algorithm, first, we should apply FDMO to face image processing binary marginalization, the purpose is getting face contour; Then, we apply PCA to get the feature of face image which is disposed by binary marainalization. At last, we can apply One-Against All of the SVM classifier and LibSVM software package to realize face recognition. Beside, the article with nine different coupling algorithm design four groups of experimental reaults on the ORL face database verified by comparative analysic FDMO+PCA+SVM coupling algorithm in the superiority of face recognition accuracy and speed.

Clock Network Design (CDN) is a critical step while designing any Integrated-Circuits (ICs). It holds vital importance in the performance of entire circuit. Due to continuous scaling, 3D ICs stacked with TSV are gaining importance, with an objective to continue with the Moore's law. Through-Silicon-Via (TSV) provides the vertical interconnection between two die, which allows the electrical signal to flow through it. 3D ICs has many advantages over conventional 2D planar ICs like reduced power, area, cost, wire-length etc. The proposed work is mainly focused on power reduction and obstacle avoidance for 3D ICs. Various techniques have already been introduced for minimizing clock power within specified clock constraints of the 3D CND network. Proposed 3D Clock Tree Synthesis (CTS) is a combination of various algorithms with an objective to meet reduction in power as well as avoidance of obstacle or blockages while routing the clock signal from one sink to other sink. These blockages like RAM, ROM, PLL etc. are fixed during the placement process. The work is carried out mainly in three steps- first is Generation of 3D Clock tree avoiding the blockages, then Buffering and Embedding and finally validating the results by SPICE simulation. The experimental result shows that our CTS approach results in significant 9% reduction in power as compare to the existing work.

Opportunistic networks, an evolution of mobile Ad Hoc networks (MANETs), offer decentralized communication without relying on preinstalled infrastructure, enabling nodes to route packets through different mobile nodes dynamically. However, due to the absence of complete paths and rapidly changing connectivity, routing in opportunistic networks presents unique challenges. This paper proposes a novel probabilistic routing model for opportunistic networks, leveraging nodes' meeting probabilities to route packets towards their destinations. The model dynamically builds routes based on the likelihood of encountering the destination node, considering factors such as last meeting time and acknowledgment tables to manage network overload. Additionally, an efficient message detection scheme is introduced to alleviate high overhead by selectively deleting messages from buffers during congestion. Furthermore, the proposed model incorporates cross-layer optimization techniques, integrating optimization strategies across multiple protocol layers to maximize energy efficiency, adaptability, and message delivery reliability. Through extensive simulations, the effectiveness of the proposed model is demonstrated, showing improved message delivery probability while maintaining reasonable overhead and latency. This research contributes to the advancement of opportunistic networks, particularly in enhancing connectivity and efficiency for Internet of Things (IoT) applications deployed in challenging environments.

Preventive Maintenance (PM) is a periodic maintenance strategy, which has great results for devices in extending their life, increasing productivity, and most importantly, help avoid unexpected breakdowns and their costly consequence. A preventive maintenance scheduling (PMS) is determining the time for carrying out PM, and it represents a sensitive issue in terms of impact on production if the time for the PM process is not optimally distributed. In this study, hybrid heuristic methods were used to solve the PMS problem, as genetic algorithm and Tabu research were adopted. The optimal solution was reached in a short time compared to previous studies in which optimal methods were used, integer programming and nonlinear integer programming. Also, sensitivity analysis was applied to measure the robustness and strength of the method used, where an optimal solution was obtained for all experiments and in record time. This method can be used for power plants in privet or public sectors, to generate an optimal PMS, to save money, and to avoid water or electricity cuts.

The construction industry has a notable negative impact on the environment; thus, the promotion of the use of timber structures is an alternative to mitigate its effects. The research develops an artificial intelligence-based decision approach in the calculation of timber structures focused on the enhancement of the sustainability of roof structures. Based on the optimization carried out through genetic algorithms and the framework established in Eurocode 5, a general set of equations has been proposed for a laminated timber roof structure. The tool, which determines the most suitable roof structure for each strength class of laminated timber, allows for the determination of the dimensions of beams and purlins and their respective separations in order to minimize wood consumption. The ultimate goal is to offer multiple solutions regarding strength classes and structural designs in order to foster informed sustainable choices that promote efficient use of resources in construction.

In the realm of smart transportation and mobility, delivery organizations are continuously refining their strategies, harnessing resources and advanced analytical techniques to streamline operations, aiming to achieve optimal solutions in terms of both efficiency and cost-effectiveness. However, a persistent challenge faced by these delivery companies revolves around the effective assignment of delivery personnel to customer orders, often grappling with suboptimal assignments that lead to inefficiencies and delays. To address this issue, we propose an architecture that uses the Munkres algorithm to optimize the task assignment problem for delivery personnel with pending orders, employing different cost functions obtained with deterministic and machine learning techniques. We compared the performance of linear and polynomial regression methods to construct different cost functions represented by matrices with orders and delivery people information. Subsequently, we applied the Munkres optimization algorithm to solve the assignment problem, which optimally assigns delivery people and orders. The results demonstrate that linear regression, used to estimate distance information, can reduce estimation errors by up to 568.52 km (1.51%) for our dataset compared to other methods. Conversely, polynomial regression proves effective in constructing a superior cost function based on time information, reducing estimation errors by up to 17,143.41 minutes (11.59%) compared to alternative methods. The proposed approach aims to enhance delivery personnel allocation within the delivery sector, optimizing the efficiency of this process.

Stagnation at local optima represents a significant challenge in bio–inspired optimization algorithms, often leading to suboptimal solutions. This paper addresses this issue by proposing a hybrid model that combines the Orca Predator Algorithm with Deep Q–Learning. Orca Predator Algorithm is an optimization technique that mimics the hunting behavior of orcas. It solves complex optimization problems by exploring and exploiting search spaces efficiently. Deep Q–Learning is a reinforcement learning technique that combines Q–Learning with deep neural networks. This integration aims to turn the stagnation problem into an opportunity for more focused and effective exploitation, enhancing the optimization technique’s performance and accuracy. The proposed hybrid model leverages the biomimetic strengths of Orca Predator Algorithm to identify promising regions nearby in the search space, complemented by the fine–tuning capabilities of Deep Q–Learning to navigate these areas precisely. The practical application of this approach is evaluated using the high–dimensional Heartbeat Categorization Dataset, focusing on the feature selection problem. This dataset, comprising complex electrocardiogram signals, provided a robust platform for testing the feature selection capabilities of our hybrid model. Our experimental results are encouraging, showcasing the hybrid strategy capability to identify relevant features without significantly compromising the performance metrics of machine learning models. This analysis was performed by comparing the improved method of Orca Predator Algorithm against its native version and a set of state–of–the–art algorithms.

Developing effective trend estimators is a main method to solve the online portfolio selection problem. Although the existing portfolio strategies have demonstrated good performance through the development of various trend estimators, it is still challenging to determine in advance which estimator will yield the maximum final cumulative wealth in online portfolio selection tasks. This paper studies an online ensemble approach for online portfolio selection by leveraging the strengths of multiple trend estimators. Specifically, a return-based loss function and a cross-entropy-based loss function are first designed to evaluate the adaptiveness of different trend estimators in a financial environment. On this basis, a passive aggressive ensemble model is proposed to weigh these trend estimators within a unit simplex according to their adaptiveness. Extensive experiments are conducted on benchmark datasets from various real-world stock markets to evaluate the performance. The results show that the proposed strategy achieves the state-of-the-art performance including efficiency and cumulative return.

Evolutionary algorithms find applicability in reinforcement learning of neural networks due to their independence from gradient-based methods. To achieve successful training of neural networks using evolutionary algorithms, careful considerations must be made to select appropriate algorithms due to the availability of various algorithmic variations. In Part1 and Part2, the author previously reported experimental evaluations on Genetic Algorithm and Evolution Strategy for reinforcement learning of neural networks, utilizing the Acrobot control task. This article constitutes Part3 of the series of comparative research. In this study, Differential Evolution is adopted as the third instance of major evolutionary algorithms. The experimental results show a statistically significant superiority of DE over both GA and ES (p < .01). In addition, DE exhibits its robustness to variations in hyperparameter configurations (the number of offsprings and generations). In the previous experiments, both ES and GA showed significant performance differences depending on the configurations, whereas in the experiment reported in this article, such differences are not detected for DE.

Finding the roots of an equation is a fundamental problem in diverse fields. Optimization problem leads to non-linear equations for calculating the roots of the equation efficiently. Numerical iterative techniques are frequently applied when analytic solution is not available. Hybrid techniques to find roots of an equation is new to this fundamental problem. Recently, some attempts emerged to design hybrid algorithms for efficient solutions. A new heuristic algorithm is designed which is an intuitive approach to hybridization. In this paper, we implement two new algorithms: (1) a new BTsection algorithm blending the Bisection and Trisection algorithm, (2) a hybrid algorithm, that promises to be more efficient than the existing hybrid algorithms. The new hybrid algorithm is a blend of BTsection algorithm and Regula Falsi algorithm. The implementation results validate that the new algorithm, Hybrid4, surpasses the efficiency of existing hybrid algorithms Hybrid1, Hybrid2, and Hybrid3 algorithms. This paper contributes an essential hybrid algorithm to the repertoire of hybrid root finding algorithms.

This work proposes a physics-based identification technique based on genetic algorithms. The main objective is to obtain a parametric matrix A that describes the time-invariant linear model of the longitudinal dynamics of an aircraft. This is achieved by proposing a fitness function based on the properties of the transition matrix and taking advantage of some of the capabilities of the genetic algorithm, mainly those of restricting the search ranges of the unknowns. In this case, such unknowns are related to the type of aircraft and flight conditions that are considered during the identification process. The proposed identification method is validated with a reliable nonlinear model that can be found in the literature, as well as with the calculation of the trim condition and linearization generally used in aircraft dynamics. In summary, this study suggests the genetic algorithm provided with the adequate fitness function, could be an appealing alternative for aircraft model identification, even when only a limited amount of data is available. Furthermore, in some cases, linearization using genetic algorithm can be more efficient than classical methods.

To address the challenges associated with the difficult electromagnetic (EM) scattering computations of anisotropic dielectric-coated metallic composite targets, we proposed an efficient hybrid algorithm for simulating the EM scattering of complex targets with anisotropic dielectric coatings. This method, based on Impedance Boundary Condition (IBC), utilizes surface impedance vectors to describe the EM properties of the dielectric. It fully leverages the respective advantages of the low-frequency Method of Moments (MoM) and the high-frequency Physical Optics (PO) to achieve high-precision and rapid EM simulation of anisotropic dielectric-coated metallic composite targets. Employing boundary conditions and equivalent principles, we equivalently transform the EM scattering problem of targets with thin dielectric coatings into the radiation problem of equivalent EM current on impedance surfaces. This enables the high-precision and rapid calculation of Radar Cross Sections (RCS) for complex targets with anisotropic dielectric coatings. Using examples such as a square plate structure, a simplified aircraft, and a complex satellite model, the simulation results exhibit a high degree of agreement with full-wave numerical solutions and demonstrate a significant advantage in computational resources. This research convincingly demonstrates the accuracy and effectiveness of the proposed method.

Determining accurate PM2.5 pollution concentrations and understanding their dynamic patterns is crucial for scientifically informed air pollution control strategies. Traditional reliance on linear correlation coefficients for ascertaining PM2.5 related factors only uncovers superficial relationships. Moreover, the invariance of conventional prediction models restricts their accuracy. To enhance the precision of PM2.5 concentration prediction, this study introduces a novel integrated model that leverages feature selection and a clustering algorithm. Comprising three components - feature selection, clustering, and integrated prediction, the model first employs the non-dominated sorting Genetic Algorithm (NSGA-III) to identify the most impactful features affecting PM2.5 concentration within air pollutants and meteorological factors. This step offers more valuable feature data for subsequent modules. The model then adopts a two-layer clustering method (SOM+K-means) to analyze the multifaceted irregularity within the dataset. Finally, the model establishes the Extreme Learning Machine (ELM) weak learner for each classification, integrating multiple weak learners using the Adaboost algorithm to obtain a comprehensive prediction model. Through feature correlation enhancement, data irregularity exploration, and model adaptability improvement, the proposed model significantly enhances the overall prediction performance. Data sourced from 12 Beijing-based monitoring sites in 2016 were utilized for an empirical study, and the model's results compared with five other predictive models. The outcomes demonstrate that the proposed model significantly heightens prediction accuracy, offering useful insights and potential for broadened application to multifactor correlation concentration prediction methodologies for other pollutants.

Evolutionary algorithms find applicability in the reinforcement learning of neural networks due to their independence from gradient-based methods. To achieve successful training of neural networks using evolutionary algorithms, careful considerations must be made to select appropriate algorithms due to the availability of various algorithmic variations. The author previously reported experimental evaluations on Evolution Strategy for reinforcement learning of neural networks, utilizing the pendulum control task. In this study, the Acrobot control task is adopted as another task. Experimental results demonstrate that ES successfully trained a Multi-Layer Perceptron to achieve a remarkable height of 99.85% concerning the maximum height. However, the trained MLP failed to maintain the chain end in an upright position throughout an episode. In this study, it was observed that employing 8 hidden units in the neural network yielded better results with statistical significance compared to using 4, 16, or 32 hidden units. Furthermore, the findings indicate that a larger population size in ES led to a more extensive exploration of potential solutions over a greater number of generations, which aligns with the previous study.

In many research fields, statistical probability models are often used to analyze real-world data. However, data from many fields, such as the environment, economics, and health care, do not necessarily fit traditional models. New empirical models need to be developed to improve their fit. In this paper, we explore a further extension of the quasi-Lindley model. Maximum likelihood, least square error, Anderson-Darling algorithm, and expectation-maximization algorithm are four techniques for estimating the parameters under study. All techniques provide accurate and reliable estimates of the parameters. However, the mean square error of the expectation maximization approach was lower. The usefulness of the proposed model was demonstrated by analyzing a dynamical systems data set, and the analysis shows that it outperforms the other models in all statistical models considered.

Extracting railway tracks is crucial for creating electronic railway maps. Traditional methods require significant manual labor and resources, while existing neural networks have limitations in efficiency and precision. To address these challenges, a railway track extraction method using an improved DeepLabV3+ model is proposed, which incorporates several key enhancements. Firstly, the encoder part of the method utilizes the lightweight network MobileNetV3 as the backbone extraction network for DeepLabV3+. Secondly, the decoder part adopts the lightweight universal upsampling operator CARAFE for upsampling. Lastly, to address any potential extraction errors, morphological algorithms are applied to optimize the extraction results. Additionally, a dedicated railway track segmentation dataset is created to train and evaluate the proposed method. The experimental results demonstrate that the model achieves impressive performance on the railway track segmentation dataset and DeepGlobe dataset. The MIoU scores are 88.93% and 84.72%, with Recall values of 89.02% and 86.96%. Moreover, the overall accuracy stands at 97.69% and 94.84%. The algorithm's operation time is about 5% lower in comparison to the original network. Furthermore, the morphological algorithm effectively eliminates errors like holes and spots. These findings indicate the model's accuracy, efficiency, and the enhancement brought by the morphological algorithm in error elimination.

The mountains in northern Xinjiang of China were studied during the snowmelt season. Multi-source fusion live data Chinese Land Data Assimilation System (CLDAS,0.05°× 0.05°,hourly data) were used as real data, and Central Meteorological Observatory guidance forecast (SCMOC,0.05°× 0.05 °,forecasting the following 10 days in 3 h intervals) was used as forecast data, both issued by the China Meteorological Administration. The dynamic linear regression and the average filter correction algorithms were selected to revise the original forecast products SCMOC.Based on conventional temperature forecast information,we designed four temperature rise prediction algorithms for essential factors affecting snowmelt.Temperature rise prediction algorithms included the daily maximum temperature algorithm, daily temperature rise range algorithm, snowmelt temperature algorithm, and daily snowmelt duration algorithm.Four temperature rise prediction algorithms values were calculated of each prediction product.Root-mean-square error algorithm and temperature prediction accuracy algorithm were used to compare and test each prediction algorithm value from the time sequence and spatial distribution.Comprehensive tests show that the forecast product revised by the average filter algorithm was superior to revised by the dynamic linear regression algorithm as well as the original forecast product.Through these algorithms, the more suitable temperature rise forecast value for each grid point in the study area can be obtained at different prediction times. The comprehensive and accurate temperature forecast value in mountainous snowmelt season can provide an accurate theoretical basis for effective prediction of the runoff in snowmelt areas and prevention of snowmelt flooding.

In recent decades, there have been numerous endeavors to develop a novel category of survival distributions possessing enhanced flexibility through the extension of existing distributions. This article constructs and validates the statistical properties of a novel survival distribution in order to obtain an alternative distribution that is suitable for analyzing survival data by presenting the novel mixture of the Fréchet distribution along with statistical properties such as the probability density function (PDF), cumulative distribution function (CDF), rth ordinary moment, skewness, kurtosis, moment-generating function, mean, variance, mode, survival function, hazard function, and asymptotic behavior, as well as constructing the estimators of the unknown parameter by employing the expectation-maximization (EM) algorithm, and simulated annealing. Additionally, the performance of the proposed estimators was compared with bias, mean squared errors (MSE), and simulated variances, and given an illustrative example of the proposed distribution to the survival data set in order to show that the proposed distribution is appropriate for the right-skewed data. This will be extremely advantageous in survival analysis.

Commercial banks usually classify customers according to their credit reports when making loans. In this study, we put our focus on classifying customers based on their credit reports from the People's Bank of China (PBC). Since there are no target labels of users in the credit report of the People's Bank of China, we put forward the fuzzy clustering method for the initial label, and then Construct ant colony search to optimize intelligent recognition. Finally, this study uses SVM, BP neural network, and random forest to classify users and compare their results. The research re-sults indicate that using ant colony clustering algorithm and random forest for classification is the most effective method with the PBC credit reports.

In the era of big data with increasingly complex data structures and ever-larger data scales, matrix-type data are becoming highly valued and their applications in the fields of medicine, industry, education, geography, and astronomy are growing in extent. In recent years, significant progress has been made in the practical use of matrix variable t-distribution finite mixture models for handling data in order to address the issues of multi-subgroup structures and long data tails. In this paper, the expectation-maximization (EM) algorithm with penalized maximum likelihood is proposed to resolve the problem of the unbounded nature of the likelihood function applied to the model by considering the degeneracy of the variance-covariance matrix of this model. Our data were analyzed through simulations and real data, and the results demonstrate that our model is effective in both preventing the likelihood function from being unbounded and in ensuring the accuracy of the estimated parameters of the EM algorithm.

The relationship between the host and the microbiome, or the assemblage of microorganisms (including bacteria, archaea, fungi, and viruses), has been proven crucial for its health and disease development. The high dimensionality of microbiome datasets has often been addressed as a major difficulty for data analysis, such as the use of Machine Learning (ML) and Deep Learning (DL) models. Here we present BiGAMi, a bi-objective genetic algorithm fitness function for feature selection in microbial datasets to train high-performing phenotype classifiers. The proposed fitness function allowed us to build classifiers that outperformed the baseline performance estimated by the original studies by using as few as 0.04% to 2.32% features of the original dataset. In 19 out of 21 classification exercises, BiGAMi achieved its results by selecting 6-68% fewer features than the highest performance of a Sequential Forward Feature Selection algorithm. This study showed that the application of a bi-objective GA fitness function against microbiome datasets succeeded in selecting small subsets of bacteria whose contribution to understood diseases and the host state was already experimentally proven. Applying this feature selection approach to novel diseases is expected to quickly reveal the microbes most relevant to a specific condition.

Ultrasound based haptic feedback is a potential technology for human-computer interaction (HCI) with the advantages of low cost, low power consumption and controlled force. In this paper, the phase optimization for multipoint haptic feedback based on ultrasound array is investigated and the corresponding experimental verification is provided. A mathematical model of acoustic pressure is established for the ultrasound array and then a phase optimization model for an ultrasound transducer is constructed. We propose a pseudo-inverse (PINV) algorithm to accurately determine the phase contribution of each transducer in the ultrasound array. By controlling the phase difference of the ultrasound array, the multipoint focusing forces are formed leading to various shapes such as geometries and letters that can be visualized. Because the unconstrained PINV solution results in unequal amplitudes for each transducer, a weighted amplitude iterative optimization is deployed to further optimize the phase solution, by which the uniform amplitude distributions of each transducer are obtained. For the purpose of experimental verifications, a platform of ultrasound haptic feedback consisting of a Field Programmable Gate Array (FPGA), an electrical circuit and an ultrasound transducer array is prototyped. The haptic performances of single point, multiple points and dynamic trajectory were verified by controlling the ultrasound force exerted on the liquid surface. The experimental results demonstrate that the proposed phase optimization model and theoretical results are effective and feasible, and the acoustic pressure distribution is consistent with the simulation results.

The world is attesting a tremendous change today which is remarkably coined as industry 4.0. Several terminologies have developed as a result of the emergency of industry 4.0, notably is cybersecurity which entails the security of communication and network operations activities either on or offline and the measures taken to achieve such security. The most common form of communication by organizations and Business today is the electronic mails (Email), although email is a valuable tool, it also creates security challenges when not properly managed. There is a growing adoption of email as official form of communication in many organizations with majority of users on mobile android devices due to the popularity of the android operating systems and the proliferation of mobile devices. Banks, health care, educational institutions and many other service providers are communicating to their clients through email where sensitive and confidential information are shared. One major threat to email communication is lack of confidentiality for emails accessed via android mobile devices due to weaknesses of android operating system (OS) platform that presents possibilities to penetrate by hackers and android email client since it accepts a onetime login and password authentication which is only required again if the email account is deleted from the android mobile device. In this study, an algorithm was designed and implemented on an android application that allows an email sender to compose an email and set the time the email will stay in the receiver inbox before it automatically wipes off. Primary data was collected from email users using tightly structured questionnaires and respondents comprised of those with email technical background and those that are typical email users inorder to get their opinion on the lack of confidentiality on the android mobile email client, while secondary data from scholarly journals and articles informed the study design. The designed algorithm was tested and evaluated through expert opinion. The result of the study indicates that the designed algorithm addresses the confidentiality issues and threats on android email clients.

Abstract: Imaging devices of less than 300,000 pixels are mostly used for sewage conduit exploration due to the petty nature of the survey industry in Korea. P articular ly , devices of less than 100,000 pixels are still widely used, and the environment for image processing is very bitter . Since the sewage conduit image s covered in this study ha ve a very low resolution (240 × 320 = 76,800 pixels), it is very difficult to detect cracks. Because most of the resolution of the sewe r conduit images are very low in Korea, this problem of low resolution was selected as the subject of study. Cracks were detected through a total of six steps of improving the crack in Step 2, finding the optimal threshold value in Step 3, and applying an algorithm to detect cracks in Step 5. Cracks were effectively detected by the optimal parameters in Steps 2 and 3 and the user algorithm in Step 5. Desp ite the very low resolution, the cracked image s showed 96.4% accuracy of detection, and the non cracked image s showed 94.5% accuracy . Moreover, the analysis was excellent in quality , also . It is believed that the findings of this study can be effectively u sed for crack detection with low resolution images.

In automated manufacturing systems, most of the manufacturing processes including machining are automated. Automatic tool change is one of the important parameters for reducing manufacturing lead time. Ceramic cutting tools are used to machine hard materials. Ti[C,N] mixed alumina ceramic cutting tools are widely used to machine hardened steel and Stainless Steel due to its superior mechanical properties. Martensitic stainless steel has wide applications in screws, bolts, nuts and other engineering applications. Machining studies on Martensitic Stainless Steel was conducted using Ti[C,N] mixed alumina ceramic cutting tool. Tool life was evaluated using flank wear criterion. The tool life obtained from experimental machining process was taken as training dataset and test dataset for machine learning. Using the dataset obtained from experimental machining tool life model has been developed using Gradient Descent algorithm. The model was validated using co-efficient of determination. The accuracy of the machine learning model was tested using the test data and 99.83% accuracy was obtained. Tool life model based on Gradient Descent Algorithm was successfully implemented for the tool life of Ti[C,N] mixed alumina ceramic cutting tool.Keywords: keyword 1; keyword 2; keyword 3 (List three to ten pertinent keywords specific to the article; yet reasonably common within the subject discipline.)

Information security plays a major role in the dynamics of today’s interconnected world. Despite the successful implementation and effectiveness of modern cryptographic techniques, their inherent limitations can be exploited by quantum computers. In this article we discuss Grover’s quantum searching algorithm and its impact on the security of modern symmetric ciphers. More specifically, we present its formal description and give an implementation of the algorithm using IBM’s Qiskit framework, which allows us to simulate and run the program on a real device. The developed program is modular and scalable, managing to properly run on any input state. We compare the performance of the algorithm running on the local simulator against its execution on a quantum processor from IBM’s lineup, noting the discrepancies between the results due to physical characteristics of the chip.

This paper proposed a damping method for enhancing oscillatory stability performance of power systems with high penetration of renewable energy by a resilient wide-area multi-mode controller. The resilient wide-area multi-mode controller is used as an additional controller in a renewable energy system with a battery energy storage to enhance the damping of the critically weak modes. The weak modes are likely to be triggered in the event of line outages or any other disturbances, and the system may become unstable in the absence of proper corrective and preventive control. A firefly algorithm has been employed to design such a controller. Eigenvalue analysis and time-domain simulation are used to analyze the performance of the proposed controller in a realistic representative power system. From the simulation results, it is evident that the oscillatory stability performance of the renewable rich power system can be enhanced with the proposed control to keep the damping on critical modes to the industrial standards. Furthermore, renewable energy penetration can be increased significantly in the realistic representative system by introducing the proposed controller without disturbing the oscillatory stability margin.

In document forensic, Ink mismatch relays very important information about forgeries in this way we can find out the authenticity of documents. Finding out and distinguishing these unique inks from the multispectral document is very challenging task. In this paper we proposed the method to identify the inks using clustering. We used K-Mean clustering instead of widely known Fuzzy C-Means Clustering (FCM) and successfully identity the number of inks. For the purpose of optimizing and improving our results we used two optimization techniques such as Elbow and silhouette optimization techniques.

This paper presents a novel micro-segmented genetic algorithm (μsGA) to identify the best solution for the locomotion of a quadruped robot designed on a rectangular ABS plastic platform. We compare our algorithm with three similar algorithms found in the specialized literature: a standard genetic algorithm (GA), a micro-genetic algorithm (μGA), and a micro artificial immune system (μAIS). The quadruped robot prototype guarantees the same conditions for each test. The platform was developed using 3D printing for the structure and can accommodate the mechanisms, sensors, servomechanisms as actuators. It also has an internal battery and a multicore embedded system (mES) to process and control the robot locomotion. This research proposes a μsGA that segments the individual into specific bytes. μGA techniques are applied to each segment to reduce the processing time; the same benefits as the GA are obtained, while the use of a computer and the high computational resources characteristic of the GA are avoided. This is the reason why some research in robot locomotion is limited to simulation. The results show that the performance of μsGA is better than the three other algorithms (GA, μGA and AIS). The processing time was reduced using a mES architecture that enables parallel processing, meaning that the requirements for resources and memory were reduced. This research solves the problem of continuous locomotion of a quadruped robot, and gives a feasible solution with real performance parameters using a μsGA bio-micro algorithm and a mES architecture.

Many corner detector techniques have already been used in extracting information from UAV images to perform various photogrammetric and mapping activities. Among these techniques is the Feature from Accelerated Segment Test (FAST) and the Harris corner detector. It is widely agreed that the evaluation of detectors is of great importance because it evaluates and enhances the accuracy of the detected features. This research evaluates the performance of FAST-9 and FAST-12 as well as the Harris detector in terms of the repeatability rate, completeness, and correctness under different threshold values. Each method is evaluated in terms of its ability for detection UAV objects (crowd and cars features). Then the common detected features between both FAST versions and the Harris detector are extracted. This is to determine which method performs best under different image conditions (e.g., illumination variations, camera position and orientation, and image noise). The results show that the size of the threshold plays a crucial role in determining the number of detected feature points. An increase in the threshold value leads to a decrease in the number of detected points and vice versa. Thus, the correctness decreases whereas the completeness increases as a function of the threshold values. Furthermore, the relationship between the FAST-9 and the Harris detector is slightly better than those between the FAST-12 and the Harris detector. This is because the number of common features between the FAST-9 and the Harris detector are relatively higher than those between the FAST-12 and the Harris detector.

There are some limitations in the null test measurement in the stitching interferometry. In order to meet the null test conditions, the moving distance between the sub-apertures often deviates from the theoretical preset distance, which leads to a position deviation of sub-apertures under measurements. To overcome this problem, an algorithm for data processing is proposed. We used iterative calculation of the deviations between the sub-apertures to adjust their positions, to ensure the local validity of the linear approximation algorithm and realize the exact stitching. A cylindrical lens as an object for experimental examination of the proposed method was taken. The obtained results demonstrate the validity, reliability and feasibility of our iterative stitching algorithm.

Wearable sensors for human physiological monitoring have attracted tremendous interest from researchers in recent years. However, most of the research was only done in simple trials without any significant analytical algorithms. This study provides a way of recognizing human motion by combining textile stretch sensors based on single-walled carbon nanotubes (SWCNTs) and spandex fabric (PET/SP) and machine learning algorithms in a realistic applications. In the study, the performance of the system will be evaluated by identification rate and accuracy of the motion standardized. This research aims to provide a realistic motion sensing wearable products without unnecessary heavy and uncomfortable electronic devices.

This paper presents a new adaptive and optimal algorithm for the trajectory tracking control of a quadrotor using iterative learning algorithm (ILA) and enumerative learning algorithm. Ordinarily the ILA, as an adaptive method, can perform well with PID control to improve the controller’s performance for a nonlinear system. Quadrotors are considered as non-linear and unstable systems which the use of an adaptive and optimal controller can increase its stability and decrease error level. In this method, a PID controller is proposed for the outer and inner control loops of a quadrotor and the ILA is used to adapt PID control gains. Subsequently, an enumerative learning algorithm is used to optimize the learning rates of the ILA. For this purpose, at first, the dynamic model of the quadrotor is acquired. After that, the structure of the inner and outer control loops is defined. In the end, the simulation results for the trajectory tracking control of a quadrotor are demonstrated. Through simulation, it is concluded that as time increases, the performance of the suggested control method in trajectory tracking control becomes better and better and error signals convergence to zero.

In order to coordinate the damping performance and energy regenerative performance of energy regenerative suspension, this paper proposes a structure of vehicle semi-active energy regenerative suspension with electro-hydraulic actuator (EHA). In light of the proposed concept, a specific energy regenerative scheme is designed and the mechanical properties test is carried out. Based on the test results, the parameter identification for the system model is conducted using recursive least squares algorithm. On the basis of system principle, the nonlinear model of the semi-active energy regenerative suspension with EHA is built. Meanwhile, LQG control strategy of the system is designed. And then the influence of the main parameters of EHA on the damping performance and energy regenerative performance of suspension is analyzed. Finally, the main parameters of EHA actuator are optimized via genetic algorithm. The test results show that when sinusoidal is input at the frequency of 2Hz and the amplitude of 30mm, the spring mass acceleration RMS value of optimized EHA semi-active energy regenerative suspension is reduced by 22.23% and energy regenerative power RMS value is increased by 40.51%, which means while meeting the requirements of certain vehicle ride comfort and driving safety, energy regenerative performance is improved significantly.

In this paper a variable’s involved in assessing the quality of a distributed generation system are reviewed, aiming to minimize the electric power losses (unused power consumption) and optimize the voltage profile. To provide this assessment, several experiments have been made to the IEEE 34-bus test case and various actual test cases with the respect of multiple DG units. The possibility and effectiveness of the proposed algorithm for optimal placement and sizing of DG in distribution systems have been verified. Finally, four algorithms were trailed: simulated annealing (SA), hybrid genetic algorithm (HGA), genetic algorithm (GA) and variable neighbourhood search. The HGA algorithm was found to produce the best solution at a cost of longer processing time.

Several factors impact the durability of concrete bridge decks, including traffic loads, fatigue, temperature changes, environmental stress, and maintenance activities. Detecting problems such as corrosion, delamination, or concrete degradation early on can lower maintenance costs. Nondestructive evaluation (NDE) techniques can detect these issues at early stages. Each NDE method, meanwhile, has limitations that reduce the accuracy of the assessment. In this study, multiple NDE technologies were combined with machine learning algorithms to improve the interpretation of half-cell potential (HCP) and electrical resistivity (ER) measurements. A parametric study was performed to analyze the influence of five parameters on HCP and ER measurements, such as degree of saturation, corrosion length, delamination depth, concrete cover, and moisture condition of delamination. The results were obtained through finite element simulations and used to build two machine learning algorithms, a classification algorithm and a regression algorithm, based on the Random Forest methodology. The algorithms were tested using data collected from a bridge deck in the BEAST® facility. Both machine learning algorithms were effective in improving the interpretation of ER and HCP measurements using data from multiple NDE technologies.

Carbon fiber reinforced polymers (CFRP) are extensively employed in the aerospace industry due to their excellent properties. Delamination damage occurring at critical locations in CFRP can seriously reduce the safety of in-service components. The detection and localization of delamination damage using Lamb waves hold significant potential for widespread application in non-destructive testing. However, the choice of damage localization algorithm may produce different delamination damage localization results. This research presented an IRAPID (improved reconstruction algorithm for probabilistic inspection of defects) method derived from the ORAPID (original reconstruction algorithm for probabilistic inspection of defects) method, aiming to improve the accuracy and reliability of delamination damage localization. Three CFRP bending plates, including a healthy bending plate and two bending plates with delamination damage sizes of Φ20 mm and Φ40 mm, were prepared in the experiment, respectively. The detection experiment of the CFRP bending plate using lead zirconate titanate (PZT) as a transducer to excite and receive Lamb waves was conducted, and the influence of excitation signal frequency on the performance of the proposed method was discussed. Under the condition of excitation signal frequency of 220 ~ 320 kHz and step size of 10 kHz, the accuracy of the delamination damage localization method proposed in this paper was compared with that of the existing methods. The experimental results indicate that the IRAPID algorithm exhibits good stability in the localization of delamination damage across the frequency variations range considered. The localization error of the IRAPID algorithm for delamination damage is significantly lower than that of the DaS (delay-and-sum) algorithm and the ORAPID algorithm. As the size of the delamination damage increases, so does the localization error. The accuracy of delamination damage localization is lower in the X-axis direction than in the Y-axis direction. By averaging the localization results across various frequencies, we can mitigate the potential localization errors associated with single-frequency detection to a certain extent. For the localization of delamination damage, Lamb waves at multiple frequencies can be employed for detection, and the detection results at each frequency are averaged to enhance the reliability of localization.

Earth observation satellites can capture images of specific areas in Earth's orbit based on user requirements. Despite the high demand for satellite imagery, satellites remain a scarce resource. When there are many observation tasks that are large and dense, they may interfere with each other due to satellite mobility. To address this issue, a multi-satellite scheduling algorithm based on a task merging mechanism has been proposed. This paper proposes a two-stage approach to the problem: task merging phase and merging task scheduling phase. The task merging phase introduces two methods based on Mean Shift and Complete Graph to generate the merging task set. In the merging task scheduling phase, a multi-satellite scheduling algorithm based on merging tasks is employed to solve the problem. Finally, certain measurement experiments suggest the effectiveness of the algorithm.

In reinforced concrete (RC) structures, splicing is required owing to the length limitations of rebars, insufficient lengths, and transportation issues. In particular, splices connect the rebar of RC structures such as walls, columns, beams, slabs, and joints. Lap splices are the most commonly used method worldwide because they do not require specific equipment or skilled workers. However, lap splices incur high construction costs because of the long splice lengths required for large-diameter rebars in megastructures, as well as issues pertaining to material supply, labor costs, constructability, and project duration. Additionally, approximately 15% more rebar is required because of the overlap. Energy saving for a sustainable built environment is possible if the disadvantage of lap splices, which generate high CO2 emissions due to the excessive use of rebar, are resolved. Hence, mechanical rebar couplers (MRCs) have been developed. However, despite their advantages, they have not been widely applied in construction sites owing to concerns regarding safety, quality, and constructability. Although various MRCs have been developed, most studies focus only on their structural performance. Therefore, a data-driven approach for selecting MRCs based on the reinforcing bar shape and structural characteristics is proposed in this study. Using a data-driven MRC selection algorithm, using the T-threaded coupler for one rebar over two floors resulted in 56% more efficient labor productivity, 15% shorter assembly time, 17% lower costs, and 26% lower CO2 emission. Using a developed algorithm, the appropriate MRC can easily and rapidly be selected for frequent design changes.

The optimal structural design is imperative to minimize material consumption and reduce the environmental impact of construction. Given the complexity in the formulation of structural design problems, the process of optimization is commonly performed using artificial intelligence (AI) global optimization, such as Genetic Algorithm (GA). However, the integration of AI-based optimization together with visual programming (VP) in building information modeling (BIM) projects warrants further investigation. This study proposes a workflow by combining structure analysis, VP, BIM, and GA to optimize trusses. The methodology encompasses several steps including: (i) generation of parametric trusses in Dynamo VP; (ii) performing the finite element modeling (FEM) using Robot Structural Analysis (RSA); (iii) retrieving and evaluating the FEM results interchangeably between Dynamo and RSA; (iv) finding the best solution using GA; and (v) importing the optimized model into Revit, enabling the user to perform simulations and engineering analysis, such as life cycle assessment (LCA) and quantity surveying. The feasibility of the proposed workflow was tested on benchmark problems and compared with open literature. The outcomes of this study offer insight into the opportunities and limitations of combining VP, GA, FEA, and BIM for structural optimization applications, particularly to enhance structural efficiency and sustainability in construction.

Classroom resource allocation is a challenging problem in educational institutions. The use of cloud computing can aid in the optimization of this process by allowing resource providers to allocate resources to users in a timely and efficient manner. In this paper, we propose a modified Salp Swarm Algorithm (SSA) to optimize the allocation of classroom resources. The proposed approach involves generating a population of salps representing potential solutions to the resource allocation problem and updating the positions of the salps iteratively based on a fitness function and mathematical equations. We conducted simulations of the proposed algorithm on various numbers of tasks and sources to evaluate its performance. The results indicate that the modified SSA algorithm can efficiently allocate classroom resources, achieving lower completion time of tasks (makespan) with lower costs. This paper contributes to the literature by introducing an effective approach to solve the classroom resource allocation problem.

Improper design of friction pendulum bearings can lead to poor seismic reduction performance and may result in the failure of local vulnerable components. And the parameter design of friction pendulum bearings mainly relies on experience and verification calculations at present. This paper proposes an adaptive genetic algorithm considering the overall evolution state of the population, adjusting crossover and mutation probabilities adaptively based on individual fitness and population diversity. Compared to traditional algorithms, it exhibits better global search capabilities and convergence efficiency. Combining the improved genetic algorithm with finite element models, a parameter optimization method is proposed. The parameters of friction pendulum bearings are optimized, providing reference for the design of seismic isolation devices.

The author previously reported an experimental result of evolutionary reinforcement learning of neural network controllers for the pendulum task. In the previous work, a conventional multilayer perceptron was employed in which connection weights were real numbers. In this study, the author experimentally applies an evolutionary algorithm to the reinforcement training of binary neural networks. In both studies, the same task and the same evolutionary algorithm are utilized, i.e. the pendulum control problem and Evolution Strategy respectively. The only differences lie in the memory size per connection weight and the model size of the neural network. The findings from this study are (1) the performance of the binary MLP with 32 hidden units was inferior to that of the real-valued MLP with 16 hidden units; however, this difference was not statistically significant (p >.05); (2) the trained binary MLP successfully swung the pendulum swiftly into an inverted position and maintained its stability after inversion, as the real-valued MLP had done; and (3) the memory size required to record the binary MLP with 32 hidden units is 3.1% or 6.2% of the memory size required to record the real-valued MLP with 16 hidden units.

The BP neural network and PSO algorithm are applied into analyzing the reliability of long-span Concrete Filled Steel Tubular (CFST) arch bridges. Firstly, using BP neural network to fit the structural performance function. And then the PSO method was used to calculate the reliability index. A long-span Concrete Filled Steel Tubular arch bridges reliability indices were calculated whether considering the geometric nonlinearity or not. The calculation and analysis results showed that the BP neural network and PSO algorithm compensated the deficiency of the traditional reliability analysis methods, improved the calculation accuracy, provided a new thought and means for the research on the reliability of long-span bridge structure, and well applied to the reliability analysis of long-span Concrete Filled Steel Tubular arch bridges. Additionally, the reliability analysis of long-span Concrete Filled Steel Tubular arch bridges on service limit state must consider the geometric nonlinearity effect, or the results will tend to be unsafe.

As a new type of gear, bevoloid gears have the advantages of compensating axial error, smooth transmission, and eliminating turning error, and they are widely used in applications requiring high transmission accuracy and stability. However, research on calculating the time-varying mesh stiffness of bevoloid gears is still limited, and there is an urgent need to propose a method that can calculate the stiffness of bevoloid gears quickly and accurately. This paper first establishes the bevoloid gear tooth profile expressions, then assumes a pair of bevoloid gears meshing with the same rack and derives the contact line equations of parallel axis bevoloid gear pairs, and analyze the contact process of bevoloid gears. We propose an analytical algorithm that uses the slicing method to calculate the stiffness of helical gears, straight bevoloid gears, and helical bevoloid gears, change the parameters of helical bevoloid gears respectively, and analyze the influence of different parameters on stiffness. Finally, the finite element method is used to verify the analytical method, and the correctness of the analytical calculation results is verified, and the errors are analyzed.

Material Extrusion is a popular additive manufacturing technology due to its low cost, wide market availability, ability to construct complex parts, safety, and cleanliness. However, optimizing the process parameters to obtain the best possible mechanical properties has not been extensively studied. This paper aims to develop ensemble learning-based models to predict the ultimate tensile strength, Young's modulus, and strain at break of PLA and PLA-CF 3D-printed parts, using printing temperature, printing speed, and layer thickness as process parameters. Additionally, the study investigates the impact of process parameters and material selection on the mechanical properties of the printed parts and uses Genetic Algorithms for multi-objective optimization according to user specifications. The results indicate that process parameters and material selection significantly influence the mechanical properties of the printed parts. The Genetic Algorithm successfully identifies optimal parameter values for the desired mechanical properties. Moreover, this work is the first to model Process-Structure-Properties relationships for an additive manufacturing process and to use a multi-objective optimization approach for multiple mechanical properties, utilizing ensemble learning-based algorithms and Genetic Algorithms.

Recently, the triple-network convergence system (TNCS) has emerged from the deep integration of the power grid, transportation network, and information network. Fault recovery research in the TNCS is important since this system's complexity and interactivity can expand the faults scale and increase faults impact. Currently, fault recovery focuses primarily on single power grids and cyber-physical systems, but there are certain shortcomings, such as ignoring uncertainties including generator start-up failures and the occurrence of new faults during recovery, energy supply-demand imbalances leading to system security issues and communication delay caused by network attacks. In this study, we propose a recovery method based on the improved TD3 algorithm, factoring in shortcomings of the existing research. Specifically, we establish a TNCS model to analyze interaction mechanisms and design a state matrix to represent the uncertainty changes in the TNCS, a negative reward to reflect the impact of unit start-up failures, a special reward to reflect the impact of communication delay and an improved Actor network update mechanism. Experimental results show that our method obtains the optimal recovery decisions, maximizes restoration benefit in power grid failure scenarios and demonstrates a strong resilience against communication delay caused by DoS attacks.

This study introduces an innovative optimization method to identify the optimal configuration of a sparse symmetric 2D array for applications in security, particularly multistatic imaging. Utilizing Genetic Algorithms (GA) in a sophisticated optimization process, the research focuses on achieving the most favorable antenna distribution while mitigating the common issue of secondary lobes in sparse arrays. The main objective is to determine the ideal configuration from specific design parameters, including hardware specifications such as number of radiating elements, minimum spacing, operating frequency range, and image separation distance. The study employs a cost function based on the the point spread function (PSF), the system response to a point source, with the goal of minimizing the secondary lobe levels and maximizing their separation from the main lobe. Advanced simulation algorithms based on Physical Optics (PO) are used to validate the presented methodology and results.

Modern agriculture requires technology to give precise measures about relevant parameters such as pest control. Here, we developed an algorithm model as base for bait spray intervention, by monitoring the olive fruit fly, Bactrocera oleae (Rossi), with conventional traps, in 24.3 Hectares of non-irrigated Baladi olive cultivars, in Hassbaya region. We installed 49 yellow sticky traps with ammonium bicarbonate. The adults, males and females were monitored, on weekly basis. The traps and the trees were georeferenced, and the parameters such as temperature, relative humidity, tree phenology (BBCH), and fruit load rate were compiled. The results showed that the infested fruits were correlated as much with the fruit load rate as with the number of adults captures which were correlated more to the temperature than the relative humidity. The number of the males captured was higher than the females all over the cultivation period. The first symptoms of the fruits were observed from 22 September when the BBCH was equal to 85%, with an average of adult captures lesser than 5 adults by trap by 7 days.

Quantitative evaluation of the musical timbre and its variations is important for the analysis of audio recordings and computer-aided music composition. Using the FFT acoustic descriptors and their representation in an abstract timbral space, variations of a sample of monophonic sounds of chordophones (violin, cello) and aerophones (trumpet, transverse flute, and clarinet) sounds are analyzed. It is concluded that the FFT acoustic descriptors allow us to distinguish the timbral variations of the musical dynamics, including crescendo and vibrato. Furthermore, using the Random Forest algorithm, it is shown that the FFT-Acoustic provides a statistically significant classification to distinguish musical instruments, family of instruments, and dynamics. We observed a better behavior for the FFT-Acoustic descriptors when classifying pitch compared to some timbral features of Librosa.

To achieve an acceptable level of security on the web, the Completely Automatic Public Turing test to tell Computer and Human Apart (CAPTCHA) was introduced as a tool to prevent bots from doing destructive actions such as downloading or signing up. Mobile devices have small screens, and therefore, using the common CAPTCHA methods (e.g. text CAPTCHAs) in these devices raises usability issues. To introduce a reliable, secure, and usable CAPTCHA that is suitable for mobile devices, this paper introduces a hand gesture recognition CAPTCHA based on applying Genetic Algorithm (GA) principles on Multi-Layer Perceptron (MLP). The proposed method improves the performance of MLP-based hand gesture recognition. It has been trained and evaluated on 2201 videos of the IPN Hand dataset, and MSE and RMSE benchmarks report the index values of 0.0018 and 0.0424, respectively. Comparison with the related works shows a minimum of 1.79% fewer errors, and experiments produced a sensitivity of 93.42% and accuracy of 92.27% – 10.25% and 6.65% improvement compared to the MLP implementation.

This paper presents a novel algorithm, the multi-objective nonlinear interval PageRank (MONIPR) Algorithm. This algorithm extends the conventional PageRank (PR) algorithm, integrating nonlinear interval computation and multi-objective considerations into the computation process. The MONIPR algorithm bridges a research gap in integrating nonlinear interval approaches and multi-objective problems into the PR algorithm, which were traditionally treated separately. In addition, this research adopts the constrained interval arithmetic proposed to address the limitations of the conventional PR algorithm, which tends to overlook uncertainties and results in deterministic outcomes. In addition, we use a numerical example to demonstrate the proposed algorithm, contrasting it with the conventional approaches. A numerical example demonstrates the algorithm's performance by comparing the rank intervals obtained with the traditional crisp Markov chain and PR algorithm. The results highlight the ability of the proposed algorithm to provide a range of possible rank intervals, considering both uncertainty and multi-objectives. The findings suggest potential applications in decision-making, uncertainty quantification, and systems analysis.

Accidents at mining enterprises, including tailing dumps, pose significant threats to human lives, structures, and the environment. This study focuses on designing, constructing, and operating tailing dumps in Siberia's northern region. To ensure safety and minimize environmental impacts, comprehensive scientific monitoring and research were conducted at all stages, including design, construction, operation, and disposal. The aim was to create a uniform mass within the dam body, requiring understanding of the tailings' structure and technological characteristics during placement. Parameters like particle size, distribution, density, and moisture content were considered to assess tailings' physical and geometric properties. Estimated monitoring was introduced as a permanent model to quickly assess the stability of hydrotechnical constructions. This involved monitoring changes in exploitation properties, structure height, beach length, and water levels. A controlled inwashing technology for subsequent dam layers was developed. Complex research facilitated the formulation of an estimated monitoring methodology and an algorithm for tailing dam formation. Practical application demonstrated high reliability and confirmed load-bearing capacity, allowing for the forecast of dam stability and safe execution. Findings led to alterations in work techniques, ensuring safe and efficient operation of tailing dams.

Navigation is the most challenging issue in autonomous vehicles. Researchers in the current era have developed many Artificial Intelligence techniques to navigate, generate paths, and avoid obstacles for optimum path planning for autonomous vehicles. Different studies have investigated bio-inspired techniques to overcome the navigation issue, including obstacle avoidance. This paper uses new meta-heuristic optimization techniques called Dragonfly Algorithm (DA) to set the goal by detecting and avoiding obstacles with minimum human interference. For effective results, the Dragonfly-Fuzzy hybrid algorithm is analyzed over the unstructured environment because individual techniques may not be sure of an optimal solution over all configurations. The main advantage of the proposed hybrid controller is that it combines the multiple features of different approaches into a single controller. This paper compares simulation and experimental findings over various environmental conditions to the individual algorithm. Regarding time and path optimization, the hybrid Dragonfly-Fuzzy controller performs better than the respective controller.

Modern power system integrates more and more new energy and use a large number of power electronic equipment. This makes it face more challenges in online optimization and real-time control. Deep reinforcement learning(DRL) has the ability of processing big data and high-dimensional features, as well as the ability of independently learning and optimizing decision-making in complex environments. In this paper, we explore DRL based online combination optimization method of grid section for large complex power system. In our method, to improve the convergence speed of the model, we propose to discretize the output action of the unit and simplify the action space. We also design a reinforcement learning loss function with strong constraints to further improve the convergence speed of the model and facilitate the algorithm to obtain the stable solution. Moreover, to avoid the local optimal solution problem caused by the discretization of the output action, we propose to use the annealing optimization algorithm to make the granularity of the unit output finer. We verify our method on IEEE 118-bus system. The experimental results show that our model has fast convergence speed and better performance, and can obtain stable solutions.

For an enterprise, the most critical aspect of development is resource management, which has a significant impact on all aspects of the enterprise. Therefore, enterprises must pay attention to resource management allocation, which can better promote the sustainable development of the enterprise and obtain optimal benefits. In the production and development of modern enterprises, the acquisition of benefits also involves the allocation of resources in enterprise management. This paper proposed a benefit optimization scheduling algorithm based on a macroeconomic prediction model under auction mechanism and a grid resource scheduling algorithm driven by a benefit function to allocate resources reasonably. This article used macroeconomic forecasting models to fully understand the resource needs of various departments and the resources held by enterprises, and rationally allocate various resources in various departments. This can improve the work efficiency of various departments, thereby reducing the cost of the enterprise, and achieving optimal benefits for the enterprise. The experimental results in this paper showed that the cost of resource management allocation for the benefit optimization scheduling algorithm and the grid resource scheduling algorithm based on the benefit function driven under the auction mechanism was 105.6 yuan and 46.8 yuan respectively when the task volume was 125 under the multi user environment. The time allocated for resource management was 36.6s and 18.9s respectively. It can be seen that the efficiency function driven grid resource scheduling algorithm had a lower cost and time for resource management allocation, so the efficiency function driven grid resource scheduling algorithm can achieve enterprise efficiency optimization.

Nowadays, the selection of web services with uncertain quality of service (QoS) is gaining a lot of attention in the service-oriented computing paradigm (soc). In fact, searching for a service composition that fulfills a complex user’s request is known to be NP-Complete. The search time is mainly dependent on the number of the requested tasks, the size the available services, and the size of the QoS realizations (i.e., sample size). To handle this problem, we propose a two-stage approach that reduces the search space using heuristics for ranking the tasks’ services and a bat algorithm metaheuristic for selecting the final near optimal compositions. The fitness used by the metaheuristic aims to fulfill all the global constraints of the user. The experimental study shows that the ranking heuristics, termed “fuzzy pareto dominance” and "Zero-order stochastic dominance", are highly effective than the other heuristics and most of the existing state-of-the-art methods.

The stator winding insulation system is the most critical and weak part of the EMU's (electric multiple unit) traction motor. The effective diagnosis for stator ITSC (inter-turn short-circuit) faults can prevent the fault from expanding into phase-to-phase or ground short-circuits. The TCU(traction control unit) controls the traction inverter to output SPWM (sine pulse width modulation) excitation voltage when the traction motor is stationary. Three ITSC fault diagnostic conditions are based on different IGBTs control logic. The Goertzel algorithm is used to calculate the fundamental current amplitude difference Δi and phase angle difference Δθ of equivalent parallel windings under the three diagnostic conditions. The six parameters under the three diagnostic conditions are used as features to establish an ITSC fault diagnostic model based on random forest. The proposed method was validated using a simulation experimental platform for ITSC fault diagnosis of EMU traction motors. The experimental results indicate that the current amplitude features Δi and phase angle features Δθ change obviously with the increase of ITSC fault extent if the ITSC fault occurs at the equivalent parallel windings. The accuracy of the ITSC fault diagnosis model based on the random forest for ITSC fault detection and location both in train and test samples are 100%.

The Complete Coverage Path Planning (CCPP) is a key technology in the field of agricultural robot, and has great significance for improving the efficiency and quality of tillage, fertilization, harvesting and other agricultural robot operations, as well as reducing the operation energy consumption. The traditional boustrophedon or heuristic search algorithm based CCPP methods, when coping with the field with irregular boundaries, obstacles and other complex environments, still face many problems and challenges, such as large repeated work areas, multiple turns or U-turns, low operation efficiency and prone to local optimum. In order to solve the above problems, an improved-genetic-algorithm-based CCPP method was proposed in this paper, which introduces the idea of chromosome pairs and multi-points mutation to improve its global optimization ability in complex environments, reduce the repeated work areas and the number of turns and U-turns, and thereby improve the operation efficiency. The simulation and experimental results on simple regular fields showed that the proposed improved genetic algorithm-based CCPP method achieved the comparable performance with the traditional boustrophedon-based CCPP method. However, on the complex irregular fields, although the proposed CCPP method increased the number of turns by 13.76%, the area of repeated operation and the number of U-turns were decreased by 38.54% and 35.00% respectively, and saves the battery voltage by 7.82% on average compared to the boustrophedon-based CCPP method. This proved that the proposed CCPP method has strong adaptive capacity to the environment, and has practical application value in improving the efficiency and quality of agricultural machinery operations, and reducing the energy consumption.

The corrugated board is a versatile and durable material that is widely used in the packaging industry. Its unique structure provides strength and cushioning, while its recyclability and bio-degradability make it an environmentally friendly option. The strength of corrugated board depends on many factors, including the type of individual papers on flat and corrugated layers, the geometry of the flute, temperature, humidity, etc. This paper presents a new approach to analysis geometric features of corrugated boards based on the images. It allows for precise determination of the geometry of the corrugated layer, as well as the thickness of individual papers in all cardboard layers. The experimental set used in the work and the created software are characterized by high reliability and precision of measurement thanks to the use of an identification procedure based on image analysis and evolutionary algorithms. This allows to quickly find the main geometric characteristics of the corrugated board, which in turn leads to the possibility of performing numerical analyzes taking into account the real model of the corrugated board. Calculations made on a real (correctly mapped geometrically) model allow, for example, a more reliable analysis of the composition of the cardboard, and thus also to obtain greater savings in the optimization process.

The high penetration of intermittence resources in the energy market accelerates significantly the decarbonization process but, on the other hand, the electrical system has to face the problem of unbalances. Renewable Energies Sources (RES) are hard to precisely forecast, and power plants are not able to predict the amount of energy that they can provide far from the real time delivery. In this frame, the intraday market gets a fundamental role allowing agents to adjust their position close to the delivery time. In this work we suggest an agent-based model of intraday market combined with genetics algorithms to understand what the best strategy could be adopted by players in order to optimize the market efficiency in terms of welfare and unsold quantity. In the first part we show the effect on the market prices of different scenarios in which players aim at maximizing their revenues and selling/buying all their volumes. In the second part we show the effect of a particular genetic algorithm on the model, focusing on how agents can adapt their strategy to enhance the market efficiency. Comparative analyses are also performed to investigate how the welfare of the system increases as well as the unsold quantity decrease when genetic algorithm is introduced

Enhancing underwater images in epicontinental sea is a challenging problem owing to the influence of ocean currents, the refraction, absorption and scattering of light by suspended particles, and the weak illumination intensity. Recently, different methods have relied on the underwater image formation model and deep learning techniques to restore the underwater image, but they tend to degrade underwater image, interference of background clutter and miss boundary details of blue regions. Improved image fusion and enhancement algorithm based on a priori dark channel is proposed in this paper. Image edge features sharpening and dark detail enhancement by homomorphism filtering in CIELab color space is realized. In RGB color space, the multi-scale retinal with color restoration (MSRCR) algorithm is used to improve color deviation and enhance color saturation, and the contrast-limited adaptive histogram equalization (CLAHE) algorithm is used to de fog and enhance image contrast. Finally, according to the dark channel images of the three processing results, the final enhanced image is obtained by linear fusion of multiple images and multiple channels. Experimental results demonstrate the effectiveness and practicality of the proposed method on various datasets.

Cracking in a wide array of industrial components and structures pose a significant threat to their integrity. Detecting cracks using ultrasonic inspection techniques is a widespread activity for economic reasons but there are limitations to the techniques due to the morphology of cracks, such as fatigue cracks. In addition to detection there is a need to measure the size of the cracks which are often within the volume of the material. Ultrasonic techniques are well-suited to look inside the volume of the material but achieving sufficient sensitivity to the tip of the cracks in particular is practically difficult. Without an accurate knowledge of where the tip of the crack lies there can be significant uncertainty in sizing measurements. Machine Learning (ML) techniques are being developed to aid in the inspection and monitoring tasks but presenting the ultrasonic data in a suitable way for ML is very important. Following on from recent work presenting the development of the snooker algorithm to create images termed parameter-spaces, this paper presents how these images can be input into neural network based ML systems to automatically size these critical cracks.

Stray light is a critical aspect for high performance optical instruments. When stray light control by design is insufficient to reach the performance requirement, correction by post-processing must be considered. This situation is encountered for example in the case of the Earth observation in-strument 3MI, whose stray light properties are complex due to the presence of many ghosts dis-tributed on the detector array. We implement an iterative correction method and discuss its con-vergence properties. Spatial and field binning can be employed to reduce the computation time but at the cost of a decreased performance. Interpolation of the stray light properties is required to achieve high performance correction. For that, two methods are proposed and tested. The first interpolate the stray light in the field domain while the second applies a scaling operation based on a local symmetry assumption. Ultimately, the scaling method is selected and a stray light reduction by a factor of 58 is obtained at 2σ (129 at 1σ) for an extended scene illumination.

Evaporation from surface water plays a key role in water accounting of basins, water resources management, and irrigation systems management, so simulating evaporation with high accuracy is very important. In this study, two methods for simulating pan evaporation under different climatic conditions in Iran were developed. In the first method, six experimental relationships (linear, quadratic, and cubic, with two input combinations) were determined for Iran’s six climate types, inspired by a multilayer perceptron neural network (MLP-NN) neuron and optimized with the genetic algorithm. The best relationship of the six was selected for each climate type, and the results were presented in a three-dimensional graph. In the second method, the best overall relationship obtained in the first method was used as the basic relationship, and climatic correction coefficients were determined for other climate types using the genetic algorithm optimization model. Finally, the accuracy of the two methods was validated using data from 32 synoptic weather stations throughout Iran. For the first method, error tolerance diagrams and statistical coefficients showed that a quadratic experimental relationship performed best under all climatic conditions. To simplify the method, two graphs were created based on the quadratic relationship for the different climate types, with the axes of the graphs showing relative humidity and temperature, and with pan evaporation was drawn as contours. For the second method, the quadratic relationship for semi-dry conditions was selected as the basic relationship. The estimated climatic correction coefficients for other climate types lay between 0.8 and 1 for dry, semi-dry, semi-humid, Mediterranean climates, and between 0.4 and 0.6 for humid and very humid climates, indicating that one single relationship cannot be used to simulate pan evaporation for all climatic conditions in Iran. The validation results confirmed the accuracy of the two methods in simulating pan evaporation under different climatic conditions in Iran.

The Steepest Descent (or Ascent) algorithm is one of the most widely used algorithms in Science, Technology, Engineering, and Mathematics (STEM). However, this powerful mathematical tool is neither taught nor even mentioned in K12 education. We study whether it is feasible for elementary school students to learn this algorithm, while also aligning with the standard school curriculum. We also look at whether it can be used to create enriching activities connected to children’s real-life experiences, thus enhancing the integration of STEM and fostering Computational Thinking. To address these questions, we conducted an empirical study in two phases. In the first phase, we tested the feasibility with teachers. In a face-to-face professional development work-shop with 457 mathematics teachers actively participating using an online platform, we found that after a 10-minute introduction they could successfully apply the algorithm and use it in a couple of models. They were also able to complete two complex and novel tasks: selecting models and adjusting the parameters of a model that uses the steepest descent algorithm. In a second phase, we tested the feasibility with 90 fourth graders from 3 low Socioeconomic Status (SES) schools. Using the same introduction and posing the same questions, we found that they were able to understand the algorithm and successfully complete the tasks on the online platform. Additionally, we found that close to 75% of the students completed the two complex modeling tasks and performed similarly to the teachers.