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.

In this paper, we develop an effective iterative algorithm to solve a generalized Sylvester tensor equation over quaternions which includes several well-studied matrix/tensor equations as special cases. We discuss the convergence of this algorithm within a finite number of iterations, assuming negligible round-off errors for any initial tensor. Moreover, we demonstrate the unique minimal Frobenius norm solution achievable by selecting specific types of initial tensors. Additionally, numerical examples are presented to illustrate the practicality and validity of our proposed algorithm. These examples include demonstrating the algorithm’s effectiveness in addressing three-dimensional microscopic heat transport and color video restoration problems.

As waterflooding multi-layer reservoirs get into the high-water-cut stage, inter-layer conflicts become increasingly serious, leading to a worsening development effect over time. Production layers regroup is an effective approach for resolving inter-layer conflicts and improving waterflooding efficiency. At the current stage, there are limitations for most of the methods of production layers regroup. This article proposes a smart method for optimizing the layer regroup plan based on genetic algorithm. Comprehensively considering various factors that affect the regroup of layers, based on the combination principle of "smaller intra-group variance and larger inter-group variance of each influencing factor are expected ", genetic algorithm is used to calculate the fitness value of the initial combination schemes, the advantageous schemes with higher fitness values are selected as the basis of the next generation. Then crossover and mutation operations are performed to those advantageous schemes to generate new schemes. Through continuous selection and evolution, until the global optimal solution with the highest fitness value is found, the optimal combination scheme is determined. Comparative analysis with numerical simulation results demonstrates the reliability of this intelligent method, with an increased oil recovery of 4.34% for the sample reservoir. Unlike selecting a preferable plan from a limited number of predefined combination schemes, this method is an automatic optimization to solve the optimal solution of the problem. It improves both efficiency and accuracy as compared to conventional reservoir engineering methods, numerical simulation methods and most of the mathematical methods, thus could provide effective guidance for EOR strategies of waterflooding reservoirs in high-water-cut stage.

The dominant part of energy performance of a building consists of consumption of heating and lighting. Both heating and lighting systems of buildings work at their designed efficiency for most of the buildings’ lifetimes. Interference with existing systems is costly considering replacements and construction adjustments. Therefore, considerable effort must be put into the design of these systems during the building design phase. The article is focused on luminaire layout design strategy, which affects the number of luminaires in a building and therefore their power consumption and the sustainability of the building. A genetic algorithm with radiosity implemented has been used to find suitable placements of luminaires of a single type in a model room to decrease the number of luminaires as much as possible. Three outcomes of optimal luminaire layout design are presented in this paper, including design strategy conclusions. Results of calculation outcomes are verified by software DIALux, that is commonly used for designing lighting systems.

In genomics analysis, with the development of sequencing technology and the rapid growth of data volume, how to effectively identify and analyze important information in genomic data from massive data has become an important challenge. Identify key patterns and features in genomic data through advanced community testing methods. First, genomic data often contains a lot of noise and redundant information that needs to be processed through steps such as normalization, filtering, and dimensionality reduction. Normalization makes data at different scales comparable, filtering out data points with low quality or missing values, and dimensionality reduction reduces data dimensions through principal component analysis (PCA) and retains the main information. The gene co-expression network establishes the connection relationship between genes by calculating the expression similarity matrix between genes, and applies the Louvain algorithm to maximize the modularity of the network, aggregate nodes layer by layer, form a community structure, and identify the complex relationship and potential structure between genes. Finally, we utilize the cancer dataset to evaluate the proposed model. From our extensive experimental results, we can observe that Louvain's algorithm indicates outperformances and accuracy in the recognition and analysis of genomic data.

Background. Keyword co-occurrence analysis is a crucial tool for comprehending research trends, identifying relevant studies, and gaining insight into the connections between various concepts and topics. Objective. This study focuses on analyzing the co-occurrence of keywords using FP-growth algorithm and direct search methods. Materials and methods. The methodology involved extracting bibliometric data of Energies journal for 2023-2024 from MDPI publisher platform, keyword lemmatization and keyword co-occurrence estimation. Clustering and visualization were performed using Multidendrograms and Scimago Graphica software. Results. The results showed that the FP-growth algorithm can achieve a close match with the direct search results, which facilitates data preparation for clustering. In addition, finding the co-occurrence of three or more keywords significantly reduced the number of possible combinations, which allowed the identification of specific research topics. Conclusions. This study highlights the usefulness of the FP-growth algorithm in keyword analysis and provides insights into ways to refine search queries to abstract databases for the purpose of designing and writing literature and systematic reviews.

In recent years, extensive research has been conducted on the IoT, one of its challenges has been the field security and penetration in these networks. security solutions it Require more planning and awareness to ensure system security and privacy protection.it has also been shown that adjusting the weights of neural networks can help improve the accuracy of detection to what extent. the challenge in the attack detection field is to increase the accuracy of attack detection by machine learning methods, in this paper, a new method is presented to adjust weights of the random neural network for attack detection. Evaluations of the proposed method show that compared to random neural network methods, nearest neighbor, and support vector machine, the accuracy of attack detection improves up to 99.49 percent, and the random neural network method has been able to improve by 99.01 percent, placing the best methods together in these experiments in the form of a multi-learning model showed that the results also had an increase in accuracy up to 99.56 percent, while the training time in the proposed model is less compared to the random neural network method.

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.

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.

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.

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.

Malignant growth is the most widely recognized repulsive infections winning around the world, and the patients with disease are saved just when the malignant growth is distinguished at the beginning phase. Each kind of disease is interesting, with its own arrangement of development properties and hereditary changes. This paper presents the lung knob division and disease characterization by proposing an enhancement calculation. The general technique of the created approach includes four stages, such as pre-processing, division, highlight extraction, and the order. From the outset, the CT picture of the lung is taken care of to the division. When the division is done, the highlights are extricated through morphological and measurable and surface highlights like LOOP and LGP. At long last, the extricated highlights are given to the order step. Here, the characterization is done dependent on the Deep Belief Network (DBN) which is prepared by utilizing the proposed Chicken-Sine Cosine Algorithm (CSCA) which distinguish the lung tumor, giving two classes in particular, knob or non-knob. The presentation assessment of lung knob division and malignant growth grouping dependent on CSCA is figured utilizing three measurements to be specific, precision, affectability, and the explicitness.

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.

