Search

The Manta Ray Foraging Optimization Algorithm (MRFO) is a metaheuristic algorithm for solving real-world problems. However, MRFO suffers from slow convergence precision and is easily trapped in a local optimal. Hence, to overcome these deficiencies, this paper proposes an Improved MRFO algorithm (IMRFO) that employs Tent chaotic mapping, the bidirectional search strategy, and the Levy flight strategy. Among these strategies, Tent chaotic mapping distributes the manta ray more uniformly and improves the quality of the initial solution, while the bidirectional search strategy expands the search area. The Levy flight strategy strengthens the algorithm's ability to escape from local optimal. To verify IMRFO's performance, the algorithm is compared with 10 other algorithms on 23 benchmark functions, the CEC2017 and CEC2022 benchmark suites, and five engineering problems, with statistical analysis illustrating the superiority and significance of the difference between IMRFO and other algorithms. The results indicate that the IMRFO outperforms the competitor optimization algorithms. [ABSTRACT FROM AUTHOR]

Pixel‐level labeling of regions of interest in an image is a key step in building a labeled training dataset for supervised deep learning networks of images. However, traditional manual labeling of cancerous regions in digital pathological images by doctors is time‐consuming and inefficient. To address this issue, this paper proposes an automatic labeling method for whole slide images, which combines clustering and edge detection techniques. The proposed method utilizes the multi‐level feature fusion model and the Long‐Short Term Memory network to discriminate the cancerous nature of the whole slide images, thereby improving the classification accuracy of the whole slide images. Subsequently, the automatic labeling of cancerous regions is achieved by integrating a density‐based clustering algorithm and an edge point extraction algorithm, both based on the discriminated results of the cancerous properties of whole slide images. The experimental results demonstrate the effectiveness of the proposed method, which offers an efficient and accurate solution to the challenging task of cancerous region labeling in digital pathological images. [ABSTRACT FROM AUTHOR]

In this paper, the sampling and reconstruction problems in function subspaces of L p (R n) associated with the multi-dimensional special affine Fourier transform (SAFT) are discussed. First, we give the definition of the multi-dimensional SAFT and study its properties including the Parseval's relation, the canonical convolution theorems and the chirp-modulation periodicity. Then, a kind of function spaces are defined by the canonical convolution in the multi-dimensional SAFT domain, the existence and the properties of the dual basis functions are demonstrated, and the L p -stability of the basis functions is established. Finally, based on the nonuniform samples taken on a dense set, we propose an iterative reconstruction algorithm with exponential convergence to recover the signals in a L p -subspace associated with the multi-dimensional SAFT, and the validity of the algorithm is demonstrated via simulations. [ABSTRACT FROM AUTHOR]

In recent years, many image encryption schemes have adopted Hilbert curves for encryption. In this approach, the Hilbert curve is used to encrypt grayscale images by traversal scrambling. However, the correlation between pixels has not been fully considered and those algorithms are not safe enough. To solve this problem, a new image encryption algorithm based on a new chaotic system of 2D-LICM (Two-Dimensional Linear-Infinite-Collapse Chaotic Map) and an improved Hilbert curve is proposed in this paper. First, we propose a new 2D-chaotic system to address the shortcoming that the commonly used chaotic systems are too simple in scope and complexity. Then, a new image encryption algorithm is proposed using the newly designed 2D-LICM and the improved Hilbert curve. The proposed algorithm uses Hilbert curve to reduce the correlation between adjacent pixels of the image at the pixel and bit levels and increase the scrambling and diffusion effects. Simulation and security analysis results show that the proposed scheme has high security and is superior to several advanced image encryption algorithms. [ABSTRACT FROM AUTHOR]

• Dynamics of multi-layer membrane structure with elastic spacers is studied. • An optimization criterion to eliminate the crossing modes is proposed. • The optimal spacer positions are calculated by Particle Swarm Optimizer algorithm. In recent years, there has been a growing interest in the dynamics of space membrane structures. However, existing research primarily focuses on single-layer membrane structures, leaving a significant research gap in the study of multi-layer structures with elastic spacers. To address this gap, this paper studies the dynamics and interlayer spacing accuracy of multi-layer membrane structures with elastic spacers. Specifically, the research focuses on the placement optimization of elastic spacers. A novel optimization criterion for the elastic spacers has been proposed, and the Particle Swarm Optimizer (PSO) algorithm has been utilized to calculate the optimal spacers positions. Results show that optimally placed elastic spacers can eliminate the crossing modes and improve the interlayer spacing accuracy during vibration. [ABSTRACT FROM AUTHOR]

Broad-area lasers (BALs) have found applications in a variety of crucial fields on account of their high output power and high energy transfer efficiency. However, they suffer from poor spatial beam quality due to multi-mode behavior along the waveguide transverse direction. In this paper, we propose a novel metasurface waveguide structure acting as a transverse mode selective back-reflector for BALs. In order to effectively inverse design such a structure, a digital adjoint algorithm is introduced to adapt the considerably large design area and the high degree of freedom. As a proof of the concept, a device structure with a design area of 40 × 20 μm2 is investigated. The simulation results exhibit high fundamental mode reflection (above 90%), while higher-order transverse mode reflections are suppressed below 0.2%. This is, to our knowledge, the largest device structure designed based on the inverse method. We exploited such a device and the method and further investigated the device's robustness and feasibility of the inverse method. The results are elaborately discussed. [ABSTRACT FROM AUTHOR]

The imaging of high-speed high-squint synthetic aperture radar (HSHS-SAR), which is mounted on maneuvering platforms with curved trajectory, is a challenging task due to the existence of 3-D acceleration and the azimuth spatial variability of range migration and Doppler parameters. Although existing imaging algorithms based on linear range walk correction (LRWC) and nonlinear chirp scaling (NCS) can reduce the range–azimuth coupling of the frequency spectrum (FS) and the spatial variability of the Doppler parameter to some extent, they become invalid as the squint angle, speed, and resolution increase. Additionally, most of them ignore the effect of acceleration phase calibration (APC) on NCS, which should not be neglected as resolution increases. For these issues, a modified frequency nonlinear chirp scaling (MFNCS) algorithm is proposed in this paper. The proposed MFNCS algorithm mainly includes the following aspects. First, a more accurate approximation of range model (MAARM) is established to improve the accuracy of the instantaneous slant range history. Second, a preprocessing of the proposed algorithm based on the first range compression, LRWC, and a spatial-invariant APC (SIVAPC) is implemented to eliminate most of the effects of high-squint angle and 3-D acceleration on the FS. Third, a spatial-variant APC (SVAPC) is performed to remove azimuth spatial variability introduced by 3-D acceleration, and the range focusing is accomplished by the bulk range cell migration correction (BRCMC) and extended secondary range compression (ESRC). Fourth, the azimuth-dependent characteristics evaluation based on LRWC, SIVAPC, and SVAPC is completed to derive the MFNCS algorithm with fifth-order chirp scaling function for azimuth compression. Consequently, the final image is focused on the range time and azimuth frequency domain. The experimental simulation results verify the effectiveness of the proposed algorithm. With a curved trajectory, HSHS-SAR imaging is carried out at a 50° geometric squint angle and 500 m × 500 m imaging width. The integrated sidelobe ratio and peak sidelobe ratio of the point targets at the scenario edges approach the theoretical values, and the range-azimuth resolution is 1.5 m × 3.0 m. [ABSTRACT FROM AUTHOR]

