The definition of UTC in 1972 balanced the needs of the time and frequency community for a universal time scale that was traceable to the definition of frequency in the SI system of units with the needs of the astronomical community for a time scale that was closely linked to UT1, a time scale related to the rotation of Earth. The balance between these two considerations has changed very significantly since 1972, and there is widespread agreement that the method of relating UTC to UT1 should be changed by increasing the maximum tolerance between the two scales to more than the current limit of 0.9 s. I propose to realize this decision by means of an algorithmic adjustment process based on the variation in the length of the day over the previous centuries. I use these historical data to extrapolate the length of the day for a century into the future, and to compute a periodic rate adjustment to UTC based on this extrapolation. The adjustment process will not use time steps. The magnitude of the periodic rate adjustment will be re-considered every century, but the basic adjustment algorithm will not change. I suggest a maximum tolerance between UT1 and UTC that is large enough to absorb the irregular and unpredictable variations in the length of the day with respect to the long-term average increase in this value but plays no role in determining the parameters of the adjustment process that is proposed. I also propose that the adjustment be implemented at 12 UTC on 1 January since that is closest to a universal holiday in all time zones.

In the design of real-world networks, researchers evaluate various structural parameters to assess vulnerability, including connectivity, toughness, and tenacity. Recently, the tightness metric has emerged as a potentially superior vulnerability measure, although many related theorems remain unknown due to its novelty. Harary graphs, known for their maximum connectivity, are an important class of graph models for network design. Prior work has evaluated the vulnerability of three types of Harary graphs using different parameters, but the tightness metric has not been thoroughly explored. This article aims to calculate the tightness values for all three types of Harary graphs. First, it will attempt to calculate the lower bound for the value of the tightness parameter in Harary graphs using existing lemmas and theorems. Then, by presenting new lemmas and theorems, we will try to find the exact value or upper bound for this parameter in Harary graphs. For the first type of Harary graph, the tightness is precisely determined, while for the second and third types, upper bounds are provided due to structural complexity. The lemmas, theorems, and proof methods presented in this research may be used to calculate other graph and network parameters. However, the newness of the tightness parameter means that further research is needed to fully characterize its properties.

MIMO (multiple-input multiple-output) radar provides much more flexibility than the traditional radar for its ability to realize far more observation channels than the actual number of T/R (transmit and receive) elements. Designing the array of MIMO imaging radar, the commonly used virtual array theory generally assumes that all elements are placed on the same line. However, due to the physical size of the antennas and coupling effect between T/R elements, a certain height difference between T/R arrays is essential, resulting in the defocusing of edge points of the scene. On the other hand, the virtual array theory implies far-field approximation, leading to inevitable high grating lobes in the imaging result of near-field edge points of the scene observed by common MIMO array. To tackle these problems, this paper derives the relationship between target’s PSF (point spread function) and pattern of T/R arrays, by which the design criterion of near-field imaging MIMO array is presented. Firstly, the proper height between T/R arrays is designed to focus the near-field edge points well. Secondly, the far-field array is modified to suppress the grating lobes in the near-field area. Finally, the validity of the proposed methods is verified by simulations and an experiment.

This paper integrates carrier manifolds from control theory and hybrid systems modeling to develop a novel mathematical framework for Artificial General Intelligence (AGI). Carrier manifolds represent the state space of complex AGI systems, while hybrid systems model discrete and continuous dynamics together. The proposed architecture embeds carrier manifold into GPTProX, a hybrid AI solver combining conversational AI, logic programming, and optimization.

This paper describes a polynomial time algorithm for solving graph isomorphism and automorphism. We introduce a new tree data structure called Walk Length Tree. We show that such tree can be both constructed and compared with another in polynomial time. We prove that graph isomorphism and automorphism can be solved in polynomial time using Walk Length Trees.

The relaxation process of lithium batteries caused by load variation is considered. It is shown that such processes have strong dependence on internal physical and chemical processes and battery technical conditions. Theoretical expressions of the relaxation process caused by a step-like load variation have been obtained for 1^st and 2^nd order equivalent electrical circuits. The experimental investigations show that the obtained models fit the real relaxation processes and the behavior of the identified parameters could be explained by specific features of physical and chemical processes within the lithium battery. It should be noted that the obtained results can be generalized for a different type of electrochemical power source. The proposed approach makes it possible to provide means for electrochemical power source characterization and diagnostic, the main advantages of which are good time localization of measurement procedures and inexpensive apparatus implementation.

This article systematically studied the A-optimal designs of a high-order mixture central polynomial model, which is an advancement of the research results for the A-optimal design of the most recent third-order mixture central polynomial model and a more accurate response surface model. This article is based on the simplex center design, obtaining measurement values at various design points, and verifying them through the A-optimal equivalence theorem. We also compare the A-efficiency of designs through examples, which can be applied to the A-optimal precise design of the fourth-order mixture model.

The independent set, IS, on a graph $G=(V,E)$ is $V^{*}\subseteq V$ such that no two vertices in $V^{*}$ have an edge between them. The MIS problem on G seeks to identify an IS with maximum cardinality, i.e. MIS. $V^{*}\subseteq V$ is a vertex cover, i.e. VC of $G=(V,E)$ if every $e\in E$ is incident upon at least one vertex in $V^{*}$ . $V^{*}\subseteq V$ is dominating set, DS, of $G=(V,E)$ if $\forall v\in V$ either $v\in V^{*}$ or $\exists u\in V^{*}$ and $(u,v)\in E$ . The MVC problem on G seeks to identify a vertex cover with minimum cardinality, i.e. MVC. Likewise, MCV seeks a connected vertex cover, i.e. VC which forms one component in G, with minimum cardinality, i.e. MCV. A connected DS, CDS, is a DS that forms a connected component in G. The problems MDS and MCD seek to identify a DS and a connected DS i.e. CDS respectively with minimum cardinalities. MIS, MVC, MDS, MCV and MCD on a general graph are known to be NP-complete. Polynomial time algorithms are known for bipartite graphs, chordal graphs, cycle graphs, comparability graphs, claw-free graphs, interval graphs and circular arc graphs for some of these problems. We introduce a novel graph class, layered graph, where each layer refers to a subgraph containing at most some k vertices. Inter layer edges are restricted to the vertices in adjacent layers. We show that if $k=\Theta (log\mid V\mid )$ then MIS, MVC and MDS can be computed in polynomial time and if $k=O\left({(log\mid V\mid )}^{\alpha }\right)$ , where $\alpha <1$ , then MCV and MCD can be computed in polynomial time. If $k=\Theta \left({(log\mid V\mid )}^{1+ϵ}\right)$ , for $ϵ>0$ , then MIS, MVC and MDS require quasi-polynomial time. If $k=\Theta (log\mid V\mid )$ then MCV, MCD require quasi-polynomial time. Layered graphs do have constraints such as bipartiteness, planarity and acyclicity.

This study aims to spatially analyze the distribution characteristics of vacant homes in Asan-si, Chungcheongnam-do, and understand the differences in factors causing vacant homes by type. We use a variety of statistical methods to examine these factors and identify key influencing factors such as the number of vacant stores, changes in overall population, land use complexity, and physical characteristics of land and buildings. The findings reveal that the factors contributing to the occurrence of vacant homes vary significantly by region and property type, highlighting the need for region-specific policies. For instance, in old town areas, small lot ratios and land use complexity are significant, while in rural village, the average number of floors and land use complexity play a major role. This study underscores the diversity of factors influencing vacant homes, suggesting that policies should be tailored to the unique characteristics of different regions to effectively address this issue.

This paper compares Demand Response algorithms suitable for Short-term Forecasting based on Advanced Metering Infrastructure (AMI). It selects ARIMA (AutoRegressive Integrated Moving Average), SARIMA (Seasonal ARIMA), LSTM (Long Short-Term Memory), and SVM (Support Vector Machine) as the primary research algorithms and delves into their theoretical foundations and functional characteristics. The theoretical background section explores each algorithm’s applicability in analyzing time-series data, recognizing nonlinear patterns, and solving optimization and classification problems. The methodology section will detail the methods of AMI data collection, the implementation of the algorithms, and the experimental setup. In the experiments and results section, the performance of each algorithm will be assessed by applying AMI data and presenting the outcomes of comparative analyses, with a focus on evaluating the predictive accuracy of the algorithms. The discussion will interpret the experimental results, analyzing the advantages and disadvantages of each algorithm and their applicability in the AMI system. It will also explore the limitations of the current research and directions for future research. The conclusion will summarize the key findings of the study and affirm how this research contributes to understanding and improving short-term forecasting and demand response systems based on AMI.

In this paper, we study the well-posedness and asymptotics of a one-dimensional thermoelastic laminated beam system either with or without structural damping, where the heat conduction is given by Fourier's law effective in the rotation angle displacements. We show that the system is well-posed by using Lumer-Philips theorem, and prove that the system is exponentially stable if and only if the wave speeds are equal, by using the perturbed energy method and Gearhart-Herbst-Prüss-Huang theorem. Furthermore, we show that the system with structural damping is polynomially stable provided that the wave speeds are not equal, by using the second-order energy method.

Local polynomial smoother (LPS) is a weighted local least-squares nonparametric method. It provides a local Taylor series fit of the data at any location and can be directly used in a differential equation to provide a numerical scheme. In this article, we introduce this new nonparametric idea based on local polynomial smoother, for acquiring the numerical solution of the Bagley-Torvik fractional-order differential equations. Furthermore, this paper will present a numerical comparison with some methods, such as legendre operational matrix and pseudo-spectral method. The efficiency and accuracy of the LPS method are demonstrated by two numerical examples.

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.

Condition monitoring is a crucial process for ensuring industrial assets' reliability and operational efficiency. In the age of the digital industry, AI-based data-driven condition monitoring is proving extremely effective in detecting potential issues before they escalate into major problems, thereby reducing downtime, minimizing maintenance costs, and extending the lifespan of the equipment. The availability of tools that can enable the operationalization of these data-driven solutions is, therefore, critical. In this direction, this work proposes a comprehensive, modular, and scalable pipeline covering all the steps from the data acquisition to the AI model training and inference phases. The tool integrates the data acquisition and processing steps with a configurable feature extraction phase. Moreover, the system also integrates deep learning algorithms for diagnosis and prognosis, including a domain adaptation stage to permit transfer learning and increase generalizability. In addition, it features a communication system using MQTT, which allows for an online data stream to enable real-time monitoring and maintenance. The overall infrastructure was deployed in actual industrial settings and tested in a real-time experiment, demonstrating the proposed approach's validity.

This paper presents a comprehensive comparative analysis of four different computational vision algorithms for implementing an unpalleting system in a factory environment, under typical edge computing constraints. The primary objective is to automate the process of detecting and locating specific variable-shaped objects on a pallet, enabling a robotic system to accurately unstack them. The four algorithms evaluated are Pattern Matching, Scale-Invariant Feature Transform, Oriented FAST and Rotated BRIEF, and Haar cascade classifiers. Each technique is described in detail in this paper, and their implementations are outlined. Experimental results are thoroughly analyzed, assessing the algorithms’ performance based on accuracy, robustness to variability, computational speed, detection sensitivity, and resource consumption. The findings reveal the strengths and limitations of each algorithm, providing valuable insights for selecting the most appropriate technique based on the specific requirements of the unpalleting system. This research contributes to the advancement of automated object detection and localization in industrial environments, paving the way for more efficient and reliable unpalleting systems.