We consider the problem of scheduling $n$ jobs with identical processing times and given release as well as delivery times on $m$ uniform machines. The goal is to minimize the makespan, i.e., the maximum full completion time of any job. This problem is well-known to have an open complexity status even if the number of jobs is fixed. We present a polynomial-time algorithm for the problem which is based on the earlier introduced algorithmic framework blesscmore (``branch less and cut more''). We extend the analysis of the so-called behavior alternatives developed earlier for the version of the problem with identical parallel machines and show how the earlier used technique for identical machines can be extended to the uniform machine environment if a special condition on the job parameters is imposed. The time complexity of the proposed algorithm is $O(\gamma m^2 n\log n)$, where $\gamma$ can be either $n$ or the maximum job delivery time $q_{\max}$. This complexity can even be reduced further by using a smaller number $\kappa<n$ in the estimation describing the number of jobs of particular types. However, this number $\kappa$ becomes only known when the algorithm has terminated.

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.

In this preprint, we introduce a dataset containing students enrolment applications combined with the related result of their filing procedure. The dataset contains 73 variable. Student candidates, at the time of applying for study, fill a web form for filing the procedure. A committee at Tilburg University review each single application and decide if the student is admissible or not. This dataset is suitable for algorithmic studies and has been used in a comparison between the Naïve Bayes and the C5.0 Decision Tree Algorithms. They have been used for predicting the decision of the committee in admitting candidates at various bachelor programs. Our analysis shows that, in this particular case, a combination of the approaches outperform a both of them in term of precision and recall.

Proper management of solar energy, as an effective renewable source, is of high importance toward sustainable energy harvesting. This paper offers a novel sophisticated method for predicting solar irradiance (SIr) from environmental conditions. To this end, an efficient metaheuristic technique, namely electromagnetic field optimization (EFO) is employed for optimizing a neural network. This algorithm quickly mines a publicly available dataset for non-linearly tuning the network parameters. To suggest an optimal configuration, five influential parameters of the EFO (i.e., N_Pop, R_rate, Ps_rate, P_field, and N_field) are optimized by an extensive trial and error practice. Analyzing the results showed that the proposed model can learn the SIr pattern and predict it for unseen conditions with high accuracy. Furthermore, it provided about 10% and 16% higher accuracy compared to two benchmark optimizers, namely shuffled complex evolution and shuffled frog leaping algorithm. Hence, the EFO-supervised neural network can be a promising tool for the early prediction of SIr in practice. The findings of this research may shed light on the use of advanced intelligent models for efficient energy development.

Nowadays, the wasting of resources is one of the fundamental challenges of the industrial sector. The rectangle packing problem can be very effective in this context. Practical applications of this issue in the timing and designing of the industries and businesses are very remarkable. The purpose of this issue is to arrange a set of rectangles with specific dimensions in a rectangular page with a specific width and unlimited height without overlapping. The fundamental challenge in this issue is that this is an NP-complete issue. Therefore, it is difficult to achieve the best arrangement, which has the maximum rate of resource utilization and also has a linear running time. Many algorithms have been presented to estimate a practical solution for this issue. In the past decades, the best fit method has been one of the most useful methods for this purpose. This study presents a combinatorial algorithm based on two algorithms, including the lowest front-line strategy and the best-fit algorithm. The running results indicate that the suggested algorithm performs well, despite its simplicity. The time complexity of the suggested algorithm is O(nm), in which n is the number of input rectangles and m is the number of the created front lines.

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

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

VNREDSat-1 is the first Vietnamese satellite allowing the survey of environmental parameters such as vegetation and water coverages, or surface water quality at medium spatial resolution (from 2.5 to 10 meters depending on the considered channel). The NAOMI sensor on board VNREDSat-1 has the required spectral bands to assess the suspended particulate matter concentration, SPM. Because recent studies have shown that the remote sensing reflectance, Rrs(), at the blue (450 – 520 nm), green (530 – 600 nm), and red (620 – 690 nm) spectral bands can be assessed from NAOMI with a good accuracy, the present study is dedicated to the development and validation of an algorithm (hereafter referred to as V1SPM) to assess SPM from Rrs() over inland and coastal waters of Vietnam. For that purpose, an in situ data set of hyper-spectral Rrs() and SPM (from 0.47 to 240.14 g.m-3) measurements collected at 205 coastal and inland stations has been gathered. Among the different approaches, including 4 historical algorithms, the polynomial algorithms involving the red-to-green reflectance ratio presents the best performance on the validation data set (MAPD of 18,7%). Compared to the use of a single spectral band, the band ratio allows to reduce the scatter around the polynomial fit as well as the impact of imperfect atmospheric corrections. Due to the lack of matchup data points with VNREDSat-1, the full VNREDSat-1 processing chain (RED-NIR and V1SPM) aiming at estimate SPM from the top-of-atmosphere signal has been applied to the Landsat-8/OLI match-up data points with relatively low to moderate SPM concentration (3.33-15.25 g.m-3) showing a MAPD of 15,8%. An illustration of the use of this VNREDSat-1 processing chain during a flooding event occurring in Vietnam is provided.

The problem of scheduling is an area that has attracted a lot of attention from researchers for many years. Its goal is to optimize resources in the system. The assigning task to the lecturer is an example of the timetabling problem, a class of scheduling. This study introduces a mathematical model to assign fixed tasks (the time and required skills to be fixed) to university lecturers. Our model is capable of generating a calendar that maximizes faculty expectations. The formulated problem is in the form of a multi-objective problem that optimal makes decisions require the trade-off presence of trade-offs between two or more conflicting objectives. To solve this, we use the Compromise Programming approach to multi-objective programming. We then proposed the new version of the Genetic Algorithm to solve the introduced model. Finally, the model and algorithm tested with real scheduling data collected at the Computing Fundamental Department, FPT University, Hanoi, Vietnam.

Cloud computations are based on the computer networks such as Internet which presents a new pattern to provide, consume and deliver services such as infrastructure, software, ground and other resources using network. The inappropriate timing of assigning loads to the virtual machines in the computational space could lead to unbalance in the system. One of the challenging planning problems. In the cloud data centers is considering both assigning and migration (transfer) of the virtual machines with the ability of reconfiguration and the integrated features of the hosting physical machines. In this article, we introduce an integrated and dynamic timing algorithm based on the Genetic evolution algorithm. The suggested method was evaluated based on these factors and different inputs. Our suggested method is done using Java programming language and cloud-SME simulation. The results show that the execution time and the response time were improved by 12 and 1 percent respectively.

Nowadays industrial dryers are used instead of traditional methods for drying. In designing dryers suitable for controlling the process of drying and reaching a high quality product, it is necessary to predict the instantaneous moisture loss during drying. For this purpose, ten mathematical-experimental models with a neural network model based on the kinetic data of pistachio drying are studied. The data obtained from the cabinet dryer will be evaluated at four temperatures of inlet air and different air velocities. The pistachio seeds will be placed in a thin layer on an aluminum sheet on a drying tray and weighed by a scale attached to the computer at different times. In the neural network, data are divided into three parts: educational (60%), validation (20%) and test (20%). Finally, the best mathematical-experimental model using genetic algorithm and the best neural network structure for predicting instantaneous moisture are selected based on the least squared error and the highest correlation coefficient.

