Search

The author presents comments on a paper on the use of machine learning to support the system dynamics method. Topics discussed include its interpretation of simulation models and explanation of policy analysis, and the emerging view whereby dynamic problems from endogenous feedback structures can be tackled via wider tools and methodological approaches. Also noted is the resulting potential for greater insights into the modelling process.

The aim of this paper is to introduce and assess three algorithms for the identification of overlapping thematic structures in networks of papers. We implemented three recently proposed approaches to the identification of overlapping and hierarchical substructures in graphs and applied the corresponding algorithms to a network of 492 information-science papers coupled via their cited sources. The thematic substructures obtained and overlaps produced by the three hierarchical cluster algorithms were compared to a content-based categorisation, which we based on the interpretation of titles, abstracts, and keywords. We defined sets of papers dealing with three topics located on different levels of aggregation: h-index, webometrics, and bibliometrics. We identified these topics with branches in the dendrograms produced by the three cluster algorithms and compared the overlapping topics they detected with one another and with the three predefined paper sets. We discuss the advantages and drawbacks of applying the three approaches to paper networks in research fields. [ABSTRACT FROM AUTHOR]

This work describes the log-MAP (BCJR) algorithm implementation of a close to capacity dirty paper coding CODEC. The CODEC consists of eight deep pipeline processors. It decodes blocks of 975 bits in 26.9 ms using less than 9.7% of low-cost FPGA (and no DSP blocks). Two pipelines, for alpha and beta, calculate the values of gamma (of the BCJR) to reduce the storage requirements. The final log-likelihood ratio (LLR) is calculated together with alpha, reusing intermediate results. The number of bits used by the different signals of the processor is easily configurable. It was set to six bits to the channel measure signals and eight bits to log of probability signals like alpha, beta, and others. The CODEC clock was 100 MHz. The achieved bit rate is 36.2 Kbps per CODEC, but multiple CODECs can be fit into a single chip. The CODEC is 3.49 dB from the channel capacity. [ABSTRACT FROM AUTHOR]

We study the quadratic cycle cover problem (QCCP), which aims to find a node-disjoint cycle cover in a directed graph with minimum interaction cost between successive arcs. We derive several semidefinite programming (SDP) relaxations and use facial reduction to make these strictly feasible. We investigate a nontrivial relationship between the transformation matrix used in the reduction and the structure of the graph, which is exploited in an efficient algorithm that constructs this matrix for any instance of the problem. To solve our relaxations, we propose an algorithm that incorporates an augmented Lagrangian method into a cutting-plane framework by utilizing Dykstra's projection algorithm. Our algorithm is suitable for solving SDP relaxations with a large number of cutting-planes. Computational results show that our SDP bounds and efficient cutting-plane algorithm outperform other QCCP bounding approaches from the literature. Finally, we provide several SDP-based upper bounding techniques, among which is a sequential Q-learning method that exploits a solution of our SDP relaxation within a reinforcement learning environment. Summary of Contribution: The quadratic cycle cover problem (QCCP) is the problem of finding a set of node-disjoint cycles covering all the nodes in a graph such that the total interaction cost between successive arcs is minimized. The QCCP has applications in many fields, among which are robotics, transportation, energy distribution networks, and automatic inspection. Besides this, the problem has a high theoretical relevance because of its close connection to the quadratic traveling salesman problem (QTSP). The QTSP has several applications, for example, in bioinformatics, and is considered to be among the most difficult combinatorial optimization problems nowadays. After removing the subtour elimination constraints, the QTSP boils down to the QCCP. Hence, an in-depth study of the QCCP also contributes to the construction of strong bounds for the QTSP. In this paper, we study the application of semidefinite programming (SDP) to obtain strong bounds for the QCCP. Our strongest SDP relaxation is very hard to solve by any SDP solver because of the large number of involved cutting-planes. Because of that, we propose a new approach in which an augmented Lagrangian method is incorporated into a cutting-plane framework by utilizing Dykstra's projection algorithm. We emphasize an efficient implementation of the method and perform an extensive computational study. This study shows that our method is able to handle a large number of cuts and that the resulting bounds are currently the best QCCP bounds in the literature. We also introduce several upper bounding techniques, among which is a distributed reinforcement learning algorithm that exploits our SDP relaxations. [ABSTRACT FROM AUTHOR]

To facilitate better interpretation of dielectric response measurements--thereby directing numerical evidence for condition assessments of oil-paper-insulated equipment in high-voltage alternating current (HVAC) transmission systems--a novel approach is presented to estimate the parameters in the extended Debye model (EDM) using wideband frequency domain spectroscopy (FDS). A syncretic algorithm that integrates a genetic algorithm (GA) and the Levenberg-Marquardt (L-M) algorithm is introduced in the present study to parameterize EDM using the FDS measurements of a real-life 126 kV oil-impregnated paper (OIP) bushing under different controlled temperatures. As for the uncertainty of the EDM structure due to variable branch quantity, Akaike's information criterion (AIC) is employed to determine the model orders. For verification, comparative analysis of FDS reconstruction and results of FDS transformation to polarization--depolarization current (PDC)/return voltage measurement (RVM) are presented. The comparison demonstrates good agreement between the measured and reconstructed spectroscopies of complex capacitance and tan δover the full tested frequency band (10-4 Hz-10³ Hz) with goodness of fit over 0.99. Deviations between the tested and modelled PDC/RVM from FDS are then discussed. Compared with the previous studies to parameterize the model using time domain dielectric responses, the proposed method solves the problematic matching between EDM and FDS especially in a wide frequency band, and therefore assures a basis for quantitative insulation condition assessment of OIP-insulated apparatus in energy systems. [ABSTRACT FROM AUTHOR]

