Search

This research stems from the urgent need to address the complex challenges faced in multimodal transportation within the cargo sector, particularly concerning the reduction of transportation costs and CO2 emissions. Existing transportation systems often struggle to efficiently balance economic and environmental concerns, necessitating innovative solutions. In this paper, we have introduced a novel mathematical model that integrates Singular Value Decomposition (SVD), Genetic Algorithms (GA), and the Adaptive Neural Fuzzy Inference System (ANFIS). The synergy of GA and the ANFIS forms a dynamic learning system that continually refines solutions by adapting to historical decisions and aligning with supply-demand dynamics. This integrated approach aims to optimize cost allocation and resource utilization while simultaneously minimizing CO2 emissions. Deploying the ANFIS+GA+SVD model in multimodal scenarios yields impressive results, with a minimal average percentage error (MAPE) of 0.28% for transportation costs and a remarkable coefficient of determination R2 of 0.992 for the Truck + Ship scenario. Similarly, a MAPE of 0.11% for CO2 emissions, supported by an impressive R2 of 0.989, underscores the model's accuracy. Observations of people's transportation choices in response to emission price changes reveal a significant decrease in truck usage, plummeting from 84% to below 50%. Alternative transportation methods, especially in the 3S-3 M-3 C scenario, show a substantial surge, with railways leading at a remarkable 30% increase in utilization. The combined quantity and cost comparison, utilizing the ANFIS+GA+SVD model, emphasizes the suitability of the Truck + Ship scenario for Iraq's transportation network, reinforcing the case for sustainable and efficient multimodal transportation systems.

This research stems from the urgent need to address the complex challenges faced in multimodal transportation within the cargo sector, particularly concerning the reduction of transportation costs and CO 2 emissions. Existing transportation systems often struggle to efficiently balance economic and environmental concerns, necessitating innovative solutions. In this paper, we have introduced a novel mathematical model that integrates Singular Value Decomposition (SVD), Genetic Algorithms (GA), and the Adaptive Neural Fuzzy Inference System (ANFIS). The synergy of GA and the ANFIS forms a dynamic learning system that continually refines solutions by adapting to historical decisions and aligning with supply-demand dynamics. This integrated approach aims to optimize cost allocation and resource utilization while simultaneously minimizing CO 2 emissions. Deploying the ANFIS+GA+SVD model in multimodal scenarios yields impressive results, with a minimal average percentage error (MAPE) of 0.28% for transportation costs and a remarkable coefficient of determination R2 of 0.992 for the Truck + Ship scenario. Similarly, a MAPE of 0.11% for CO 2 emissions, supported by an impressive R2 of 0.989, underscores the model's accuracy. Observations of people's transportation choices in response to emission price changes reveal a significant decrease in truck usage, plummeting from 84% to below 50%. Alternative transportation methods, especially in the 3S-3 M-3 C scenario, show a substantial surge, with railways leading at a remarkable 30% increase in utilization. The combined quantity and cost comparison, utilizing the ANFIS+GA+SVD model, emphasizes the suitability of the Truck + Ship scenario for Iraq's transportation network, reinforcing the case for sustainable and efficient multimodal transportation systems. [ABSTRACT FROM AUTHOR]

In order to meet the requirements of high accuracy and fast algorithm for numerical heat transfer simulation, an iterative scheme of Proper Orthogonal Decomposition (for short, POD) dimension reduction based on the classical central difference Galerkin spectral method is proposed for solving two-dimensional transient heat conduction problems. The POD dimension reduction spectral method model is constructed by taking the calculation results of classical central difference Galerkin spectral method as sample data. The numerical algorithm characteristics of flow and heat transfer are studied by using a partial differential equation as a mathematical model, and the error estimation is given. Finally, different time intervals are used as parameters to simulate experiments. The results show that the POD method is applicable to transient nonlinear heat conduction problems, and the maximum average relative error of the reconstructed temperature field is 0.89675%. Moreover, the POD method not only has a high calculation accuracy, but also has an average calculation speed as high as 310.25 times that of the central difference Galerkin algorithm. It can be seen that under the condition that the error between the solution of POD dimension reduction extrapolation algorithm and the solution of classical central difference Galerkin spectrum method is small enough, the POD method can greatly reduce the calculation amount, shorten the running time, and ensure a high accuracy of the calculation results, thus verifying the effectiveness and feasibility of the algorithm. [ABSTRACT FROM AUTHOR]