The aim of this study has been to develop a novel two-level multi-objective genetic algorithm (GA) to optimize time series forecasting data for fans used in road tunnels by the Swedish Transport Administration (Trafikverket). Level 1 is for the process of forecasting time series cost data, while level 2 evaluates the forecasting. Level 1 implements either a multi-objective GA based on the ARIMA model or a multi-objective GA based on the dynamic regression model. Level 2 utilises a multi-objective GA based on different forecasting error rates to identify a proper forecasting. Our method is compared with using the ARIMA model only. The results show the drawbacks of time series forecasting using only the ARIMA model. In addition, the results of the two-level model show the drawbacks of forecasting using a multi-objective GA based on the dynamic regression model. A multi-objective GA based on the ARIMA model produces better forecasting results. In level 2, five forecasting accuracy functions help in selecting the best forecasting. Selecting a proper methodology for forecasting is based on the averages of the forecasted data, the historical data, the actual data and the polynomial trends. The forecasted data can be used for life cycle cost (LCC) analysis.

A lightweight composite bridge deck system composed of steel orthotropic deck stiffened with thin Ultra-High Performance Concrete (UHPC) layer is developed to eliminate fatigue cracks in orthotropic steel decks. During the construction and operation period of the bridge, the debonding between the steel deck and the UHPC layer may introduce the several issues, such as crack-induced water invasion and distinct reduction of the shear resistance. In the study, an effective and novel non-destructive interface condition monitoring approach using piezoelectric lead zirconate titanate (PZT)-based technologies is proposed to detect interfacial delamination between steel deck and UHPC layer. Experimental tests are performed on several steel-UHPC composite slabs and a conventional steel-concrete composite slab. The thin styrofoam sheets with different sizes and thicknesses are set on different locations of the steel deck as the artificial debondings. The PZT ceramic patches are bonded on the surfaces of the steel deck and UHPC layer as the actuators/sensors. An improved PSO (Particle Swarm Optimization)-K-means clustering algorithms is proposed to obtain the debonding patterns based on the feature data set. The laboratory tests demonstrate that the proposed approach provides an effective and accurate way to detect interfacial debonding of steel-UHPC composite slab.

Fetal weight estimation before delivery is important in obstetrics, which assists doctors diagnose abnormal or diseased cases. Linear regression based on ultrasound measures such as bi-parietal diameter (bpd), head circumference (hc), abdominal circumference (ac), and fetal length (fl) is common statistical method for weight estimation but the regression model requires that time points of collecting such measures must not be too far from last ultrasound scans. Therefore this research proposes a method of early weight estimation based on expectation maximization (EM) algorithm so that ultrasound measures can be taken at any time points in gestational period. In other words, gestational sample can lack some or many fetus weights, which gives facilities to practitioners because practitioners need not concern fetus weights when taking ultrasound examinations. The proposed method is called dual regression expectation maximization (DREM) algorithm. Experimental results indicate that accuracy of DREM decreases insignificantly when completion of ultrasound sample decreases significantly. So it is proved that DREM withstands missing values in incomplete sample or sparse sample.

In this paper, the methods and their analysis for estimating the location of three dimension (3-D) single source buried in lossy medium are presented with uniform circular array (UCA). The mathematical model of the signal in the lossy medium is proposed. Using location information in the covariance matrix obtained by sensors’ output, the equations of the source location (azimuth angle, elevation angle and range) are obtained. The phase and amplitude of the covariance matrix function are used to process these equations respectively. Then, the phase and amplitude of the covariance matrix function are used to process the source localization in the conductive medium together. By analyzing the characteristics of the proposed methods and MUSIC method, the computational complexity and the valid range of these methods are given. From the results, whether the loss is known, we can choose the appropriate method to process the issues (localization in lossless medium or lossy medium).

This study aims to automate the optimization of a Full-Range speaker in an SUV's audio system according to the equal loudness contours principle. The input signal, and frequency responses of the amplifier and speaker were transferred to Matlab. Using ideal filter parameters, ten parametric equalizer models were created, and the speaker output was obtained using the convolution technique. The same filter settings were applied to the vehicle multimedia system, and experimental results were obtained. The simulation and experimental results were compared, showing high similarity with a Pearson correlation coefficient of 0.9295 and an RMSE of 2.29. Results were compared with the ideal contour. The Pearson correlation coefficients for simulation and experimental results were 0.6341 and 0.6715, with RMSE values of 4.88 and 2.57, showing low similarity. Consequently, each parametric equalizer filter's parameters were optimized using a genetic algorithm. The optimized parameters were applied to the vehicle multimedia system, and results were compared with the ideal contour. The Pearson correlation coefficients for simulation and experimental results were 0.965 and 0.9661, with RMSE values of 2.12 and 1.48. These results indicate that optimization aligns the speaker output closer to the ideal contour, enhancing in-vehicle audio system performance and increasing user satisfaction.

According to the requirement of 20kg load of casting barrel, we design a three-dimensional model of the robot and analyze the three stages of liquid level change in the casting barrel during the casting process. Through the analysis, it is determined that the time and angle function is an implicit function, and it is impossible to find the analytical expression of time about angle. The kinetic function of the casting barrel is simulated by MATLAB, and it is found that the function image has mutation points, and when the original function is fitted and approximated by fifth-degree polynomial interpolation, the fifth-degree polynomial function image of the time versus the angular acceleration has a large amplitude of oscillation, especially the mutation points. A PID algorithm based on the discretization of the time and acceleration function is introduced for correction, and the results show that this method effectively reduces the oscillation amplitude of the image and improves the coincidence with the original function.

In this study, we propose the Signal Integration Reconstruction Peak Detection (SIRPD) algorithm for reliable Cardiac Beat Interval (CBI) measurement using functional Near-Infrared Spectroscopy (fNIRS) signals. This algorithm enhances reliability by identifying a regular waveform in cerebral blood flow associated with heartbeats. The SIRPD algorithm assesses the Signal Quality Index (SQI) per channel, discards signals from unavailable channels, and interpolates oxygenated and total hemoglobin concentration signals, thereby boosting resolution and integrating the signal into a single channel. The integrated and smoothed signal is transformed to identify the most significant periodic waveform, from which the CBI is extracted. Validated with data from 20 healthy subjects who simultaneously recorded fNIRS and ECG signals, our findings confirm the equivalence of the CBI derived from ECG and calculated through the SIRPD algorithm from fNIRS (R^2 = .98, RMSE = .011, ICC = .991). We also extracted heart rate variability (HRV) features, confirming no significant difference in all features between ECG and fNIRS devices. Uniquely, this study regards the fNIRS heart signal not as an artifact source but as a valuable bio signal. The proposed method, which allows for the detection of cardiac beat intervals from cerebral blood flow oscillations, suggests the potential clinical applicability of fNIRS as an auxiliary indicator for various cardiovascular factors.