The article presents the author’s works in the field of modifications and modeling of the PQC CSIDH algorithm on non-cyclic supersingular Edwards curves and its predecessor CRS scheme on ordinary non-cyclic Edwards curves are reviewed. Lower estimates of the computational speed gains of the modified algorithms over the original ones are obtained. The most significant results were obtained by choosing classes of non-cyclic Edwards curves connected as quadratic twist pairs instead of cyclic complete Edwards curves, as well as the method of algorithm randomization as an alternative to “constant time CSIDH.” It is shown that in the CSIDH and CSIKE algorithms, there are two independent cryptosystems with the possibility of parallel computation, eliminating the threat of side-channel attacks. For the CRS scheme, there are four such cryptosystems. Integral lower bound estimates of the performance gain of the modified CSIDH algorithm are obtained at 1.5 ∙ 29, and for the CRS scheme are 3 ∙ 29.

Quantum optimization is a significant area of quantum computing with anticipated near-term quantum advantages. Current quantum optimization algorithms, most of which are hybrid variational Hamiltonian-based algorithms, struggle on present quantum devices due to noise and decoherence. Existing techniques attempt to mitigate these issues through employing different Hamiltonian encodings or Hamiltonian clause pruning but often rely on optimistic assumptions rather than a deep analysis of the problem structure. We demonstrate how to formulate the problem Hamiltonian for the Quantum Approximate Optimization Algorithm to satisfy all the requirements that correctly describe the considered tactical aircraft deconfliction problem, achieving higher probabilities of measuring solutions compared to previous works. Our results indicate that constructing Hamiltonians from an unconventional, quantum-specific perspective with a high degree of entanglement results in linear number of entangleming gates instead of exponential and superior performance compared to standard formulations. Specifically, we achieve higher probabilities of measuring feasible solutions in 9 out of 9 instances compared to standard Hamiltonian formulations and surpass quadratic programming formulations known from quantum annealers in 7 out of 9 instances. These findings suggest that there is substantial potential for further research in quantum Hamiltonian design and that gate-based approaches may offer superior optimization performance over quantum annealers in the future.

For a graph G, let P(G, λ) be its chromatic polynomial. Two graphs G and H are said to be chromatically equivalent if P(G,λ) = P(H,λ). A graph is said to be chromatically unique if no other graph shares its chromatic polynomial. In this paper, chromatic polynomial of the necklace graph N_n, for n ≥ 2 has been determined. It is further shown that N₃ is chromatically unique.

There are several challenges on how to attain energy efficiency while maintaining balance among factors affecting energy consumption such as power rating and temperature setpoints of cooling units, room temperature and humidity, and indoor air quality (IAQ). A real-time energy and IAQ monitoring system were installed in an educational building to profile the operational power consumption of inverter-based air condition unit (ACU) installed in each room. Polynomial curve and neural fitting regression analysis were applied to the real-time power consumption, indoor temperature and humidity, and carbon dioxide (CO2) level data. The derived models were able to provide the stabilizing indoor thermal and air conditions of the room to reach steady state ACU power consumption. These collected data and calculated parameters can be used to define rules in automating control of cooling appliances for an efficient energy utilization. The regression approaches, using real-time data, have determined the influence of indoor heat conditions and carbon dioxide levels on ACU power consumption. These parameters were utilized to establish consistent values for temperature, humidity, and carbon dioxide levels under stable settings of inverter-based air conditioning units.

Due to the significant price difference, expensive oils like olive oil are often blended with cheaper edible oils. This practice of adulteration in edible oils, aimed at increasing profits for producers, poses a major concern for consumers. Furthermore, adulteration in edible oils can lead to various health issues impacting consumer well-being. In order to meet the requirements of fast, non-destructive, universal, accurate and reliable quality testing for edible oil, the oblique-incidence reflectivity difference (OIRD) method combined with machine learning algorithms was introduced to detect a variety of edible oils. The prediction accuracy of Gradient Boosting, K-Nearest Neighbor, and Random Forest models exceeded 95%. Experimental results indicate that the OIRD method can serve as a powerful tool for detecting edible oils.

Heart failure is a prevalent cardiovascular condition with significant health implications, necessitating effective diagnostic strategies for timely intervention. This study explores the potential of continuous monitoring of non-invasive signals, specifically integrating Photoplethysmogram (PPG) and Electrocardiogram (ECG), for enhancing early detection and diagnosis of heart failure. Leveraging a dataset from the MIMIC-III database, encompassing 682 heart failure patients and 954 controls. Feature selection techniques were used to systematically select key features which were identified for their clinical relevance and significance in capturing cardiovascular dynamics and to reduce computational complexity and to decrease the chance of overfitting the ML algorithms. These features are then utilized to train and evaluate machine learning algorithms, resulting in a model with an impressive accuracy of 98%, sensitivity of 97.60%, specificity of 96.90%, and precision of 97.20%. The integrated approach outperforms single-signal strategies, showcas-ng its potential for early, precise, and non-invasive heart failure diagnosis. Furthermore, the study underscores the significance of continuous monitoring through wearables, emphasizing the benefits of integrating multiple signals for a comprehensive evaluation of cardiovascular health. The proposed approach holds promise for implementation in hardware systems to enable continuous monitoring, aiding in early detection and prevention of critical health conditions.

This case report describes the successful repair of a radial bone fracture and skin defect in a dog using an ulnar bone graft and an advancement flap. A one-year-old spayed female Poodle dog weighing 1.7 kg was brought in with non-weight-bearing lameness, an open wound, and a frac-ture in the right forelimb. The dog had fallen off the bicycle being ridden by its owner, causing its right forelimb to be caught in the wheel. The treatment included surgical debridement of the necrotic tissue, skin reconstruction with an advancement flap, and radial bone reconstruction with an ulnar bone graft, bone morphogenetic protein (BMP), humeral cancellous bone and a ti-tanium T-shaped plate. Postoperative management included antibiotics, pain medication, and activity restriction. The dog made a good recovery and was able to bear weight on the affected limb four months after surgery.

The aim of this study was to assess the ability of multiscale sample entropy (MSE), refined composite multiscale entropy (RCMSE), and complexity index (CI) to characterize gait complexity through trunk acceleration patterns in subjects with Parkinson's disease (swPD) and healthy subjects, regardless of age or gait speed. The trunk acceleration patterns of 51 swPD and 50 HS were acquired using a lumbar-mounted magneto-inertial measurement unit during their walking. MSE, RCMSE, and CI were calculated on 2000 data points, using scale factors (τ) 1-6. Differences between swPD and HS were calculated at each τ, and the area under the receiver operating characteristics, optimal cutoff points, post-test probabilities, and diagnostic odds ratios were calculated. MSE in the antero-posterior direction at τ 4 and τ 5, and MSE in the ML direction at τ 4 outperformed the other entropy measures in terms of discriminative ability and characterized the gait of swPD with 79%, 82%, and 78% probabilities, respectively, and correlated with the motor disability, pelvic kinematics, and stance phase. Using a time series of 2000 data points, a scale factor of 4 or 5 in the MSE procedure can be considered as a marker of gait variability and complexity in swPD.

Planar differential systems whose angular velocity is constant are called rigid differential systems. We characterize the existence and non-existence of limit cycles, and the finite and infinite singularities of the rigid polynomial differential systems with homogeneous nonlinearities of arbitrary degree in the Poincaré disc. Moreover, we classify the phase portraits in the Poincaré disc of the rigid polynomial differential systems of degree two, and of one class of rigid polynomial differential systems with cubic homogeneous nonlinearitie that can exhibit one limit cycle.

In this paper, we introduce and investigate a new family of sequences called the generalized Fibospinomials (or the generalized Fibonacci polynomial spinors or Horadam polynomial spinors). Being particular cases, we handle with $(r,s)$-Fibonacci and $(r,s)$-Lucas polynomial spinors. After a short history on spinors and quaternions, we present Binet's formulas, generating functions and the summation formulas for these polynomials. In addition, we obtain some identities of generalized Fibonacci polynomial spinors, $(r,s)$-Fibonacci polynomial spinors and $(r,s)$-Lucas polynomial spinors. Moreover, we give some special identities such as Catalan's and Cassini's identities and we present matrices related with these polynomials.

Given a polynomial $P(x_{1}, x_{2}, \ldots, x_{n})$ which is the sum of terms, where each term is a product of two distinct variables, then the problem $APSS$ consists in calculating the total sum value of $\sum_{\forall U_{i}} P(u_{1}, u_{2}, \ldots, u_{n})$, for all the possible assignments $U_{i} = \{u_{1}, u_{2}, ... u_{n}\}$ to the variables such that $u_{j} \in \{0, 1\}$. $APSS$ is the abbreviation for the problem name Algebraic Polynomial Sum Solver Over $\{0, 1\}$. We show that $APSS$ is in $\#L$ and therefore, it is in $FP$ as well. The functional polynomial time solution was implemented with Scala in \url{https://github.com/frankvegadelgado/sat} using the DIMACS format for the formulas in $\textit{MONOTONE-2SAT}$.

In this article, we establish sharp trigonometric-polynomial bounds for unnormalized sinc function.

Abscisic acid (ABA) plays a major role in promoting ripening in sweet cherry, a non-climateric fruit. Exogenous application of ABA has been performed to study fruit ripening and cracking, but this growth regulator is not used for commercial production. To determine the potential of this growth regulator to improve sweet cherry fruit quality, ABA canopy spraying was assayed in four cultivars. Canopy spraying of S-ABA significantly: 1) enhanced sweet cherry fruit color in ‘Glenred’, ‘Lapins’ and 'Bing' cultivars, but not in ‘Royal Rainier’ (a bi-colored cultivar), and 2) decreased fruit size and firmness in ‘Lapins’, ‘Bing’ and ‘Royal Rainier’. Seasonally reproducible effects were seen in ‘Lapins’ (mid/late-maturing) but not in ‘Glenred’ (early-maturing). Canopy spraying of nordihydroguaiaretic acid (NDGA) decreased color and increased fruit size in ‘Lapins’, but not in ‘Glenred’. Direct application of ABA on fruits attached to the tree, without application to the foliage, increased Lapins' fruit color without reducing size. These results suggest a localized fruit response to exogenous ABA application on fruit color development, but that a decrease in fruit size may be due to the effects of exogenous ABA on the tree canopy foliage.

This study optimizes the placement and farm layout of Vertical Axis Wind Turbines (VAWTs) using a neural fuzzy network, an advanced machine learning system, and meta-heuristic algorithms. The methodology introduces a novel approach to enhance turbine efficiency and overall farm performance. The objective is to determine the optimal configuration of vertical axis wind turbines using a neural-fuzzy system and meta-heuristic optimizers. Turbine efficiency and power generation rates are assessed through three-dimensional numerical simulations based on the Reynolds-averaged Navier-Stokes equations. This innovative design, featuring straight blades with bevel-angle vortex generators, represents a significant advancement over traditional straight-blade VAWTs. Comparative analyses demonstrate that the oblique configuration exhibits higher average output moment and power. A novel concept integrates the strengths of Darrieus VAWTs, enhancing efficiency through vortex generator integration. Simulation results are validated with empirical data, confirming the superior aerodynamic efficiency and increased power generation of the oblique configuration. Inspired by the optimal group movements of birds, this study recommends adopting the oblique arrangement for improved wind turbine performance.

