Search Results (58)

This paper develops a dynamic information-theoretic network framework to quantify systemic risk in China’s maritime–commodity nexus with a focus on the Yangtze River Basin using eight monthly indicators, CCFI, CBCFI, BDI, YRCFI, GAUP, MPCT, CPUS, and ASMC. We resample, impute, standardize, and difference series to achieve stationary time series. Nonlinear interdependencies are estimated via KSG mutual information (MI) within sliding windows; networks are filtered using the Planar Maximally Filtered Graph (PMFG) with bootstrap edge validation (95th percentile) and benchmarked against the MST. Average MI indicates moderate yet heterogeneous dependence (about 0.13–0.17), revealing a container/port core (CCFI–YRCFI–MPCT), a bulk/energy spine (BDI–CPUS), and commodity bridges via GAUP. Dynamic PMFG metrics show a generally resilient but episodically vulnerable structure: density and compactness decline in turbulence. Stress tests demonstrate high redundancy to diffuse link failures (connectivity largely intact until ∼70–80% edge removal) but pronounced sensitivity of diffusion capacity to targeted multi-node outages. Early-warning indicators based on entropy rate and percolation threshold Z-scores flag recurring windows of elevated fragility; change point detection evaluation of both metrics isolates clustered regime shifts (2015–2016, 2018–2019, 2021–2022, and late 2023–2024). A Systemic Importance Index (SII) combining average centrality and removal impact ranks MPCT and CCFI as most critical, followed by BDI, with GAUP/CPUS mid-peripheral and ASMC peripheral. The findings imply that safeguarding port throughput and stabilizing container freight conditions deliver the greatest resilience gains, while monitoring bulk/energy linkages is essential when macro shocks synchronize across markets. Full article

This study develops an effective forecasting model for metal futures prices with enhanced capability in trend identification and abrupt change detection, aiming to improve decision-making in both financial and industrial contexts. A hybrid framework is proposed that integrates non-uniform piecewise cubic Bézier curves with a temporal convolutional network (TCN). The Bézier–Hurst (BH) decomposition extracts multi-scale trend components, which are then processed by a TCN to capture long-range dependencies. Empirical results show that the model outperforms LSTM, standard TCN, Bézier–TCN, and WD-TCN, achieving higher accuracy in trend detection and abrupt change response. This integration of Bézier-based decomposition with TCN offers a novel and robust tool for forecasting, providing valuable support for risk control and strategic planning in commodity markets. Full article

This paper presents a method to model and optimize the supply chain processes for floating offshore wind turbines using a network model based on Generalized Multi-Commodity Network Flows (GMCNF). The proposed method represents production bases, base ports, installation sites, component transfer areas, and transportation routes as nodes and arcs within the network. The installation process is modeled using three transport concepts: assembling components at the base port, direct assembly and installation at the installation site, and transferring components to the installation vessel at a nearby port. These processes are expressed as a linear network model, with the objective function set to minimize total transportation and assembly costs. The optimal transportation network is derived by solving the network problem while incorporating constraints such as supply, demand, and transportation capacity. Case studies demonstrate the method’s effectiveness in optimizing the supply chain and evaluating potential new production site locations for floating foundations, considering overall supply chain optimization. Full article

With the continuous expansion and increasing operational complexity of high-speed railway networks, there is a growing need for more flexible and efficient EMU (Electric Multiple Unit) routing strategies. To address these challenges, in this paper, we propose a multi-day flexible circulation model that minimizes total connection time and deadheading mileage. A multi-commodity network flow model is formulated, incorporating constraints such as first-level maintenance intervals, storage capacity, train coupling/decoupling operations, and train types, with across-day consistency. To solve this complex model efficiently, a heuristic decomposition algorithm is designed to separate the problem into daily service chain generation and EMU assignment. A real-world case study in the Beijing–Baotou high-speed corridor demonstrates the effectiveness of the proposed approach. Compared to a fixed strategy, the flexible strategy reduces EMU usage by one unit, lowers deadheading mileage by up to 16.4%, and improves maintenance workload balance. These results highlight the practical value of flexible EMU deployment for large-scale, multi-day railway operations. Full article

