Search Results (1,343)

The paper presents a multigrid algorithm with the effective procedure for finding problem-dependent components of smoothers. The discrete Neumann-type boundary value problem is taken as a model problem. To overcome the difficulties caused by the singularity of the coefficient matrix of the resulting system of linear equations, the discrete Neumann-type boundary value problem is solved by direct Gauss elimination on the coarsest level. At finer grid levels, Lavrentiev (shift) regularization is used to construct the approximate solutions of singular or ill-conditioned problems. The regularization parameter for the unperturbed systems can be defined using the proximity of solutions obtained at the coarser grid levels. The paper presents the multigrid algorithm, an analysis of convergence and perturbation errors, a procedure for the definition of the starting guess for the Neumann boundary value problem satisfying the compatibility condition, and an extrapolation of solutions of regularized linear systems. This robust algorithm with the least number of problem-dependent components will be useful in solving the industrial problems. Full article

Aiming at the core problem of high false and missed alarm rate and insufficient interference resistance of existing smoke and fire detection algorithms in complex scenes, this paper proposes a target detection network based on improved feature pyramid structure. By constructing a Context Guided Convolutional Block instead of the traditional convolutional operation, the detected target and the surrounding environment information are fused with secondary features while reconfiguring the feature dimensions, which effectively solves the problem of edge feature loss in the down-sampling process. The Poly Kernel Inception Block is designed, and a multi-branch parallel network structure is adopted to realize multi-scale feature extraction of the detected target, and the collaborative characterization of the flame profile and smoke diffusion pattern is realized. In order to further enhance the logical location sensing ability of the target, a Manhattan Attention Mechanism Unit is introduced to accurately capture the spatial and temporal correlation characteristics of the flame and smoke by establishing a pixel-level long-range dependency model. Experimental tests are conducted using a self-constructed high-quality smoke and fire image dataset, and the results show that, compared with the existing typical lightweight smoke and fire detection models, the present algorithm has a significant advantage in detection accuracy, and it can satisfy the demand for real-time detection. Full article

The permanent magnetic synchronous motor (PMSM) is of significant use for the centrifugal hydrogen compressor (CHC) in the hydrogen fuel cell system. In order to satisfy the demand for improving the CHC’s performance, including higher accuracy, higher response speed, and wider speed range, this paper proposes a novel adaptive super-twisting sliding mode observer (ASTSMO)-based position sensorless control strategy for the highspeed PMSM. Firstly, the super-twisting algorithm (STA) is introduced to the sliding mode observer (SMO) to reduce chattering and improve the accuracy of position estimation. Secondly, to increase the convergence speed, the ASTSMO is extended with a linear correction term, where an extra proportionality coefficient is used to adjust the stator current error under dynamic operation. Finally, a novel adaptive law is designed to solve the PMSM’s problems of wide speed change, wide current variation, and inevitable parameters fluctuation, which are caused by the CHC’s complex working environment like frequent load changes and significant temperature variations. In the experimental verification, the position accuracy and dynamic performance of the PMSM are both improved. It is also proved that the proposed strategy can guarantee the stable operation and fast response of the CHC, so as to maintain the reliability and the hydrogen utilization of the hydrogen fuel cell system. Full article

This paper introduces a lightweight cryptographic hash algorithm, LWH-128, developed using a sponge-based construction and specifically adapted for operation under constrained computational and energy conditions typical of embedded systems and Internet of Things devices. The algorithm employs a two-layer processing structure based on simple logical operations (XOR, cyclic shifts, and S-boxes) and incorporates a preliminary diffusion transformation function G, along with the Davis–Meyer compression scheme, to enhance irreversibility and improve cryptographic robustness. A comparative analysis of hardware implementation demonstrates that LWH-128 exhibits balanced characteristics in terms of circuit complexity, memory usage, and processing speed, making it competitive with existing lightweight hash algorithms. As part of the cryptanalytic evaluation, a Boolean SATisfiability (SAT) Problem-based model of the compression function is constructed in the form of a conjunctive normal form of Boolean variables. Experimental results using the Parkissat SAT solver show an exponential increase in computational time as the number of unknown input bits increased. These findings support the conclusion that the LWH-128 algorithm exhibits strong resistance to preimage attacks based on SAT-solving techniques. Full article