The climate crisis necessitates a global shift to achieve a secure, sustainable, and affordable energy system toward a green energy transition reaching climate neutrality by 2050. Because of this, renewable energy sources have come to the forefront and the research interest in microgrids which rely on distributed generation and storage systems has exploded. Furthermore, many new markets for energy trading, ancillary services, and frequency reserve markets have provided attractive investment opportunities in exchange for balancing the supply and demand of electricity. Artificial intelligence can be utilized to locally optimize energy consumption, trade energy with the main grid, and participate in these markets. Reinforcement learning (RL) is one of the most promising approaches to achieve this goal because it enables an agent to learn optimal behavior in a microgrid by executing specific actions that maximize the long-term reward signal/function. The study focuses on testing two optimization algorithms: logic-based optimization and reinforcement learning. This paper proposes an optimization algorithm based on reinforcement learning in an industrial microgrid that is capable of trading energy with the main grid, providing significant cost savings. The RL-based approach is implemented in Python based on real data from the site and in combination with MATLAB-Simulink to validate its results. The application of the RL algorithm achieved an average monthly cost saving of 20% compared to logic-based optimization and 86% savings compared to not using any optimization. These findings contribute to digitalization and decarbonization of energy technology and support fundamental goals and policies of the European Green Deal.

Mutual exclusion algorithms are at the heart of concurrent, distributed/parallel, real-time and operating systems. It is well-known that such algorithms are very difficult to analyze and in the literature different conjectures about starvation-freedom and the number of by-passes (also said the overtaking factor), which in turn affects the (hopefully) bounded waiting time that a process competing for entering the critical section has to suffer before accessing the shared resource, have been formulated for specific algorithms. This paper proposes a novel modelling approach based on Timed Automata and the Uppaal toolset, which proves effective for studying all the properties of a mutual exclusion algorithm for N≥2 processes, by exhaustive model checking. Although the approach, as already confirmed by similar experiments reported in the literature, is not scalable due to state explosion problems, and can be practically applied until N≤5, it is of great value for revealing true properties of analyzed algorithms. For dimensions N>5 the statistical model checker of Uppaal can be used which, although based on simulations, can confirm properties by estimations and probabilities. The paper describes the proposed modelling and verification method and applies it to several mutual exclusion algorithms, thus retrieving known properties but also showing new results about properties often studied only by peer-review and intuitive reasoning.

Abstract: This article advances the discourse on sustainable and energy-efficient software by examining the performance and energy efficiency of intelligent algorithms within the framework of green and sustainable computing. Building on previous research, it explores the theoretical implications of Bremermann's Limit on efforts to enhance computer performance through more extensive methods. The study presents an empirical investigation into heuristic methods for search and optimisation, demonstrating the energy efficiency of various algorithms in both simple and complex tasks. It also identifies key factors influencing the energy consumption of algorithms and their potential impact on computational processes. Furthermore, the article discusses cognitive concepts and their interplay with computational intelligence, highlighting the role of cognition in the evolution of intelligent algorithms. The conclusion offers insights into the future directions of research in this area, emphasising the need for continued exploration of energy-efficient computing methodologies.

Log collection and storage is a crucial process for enterprises around the globe. Log analysis helps identify potential security breaches and, in some cases, is required by law for compliance. However, enterprises often delegate these responsibilities to third-party Cloud Service Providers (CSPs), where the logs are collected and processed for anomaly detection and stored in a data warehouse for archiving. Prevalent schemes rely on plain (unencrypted) data for anomaly detection. More often, these logs can reveal sensitive information about an organization or the customers of that organization. Hence, it is best to keep it encrypted at all times. This paper presents "SigML++," an extension of work done in "SigML." We utilize Fully Homomorphic Encryption (FHE) with the Cheon-Kim-Kim-Song (CKKS) scheme for supervised log anomaly detection on encrypted data. We use an Artificial Neural Network (ANN) based probabilistic polynomial approximations using a Perceptron with linear activation. We probabilistically approximate the Sigmoid activation function (σ(x)) in the encrypted domain for the intervals [−10,10] and [−50,50]. Experiments show better approximations for Logistic Regression (LR) and Support Vector Machine (SVM) for low-order polynomials.

A method for noise reduction of spectra based on the adaptive application of the Savitsky-Golay polynomial filter is presented. A polynomial approximation is calculated at all points of the spectrum and for all window sizes. The weighted sum of all polynomials containing the point to be processed is used as the result. The weighting factors are calculated by evaluating the quality of the fit. This paper proposes two evaluation functions. The performance of the presented method is compared with the Savitsky-Golay method and the wavelet noise reduction method. The proposed approach provides good noise reduction performance without using user-entered parameters.

Analysis of land use/land cover (LULC) in the catchment areas is the first action toward safeguarding the freshwater resources. The LULC information in the watershed has gained popularity in the natural science field as it helps water resource managers and environmental health specialists develop natural resource conservation strategies based on available quantitative information. Thus, remote sensing is the cornerstone in addressing environmental-related issues at the catchment level. In this study, the performance of four machine learning algorithms (MLAs), such as Random Forests (RF), Support Vector Machine (SVM), Artificial Neural Networks (ANN), and Naïve Bayes (NB) was investigated to classify the catchment into nine relevant classes of the undulating watershed landscape using Landsat 8 Operational Land Imager (L8-OLI) imagery. The assessment of the MLAs were based on the visual inspection of the analyst and the commonly used assessment metrics, such as user’s accuracy (UA), producers’ accuracy (PA), overall accuracy (OA), and kappa coefficient. The MLAs produced good results, where RF (OA= 97.02%, Kappa= 0.96), SVM (OA= 89.74 %, Kappa= 0.88), ANN (OA= 87%, Kappa= 0.86), and NB (OA= 68.64 Kappa= 0.58). The results show the outstanding performance of the RF model over SVM and ANN with a small margin. While NB yielded satisfactory results, which could be primarily influenced by its sensitivity to limited training samples. In contrast, the robust performance of RF could be due to an ability to classify high-dimensional data with limited training data.

Health management in industrial systems is more critical in maintenance management and it plays an important role in productivity, fault diagnosis, safety, efficiency, and economy in manufacturing industries. Early detection of faults in machinery may increase the effectiveness of maintenance actions and will avoid unwanted consequences in process operations and maintenance. Existing fault diagnosis methods have limitations such as insufficient accuracy, slow detection rate, and handling large and complex data sets. In this digital age, Industry 4.0 techniques have been applied across all fields, including the condition monitoring of machines. This research addresses the gaps in traditional fault diagnosis by using deep learning, a modern AI technique effective for diagnosing faults in various machines. Deep learning algorithms Multilayer Perceptron (MLP), Coevolutionary Neural Network (CNN), and Recurrent Neural Network (RNN) with Long Short-Term Memory (LSTM) are tested for fault diagnosis using vibration datasets collected from Spectra Quest Machinery Fault Simulator (SQMFS). In this research work, NI-DAQ (National Instruments- Data Acquisition) system, accelerometer, and LabVIEW software are used to collect vibration signals. Preprocessing of the signals has been done using a sampling strategy, shuffling, standardization, and reshaping data augmentation. The result shows that MLP accuracy in the prediction of fault is 0.9, CNN reached 0.95, and RNN and LSTM with 0.57 and 0.45 respectively. The high performance of CNN is due to its ability to effectively capture spatial patterns in vibration data which is crucial for fault diagnosis in rotating machinery followed by MLP due to its faster convergence during training. However, when scaling the data, MLP outperformed CNN, demonstrating superior adaptability to increased data complexity and volume. Due to the need for larger datasets and temporal patterns in the vibration data, which RNN and LSTM are designed to handle, they resulted in a lower accuracy. This study shows that CNN has given better results than other deep learning algorithms MLP, RNN, and LSTM in fault diagnosis of rotating machinery. Future research could explore the application of these techniques to different types of machinery and fault conditions.

Cervical Cancer affects a large part of female population that makes the prediction of this disease based on Machine Learning (ML) by outmost importance. ML algorithms can be integrated in complex intelligent agent-based systems that can offer decision support to the resident medical doctors or even to experienced medical doctors. For instance can be mentioned the situation when an experienced medical doctor diagnose a case but he/she needs expertise support that is related to another medical specialty. Data imbalance is frequent in healthcare data and has a negative influencing effect in making predictions using ML algorithms. Cancer data generally and cervical cancer data particularly are frequently imbalanced. Based on this fact the study of data imbalance impact on diverse state-of-the-art ML prediction algorithms is important. This research subject is also motivated by the fact that in many research are presented experimental evaluations of algorithms without characterization of the data on that they have been applied. Such characterizations could give clear indication to other researchers regarding the applicability of the algorithms on their specific data. Specifically, if the data have the respective characteristics than are expectable the same performance evaluation results like those in the reported research. For the study we chosed a messy real-life Cervical Cancer dataset available in a recognized data repository included a large amount of missing and noisy values. To identify the best imbalanced technique for this medical dataset, it is compared the performance of eleven important resampling methods combined with the following state-of-the-art ML models: K-Nearest Neighbours (with k values of 2 and 3), binary Logistic Regression, and Random Forest, that are frequently applied in prediction types of researches in healthcare. The studied resampling methods includes seven undersampling methods namely Condensed Nearest Neighbour, Tomek Links, Edited Nearest Neighbours, Repeated Edited Nearest Neighbours, All K-Nearest Neighbours, NearMiss, Neighbourhood Cleaning Rule, and Instance Hardness Threshold, and four oversampling methods namely Synthetic Minority Oversampling Technique (SMOTE), Adaptive Synthetic Sampling Approach for Imbalanced Learning SMOTE, Support Vector Machine SMOTE and Borderline SMOTE. In the case of the dataset for the confidence interval with 95% confidence level was between 9.23 and 16.22, while the imbalance ratio is 12.73. The obtained results show that resampling methods help the learning models to improve the classification ability of cervical cancer. The applied oversampling techniques generally showed better results than undersampling methods. In the case of Logistic Regression classifier had the highest impact on balanced techniques, while Random Forest had promising performance, even before balancing techniques and KNN2 was generally better than KNN3.

We consider the financial planning problem of a retiree wishing to enter a retirement village at a future uncertain date. The date of entry is determined by the retiree's utility and bequest maximisation problem within the context of uncertain future health states. In addition, the retiree must choose optimal consumption, investment, bequest and purchase of insurance products prior to her full annuitisation on entry to the retirement village. A hyperbolic absolute risk-aversion (HARA) utility function is used to allow necessary consumption for basic living and medical costs. The retirement village will typically require an initial deposit upon entry. This threshold wealth requirement leads to exercising the replication of an American put option at the uncertain stopping time. From our numerical results, active insurance and annuity markets are shown to be a critical aspect in retirement planning.

This paper presents a methodology based on deep learning models and metaheuristic algorithms for the optimization of airfoils for the design of aircraft wings with large endurance. The use of AZTLI-NN (a neural network with an architecture composed of a multilayer perceptron and a variational autoencoder) is implemented for the prediction of graphs of the aerodynamic coefficients of the airfoil as a function of the angle of attack. This neural network presents good predictions of the aerodynamic coefficients, similar to the coefficients obtained with computational fluid dynamics simulations. AZTLI-NN in combination of metaheuristic algorithms and the CST profile parameterization method show excellent performance in single-objective and multi-objective profile optimization tasks.

