Search Results (2,717)

Lactic acid bacteria (LAB) are central to food, feed, and health biotechnology, yet their genomes have long resisted rapid, precise manipulation. This review charts the evolution of LAB genome-editing strategies from labor-intensive RecA-dependent double-crossovers to state-of-the-art CRISPR and CRISPR-associated transposase systems. Native homologous recombination, transposon mutagenesis, and phage-derived recombineering opened the door to targeted gene disruption, but low efficiencies and marker footprints limited throughput. Recent phage RecT/RecE-mediated recombineering and CRISPR/Cas counter-selection now enable scar-less point edits, seamless deletions, and multi-kilobase insertions at efficiencies approaching model organisms. Endogenous Cas9 systems, dCas-based CRISPR interference, and CRISPR-guided transposases further extend the toolbox, allowing multiplex knockouts, precise single-base mutations, conditional knockdowns, and payloads up to 10 kb. The remaining hurdles include strain-specific barriers, reliance on selection markers for large edits, and the limited host-range of recombinases. Nevertheless, convergence of phage enzymes, CRISPR counter-selection and high-throughput oligo recombineering is rapidly transforming LAB into versatile chassis for cell-factory and therapeutic applications. Full article

This paper addresses an attraction–repulsion chemotaxis system governed by Neumann boundary conditions within a bounded domain $\Omega \subset {\mathbb{R}}^3$ that has a smooth boundary. The primary focus of the study is the chemotactic response of a species (cell population) to two competing signals. We establish the existence and uniqueness of a weak solution to the system by analyzing the solvability of an approximate problem and utilizing the Leray–Schauder fixed-point theorem. By deriving appropriate a priori estimates, we demonstrate that the solution of the approximate problem converges to a weak solution of the original system. Additionally, we conduct computational studies of the model using the finite element method. The accuracy of our numerical implementation is evaluated through error analysis and numerical convergence, followed by various numerical simulations in a two-dimensional domain to illustrate the dynamics of the system and validate the theoretical findings. Full article

Traditional algorithms such as Dijkstra and APF rely on complete environmental information for path planning, which results in numerous constraints during modeling. This not only increases the complexity of the algorithms but also reduces the efficiency and reliability of the planning. Swarm intelligence algorithms possess strong data processing and search capabilities, enabling them to efficiently solve path planning problems in different environments and generate approximately optimal paths. However, swarm intelligence algorithms suffer from issues like premature convergence and a tendency to fall into local optima during the search process. Thus, an improved Artificial Bee Colony-Beetle Antennae Search (IABCBAS) algorithm is proposed. Firstly, Tent chaos and non-uniform variation are introduced into the bee algorithm to enhance population diversity and spatial searchability. Secondly, the stochastic reverse learning mechanism and greedy strategy are incorporated into the beetle antennae search algorithm to improve direction-finding ability and the capacity to escape local optima, respectively. Finally, the weights of the two algorithms are adaptively adjusted to balance global search and local refinement. Results of experiments using nine benchmark functions and four comparative algorithms show that the improved algorithm exhibits superior path point search performance and high stability in both high- and low-dimensional environments, as well as in unimodal and multimodal environments. Ablation experiment results indicate that the optimization strategies introduced in the algorithm effectively improve convergence accuracy and speed during path planning. Results of the path planning experiments show that compared with the comparison algorithms, the average path planning distance of the improved algorithm is reduced by 23.83% in the 2D multi-obstacle environment, and the average planning time is shortened by 27.97% in the 3D surface environment. The improvement in path planning efficiency makes this algorithm of certain value in engineering applications. Full article