Accurate and timely forecasting of critical components is pivotal in intelligent transportation systems and traffic management, crucially mitigating congestion and enhancing safety. This paper aims to comprehensively review deep learning algorithms and classical models employed in traffic forecasting. Spanning diverse traffic datasets, the study encompasses various scenarios, offering a nuanced understanding of traffic forecasting methods. Reviewing 111 seminal research works since the 1980s, encompassing both deep learning and classical models, the paper begins by detailing the data sources utilized in transportation systems. Subsequently, it delves into the theoretical underpinnings of prevalent deep learning algorithms and classical models prevalent in traffic forecasting. Furthermore, it investigates the application of these algorithms and models in forecasting key traffic characteristics, informed by their utility in transport and traffic analyses. Finally, the study elucidates the merits and drawbacks of proposed models through applied research in traffic forecasting. Findings indicate that while deep learning algorithms and classic models serve as valuable tools, their suitability varies across contexts, necessitating careful consideration in future studies. The study underscores research opportunities in road traffic forecasting, providing a comprehensive guide for future endeavors in this domain. [ABSTRACT FROM AUTHOR]

Simultaneous Localization and Mapping (SLAM) enables mobile robots to autonomously perform localization and mapping tasks in unknown environments. Despite significant progress achieved by visual SLAM systems in ideal conditions, relying solely on a single robot and point features for mapping in large-scale indoor environments with weak-texture structures can affect mapping efficiency and accuracy. Therefore, this paper proposes a multi-robot collaborative mapping method based on point-line fusion to address this issue. This method is designed for indoor environments with weak-texture structures for localization and mapping. The feature-extraction algorithm, which combines point and line features, supplements the existing environment point feature-extraction method by introducing a line feature-extraction step. This integration ensures the accuracy of visual odometry estimation in scenes with pronounced weak-texture structure features. For relatively large indoor scenes, a scene-recognition-based map-fusion method is proposed in this paper to enhance mapping efficiency. This method relies on visual bag of words to determine overlapping areas in the scene, while also proposing a keyframe-extraction method based on photogrammetry to improve the algorithm's robustness. By combining the Perspective-3-Point (P3P) algorithm and Bundle Adjustment (BA) algorithm, the relative pose-transformation relationships of multi-robots in overlapping scenes are resolved, and map fusion is performed based on these relative pose relationships. We evaluated our algorithm on public datasets and a mobile robot platform. The experimental results demonstrate that the proposed algorithm exhibits higher robustness and mapping accuracy. It shows significant effectiveness in handling mapping in scenarios with weak texture and structure, as well as in small-scale map fusion. [ABSTRACT FROM AUTHOR]

This paper proposes a deep learning-based intelligent detection device for insulation pull rod defects, addressing the issues of low detection accuracy, poor timeliness of intelligent analysis, and the difficulty in preserving detection results. Firstly, by constructing the pull rod defects dataset and training the YOLOv5s network, along with commonly used object detection algorithms in industrial defect detection, the feasibility of deep learning networks for insulation pull rod defects detection is explored. Secondly, the trained model is combined to build an intelligent detection device for pull rod defects, integrating insulation pull rod image acquisition and defect detection into a unified system. The research results demonstrate that the YOLOv5s network can quickly and accurately detect pull rod defects. On the test set constructed in this paper, the detection performance metric mAP@0.5:0.95 of the trained model reached 54.7%. Specifically, the mAP@0.5 score was 86.9% at a threshold of 0.5. The detection speed FPS reached 169.5, significantly improving the detection efficiency and accuracy compared to traditional object detection algorithms. By establishing an organic connection between the image hardware acquisition device and the deep learning network, the existing problems of inefficient detection and difficult storage of detection results in pull rod defects detection methods are effectively addressed. This research provides new insights for detecting insulation pull rod defects. [ABSTRACT FROM AUTHOR]

This paper focuses on optimizing the radiation pattern of sparse array antennas using reinforcement learning, with many algorithms. The paper aims to leverage Proximal Policy Optimization’s (PPO’s) advantages in optimization and its effectiveness in handling stochastic transitions and rewards to achieve a reduced number of elements while maintaining desired signal performance and minimizing unnecessary side lobe signals. By removing a few of the antennas using reinforcement learning and PPO optimization, the same results as a complete array have been obtained. The anticipated outcomes of this research hold the promise of significantly enhancing the effectiveness and utility of sparse array antennas in communication systems. [ABSTRACT FROM AUTHOR]

This paper proposes a predictive power control strategy for the three‐phase, six‐switch Vienna rectifier without grid voltage sensors to reduce the hardware cost and complexity of a high‐power PWM rectifier system. Firstly, an algorithm for calculating the AC‐side voltage in the αβ coordinate system is derived according to the operating principle of the Vienna rectifier, and a voltage observer is constructed by combining a second‐order low‐pass filter to estimate the grid voltage. Secondly, a soft start method is designed to solve the problem that the rectifier is prone to inrush current when it is started. Furthermore, the control method of grid voltage sensorless is combined with predictive power control with good dynamic characteristics and simple parameter settings to form the control strategy proposed in this paper. Finally, simulation analysis and experimental verification are carried out on the proposed control strategy. Simulation and experimental results show that the grid voltage estimation has high accuracy, a good surge current suppression effect, unit power factor operation, low input current harmonic content, and good dynamic and steady‐state performance. Therefore, the correctness and effectiveness of the strategy proposed in this paper are verified. [ABSTRACT FROM AUTHOR]