Inverse synthetic-aperture radar (ISAR) can achieve precise imaging of targets, which enables precise perception of battlefield information, and it has become one of the most important tasks for radar systems. In multi-target scenarios, a resource scheduling method is required to improve the sensing ability and the overall efficiency of a radar system due to the limited resources. Considering the motion state of the target will change as the observation distance increases and image defocusing can occur due to the prolonged coherence accumulation time and significant changes in the target's motion state, the optimal observation period should be an important consideration factor in the resource scheduling method to further improve the imaging efficiency of radar system, which has not yet been involved in existing research. In this paper, we first derive the expressions of the target's effective rotation angle and the equivalent rotation angular velocity and then define the target's optimal observation period. Then, for multi-target imaging scenarios, we allocate pulse resources within a given time period based on sparse-aperture ISAR imaging technology. An adaptive radar resource scheduling algorithm for multi-target ISAR imaging is proposed, which prioritizes allocating resources based on the optimal observation periods for the targets. In the algorithm, a radar resource scheduling model for multi-target ISAR imaging is established, and a feedback-based closed-loop search optimization method is proposed to solve the model. Finally, the best scheduling strategy can be obtained, which includes imaging task duration and the pulse allocation sequence for each target. Simulation results validate the effectiveness of the algorithm. [ABSTRACT FROM AUTHOR]

Person Re-Identification falls within the scope of computer vision, acting a technique to ascertain the presence of a specified pedestrian within a video or image library. The related research is of great significance in real-world environments such as criminal investigation and statistical analysis of commercial foot traffic and has received extensive attention from the academic community. However, traditional methods such as manual extraction cannot adapt to largescale data volumes, and deep learning-based methods at this stage suffer from interference in complex environments such as similar costumes, perspective changes, and occlusion. Therefore, in this paper, we investigate the above problems. Firstly, we expand the dataset by introducing random erasure-based preprocessing of pedestrian images to enhancing the robustness and generalization capability of neural networks. Secondly, a composite attention mechanism is introduced after the network residual layer to enhance the spatial information capability and feature expression. Finally, the union loss composed of Circle Loss, Ternary Loss, and Cross Entropy Loss was chosen for network training in the loss optimization phase. Findings from the experiments reveal that the improved method proposed in this experiment achieves 96.0%Rank-1 and 88.3%mAP in Market1501, which reflects the validity of the approach proposed in this manuscript, and provides valuable reference suggestions for Person Re-Identification related research. [ABSTRACT FROM AUTHOR]

This paper investigates the finite-time and fixed-time bipartite consensus problem of multiple Euler–Lagrange systems (MELSs) under directed interaction topologies, considering external disturbances. Two novel distributed hierarchical control algorithms are developed to address the challenging problems. Specifically, a new distributed estimator is designed to estimate the states of agents in finite/fixed-time. Moreover, based on the obtained estimations, the finite/fixed-time controller is presented to accomplish the bipartite consensus of the MELSs in the local control layer. By utilizing Lyapunov stability and the nearest neighbor-interactions theory, sufficient conditions for achieving the designed performance of the MELSs are derived. Simulation examples are provided to illustrate the effectiveness of the proposed algorithms. [ABSTRACT FROM AUTHOR]

The performance of a narrowband active noise control (NANC) system can be significantly degraded due to the frequency mismatch (FM). In this paper, the statistical performance of a typical FxLMS-based NANC system in the presence of FM is analyzed in detail. Difference equations governing the system dynamics and closed-form steady-state mean-square error expressions are derived and discussed. The stochastic analysis results reveal that the FM introduces small troublesome sinusoids into the NANC system. The controller has to track these sinusoids to minimize the residual noise, which leads to a serious performance deterioration. As a by-product, the optimal step sizes that minimize the effect of a relatively small FM are also derived. The findings significantly enrich our understanding of the stochastic behavior of the FxLMS algorithm in the presence of FM and also provide some useful information for NANC system design. Extensive simulations are conducted to confirm the validity of the analytical findings. [ABSTRACT FROM AUTHOR]

Tensegrity structures, which consist of tension cables and compression rods, are widely used in various fields. It is particularly important to find the tensegrity with definite geometric configuration for the following research and application. This paper presents a traversal topology-finding method for tensegrity structures based on dynamic programming algorithm and ground structure method. After the designer has given the cable topology, the dynamic programming is adopted to realize the traversal selection of the rod. In order to reduce the traversal space and realize the constraint of rod length type, the rod is classified according to length. Compared with existing topology-finding methods, the algorithm can not only output all feasible topologies but also incorporate structural constraints, such as rod length type and prestressed stability, into the calculation process. Four tensegrity numerical examples illustrate the feasibility and effectiveness of the topology-finding method. [ABSTRACT FROM AUTHOR]

In this paper we consider the fundamental scheduling problem of minimizing the weighted number of tardy jobs on a single machine. We present a simple pseudo polynomial-time algorithm for this problem that improves upon the classical Lawler and Moore algorithm from the late 60's under certain scenarios and parameter settings. Our algorithm uses (max,+)-convolutions as its main tool, exploiting recent improved algorithms for computing such convolutions, and obtains several different running times depending on the specific improvement used. We also provide a related lower bound for the problem under a variant of the well-known Strong Exponential Time Hypothesis (SETH). History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms – Discrete. Funding: This work was supported by the Israel Science Foundation [Grant 1070/20]. [ABSTRACT FROM AUTHOR]