The clinical neurophysiological tests allow determine the type, extent, and nature of brachial plexus damage. They are crucial in decision-making regarding surgical procedures or conservative treatment. This report aimed to present an algorithm for rehabilitation procedures in patients with brachial plexus injury of various origins based on the results of neurophysiology findings for the selection of procedures supporting the process of nerve and muscle regeneration. The research group consisted of patients whose medical documentation was analyzed concerning the reason, level, and localization of damage to the brachial plexus structures, surgical and or rehabilitative treatment as well as the MRI results. Among the group of ten patients, the clinical studies showed the greatest incidence of brachial plexus injuries of the mixed (both pre- and postganglionic), all trunks, and cervical root injuries, respectively. Results of the motor evoked potentials (MEP) and electroneurography (ENG) recordings induced at levels of spinal roots and Erb's point showed a decrease of more than 40% in amplitudes on the symptomatic side in comparison to the asymptomatic side. This difference was recorded for the axillary and radial innervation and the C5, C6, and C7 root domains, ranging from 56% to 71%; the lowest decrease was recorded following electrical stimulation at Erb's point for the ulnar nerve (41.5%). The latency prolongation on the symptomatic side in CMAP and MEP tests ranged from 0.2 to 1.9 ms, the most following magnetic stimulation of the C5 cervical root for the axillary innervation. All results indicated the axonotmesis and neuropraxia type of injury in motor fibers (40%) confirmed by EMG results. The sensory conduction studies (SNCS) in distal nerve branches did not confirm the severe advancement of the brachial plexus injury (22%). The proposed algorithm of the physiotherapeutic procedures should be mainly targeted for recovery of motor dysfunction as the consequence of brachial plexus injury. Rehabilitation should incorporate the treatment supporting nerve regeneration, muscle strengthening, and maintaining functional ranges of motion of the injured extremities. The rehabilitation treatment for patients with brachial plexus injuries is an individualized process, and the selection of procedures and the effectiveness of the treatment undertaken should be confronted with results of neurophysiological tests verifying the motor neural transmission from the level of the cervical motor center to the effector, peripheral nerve function, and muscle’s motor unit activity.

Corrugated board, widely used in the packing industry, is a recyclable and durable material. Its strength and cushioning, influenced by geometry, environmental conditions like humidity and temperature, and paper quality, make it versatile. Double-walled (or five-ply) corrugated board, comprising two flutes and three liners, enhances these properties. This study introduces a novel approach to analyze 5-layered corrugated board, extending a previously published algorithm for single-walled boards. Our method focuses on measuring layer and overall board thickness, flute height, and center lines of each layer. Integrating image processing and genetic algorithms, the research successfully developed an algorithm for precise geometric feature identification of double-walled boards. Images were recorded using a special device with a sophisticated camera and image sensor for detailed corrugated board cross-sections. Demonstrating high accuracy, the method faced limitations only with very deformed or damaged samples. This research contributes significantly to quality control in the packaging industry and paves the way for further automated material analysis using advanced machine learning and image sensors. It emphasizes the importance of sample quality and suggests areas for algorithm refinement to enhance robustness and accuracy.

The electrical energy supply relies on the satisfactory operation of insulators. The ultrasound recorded from insulators in different conditions has a time series output, which can be used to classify faulty insulators. The random convolutional kernel transform (Rocket) algorithms use convolutional filters to extract various features from time series data. This paper proposes the combination of Rocket algorithms, machine learning classifiers, and empirical mode decomposition (EMD) methods, such as complete ensemble empirical mode decomposition with adaptive noise (CEEMDAN), empirical wavelet transform (EWT), and variational mode decomposition (VMD). The results show that the EMD methods combined with MiniRocket, significantly improve the accuracy of logistic regression in insulator fault diagnosis. The proposed strategy achieves respectively an accuracy of 0.992 using CEEMDAN, 0.995 with EWT, and 0.980 with VMD. These results highlight the potential of incorporating EMD methods in insulator failure detection models to enhance the safety and dependability of power systems.

This research proposes an algorithm to sign messages using the ElGamal asymmetric cryptosystem, called: Digital signature algorithm based on ElGamal, Diffie-Hellman protocol and the number π (DSAπ). This proposal has a high level of security like the DSA standard, in addition, execution times are reduced in relation to it. The Diffie-Hellman protocol and the number π were used in the construction of the digital signature algorithm in conjunction with the Hash-Sha-512 function. Some experiments are presented to provide evidence that the bits on the right side of the decimal point of π appear randomly, such as: a color image was constructed of a string of consecutive bits chosen at random, of the number π. Subsequently, parameters such as: entropy, correlation, discrete Fourier transform, goodness-of-fit test χ2 were evaluated. It is mentioned that an S-box 8×8 is involved in the signature. The sensitivity of the signature was measured, that is, when small changes are made to the sender’s private key, or small changes to the message. Finally, an image was constructed using the signatures of random texts, and subsequently the randomness of its pixels was obtained, to verify that there is no relationship between the different signatures.

Chlorophyll a concentration (Chl) is a key variable to estimate primary production (PP) through ocean color remote sensing (OCRS). Accurate Chl estimate is crucial for better understanding of spatio-temporal trends of PP over recent decades as a consequence of climate change. However, a number of studies have reported that currently operational chlorophyll a algorithms perform poorly in the Arctic Ocean (AO), which is mainly caused by the interference of colored and detrital material (CDM) with the phytoplankton signal in the visible part of the spectrum. To determine how and to what extent that CDM would bias the estimation of Chl, we evaluated the performances of 8 currently available ocean color algorithms: OC4v6, OC3Mv6, OC3V, OC4L, OC4P, AO.emp, GSM01 and AO.GSM. Our results suggest that the empirical AO.emp algorithm performs the best overall, but for waters with high CDM (acdm(443) &gt; 0.067 m-1), which is of much interest in the Arctic, it is the two semi-analytical GSM models that show better performance. Besides, sensitivity analyses using an Arctic spectrally- and vertically-resolved primary production model further show that errors in Chl mostly propagate proportionally to PP estimates with 7% amplification at maximum. We aslo demonstrate that the higher level of CDM relative to Chl in the water column, the larger the bias would occur in both Chl and PP estimates. Although the AO.GSM overall best performs among algorithms tested in the present study, it tends to fail for a significant number of pixels (16.2% observed in the present study) particularly for waters with high CDM. Our results suggest that an algorithm that provides reasonable Chl estimates for a wide range of optically-complex Arctic waters is still required.