This paper proposes a new accelerated fixed-point algorithm based on a double-inertial extrapolation technique for solving structured variational inclusion and convex bilevel optimization problems. The underlying framework leverages fixed-point theory and operator splitting methods to address inclusion problems of the form $0\in (A+B)(x)$, where A is a cocoercive operator and B is a maximally monotone operator defined on a real Hilbert space. The algorithm incorporates two inertial terms and a relaxation step via a contractive mapping, resulting in improved convergence properties and numerical stability. Under mild conditions of step sizes and inertial parameters, we establish strong convergence of the proposed algorithm to a point in the solution set that satisfies a variational inequality with respect to a contractive mapping. Beyond theoretical development, we demonstrate the practical effectiveness of the proposed algorithm by applying it to data classification tasks using Deep Extreme Learning Machines (DELMs). In particular, the training processes of Two-Hidden-Layer ELM (TELM) models is reformulated as convex regularized optimization problems, enabling robust learning without requiring direct matrix inversions. Experimental results on benchmark and real-world medical datasets, including breast cancer and hypertension prediction, confirm the superior performance of our approach in terms of evaluation metrics and convergence. This work unifies and extends existing inertial-type forward–backward schemes, offering a versatile and theoretically grounded optimization tool for both fundamental research and practical applications in machine learning and data science. Full article

The optimization of beamforming in multi-base station (multi-BS) reconfigurable intelligent surface (RIS)-aided systems is a challenging task due to its high computational complexity. This paper first demonstrates that an optimized multi-BS system exhibits superior communication performance compared to a centralized large-scale single-BS system. To efficiently solve the complex beamforming problem in the multi-BS environment, this paper proposes a novel optimization solver based on a graph neural network (GNN) that models the physical structure of the system. Experimental results show that the proposed GNN solver finds solutions of higher quality, achieving a 42% performance increase with 45% less total computational complexity compared to a conventional iterative optimization method. Furthermore, when compared to other complex AI models such as transformer and Bi-LSTM, the proposed GNN achieves similar state-of-the-art performance while having less than 1% of the parameters and a fraction of the computational cost. These findings demonstrate that the GNN is a powerful, efficient, and practical solution for beamforming optimization in multi-BS RIS-aided systems, satisfying the demands for performance, computational efficiency, and model compactness. Full article

With the advancement of China’s industrialization, demand for express freight transportation has been rising. However, high-speed rail freight faces challenges, such as relatively low transport efficiency and lower revenues, compared with air and road modes. To address these issues, this paper focuses on freight train operations. First, it analyzes key influencing factors, including operating costs and benefits. Next, it conducts a comprehensive assessment of train consist capacity, freight node capacity, transport demand, and the number of freight services, and formulates an operational planning model that maximizes rail revenue, minimizes intermediate stops, and satisfies freight demand. Finally, an Improved Golden Jackal Optimization–based Genetic Algorithm (IGJOGA) is proposed to solve the model. Simulation results indicate that IGJOGA achieves higher solution efficiency than a traditional genetic algorithm for the freight train operation planning problem, and the results can provide a practical reference for freight train set operation schemes. Full article

A Lotka–Volterra-type system with porous diffusion, which can be used as an alternative model to the classical Lotka–Volterra system, is under study. Multiparameter families of exact solutions of the system in question are constructed and their properties are established. It is shown that the solutions obtained can satisfy the zero Neumann conditions, which are typical conditions for mathematical models describing real-world processes. It is proved that the system possesses two stable steady-state points provided its coefficients are correctly specified. In particular, this occurs when the system models the prey–predator interaction. The exact solutions are used for solving boundary-value problems. The analytical results are compared with numerical solutions of the same boundary-value problems but perturbed initial profiles. It is demonstrated that the numerical solutions coincide with the relevant exact solutions with high exactness in the case of sufficiently small perturbations of the initial profiles. Full article