Projecting a vector onto a simplex is a well-studied problem that arises in a wide range of optimization problems. Numerous algorithms have been proposed for determining the projection; however, the primary focus of the literature is on serial algorithms. We present a parallel method that decomposes the input vector and distributes it across multiple processors for local projection. Our method is especially effective when the resulting projection is highly sparse, which is the case, for instance, in large-scale problems with independent and identically distributed (i.i.d.) entries. Moreover, the method can be adapted to parallelize a broad range of serial algorithms from the literature. We fill in theoretical gaps in serial algorithm analysis and develop similar results for our parallel analogues. Numerical experiments conducted on a wide range of large-scale instances, both real world and simulated, demonstrate the practical effectiveness of the method. History: Accepted by Antonio Frangioni, Area Editor for Design & Analysis of Algorithms—Continuous. Funding: This work was supported by the Office of Naval Research [Grant N00014-23-1-2632]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0328) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2022.0328). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

An algorithm for the two-stage robust optimization surgery-to-operating room allocation problem is presented. The second-stage problem is an integer linear program whose convex hull is approximated using three types of specialized valid inequalities and Chvátal-Gomory cuts. The resulting linear relaxation of the second-stage problem is then dualized and integrated into the first-stage problem. The resulting mixed integer linear program, which is an approximation of the original problem, is then solved using a commercial solver. If the solution of this model is not optimal for the second-stage problem, valid inequalities for the second-stage problem are generated, yielding a type of column-generation based approach that we refer to as the sequential follower refinement (SFR) algorithm. Data from an academic medical center are used to compare the computational performance of SFR with the constraint and column generation (C&CG) algorithm, which is the only exact approach that has been specifically applied for this problem in the literature. An extensive numerical study of SFR and its computational characteristics is presented that shows that SFR yields better-quality solutions compared with C&CG, even as the termination criterion of SFR is met much sooner, especially for problems involving higher number of surgeries. History: Accepted by Paul Brooks, Area Editor for Applications in Biology, Medicine, & Healthcare. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0191) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2022.0191). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

This paper considers Bayesian analysis of data from seemingly unrelated regression models whose errors have a distribution that is scale mixtures of normal distributions. A non-iterative Bayesian sampling algorithm is developed to obtain the posterior samples, which eliminates the convergence problems in iterative Markov Chain Monte Carlo (MCMC) approach. The performances of the proposed algorithm are illustrated through simulation studies, and the results show that it appears to outperform the MCMC approach and is time-efficient compared to the existing methods. In the case of outliers, the model selection criteria results indicate that the heavy-tailed SUR models is more robust than the normal SUR models. Also, a real data example is analyzed using the proposed algorithm. [ABSTRACT FROM AUTHOR]

In this paper, a feasible expectation-conditional-maximization (ECM) algorithm is developed for finding the maximum likelihood estimates of parameters of the skew-normal based stochastic frontier model. The closed-form formulas for updating parameters in CM-steps are derived. The proposed methodology is illustrated with simulations and a real data example, where we find the new ECM algorithm outperforms the numerical approach adopted in the previous study. [ABSTRACT FROM AUTHOR]

The traditional golden jackal optimization algorithm (GJO) has slow convergence speed, insufficient accuracy, and weakened optimization ability in the process of finding the optimal solution. At the same time, it is easy to fall into local extremes and other limitations. In this paper, a novel golden jackal optimization algorithm (SCMGJO) combining sine–cosine and Cauchy mutation is proposed. On one hand, tent mapping reverse learning is introduced in population initialization, and sine and cosine strategies are introduced in the update of prey positions, which enhances the global exploration ability of the algorithm. On the other hand, the introduction of Cauchy mutation for perturbation and update of the optimal solution effectively improves the algorithm's ability to obtain the optimal solution. Through the optimization experiment of 23 benchmark test functions, the results show that the SCMGJO algorithm performs well in convergence speed and accuracy. In addition, the stretching/compression spring design problem, three-bar truss design problem, and unmanned aerial vehicle path planning problem are introduced for verification. The experimental results prove that the SCMGJO algorithm has superior performance compared with other intelligent optimization algorithms and verify its application ability in engineering applications. [ABSTRACT FROM AUTHOR]

In this paper, we study the knapsack problem with conflict pair constraints. After a thorough literature survey on the topic, our study focuses on the special case of bipartite conflict graphs. For complete bipartite (multipartite) conflict graphs, the problem is shown to be NP-hard but solvable in pseudo-polynomial time, and it admits an FPTAS. Extensions of these results to more general classes of graphs are also presented. Further, a class of integer programming models for the general knapsack problem with conflict pair constraints is presented, which generalizes and unifies the existing formulations. The strength of the LP relaxations of these formulations is analyzed, and we discuss different ways to tighten them. Experimental comparisons of these models are also presented to assess their relative strengths. This analysis disclosed various strong and weak points of different formulations of the problem and their relationships to different types of problem data. This information can be used in designing special purpose algorithms for KPCC involving a learning component. [ABSTRACT FROM AUTHOR]

This paper proposes a new optimization algorithm for backpropagation (BP) neural networks by fusing integer-order differentiation and fractional-order differentiation, while fractional-order differentiation has significant advantages in describing complex phenomena with long-term memory effects and nonlocality, its application in neural networks is often limited by a lack of physical interpretability and inconsistencies with traditional models. To address these challenges, we propose a mixed integer-fractional (MIF) gradient descent algorithm for the training of neural networks. Furthermore, a detailed convergence analysis of the proposed algorithm is provided. Finally, numerical experiments illustrate that the new gradient descent algorithm not only speeds up the convergence of the BP neural networks but also increases their classification accuracy. [ABSTRACT FROM AUTHOR]

This paper introduces an innovative Particle Swarm Optimization (PSO) Algorithm incorporating Sobol and Halton random number samplings. It evaluates the enhanced PSO's performance against conventional PSO employing Monte Carlo random number samplings. The comparison involves assessing the algorithms across nine benchmark problems and the renowned Travelling Salesman Problem (TSP). The results reveal consistent enhancements achieved by the enhanced PSO utilizing Sobol/Halton samplings across the benchmark problems. Particularly noteworthy are the Sobol-based PSO improvements in iterations and the computational times for the benchmark problems. These findings underscore the efficacy of employing Sobol and Halton random number generation methods to enhance algorithm efficiency. [ABSTRACT FROM AUTHOR]