The cultural transmissions of a society like famous paintings, popular music, good poetry, and enduring religious rituals/doctrines/texts serve as mediums for the embodiment of algorithms that interact with the mind and body in looping, mostly unconscious interactions that are mutually beneficial to the participants of the society and the algorithms themselves. Useful algorithms are also found in the mind and bodies of other people, and individuals in a group can be used to outsource specialized tasks to benefit the society as a whole. Since useful algorithms must be embodied in a medium to work, there are physical limitations to the computations that can be performed in our universe.

The success of near-infrared spectroscopy (NIRS) analysis hinges on the precision and robustness of the calibration model. Shallow learning (SL) algorithms like partial least squares discriminant analysis (PLS-DA) often fall short in capturing interrelationships between adjacent spectral variables, and the analysis results are easily affected by spectral noise, which dramatically limits the breadth and depth application of NIRS. Deep learning (DL) methods, with their capacity to discern intricate features from limited samples, are progressively integrated into NIRS. In this paper, two discriminant analysis problems including wheat kernels and Yali pears were used as examples, and several representative calibration models to research the robustness and effectiveness of the model. Additionally, this article proposed a near-infrared calibration model, which is based on gramian angular difference field and coordinate attention convolutional neural networks (G-CACNN). The research results show that, compared with SL, spectral preprocessing has a smaller impact on the analysis accuracy of consensus learning (CL) and DL, and the latter has the highest analysis accuracy in the modeling results of using the original spectrum. The accuracy of G-CACNN in two discrimination tasks is 98.48% and 99.39%, respectively. Finally, This research compared the performance of various models under noise to evaluate the robustness and noise resistance of the proposed method.

In modern times, technology has become more than just a tool; it is a vital component of our lives, driving society and humanity towards new horizons, better living standards, and solu-tions for complex, global challenges. This article explores the world of dependable systems, specifically focusing on system design, software solutions, and architectural decisions that fa-cilitate collaborative work. It aims to dive into the intricacies of designing robust and effective document collaboration software. Throughout this paper, readers will gain insights into the proposed design process, enabling them to understand, learn from, and critically evaluate the examined methodologies and outcomes. Like everything else in the software technology field, there are multiple solutions to any given problem, and this work is no exception to this rule. The objective of this study is to provide a detailed architectural overview of the microservices pattern in an orchestrated cloud environment based on independent containers. To examine the pros and cons of such a system, the paper will detail how a real-time document collaboration system can benefit from such an architecture regarding availability, elasticity, scaling, and disaster recovery. Moreover, the paper will analyze how cloud-native technologies can be used to create a scalable platform solution, capable of handling traffic, dynamic resource storage, asynchronous com-munication, and application scaling. The intricate nature of this system renders this paper a valuable resource for prospective investigations within the domain of dependable systems, cloud computing, and distributed systems. This paper not only showcases the design and implementation process but also sets a founda-tion for future research and innovation in dependable systems, collaborative technologies, sustainable solutions, and distributed system architecture.

Aiming at the problems of inaccurate segmentation of long object and information loss of small object in real-time semantic segmentation algorithm, this paper proposes a lightweight multi-branch real-time semantic segmentation network based on BiseNetV2. The new auxiliary branch makes full use of spatial details and context information to cover the long object in the field of view. Meanwhile, in order to ensure the inference speed of the model, the asymmetric convolution is used in each stage of the auxiliary branch to design a structure with low computational complexity. In the multi-branch fusion stage, the alignment and fusion module is designed to provide guidance information for deep and shallow feature mapping, so as to make up for the problem of feature misalignment in the fusion of information at different scales, and thus reduce the loss of small target information. In order to further improve the model’s awareness of key information, a global context module is designed to capture the most important features in the input data. The proposed network uses NVIDIA GeForce RTX 3080 Laptop GPU experiment, on the road street view data set Cityscapes and CamVid average occurring simultaneously ratio reached 77.1% and 78.4% respectively, with running speed of 127 frames/s respectively and 112 frames/s. The experimental results show that the proposed algorithm can achieve real-time segmentation and improve the accuracy significantly, showing good semantic segmentation performance

With the development of Global Navigation Satellite Systems (GNSS), the quality and anti-jamming capability of satellite navigation signals are crucial. Binary Offset Carrier (BOC) modulation faces issues of false locking due to multi-peak ambiguity in its autocorrelation function, limiting its application. This paper examines FH-BOC modulation, which integrates BOC with frequency hopping technology, significantly improving anti-jamming, anti-multipath performance, and spectral efficiency. To meet the high dynamic tracking demands of FH-BOC signals, this study explores three types of carrier tracking loops: the traditional second-order frequency-locked loop assisted a third-order phase-locked loop, a linear Kalman filter-based tracking algorithm, and an adaptive Kalman filter-based tracking algorithm. A composite code tracking loop is also proposed. Simulations show that the adaptive Kalman filter algorithm achieves high-precision carrier tracking in dynamic environments and quickly converges during transitions. The composite code tracking loop, aided by the carrier loop, ensures precise synchronization of pseudocode and frequency-hopping subcarrier phases, demonstrating the superior performance of FH-BOC modulation in dynamic environments.

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.

The standard approach to integrable nonlinear evolution equations (NLEE) usually uses the following steps: 1) Lax representation $[L,M]=0$; 2)~construction of fundamental analytic solutions (FAS); 3) reducing the inverse scattering problem (ISP) to a Riemann-Hilbert problem (RHP) $\xi^+(x,t,\lambda) =\xi^-(x,t,\lambda) G(x,t\lambda)$ on a contour $\Gamma$ with sewing function $G(x,t,\lambda)$; 4) soliton solutions and possible applications.Step 1) involves several assumptions: the choice of the Lie algebra $\mathfrak{g}$ underlying $L$, as well as its dependence on the spectral parameter, typically linear or quadratic in $\lambda$. In the present paper we propose another approach which substantially extends the classes of integrable NLEE.Its first advantage is that one can effectively use any polynomial dependence in both $L$ and $M$. We use the following steps: A) Start with canonically normalized RHP with predefined contour $\Gamma$; B) Specify the $x$ and $t$ dependence of the sewing function defined on $\Gamma$; C) Introduce convenient parametrization for the solutions $ \xi^\pm(x,t,\lambda)$ of the RHP and formulate the Lax pair and the nonlinear evolution equations (NLEE); D) use Zakharov-Shabat dressing method to derive their soliton solutions. This needs correctly taking into account the symmetries of the RHP. E) Define the resolvent of the Lax operator and use it analyze its spectral properties.

The paper examines common elements between Lévai’s and Milson’s potentials obtained by Liouville transformations of two rational canonical Sturm-Liouville equations (RCSLEs) with even density functions which are exactly solvable via Jacobi polynomials in a real or accordingly imaginary argument. We refer to the polynomial numerators of the given rational density function as ‘tangent polynomial’ (TP) and thereby term the aforementioned potentials as ‘e-TP’ A special attention is given to the overlap between the two potentials along symmetric curves which represent two different forms of the Ginocchio potential exactly quantized via Gegenbauer and Masjed-Jamei polynomials respectively. Our analysis reveals that the actual interconnection between Lévai’s parameters for these two rational realizations of the Ginocchio potential is much more complicated than one could expect based on the striking resemblance between two quartic equations derived by Lévai for ‘averaged’ Jacobi indexes.

The primary purpose of this article is to study the asymptotic and numerical estimates in detail for higher degree polynomials in $\pi(x)$ having a general expression of the form, \begin{align*} P(\pi(x)) - \frac{e x}{\log x} Q(\pi(x/e)) + R(x) \end{align*} $P$, $Q$ and $R$ are arbitrarily chosen polynomials and $\pi(x)$ denotes the \textit{Prime Counting Function}. The proofs require specific order estimates involving $\pi(x)$ and the \textit{Second Chebyshev Function} $\psi(x)$, as well as the famous \textit{Prime Number Theorem} in addition to certain meromorphic properties of the \textit{Riemann Zeta Function} $\zeta(s)$ and results regarding its non-trivial zeros. A few generalizations of these concepts have also been discussed in detail towards the later stages of the paper, along with citing some important applications.

This article describes an algorithm for generating fractals using polar coordinates. The classic Julie and Mandelbrot polynomial iteration applied to a complex number is replaced by a separate iteration for distance and angle. By varying the polynomial parameters of the iteration functions, a wide range of attractive images can be created. Distance and angle values ​​are used to colorize fractal images.

Advances in early detection of Breast cancer and treatment improvements have significant-ly increased survival rates. Traditional screening methods, including mammography, MRI, ultrasound, and biopsies, while effective, often come with high costs and risks. Recently, thermal imaging has gained attention due to its minimal risks compared to mammography, although it is not widely adopted as a primary detection tool since it depends on identifying skin temperature changes and lesions. The advent of machine learning (ML) and deep learning (DL) has enhanced the effectiveness of breast cancer detection and diagnosis using this technology. In this study a novel methodology for developing an interpretable computer-aided diagnosis (CAD) system for breast cancer detection, leveraging explaina-ble Artificial Intelligence (XAI) throughout its various phases. To achieve these goals, we proposed a new multi-objective optimization approach named Hybrid Particle Swarm Optimization algorithm (HPSO) and Hybrid spider Monkey Optimization algorithm (HSMO). These algorithms simultaneously combine the continuous and binary representations of PSO and SMO to effectively manage trade-offs between Accuracy, feature selection and hyperparameter tuning. We evaluate several CAD models and investigate the impact of handcrafted methods such as Local Binary Patterns (LBP), Histogram of Oriented Gradients (HOG), Gabor filters, and edge detection. We further shedding light on the effect of feature selection and optimization on feature attribution and model decision-making processes using the SHapley Additive exPlanations (SHAP) framework, with a particular emphasis on cancer classification using the DMR-IR dataset. The results of our experiments demonstrate in all trials that the performance of the model is improved. Also with HSMO our models achieved a high accuracy of 98.27% and F1- score of 98.15% while selecting only 25.78% of the HOG features. This approach not only boosts the performance of CAD models but also ensures comprehensive interpretability. This method emerges as a promising and transparent tool for early breast cancer diagnosis.

The optimization of photovoltaic (PV) systems is vital for enhancing efficiency and economic viability, especially under Partial Shading Conditions (PSCs). This study focuses on the development and comparison of traditional and advanced algorithms, including Perturb and Observe (P&O), Incremental Conductance (IC), Fuzzy Logic Control (FLC), Grey Wolf Optimization (GWO), Particle Swarm Optimization (PSO), and Artificial Neural Networks (ANN), for efficient Maximum Power Point Tracking (MPPT). Simulations conducted in MATLAB/SIMULINK evaluated these algorithms’ performance under various shading scenarios. The results indicate that while traditional methods like P&O and IC are effective under uniform conditions, advanced techniques, particularly ANN-based MPPT, exhibit superior efficiency and faster convergence under PSCs. The study concludes that integrating AI and ML into MPPT algorithms significantly enhances the reliability and efficiency of PV systems, paving the way for broader adoption of solar energy technologies in diverse environmental conditions. These findings contribute to advancing renewable energy technology and support the green energy transition.