A parallel efficient global optimization (EGO) algorithm with a pseudo expected improvement (PEI) multi-point sampling criterion, proposed in recent years, is developed to adapt the capabilities of modern parallel computing power. However, a comprehensive and clear discussion on the impact of different point-filling strategies on the optimization performance of the parallel EGO algorithm is still lacking, limiting its theoretical reference for practical applications and technological advancements. To address this gap, this study comprehensively investigates the optimization performance of the parallel EGO algorithm based on the PEI multi-point sampling criterion by analyzing the impact of different point-filling strategies under kriging surrogate models of varying fidelity. Therefore, nine benchmark test functions with different optimization problem characteristics were selected as optimization test objects, and the results were systematically analyzed from the perspectives of convergence performance, optimization efficiency, and algorithmic diversity. The analysis results indicate that the higher-fidelity kriging surrogate model enhances the stability of the parallel EGO algorithm in terms of convergence performance, optimization efficiency, and algorithmic diversity. Full article

Addressing the limitations of existing path planning algorithms for mobile robots in complex environments, such as poor adaptability, low convergence efficiency, and poor path quality, this study establishes a clear connection between mobile robots and real-world challenges such as unknown environments, dynamic obstacle avoidance, and smooth motion through innovative strategies. A novel multi-strategy fusion white shark optimization algorithm is proposed, focusing on actual scenario requirements, to provide optimal solutions for mobile robot path planning. First, the Chaotic Elite Pool strategy is employed to generate an elite population, enhancing population diversity and improving the quality of initial solutions, thereby boosting the algorithm’s global search capability. Second, adaptive weights are introduced, and the traditional simulated annealing algorithm is improved to obtain the Rapid Annealing Method. The improved simulated annealing algorithm is then combined with the White Shark algorithm to avoid getting stuck in local optima and accelerate convergence speed. Finally, third-order Bézier curves are used to smooth the path. Path length and path smoothness are used as fitness evaluation metrics, and an evaluation function is established in conjunction with a non-complete model that reflects actual motion to assess the effectiveness of path planning. Simulation results show that on the simple 20 × 20 grid map, the fusion of the Fused Multi-strategy White Shark Optimisation algorithm (FMWSO) outperforms WSO, D*, A*, and GWO by 8.43%, 7.37%, 2.08%, and 2.65%, respectively, in terms of path length. On the more complex 40 × 40 grid map, it improved by 6.48%, 26.76%, 0.95%, and 2.05%, respectively. The number of turning points was the lowest in both maps, and the path smoothness was lower. The algorithm’s runtime is optimal on the 20 × 20 map, outperforming other algorithms by 40.11%, 25.93%, 31.16%, and 9.51%, respectively. On the 40 × 40 map, it is on par with A*, and outperforms WSO, D*, and GWO by 14.01%, 157.38%, and 3.48%, respectively. The path planning performance is significantly better than other algorithms. Full article

Traditional deep reinforcement learning methods suffer from slow convergence speeds and poor adaptability in complex environments and are prone to falling into local optima in AGV system applications. To address these issues, in this paper, an adaptive path planning algorithm with an improved Deep Q Network algorithm called the B-PER DQN algorithm is proposed. Firstly, a dynamic temperature adjustment mechanism is constructed, and the temperature parameters in the Boltzmann strategy are adaptively adjusted by analyzing the change trend of the recent reward window. Next, the Priority experience replay mechanism is introduced to improve the training efficiency and task diversity through experience grading sampling and random obstacle configuration. Then, a refined multi-objective reward function is designed, combined with direction guidance, step punishment, and end point reward, to effectively guide the agent in learning an efficient path. Our experimental results show that, compared with other algorithms, the improved algorithm proposed in this paper achieves a higher success rate and faster convergence in the same environment and represents an efficient and adaptive solution for reinforcement learning for path planning in complex environments. Full article