This paper presents a massively parallel approach of the multilevel fast multipole algorithm (PMLFMA) on homegrown many-core SW26010 cluster of China, noted as (SW-PMLFMA), for 3-D electromagnetic scattering problems. In this approach, the multilevel fast multipole algorithm (MLFMA) octree is first partitioned among management processing elements (MPEs) of SW26010 processors following the ternary partitioning scheme using the message passing interface (MPI). Then, the computationally intensive parts of the PMLFMA on each MPI process, matrix filling, aggregation and disaggregation are accelerated by using all the 64 computing processing elements (CPEs) in the same core group of the MPE via the Athread parallel programming model. Different parallelization strategies are designed for many-core accelerators to ensure a high computational throughput. In coincidence with the special characteristic of local Lagrange interpolation, the compressed sparse row (CSR) and the compressed sparse column (CSC) sparse matrix storage format is used for storing interpolation and anterpolation matrices, respectively, together with a specially designed cache mechanism of hybrid dynamic and static buffers using the scratchpad memory (SPM) to improve data access efficiency. Numerical results are included to demonstrate the efficiency and versatility of the proposed method. The proposed parallel scheme is shown to have excellent speedup. [ABSTRACT FROM AUTHOR]

Effective resource allocation is a crucial aspect in improving the performance of visible light communication (VLC)/hybrid WiFi networks. This study presents a dynamic resource allocation algorithm for multiuser scenarios. A fuzzy logic technique is employed to select the network resources with higher scores for communication. In this sense, to ensure fairness in the hybrid VLC-WiFi network, an enhanced proportional fairness (PF) algorithm is utilized. The algorithm considers the access delay and the distance to the access point as users move, striking a reasonable balance between fair allocation of user resources and maximizing system resource utilization. Therefore, to enhance the user experience in real-time scheduling, a compensation factor is introduced to compensate users with higher latency, increasing their priority. A thorough analysis is provided for the throughput, latency, utility value, and fairness models of the VLC-WiFi heterogeneous network system. The algorithm proposed in this paper is simulated and compared with four traditional algorithms, namely the Round-Robin algorithm, maximum carrier to interference ratio (Max C/I) algorithm, modified largest weighted delay first algorithm, and PF algorithm, under different metrics. Simulation results show that the proposed method is effective, and the improved algorithm yields better fairness and higher throughput compared to the conventional algorithm. As the number of frames increases, the fairness index of the proposed algorithm increases the fastest and gradually converges to 1. The throughput of this method is significantly greater than that of previous algorithms, reaching a stable rate of roughly 1.3 Mbps. The suggested algorithm is approximately 150% higher than the throughput achieved by conventional PF algorithms. The algorithm improves user satisfaction in different regions, and the utility value remains around 0.975. The packet loss rate is approximately 75% lower than traditional typical algorithms, and the average latency is approximately 60% lower. Simulation results show that the proposed algorithm has good application prospects in heterogeneous networks. [ABSTRACT FROM AUTHOR]

Arithmetic optimization algorithm (AOA) is a meta-heuristic optimization method based on mathematical operators proposed in recent years. Although it has good performance, it can also lead to insufficient local search ability and falling into local optima when solving complex optimization problems. In order to make up for the above shortcomings, the optimization performance of AOA is further improved. This paper proposes a hybrid algorithm based on AOA and particle swarm optimization (PSO) called HAOAPSO. Firstly, a compound opposition-based learning (COBL) strategy is introduced to broaden the scope of finding optimal solutions to help the algorithm better jump out of local optima. Secondly, PSO is combined with AOA that integrates COBL to improve the algorithm's local search ability, so as to improve the overall search efficiency of the algorithm. In addition, experiments are performed on 23 classical benchmark functions with different characteristics and five engineering design optimization problems, and the experimental results of HAOAPSO are compared with those of other well-known optimization algorithms to comprehensively evaluate the performance of the proposed algorithm. The simulation results show that HAOAPSO can provide better solutions in most cases when solving global optimization problems such as engineering, with better convergence speed and accuracy. [ABSTRACT FROM AUTHOR]

As a classical combinatorial optimization problem, the traveling salesman problem (TSP) has been extensively investigated in the fields of Artificial Intelligence and Operations Research. Due to being NP-complete, it is still rather challenging to solve both effectively and efficiently. Because of its high theoretical significance and wide practical applications, great effort has been undertaken to solve it from the point of view of intelligent search. In this paper, we propose a two-stage probe-based search optimization algorithm for solving both symmetric and asymmetric TSPs through the stages of route development and a self-escape mechanism. Specifically, in the first stage, a reasonable proportion threshold filter of potential basis probes or partial routes is set up at each step during the complete route development process. In this way, the poor basis probes with longer routes are filtered out automatically. Moreover, four local augmentation operators are further employed to improve these potential basis probes at each step. In the second stage, a self-escape mechanism or operation is further implemented on the obtained complete routes to prevent the probe-based search from being trapped in a locally optimal solution. The experimental results on a collection of benchmark TSP datasets demonstrate that our proposed algorithm is more effective than other state-of-the-art optimization algorithms. In fact, it achieves the best-known TSP benchmark solutions in many datasets, while, in certain cases, it even generates solutions that are better than the best-known TSP benchmark solutions. [ABSTRACT FROM AUTHOR]

In the dynamic landscape of cyberspace, organizations face a myriad of coordinated advanced threats that challenge the traditional defense paradigm. Cyber Threat Intelligence (CTI) plays a crucial role, providing in-depth insights into adversary groups and enhancing the detection and neutralization of complex cyber attacks. However, attributing attacks poses significant challenges due to over-reliance on malware samples or network detection data alone, which falls short of comprehensively profiling attackers. This paper proposes an IPv4-based threat attribution model, IPAttributor, that improves attack characterization by merging a real-world network behavior dataset comprising 39,707 intrusion entries with commercial threat intelligence from three distinct sources, offering a more nuanced context. A total of 30 features were utilized from the enriched dataset for each IP to create a feature matrix to assess the similarities and linkage of associated IPs, and a dynamic weighted threat segmentation algorithm was employed to discern attacker communities. The experiments affirm the efficacy of our method in pinpointing attackers sharing a common origin, achieving the highest accuracy of 88.89%. Our study advances the relatively underexplored line of work of cyber attacker attribution, with a specific interest in IP-based attribution strategies, thereby enhancing the overall understanding of the attacker's group regarding their capabilities and intentions. [ABSTRACT FROM AUTHOR]