Disease detection and prediction have been one of the most frequent uses of machine learning models in the last decade, and Parkinson's disease is no exception. It is common for people in their old age to have one form of disease or another depending on the circumstances in which they find themselves. This study analyzed and evaluated various supervised machine learning models to detect the presence of Parkinson's disease in elderly individuals. An extreme gradient boosting model, along with other models, such as naïve Bayes, random forest, K-nearest neighbor, and support vector machine (SVM), was implemented to determine the best outcome. The extreme gradient boosting (XGBoost) model is a powerful boosting machine learning technique, particularly in terms of speed and accuracy. The results showed that the XGBoost model, which is an optimized version of the other boosting models, is capable of projecting the presence of Parkinson's disease with very high accuracy compared to other algorithms. The implemented classification algorithm extreme gradient boosting method achieved approximately 98 % accuracy, 97.5 % precision, 100.0 % recall, and 98.7% f1-score which are high compared with the results found in the existing literature.

Topological data analysis (TDA) is a recent approach for analyzing and interpreting complex data sets, based on ideas a branch of mathematics called algebraic topology. TDA has proven useful to disentangle non-trivial data structure in a broad range of data analytics problems including the study of cardiovascular signals. This review aims to provide an overview of the application of TDA to cardiovascular signals and its potential to enhance the understanding of cardiovascular diseases and their treatment. We first introduce the concept of TDA and its key techniques, including persistent homology, Mapper, and multidimensional scaling. We then discuss the use of TDA in analyzing various cardiovascular signals, including electrocardiography, photoplethysmography, and arterial stiffness. We also discuss the potential of TDA to improve the diagnosis and prognosis of cardiovascular diseases, as well as its limitations and challenges. Finally, we outline future directions for the use of TDA in cardiovascular signal analysis and its potential impact on clinical practice. Overall, TDA has shown great promise as a powerful tool for the analysis of complex cardiovascular signals and may offer significant insights into the understanding and management of cardiovascular diseases.

This work introduces an innovative approach that unites a PIDND2N2 controller and the balanced arithmetic optimization algorithm (b-AOA) to enhance the stability of an automatic voltage regulator (AVR) system. The PIDND2N2 controller, tailored for precision, stability, and responsiveness, mitigates the limitations of conventional methods. The b-AOA optimizer is obtained through integration of pattern search and elite opposition-based learning strategies into the arithmetic optimization algorithm. This integration optimizes the controller parameters and the AVR system's response, harmonizing exploration and exploitation. Extensive assessments, including evaluations on 23 classical benchmark functions, demonstrate the efficacy of the b-AOA. It consistently achieves accurate solutions, exhibits robustness in addressing a wide range of optimization problems, and stands out as a promising choice for various applications. In terms of AVR system, comparative analyses highlight the superiority of the proposed approach in transient response characteristics, with the shortest rise and settling times and zero overshoot. Additionally, the b-AOA approach excels in frequency response, ensuring robust stability and a broader bandwidth. Furthermore, the proposed approach is compared with various state-of-the-art control methods for the AVR system, showcasing impressive performance. These important results underscore the significance of this work, setting a new benchmark for AVR control by advancing stability, responsiveness, and reliability in power systems.

One of the most important applications in the wireless sensor networks (WSN) is to classify mobile targets in the monitoring area. In this paper, a multi-DBN weighted voting classification algorithm is proposed on the basis of the Deep Belief Network (DBN) classifier and combined with the idea of voting method, which is implemented on the nodes of the WSN monitoring system by means of "upper training, lower transplantation" appraoch. The performance of the algorithm is verified by using real-world experimental data, and the results show that the proposed method has a higher accuracy in classifying the target signal features, achieving an average classification accuracy of 84.63% across four different types of moving targets. The experiment reveals that the multi-DBN weighted voting algorithm enhances the target classification accuracy by approximately 5% in comparison to the single DBN classifier, but the memory and computation time required for the algorithm to run are also increased at the same time. Compared to the FFNN classifier, which exhibited the highest classification accuracy among the four selected methods, the algorithm achieves an improvement of approximately 8.8% in classification accuracy. However, it incurs greater time overhead to run.

Subway construction is often in a complex natural and human-machine operating environment, and that complicated setting leads to subway construction more prone to safety accidents, which can cause substantial casualties and monetary losses. Thus, it is necessary to investigate the safety risks of subway construction. The existing literature on the identification and assessment of subway construction safety risks(SCSR) is susceptible to the influence of subjective factors. Moreover, although existing studies have explored the interrelationships between different risks, these studies usually analyze the interrelationships of single risks, lack the study of risk chain transfer relationships, and fail to find out the key path of risk transfer. Therefore, this paper innovatively combines text mining, association rules and complex networks to deep mine subway construction safety incident reports and explore risk transfer process. Firstly, it uses text mining technology to identify subway construction safety risk; Then, association rules are introduced to explore the causal relationships among safety risk; Finally, the key safety risk and important transfer paths of subway construction safety accidents (SCSA) are obtained based on the complex network model. Research results show that (a) improper safety management, unimplemented safety subject responsibilities, violation of operation rules, non-perfect safety responsibilities system and insufficient safety education and training are the key safety risk in SCSA; (b) two shorter key risk transfer paths in the subway construction safety network can be obtained: insufficient safety education and training→lower safety awareness→violation of operation rules→safety accidents; insufficient safety checks or hidden trouble investigations→violation of operation rules→safety accidents; (c) in the process of risk transfer, the risk can be controlled by controlling the key nodes or cutting off the transfer path. The results of the study provide new ideas and methods for SCSR identification and influence element mining, which help safety managers propose accurate subway construction safety risk control measures.

This research highlights the importance of error-correcting codes in ensuring secure and efficient data transmission over noisy channels. It discusses the application of Convolutional codes and the Viterbi algorithm for error detecting and correcting in applications where the data rate is high and the error probability is relatively low. This research extends beyond previous studies by conducting a comparative analysis of Convolutional codes, the Viterbi algorithm, and alternative coding methods utilized in satellite communication systems, by evaluating their effectiveness and efficiency relative to other coding approaches like BCH, LDPC, and turbo codes. The evaluation encompasses key performance metrics including error correction capabilities, computational complexity, and robustness against various error types. Additionally, practical implementation factors such as power consumption, computational requirements, and compatibility with existing hardware are considered. The analysis sheds light on the advantages and disadvantages of each coding method, offering insights into why convolutional codes and the Viterbi algorithm are particularly suitable for GPS systems.