Precisely recognizing diseases in tomato leaves plays a crucial role in enhancing the health, productivity, and quality of tomato crops. However, disease identification methods that rely on single-mode information often face the problems of insufficient accuracy and weak generalization ability. Therefore, this paper proposes a tomato leaf disease recognition framework FCMNet based on multimodal fusion, which combines tomato leaf disease image and text description to enhance the ability to capture disease characteristics. In this paper, the Fourier-guided Attention Mechanism (FGAM) is designed, which systematically embeds the Fourier frequency-domain information into the spatial-channel attention structure for the first time, enhances the stability and noise resistance of feature expression through spectral transform, and realizes more accurate lesion location by means of multi-scale fusion of local and global features. In order to realize the deep semantic interaction between image and text modality, a Cross Vision–Language Alignment module (CVLA) is further proposed. This module generates visual representations compatible with Bert embeddings by utilizing block segmentation and feature mapping techniques. Additionally, it incorporates a probability-based weighting mechanism to achieve enhanced multimodal fusion, significantly strengthening the model’s comprehension of semantic relationships across different modalities. Furthermore, to enhance both training efficiency and parameter optimization capabilities of the model, we introduce a Multi-strategy Improved Coati Optimization Algorithm (MSCOA). This algorithm integrates Good Point Set initialization with a Golden Sine search strategy, thereby boosting global exploration, accelerating convergence, and effectively preventing entrapment in local optima. Consequently, it exhibits robust adaptability and stable performance within high-dimensional search spaces. The experimental results show that the FCMNet model has increased the accuracy and precision by 2.61% and 2.85%, respectively, compared with the baseline model on the self-built dataset of tomato leaf diseases, and the recall and F1 score have increased by 3.03% and 3.06%, respectively, which is significantly superior to the existing methods. This research provides a new solution for the identification of tomato leaf diseases and has broad potential for agricultural applications. Full article

In this study, a Gaussian process model is utilized to study the Fredholm integral equations of the first kind (FIEFKs). Based on the H–$H_k$ formulation, two cases of FIEFKs are under consideration with respect to the right-hand term: discrete data and analytical expressions. In the former case, explicit approximate solutions with minimum norm are obtained via a Gaussian process model. In the latter case, the exact solutions with minimum norm in operator forms are given, which can also be numerically solved via Gaussian process interpolation. The interpolation points are selected sequentially by minimizing the posterior variance of the right-hand term, i.e., minimizing the maximum uncertainty. Compared with uniform interpolation points, the approximate solutions converge faster at sequential points. In particular, for solvable degenerate kernel equations, the exact solutions with minimum norm can be easily obtained using our proposed sequential method. Finally, the efficacy and feasibility of the proposed method are demonstrated through illustrative examples provided in this paper. Full article

Some classical texts on the Sturm–Liouville equation ${(p(x)y^{\prime })}^{\prime }-q(x)y+\lambda \rho (x)y=0$ are revised to highlight further properties of its solutions. Often, in the treatment of the ensuing integral equations, $\rho =const$ is assumed (and, further, $\rho =1$). Instead, here we preserve $\rho (x)$ and make a simple change only of the independent variable that reduces the Sturm–Liouville equation to $y^{″}-q(x)y+\lambda \rho (x)y=0$. We show that many results are identical with those with $\lambda \rho -q=const$. This is true in particular for the mean value of the oscillations and for the analog of the Riemann–Lebesgue Theorem. From a mechanical point of view, what is now the total energy is not a constant of the motion, and nevertheless, the equipartition of the energy is still verified and, at least approximately, it does so also for a class of complex $\lambda$. We provide here many detailed properties of the solutions of the above equation, with $\rho =\rho (x)$. The conclusion, as we may easily infer, is that, for large enough $\lambda$, locally, the solutions are trigonometric functions. We give the proof for the closure of the set of solutions through the Phragmén–Lindelöf Theorem, and show the separate dependence of the solutions from the real and imaginary components of $\lambda$. The particular case of $q(x)=\alpha \rho (x)$ is also considered. A direct proof of the uniform convergence of the Fourier series is given, with a statement identical to the classical theorem. Finally, the proof of J. von Neumann of the completeness of the Laguerre and Hermite polynomials in non-compact sets is revisited, without referring to generating functions and to the Weierstrass Theorem for compact sets. The possibility of the existence of a general integral transform is then investigated. Full article