Distributed permutation flowshop scheduling is an NP-hard problem that has become a hot research topic in the fields of optimization and manufacturing in recent years. Multimodal optimization finds multiple global and local optimal solutions of a function. This study proposes a harmony search algorithm with iterative optimization operators to solve the NP-hard problem for multimodal optimization with the objective of makespan minimization. First, the initial solution set is constructed by using a distributed NEH operator. Second, after generating new candidate solutions, efficient iterative optimization operations are applied to optimize these solutions, and the worst solutions in the harmony memory (HM) are replaced. Finally, the solutions that satisfy multimodal optimization of the harmony memory are obtained when the stopping condition of the algorithm is met. The constructed algorithm is compared with three meta-heuristics: the iterative greedy meta-heuristic algorithm with a bounded search strategy, the improved Jaya algorithm, and the novel evolutionary algorithm, on 600 newly generated datasets. The results show that the proposed method outperforms the three compared algorithms and is applicable to solving distributed permutation flowshop scheduling problems in practice. Full article

In this work, we present the procedure to obtain exact spherical shape functions for finite element modeling applications, without resorting to any kind of approximation, for generic prismatic spherical elements and for the case of spherical six-node tri-rectangular and eight-node quadrangular spherical prisms. The proposed spherical shape functions, given in explicit analytical form, are expressed in geographic coordinates, namely colatitude, longitude and distance from the center of the sphere. We demonstrate that our analytical shape functions satisfy all the properties required by this class of functions, deriving at the same time the analytical expression of the Jacobian, which allows us changes in coordinate systems. Within the perspective of volume integration on Earth, entering a variety of geophysical and geodetic problems, as for mass change contribution to gravity, we consider our analytical expression of the shape functions and Jacobian for the six-node tri-rectangular and eight-node quadrangular right spherical prisms as reference volumes to evaluate the volume of generic spherical triangular and quadrangular prisms over the sphere; volume integration is carried out via Gauss–Legendre quadrature points. We show that for spherical quadrangular prisms, the percentage volume difference between the exact and the numerically evaluated volumes is independent from both the geographical position and the depth and ranges from 10⁻³ to lower than 10⁻⁴ for angular dimensions ranging from 1° × 1° to 0.25° × 0.25°. A satisfactory accuracy is attained for eight Gauss–Legendre quadrature points. We also solve the Poisson equation and compare the numerical solution with the analytical solution, obtained in the case of steady-state heat conduction with internal heat production. We show that, even with a relatively coarse grid, our elements are capable of providing a satisfactory fit between numerical and analytical solutions, with a maximum difference in the order of 0.2% of the exact value. Full article

This paper considers the problem of the load frequency control of power systems when system states are not directly available for implementation and in the presence of unknown disturbances. The conventional proportional observer (PO) fails to solve this problem unless the disturbances are known or can be explicitly modeled. Therefore, we provide a detailed analysis of the proportional integral observer (PIO) and its generalization (GPIO) for the load frequency control (LFC) of a single-area power system. This study demonstrates that both observers can be reliably employed, depending on the scenarios of system dynamics. Since they are able to estimate both the states and unknown disturbances, they can be integrated in LFC with disturbance accommodation to ensure the system stability and to satisfy the specified performance measures. Numerical examples are given to illustrate the advantage of GPI observer-based LFC for a single-area power system model. Full article