Most image quality assessment (IQA) algorithms based on sparse representation primarily focus on amplitude information, often overlooking the structural composition of images. However, structural composition is closely linked to perceived image quality, a connection that existing methods do not adequately address. To fill this gap, this paper proposes a novel distorted-image quality assessment algorithm based on a sparse structure and subjective perception (IQA-SSSP). This algorithm evaluates the quality of distorted images by measuring the sparse structure similarity between a reference and distorted images. The proposed method has several advantages. First, the sparse structure algorithm operates with reduced computational complexity, leading to faster processing speeds, which makes it suitable for practical applications. Additionally, it efficiently handles large-scale data, further enhancing the assessment process. Experimental results validate the effectiveness of the algorithm, showing that it achieves a high correlation with human visual perception, as reflected in both objective and subjective evaluations. Specifically, the algorithm yielded a Pearson correlation coefficient of 0.929 and a mean squared error of 8.003, demonstrating its robustness and efficiency. By addressing the limitations of existing IQA methods and introducing a more holistic approach, this paper offers new perspectives on IQA. The proposed algorithm not only provides reliable quality assessment results but also closely aligns with human visual experience, thereby enhancing both the objectivity and accuracy of image quality evaluations. This research offers significant theoretical support for the advancement of sparse representation in IQA. [ABSTRACT FROM AUTHOR]

This paper presents a fast focusing inversion algorithm of magnetic data based on the conjugate gradient method, which can be used to describe the underground target geologic body efficiently and clearly. The proposed method realizes an effect similar to matrix compression by changing the computation order, calculating the inner product of vectors and equivalent expansion of expressions. Model tests show that this strategy successfully reduces the computation time of a single iteration of the conjugate gradient method, so the three-dimensional magnetic data inversion is realized under a certain number of iterations. In this paper, the detailed calculation steps of the proposed inversion method are given, and the effectiveness and high efficiency of the proposed fast focusing inversion method are verified by three theoretical model tests and a set of measured data. Finally, the fast focus inversion algorithm is applied to the magnetic data of Gonghe Basin, Qinghai Province, to describe the spatial distribution range of deep hot dry rock, which provides a direction for the continuous exploration of geothermal resources in this area. [ABSTRACT FROM AUTHOR]

Process discovery aims to discover process models from event logs to describe actual business processes. The quality of event logs has an impact on the quality of process models, so preprocessing methods can be used to improve the quality of event logs. Chaotic activities may exist in real business scenarios, and the occurrence of chaotic activities is independent of other activities in the process and can occur at any location in the event log at any frequency. Therefore, chaotic activities seriously affect the model quality of process discovery. Filtering chaotic activities in event logs can effectively improve the quality of event logs and thus improve the quality of process models. The traditional chaotic activity filtering algorithm makes it difficult to balance accuracy and time performance. Therefore, a direct method for filtering chaotic activities is proposed in this paper. By analyzing the relationship between activities, chaotic activities are identified in the log according to the characteristics of chaotic activities and the direct following relationship of activities as the judgment condition, and the filtering of chaotic activities in the event log is realized. In addition, this paper proposes an indirect chaotic activity filtering method, which identifies and filters chaotic activities in the log by analyzing the influence of the existence of different activities on the overall chaos degree of the log. The proposed method is compared with the traditional chaotic activity filtering method on several simulation/real data sets, and the accuracy and running time between the multi-group event logs and the process models generated before and after chaotic activity filtering are analyzed, further verifying the effectiveness and feasibility of the proposed method. By summarizing the experimental results, it is found that the accuracy of the proposed chaotic activity filtering methods is greater than that of the frequency-based filtering method and is close to that of the entropy-based chaotic activity filtering methods. Moreover, compared with other filtering methods used in the experiment, the chaotic activity filtering method proposed in this paper can improve the efficiency by 23.4% on average for simulation logs, and by 84.25% on average for real event logs. It is concluded that compared with other filtering methods, the proposed chaotic activity filtering methods have higher accuracy and can effectively improve the time performance of chaotic activity filtering. Therefore, the chaotic activity filtering method proposed in this paper can balance the accuracy and time performance, and can ensure the integrity of the filtered event log to a certain extent. [ABSTRACT FROM AUTHOR]

This paper introduces a UWB-based human-following system for polar-exploration robots, integrating obstacle and crevasse avoidance functions to enhance the safety and efficiency of explorers in extreme environments. The proposed system determines the relative position of the explorer using UWB anchors and tags. It also utilizes real-time local obstacle mapping and path-planning algorithms to find safe paths that avoid collisions with obstacles. Simulation and real-world experiments confirm that the proposed system operates effectively in polar environments, reducing the operational burden on explorers and increasing mission success rates. [ABSTRACT FROM AUTHOR]

In order to improve the reading efficiency of pointer meter, this paper proposes a reading method based on LinkNet. Firstly, the meter dial area is detected using YOLOv8. Subsequently, the detected images are fed into the improved LinkNet segmentation network. In this network, we replace traditional convolution with partial convolution, which reduces the number of model parameters while ensuring accuracy is not affected. Remove one pair of encoding and decoding modules to further compress the model size. In the feature fusion part of the model, the CBAM (Convolutional Block Attention Module) attention module is added and the direct summing operation is replaced by the AFF (Attention Feature Fusion) module, which enhances the feature extraction capability of the model for the segmented target. In the subsequent rotation correction section, this paper effectively addresses the issue of inaccurate prediction by CNN networks for axisymmetric images within the 0–360° range, by dividing the rotation angle prediction into classification and regression steps. It ensures that the final reading part receives the correct angle of image input, thereby improving the accuracy of the overall reading algorithm. The final experimental results indicate that our proposed reading method has a mean absolute error of 0.20 and a frame rate of 15. [ABSTRACT FROM AUTHOR]