This study explores novel techniques to improve the detection accuracy of skarn iron deposits using advanced image processing methodologies. Leveraging the capabilities of Aster image, Band Ratio (BR) images, and Principal Component Analysis (PCA), alongside the power of 3D Convolutional Neural Networks (3D-CNN), the research aims to enhance the precision and efficiency of ore detection in complex geological environments. The proposed method employs a specific 3D-CNN architecture, accepting input as a 7×7×C image patch, where C represents the combined number of selected Aster image bands, Principal Component (PC) bands, and computed BR images. To evaluate the accuracy of the proposed method, five distinct image bands combinations, including the proposed bands combination, were tested and evaluated based on the overall accuracy (OA), average accuracy (AA), and kappa coefficient. The results demonstrated that while the incorporation of BR images alongside Aster bands initially seemed promising, it introduced significant confusion in certain classifications, leading to unexpected mis-classification rates. Surprisingly, utilizing solely Aster bands as input parameters yielded higher accuracy rates (OA= 93.13%, AA = 91.96%, Kappa = 90.91%) compared to scenarios involving the integration with band ratios (OA = 87.02%, AA = 79.15, and Kappa = 82.60%) or the integration of BR images to PC bands (OA= 87.78%, AA = 82.39%, Kappa = 83.81%). However, the amalgamation of Aster bands with selected PC bands showed slight improvements in accuracy (OA= 94.65%, AA = 92.93%, Kappa = 93.45%), although challenges in accurately classifying certain features persisted. Ultimately, the proposed combination of Aster bands, PC bands, and BR images (proposed bands combination) presented the most visually appealing and statistically accurate results (OA = 96.95%, AA= 94.87%, and Kappa = 95.93%), effectively addressing misclassifications observed in the other combinations. These findings underscore the synergistic contributions of each of the Aster bands, PC bands, and BR images, with Aster bands proving pivotal for optimal skarn classification, PC bands enhancing intrusions classification accuracy, and BR images strengthening wall rock classification accuracy. In conclusion, the proposed combination of input image bands emerges as a robust and comprehensive methodology, demonstrating unparalleled accuracy in the remote sensing detection of skarn iron minerals.

Electric vehicles (EVs) are pivotal in addressing the escalating environmental crisis. While EV drivetrains excel compared to those of vehicles with internal combustion engines (ICE), their energy storage systems are hampered by limited range, lifespan, and lengthy charging times. Hybrid energy storage systems (HESS) present a viable current solution to these issues. This review thoroughly explores state-of-the-art in the emerging field of multisource EVs that utilize HESS, incorporating any combination of batteries (BTs), supercapacitors (SCs), flywheels (FWs), fuel cells (FCs), and/or transmotors. In addition, the paper systematically categorizes and evaluates different hybrid configurations, detailing potential topologies and their respective advantages and limitations. Moreover, the paper examines diverse control algorithms used to manage these complex systems, focusing on their effectiveness and operational efficiency. By identifying current research gaps and technological challenges, this study aims to delineate future research directions that could enhance the deployment and optimization of multisource EVs, thereby addressing critical challenges such as energy density, system reliability, and cost-effectiveness.

The development of Artificial Intelligence-based tools is having a big impact on industry. In this context, the maintenance operations of important assets and industrial resources are deeply changing both from a theoretical and a practical perspective, even in the field of ship propulsion systems. Namely, conventional preventive maintenance schedules audits and checks at fixed times by using statistics on component failures, but it can be improved by a predictive maintenance based on the real component health status, which is inspected by proper sensors. In this way, time and costs are saved. More in details, data-driven models, through Machine Learning (ML) algorithms, generate the expected values of monitored variables for comparison with real measurements coming from the asset, hence for a diagnosis based on the difference between expectations and observations. Then, a ML-based fault detection starts with the choice of the ML algorithm. This process is often not the consequence of an in-depth deep analysis of the different algorithms available in the literature. For that reason, the authors propose a simple procedure to support a first implementation stage of the so-called Condition Based Maintenance (CBM): a quick benchmarking of the most suitable ML algorithms useful for fault detection. The algorithms are compared by taking into account not only the algorithm output error, shown by the Mean Squared Error between predictions and data, but also the response time, which is a crucial variable for maintenance purpose.

Vertical Indoor Farming (VIF) with hydroponics offers a promising perspective for sustainable food production. Intelligent control of VIF system components plays a key role in reducing operating costs and increasing crop yields. Modern machine vision (MV) systems use Deep Learning (DL) in combination with camera systems for various tasks in agriculture, such as disease and nutrient deficiency detection, and flower and fruit identification and classification for pollination and harvesting. This study presents the applicability of MV technology with DL modelling to detect the growth stages of chilli plants using YOLOv8 networks. The influence of different bird’s eye and side view datasets and different YOLOv8 architectures was analysed. To generate the image data for training and testing the YOLO models, chilli plants were grown in a hydroponic environment and imaged throughout their life cycle using four camera systems. The growth stages were divided into growing, flowering and fruiting classes. All trained YOLOv8 models showed reliable identification of growth stages with high accuracy. The results indicate that models trained with data from both views show better generalisation. YOLO’s middle architecture achieved the best performance.

We present a general process for the halting problem, valid regardless of the time and space computational complexity of the decision problem. It can be interpreted as the maximization of entropy for the utility function of a given Shannon-Kolmogorov-Bernoulli process. Applications to non-polynomials problems are given. The new interpretation of information rate proposed in this work is a method that models the solution space boundaries of any decision problem (and non polynomial problems in general) as a communication channel by means of Information Theory. We described a sort method that order objects using the intrinsic information content distribution for the elements of a constrained solution space - modeled as messages transmitted through any communication systems. The limits of the search space are defined by the Kolmogorov-Chaitin complexity of the sequences encoded as Shannon-Bernoulli strings. We conclude with a discussion about the implications for general decision problems in Turing machines.

Temporomandibular disorders (TMDs) refer to a group of conditions that affect the temporomandibular joint, causing pain and dysfunction in the jaw joint and related muscles. The diagnosis of TMDs typically involved clinical assessment through operator-based physical examination, self-reported questionnaire and imaging studies. To objectivize the measurement of TMD, this study aims at investigating on the feasibility to use machine-learning algorithms fed with data gathered from low-cost and portable instruments to discriminate the presence of TMD in adult subjects. Through this aim, the experimental protocol involved fifty participants, equally distributed between TMD and healthy subjects, acting as control group. The diagnosis of TMD has been performed by a skilled operator through the typical clinical scale. Participants underwent to a baropodometric analysis by using a pressure matrix and the evaluation of the cervical mobility through inertial sensors. Nine machine-learning algorithms belonging to support vector machine, k-nearest neighbours and decision tree were compared. The k-nearest neighbours based on cosine distance was found as the best performing, achieving performance of 0.94, 0.94 and 0.08 for the accuracy, F1-score and G-index, respectively. These findings open the possibility to use such methodology to support the diagnosis of TMDs in clinical environments.

Due to related uncertainties brought by changes in energy consumption and the integration of rooftop photovoltaic systems, the accuracy and availability of load profiling data are difficult to achieve. However, project managers and planners use a precise load profile as a crucial tool when determining whether the feeder must be updated or de-loaded. The paper aims to create a non-intrusive monitoring system that predicts the synthetic load profiles behavior of energy consumption using a Light Gradient Boosted and Support Vector Machine (SVM) machine learning technique. The most effective ML algorithm is chosen, and it has the potential to be assessed and verified using validation curves, residuals model generation, and prediction error metrics based on the following key statistical indicators: Mean Absolute Error, Mean Square Error, Root Mean Square Error, R-Square, Root Mean Squared Logarithmic Error, and Mean Absolute Percentage Error. The most effective ML has the potential to be assessed and verified using validation curves, residual model generation, and prediction error metrics based on the following key statistical indicators. The result shows that the estimation of the Irms avg -based on LightGBM is more accurate than the SVM because of its quick, economical, and difficult to overfit, particularly with high-dimensional data, speed, and efficiency of the MAE (3.0698), MSE (15.2757), RMSE (3.9020), RMSLE (0.1433), and MAPE (0.0049) respectively. Additionally, the machine learning model shows that, when compared to the SVM, the LightGBM model had the highest accurate prediction, with R-Square values of 89.8%, 90.3%, and 88.5% for Irms_A_avg, Irms_B_avg, and Irms_C_avg, respectively for Brakfontein Substation supply region, and best represents a diverse customer base.

In my paper, a divisibility rule named the Queen function is de- scribed, which has been generalized for every integer and encompasses all pre- viously established divisibility rules. Subsequently, the paper discusses other areas where this function is instrumental. These include simplifying ratios, generating prime numbers, and more. Towards the end of the paper, a set of hypotheses is also presented. Among these, the most significant is the novel approach involving the application of the Queen function for prime number generation.

Polynomial recurrence bounds for a class of stochastic differential equations with a gradient type drift and an additive Wiener process are studied without Lyapunov functions.

This paper discusses a passive control issue for Nonlinear Time-Varying (NTV) systems subject to stability and attenuation performance. Based on the modeling approaches of Takagi-Sugeno (T-S) fuzzy model and the Linear Parameter-Varying (LPV) model, a Parameter-Dependent Polynomial Fuzzy (PDPF) model is constructed to represent the NTV systems. According to Parallel Distributed Compensation (PDC) concept, a parameter-dependent polynomial fuzzy controller is built to achieve robust stability and passivity of PDPF model. Furthermore, the passive theory is applied to achieve the performance constraining the disturbance effect on the PDPF systems. To develop the stability criteria, by introducing a parameter-dependent polynomial Lyapunov function, one can derive some stability conditions which belong to the term of Sum-Of-Squares (SOS) form. Based on the Lyapunov function, two stability criteria are proposed to design the corresponding PDPF controller such that the NTV system is robustly stable and passive. Finally, a numerical example is applied to demonstrate the effectiveness of the proposed stability criterion.

We construct a real square system related to a given over-determined real system. We prove that the simple real zeros of the over-determined system are the simple real zeros of the related square system and the real zeros of the two systems are one-to-one correspondence with the constraint that the value of the sum of squares of the polynomials in the over-determined system at the real zeros is identically zero. After certifying the simple real zeros of the related square system with the interval methods, we assert that the certified zero is a local minimum of the sum of squares of the input polynomials. If the value of the sum of the squares of the input polynomials at the certified zero is equal to zero, it is a zero of the input system. As an application, we also consider the heuristic verification of the isolated zeros of polynomial systems and their multiplicity structures. Notice that a complex system with complex zeros can be transformed into a real system with real zeros.