A multi-objective optimal trajectory planning method is proposed for manipulators in this paper to enhance motion efficiency and to reduce component wear while ensuring motion smoothness. The trajectory is initially interpolated in the joint space by using quintic non-uniform B-splines with virtual points, achieving the C⁴ continuity of joint motion and satisfying dynamic, kinematic, geometric, synchronization, and boundary constraints. The interpolation reformulates the trajectory planning problem into an optimization problem, where the time intervals between desired adjacent waypoints serve as variables. Travelling time and the integral of the squared jerk along the entire trajectories comprise the multi-objective functions. A constrained multi-objective dream optimization algorithm is designed to solve the time–jerk optimal trajectory planning problem and generate Pareto solutions for optimized trajectories. Simulations conducted on 6-DOF manipulators validate the effectiveness and superiority of the proposed method in comparison with existing typical trajectory planning methods. Full article

With the rapid proliferation of Internet of Things (IoT) devices and mobile applications and the growing demand for low-latency services, edge computing has emerged as a transformative paradigm that brings computation and storage closer to end users. However, the dynamic nature and limited resources of edge networks bring challenges such as load imbalance and high latency while satisfying user requests. Service migration, the dynamic redeployment of service instances across distributed edge nodes, has become a key enabler for solving these challenges and optimizing edge network characteristics. Moreover, the low-latency nature of edge computing requires that service migration strategies must be in real time in order to ensure latency requirements. Thus, this paper presents a systematic survey of real-time service migration in edge networks. Specifically, we first introduce four network architectures and four basic models for real-time service migration. We then summarize four research motivations for real-time service migration and the real-time guarantee introduced during the implementation of migration strategies. To support these motivations, we present key techniques for solving the task of real-time service migration and how these algorithms and models facilitate the real-time performance of migration. We also explore latency-sensitive application scenarios, such as smart cities, smart homes, and smart manufacturing, where real-time service migration plays a critical role in sustaining performance and adaptability under dynamic conditions. Finally, we summarize the key challenges and outline promising future research directions for real-time service migration. This survey aims to provide a structured and in-depth theoretical foundation to guide future research on real-time service migration in edge networks. Full article

Carbon cap-and-trade is a practical policy in guiding manufacturers to produce economic and environmental production plans. However, previous studies on carbon cap-and-trade are from a macro level to guide manufacturers to make production plans, rather than from a perspective of specific production scheduling, which leads to a lack of theoretical guidance for manufacturers to develop reasonable production scheduling schemes for specific production orders. This article investigates a specific scheduling problem in a flexible job-shop environment that considers the carbon cap-and-trade policy, aiming to provide guidance for specific production scheduling (i.e., resource allocation). In the proposed problem, carbon emissions have an upper limit. A penalty will be generated if the emissions overpass the predetermined cap. To satisfy the carbon emission cap, the manufacturer can trade carbon credits or adopt outsourcing strategy, that is, outsourcing partial orders to partners at the expense of outsourcing costs. To solve the proposed model, a novel and efficient memetic algorithm (NEMA) is proposed. An initialization method and four local search operators are developed to enhance the search ability. Numerous experiments are conducted and the results validate that NEMA is a superior algorithm in both solution quality and efficiency. Full article

With the rise of the low-altitude urban traffic system, urban air mobility (UAM) has developed rapidly. As a critical component of the UAM system, the strategic layout of vertiports helps divert ground traffic pressure. To satisfy various demand patterns, different vertiport levels are needed, so we focus on the hierarchical vertiport location problem. Considering the capacity limitation, a median location model is established to minimize vertiport construction cost, passenger commuting cost, and penalty cost. For the nonlinear term in the objective function, the Big-M method is employed. Based on the reformulated model, we improve the branch-and-bound algorithm (LVBB) to solve it, where the Lagrange relaxation method is used to decompose the large-scale problem into parallel subproblems and compute the lower bound, and the variable neighborhood search algorithm is used to obtain the upper bound. Numerical experiments are performed in the 11 administrative districts of Nanjing, China. The results demonstrate that the proposed location scheme effectively balances vertiport construction cost and passenger commuting cost while satisfying capacity limitations. It also significantly reduces commuting time to improve passenger satisfaction. This scheme can offer strategic guidance for infrastructure planning in UAM. Full article