Human pose estimation is an important task in computer vision, which can provide key point detection of human body and obtain bone information. At present, human pose estimation is mainly utilized for detection of large targets, and there is no solution for detection of small targets. This paper proposes a multi-channel spatial information feature based human pose (MCSF-Pose) estimation algorithm to address the issue of medium and small targets inaccurate detection of human key points in scenarios involving occlusion and multiple poses. The MCSF-Pose network is a bottom-up regression network. Firstly, an UP-Focus module is designed to expand the feature information while reducing parameter computation during the up-sampling process. Then, the channel segmentation strategy is adopted to cut the features, and the feature information of multiple dimensions is retained through different convolutional groups, which reduces the parameter lightweight network model and makes up for the loss of the feature information associated with the depth of the network. Finally, the three-layer PANet structure is designed to reduce the complexity of the model. With the aid of the structure, it also to improve the detection accuracy and anti-interference ability of human key points. The experimental results indicate that the proposed algorithm outperforms YOLO-Pose and other human pose estimation algorithms on COCO2017 and MPII human pose datasets. [ABSTRACT FROM AUTHOR]

Effective path planning is crucial for autonomous mobile robots navigating complex environments. The "global–local" coupled path planning algorithm exhibits superior global planning capabilities and local adaptability. However, these algorithms often fail to fully realize their potential due to low efficiency and excessive constraints. To address these issues, this study introduces a simpler and more effective integration strategy. Specifically, this paper proposes using a bi-layer map and a feasible domain strategy to organically combine the D*Lite algorithm with the Dynamic Window Approach (DWA). The bi-layer map effectively reduces the number of nodes in global planning, enhancing the efficiency of the D*Lite algorithm. The feasible domain strategy decreases constraints, allowing the local algorithm DWA to utilize its local planning capabilities fully. Moreover, the cost functions of both the D*Lite algorithm and DWA have been refined, enabling the fused algorithm to cope with more complex environments. This paper conducts simulation experiments across various settings and compares our method with A_DWA, another "global–local" coupled approach, which combines A* and DWA. D_DWA significantly outperforms A_DWA in complex environments, despite a 7.43% increase in path length. It reduces the traversal of risk areas by 71.95%, accumulative risk by 80.34%, global planning time by 26.98%, and time cost by 35.61%. Additionally, D_DWA outperforms the A_Q algorithm, a coupled approach validated in real-world environments, which combines A* and Q-learning, achieving reductions of 1.34% in path length, 67.14% in traversal risk area, 78.70% in cumulative risk, 34.85% in global planning time, and 37.63% in total time cost. The results demonstrate the superiority of our proposed algorithm in complex scenarios. [ABSTRACT FROM AUTHOR]

Cloud model similarity algorithm is an important part of cloud modelling theory. Most of the existing cloud model similarity algorithms suffer from poor discriminability, poor classification, unstable results, and low time efficiency. In this paper, a new similarity algorithm is proposed that considers the triangular cloud model distance and shape. First, according to the D T distance formula, a new exponential closeness measure is defined, with which the distance similarity of cloud models is characterized. Then, the shape similarity is calculated according to the variance of the cloud model cloud drops. Finally, the two similarities are synthesized to define a similarity algorithm for determining the distance from the D T distance formula and shape based on the triangular cloud model (DDTSTCM). In this paper, discriminability, stability, efficiency and theoretical interpretability are taken as the evaluation indices. Equipment security system capability evaluation experiment, cloud model differentiation simulation experiment and time series classification accuracy experiment are set up to verify the effectiveness of the algorithm in terms of the four above aspects. The experimental results show that DDTSTCM has good differentiation and excellent classification effects. In the classification experiment for the time series, the average classification accuracy of DDTSTCM reaches 91.78%, which is at least 2.78% higher than those of the other seven commonly used algorithms. The CPU running efficiency of DDTSTCM is also extremely high, and the average CPU running time of group training is always on the order of milliseconds, which effectively reduces the time cost. Finally, a case study is conducted to analyse a risk assessment problem for China's island microgrid industry, and the evaluation results based on DDTSTCM are in line with human cognition and have good value for engineering applications. [ABSTRACT FROM AUTHOR]

Clouds are crucial in regulating the Earth's energy budget. Global cloud top heights have been easily retrieved from satellite measurements, but there are few methods for determining cloud base height (CBH) from satellite measurements. The Cloud Base Altitude Spatial Extrapolator (CBASE) algorithm was proposed to derive the height of the lower-troposphere liquid cloud base by using the Cloud-Aerosol Lidar with Orthogonal polarization cloud aerosol LiDAR (CALIOP) profiles and weather observations at airports from aviation routine and special weather report (METARs and SPECIs, called METAR) observation data in the United States. A modification to the CBASE algorithm over China (CNMETAR-CBASE) is presented in this paper. In this paper, the ability of the CBASE algorithm to calculate CBH in China is evaluated, and METAR observations over China (CNMETAR) were then used to modify the CBASE algorithm. The results including CNMETAR observation data in China can better retrieve CBH over China compared with the results using the original CBASE algorithm, and the accuracy of the global CBH results has been improved. Overestimations of CBH with the original algorithm range from 500 to 800 m in China, which have been reduced to about 300 m with an improved algorithm. The deviations calculated by the algorithm also have a significant reduction, from 480 m (CBASE) to 420 m (CNMETAR-CBASE). In conclusion, the modified CBASE algorithm not only calculates the CBH more accurately in China but also improves the results of the global CBH retrieved from satellites. [ABSTRACT FROM AUTHOR]