Copyright of Machine Tool & Hydraulics is the property of Guangzhou Mechanical Engineering Research Institute (GMERI) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Abstract In a joint transmission coordinated multipoint (JT-CoMP) system, a shared spectrum is utilized by all neighbor cells. In the downlink, a group of base stations (BSs) coordinately transmit the users’ data to avoid serious interference at the users in the boundary of the cells, thus substantially improving area fairness. However, this comes at the cost of high feedback and backhaul load; In a frequency division duplex system, all users at the cell boundaries have to collect and send feedback of the downlink channel state information (CSI). In centralized JT-CoMP, although with capabilities for perfect coordination, a central coordination node have to send the computed precoding weights and corresponding data to all cells which can overwhelm the backhaul resources. In this paper, we design a JT-CoMP scheme, by which the sum of the mean square error (MSE) at the boundary users is minimized, while feedback and backhaul loads are constrained and the load is balanced between BSs. Our design is based on the singular value decomposition of CSI matrix and optimization of a binary link selection matrix to provide sparse feedback—constrained backhaul link. For comparison, we adopt the previously presented schemes for feedback and backhaul reduction in the physical layer. Extensive numerical evaluations show that the proposed scheme can reduce the MSE with at least $$25\%$$ 25 % , compared to the adopted and existing schemes.

In order to meet the requirements of high accuracy and fast algorithm for numerical heat transfer simulation, an iterative scheme of Proper Orthogonal Decomposition (for short, POD) dimension reduction based on the classical central difference Galerkin spectral method is proposed for solving two-dimensional transient heat conduction problems. The POD dimension reduction spectral method model is constructed by taking the calculation results of classical central difference Galerkin spectral method as sample data. The numerical algorithm characteristics of flow and heat transfer are studied by using a partial differential equation as a mathematical model, and the error estimation is given. Finally, different time intervals are used as parameters to simulate experiments. The results show that the POD method is applicable to transient nonlinear heat conduction problems, and the maximum average relative error of the reconstructed temperature field is 0.89675%. Moreover, the POD method not only has a high calculation accuracy, but also has an average calculation speed as high as 310.25 times that of the central difference Galerkin algorithm. It can be seen that under the condition that the error between the solution of POD dimension reduction extrapolation algorithm and the solution of classical central difference Galerkin spectrum method is small enough, the POD method can greatly reduce the calculation amount, shorten the running time, and ensure a high accuracy of the calculation results, thus verifying the effectiveness and feasibility of the algorithm.

Generative adversarial networks (GANs) represent a significant advance in the field of deep learning for image generation problems. With their ability to generate highly realistic and diverse images, GANs are quickly becoming the preferred technique for a wide range of applications. However, GANs come with several limitations and challenges, chief among which are their collapse mode and instability during training. In this paper, we propose a novel generator GAN model that incorporates the singular value decomposition (SVD) process into the decoder module. The SVD integration allows the generator to recognize the underlying structures in the feature space, resulting in more robust and effective image generation. This is achieved by adjusting the singular values during the training process, effectively optimizing the SVD-based generator to produce images that match the ground truth. Another advantage of SVD integration is its ability to perform discriminative spatial decomposition that clearly reflects the differences between the generated features and the target features. By including SVD in the generator model, the resulting loss values are higher and less prone to gradient vanishing than conventional GANs, such as Pix2Pix. Our proposed SVD-based generator model can be integrated into any auto-encoder architecture, making it as a generic and versatile solution for various image-generation tasks. The effectiveness of the proposed SVD-based GAN in image generation has been validated in three challenging benchmarks for image restoration and visible-to-infrared image translation. Extensive experiments demonstrate the significant quantitative and qualitative improvements achieved by our SVD-based GAN compared to baseline GAN architectures. The overall system outperforms the current state of the art in all benchmarks tested. [ABSTRACT FROM AUTHOR]