List intersection plays a pivotal role in various domains such as search engines, database systems, and social networks. Efficient indexes and query strategies can significantly enhance the efficiency of list intersection. Existing inverted index-based algorithms fail to utilize the length information of documents and require excessive list intersections, resulting in lower efficiency. To address this issue, in this paper, we propose the LDRpV (Length-based Document Reordering plus Verification) algorithm. LDRpV filters out documents that are unlikely to satisfy the intersection results by reordering documents based on their length, thereby reducing the number of candidates. Additionally, to minimize the number of list intersection operations, an intersection and verification strategy is designed, where only the first m lists are intersected, and the resulting candidate set is directly verified. This approach effectively improves the efficiency of list intersection. Experimental results on four real datasets demonstrate that LDRpV can achieve a maximum efficiency improvement of 46.69% compared to the most competitive counterparts. [ABSTRACT FROM AUTHOR]

With the rapid increase in smart grid users and the increasing cost of user data transmission, proposing an encryption method that does not increase the construction cost while increasing the user ceiling has become the focus of many scholars. At the same time, the increase in users will also lead to more security problems, and it is also necessary to solve the privacy protection for users during information transmission. In order to solve the above problems, this paper proposes an aggregated ring encryption scheme based on the SM2 algorithm with special features, referred to as SM2-CLARSC, based on the certificateless ring signcryption mechanism and combining with the aggregate signcryption. SM2-CLARSC is designed to satisfy the basic needs of the smart grid, and it can be resistant to replay attacks, forward security and backward security, etc. It has better security and higher efficiency than existing solutions. Comparing SM2-CLARSC with existing typical solutions through simulation, the result proves that this solution has more comprehensive functions, higher security, and significant computational efficiency improvement. [ABSTRACT FROM AUTHOR]

The reentry trajectory planning problem of hypersonic vehicles is generally a continuous and nonconvex optimization problem, and it constitutes a critical challenge within the field of aerospace engineering. In this paper, an improved sequential convexification algorithm is proposed to solve it and achieve online trajectory planning. In the proposed algorithm, the Chebyshev pseudo-spectral method with high-accuracy approximation performance is first employed to discretize the continuous dynamic equations. Subsequently, based on the multipliers and linearization methods, the original nonconvex trajectory planning problem is transformed into a series of relaxed convex subproblems in the form of an augmented Lagrange function. Then, the interior point method is utilized to iteratively solve the relaxed convex subproblem until the expected convergence precision is achieved. The convex-optimization-based and multipliers methods guarantee the promotion of fast convergence precision, making it suitable for online trajectory planning applications. Finally, numerical simulations are conducted to verify the performance of the proposed algorithm. The simulation results show that the algorithm possesses better convergence performance, and the solution time can reach the level of seconds, which is more than 97% less than nonlinear programming algorithms, such as the sequential quadratic programming algorithm. [ABSTRACT FROM AUTHOR]

This study aims to present a comparative analysis of the Bayesian regularization backpropagation and Levenberg–Marquardt training algorithms in neural networks for the metrics prediction of damaged archaeological artifacts, of which the state of conservation is often fragmented due to different reasons, such as ritual, use wear, or post-depositional processes. The archaeological artifacts, specifically laminar blanks (so-called blades), come from different sites located in the Southern Levant that belong to the Pre-Pottery B Neolithic (PPNB) (10,100/9500–400 cal B.P.). This paper shows the entire procedure of the analysis, from its normalization of the dataset to its comparative analysis and overfitting problem resolution. [ABSTRACT FROM AUTHOR]

The Neutrosophic Numeral System Algorithms are a set of techniques designed to handle uncertainty and ambiguity in numerical data. These algorithms use Neutrosophic Set Theory, a mathematical framework that deals with incomplete, indeterminate, and inconsistent information. In this paper, we provide an overview of different approaches used in Neutrosophic Numeral System Algorithms, including Neutrosophic Binary System, Neutrosophic Decimal System, and Neutrosophic Octal System. These systems use different bases and representations to account for degrees of truth, indeterminacy, and falsity in numerical data. We also explore the relationship between Neutrosophic Numeral System Algorithms and Number Neutrosophic Systems, which are another type of Neutrosophic System used for representing numerical data. Number Neutrosophic Systems use Neutrosophic Numbers to represent degrees of truth, indeterminacy, and falsity in numerical data, and they can be used in conjunction with Neutrosophic Numeral System Algorithms to handle uncertainty and ambiguity in decision-making and artificial intelligence applications. Moreover. We discuss the advantages and disadvantages of each algorithm and their potential applications in various fields. Finally, we highlight the importance of Neutrosophic cryptography in addressing uncertainty and ambiguity in decision making and artificial intelligence and discuss future research directions. Understanding Neutrosophic Numeral System Algorithms and their relationship with Number Neutrosophic Systems is crucial for developing effective techniques for handling uncertainty and ambiguity in numerical data in decision-making, pattern recognition, and artificial intelligence applications. [ABSTRACT FROM AUTHOR]

The Shortest path problem is highly relevant in our daily lives, addressing uncertainties like traffic conditions and weather variations. To handle such uncertainties, we utilize Fuzzy Numbers. This paper focuses on Bipolar Neutrosophic Fuzzy Numbers, which have dual positive and negative aspects. They provide a robust framework for representing arc (node/edge) weights, signifying uncertain travel times between nodes. Importantly, these weights can change over time in bipolar neutrosophic fuzzy graphs. Our study introduces an extended Bellman-Ford Algorithm for identifying optimal paths and minimum times with time-dependent Bipolar Neutrosophic Fuzzy arc weights. We demonstrate its effectiveness through a step-by-step numerical example and conduct a comparative analysis to evaluate its efficiency. [ABSTRACT FROM AUTHOR]

In this paper, elliptic control problems with the integral constraint on the gradient of the state and the box constraint on the control are considered. The optimality conditions for the problem are proved. To numerically solve the problem, a finite element duality-based inexact majorized accelerated block coordinate descent (FE-dABCD) algorithm is proposed. Specifically, both the state and the control are discretized by piecewise linear functions. An inexact majorized ABCD algorithm is employed to solve the discretized problem via its dual, which is a multi-block unconstrained convex optimization problem, but the primal variables are also generated in each iteration. Thanks to the inexactness of the FE-dABCD algorithm, the subproblems at each iteration are allowed to be solved inexactly. For the smooth subproblem, we use the preconditioned generalized minimal residual (GMRES) method to solve it. For the two nonsmooth subproblems, one of them has a closed form solution through introducing an appropriate proximal term, and another one is solved by the line search Newton's method. Based on these efficient strategies, we prove that our proposed FE-dABCD algorithm enjoys O (1 k 2 ) iteration complexity. Moreover, to make the algorithm more efficient and further reduce its computation cost, based on the mesh-independence of ABCD method, we propose an FE-dABCD algorithm with a warm-start strategy (wFE-dABCD). Some numerical experiments are done and the numerical results show the efficiency of the FE-dABCD algorithm and wFE-dABCD algorithm. [ABSTRACT FROM AUTHOR]