In order to assess the degradation state of rolling bearings and accurately grasp the remaining life information of rolling bearings, a bearing remaining life prediction method based on the grey wolf optimization algorithm to improve the BP neural network model is proposed. The method consists of two steps, firstly, using the craggy value and root mean square value to determine the first failure time of rolling bearings so as to approximate the input features, and secondly, using the Grey Wolf optimization algorithm to optimize the BP neural network to construct the degradation model of the bearings through machine learning. The method reduces the prediction error compared with conventional techniques, indicating that the method can effectively simulate the bearing degradation process and predict the remaining useful life (RUL) of the bearing.

Missing observation is a common problem in scientific and industrial experiments, particularly in a small-scale experiment. They often present significant challenges when experiment repetition is infeasible. In this research, we propose a multi-objective genetic algorithm as a practical alternative for generating optimal mixture designs that remain robust in the face of missing observation. Our algorithm prioritizes designs that exhibit superior D-efficiency while maintaining a high minimum D-efficiency due to missing observation. The focus on D-efficiency stems from its ability to minimize the impact of missing observations on parameter estimates, ensure reliability across the experimental space, and maximize the utility of available data. We study problems with three mixture components where the experimental region is an irregularly shaped polyhedral within the simplex. Our designs have proven to be D-optimal designs, demonstrating exceptional performance in terms of D-efficiency and robustness against missing observations. We provide a well-distributed set of optimal designs derived from the Pareto front, enabling experimenters to select the most suitable design based on their priorities using the desirability function.

Fluctuating stock prices make it difficult for investors to see investment opportunities. One tool that can help investors overcome this is forecasting techniques. Long Short-Term Memory (LSTM) is one of deep learning methods used in forecasting time series. The training and success of deep learning is strongly influenced by the selection of hyperparameters. This research uses a hybrid method between the Genetic Algorithm (GA) and LSTM to find a suitable model for predicting stock prices. GA is used in optimizing the architecture such as the number of epochs, window size, and the number of LSTM units in the hidden layer. Tuning optimizer is also carried out using several optimizers to achieve the best value. From method that has been applied, it shows that the method has a good level of accuracy with MAPE values below 10% in every optimizer used. The error rate generated is quite low, in case-1 with a minimum RMSE value of 93.03 and 94.40, & in case-2 with an RMSE value of 104.99 and 150.06 during training and testing. A fairly stable and small value is generated by setting it using the Adam Optimizer.

Continuous water resources monitoring is needed for sustainable urban water supply. Remote sensing techniques have proven useful for monitoring some water qualitative parameters with optical characteristics. The study area was the Marateca reservoir in central inland Portugal. The aims were the following: (1) to explore the water quality parameters at the monitoring points of the Marateca reservoir that may explain the event; (2) to validate optical water quality parameters with the monitoring points data; and (3) to model the reservoir water characteristics regarding its deepness, trophic state, and turbidity. The parameters total phosphorus, total nitrogen, and chlorophyll-a were used to compute a trophic level index. The Sentinel-2 imagery was used to compute spectral indices and bands image ratio; to obtain spectral signatures for the monitoring points, and to model water characteristics. The water parameters were above the recommended values at the reservoir entry point from the Ocreza River. The reservoir trophic level was Hypereutrophic and Eutrophic. The spectral signatures confirmed a Hypereutrophic pattern in the entry point. The Marateca reservoir’s water characteristics modeling forecasted problematic zones by contamination. The methodological approach developed can be easily applied to other reservoirs and is a key support tool for decision-makers.

Machine learning (ML) is widely used in the field of crop-growing information identification based on high-resolution remote sensing images. With Baoying County in Jiangsu Province, China, as the study area, this paper used Sentinel-2 images during the winter wheat growth period to construct its spectral, textural, and topographic features during its growth period and proposes a winter wheat-growing area extraction method based on the extreme gradient boosting (XGBoost) algorithm, which was compared with traditional ML algorithms such as the support vector machine (SVM), classification and regression tree (CART), and random forest (RF) algorithms. The results indicated that (1) a winter wheat-growing area identification model based on the XGBoost algorithm was successfully constructed based on Sentinel-2 images, considering 27 spectral, textural, and topographic features; (2) the constructed model could effectively extract winter wheat in the study area with an overall accuracy of 93.43% and only a small error compared with the actual winter wheat-growing area in Baoying County, meeting the accuracy requirement for crop identification in the study area; and (3) the deep learning algorithm XGBoost outperformed the three traditional ML algorithms, among which the RF algorithm was better than the SVM and CART algorithms, both of which had poor identification performance and a large error compared with the actual growing area. This paper provides a scientific basis for the accurate extraction of winter wheat-growing areas and further research on winter wheat growth monitoring and yield estimation.

Cyber-physical security is vital for protecting key computing infrastructure against cyber attacks. Individuals, corporations, and society can all suffer considerable digital asset losses due to cyber attacks, including Data loss, theft, financial loss, reputation harm, company interruption, infrastructure damage, ransomware attacks, and espionage. A cyber-physical attack harms both digital and physical assets. Cyber-physical system security is more challenging than software-level cyber security because it requires physical inspection and monitoring. This paper proposes an innovative and effective algorithm to strengthen Cyber-Physical Security (CPS) with minimal human intervention. It is a Human Activity Recognition (HAR)-based approach where a GoogleNet-BiLSTM network hybridization has been used to recognize suspicious activities in cyber-physical infrastructure perimeter. The proposed HAR-CPS algorithm classifies suspicious activities from real-time video surveillance with an average accuracy of 73.15%. It incorporates Machine Vision at the IoT Edge (Mez) technology to make the system latency tolerant. Dual-layer security has been ensured by operating the proposed algorithm and GoogleNet-BiLSTM hybrid network from a cloud server, which ensures the security of the proposed security system. The innovative optimization scheme makes it possible to strengthen cyber-physical security with $4.29 per month only.

The environmental disaster in Kamchatka in the autumn of 2020 was caused by an extensive bloom of harmful microalgae of the genus Karenia. A spectral shape algorithm was used to detect algae. The algorithm calibration of in situ species composition data made it possible to identify areas where harmful algae dominated in biomass. Satellite images of chlorophyll-a concentra-tion, turbidity, specific fluorescence, and spectral shape parameter were computed. The images were used to recognize the stages of algal bloom: intensive growth, blooming, and change in the dominant algal species. Cases of an increase in the concentration of harmful substances in the coastal zone due to wind impact were analyzed. The following explanation of events has been offered. After the stage of intensive growth of microalgae, nutrient deficiency stimulated the production of metabolites that have a harmful effect on the environment. The change of the dominant alga species in the second half of September and the past storm contributed to a sharp increase in the concentration of metabolites and dead organic matter in the coastal zone, which caused an ecological disaster. The subsequent mass bloom of alga species of the same genus, and the regular wind impact leading to the concentration of harmful substances in the coastal zone, contributed to the development of this catastrophic phenomena.