In this paper, we give the Jacobians of matrix transformations Y q × 1 = A q × p X p × 1 , Y m × n = A m × p X p × q B q × n and W ˜ q × q = A q × p W p × p A ′ q × p , when the constant matrices A and B are singular rectangular matrices, not limited to square matrices, and the random variables in the random matrices X, Y can be linearly dependent, W and W ˜ are singular random matrices. Furthermore, some important properties about singular multivariate Normal distribution and singular Wishart distribution are proved by using these Jacobians. Finally, the density function of A W − A ′ and the distribution of generalized Hotelling's T2 statistic are obtained. [ABSTRACT FROM AUTHOR]

In a joint transmission coordinated multipoint (JT-CoMP) system, a shared spectrum is utilized by all neighbor cells. In the downlink, a group of base stations (BSs) coordinately transmit the users' data to avoid serious interference at the users in the boundary of the cells, thus substantially improving area fairness. However, this comes at the cost of high feedback and backhaul load; In a frequency division duplex system, all users at the cell boundaries have to collect and send feedback of the downlink channel state information (CSI). In centralized JT-CoMP, although with capabilities for perfect coordination, a central coordination node have to send the computed precoding weights and corresponding data to all cells which can overwhelm the backhaul resources. In this paper, we design a JT-CoMP scheme, by which the sum of the mean square error (MSE) at the boundary users is minimized, while feedback and backhaul loads are constrained and the load is balanced between BSs. Our design is based on the singular value decomposition of CSI matrix and optimization of a binary link selection matrix to provide sparse feedback—constrained backhaul link. For comparison, we adopt the previously presented schemes for feedback and backhaul reduction in the physical layer. Extensive numerical evaluations show that the proposed scheme can reduce the MSE with at least 25 % , compared to the adopted and existing schemes. [ABSTRACT FROM AUTHOR]

Magnetotelluric (MT) sounding data can easily be damaged by various types of noise, especially in industrial areas, where the quality of measured data is poor. Most traditional de-noising methods are ineffective to the low signal-to-noise ratio of data. To solve the above problem, we propose the use of a de-noising method for the detection of noise in MT data based on discrete wavelet transform and singular value decomposition (SVD), with multiscale dispersion entropy and phase space reconstruction carried out for pretreatment. No “over processing” takes place in the proposed method. Compared with wavelet transform and SVD decomposition in synthetic tests, the proposed method removes the profile of noise more completely, including large-scale noise and impulse noise. For high levels or low levels of noise, the proposed method can increase the signal-to-noise ratio of data more obviously. Moreover, application to the field MT data can prove the performance of the proposed method. The proposed method is a feasible method for the elimination of various noise types and can improve MT data with high noise levels, obtaining a recovery in the response. It can improve abrupt points and distortion in MT response curves more effectively than the robust method can.

The semi-fragile watermarking algorithm based on Hadamard transform and SVD decomposition was proposed to distinguish normal image processing operations from malicious tampering.Firstly,the carrier image was SVD decomposed,and Hadamard transform was performed on all image subblocks.The watermark was embedded by quantization method.The algorithm was sensitive to tampering and had good ability to recognize tampering position,and had strong resistance to JPEG compression.

Copyright of Engineering Mechanics / Gongcheng Lixue is the property of Engineering Mechanics Editorial Department and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The current popular dictionary learning algorithms for sparse representation of signals are K‐means Singular Value Decomposition (K‐SVD) and K‐SVD‐extended. Only rank‐1 approximation is used to update one atom at a time and it is unable to cope with large dictionary efficiently. In order to tackle these two problems, this study proposes M‐Principal Component Analysis‐N (M‐PCA‐N), which is an algorithm for dictionary learning and sparse representation. First, M‐Principal Component Analysis (M‐PCA) utilised information from the top M ranks of SVD decomposition to update M atoms at a time. Then, in order to further utilise the information from remaining ranks, M‐PCA‐N is proposed on the basis of M‐PCA, by transforming information from the following N non‐principal ranks onto the top M principal ranks. The mathematic formula indicates that M‐PCA may be seen as a generalisation of K‐SVD. Experimental results on the BBC Sound Effects Library show that M‐PCA‐N not only lowers the MSE between original signal and approximation signal in audio signal sparse representation, but also obtains higher audio signal classification precision than K‐SVD. [ABSTRACT FROM AUTHOR]