Precise temperature control in high-temperature furnaces is challenged by nonlinearities, parameter drift, and high thermal inertia. This study proposes an adaptive control strategy combining a classical PID loop with real-time gain updates from a feed-forward artificial neural network (ANN). Implemented on an 18 kW retrofitted Blue-M furnace, the system was characterized by second-order transfer functions for heating and forced convection cooling. A dataset of 9702 samples was built from eight fixed PID configurations tested under a multi-ramp thermal profile. The selected 3-64-64-32-2 ANN, executed in Python and interfaced with LabVIEW, computes optimal gains in 0.054 ms while preserving real-time monitoring capabilities. Experimental results show that the ANN-assisted PID reduces the mean absolute error to 5.08 °C, limits overshoot to 41% (from 53%), and shortens settling time by 20% compared to the best fixed-gain loop. It also outperforms a fuzzy controller and remains stable under ±5% signal noise. Notably, gain reversals during cooling prevent temperature spikes, improving transient response. Relying on commodity hardware and open-source tools, this approach offers a cost-effective solution for legacy furnace upgrades and provides a replicable model for adaptive control in high-temperature, safety-critical environments like metal processing, battery cycling, and nuclear systems. Full article

To address the challenges in forecasting crude oil and hot-rolled coil futures prices, the aim is to transcend the constraints of conventional approaches. This involves effectively predicting short-term price fluctuations, developing quantitative trading strategies, and modeling time series data. The goal is to enhance prediction accuracy and stability, thereby supporting decision-making and risk management in financial markets. A novel approach, the multi-dimensional fusion feature-enhanced (MDFFE) prediction method has been devised. Additionally, a data augmentation framework leveraging multi-dimensional feature engineering has been established. The technical indicators, volatility indicators, time features, and cross-variety linkage features are integrated to build a prediction system, and the lag feature design is used to prevent data leakage. In addition, a deep fusion model is constructed, which combines the temporal feature extraction ability of the convolution neural network with the nonlinear mapping advantage of an extreme gradient boosting tree. With the help of a three-layer convolution neural network structure and adaptive weight fusion strategy, an end-to-end prediction framework is constructed. Experimental results demonstrate that the MDFFE model excels in various metrics, including mean absolute error, root mean square error, mean absolute percentage error, coefficient of determination, and sum of squared errors. The mean absolute error reaches as low as 0.0068, while the coefficient of determination can be as high as 0.9970. In addition, the significance and stability of the model performance were verified by statistical methods such as a paired t-test and ANOVA analysis of variance. This MDFFE algorithm offers a robust and practical approach for predicting commodity futures prices. It holds significant theoretical and practical value in financial market forecasting, enhancing prediction accuracy and mitigating forecast volatility. Full article

To enhance the accuracy of product recognition in non-store retail sales and address misidentification and missed detection caused by occlusion in densely placed goods, we propose an improved YOLOv8-based network: Dense-YOLO. We first introduce an enhanced multi-scale feature extraction module (EMFE) in the feature extraction layer and employ a lightweight feature fusion strategy (LFF) in the feature fusion layer to improve the network’s performance. Next, to enhance the performance of dense product recognition, particularly when handling small and multi-scale objects in complex settings, we propose a novel multi-scale dynamic interaction attention mechanism (MDIAM). This mechanism combines dynamic channel weight adjustment and multi-scale spatial convolution to emphasize crucial features, while avoiding overfitting and enhancing model generalization. Finally, a cross-layer feature interaction mechanism is introduced to strengthen the interaction between low- and high-level features, further improving the model’s expressive power. Using the public COCO128 dataset and over 2000 daily smart retail cabinet product images compiled in our laboratory, we created a dataset covering 50 product categories for ablation and comparison experiments. The experimental results indicate that the accuracy under MDIAM is improved by 1.6% compared to other top-performing models. The proposed algorithm achieves an mAP of 94.9%, which is a 1.0% improvement over the original model. The enhanced algorithm not only significantly improves the recognition accuracy of individual commodities but also effectively addresses the issues of misdetection and missed detection when multiple commodities are recognized simultaneously. Full article