The adoption of blockchain platforms to bolster the security of Internet of Things (IoT) systems has attracted significant attention in recent years. Currently, there is a lack of comprehensive and systematic survey papers in the literature addressing these platforms. This paper discusses six of the most popular emerging blockchain platforms adopted by IoT systems and analyses their usage in state-of-the-art works to solve security problems. The platform was compared in terms of security features and other requirements. Findings from the study reveal that most blockchain components contribute directly or indirectly to IoT security. Blockchain platform components such as cryptography, consensus mechanism, and hashing are common ways that security is achieved in all blockchain platform for IoT. Technologies like Interplanetary File System (IPFS) and Transport Layer Security (TLS) can further enhance data and communication security when used alongside blockchain. To enhance the applicability of blockchain in resource-constrained IoT environments, future research should focus on refining cryptographic algorithms and consensus mechanisms to optimise performance and security. [ABSTRACT FROM AUTHOR]

The ability to make informed decisions in complex scenarios is crucial for intelligent automotive systems. Traditional expert rules and other methods often fall short in complex contexts. Recently, reinforcement learning has garnered significant attention due to its superior decision-making capabilities. However, there exists the phenomenon of inaccurate target network estimation, which limits its decision-making ability in complex scenarios. This paper mainly focuses on the study of the underestimation phenomenon, and proposes an end-to-end autonomous driving decision-making method based on an improved TD3 algorithm. This method employs a forward camera to capture data. By introducing a new critic network to form a triple-critic structure and combining it with the target maximization operation, the underestimation problem in the TD3 algorithm is solved. Subsequently, the multi-timestep averaging method is used to address the policy instability caused by the new single critic. In addition, this paper uses Carla platform to construct multi-vehicle unprotected left turn and congested lane-center driving scenarios and verifies the algorithm. The results demonstrate that our method surpasses baseline DDPG and TD3 algorithms in aspects such as convergence speed, estimation accuracy, and policy stability. [ABSTRACT FROM AUTHOR]

This paper improves the timeliness of satellite mission planning to cope with the rapid response to changes. In this paper, satellite mission planning is investigated. Firstly, the satellite dynamics model and mission planning model are established, and an improved Monte Carlo tree (Improved-MCTS) algorithm is proposed, which utilizes the Monte Carlo tree search in combination with the state uncertainty network (State-UN) to reduce the time of exploring the nodes (At the MCTS selection stage, the exploration of nodes specifically refers to the algorithm needing to decide whether to choose nodes that have already been visited (exploitation) or nodes that have not been visited yet (exploration)). The results show that this algorithm performs better in terms of profit (in this paper, the observation task is given a weight of 0–1, and each planned task will receive a profit; that is, a profit will be assigned at the initial moment) and convergence speed compared to the ant colony algorithm (ACO) and the asynchronous advantage actor critic (A3C). [ABSTRACT FROM AUTHOR]

Aiming at the problem that the SSD algorithm does not fully extract the feature information contained in each feature layer, as well as the feature information is easily lost during the sampling process, which makes the feature expression ineffective and leads to insufficient performance in small target detection. In this paper, AMT-SSD is proposed, a small target detection algorithm that incorporates the multi-branch stacking and new sampling transition module of the attention mechanism. In this algorithm, the composite attention mechanism is utilized to improve the correlation of features of the samples to be detected in terms of spatial and channels, and the efficiency of the algorithm; secondly, multi-branch stacking module is used to extract multi-size features for each feature layer, and different sizes of convolution kernels are utilized in parallel to fully extract their features and improve the expression of features; meanwhile, during the sampling process, the problem of missing features is solved by applying inverse subpixel convolution in the new sampling transition module. Experimentally, the AMT-SSD algorithm achieves 84.6% and 53.4% mAP metrics on the PASCAL VOC dataset and MS COCO dataset, respectively. This indicates that the AMT-SSD algorithm can effectively extract feature information that is beneficial to detection samples, and also performs well in reducing feature loss, which is effective for the algorithm to improve the algorithm on small targets. [ABSTRACT FROM AUTHOR]

The method of partial differential equations for image inpainting achieves better repair results and is economically feasible with fast repair time. Addresses the inability of Curvature-Driven Diffusion (CDD) models to repair complex textures or edges when the input image is affected by severe noise or distortion, resulting in discontinuous repair features, blurred detail textures, and an inability to deal with the consistency of global image content, In this paper, we have the CDD model of P-Laplace operator term to image inpainting. In this method, the P-Laplace operator is firstly introduced into the diffusion term of CDD model to regulate the diffusion speed; then the improved CDD model is discretized, and the known information around the broken region is divided into two weighted average iterations to get the inpainting image; finally, the final inpainting image is obtained by weighted averaging the two image inpainting images according to the distancing. Experiments show that the model restoration results in this paper are more rational in terms of texture structure and outperform other models in terms of visualization and objective data. Comparing the inpainting images with 150, 1000 and 100 iterations respectively, Total Variation(TV) model and the CDD model inpainting algorithm always has inpainting traces in details, and TV model can't meet the visual connectivity, but the algorithm in this paper can remove the inpainting traces well, TV model and the CDD model inpainting algorithm always have inpainting traces in details, and TV model can't meet the visual connectivity, but the algorithm in this paper can remove the inpainting traces well. Of the images used for testing, the highest PSNR reached 38.7982, SSIM reached 0.9407, and FSIM reached 0.9781, the algorithm not only inpainting the effect and, but also has fewer iterations. [ABSTRACT FROM AUTHOR]