Computer network attacks are evolving in parallel with the evolution of hardware and neural network architecture. Despite major advancements in Network Intrusion Detection System (NIDS) technology, most implementations still depend on signature-based intrusion detection systems, which can’t identify unknown attacks. Deep learning can help NIDS to detect novel threats since it has a strong generalization ability. The deep neural network’s architecture has a significant impact on the model’s results. We propose a genetic algorithm based model to find the optimal number of hidden layers and the number of neurons in each layer of the deep neural network (DNN) architecture for the network intrusion detection binary classification problem. Experimental results demonstrate that the proposed DNN architecture shows better performance than classical machine learning algorithms at a lower computational cost.

In this note we study the computation of the minimum polynomial of a matrix $A$ and how we can use it for the computation of the matrix $A^n$. We also describe the form of the elements of the matrix $A^{-n}$ and we will see that it is closely related with the computation of the Drazin generalized inverse of $A$. Next we study the computation of the exponential matrix and finally we give a simple proof of the Leverrier - Faddeev algorithm for the computation of the characteristic polynomial.

As a stimulus signal, coded electrical signals can control the motion behavior of animals, which has been widely used in the field of animal robots. In current research, most of the stimulus signals used by researchers are traditional waveform, such as square waves. To enrich the stimulus waveform, a wireless animal robot stimulation system based on neuronal electrical signal characteristics is presented in this paper. The stimulator uses the CC1101 wireless module to control animal behavior through brain stimulation. The LabVIEW-based graphical user interface(GUI) can manipulate brain stimulation remotely while the stimulator powered by battery. Additionally, the spikes of animals have been simulated by this system through Direct Digital Synthesizer(DDS) algorithm. The GUI enable users to customize the combination of these analog spike signals. The recombined signals are sent to the stimulator through CC1101 as stimulus signals. In vivo experiments conducted on five pigeons verified the efficacy of the stimulation mechanism. The analog spike signal with an amplitude of 3-5V successfully caused the pigeon’s turning behavior. The feasibility of the analog spike signals as stimulus signals was successfully verified. Increased the diversity of stimulus waveform in the field of animal robots.

Nowadays, speed up development and use of digital devices such as smartphones have put people at risk of internet crimes. The evidence of present crimes in a computer file can be easily unreachable by changing the prefix of a file or other algorithms. In more complex cases, either file divided into different parts or the parts of a file that has information about the file type are deleted, where the file fragment recognition issue is discussed. The known files are divided into different fragments, and different classification algorithms to solve the problems of file fragment recognition. A confusion matrix measures the accuracy of type recognition. In the present study, first, the file is divided into different fragments. Then, the file fragment features, which are obtained from Binary Frequency Distribution (BFD), are reduced by 2 feature reduction algorithms; Sequential Forward Selection algorithm (SFS) as well as Sequential Floating Forward Selection algorithm (SFFS) to delete sparse features that result in increased accuracy and speed. Finally, the reduced features are given to 3 classifier algorithms, Multilayer Perceptron (MLP), Support Vector Machines (SVM), and K-Nearest Neighbor (KNN) for classification and comparison of the results. In this paper, we proposed the algorithm of file type recognition that can recognize 6 types of useful files ( pdf, txt, jpg, doc, html, exe), which may distinguish a type of file fragments with higher accuracy than the similar works done.

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

Cluster-based routing in Mobile Ad-Hoc Networks is considered one of the convenient methods of routing. The existence of Cluster Head (CH) in a group of nodes for data forwarding improves the performance of routing in terms of routing overhead and power consumption. In this paper, a clustering algorithm using hierarchical routing for mobile ad hoc networks is proposed. In the proposed method, first, clusters are formed by the FLOC clustering method with low overlapping. Then, according to the most important network criteria, including hop count, noise ratio, distance, remaining energy, and link expiration time, head clusters are selected based on the weighting algorithm. To transfer data in the proposed method, two types of communication are used, e.g., inter-cluster communication and intra-cluster communication in which the shortest path to the target cluster is selected. The proposed P-METHOD technique is based on hierarchy and clustering as well as using a weighted algorithm that reduces delay in data transmission on the network. Moreover, P-METHOD is evaluated here via extensive simulations carried out in NS-2. The simulation results indicate that the MANET network performance metrics are improved in terms of average throughput, Packet Delivery Ratio (PDR), delay, residual energy, and lifetime.

Driving simulators are widely used for understanding human-machine interaction, driver behavior and in driver training. The effectiveness of simulators in these process depends largely on their ability to generate realistic motion cues. Though the conventional filter-based motion cueing strategies have provided reasonable results, these methods suffer from poor workspace management. To address this issue, linear MPC-based strategies have been applied in the past. However, since the kinematics of the motion platform itself is non-linear and the required motion varies with the driving conditions, this approach tends to produce sub-optimal results. This paper presents a nonlinear MPC-based algorithm which incorporates the nonlinear kinematics of the Stewart platform within the MPC algorithm in order to increase the cueing fidelity and utilize maximum workspace. Further, adaptive weights-based tuning is used to smoothen the movement of the platform towards its physical limits. Full-track simulations were carried out and performance indicators were defined to objectively compare the response of the proposed algorithm with classical washout filter and linear MPC-based algorithms. The results indicate a better reference tracking with lower root mean square error and higher shape correlation for the proposed algorithm. Lastly, the effect of the adaptive weights-based tuning was also observed in the form of smoother actuator movements and better workspace utilization.

We developed a novel hybrid approach for solving global optimization, computer science, bio-medical and engineering real life applications that is based on the coupling of the Whale Optimizer and Sine Cosine Algorithms via a surrogate model. We relate the whale optimizer algorithm to balance between the exploitation and the exploration process in the proposed method. There exist confirmed techniques for searching approximate best optimal solutions, but our algorithm will further guarantee that such numerical and statistical solutions satisfy physical bounds of the standard and real life functions. Our experiments with the benchmark, bio-medical, computer science and engineering real life problems have illustrated the advantages of using a newly hybrid approach based on mixing Whale Optimizer and Sine Cosine algorithms. It holds considerable potential for reducing execution time for solving standard and real life problems and at the same time improving the quality of the solution.