In this work, an efficient graph-induced neighborhood search heuristic is proposed to address the capacitated multicommodity network design problem. This problem, which commonly arises in transportation and telecommunication, is well known for its inherent complexity and is often classified as $\mathcal{NP}$-hard. Our approach commences with an arbitrary feasible solution and iteratively improves it by solving a series of small-scale auxiliary mixed-integer programming problems. These small-scale problems are closely tied to the cycles inherent in the network topology, enabling us to reroute the flow more effectively. Furthermore, we have developed a novel resource-efficient facility assignment technique that departs from standard variable neighborhood search algorithms. By solving a series of small knapsack problems, this technique not only enhances the quality of solutions further but also can serve as a primary heuristic to generate initial feasible solutions. Furthermore, we theoretically guarantee that our algorithm will always produce an integer-feasible solution within polynomial time. The experimental results highlight the superior performance of our method compared to other existing approaches. Our heuristic algorithm efficiently discovers high-quality feasible solutions, substantially reducing the computation time and number of nodes in the branch-and-bound tree. Full article

Image inpainting for indoor environments presents unique challenges due to complex spatial relationships, diverse lighting conditions, and domain-specific object configurations. This paper introduces a resource-efficient post-processing framework that enhances domain-specific image inpainting through an adaptation mechanism. Our architecture integrates a convolutional neural network with residual connections optimized via a multi-term objective function combining perceptual losses and adaptive loss weighting. Experiments on our curated dataset of 4000 indoor household scenes demonstrate improved performance, with training completed in 20 min on commodity GPU hardware with 0.14 s of inference latency per image. The framework exhibits enhanced results across standard metrics (FID, SSIM, LPIPS, MAE, and PSNR), showing improvements in structural coherence and perceptual quality while preserving cross-domain generalization abilities. Our methodology offers a novel approach for efficient domain adaptation in image inpainting, particularly suitable for real-world applications under computational constraints. This work advances the development of domain-aware image restoration systems and provides architectural insights for specialized image processing frameworks. Full article

Soybean is a critical agricultural commodity, serving as a vital source of protein and vegetable oil, and contributing significantly to the economies of producing nations. However, soybean yields are frequently compromised by disease and pest infestations, which, if not identified early, can lead to substantial production losses. To address this challenge, we propose AgriNAS, a method that integrates a Neural Architecture Search (NAS) framework with an adaptive convolutional architecture specifically designed for plant pathology. AgriNAS employs a novel data augmentation strategy and a Spatial–Time Augmentation (STA) method, and it utilizes a multi-stage convolutional network that dynamically adapts to the complexity of the input data. The proposed AgriNAS leverages powerful GPU resources to handle the intensive computational tasks involved in NAS and model training. The framework incorporates a bi-level optimization strategy and entropy-based regularization to enhance model robustness and prevent overfitting. AgriNAS achieves classification accuracies superior to VGG-19 and a transfer learning method using convolutional neural networks. Full article

When considering agricultural commodity transaction data, long sampling intervals or data sparsity may lead to small samples. Furthermore, training on small samples can lead to overfitting and makes it hard to capture the fine-grained fluctuations in the data. In this study, a multi-scale forecasting approach combined with a Generative Adversarial Network (GAN) and Temporal Convolutional Network (TCN) is proposed to address the problems related to small sample prediction. First, a Time-series Generative Adversarial Network (TimeGAN) is used to expand the multi-dimensional data and t-SNE is utilized to evaluate the similarity between the original and synthetic data. Second, a greedy algorithm is exploited to calculate the information gain, in order to obtain important features, based on XGBoost. Meanwhile, TCN residual blocks and dilated convolutions are used to tackle the issue of gradient disappearance. Finally, an attention mechanism is added to the TCN, which is beneficial in terms of improving the forecasting accuracy. Experiments are conducted on three products, garlic, ginger and chili. Taking garlic as an example, the RMSE of the proposed method was reduced by 1.7% and 1% when compared to the SVR and RF models, respectively. Its $R^2$ accuracy was also improved (by 4.3% and 3.4%, respectively). Furthermore, TCN-attention and TCN were found to require less time compared to GRU and LSTM. The accuracy of the proposed method increased by about 5% when compared to that without TimeGAN in the ablation study. Moreover, compared with TCN, the Gated Recurrent Unit (GRU), and the Long Short-term Memory (LSTM) model in the multi-scale price forecasting task, the proposed method can better utilize small samples and high-dimensional data, leading to improved performance. Additionally, the proposed model is compared to the Transformer and TimesNet models in terms of its accuracy, deployment cost, and other metrics. Full article