Remote sensing datasets are increasingly being used to provide spatially explicit large scale evapotranspiration (ET) estimates. The focus of this study was to estimate and thematically map on a pixel-by-pixel basis, the actual evapotranspiration (ET_a) of the Wonji Shoa Sugarcane Estate using the Surface Energy Balance Algorithm for Land (SEBAL), Simplified Surface Energy Balance (SSEB) and Operational Simplified Surface Energy Balance (SSEBop) algorithms. The results obtained revealed that the ranges of the daily ETa estimated on January 25, February 26, September 06 and October 08, 2002 using SEBAL were 0.0 - 6.85, 0.0 – 9.36, 0.0 – 3.61, 0.0 – 6.83 mm/day; using SSEB 0.0 - 6.78, 0.0 – 7.81, 0.0 – 3.65, 0.0 – 6.46 mm/day, and SSEBop were 0.05 - 8.25, 0.0 – 8.82, 0.2 – 4.0, 0.0 – 7.40 mm/day, respectively. The Root Mean Square Error (RMSE) values between SSEB and SEBAL, SSEBop and SEBAL, and SSEB and SSEBop were 0.548, 0.548, and 0.99 for January 25, 2002; 0.739, 0.753, and 0.994 for February 26, 2002;0.847, 0.846, and 0.999 for September 06, 2002; 0.573, 0.573, and 1.00 for October 08, 2002, respectively. The standard deviation of ET_a over the sugarcane estate showed high spatio-temporal variability perhaps due to soil moisture variability and surface cover. The three algorithm results showed that well watered sugarcane fields in the mid-season growing stage of the crop had higher ET_a values compared with the other dry agricultural fields confirming that they consumptively use more water. Generally during the dry season, ET_a is limited to water surplus areas only and in wet season, ET_a was high throughout the entire sugarcane estate. The evaporation fraction (ETrF) results also followed the same pattern as the daily ET_a over the sugarcane estate. The total crop and irrigation water requirement and effective rainfall estimated using the Cropwat model were 2468.8, 2061.6 and 423.8 mm/yr for January 2001 planted and 2281.9, 1851.0 and 437.8 mm/yr for March 2001 planted sugarcanes, respectively. The mean annual ET_a estimated for the whole estate were 107 Mm³, 140 Mm³, and 178 Mm³ using SEBAL, SSEB, and SSEBop, respectively. Even though the algorithms should be validated through field observation, they have potential to be used for effective estimation of ET in the sugarcane estate.

Relationships of the three bryophyte lineages (liverworts, mosses, and hornworts) to vascular plants is a pivotal question in the study of origin and evolution of land plants. In recent decades, this question has been subject to intense phylogenetic analyses using morphological characters, multigene DNA sequences, and genome structural characters. A tentative consensus reached ten years ago suggested that bryophytes are a paraphyletic group, with liverworts being sister to all other land plants and hornworts being sister to vascular plants. However, several more recent nuclear phylogenomic studies have concluded that bryophytes represent a monophyletic group that is sister to vascular plants. A discussion is presented here on strengths and weaknesses of different types of characters (morphological traits, nucleotide sequences, and genome structural arrangements), and their suitability for resolving deep phylogenetic relationships. Moreover, several criteria for credible phylogenetic reconstruction are proposed. Strong statistical support for reconstructed relationships should be derived from high quality, independent characters selected for suitability to the particular question being addressed. The relationships inferred in a study should be congruent with those from as many other lines of phylogenetic evidence as possible. Any incongruities should be explicable by well-understood biological mechanisms. It is concluded that the relationships of the three bryophyte lineages to vascular plants should currently be viewed as unresolved. This is a difficult phylogenetic problem; the land plants underwent a rapid radiation a long time ago. Yet, further exploration of analytical methods and careful choice of characters should lead to eventual elucidation of diversification patterns among early land plants.

The digital transformation in Industry 4.0 has revolutionized quality control paradigms, integrating advanced technologies such as augmented reality, deep learning, and computer vision systems into a new era called "Quality 4.0". This study systematically reviews how these technologies are shaping new practices in continuous quality supervision and improvement, adapting to increasingly automated and connected production environments. Through a comprehensive analysis of the literature, practical applications in various industrial sectors, from manufacturing and agriculture to the production of sweets and snacks, are highlighted. Additionally, the conceptual and detailed design of a quality control system using artificial intelligence tools is presented, focusing on the inspection of dimensions, color, weight, and labeling of MDF boxes. The proposed system demonstrates an effective integration of sensors, high-definition cameras, and deep learning algorithms, validated through tests with boxes of different sizes. The results suggest that the adoption of these technologies not only improves the accuracy and efficiency of inspections but is also essential to maintaining high-quality standards in a dynamic and competitive industrial environment.

Sharding shows great potential for extending the blockchain. The current challenge facing sharded blockchain technology lies in addressing the extended transaction confirmation times caused by isolated states between shards and unbalanced transaction allocation strategies. These factors contribute to an increase in cross-shard transactions and disproportionate shard workload, ultimately resulting in indefinite confirmation delays for cross-shard transactions. A critical priority for sharded blockchain systems is to conduct a comprehensive qualitative analysis to better understand and mitigate the prolonged transaction confirmation times. We introduce a Product-Form Queue Network (PFQN) model to address the transaction confirmation time problem in sharded blockchains and incorporate a new confirmation queue to more accurately simulate the actual transaction confirmation process in the blockchain. In addition, we provide a detailed quantitative analysis of the relationship between network load, consensus efficiency, and security in sharded blockchains, laying a theoretical foundation for achieving robustness and efficiency in sharded blockchains. This research not only contributes to addressing the scalability issues in sharded blockchains but also offers a new perspective for future research directions.

Novel freeform optical design methods can be classified in two categories, relevant to the generation of a starting point or to the development of new optimization tools. In this paper, we design a freeform TMA optimized with different surface representations using either a differential ray-tracer as a new optimization tool, or commercial ray tracer (ANSYS-ZEMAX OpticStudio) for comparison. For differential ray tracing, we use FORMIDABLE (Freeform Optics Raytracer with Manufacturable Imaging Design cApaBiLitiEs): an optical design library with differential ray tracing and NURBS optimization capabilities under European Software Community License (ESCL). NURBS allow to represent a freeform surface without needing any prior knowledge on the surface, such as the polynomial degree in polynomial descriptions. However, commercial optical design software are designed to optimize polynomial surfaces, but are not well-suited to optimize NURBS surfaces. This requires to use a custom optical design library. To demonstrate the interest of using NURBS representation, freeform telescopes are independently optimized with NURBS using FORMIDABLE, or XY polynomials with OpticStudio over different iteration cycles. We then compare the resulting systems using their RMS Field Maps to assess the optimization quality of each surface representation. We also provide a full-system comparison, including mirror freeform departures. This study shows that NURBS can be a relevant alternative to XY polynomials for freeform optimization of reflective 3-mirror telescopes.

In this paper, we consider the Cauchy problem of a time fractional nonlinear diffusion equation. According to the Kaplan’s first eigenvalue method, we first prove the blow-up of the solutions in finite time for some sufficient conditions. We next give sufficient conditions for the existence of global solutions by using the result of Zhang and Sun. In conclusions, we find the second critical exponent for the existence of global and non-global solutions via the decay rates of the initial data at spatial infinity.

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.

In electromagnetic ultrasonic testing, it is difficult to recognize small-size bottom cracks by time of flight (ToF), and the lift-off fluctuation of the probe affects the accuracy and consistency of the inspection results. In order to overcome the difficulty, a novel EMAT (electromagnetic acoustic transducer)-PEC (pulse eddy current) composite sensor is designed. We use amplitude of bottom echo recorded by EMAT to identify the tiny bottom crack as well as the amplitude of PEC signals picked up by the integrated symmetric coils to measure the average lift-off of the probe in real time. Firstly, the effects of lift-off and bottom cracks on amplitude of bottom echo are distinguished combining the theoretical analysis and finite element method (FEM). And then an amplitude correction method based on the fusion of EMAT and PEC signals is proposed to reduce the impact of lift-off on the defect signal. The experimental results demonstrate that the designed composite sensor can effectively detect the bottom crack as small as 0.1mm* 0.3mm. The signal fusion method can accurately correct the amplitude of defect signal and the relative error is less than ±8%.

Depression is one of the psychiatric disorders characterized by anxiety, pessimism, and suicidal tendencies, which seriously affect the quality of life of patients and their families. In this paper, we used polynomial-based kernel Granger causality values as network node connectivity indicators to construct brain networks for 5 depressed patients and 11 healthy individuals’ magnetoencephalogram(MEG) under positive, neutral, and negative emotional stimuli, respectively, and found that depressed patients had closer information exchange between frontal and occipital regions compared to healthy individuals and other brain regions, and fewer causal connections in parietal and central regions. Further analysis of the topological properties of the network revealed that depressed patients had higher mean degrees under negative stimuli (p=0.008)and lower mean clustering coefficients than healthy individuals(p=0.034). Comparing the mean degree and mean clustering coefficient of the same sample under different emotional stimuli, we found that depressed patients had the greater mean degree and mean clustering coefficient under negative stimuli than neutral and positive stimuli. We also found that patients’ feature path lengths under negative and neutral stimuli significantly deviated from small-world attributes. The results suggest that analysis of nuclear Granger causality-based brain networks can effectively characterize depression pathology.

This article describes an algorithm for estimation the variance of Gaussian noise. The data is smoothed using the Savitsky-Golay polynomial filter. Absolute differences between original and smoothed data are sorted in ascending order. The initial part of this sequence is selected for analysis. The result of calculation mean value of differences can be used to estimate the variance of the noise. By selecting points for analysis, the impact of cosmic ray noise and other artifacts can be reduced. The use of the proposed method for artificial and real spectra shows the ability to effectively estimate the noise variance. The algorithm contains no user-defined parameters.

The term Air Quality (AQ) pertains to the standard of air, which has a direct impact on the health and well-being of individuals. It is crucial to maintain high Air Quality (AQ), for better health and productivity. Though most of people spend more time indoors nowadays, it is not to be overlooked that the pollutant concentration in indoor air is directly linked to the outdoor air quality. Due to the changes in occupancy patterns, outdated maintenance of ventilation systems, and structural flaws in buildings, the indoor air is significantly polluted; pollutants emitted outdoors enter indoor air through open windows, ventilation systems and infiltration. In this paper, we have proposed a new technique, DTMCPM (discrete-time Markov chain (DTMC) model for the analysis and forecasting of AQ, using the power method). Specialized sensors and equipment to measure different pollutants, such as particulate matter, ozone, nitrogen dioxide, sulfur dioxide, benzene and toluene, are used to collect data by the Institute of Pakistan Air Quality Monitor in various cities; the data is converted to US EPA standard for all pollutant species. This data is used to calculate the transition matrix, steady-state values and mean return rate for the analysis of IAQ. The calculated and actual return rates have been compared and the proposed model is found to have a low average prediction error of 2.356%.

This study investigates the comparative performance of autoencoders and traditional machine learning (ML) algorithms in predicting tumor dynamics following Gamma Knife radiosurgery (GKRS) for brain metastases (BMs). The research retrospectively analyzed clinical data from 77 patients (median age: 64 years; 45 males, 32 females) treated at the “Prof. Dr. NicolaeOblu” Emergency Clinic Hospital-Iasi. The dataset comprised 12 variables, including socio-demographic, clinical, treatment, and radiosurgery-related factors. The primary outcome was tumor progression or regression within three months post-GKRS, with 71 cases of regression and 6 cases of progression observed. Traditional ML models—Logistic Regression, Support Vector Machine (SVM), K-Nearest Neighbors (KNN), Extra Trees, Random Forest, and XGBoost—were evaluated, achieving accuracy rates ranging from 0.91 (KNN) to 1.00 (Extra Trees). When incorporating features extracted by autoencoders, the performance of these models generally improved, especially with compression in the bottleneck layer. For instance, Logistic Regression's accuracy increased from 0.91 to 0.94, while SVM's accuracy improved significantly from 0.85 to 0.96. XGBoost consistently performed well across both traditional and hybrid setups, maintaining an accuracy of 0.94 with an AUC of 0.98. The findings suggest that hybrid approaches combining deep learning with traditional ML techniques can significantly enhance predictive accuracy and robustness, particularly in the context of GKRS for BMs. This improved performance has potential implications for more informed clinical decision-making in personalized medicine.