This study presents a hyperbolic three-dimensional telegraph interface model with regular interfaces, numerically solved using a hybrid scheme that integrates Haar wavelets and the finite difference method. Spatial derivatives are approximated via a truncated Haar wavelet series, while temporal derivatives are discretized using the finite difference method. For linear problems, the resulting algebraic system is solved using Gauss elimination; for nonlinear problems, Newton’s quasi-linearization technique is applied. The method’s accuracy and stability are evaluated through key performance metrics, including the maximum absolute error, root mean square error, and the computational convergence rate $R_c\left(M\right)$, across various collocation point configurations. The numerical results confirm the proposed method’s efficiency, robustness, and capability to resolve sharp gradients and discontinuities with high precision. Full article

Industrial energy systems are increasingly required to reduce operating costs and CO₂ emissions while integrating variable renewable energy sources. Managing these objectives under uncertainty requires advanced optimization strategies capable of delivering reliable and real-time decisions. To address these challenges, this study focuses on the short-term operational planning of an industrial energy supply system using the rolling horizon approach (RHA). The RHA offers an effective framework to handle uncertainties by repeatedly updating forecasts and re-optimizing over a moving time window, thereby enabling adaptive and responsive energy management. To solve the resulting nonlinear and constrained optimization problem at each RHA iteration, we propose a novel hybrid algorithm that combines Bayesian optimization (BO) with the Interior Point OPTimizer (IPOPT). While global deterministic and stochastic optimization methods are frequently used in practice, they often suffer from high computational costs and slow convergence, particularly when applied to large-scale, nonlinear problems with complex constraints. To overcome these limitations, we employ the BO–IPOPT, integrating the global search capabilities of BO with the efficient local convergence and constraint fulfillment of the IPOPT. Applied to a large-scale real-world case study of a food and cosmetic industry in Germany, the proposed BO–IPOPT method outperformed state-of-the-art solvers in both solution quality and robustness, achieving up to 97.25%-better objective function values at the same CPU time. Additionally, the influence of key parameters, such as forecast uncertainty, optimization horizon length, and computational effort per RHA iteration, was analyzed to assess their impact on system performance and decision quality. Full article

Under the dual-carbon goals, with the rapid increase in the proportion of fluctuating power sources such as wind and solar energy, the regulatory capacity of traditional thermal power generation can no longer meet the demand for intra-day fluctuations. There is an urgent need to tap into the potential of flexible load-side regulatory resources. To this end, this paper proposes a low-carbon economic optimal dispatching strategy for virtual power plants (VPPs), considering the aggregation of diverse flexible and adjustable resources with the integration of wind and solar power. Firstly, the method establishes mathematical models by analyzing the dynamic response characteristics and flexibility regulation boundaries of adjustable resources such as photovoltaic (PV) systems, wind power, energy storage, charging piles, interruptible loads, and air conditioners. Subsequently, considering the aforementioned diverse adjustable resources and aggregating them into a VPP, a low-carbon economic optimal dispatching model for the VPP is constructed with the objective of minimizing the total system operating costs and carbon costs. To address the issue of slow convergence rates in solving high-dimensional state variable optimization problems with the traditional plant growth simulation algorithm, this paper proposes an improved plant growth simulation algorithm through elite selection strategies for growth points and multi-base point parallel optimization strategies. The improved algorithm is then utilized to solve the proposed low-carbon economic optimal dispatching model for the VPP, aggregating diverse adjustable resources. Simulations conducted on an actual VPP platform demonstrate that the proposed method can effectively coordinate diverse load-side adjustable resources and achieve economically low-carbon dispatching, providing theoretical support for the optimal aggregation of diverse flexible resources in new power systems. Full article