Two key challenges in optimal control include efficiently solving high-dimensional problems and handling optimal control problems with state-dependent running costs. In this paper, we consider a class of optimal control problems whose running costs consist of a quadratic on the control variable and a convex, non-negative, piecewise affine function on the state variable. We provide the analytical solution for this class of optimal control problems as well as a Hopf-type representation formula for the corresponding Hamilton-Jacobi partial differential equations. Finally, we propose efficient numerical algorithms based on our Hopf-type representation formula, convex optimization algorithms, and min-plus techniques. We present several high-dimensional numerical examples, which demonstrate that our algorithms overcome the curse of dimensionality. We also describe a field-programmable gate array (FPGA) implementation of our numerical solver whose latency scales linearly in the spatial dimension and that achieves approximately a 40 times speedup compared to a parallelized central processing unit (CPU) implementation. Thus, our numerical results demonstrate the promising performance boosts that FPGAs are able to achieve over CPUs. As such, our proposed methods have the potential to serve as a building block for solving more complicated high-dimensional optimal control problems in real-time. [ABSTRACT FROM AUTHOR]

This paper analyzes a parareal approach based on fractional-step methods for the nonstationary Navier-Stokes equations. As an efficient parallel computing framework, the coarse propagator often determines the performance of the parareal algorithm. We present a parareal algorithm using the fractional-step method, a very efficient time discrete scheme for the Naiver-Stokes equations, as the coarse propagator for the Navier-Stokes equations. Then we give the specific stability and convergence analysis of this specific parareal algorithm. Finally, numerical experiments are done to show efficiency and illustrate the theoretical results. [ABSTRACT FROM AUTHOR]

This study describes a laboratory model of a battery energy storage system (BESS) designed for testing algorithms aimed at reducing peak power consumption in railway traction substations. The system comprises a DC/DC converter and battery energy storage. This article details a laboratory model of a bidirectional buck-boost DC/DC converter, which is used to transfer energy between the battery energy storage and a DC line. It presents an analysis of DC/DC converter systems along with simulation studies. Furthermore, the results of laboratory tests on the DC/DC converter model are also provided. The control algorithm of the system in the traction substation is focused on reducing peak power, offering benefits such as lower charges for the railway operator due to the possibility of reducing contracted power requirements. From the perspective of the power grid, the reduction in power fluctuations and, consequently, voltage sags, is advantageous. This paper includes a description of a hardware simulator for verifying the system's control algorithms. The verification of the control algorithms was performed through experimental tests conducted on a laboratory model (a hardware simulator) of the system for dynamic load reduction in traction substations, on a power scale of 1:1000 (5.5 kW). The experimental tests on the laboratory model (hardware simulator) demonstrated the effectiveness of the algorithm in reducing the peak power drawn from the power source. [ABSTRACT FROM AUTHOR]

In recent years, there has been a significant development in unmanned platform technologies, specifically unmanned ground vehicles (UGVs) and unmanned aerial vehicles (UAVs). As a result, their application scenarios have expanded considerably. Unmanned platforms are considered integral components of the Internet of Things system. However, certain challenges arise when dealing with specialized tasks, such as navigating complex urban low-altitude terrain with multiple obstacles and limited communication capabilities. These challenges can greatly impact the efficiency of the system due to information isolation. To address this issue, a messenger drone mechanism is introduced in this paper, which utilizes air superiority to facilitate indirect communication between unmanned platforms. Additionally, a task sequence planning algorithm based on sampling transformation is designed. This algorithm efficiently assigns the drone to mobile UGVs by discretely sampling their paths and considering the UAV-UGV motion relationship. By transforming the problem into an asymmetric traveler problem, it allows for a fast solution. Finally, the effectiveness of the algorithm is verified through comparative analysis in different scenarios. [ABSTRACT FROM AUTHOR]

Sub-Nyquist synthetic aperture radar (SAR) based on pseudo-random time–space modulation has been proposed to increase the swath width while preserving the azimuthal resolution. Due to the sub-Nyquist sampling, the scene can be recovered by an optimization-based algorithm. However, these methods suffer from some issues, e.g., manually tuning difficulty and the pre-definition of optimization parameters, and a low signal–noise ratio (SNR) resistance. To address these issues, a reweighted optimization algorithm, named pseudo-ℒ0-norm optimization algorithm, is proposed for the sub-Nyquist SAR system in this paper. A modified regularization model is first built by applying the scene prior information to nearly acquire the number of nonzero elements based on Bayesian estimation, and then this model is solved by the Cauchy–Newton method. Additionally, an error correction method combined with our proposed pseudo-ℒ0-norm optimization algorithm is also present to eliminate defocusing in the motion-induced model. Finally, experiments with simulated signals and strip-map TerraSAR-X images are carried out to demonstrate the effectiveness and superiority of our proposed algorithm. [ABSTRACT FROM AUTHOR]

Delay-sensitive task offloading in a device-to-device assisted mobile edge computing (D2D-MEC) system with energy harvesting devices is a critical challenge due to the dynamic load level at edge nodes and the variability in harvested energy. In this paper, we propose a joint dynamic task offloading and CPU frequency control scheme for delay-sensitive tasks in a D2D-MEC system, taking into account the intricacies of multi-slot tasks, characterized by diverse processing speeds and data transmission rates. Our methodology involves meticulous modeling of task arrival and service processes using queuing systems, coupled with the strategic utilization of D2D communication to alleviate edge server load and prevent network congestion effectively. Central to our solution is the formulation of average task delay optimization as a challenging nonlinear integer programming problem, requiring intelligent decision making regarding task offloading for each generated task at active mobile devices and CPU frequency adjustments at discrete time slots. To navigate the intricate landscape of the extensive discrete action space, we design an efficient multi-agent DRL learning algorithm named MAOC, which is based on MAPPO, to minimize the average task delay by dynamically determining task-offloading decisions and CPU frequencies. MAOC operates within a centralized training with decentralized execution (CTDE) framework, empowering individual mobile devices to make decisions autonomously based on their unique system states. Experimental results demonstrate its swift convergence and operational efficiency, and it outperforms other baseline algorithms. [ABSTRACT FROM AUTHOR]