In autonomous driving, the fusion of multiple sensors is considered essential to improve the accuracy and safety of 3D object detection. Currently, a fusion scheme combining low-cost cameras with highly robust radars can counteract the performance degradation caused by harsh environments. In this paper, we propose the IRBEVF-Q model, which mainly consists of BEV (Bird's Eye View) fusion coding module and an object decoder module.The BEV fusion coding module solves the problem of unified representation of different modal information by fusing the image and radar features through 3D spatial reference points as a medium. The query in the object decoder, as a core component, plays an important role in detection. In this paper, Heat Map-Guided Query Initialization (HGQI) and Dynamic Position Encoding (DPE) are proposed in query construction to increase the a priori information of the query. The Auxiliary Noise Query (ANQ) then helps to stabilize the matching. The experimental results demonstrate that the proposed fusion model IRBEVF-Q achieves an NDS of 0.575 and a mAP of 0.476 on the nuScenes test set. Compared to recent state-of-the-art methods, our model shows significant advantages, thus indicating that our approach contributes to improving detection accuracy. [ABSTRACT FROM AUTHOR]

Publicly available ionograms are often in the form of pictures. This paper proposes a novel algorithm for extracting and repairing the F layer traces from pictorial ionograms. Extensive efforts have been invested in ionogram autoscaling and critical parameter identification to improve the efficiency of scaling algorithms. To obtain the parameters of the F layer automatically, it is necessary to accurately extract the F layer trace. However, research on F layer trace extraction with repair is relatively limited. The method employed in this study makes full use of the characteristics of different types of echoes on the ionograms, and the procedure includes noise preprocessing, coupling noise processing, and trace repair. To enhance the applicability of the repair, two different automatic filling algorithms are adopted to repair the F layer trace. The aim of this paper is to present an adaptive algorithm to automatically extract and repair F layer traces from different pictorial ionograms. The results of Hainan Fuke ionograms illustrate the reliability of the F layer trace extraction and trace repair. [ABSTRACT FROM AUTHOR]

Lane detection is an essential task for autonomous vehicles. Deep learning-based lane detection methods are leading development in this sector. This paper proposes an algorithm named Deep Learning-based Lane Detection (DLbLD), a Convolutional Neural Network (CNN)-based lane detection algorithm. The presented paradigm deploys CNN to detect line features in the image block, predict a point on the lane line part, and project all the detected points for each frame into one-dimensional form before applying K-mean clustering to assign points to related lane lines. Extensive tests on different benchmarks were done to evaluate the performance of the proposed algorithm. The results demonstrate that the introduced DLbLD scheme achieves state-of-the-art performance, where F1 scores of 97.19 and 79.02 have been recorded for TuSimple and CU-Lane benchmarks, respectively. Nevertheless, results indicate the high accuracy of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Aiming at the problem that the traditional rapidly exploring random tree (RRT) algorithm only considers the global path of unmanned vehicles in a static environment, which has the limitation of not being able to avoid unknown dynamic obstacles in real time, and that the traditional dynamic window approach (DWA) algorithm is prone to fall into a local optimum during local path planning, this paper proposes a path planning method for unmanned vehicles that integrates improved RRT and DWA algorithms. The RRT algorithm is improved by introducing strategies such as target-biased random sampling, adaptive step size, and adaptive radius node screening, which enhance the efficiency and safety of path planning. The global path key points generated by the improved RRT algorithm are used as the subtarget points of the DWA algorithm, and the DWA algorithm is optimized through the design of an adaptive evaluation function weighting method based on real-time obstacle distances to achieve more reasonable local path planning. Through simulation experiments, the fusion algorithm shows promising results in a variety of typical static and dynamic mixed driving scenarios, can effectively plan a path that meets the driving requirements of an unmanned vehicle, avoids unknown dynamic obstacles, and shows higher path optimization efficiency and driving stability in complex environments, which provides strong support for an unmanned vehicle's path planning in complex environments. [ABSTRACT FROM AUTHOR]

This paper presents a valley path planning algorithm based on the Hybrid A* algorithm. This algorithm is aimed at finding the valley path for aircraft considering dynamics constraints and terrain limitations. The preliminaries involve the establishment of a 3D workspace based on digital elevation map (DEM) data and addressing methods of valley detection. Following this comprehensive groundwork, the Hybrid A*-based algorithm, employed to determine the valley path within the 3D workspace while accommodating dynamic constraints and terrain limitations, is then introduced. In the experimental test, to validate the effectiveness of the algorithm proposed in this paper, we tested the performance of the proposed algorithm and other three baseline algorithms based on four optimization objectives in three workspaces. The simulated results indicate that the algorithm proposed in this paper can effectively find the valley path while considering dynamic constraints and terrain limitations. [ABSTRACT FROM AUTHOR]

The integration of machine learning (ML) techniques into marketing strategies has become increasingly relevant in modern business. Utilizing scientific manuscripts indexed in the Scopus database, this article explores how this integration is being carried out. Initially, a focused search is undertaken for academic articles containing both the terms "machine learning" and "marketing" in their titles, which yields a pool of papers. These papers have been processed using the Supabase platform. The process has included steps like text refinement and feature extraction. In addition, our study uses two key ML methodologies: topic modeling through NMF and a comparative analysis utilizing the k-means clustering algorithm. Through this analysis, three distinct clusters emerged, thus clarifying how ML techniques are influencing marketing strategies, from enhancing customer segmentation practices to optimizing the effectiveness of advertising campaigns. [ABSTRACT FROM AUTHOR]

Oblique photography is a regional digital surface model generation technique that can be widely used for building 3D model construction. However, due to the lack of geometric and semantic information about the building, these models make it difficult to differentiate more detailed components in the building, such as roofs and balconies. This paper proposes a deep learning-based method (U-NET) for constructing 3D models of low-rise buildings that address the issues. The method ensures complete geometric and semantic information and conforms to the LOD2 level. First, digital orthophotos are used to perform building extraction based on U-NET, and then a contour optimization method based on the main direction of the building and the center of gravity of the contour is used to obtain the regular building contour. Second, the pure building point cloud model representing a single building is extracted from the whole point cloud scene based on the acquired building contour. Finally, the multi-decision RANSAC algorithm is used to segment the building detail point cloud and construct a triangular mesh of building components, followed by a triangular mesh fusion and splicing method to achieve monolithic building components. The paper presents experimental evidence that the building contour extraction algorithm can achieve a 90.3% success rate and that the resulting single building 3D model contains LOD2 building components, which contain detailed geometric and semantic information. [ABSTRACT FROM AUTHOR]

This research paper presents a comprehensive study of the simultaneous localization and mapping (SLAM) algorithm for robot localization and navigation in unknown environments. The SLAM algorithm is a widely used approach for building a map of an environment and estimating the robot's position within it, which is especially useful in dynamic and unstructured environments. The paper discusses various SLAM techniques, including the Kalman filter (KF) and GraphSLAM algorithms, and their use in probabilistic estimation of the robot's position and orientation. The paper also explores different path-planning techniques that can be used with the map created by the SLAM algorithm to generate collision-free paths for the robot to navigate toward its goal. The paper also discusses recent advances in deep learning-based SLAM algorithms and their applications in indoor navigation with ORB and RGB-D cameras. The research concludes that SLAM-based robot localization and navigation algorithms are a promising approach for robots navigating in unstructured environments and present various opportunities for future research. [ABSTRACT FROM AUTHOR]

In the field of risk assessment, the traditional econometric models are generally used to assess credit risk. And with the introduction of the "dual-carbon" goals to promote the development of a low-carbon economy, the scale of green credit in China has rapidly expanded. But with the advent of the big data era, due to the poor interpretability of a traditional single machine learning model, it is difficult to capture nonlinear relationships, and there are shortcomings in prediction accuracy and robustness. This paper selects the adjusted ensemble learning model based on the homogeneous and heterogeneous factors for user default prediction, which can efficiently process large quantities of high-dimensional data. This article adjusts each model to adapt to the task and innovatively compares various models. In this paper, the missing value filling method, feature selection, and ensemble model are studied and discussed, and the optimal ensemble model is obtained. When comparing the predictions of single models and ensemble models, the accuracy, sensitivity, specificity, F1-Score, Kappa, and MCC of Categorical Features Gradient Boosting (CatBoost) and Random undersampling Boosting (RUSBoost) all reach 100%. The experimental results prove that the algorithm based on adjusted homogeneous and heterogeneous ensemble learning can predict the user default efficiently and accurately. This paper also provides some references for establishing a risk assessment index system. [ABSTRACT FROM AUTHOR]

Efficient multiprocessor scheduling is pivotal in optimizing the performance of parallel computing systems. This paper leverages the power of Petri nets and the tool GPenSIM to model and simulate a variety of multiprocessor scheduling algorithms (the basic algorithms such as first come first serve, shortest job first, and round robin, and more sophisticated schedulers like multi-level feedback queue and Linux's completely fair scheduler). This paper presents the evaluation of three crucial performance metrics in multiprocessor scheduling (such as turnaround time, response time, and throughput) under various scheduling algorithms. However, the primary focus of the paper is to develop a robust simulation platform consisting of Petri Modules to facilitate the dynamic representation of concurrent processes, enabling us to explore the real-time interactions and dependencies in a multiprocessor environment; more advanced and newer schedulers can be tested with the simulation platform presented in this paper. [ABSTRACT FROM AUTHOR]

The research on additive manufacturing (AM) path planning mainly focuses on the traditional three-axis AM path planning and five-degree-of-freedom (DOF) AM path planning, while there is less research on six-DOF AM path planning. In the traditional AM path planning algorithm, the filling path is discontinuous and there is long straight-line printing in a certain direction, which can easily lead to warpage deformation. Therefore, in this work, the six-DOF manipulator is taken as the main object to build an AM platform, and the mechanism of AM path planning of the manipulator is studied. The path planning algorithm combining the contour offset filling method and Hilbert curve filling is optimized by using a cubic uniform B-spline curve, and an AM path planning algorithm suitable for a six-DOF manipulator is obtained. A continuous printing path can be generated by this algorithm. It reduces the existence of long straight-line printing in a certain direction, thereby reducing the warpage deformation of the model and improving the molding quality of the model. The traditional three-axis AM device and the six-DOF AM platform were used to print two kinds of models. By comparing the printing time, the six-DOF AM platform was 43.70% and 37.94% shorter than the traditional three-axis AM device. The same model was printed on a six-DOF AM platform by using the parallel scanning filling method, the path planning algorithm combining contour offset and Hilbert curve, and the method proposed in this paper. Through experimental verification, the average warpage deformation of the model printed by the method proposed in this paper was reduced by 37.81% and 13.79%, respectively, compared with the other two methods. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicle (UAV)-based object detection methods are widely used in traffic detection due to their high flexibility and extensive coverage. In recent years, with the increasing complexity of the urban road environment, UAV object detection algorithms based on deep learning have gradually become a research hotspot. However, how to further improve algorithmic efficiency in response to the numerous and rapidly changing road elements, and thus achieve high-speed and accurate road object detection, remains a challenging issue. Given this context, this paper proposes the high-efficiency multi-object detection algorithm for UAVs (HeMoDU). HeMoDU reconstructs a state-of-the-art, deep-learning-based object detection model and optimizes several aspects to improve computational efficiency and detection accuracy. To validate the performance of HeMoDU in urban road environments, this paper uses the public urban road datasets VisDrone2019 and UA-DETRAC for evaluation. The experimental results show that the HeMoDU model effectively improves the speed and accuracy of UAV object detection. [ABSTRACT FROM AUTHOR]

Cellular structures consist of foams, honeycombs, and lattices. Lattices have many outstanding properties over foams and honeycombs, such as lightweight, high strength, absorbing energy, and reducing vibration, which has been extensively studied and concerned. Because of excellent properties, lattice structures have been widely used in aviation, bio-engineering, automation, and other industrial fields. In particular, the application of additive manufacturing (AM) technology used for fabricating lattice structures has pushed the development of designing lattice structures to a new stage and made a breakthrough progress. By searching a large number of research literature, the primary work of this paper reviews the lattice structures. First, based on the introductions about lattices of literature, the definition and classification of lattice structures are concluded. Lattice structures are divided into two general categories in this paper: uniform and non-uniform. Second, the performance and application of lattice structures are introduced in detail. In addition, the fabricating methods of lattice structures, i.e., traditional processing and additive manufacturing, are evaluated. Third, for uniform lattice structures, the main concern during design is to develop highly functional unit cells, which in this paper is summarized as three different methods, i.e., geometric unit cell based, mathematical algorithm generated, and topology optimization. Forth, non-uniform lattice structures are reviewed from two aspects of gradient and topology optimization. These methods include Voronoi-tessellation, size gradient method (SGM), size matching and scaling (SMS), and homogenization, optimization, and construction (HOC). Finally, the future development of lattice structures is prospected from different aspects. [ABSTRACT FROM AUTHOR]

The purpose of the self-driving car is to minimize the number casualties of traffic accidents. One of the effects of traffic accidents is an improper speed of a car, especially at the road turn. If we can make the anticipation of the road turn, it is possible to avoid traffic accidents. This paper presents a cutting edge curve lane detection algorithm based on the Kalman filter for the self-driving car. It uses parabola equation and circle equation models inside the Kalman filter to estimate parameters of a using curve lane. The proposed algorithm was tested with a self-driving vehicle. Experiment results show that the curve lane detection algorithm has a high success rate. The paper also presents simulation results of the autonomous vehicle with the feature to control steering and speed using the results of the full curve lane detection algorithm. [ABSTRACT FROM AUTHOR]

In the work reported in this paper, a lost-in-space star pattern identification algorithm for agile spacecraft was studied. Generally, the operation of a star tracker is known to exhibit serious degradation or even failure during fast attitude maneuvers. While tracking methods are widely used solutions to handle the dynamic conditions, they require prior information about the initial orientation. Therefore, the tracking methods may not be adequate for autonomy of attitude and control systems. In this paper a novel autonomous identification method for dynamic conditions is proposed. Additional constraints are taken into account that can significantly decrease the number of stars imaged and the centroid accuracy. A strategy combining two existing classes for star pattern identification is proposed. The new approach is intended to provide a unique way to determine the identity of stars that promises robustness against noise and rapid identification. Moreover, representative algorithms implemented in actual space applications were utilized as counterparts to analyze the performance of the proposed method in various scenarios. Numerical simulations show that the proposed method is not only highly robust against positional noise and false stars, but also guarantees fast run-time, which is appropriate for high-speed applications. [ABSTRACT FROM AUTHOR]

Topographic maps comprise a rich data source for the processing and analysis of geographic information. However, the management of paper topographic maps is still dominated by an inefficient manual method, and there is no counting equipment for topographic maps that is suitable for narrow map warehouse passages. The existing algorithms relating to paper counting require paper hardness and cannot directly obtain the internal information of topographic maps. To address the above problems, using a map inventory machine transformed from a paddle-type paper counting machine to perform a preliminary count and obtain the video data of the counting progress, an automatic counting algorithm for topographic maps for map management is proposed in this study. First, the periodic feature changes of all the targets and each individual target in the videos are analyzed. Second, a deformable parts model accelerated by fast feature pyramids and by reducing the region of interest is used for the object detection of mechanical wheels. The grayscale variance function is selected to quantify the quality change in the images. Finally, a fusion window counting model is constructed with the adaptive window and fixed window methods. The experimental results show that the average counting accuracy of the model is about 95%, which can verify the initial counting results of the machine and provide high-quality keyframes for the subsequent sheet designation recognition. [ABSTRACT FROM AUTHOR]

In order to improve the performance of UAV’s autonomous maneuvering decision-making, this paper proposes a decision-making method based on situational continuity. The algorithm in this paper designs a situation evaluation function with strong guidance, then trains the Long Short-Term Memory (LSTM) under the framework of Deep Q Network (DQN) for air combat maneuvering decision-making. Considering the continuity between adjacent situations, the method takes multiple consecutive situations as one input of the neural network. To reflect the difference between adjacent situations, the method takes the difference of situation evaluation value as the reward of reinforcement learning. In different scenarios, the algorithm proposed in this paper is compared with the algorithm based on the Fully Neural Network (FNN) and the algorithm based on statistical principles respectively. The results show that, compared with the FNN algorithm, the algorithm proposed in this paper is more accurate and forwardlooking. Compared with the algorithm based on the statistical principles, the decision-making of the algorithm proposed in this paper is more efficient and its real-time performance is better. [ABSTRACT FROM AUTHOR]

Learning programming logic remains an obstacle for students from different academic fields. Considered one of the essential disciplines in the field of Science and Technology, it is vital to investigate the new tools or techniques used in the teaching and learning of Programming Language. This work presents a systematic literature review (SLR) on approaches using Mobile Learning methodology and the process of learning programming in introductory courses, including mobile applications and their evaluation and validation. We consulted three digital libraries, considering articles published from 2011 to 2022 related to Mobile Learning and Programming Learning. As a result, we found twelve mobile tools for learning or teaching programming logic. Most are free and used in universities. In addition, these tools positively affect the learning process, engagement, motivation, and retention, providing a better understanding, and improving content transmission. [ABSTRACT FROM AUTHOR]