In the manufacturing industry, orders are typically scheduled and delivered through batches, and the probability of machine failure under high-load operation is high. On this basis, we focus on a single machine batch scheduling problem with a maintenance interval (SMBSP-MI). The studied problem is expressed by three-field representation as 1|B,MI|\sum{F_j+\mu}m, and the optimization objective is to minimize total flow time and delivery costs. Firstly, 1|B,MI|\sum{F_j+\mu}m is proved to be NP-hard by Turing reduction. Secondly, shortest processing time (SPT) order is shown the optimal scheduling of SMBSP-MI, and a dynamic programming algorithm based on SPT (DPA-SPT) with the time complexity of O(n^3T_1) is proposed. A small-scale example is designed to verify the feasibility of DPA-SPT. Finally, DPA-SPT is approximated to a fully-polynomial dynamic programming approximation algorithm based on SPT (FDPAA-SPT) by intervals partitioning technique. The proposed FDPAA-SPT runs in O(\frac{n^5}{\varepsilon^2})\ time with the approximation (1+\varepsilon).

This article proposes a monitoring system that allows to track transitions between different stages in the berry harvesting process (berry picking, waiting for transport, transport, and arrival to the packing) solely using information from temperature and vibration sensors located in the basket. The monitoring system assumes a characterization of the process based on Hidden Markov Models and uses the Viterbi algorithm to perform inference and estimate the most likely state trajectory. The obtained state trajectory estimate is then used to compute a potential damage indicator in real-time. The proposed methodology does not require information about the weight of the basket to identify each of the different stages, which makes it effective and more efficient than other alternatives available in the industry.

The tsscds method, recently developed in our group, discovers chemical reaction mechanisms with minimal human intervention. It employs accelerated molecular dynamics, spectral graph theory, statistical rate theory and stochastic simulations to uncover chemical reaction paths and to solve the kinetics at the experimental conditions. In the present review, its application to solve mechanistic/kinetics problems in different research areas will be presented. Examples will be given of reactions involved in photodissociation dynamics, mass spectrometry, combustion chemistry and organometallic catalysis. Some planned improvements will also be described.

In the past, Unmanned Aerial Vehicles (UAVs) were mostly used in the military operations to prevent pilot losses. Nowadays, the fast technological evolution enables the production of a class of cost-effective UAVs which can service a plethora of public and civilian applications, specially when configured to work cooperatively to accomplish a task. However, designing a communication network among the UAVs is challenging task. In this article, we propose a centralized UAV placement strategy, where UAVs are used as flying access points forming a mesh network, providing connectivity to ground nodes deployed in a target area. The geographical placement of UAVs is optimized based on a Multi-Objective Evolutionary Algorithm (MOEA). The goal of the proposed scheme is to cover all ground nodes using a minimum number of UAVs, while maximizing the fulfillment of their data rate requirements. The UAVs can employ different data rates depending on the channel conditions, which are expressed by the Signal-to-Noise-Ratio (SNR). In this work, elitist Non-Dominated Sorting Genetic Algorithm II (NSGA-II) is used to find a set of optimal positions to place UAVs, given the positions of the ground nodes. We evaluate the trade-off between the number of UAVs used to cover the target area and the data rate requirement of the ground nodes. Simulation results show that the proposed algorithm can optimize the UAV placement given the requirement and the positions of the ground nodes in the geographical area.

The identification of linear dynamic systems with static nonlinearities in the delta domain has been presented in this paper applying a firefly based hybrid meta-heuristic algorithm integrating Firefly algorithm (FA) and Gray wolf optimizer (GWO). FA diversifies the search space globally while GWO intensifies the solutions through its local search abilities. A test system with continuous polynomial nonlinearities has been considered for hammerstein and wiener system identification in continuous, discrete and delta domain. Delta operator modelling unifies system identification of continuous-time systems with discrete domain at higher sampling frequency. Pseudo random binary sequence, contaminated with white noise, has been taken up as the input signal to estimate the unknown model parameters as well as static nonlinear coefficients. The hybrid algorithm not only outperforms the parent heuristics of which they are constituted but also proves better as compared to some standard and latest heuristic approaches reported in the literature.

Academic publishing appears to be the most important key of the academic functions (academic research, excellence in teaching and learning and community services). Selecting the right journal to publish research results is a challenge to academics. Yet, there is inadequate knowledge about a model specifically directed at the topic of the journal selection process with a mathematical certainty. The objectives of this research are: to identify the main factors that an author or researchers consider when selecting an academic journal for submitting a manuscript, and, to develop a mathematical algorithm of journal selection that provide the best journal choice with a mathematical certainty based on difficulty of each factor. Quantitative research through questionnaires has been applied as an appropriate instrument base to address the researcher’s identification of the factors that should be considered when selecting a journal. Questionnaire developed and emailed to academics in 31 public and private universities in the developing countries. Academics reported that the most important publication difficulty factors were publishing in reputable journals, and publishing in a journal that has an impact factor. However, the most least publication difficulty factors were found to be: number of issues per year and if the journal is an open access. The proposed mathematical algorithm of journal’s publication difficulty factors was developed and tested.

Nowadays, we live in a world in which people are facing with a lot of data that should be stored or displayed. One of the key methods to control and manage this data refers to grouping and classifying them in clusters. Today, clustering has a critical role in information retrieval methods for organizing large collections inside a few significant clusters. One of the main motivations for the use of clustering is to determine and reveal the hidden and inherent structure of a set of data. Ensemble clustering algorithms combine multiple clustering algorithms to finally reach an overall clustering system. Ensemble clustering methods by lack of information fusing utilize several primary partitions of data to find better ways. Since various clustering algorithms look at the different data points, they can produce various partitions from such data. It is possible to create a partition with high performance by combining the partitions obtained from different algorithms, even if the clusters to be very dense from each other. Most studies in this area have examined all the initial clusters. In this study, a new method is used in which the most sustainable clusters are utilized instead of all primary produced clusters. Consensus function based on co-association matrixes used to select more stable clusters. The most stable clusters selection method is done by cluster stability criterion based on F-measure. Optimization functions are used to optimize the obtained final clusters. The genetic algorithm is the optimizer used in this article to find the ultimate clusters participated in a consensus. Experimental results on several datasets show that the output of proposed method is various clusters with high stability.

Variational mode decomposition (VMD) is a recently introduced adaptive signal decomposition algorithm with a solid theoretical foundation and good noise robustness compared with empirical mode decomposition (EMD). There is a lot of background noise in the vibration signal of diesel engine. To solve the problem, a denoising algorithm based on VMD and Euclidean Distance is proposed. Firstly, a multi-component, non-Gauss, and noisy simulation signal is established, and decomposed into a given number K of band-limited intrinsic mode functions by VMD. Then the Euclidean distance between the probability density function of each mode and that of the simulation signal are calculated. The signal is reconstructed using the relevant modes, which are selected on the basis of noticeable similarities between the probability density function of the simulation signal and that of each mode. Finally, the vibration signals of diesel engine connecting rod bearing faults are analyzed by the proposed method. The results show that compared with other denoising algorithms, the proposed method has better denoising effect, and the fault characteristics of vibration signals of diesel engine connecting rod bearings can be effectively enhanced.