High-quality eye-tracking data are crucial in behavioral sciences and medicine. Even with a solid understanding of the literature, selecting the most suitable algorithm for a specific research project poses a challenge. Empowering applied researchers to choose the best-fitting detector for their research needs is the primary contribution of this paper. We developed a framework to systematically assess and compare the effectiveness of 13 state-of-the-art algorithms through a unified application interface. Hence, we more than double the number of algorithms that are currently usable within a single software package and allow researchers to identify the best-suited algorithm for a given scientific setup. Our framework validation on retrospective data underscores its suitability for algorithm selection. Through a detailed and reproducible step-by-step workflow, we hope to contribute towards significantly improved data quality in scientific experiments. [ABSTRACT FROM AUTHOR]

This paper addresses the resource allocation (RA) for ultra‐dense network (UDN), where base stations (BSs) are densely deployed to meet the demands of future wireless communications. However, the design of RA in UDN is challenging, as the RA problem is non‐convex and NP‐hard. Therefore, this paper considers and studies a semi‐distributed resource block (RB) allocation scheme, in order to achieve a well‐balanced trade‐off between performance and complexity. In the context of semi‐distributed RB allocation scheme, the problem can be decomposed into the subproblem of clustering and the subproblem of cluster‐based RB allocation. We first improve the K‐means clustering algorithm by employing the Gaussian modified method, which can significantly decrease the number of iterations for carrying out the K‐means algorithm as well as the failure possibility of clustering. Then, bat algorithm (BA) is introduced to attack the problem of cluster‐based RB allocation. In order to make the original BA applicable to the problem of RB allocation, chaotic sequences are adopted to discretize the initial position of the bats, and simultaneously increase the population diversity of the bats. Furthermore, in order to speed up the convergence of BA, the logarithmic decreasing inertia weight is employed for improving the original BA. Our studies and performance results show that the proposed approaches are capable of achieving a desirable trade‐off between the performance and the implementation complexity. [ABSTRACT FROM AUTHOR]

This paper introduces N-bipolar hypersoft (N-BHS) sets, a versatile extension of bipolar hypersoft (BHS) sets designed to effectively manage evaluations encompassing both binary and non-binary data, thereby exhibiting heightened versatility. The major contributions of this framework are twofold: Firstly, the N-BHS set introduces a parameterized representation of the universe, providing a nuanced and finite granularity in perceiving attributes, thereby distinguishing itself from conventional binary BHS sets and continuous fuzzy BHS sets. Secondly, this model signifies a new area of research aimed at overcoming limitations inherent in the N-bipolar soft set when handling multi-argument approximate functions. Through the strategic partitioning of attributes into distinct subattribute values using disjoint sets, the N-BHS set emerges as a powerful tool for effectively addressing uncertainty-related problems. In pursuit of these objectives, the paper outlines various algebraic definitions, including incomplete N-BHS sets, efficient N-BHS sets, normalized N-BHS sets, equivalence under normalization, N-BHS complements, and BHS sets derived from a threshold, exemplified through illustrative examples. Additionally, the article explores set-theoretic operations within the N-BHS sets framework, such as relative null/whole N-BHS sets, N-BHS subsets, and two distinct approaches to N-BHS extended/restricted union and intersection. Finally, it proposes and compares decision-making methodologies regarding N-BHS sets, including a comprehensive comparison with relevant existing models. [ABSTRACT FROM AUTHOR]

This paper aims to propose a table tennis target detection (TD) method based on deep learning (DL) and multi-scale feature fusion (MFF) to improve the detection accuracy of the ball in table tennis competition, optimize the training process of athletes, and improve the technical level. In this paper, DL technology is used to improve the accuracy of table tennis TD through MFF guidance. Initially, based on the FAST Region-based Convolutional Neural Network (FAST R-CNN), the TD is carried out in the table tennis match. Then, through the method of MFF guidance, different levels of feature information are fused, which improves the accuracy of TD. Through the experimental verification on the test set, it is found that the mean Average Precision (mAP) value of the target detection algorithm (TDA) proposed here reaches 87.3%, which is obviously superior to other TDAs and has higher robustness. The DL TDA combined with the proposed MFF can be applied to various detection fields and can help the application of TD in real life. [ABSTRACT FROM AUTHOR]

With the rapid development of AI and big data mining technologies, computerized medical decision-making has become increasingly prominent. The aim of high-utility pattern mining (HUPM) is to discover meaningful patterns in medical databases that contribute to maximizing the utility from the perspective of diagnosis. However, HUPM pays less attention to the interpretability and explainability of these patterns in medical decision-making scenarios. This paper proposes a novel algorithm called the Improved fuzzy high-utility pattern mining (IF-HUPM) to address this problem. First, the paper applies a fuzzy preprocessing method to divide the fuzzy intervals of a medical quantitative data set, which enhances the fuzziness and interpretability of the data. Next, in the process of IF-HUPM, both fuzzy tree and list structures are employed to calculate fuzzy high-utility values. By combining the characteristics of the one-stage and two-stage algorithms of HUPM, an adaptive-phase Fuzzy HUPM hybrid frame is proposed. The experimental results demonstrate that the proposed IF-HUPM algorithm enhances both accuracy and efficiency and the mining process requires less time and space on average. [ABSTRACT FROM AUTHOR]

In process discovery, the goal is to find, for a given event log, the model describing the underlying process. While process models can be represented in a variety of ways, Petri nets form a theoretically well-explored description language and are therefore often used. In this paper, we extend the eST-Miner process discovery algorithm. The eST-Miner computes a set of Petri net places which are considered to be fitting with respect to a certain fraction of the behavior described by the given event log as indicated by a given noise threshold. It evaluates all possible candidate places using token-based replay. The set of replayable traces is determined for each place in isolation, i.e., these sets do not need to be consistent. This allows the algorithm to abstract from infrequent behavioral patterns occurring only in some traces. However, when combining places into a Petri net by connecting them to the corresponding uniquely labeled transitions, the resulting net can replay exactly those traces from the event log that are allowed by the combination of all inserted places. Thus, inserting places one-by-one without considering their combined effect may result in deadlocks and low fitness of the Petri net. In this paper, we explore adaptions of the eST-Miner, that aim to select a subset of places such that the resulting Petri net guarantees a definable minimal fitness while maintaining high precision with respect to the input event log. Furthermore, current place evaluation techniques tend to block the execution of infrequent activity labels. Thus, a refined place fitness metric is introduced and thoroughly investigated. In our experiments we use real and artificial event logs to evaluate and compare the impact of the various place selection strategies and place fitness evaluation metrics on the returned Petri net. [ABSTRACT FROM AUTHOR]