A new texture classification method based on wavelet transform is presented. The elements of the signature vector, FDBC, of an image are the fractal dimensions and barycentric coordinates of the bit planes of the wavelet coefficients in both the three‐level high‐frequency domains and the third low‐frequency domain. The pretreatment is done with SVD decomposition and reconstruction by dropping half singular values. The one‐nearest‐neighbour classifier (1NN) with L1 distance is used to make the classification. Furthermore, to improve classification result, the classifier 1NN is strengthened with weighted L1 distance. The proposed method is tested on five subsets from Brodatz database and UMD database and is experimentally proved more efficient and more promising. [ABSTRACT FROM AUTHOR]

This paper describes the design and implementation of efficient edge detection quadratic filters for better localization of microaneurysms, caused by diabetic retinopathy, in fundus retinal images. The method is based on Volterra filter that accounts for majority of polynomial nonlinearities in images. Teager filters are designed and implemented for detecting edges in retinal images generated by a fundus camera. Better localization of microaneurysms is achieved with an isotropic quadratic filter whose kernel is designed based on optimization. The noise performance of the edge detectors is tested with Gaussian and impulsive noise. [ABSTRACT FROM AUTHOR]

Accurate laser positioning system (ALPS) is widely used in large space indoor dynamic positioning. To improve the positioning accuracy and refresh frequency, the inertial measurement unit (IMU) with a high frame rate is used for fusion, so it is necessary to calibrate the external parameters of ALPS and IMU. Based on the analysis of the calculation process and error description of traditional calibration, we propose a calibration method of spatial multipose transformation (SMT). In this calibration method, the target plate performs multiple attitude transformations to obtain the attitude data and process its error. Then, the Lodrigues matrix is introduced in the solution process to reduce the dimension of unknown variables in the equation, and it is optimized combined with SVD decomposition. At the same time, to further adapt to the application of fusion, a more intuitive error description method is proposed to evaluate the influence of calibration results on fusion accuracy. The simulation experiments indicate that the proposed method enables the calibration error to have accuracy within 0.02 mm. Furthermore, the results of the validation experiments show that the proposed calibration solution method improves in accuracy and robustness with respect to the conventional method. It provides a technical basis for realizing higher precision indoor dynamic positioning applications in large space. [ABSTRACT FROM AUTHOR]

Magnetotelluric (MT) sounding data can easily be damaged by various types of noise, especially in industrial areas, where the quality of measured data is poor. Most traditional de-noising methods are ineffective to the low signal-to-noise ratio of data. To solve the above problem, we propose the use of a de-noising method for the detection of noise in MT data based on discrete wavelet transform and singular value decomposition (SVD), with multiscale dispersion entropy and phase space reconstruction carried out for pretreatment. No "over processing" takes place in the proposed method. Compared with wavelet transform and SVD decomposition in synthetic tests, the proposed method removes the profile of noise more completely, including large-scale noise and impulse noise. For high levels or low levels of noise, the proposed method can increase the signal-to-noise ratio of data more obviously. Moreover, application to the field MT data can prove the performance of the proposed method. The proposed method is a feasible method for the elimination of various noise types and can improve MT data with high noise levels, obtaining a recovery in the response. It can improve abrupt points and distortion in MT response curves more effectively than the robust method can. [ABSTRACT FROM AUTHOR]

With the tools of modern metrology we can measure almost all variables in the phenomenon field of a working machine, and many of the measured quantities can be symptoms of machine conditions. On this basis, we can form a symptom observation matrix (SOM) intended for condition monitoring and wear trend (fault) identification. On the other hand, we know that contemporary complex machines may have many modes of failure, called faults. The paper presents a method of the extraction of the information about faults from the symptom observation matrix by means of singular value decomposition (SVD), in the form of generalized fault symptoms. As the readings of the symptoms can be unstable, the moving average of the SOM is applied with success. An attempt to assess the diagnostic contribution of a primary symptom is made, and also an approach to assess the symptom limit value and to connect the SVD methodology with neural nets is considered. Finally, a condition forecasting problem is discussed and an application of grey system theory (GST) to symptom prognosis is presented. These possibilities are illustrated by processing data taken directly from the machine vibration condition monitoring area. [ABSTRACT FROM AUTHOR]