This study proposes an L1 discretization scheme (an accurate second-order finite difference method) for time-fractional diffusion equations involving the Caputo-type Erdélyi–Kober operator, which models anomalous diffusion. Our key contributions include the following: (i) reformulation of the original problem into an equivalent fractional integral equation to facilitate analysis; (ii) development of a novel L1 scheme for temporal discretization, which is rigorously proven to realize second-order accuracy in time; (iii) derivation of positive definiteness properties for discrete kernel coefficients; (iv) discretization of the spatial derivative using the classical second-order centered difference scheme, for which its second-order spatial convergence is rigorously verified through numerical experiments (this results in a fully discrete scheme, enabling second-order accuracy in both temporal and spatial dimensions); (v) a fast algorithm leveraging sum-of-exponential approximation, reducing the computational complexity from $O\left(N^2\right)$ to $O(NlogN)$ and memory requirements from $O\left(N\right)$ to $O(logN)$, where N is the number of grid points on a time scale. Our numerical experiments demonstrate the stability of the scheme across diverse parameter regimes and quantify significant gains in computational efficiency. Compared to the direct method, the fast algorithm substantially reduces both memory requirements and CPU time for large-scale simulations. Although a rigorous stability analysis is deferred to subsequent research, the proven properties of the coefficients and numerical validation confirm the scheme’s reliability. Full article

Federated learning (FL) struggles under non-IID client data when local models drift toward conflicting optima, impairing global convergence and performance. We introduce entropy-regularized federated optimization (ERFO), a lightweight client-side modification that augments each local objective with a Shannon entropy penalty on the per-parameter update distribution. ERFO requires no additional communication, adds a single-scalar hyperparameter $\lambda$, and integrates seamlessly into any FedAvg-style training loop. We derive a closed-form gradient for the entropy regularizer and provide convergence guarantees: under $\mu$-strong convexity and L-smoothness, ERFO achieves the same $O(1/T)$ (or linear) rates as FedAvg (with only $O\left(\lambda \right)$ bias for fixed $\lambda$ and exact convergence when ${\lambda }_t\to 0$); in the non-convex case, we prove stationary-point convergence at $O(1/T)$. Empirically, on five-client non-IID splits of the UNSW-NB15 intrusion-detection dataset, ERFO yields a +1.6 pp gain in accuracy and +0.008 in macro-F1 over FedAvg with markedly smoother dynamics. On a three-of-five split of PneumoniaMNIST, a fixed $\lambda$ matches or exceeds FedAvg, FedProx, and SCAFFOLD—achieving 90.3% accuracy and 0.878 macro-F1—while preserving rapid, stable learning. ERFO’s gradient-only design is model-agnostic, making it broadly applicable across tasks. Full article

Standalone photovoltaic (PV) systems offer a viable path to decentralized energy access but face limitations during periods of low solar irradiance. While batteries provide short-term storage, their capacity constraints often restrict the use of surplus energy, highlighting the need for long-duration solutions. Green hydrogen, generated via proton exchange membrane (PEM) electrolyzers, offers a scalable alternative. This study proposes a stochastic energy management framework that leverages a Markov decision process (MDP) to coordinate PV generation, battery storage, and hydrogen production under variable irradiance and uncertain load demand. The strategy dynamically allocates power flows, ensuring system stability and efficient energy utilization. Real-time weather data from Goiás, Brazil, is used to simulate system behavior under realistic conditions. Compared to the conventional perturb and observe (P&O) technique, the proposed method significantly improves system performance, achieving a $99.9\%$ average efficiency (vs. 98.64%) and a drastically lower average tracking error of 0.3125 (vs. 9.8836). This enhanced tracking accuracy ensures faster convergence to the maximum power point, even during abrupt load changes, thereby increasing the effective use of solar energy. As a direct consequence, green hydrogen production is maximized while energy curtailment is minimized. The results confirm the robustness of the MDP-based control, demonstrating improved responsiveness, reduced downtime, and enhanced hydrogen yield, thus supporting sustainable energy conversion in off-grid environments. Full article