With the rapid development of remote sensing technology, remote sensing products have found increasingly widespread applications across various fields. Nevertheless, as the volume of remote sensing image data continues to grow, traditional data retrieval techniques have encountered several challenges such as substantial query results, data overlap, and variations in data quality. Users need to manually browse and filter a large number of remote sensing datasets, which is a cumbersome and inefficient process. In order to cope with these problems of traditional remote sensing image retrieval methods, this paper proposes a remote sensing image retrieval algorithm for dense data (DD-RSIRA). The algorithm establishes evaluation metrics based on factors like imaging time, cloud coverage, and image coverage. The algorithm utilizes the global grids to create an ensemble coverage relation between images and grids. A locally optimal initial solution is obtained by a greedy algorithm, and then a local search is performed to search for the optimal solution by combining the strategies of weighted gain-loss scheme and novel mechanism. Ultimately, it achieves an optimal coverage of remote sensing images within the region of interest. In this paper, it is shown that the method obtains a smaller number of datasets with lower redundancy and higher data utilization and ensures the data quality to a certain extent in order to accurately meet the requirements of the regional coverage of remote sensing images. [ABSTRACT FROM AUTHOR]

Aiming at the problems of low accuracy, false detection, missed detection, and low real-time detection of current traffic sign detection, this paper proposes an improved traffic sign detection algorithm based on the YOLOv8s algorithm. Firstly, this paper proposes a double-layer semicomposite backbone network structure (DSCB), which uses the auxiliary backbone network to extract features, and then transmits the extracted features to the backbone network to enhance the ability of the backbone network to extract target features. At the same time, the deformable convolution is integrated into the DC2f structure of the auxiliary backbone network to enhance the generalization performance of the network. Secondly, the coordinate attention mechanism is used after the SPPF layer. The coordinate attention mechanism can better retain the coordinate position information of small targets, reduce the miss rate of the model, and increase detection accuracy. Finally, this paper introduces a new CAB module to learn and aggregate the output of each layer of the feature pyramid for global spatial context to enhance the feature representation ability further. The experimental results show that the improved algorithm achieves 90.51% detection accuracy, 82.00% recall rate, 89.51% mAP@0.5 on the TT100K dataset, and the FPS reaches 106. Compared with the original algorithm model, the detection accuracy is increased by 2.27%, and the recall rate is increased by 2.48%. mAP@0.5 is increased by 2.01%, and FPS is increased by 1. The improved traffic sign detection algorithm meets the requirements in detection accuracy and real-time detection. [ABSTRACT FROM AUTHOR]

Deep learning is proliferating within the field of computer vision. Road damage detection technology, as its offshoot, already plays vital role in road maintenance and traffic safety. With road damage such as potholes and cracks, accurate and efficient detection results are essential for timely road safety repair and maintenance. Therefore, road damage detection algorithms based on deep learning have attracted wide attention. YOLOv5 is an advanced target detection algorithm known for its efficient detection speed and good accuracy. However, there is still room for further improvement in its performance for road damage detection. The ability of multi-scale damage detection and spatial structure capture is not perfect. Therefore, this paper proposes three improvement points to improve the accuracy of road damage detection based on YOLOv5. The first introduced module is the Non-linear Spatial Pyramidal Pooling-Fast (NSPPF) module. This module allows for better capture of detailed features of road damage areas. Non-linear transformation and fast pyramid operation improve the sensing ability and multi-scale damage detection ability. Secondly, a combination of the CoordConv and SK attention modules is constructed. The CoordConv module fuses coordinate information with features to provide a more spatially informed representation. The SK attention module also learns correlations between global and local features, enhancing the model's ability to detect damages at different scales. This paper can better capture road injuries' spatial structure and context information by combining these two modules. Finally, experimental results on the RDD2020 dataset demonstrate the effectiveness of our model. Compared to the baseline model, the proposed improvement algorithm increases the accuracy by 2.2%, resulting in a mAP of 58.2%. This demonstrates its effectiveness and feasibility. [ABSTRACT FROM AUTHOR]

This paper presents an algorithm for organizing and grouping data related to the expenditures by education levels in Bulgaria. The built database is used as a source from which the necessary information is searched depending on the entered indicators and time interval. The considered indicators include the public and private expenditures by education levels for the period2012-2020. The extracted subsets of elements are processed and analyzed. In this connection, four groups of variables are calculated and discussed. The results show that the expenditures in four of the education levels (primaryand pre-primary education as well as upper and lower secondary education) grow over the last five years (2016-2020). The quoted indicator inpost-secondary, non-tertiary education isreduced gradually in 2016-2019. During 2015, as compared to 2014, the expenditures in the considered 7 levels of education decreased in the range from 0.29% to 7.81%. This work calculates the share of expenditure for tertiary educationbachelor, master and doctor in comparison with the total expenditures for education in the indicatedtime period. The obtained value of the variable for this education level is the highest. It is 29.74%. The values of this variable are significantly lower for the following two levels of education - tertiary education-professional bachelor and postsecondary, non-tertiary education. They are 1.54% and 0.29% respectively. [ABSTRACT FROM AUTHOR]

This paper presents a new type of monorail rapid transit vehicle, which can operate in formation. In order to optimize the dynamic performance of the formation vehicles when passing through the small radius curve, this paper first analyzes the structure of the new monorail rapid transit vehicle, and establishes the vehicle dynamic model and multibody dynamics simulation model. Then the improved artificial potential field algorithm is used to build the formation vehicle operation controller. Finally, the dynamic performance evaluation index of the new monorail rapid transit formation vehicle is formulated, and the formation vehicle passing through the small radius curve scene is simulated. The simulation results show that the controller of the formation vehicle with dynamic optimization control can effectively optimize the load transfer coefficient of running wheels, unbalanced centrifugal acceleration and roll angle of vehicle body when passing through the curve. Through this control method, the dynamic performance of formation vehicles passing through small radius curve lines can be optimized. [ABSTRACT FROM AUTHOR]