Driven by the importance of early detection for improving patient outcomes, this study investigates the effectiveness of various machine learning algorithms in predicting lung cancer based on clinical data. Lung cancer remains a significant global health concern, and this research seeks to contribute to advancements in early diagnosis through the application of machine learning techniques. The dataset consists of 385 training and 97 test samples, with a k-fold cross-validation approach (k=5) utilized to mitigate overfitting. Additionally, the ADASYN oversampling technique is employed to address class imbalance. Our analysis includes traditional algorithms such as Logistic Regression and Decision Trees, as well as ensemble methods like XGBoost, LGBM, and AdaBoost. Furthermore, we explore the effectiveness of deep learning models, particularly Deep Neural Networks (DNN). Results demonstrate promising accuracy rates across all models, with some outperforming others in terms of precision, recall, and F1-score. Our findings reveal that LGBM achieves the highest accuracy among all models, with an accuracy rate of 96.91%. It also exhibits superior performance in terms of precision, recall, and F1-score, particularly in classifying both positive and negative instances of lung cancer.

Monitoring the integrity of aeronautical structures is fundamental for safety. Structural Health Monitoring Systems (SHMS) perform real-time monitoring functions, but their performances must be carefully assessed. In this work the damage detection performances of a strain-based SHMS, were evaluated on a composite helicopter rotor blade root. The SHMS monitored the bonding between the central core and the surrounding antitorsional layer. A damage detection algorithm was trained through Finite Element analyses performed on the component. The effects of the loads variability and of damages were decoupled by including a load recognition step in the algorithm. Load recognition was accomplished in different ways: version#1 adopted an Artificial Neural Network (ANN) trained on blades in pristine condition; version#2 was trained also on damaged blades; version#3 adopted a calibration matrix method. Anomaly detection, damage assessment, and localization were performed by using an ANN. Results showed a higher load identification and anomaly detection accuracy for version#1 and version#2 compared to version#3. Gaussian noise reduced anomaly detection and damage assessment performances, and reduced damage localization accuracy for bigger damages. The damage detection performance were obtained for a fibre optic based-SHMS, including the trade-off between probability of detection and false alarm rate for different damage sizes.

Chip pad alignment inspection is of great importance in the industrial field. However, due to the fact that chip pads are usually small, problems such as misdetection and missed detection often occur. When applying deep learning methods for chip pad detection, it is necessary to ensure accurate detection of small target chips while meeting the requirements of lightweight detection models for industrial needs. To solve the above problems, this paper proposes a lightweight model based on improved YOLOv5s. Firstly, the feature extraction part is improved to increase the network's focus on the target. Secondly, the feature fusion layer is improved to double the resolution of the prediction head, and the context-aware network is designed to enhance the context-capture ability of key features of small targets. Finally, SIoU is adopted as the loss function to improve the speed and accuracy of the regression frame. The experimental results show that the improved YOLOv5s algorithm improves the detection accuracy by 2.3% and reduces the network parameters by 81.8% compared to the original algorithm. The improved algorithm is combined with image processing techniques to design correction methods for alignment anomalies and realize real-time alignment anomaly correction in industry.

The necessity for precise and current data concerning the dynamics of land cover change in Indonesia is crucial for efforts to reduce natural vegetation cover due to agricultural expansion. The functionality of monitoring systems that incorporate Terra-MODIS is currently compromised by the limited availability of data for the immediate future. This study seeks to assess the potential of VIIRS satellite imagery in developing an early warning system for monitoring vegetation cover change in Indonesia. The Normalized Differential Open Area Index (NDOAI) computed from the 8-day’ VIIRS data was employed to detect changes in vegetation cover based on pixel-by-pixel subtraction in the NDOAI data time series. Evaluating the pixel-level accuracy of change detection is complicated due to the fact that we evaluate a change map at a coarser resolution than the Landsat-based reference map. The results revealed that increasing the threshold percentage is associated with improved accuracy. In change detection, there is often a trade-off between accuracy and sensitivity. A threshold that is too low may result in false positives, while a threshold that is too high may lead to missed changes. This study demonstrates that when a threshold value of less than 20% is applied, Landsat can identify vegetation cover changes at an earlier stage. Conversely, when a threshold value greater than 20% is employed, VIIRS will detect the change 4.5 days earlier than Landsat. Additionally, VIIRS is capable of detecting changes 25.4 days and 54.8 days faster than Landsat, respectively, when using thresholds of 40% and 75%.

In the field of railroad safety, effective detection of surface cracks is critical, necessitating reliable, high-speed non-destructive testing (NDT) methods. This study introduces a hybrid Eddy Current Testing (ECT) probe, specifically engineered for railroad inspection, to address the common issue of ’lift-off noise’ due to varying distances between the probe and test material. Unlike traditional ECT methods, this probe integrates transmit and differential receiver coils, aiming to enhance detection sensitivity and minimize lift-off impact. The study optimizes ECT probes employing different driver coils, emphasizing three main objectives: a) quantitatively evaluating each probe using signal- to-noise ratio (SNR) and outlining a real-time data processing algorithm based on SNR methodology; b) exploring the frequency range proximal to the electrical resonance of the receiver coil; c) examining sensitivity variations across varying lift-off distances. The experimental outcomes indicate that the newly designed probe with figure 8-shape driver coil significantly improves sensitivity in detecting surface cracks on railroads. It achieves an impressive SNR exceeding 100 for defects with minimal dimensions of 1 mm in width and depth. Simulation results closely align with experimental findings, validating the investigation of optimal operational frequency and lift-off distance for selected probe performance, determined to be 0.3 MHz and 0.5 mm, respectively. The realization of this project would lead to notable advancements in enhancing railroad safety by improving crack detection efficiency.

This article contains the theorems concerning the algebraic dependence of polynomial mappings with the constant Jacobian having two zeros at infinity. The work is related to the issues of the classical Jacobian Conjecture. This hypothesis affirm that the polynomial mapping of two complex variables with constant non-zero Jacobian is invertible. The Jacobian Conjecture is equivalent to the fact that polynomial mappings with constant non-zero Jacobian do not have two zeros at infinity, therefore it is equivalent to the two theorems given in the work. The proofs of these theorems proceeds by induction.

This paper examines the correlation between numbers of computer cores in parallel genetic algorithms. The objective to determine the linear polynomial complementary equation in order represent the relation between number of parallel processing and optimum solutions. Model this relation as optimization function (f(x)) which able to produce many simulation results. F(x) performance is outperform genetic algorithms. Compression results between genetic algorithm and optimization function is done. Also the optimization function give model to speed up genetic algorithm. Optimization function is a complementary transformation which maps a TSP given to linear without changing the roots of the polynomials.

In this paper, a proof similar to the Pusey-Barrett-Rudolph (PBR) theorem is given to prove that time in quantum theory is not epistemic but has ontological reality. For this, we first discuss how time can be encoded as an intrinsic property of a quantum system. We prepare a quantum state containing time as an intrinsic property and show by a PBR-type proof that time cannot be an epistemic notion. In fact, the PBR theorem implies an ontic notion of time. Indeed, if the quantum state is a physical property, then quantum state reduction is a physical process involving information destruction. In this case, quantum probabilities are intrinsic probabilities without epistemic origin, and they generate a genuinely new sequence of events. This novelty introduced by quantum probabilities can be interpreted as time.

The properties of iterative splitting methods with serial versions have been analyzed since recent years, see [1] and [3]. We extend the iterative splitting methods to a class of parallel versions, which allow to reduce the computational time and keep the benet of the higher accuracy with each iterative step. Parallel splitting methods are nowadays important to solve large problems, which can be splitted in subproblems and computed independently with the dierent processors. We present a novel parallel iterative splitting method, which is based on the multi-splitting methods, see [2], [10] and [15]. Such a exibilisation with multisplitting methods allow to decompose large iterative splitting methods and recover the benet of their underlying waveform-relaxation (WR) methods. We discuss the convergence results of the parallel iterative splitting methods, while we could reformulate such an error to a summation of the individual WR methods. We discuss the numerical convergence of the serial and parallel iterative splitting methods and present dierent numerical applications to validate the benet of the parallel versions.

Factorization reduces computational complexity and is therefore an important tool in statistical machine learning of high dimensional systems. Conventional molecular modeling, including molecular dynamics and Monte Carlo simulations of molecular systems, is a large research field based on approximate factorization of molecular interactions. Recently, the local distribution theory was proposed to factorize global joint distribution of a given molecular system into trainable local distributions. Belief propagation algorithms are a family of exact factorization algorithms for trees and are extended to approximate loopy belief propagation algorithms for graphs with loops. Despite the fact that factorization of probability distribution is their common foundation, computational research in molecular systems and machine learning studies utilizing belief propagation algorithms have been carried out independently with respective track of algorithm development. The connection and differences among these factorization algorithms are briefly presented in this perspective, with the hope to intrigue further development in factorization algorithms for physical modeling of complex molecular systems.

Optimal control is a critical tool for mechanical robotic systems, facilitating precise manipulation of dynamic processes. These processes are described through differential equations governed by a control function, addressing a time-optimal problem with bilinear characteristics. Our study utilizes the classical approach complemented by Pontryagin's Maximum Principle (PMP) to explore this inverse optimal problem. The objective is to develop an exact piecewise control function that effectively manages trajectory control while considering the effects of viscous friction. Our simulations demonstrate that the proposed control law markedly diminishes oscillations induced by boundary conditions. This research not only aims to delineate the reachability set but also strives to determine the minimal time required for the process. The findings include an exact analytical solution for the stated control problem.

Quantum gravity theories rely on a minimal measurable length for their formulations, which clashes with the classical formulation of the uncertainty principle and with Lorentz invariance from general relativity. These incompatibilities led to the development of the generalized uncertainty principle (GUP) from string theories and its various modifications. GUP and covariant formulations of the uncertainty principle are discussed, together with implications for space-time quantization.

This work introduces a new architecture for a time-domain feedback-based beamformer designed to meet real-time processing demands. The primary goal of this design is to locate reflective sources by estimating their direction of arrival (DOA) and signal range. Incorporating a feedback mechanism in this architecture is a unique aspect that refines localization precision. We conduct an in-depth analysis highlighting their respective benefits and limitations to compare the effectiveness of time-domain feedback beamforming against conventional time-domain methods. Our evaluation of the proposed architecture, based on critical performance indicators such as peak-to-sidelobe ratio, mainlobe width, and directivity factor, demonstrates its ability to improve beamformer effectiveness significantly.

In the last decades we have experienced great social, cultural, and educational changes, spending more time performing tasks in near vision and less hours in outdoor activities, having more overexposure to digital screens, especially the youngest and increasingly from younger ages. It is common to see cases when performing tasks in near vision the posture or position of the head is not adequate, especially the youngest, being essential to have a correct posture of the head to avoid visual, muscular, or articular problems. We present a procedure to try to control the correct position of the head in real time when performing close-up activities. The aim is to detect the inclination of the head and to know if a bad position is adopted due to a visual problem or simply to inadequate visio-postural habits, warning us of the postural anomaly to correct it.