Capacity calculations are essential for the long-term planning of railway infrastructure. Many of the methods currently used in practice calculate characteristic capacity values separately for the single elements (mainly lines and nodes) of a railway network. Approaches that consider the entire network to account for interactions between the elements often rely on many assumptions, which renders a direct practical application difficult. This paper therefore introduces a linear optimization model that comprises railway-specific constraints such as minimum headway times, line capacities, and route conflicts. Under the consideration of these constraints, the developed model permits the calculation of a network-wide capacity. The model is validated on a sample network that is based on a real network of the German railway infrastructure. Full article

In mining, deposits are divided into blocks, forming the basis for open-pit mine planning, covering production and haulage route planning. Current studies often stage optimization and lack the consideration of road capacity, leading to suboptimal solutions. A novel approach integrates production scheduling and haulage route planning through a bilevel optimization model. The upper-level model integrates ore mining constraints to establish a mixed-integer production scheduling model, minimizing haulage costs. Spatiotemporal correlation constraints for block mining are determined using a two-stage algorithm. The lower-level model incorporates road capacity, forming a haulage route optimization model based on multicommodity network flow. A solution algorithm with a distance penalty strategy facilitates feedback between the upper and lower levels, achieving optimal solutions. Tested on a real open-pit coal mine with over 5 million blocks, this approach reduces haulage costs by 10.06% compared to stage optimization. Additionally, this approach allows for adjusting haulage demand in both temporal and spatial dimensions, effectively preventing road congestion. This study advances rational mining processes and enhances the efficiency of open-pit mining haulage systems. Full article

Disruptions in multimodal transportation networks can lead to significant damage and loss, affecting not only the networks’ efficiency but also their sustainability. Given the size, dynamics, and complex nature of these networks, it is essential to understand and enhance their resilience against disruptions. This not only ensures their functionality and performance but also supports sustainable development by maintaining equitable service across various communities and economic sectors. Therefore, developing efficient techniques to increase the robustness and resilience of transportation networks is crucial for both operational success and sustainability. This research introduces a multicriteria mixed integer linear programming (MCMILP) model aimed at enhancing the resilience and performance of multimodal–multi-commodity transportation networks. By ensuring effective distribution of commodities, alongside a cost-efficient distribution strategy in the wake of disruptive events, our model contributes significantly to sustainable transportation practices. The proposed MCMILP model demonstrates that integrating equality considerations while seeking a cost-efficient distribution strategy significantly mitigates the impact of disruptions, thereby bolstering the resilience of multimodal transportation networks. To illustrate the capabilities of the proposed modeling approach, we present a case study based on the multimodal transportation network in Colombia. The results show a significant improvement in the number of nodes that satisfy their demand requirements with respect to other approaches based on reducing total unsatisfied demand and transportation costs. Full article

In the dynamic visual cabinet, the occurrence of motion blur when consumers take out commodities will reduce the accuracy of commodity detection. Recently, although Transformer-based video deblurring networks have achieved results compared to Convolutional Neural Networks in some blurring scenarios, they are still challenging for the non-uniform blurring problem that occurs when consumers pick up the commodities, such as the problem of difficult alignment of blurred video frames of small commodities and the problem of underutilizing the effective information between the video frames of commodities. Therefore, an improved Transformer video deblurring network is proposed. Firstly, a multi-scale Transformer feature extraction method is utilized for non-uniform blurring. Secondly, for the problem of difficult alignment of small-item-blurred video frames, a temporal interactive attention mechanism is designed for video frame alignment. Finally, a feature recurrent fusion mechanism is introduced to supplement the effective information of commodity features. The experimental results show that the proposed method has practical significance in improving the accuracy of commodity detection. Moreover, compared with the recent Transformer deblurring algorithm Video Restoration Transformer, the Peak Signal-to-Noise Ratio of this paper’s algorithm is higher than that of the Deep Video Deblurring dataset and the Fuzzy Commodity Dataset by 0.23 dB and 0.81 dB, respectively. Full article