A nonlinear data analysis algorithm, namely empirical data decomposition （EDD） is proposed, which can perform adaptive analysis of observed data. Analysis filter, which is not a linear constant coefficient filter, i...A nonlinear data analysis algorithm, namely empirical data decomposition （EDD） is proposed, which can perform adaptive analysis of observed data. Analysis filter, which is not a linear constant coefficient filter, is automatically determined by observed data, and is able to implement multi-resolution analysis as wavelet transform. The algorithm is suitable for analyzing non-stationary data and can effectively wipe off the relevance of observed data. Then through discussing the applications of EDD in image compression, the paper presents a 2-dimension data decomposition framework and makes some modifications of contexts used by Embedded Block Coding with Optimized Truncation （EBCOT） . Simulation results show that EDD is more suitable for non-stationary image data compression.展开更多
Monte Carlo transport simulations of a full-core reactor with a high-fidelity structure have been made possible by modern-day computing capabilities. Performing transport–burnup calculations of a full-core model typi...Monte Carlo transport simulations of a full-core reactor with a high-fidelity structure have been made possible by modern-day computing capabilities. Performing transport–burnup calculations of a full-core model typically includes millions of burnup areas requiring hundreds of gigabytes of memory for burnup-related tallies. This paper presents the study of a parallel computing method for full-core Monte Carlo transport–burnup calculations and the development of a thread-level data decomposition method. The proposed method decomposes tally accumulators into different threads and improves the parallel communication pattern and memory access efficiency. A typical pressurized water reactor burnup assembly along with the benchmark for evaluation and validation of reactor simulations model was used to test the proposed method.The result indicates that the method effectively reduces memory consumption and maintains high parallel efficiency.展开更多
Recent advances in deep learning have expanded new possibilities for fluid flow simulation in petroleum reservoirs.However,the predominant approach in existing research is to train neural networks using high-fidelity ...Recent advances in deep learning have expanded new possibilities for fluid flow simulation in petroleum reservoirs.However,the predominant approach in existing research is to train neural networks using high-fidelity numerical simulation data.This presents a significant challenge because the sole source of authentic wellbore production data for training is sparse.In response to this challenge,this work introduces a novel architecture called physics-informed neural network based on domain decomposition(PINN-DD),aiming to effectively utilize the sparse production data of wells for reservoir simulation with large-scale systems.To harness the capabilities of physics-informed neural networks(PINNs)in handling small-scale spatial-temporal domain while addressing the challenges of large-scale systems with sparse labeled data,the computational domain is divided into two distinct sub-domains:the well-containing and the well-free sub-domain.Moreover,the two sub-domains and the interface are rigorously constrained by the governing equations,data matching,and boundary conditions.The accuracy of the proposed method is evaluated on two problems,and its performance is compared against state-of-the-art PINNs through numerical analysis as a benchmark.The results demonstrate the superiority of PINN-DD in handling large-scale reservoir simulation with limited data and show its potential to outperform conventional PINNs in such scenarios.展开更多
Multivariate time series forecasting iswidely used in traffic planning,weather forecasting,and energy consumption.Series decomposition algorithms can help models better understand the underlying patterns of the origin...Multivariate time series forecasting iswidely used in traffic planning,weather forecasting,and energy consumption.Series decomposition algorithms can help models better understand the underlying patterns of the original series to improve the forecasting accuracy of multivariate time series.However,the decomposition kernel of previous decomposition-based models is fixed,and these models have not considered the differences in frequency fluctuations between components.These problems make it difficult to analyze the intricate temporal variations of real-world time series.In this paper,we propose a series decomposition-based Mamba model,DecMamba,to obtain the intricate temporal dependencies and the dependencies among different variables of multivariate time series.A variable-level adaptive kernel combination search module is designed to interact with information on different trends and periods between variables.Two backbone structures are proposed to emphasize the differences in frequency fluctuations of seasonal and trend components.Mamba with superior performance is used instead of a Transformer in backbone structures to capture the dependencies among different variables.A new embedding block is designed to capture the temporal features better,especially for the high-frequency seasonal component whose semantic information is difficult to acquire.A gating mechanism is introduced to the decoder in the seasonal backbone to improve the prediction accuracy.A comparison with ten state-of-the-art models on seven real-world datasets demonstrates that DecMamba can better model the temporal dependencies and the dependencies among different variables,guaranteeing better prediction performance for multivariate time series.展开更多
Purpose:We propose In Par Ten2,a multi-aspect parallel factor analysis three-dimensional tensor decomposition algorithm based on the Apache Spark framework.The proposed method reduces re-decomposition cost and can han...Purpose:We propose In Par Ten2,a multi-aspect parallel factor analysis three-dimensional tensor decomposition algorithm based on the Apache Spark framework.The proposed method reduces re-decomposition cost and can handle large tensors.Design/methodology/approach:Considering that tensor addition increases the size of a given tensor along all axes,the proposed method decomposes incoming tensors using existing decomposition results without generating sub-tensors.Additionally,In Par Ten2 avoids the calculation of Khari–Rao products and minimizes shuffling by using the Apache Spark platform.Findings:The performance of In Par Ten2 is evaluated by comparing its execution time and accuracy with those of existing distributed tensor decomposition methods on various datasets.The results confirm that In Par Ten2 can process large tensors and reduce the re-calculation cost of tensor decomposition.Consequently,the proposed method is faster than existing tensor decomposition algorithms and can significantly reduce re-decomposition cost.Research limitations:There are several Hadoop-based distributed tensor decomposition algorithms as well as MATLAB-based decomposition methods.However,the former require longer iteration time,and therefore their execution time cannot be compared with that of Spark-based algorithms,whereas the latter run on a single machine,thus limiting their ability to handle large data.Practical implications:The proposed algorithm can reduce re-decomposition cost when tensors are added to a given tensor by decomposing them based on existing decomposition results without re-decomposing the entire tensor.Originality/value:The proposed method can handle large tensors and is fast within the limited-memory framework of Apache Spark.Moreover,In Par Ten2 can handle static as well as incremental tensor decomposition.展开更多
The complex nonlinear and non-stationary features exhibited in hydrologic sequences make hydrological analysis and forecasting difficult.Currently,some hydrologists employ the complete ensemble empirical mode decompos...The complex nonlinear and non-stationary features exhibited in hydrologic sequences make hydrological analysis and forecasting difficult.Currently,some hydrologists employ the complete ensemble empirical mode decomposition with adaptive noise(CEEMDAN)method,a new time-frequency analysis method based on the empirical mode decomposition(EMD)algorithm,to decompose non-stationary raw data in order to obtain relatively stationary components for further study.However,the endpoint effect in CEEMDAN is often neglected,which can lead to decomposition errors that reduce the accuracy of the research results.In this study,we processed an original runoff sequence using the radial basis function neural network(RBFNN)technique to obtain the extension sequence before utilizing CEEMDAN decomposition.Then,we compared the decomposition results of the original sequence,RBFNN extension sequence,and standard sequence to investigate the influence of the endpoint effect and RBFNN extension on the CEEMDAN method.The results indicated that the RBFNN extension technique effectively reduced the error of medium and low frequency components caused by the endpoint effect.At both ends of the components,the extension sequence more accurately reflected the true fluctuation characteristics and variation trends.These advances are of great significance to the subsequent study of hydrology.Therefore,the CEEMDAN method,combined with an appropriate extension of the original runoff series,can more precisely determine multi-time scale characteristics,and provide a credible basis for the analysis of hydrologic time series and hydrological forecasting.展开更多
As the development of smart grid and energy internet, this leads to a significantincrease in the amount of data transmitted in real time. Due to the mismatch withcommunication networks that were not designed to carry ...As the development of smart grid and energy internet, this leads to a significantincrease in the amount of data transmitted in real time. Due to the mismatch withcommunication networks that were not designed to carry high-speed and real time data,data losses and data quality degradation may happen constantly. For this problem,according to the strong spatial and temporal correlation of electricity data which isgenerated by human’s actions and feelings, we build a low-rank electricity data matrixwhere the row is time and the column is user. Inspired by matrix decomposition, we dividethe low-rank electricity data matrix into the multiply of two small matrices and use theknown data to approximate the low-rank electricity data matrix and recover the missedelectrical data. Based on the real electricity data, we analyze the low-rankness of theelectricity data matrix and perform the Matrix Decomposition-based method on the realdata. The experimental results verify the efficiency and efficiency of the proposed scheme.展开更多
A novel gappy technology, gappy autoencoder with proper orthogonal decomposition(Gappy POD-AE), is proposed for reconstructing physical fields from sparse data. High-dimensional data are reduced via proper orthogonal ...A novel gappy technology, gappy autoencoder with proper orthogonal decomposition(Gappy POD-AE), is proposed for reconstructing physical fields from sparse data. High-dimensional data are reduced via proper orthogonal decomposition(POD),and low-dimensional data are used to train an autoencoder(AE). By integrating the POD operator with the decoder, a nonlinear solution form is established and incorporated into a new maximum-a-posteriori(MAP)-based objective for online reconstruction.The numerical results on the two-dimensional(2D) Bhatnagar-Gross-Krook-Boltzmann(BGK-Boltzmann) equation, wave equation, shallow-water equation, and satellite data show that Gappy POD-AE achieves higher accuracy than gappy proper orthogonal decomposition(Gappy POD), especially for the data with slowly decaying singular values,and is more efficient in training than gappy autoencoder(Gappy AE). The MAP-based formulation and new gappy procedure further enhance the reconstruction accuracy.展开更多
A modified multiple-component scattering power decomposition for analyzing polarimetric synthetic aperture radar(PolSAR)data is proposed.The modified decomposition involves two distinct steps.Firstly,ei⁃genvectors of ...A modified multiple-component scattering power decomposition for analyzing polarimetric synthetic aperture radar(PolSAR)data is proposed.The modified decomposition involves two distinct steps.Firstly,ei⁃genvectors of the coherency matrix are used to modify the scattering models.Secondly,the entropy and anisotro⁃py of targets are used to improve the volume scattering power.With the guarantee of high double-bounce scatter⁃ing power in the urban areas,the proposed algorithm effectively improves the volume scattering power of vegeta⁃tion areas.The efficacy of the modified multiple-component scattering power decomposition is validated using ac⁃tual AIRSAR PolSAR data.The scattering power obtained through decomposing the original coherency matrix and the coherency matrix after orientation angle compensation is compared with three algorithms.Results from the experiment demonstrate that the proposed decomposition yields more effective scattering power for different PolSAR data sets.展开更多
How can we efficiently store and mine dynamically generated dense tensors for modeling the behavior of multidimensional dynamic data?Much of the multidimensional dynamic data in the real world is generated in the form...How can we efficiently store and mine dynamically generated dense tensors for modeling the behavior of multidimensional dynamic data?Much of the multidimensional dynamic data in the real world is generated in the form of time-growing tensors.For example,air quality tensor data consists of multiple sensory values gathered from wide locations for a long time.Such data,accumulated over time,is redundant and consumes a lot ofmemory in its raw form.We need a way to efficiently store dynamically generated tensor data that increase over time and to model their behavior on demand between arbitrary time blocks.To this end,we propose a Block IncrementalDense Tucker Decomposition(BID-Tucker)method for efficient storage and on-demand modeling ofmultidimensional spatiotemporal data.Assuming that tensors come in unit blocks where only the time domain changes,our proposed BID-Tucker first slices the blocks into matrices and decomposes them via singular value decomposition(SVD).The SVDs of the time×space sliced matrices are stored instead of the raw tensor blocks to save space.When modeling from data is required at particular time blocks,the SVDs of corresponding time blocks are retrieved and incremented to be used for Tucker decomposition.The factor matrices and core tensor of the decomposed results can then be used for further data analysis.We compared our proposed BID-Tucker with D-Tucker,which our method extends,and vanilla Tucker decomposition.We show that our BID-Tucker is faster than both D-Tucker and vanilla Tucker decomposition and uses less memory for storage with a comparable reconstruction error.We applied our proposed BID-Tucker to model the spatial and temporal trends of air quality data collected in South Korea from 2018 to 2022.We were able to model the spatial and temporal air quality trends.We were also able to verify unusual events,such as chronic ozone alerts and large fire events.展开更多
Two methods of computer data processing, linear fitting and nonlinear fitting, are applied to compute the rate constant for hydrogen peroxide decomposition reaction. The results indicate that not only the new methods ...Two methods of computer data processing, linear fitting and nonlinear fitting, are applied to compute the rate constant for hydrogen peroxide decomposition reaction. The results indicate that not only the new methods work with no necessity to measure the final oxygen volume, but also the fitting errors decrease evidently.展开更多
The thermal decomposition process of （NH4）3AlF6 was studied by DTA-TGA method and the related thermodynamic data were obtained. The results show that AlF3 is obtained after three-step decomposition reaction of （NH4...The thermal decomposition process of （NH4）3AlF6 was studied by DTA-TGA method and the related thermodynamic data were obtained. The results show that AlF3 is obtained after three-step decomposition reaction of （NH4）3AlF6, and the solid products of the first two decomposition reactions are NH4AlF4 and AlF3（NH4F）0.69, respectively. The three reactions occur at 194.9, 222.5 and 258.4 ℃, respectively. Gibbs free energy changes of pertinent materials at the reaction temperatures were calculated. Enthalpy and entropy changes of the three reactions were analyzed by DSC method. Anhydrous aluminum fluoride was prepared. The XRD analysis and mass loss calculation show that AlF3 with high purity can be obtained by heating （NH4）3AlF6 at 400 ℃ for 3 h.展开更多
On the software module, this paper proposes a visual specification language(VSL). Based on decomposition, the language imitates men's thinking procedure that decomposes aproblem into smaller ones, then independent...On the software module, this paper proposes a visual specification language(VSL). Based on decomposition, the language imitates men's thinking procedure that decomposes aproblem into smaller ones, then independently solves the results of every small problem to get theresult of original problem (decomposition and synthesis). Besides, the language mixes visual withspecification. With computer supporting, we can implement the software module automatically. It willgreatly improve the quality of software and raise the efficiency of software development. Thesimple definition of VSL, the principle of auto-generation, an example and the future research areintroduced.展开更多
A high robust approach for the additive spread spectrum audio watermarking scheme based on orthogonal decomposition of the host signal has been proposed.By analyzing traditional spread spectrum（SS）,the section of th...A high robust approach for the additive spread spectrum audio watermarking scheme based on orthogonal decomposition of the host signal has been proposed.By analyzing traditional spread spectrum（SS）,the section of the audio signal which is parallel to the direction of watermark signal acts as an interference source in decoder.The watermark is only embedded in the section which is perpendicular to watermark signal in the proposed scheme.In this way,the interference of host signal can be removed completely in decoder.Whether the watermarks have been embedded in the audio or not is researched and an optimal threshold in detector is given to achieve the minimum false alarm probability.The simulation results show that the proposed method can achieve high robustness against various attacks.展开更多
Thermal decomposition course of copper acetate monohydrate was monitored by combining diffuse reflectance infrared Fourier transform spectroscopy (DRIFT) coupled with μ gas chromatography-mass spectrometry (μGC-MS) ...Thermal decomposition course of copper acetate monohydrate was monitored by combining diffuse reflectance infrared Fourier transform spectroscopy (DRIFT) coupled with μ gas chromatography-mass spectrometry (μGC-MS) with other analytical techniques (thermogravimetry analysis and in situ X-ray diffraction). Non-isothermal kinetic was examined in air and Ar. A complete analysis of the evolution of infrared spectra matched with crystalline phase transition data during the course of reaction allows access to significant and accurate information about molecular dynamics. While thermogravimetry gives broad conclusion about two steps reaction (dehydration and decarboxylation), in line approach (in situ X-ray and in situ DRIFT coupled to μGC-MS) is proposed as an example of a new robust and forward-looking analysis. While decomposition mechanism of copper acetate monohydrate is still not well elucidated yet previously, the present in-line characterization results lead to accurate data making the corresponding mechanism explicit.展开更多
Non-negative matrix factorization （NMF） is a technique for dimensionality reduction by placing non-negativity constraints on the matrix. Based on the PARAFAC model, NMF was extended for three-dimension data decompos...Non-negative matrix factorization （NMF） is a technique for dimensionality reduction by placing non-negativity constraints on the matrix. Based on the PARAFAC model, NMF was extended for three-dimension data decomposition. The three-dimension nonnegative matrix factorization （NMF3） algorithm, which was concise and easy to implement, was given in this paper. The NMF3 algorithm implementation was based on elements but not on vectors. It could decompose a data array directly without unfolding, which was not similar to that the traditional algorithms do, It has been applied to the simulated data array decomposition and obtained reasonable results. It showed that NMF3 could be introduced for curve resolution in chemometrics.展开更多
The purpose of this paper is to study the construction of concept lattice from variable formal contexts.Composition and decomposition theories are proposed for the unraveling of concept lattice from contexts with vari...The purpose of this paper is to study the construction of concept lattice from variable formal contexts.Composition and decomposition theories are proposed for the unraveling of concept lattice from contexts with variable attribute set in the process of information updating.The relationship between the extension sets of the original context and that of its sub-context is analyzed.The composition and decomposition theories are then generalized to the situation involving more than two sub-contexts and the situation with variable attribute set and object set.展开更多
A parallel algorithm of circulation numerical model based on message passing interface（MPI） is developed using serialization and an irregular rectangle decomposition scheme. Neighboring point exchange strategy（NPES...A parallel algorithm of circulation numerical model based on message passing interface（MPI） is developed using serialization and an irregular rectangle decomposition scheme. Neighboring point exchange strategy（NPES） is adopted to further enhance the computational efficiency. Two experiments are conducted on HP C7000 Blade System, the numerical results show that the parallel version with NPES（PVN） produces higher efficiency than the original parallel version（PV）. The PVN achieves parallel efficiency in excess of 0.9 in the second experiment when the number of processors increases to 100, while the efficiency of PV decreases to 0.39 rapidly. The PVN of ocean circulation model is used in a fine-resolution regional simulation, which produces better results. The capability of universal implementation of this algorithm makes it applicable in many other ocean models potentially.展开更多
基金This project was supported by the National Natural Science Foundation of China (60532060)Hainan Education Bureau Research Project (Hjkj200602)Hainan Natural Science Foundation (80551).
文摘A nonlinear data analysis algorithm, namely empirical data decomposition （EDD） is proposed, which can perform adaptive analysis of observed data. Analysis filter, which is not a linear constant coefficient filter, is automatically determined by observed data, and is able to implement multi-resolution analysis as wavelet transform. The algorithm is suitable for analyzing non-stationary data and can effectively wipe off the relevance of observed data. Then through discussing the applications of EDD in image compression, the paper presents a 2-dimension data decomposition framework and makes some modifications of contexts used by Embedded Block Coding with Optimized Truncation （EBCOT） . Simulation results show that EDD is more suitable for non-stationary image data compression.
基金supported by the Innovation Foundation of the Chinese Academy of Sciences(No.CXJJ-16Q231)the National Natural Science Foundation of China(No.11305203)+3 种基金the Special Program for Informatization of the Chinese Academy of Sciences(No.XXH12504-1-09)the Anhui Provincial Special Project for High Technology Industrythe Special Project of Youth Innovation Promotion Association of Chinese Academy of Sciencesthe Industrialization Fund
文摘Monte Carlo transport simulations of a full-core reactor with a high-fidelity structure have been made possible by modern-day computing capabilities. Performing transport–burnup calculations of a full-core model typically includes millions of burnup areas requiring hundreds of gigabytes of memory for burnup-related tallies. This paper presents the study of a parallel computing method for full-core Monte Carlo transport–burnup calculations and the development of a thread-level data decomposition method. The proposed method decomposes tally accumulators into different threads and improves the parallel communication pattern and memory access efficiency. A typical pressurized water reactor burnup assembly along with the benchmark for evaluation and validation of reactor simulations model was used to test the proposed method.The result indicates that the method effectively reduces memory consumption and maintains high parallel efficiency.
基金funded by the National Natural Science Foundation of China(Grant No.52274048)Beijing Natural Science Foundation(Grant No.3222037)+1 种基金the CNPC 14th Five-Year Perspective Fundamental Research Project(Grant No.2021DJ2104)the Science Foundation of China University of Petroleum-Beijing(No.2462021YXZZ010).
文摘Recent advances in deep learning have expanded new possibilities for fluid flow simulation in petroleum reservoirs.However,the predominant approach in existing research is to train neural networks using high-fidelity numerical simulation data.This presents a significant challenge because the sole source of authentic wellbore production data for training is sparse.In response to this challenge,this work introduces a novel architecture called physics-informed neural network based on domain decomposition(PINN-DD),aiming to effectively utilize the sparse production data of wells for reservoir simulation with large-scale systems.To harness the capabilities of physics-informed neural networks(PINNs)in handling small-scale spatial-temporal domain while addressing the challenges of large-scale systems with sparse labeled data,the computational domain is divided into two distinct sub-domains:the well-containing and the well-free sub-domain.Moreover,the two sub-domains and the interface are rigorously constrained by the governing equations,data matching,and boundary conditions.The accuracy of the proposed method is evaluated on two problems,and its performance is compared against state-of-the-art PINNs through numerical analysis as a benchmark.The results demonstrate the superiority of PINN-DD in handling large-scale reservoir simulation with limited data and show its potential to outperform conventional PINNs in such scenarios.
基金supported in part by the Interdisciplinary Project of Dalian University(DLUXK-2023-ZD-001).
文摘Multivariate time series forecasting iswidely used in traffic planning,weather forecasting,and energy consumption.Series decomposition algorithms can help models better understand the underlying patterns of the original series to improve the forecasting accuracy of multivariate time series.However,the decomposition kernel of previous decomposition-based models is fixed,and these models have not considered the differences in frequency fluctuations between components.These problems make it difficult to analyze the intricate temporal variations of real-world time series.In this paper,we propose a series decomposition-based Mamba model,DecMamba,to obtain the intricate temporal dependencies and the dependencies among different variables of multivariate time series.A variable-level adaptive kernel combination search module is designed to interact with information on different trends and periods between variables.Two backbone structures are proposed to emphasize the differences in frequency fluctuations of seasonal and trend components.Mamba with superior performance is used instead of a Transformer in backbone structures to capture the dependencies among different variables.A new embedding block is designed to capture the temporal features better,especially for the high-frequency seasonal component whose semantic information is difficult to acquire.A gating mechanism is introduced to the decoder in the seasonal backbone to improve the prediction accuracy.A comparison with ten state-of-the-art models on seven real-world datasets demonstrates that DecMamba can better model the temporal dependencies and the dependencies among different variables,guaranteeing better prediction performance for multivariate time series.
基金supported by Basic Science Research Program through the National Research Foundation of Korea(NRF)funded by the Ministry of Education(NRF-2016R1D1A1B03931529)。
文摘Purpose:We propose In Par Ten2,a multi-aspect parallel factor analysis three-dimensional tensor decomposition algorithm based on the Apache Spark framework.The proposed method reduces re-decomposition cost and can handle large tensors.Design/methodology/approach:Considering that tensor addition increases the size of a given tensor along all axes,the proposed method decomposes incoming tensors using existing decomposition results without generating sub-tensors.Additionally,In Par Ten2 avoids the calculation of Khari–Rao products and minimizes shuffling by using the Apache Spark platform.Findings:The performance of In Par Ten2 is evaluated by comparing its execution time and accuracy with those of existing distributed tensor decomposition methods on various datasets.The results confirm that In Par Ten2 can process large tensors and reduce the re-calculation cost of tensor decomposition.Consequently,the proposed method is faster than existing tensor decomposition algorithms and can significantly reduce re-decomposition cost.Research limitations:There are several Hadoop-based distributed tensor decomposition algorithms as well as MATLAB-based decomposition methods.However,the former require longer iteration time,and therefore their execution time cannot be compared with that of Spark-based algorithms,whereas the latter run on a single machine,thus limiting their ability to handle large data.Practical implications:The proposed algorithm can reduce re-decomposition cost when tensors are added to a given tensor by decomposing them based on existing decomposition results without re-decomposing the entire tensor.Originality/value:The proposed method can handle large tensors and is fast within the limited-memory framework of Apache Spark.Moreover,In Par Ten2 can handle static as well as incremental tensor decomposition.
基金supported by the National Key R&D Program of China(Grant No.2018YFC0406501)Outstanding Young Talent Research Fund of Zhengzhou Uni-versity(Grant No.1521323002)+2 种基金Program for Innovative Talents(in Science and Technology)at University of Henan Province(Grant No.18HASTIT014)State Key Laboratory of Hydraulic Engineering Simulation and Safety,Tianjin University(Grant No.HESS-1717)Foundation for University Youth Key Teacher of Henan Province(Grant No.2017GGJS006).
文摘The complex nonlinear and non-stationary features exhibited in hydrologic sequences make hydrological analysis and forecasting difficult.Currently,some hydrologists employ the complete ensemble empirical mode decomposition with adaptive noise(CEEMDAN)method,a new time-frequency analysis method based on the empirical mode decomposition(EMD)algorithm,to decompose non-stationary raw data in order to obtain relatively stationary components for further study.However,the endpoint effect in CEEMDAN is often neglected,which can lead to decomposition errors that reduce the accuracy of the research results.In this study,we processed an original runoff sequence using the radial basis function neural network(RBFNN)technique to obtain the extension sequence before utilizing CEEMDAN decomposition.Then,we compared the decomposition results of the original sequence,RBFNN extension sequence,and standard sequence to investigate the influence of the endpoint effect and RBFNN extension on the CEEMDAN method.The results indicated that the RBFNN extension technique effectively reduced the error of medium and low frequency components caused by the endpoint effect.At both ends of the components,the extension sequence more accurately reflected the true fluctuation characteristics and variation trends.These advances are of great significance to the subsequent study of hydrology.Therefore,the CEEMDAN method,combined with an appropriate extension of the original runoff series,can more precisely determine multi-time scale characteristics,and provide a credible basis for the analysis of hydrologic time series and hydrological forecasting.
文摘As the development of smart grid and energy internet, this leads to a significantincrease in the amount of data transmitted in real time. Due to the mismatch withcommunication networks that were not designed to carry high-speed and real time data,data losses and data quality degradation may happen constantly. For this problem,according to the strong spatial and temporal correlation of electricity data which isgenerated by human’s actions and feelings, we build a low-rank electricity data matrixwhere the row is time and the column is user. Inspired by matrix decomposition, we dividethe low-rank electricity data matrix into the multiply of two small matrices and use theknown data to approximate the low-rank electricity data matrix and recover the missedelectrical data. Based on the real electricity data, we analyze the low-rankness of theelectricity data matrix and perform the Matrix Decomposition-based method on the realdata. The experimental results verify the efficiency and efficiency of the proposed scheme.
基金supported by the National Natural Science Foundation of China(No.12472197)。
文摘A novel gappy technology, gappy autoencoder with proper orthogonal decomposition(Gappy POD-AE), is proposed for reconstructing physical fields from sparse data. High-dimensional data are reduced via proper orthogonal decomposition(POD),and low-dimensional data are used to train an autoencoder(AE). By integrating the POD operator with the decoder, a nonlinear solution form is established and incorporated into a new maximum-a-posteriori(MAP)-based objective for online reconstruction.The numerical results on the two-dimensional(2D) Bhatnagar-Gross-Krook-Boltzmann(BGK-Boltzmann) equation, wave equation, shallow-water equation, and satellite data show that Gappy POD-AE achieves higher accuracy than gappy proper orthogonal decomposition(Gappy POD), especially for the data with slowly decaying singular values,and is more efficient in training than gappy autoencoder(Gappy AE). The MAP-based formulation and new gappy procedure further enhance the reconstruction accuracy.
基金Supported by the National Natural Science Foundation of China(62376214)the Natural Science Basic Research Program of Shaanxi(2023-JC-YB-533)Foundation of Ministry of Education Key Lab.of Cognitive Radio and Information Processing(Guilin University of Electronic Technology)(CRKL200203)。
文摘A modified multiple-component scattering power decomposition for analyzing polarimetric synthetic aperture radar(PolSAR)data is proposed.The modified decomposition involves two distinct steps.Firstly,ei⁃genvectors of the coherency matrix are used to modify the scattering models.Secondly,the entropy and anisotro⁃py of targets are used to improve the volume scattering power.With the guarantee of high double-bounce scatter⁃ing power in the urban areas,the proposed algorithm effectively improves the volume scattering power of vegeta⁃tion areas.The efficacy of the modified multiple-component scattering power decomposition is validated using ac⁃tual AIRSAR PolSAR data.The scattering power obtained through decomposing the original coherency matrix and the coherency matrix after orientation angle compensation is compared with three algorithms.Results from the experiment demonstrate that the proposed decomposition yields more effective scattering power for different PolSAR data sets.
基金supported by the Institute of Information&Communications Technology Planning&Evaluation (IITP)grant funded by the Korean government (MSIT) (No.2022-0-00369)by the NationalResearch Foundation of Korea Grant funded by the Korean government (2018R1A5A1060031,2022R1F1A1065664).
文摘How can we efficiently store and mine dynamically generated dense tensors for modeling the behavior of multidimensional dynamic data?Much of the multidimensional dynamic data in the real world is generated in the form of time-growing tensors.For example,air quality tensor data consists of multiple sensory values gathered from wide locations for a long time.Such data,accumulated over time,is redundant and consumes a lot ofmemory in its raw form.We need a way to efficiently store dynamically generated tensor data that increase over time and to model their behavior on demand between arbitrary time blocks.To this end,we propose a Block IncrementalDense Tucker Decomposition(BID-Tucker)method for efficient storage and on-demand modeling ofmultidimensional spatiotemporal data.Assuming that tensors come in unit blocks where only the time domain changes,our proposed BID-Tucker first slices the blocks into matrices and decomposes them via singular value decomposition(SVD).The SVDs of the time×space sliced matrices are stored instead of the raw tensor blocks to save space.When modeling from data is required at particular time blocks,the SVDs of corresponding time blocks are retrieved and incremented to be used for Tucker decomposition.The factor matrices and core tensor of the decomposed results can then be used for further data analysis.We compared our proposed BID-Tucker with D-Tucker,which our method extends,and vanilla Tucker decomposition.We show that our BID-Tucker is faster than both D-Tucker and vanilla Tucker decomposition and uses less memory for storage with a comparable reconstruction error.We applied our proposed BID-Tucker to model the spatial and temporal trends of air quality data collected in South Korea from 2018 to 2022.We were able to model the spatial and temporal air quality trends.We were also able to verify unusual events,such as chronic ozone alerts and large fire events.
文摘Two methods of computer data processing, linear fitting and nonlinear fitting, are applied to compute the rate constant for hydrogen peroxide decomposition reaction. The results indicate that not only the new methods work with no necessity to measure the final oxygen volume, but also the fitting errors decrease evidently.
基金Project(51004034)supported by the National Natural Science Foundation of ChinaProject(N090302009)supported by the Fundamental Research Funds for the Central Universities,China
文摘The thermal decomposition process of （NH4）3AlF6 was studied by DTA-TGA method and the related thermodynamic data were obtained. The results show that AlF3 is obtained after three-step decomposition reaction of （NH4）3AlF6, and the solid products of the first two decomposition reactions are NH4AlF4 and AlF3（NH4F）0.69, respectively. The three reactions occur at 194.9, 222.5 and 258.4 ℃, respectively. Gibbs free energy changes of pertinent materials at the reaction temperatures were calculated. Enthalpy and entropy changes of the three reactions were analyzed by DSC method. Anhydrous aluminum fluoride was prepared. The XRD analysis and mass loss calculation show that AlF3 with high purity can be obtained by heating （NH4）3AlF6 at 400 ℃ for 3 h.
文摘On the software module, this paper proposes a visual specification language(VSL). Based on decomposition, the language imitates men's thinking procedure that decomposes aproblem into smaller ones, then independently solves the results of every small problem to get theresult of original problem (decomposition and synthesis). Besides, the language mixes visual withspecification. With computer supporting, we can implement the software module automatically. It willgreatly improve the quality of software and raise the efficiency of software development. Thesimple definition of VSL, the principle of auto-generation, an example and the future research areintroduced.
基金Supported by the National Natural Science Foundation of China(61471271)
文摘A high robust approach for the additive spread spectrum audio watermarking scheme based on orthogonal decomposition of the host signal has been proposed.By analyzing traditional spread spectrum（SS）,the section of the audio signal which is parallel to the direction of watermark signal acts as an interference source in decoder.The watermark is only embedded in the section which is perpendicular to watermark signal in the proposed scheme.In this way,the interference of host signal can be removed completely in decoder.Whether the watermarks have been embedded in the audio or not is researched and an optimal threshold in detector is given to achieve the minimum false alarm probability.The simulation results show that the proposed method can achieve high robustness against various attacks.
文摘Thermal decomposition course of copper acetate monohydrate was monitored by combining diffuse reflectance infrared Fourier transform spectroscopy (DRIFT) coupled with μ gas chromatography-mass spectrometry (μGC-MS) with other analytical techniques (thermogravimetry analysis and in situ X-ray diffraction). Non-isothermal kinetic was examined in air and Ar. A complete analysis of the evolution of infrared spectra matched with crystalline phase transition data during the course of reaction allows access to significant and accurate information about molecular dynamics. While thermogravimetry gives broad conclusion about two steps reaction (dehydration and decarboxylation), in line approach (in situ X-ray and in situ DRIFT coupled to μGC-MS) is proposed as an example of a new robust and forward-looking analysis. While decomposition mechanism of copper acetate monohydrate is still not well elucidated yet previously, the present in-line characterization results lead to accurate data making the corresponding mechanism explicit.
文摘Non-negative matrix factorization （NMF） is a technique for dimensionality reduction by placing non-negativity constraints on the matrix. Based on the PARAFAC model, NMF was extended for three-dimension data decomposition. The three-dimension nonnegative matrix factorization （NMF3） algorithm, which was concise and easy to implement, was given in this paper. The NMF3 algorithm implementation was based on elements but not on vectors. It could decompose a data array directly without unfolding, which was not similar to that the traditional algorithms do, It has been applied to the simulated data array decomposition and obtained reasonable results. It showed that NMF3 could be introduced for curve resolution in chemometrics.
基金supported by grants from the National Natural Science Foundation of China(No.60703117 and No.11071281)the Fundamental Research Funds for the Central Universities(No.JY 10000903010 and No.JY 10000903014).
文摘The purpose of this paper is to study the construction of concept lattice from variable formal contexts.Composition and decomposition theories are proposed for the unraveling of concept lattice from contexts with variable attribute set in the process of information updating.The relationship between the extension sets of the original context and that of its sub-context is analyzed.The composition and decomposition theories are then generalized to the situation involving more than two sub-contexts and the situation with variable attribute set and object set.
基金The National High Technology Research and Development Program(863 Program)of China under contract No.2013AA09A505
文摘A parallel algorithm of circulation numerical model based on message passing interface（MPI） is developed using serialization and an irregular rectangle decomposition scheme. Neighboring point exchange strategy（NPES） is adopted to further enhance the computational efficiency. Two experiments are conducted on HP C7000 Blade System, the numerical results show that the parallel version with NPES（PVN） produces higher efficiency than the original parallel version（PV）. The PVN achieves parallel efficiency in excess of 0.9 in the second experiment when the number of processors increases to 100, while the efficiency of PV decreases to 0.39 rapidly. The PVN of ocean circulation model is used in a fine-resolution regional simulation, which produces better results. The capability of universal implementation of this algorithm makes it applicable in many other ocean models potentially.