Accurate traffic simulation models play a crucial role in developing intelligent transport systems that offer timely traffic information to users and efficient traffic management. However, calibrating these models to represent real-world traffic conditions accurately poses a significant challenge due to the dynamic nature of traffic flow and the limitations of traditional calibration methods. This article introduces a machine learning-based approach to calibrate macroscopic traffic simulation models using real-time traffic video stream data. By leveraging computer vision technologies to extract key traffic parameters from video streams, the approach demonstrated a notable improvement in aligning the generated data from the calibrated simulation model with car sensor data, achieving an average improvement of over 50% compared to the uncalibrated macroscopic model. Moreover, there was a substantial reduction in data drift for the machine learning model integrated into the virtual transport space using vehicle-to-everything technology, resulting in a more than fourfold decrease in the average absolute error of the model.

This paper represents the first investigation into the consensus problem of linear time-varying multi-agent systems utilizing an event-triggered communication scheme. First, a general event-triggered consensus control scheme is proposed for a general category of linear time-varying multi-agent systems. Under some suitable assumptions, it is demonstrated that all agents’ states will converge exponentially, with Zeno behaviour being ruled out. Second, the consensus problem in a network of linear time-varying multi-agent systems with a spanning tree is investigated using the proposed control strategy. It demonstrates that the consensus issue for the specified system can be reformulated as a stabilization problem for an error system through a time-varying linear transformation. Then, the event-triggered consensus problem is just a special instance of the general event-triggered consensus problem mentioned above. Finally, to illustrate the efficacy of the event-triggered method proposed in this study, simulation results are shown.

Performing optimisation and scale-up studies of crystallisation systems requires accurate and computationally efficient mathematical models. The assumption of the ideal mixing conditions in batch reactors typically produce inaccurate results while the computational expense of CFD models is still prohibitively high. Therefore, in this work, a new intermediary approach is proposed that takes into account the non-ideal mixing conditions in the reactor and requires less computational resources than full CFD simulations. Starting with the Danckwerts concept of the intensity of segregation, an analogy between its application to chemical reactions and the kinetics of the crystallisation phenomena (such as nucleation and growth) has been made. As a result, the modified kinetics expressions have been derived which incorporate the effect of non-idealities present in stirred reactors. This way, based on the experimental measurements of the mixing time using the Laser Induced Fluorescence (LIF) technique, computationally more efficient mathematical models can be developed in two ways: (1) the accurate semi-empirical correlations are available for standard mixing configurations with the most often used types of impellers, (2) CFD simulations can be utilised for estimation of the mixing time; in this case it is necessary to simulate only the mixing process. The benefits offered by the LIF experimental technique have been demonstrated and some frequent problems in its application analysed. The mixing time results for configurations with and without baffles for three types of impellers and four different rotational speeds have been presented. The false shorter mixing times in the non-baffled configurations have been observed and this phenomena explained by the existence of two segregated zones in the reactor and confirmed by additional experiments. The precise measurements in these cases have been shown as difficult using the LIF technique, particularly for higher rpms. The experimental data has been compared to the preliminary simulation results obtained from the Smoothed Particle Hydrodynamics method and the standard k-ε turbulence model with the modest success. The shortcomings of the SPH model have been recognized and the directions for the future work discussed.

The application of deep learning algorithms to predict the molecular profiles of various cancers from digital images of hematoxylin and eosin (H&E)-stained slides has been reported in recent years, mainly in gastric and colon cancers. In this study, we investigated the potential use of H&E-stained endometrial cancer slide images to predict the associated mismatch repair (MMR) status. H&E-stained slide images were collected from 127 cases of the primary lesion of endometrial cancer. After digitization using a Nanozoomer virtual slide scanner (Hamamatsu Photonics), we segmented the scanned images into 5,397 tiles of 512 × 512 pixels. The MMR proteins (PMS2, MSH6) were immunohistochemically stained, classified into MMR proficient/deficient, and annotated for each case and tile. We trained several neural networks, including convolutional and attention-based networks, using tiles annotated with the MMR status. Among the tested networks, ResNet50 exhibited the highest area under the receiver operating characteristic curve (AUROC) of 0.91 for predicting the MMR status. The constructed prediction algorithm may be applicable to other molecular profiles and useful for pre-screening before implementing other, more costly genetic profiling tests.

Commuting is a vital travel channel for college students throughout their higher education career; nevertheless, excessive commute time negatively impacts students’ school satisfaction, academic achievement, health, and quality of life. Meanwhile, few studies have explored students’ commute time, covering a large population and scope. Therefore, this study analyzes the dwelling type that influences college and graduate students’ school commute times in the Seoul Metropolitan Area, using data from the 2016 Household Travel Diary Survey. This study uses spatial data on housing development to classify five dwelling types (i.e., new town, housing site development, Seoul, Incheon, and Gyeonggi-do). A multiple linear regression model empirically analyses students’ household and personal characteristics. The results reveal that dwelling type significantly affects students’ commute time. Specifically, Students living in Seoul have a shorter commute to school than those living in new towns. Socioeconomic characteristics have less effect on college and graduate students' school commute time. This study discusses the problem of excessive commuting of college and graduate students in new towns.

As the adoption of renewable energy sources grows, ensuring a stable power balance across various time frames has become a central challenge for modern power systems. In line with the "dual carbon" objectives and the seamless integration of renewable energy sources, harnessing the advantages of various energy storage resources and coordinating the operation of long-term and short-term storage have become pivotal directions for future energy storage deployment. To address the complexities arising from the coupling of different time scales in optimizing energy storage capacity, this paper proposes a method for energy storage planning that accounts for power imbalance risks across multiple time scales. Initially, the Seasonal and Trend decomposition using the Loess (STL) decomposition method is utilized to temporally decouple actual operational data. Subsequently, power balance computations are performed based on the obtained data at various time scales to optimize the allocation of different types of energy storage capacities and assess the associated imbalance risks. Finally, the effectiveness of the proposed approach is validated through hourly applications using real-world data from a province in China over recent years.

The variability of the material properties of steel from different suppliers causes problems in achieving the required surface quality after turning. Therefore, the manufacturer needs to be able to estimate the resulting quality before starting production, especially if it is an expensive, small-batch production from stainless steel. Predictive models will make it possible to estimate the surface roughness from the mechanical properties of steel in the Mill Test Certificate (MTC) and thus support decision-making about the supplier selection or the acceptance of a material supply. Multivariate second-order polynomial model and feedforward back-propagation Artificial Neural Network (ANN) model were used to enhance the methodological robustness in formulating the decision if the predicted surface roughness is outside the required range, even before accepting the delivery. Both models can accurately predict surface roughness, while the ANN model is more accurate than the polynomial model; however, the predictive model is sensitive to the accuracy of the input data, and the model’s prediction is valid only under precisely defined conditions. The prediction model is used in a step-by-step decision-making procedure, which enables the trained staff to make a quick decision.

Since December 2019, the coronavirus disease (COVID-19) has rapidly spread worldwide. The Mexican government has implemented public safety measures to minimize the spread of the virus. In this paper, the authors use statistical models in two stages to estimate the total number of coronavirus (COVID-19) cases per day at the state and national level in Mexico. Two types of models are proposed: first, a polynomial model of the growth for the first part of the outbreak until the inflection point of the pandemic curve and then a second nonlinear growth model is used to estimate the middle and the end of the outbreak. Model selection will be performed using Vuong’s test. The proposed models show overall fit similar to predictive models (e.g. time series, and machine learning); however, the interpretation of parameters is less complex for decision-makers and the residuals follow the expected distribution when fitting the models without autocorrelation being an issue.

The main objective of our study was to understand the rheological behavior of various types of cheeses with mold subjected to multiple stresses during processing/handling, transport, or storage, aiming to maintain or even improve product quality, using computer-assisted penetration methods, and advanced regression algorithms. Uniaxial penetration tests with a cone at a constant speed were conducted using a universal Hounsfield HK1S testing equipment connected to a computer to analyze the texture behavior (tangential stress, flow index, apparent viscosity) of four of the most common types of cheese with mold, depending on the cone's tip angle (9, 19, and 90°) and penetration speed (12, 30, and 60 mm/min). From the results obtained for the four categories of mold cheeses (Brie, Camembert, Dorblue, or Roquefort), the amplitude of the speed and angle of penetration were considered as the main influencing factors for the shear deformation (τc), flow index (Kf), and apparent viscosity (ηa). The moisture and firmness of the mold cheeses are closely linked and depend on the type of mold, the maturation process, or storage conditions. Careful control of these factors is essential to achieve the desired texture and taste characteristics in cheeses with mold.

This paper proposed an optimal tracking control scheme through adaptive dynamic programming(ADP) for a class of partially unknown discrete-time nonlinear systems based on radial basis function neural network(RBF-NN). In order to acquire the unknown system dynamics, we use two RBF-NNs, the one is used to construct the identifier, and the another is used to directly approximate the steady-state control input, where a novel adaptive law is proposed to update neural network weights. While the optimal feedback control and the cost function are derived via feedforward neural networks approximating, it is proposed to regulate the tracking error, the critic network and the actor network are then trained online to obtain the solution of the associated Hamilton–Jacobi–Bellman (HJB) equation being built under the ADP framework. Simulations verify the effectiveness of the optimal tracking control technique using the neural networks.

In an effort to enhance the efficiency and safety of open-pit mines, this study explores the optimization of end slope road parameters and slope structures, specifically focusing on unmanned driving lanes.A significant aspect of the study is the development of a truck trajectory offset model, which considers the different reaction times between automated sensors and human drivers in adapting to environmental changes. To test these concepts, the study uses numerical simulations to confirm the stability of the proposed end slope designs. Using Victory West Mine No. 1 as a case study, the research determines the optimized width for unmanned driving lanes and the maximum angle for safe steepening of end slopes. The findings indicate that the optimized unmanned lane width for NTE240 mining dump trucks is 1743 mm, allowing for a 2-degree increase in the slope angle at the south end slope. This optimization leads to a steep mining stripping volume of 3.2735 million m³ and a coal output of 2.49628 million tons, maintaining a stripping ratio of 1.31m³/t. These results demonstrate that the unmanned driving road width optimization not only ensures slope safety but also significantly boosts the economic benefits of steep mining in open-pit mines.

In this paper, the optimal approximation algorithm is proposed to simplify non-linear functions and/or discrete data as piecewise polynomials by using the constrained least squares. In time-sensitive applications or in embedded systems with limited resources, the runtime of the approximate function is as crucial as its accuracy. The proposed algorithm search to find the Optimal Piecewise Polynomial (OPP) with minimum computational cost while ensuring the error below a specified threshold. This was accomplished by using smooth piecewise polynomials with optimal order and number of intervals. The computational cost only depends on polynomial complexity, i.e., the order and the number of intervals at runtime function call. For optimal approximation, computational costs for all the possible combinations of piecewise polynomials were calculated and tabulated as ascending order for the specific target CPU off-line. Each combination was optimized through constrained least squares and random selection method for given sample points. Afterward, whether the approximation error is below the predetermined value is examined. When the error is permissible, the combination is selected as the optimal approximation or the next combination was examined. To verify the performance, several representative functions were examined and analyzed.