Modified multiple-component scattering power decomposition for PolSAR data based on eigenspace of coherency matrix

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.

Block Incremental Dense Tucker Decomposition with Application to Spatial and Temporal Analysis of Air Quality Data

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.

Physics-informed neural network-based petroleum reservoir simulation with sparse data using domain decomposition

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.

Empirical data decomposition and its applications in image compression

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.

Data decomposition method for full-core Monte Carlo transport–burnup calculation

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.

Study on the Improvement of the Application of Complete Ensemble Empirical Mode Decomposition with Adaptive Noise in Hydrology Based on RBFNN Data Extension Technology

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.

Electrical Data Matrix Decomposition in Smart Grid

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.

Multi-Aspect Incremental Tensor Decomposition Based on Distributed In-Memory Big Data Systems

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.

Computer Data Processing of the Hydrogen Peroxide Decomposition Reaction

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.

Thermal decomposition of ammonium hexafluoroaluminate and preparation of aluminum fluoride

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.

Decomposition-Based Visual Function Specification and Auto-Generation of Function

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.

Forward Looking Analysis Approach to Assess Copper Acetate Thermal Decomposition Reaction Mechanism

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.

A novel trilinear decomposition algorithm:Three-dimension non-negative matrix factorization

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.

Concept Lattice Construction through the Composition and Decomposition of Formal Contexts

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.

Missing interpolation model for wind power data based on the improved CEEMDAN method and generative adversarial interpolation network

Randomness and fluctuations in wind power output may cause changes in important parameters(e.g.,grid frequency and voltage),which in turn affect the stable operation of a power system.However,owing to external factors(such as weather),there are often various anomalies in wind power data,such as missing numerical values and unreasonable data.This significantly affects the accuracy of wind power generation predictions and operational decisions.Therefore,developing and applying reliable wind power interpolation methods is important for promoting the sustainable development of the wind power industry.In this study,the causes of abnormal data in wind power generation were first analyzed from a practical perspective.Second,an improved complete ensemble empirical mode decomposition with adaptive noise(ICEEMDAN)method with a generative adversarial interpolation network(GAIN)network was proposed to preprocess wind power generation and interpolate missing wind power generation sub-components.Finally,a complete wind power generation time series was reconstructed.Compared to traditional methods,the proposed ICEEMDAN-GAIN combination interpolation model has a higher interpolation accuracy and can effectively reduce the error impact caused by wind power generation sequence fluctuations.

An efficient parallel algorithm for ocean circulation numerical model based on irregular rectangle decomposition scheme

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.

基于动响应数据特征的桥梁结构损伤识别

介绍了本征正交分解(Proper Orthogonal Decomposition,POD)的基本原理,探讨了POD在桥梁结构损伤识别中的应用。提出了基于动响应数据特征的桥梁结构损伤识别方法,该识别方法基于POD技术对桥梁结构在不同位置、不同时刻收集到的位移快照矩阵(Snapshot Matrix)进行本征正交分解,得到结构的本征正交模态(POMs),进而构造出损伤指标来识别结构的损伤位置及程度,实现了对桥梁结构损伤的多工况识别。并以保定黄花沟桥为例,通过数值模拟试验,验证了该方法的有效性,结果表明POD能够从空心板桥结构的振动响应数据中提取出结构的本质特征,并且提取过程简单、快捷,可为桥梁结构提供一种有效的损伤识别方法。

基于POD/DMD降阶模型的离心泵蜗壳内非稳态流动分析

为深入研究离心泵蜗壳内非线性耦合流动的本质流动特征,本文以一单级单吸式离心泵蜗壳为研究对象,分别采用本征正交分解和动态模态分解2种降阶模型对蜗壳内非定常流场数据进行模态分析,获取流场主导流动结构,并对原流场进行重构。研究发现:蜗壳内流结构主要由速度正负交错,并且周期性特征与叶频及其倍频相关的成对涡旋组成。本征正交分解和动态模态分解方法均可以捕捉流场主要流动结构,并对原流场进行准确还原,两者重构流场与原流场的均方根误差均在0.4%以内。尽管本征正交分解方法在重构流场时整体均方根误差更小,但无法获取单频率流动结构,而动态模态分解方法可以获得不同频率流动结构对流场的贡献,从而捕捉到复杂流场中的不稳定模态。研究成果可以为增强离心泵全局流动的认知、关键水力部件优化设计及发展主/被动流动控制提供理论参考。