Online identification and extraction method of regional large-scale adjustable load-aggregation characteristics

This article introduces the concept of load aggregation,which involves a comprehensive analysis of loads to acquire their external characteristics for the purpose of modeling and analyzing power systems.The online identification method is a computer-involved approach for data collection,processing,and system identification,commonly used for adaptive control and prediction.This paper proposes a method for dynamically aggregating large-scale adjustable loads to support high proportions of new energy integration,aiming to study the aggregation characteristics of regional large-scale adjustable loads using online identification techniques and feature extraction methods.The experiment selected 300 central air conditioners as the research subject and analyzed their regulation characteristics,economic efficiency,and comfort.The experimental results show that as the adjustment time of the air conditioner increases from 5 minutes to 35 minutes,the stable adjustment quantity during the adjustment period decreases from 28.46 to 3.57,indicating that air conditioning loads can be controlled over a long period and have better adjustment effects in the short term.Overall,the experimental results of this paper demonstrate that analyzing the aggregation characteristics of regional large-scale adjustable loads using online identification techniques and feature extraction algorithms is effective.

AHermitian C^(2) Differential Reproducing Kernel Interpolation Meshless Method for the 3D Microstructure-Dependent Static Flexural Analysis of Simply Supported and Functionally Graded Microplates

This work develops a Hermitian C^(2) differential reproducing kernel interpolation meshless(DRKIM)method within the consistent couple stress theory(CCST)framework to study the three-dimensional(3D)microstructuredependent static flexural behavior of a functionally graded(FG)microplate subjected to mechanical loads and placed under full simple supports.In the formulation,we select the transverse stress and displacement components and their first-and second-order derivatives as primary variables.Then,we set up the differential reproducing conditions(DRCs)to obtain the shape functions of the Hermitian C^(2) differential reproducing kernel(DRK)interpolant’s derivatives without using direct differentiation.The interpolant’s shape function is combined with a primitive function that possesses Kronecker delta properties and an enrichment function that constituents DRCs.As a result,the primary variables and their first-and second-order derivatives satisfy the nodal interpolation properties.Subsequently,incorporating ourHermitianC^(2)DRKinterpolant intothe strong formof the3DCCST,we develop a DRKIM method to analyze the FG microplate’s 3D microstructure-dependent static flexural behavior.The Hermitian C^(2) DRKIM method is confirmed to be accurate and fast in its convergence rate by comparing the solutions it produces with the relevant 3D solutions available in the literature.Finally,the impact of essential factors on the transverse stresses,in-plane stresses,displacements,and couple stresses that are induced in the loaded microplate is examined.These factors include the length-to-thickness ratio,the material length-scale parameter,and the inhomogeneity index,which appear to be significant.

Adaptive multi-step piecewise interpolation reproducing kernel method for solving the nonlinear time-fractional partial differential equation arising from financial economics

This paper is aimed at solving the nonlinear time-fractional partial differential equation with two small parameters arising from option pricing model in financial economics.The traditional reproducing kernel(RK)method which deals with this problem is very troublesome.This paper proposes a new method by adaptive multi-step piecewise interpolation reproducing kernel(AMPIRK)method for the first time.This method has three obvious advantages which are as follows.Firstly,the piecewise number is reduced.Secondly,the calculation accuracy is improved.Finally,the waste time caused by too many fragments is avoided.Then four numerical examples show that this new method has a higher precision and it is a more timesaving numerical method than the others.The research in this paper provides a powerful mathematical tool for solving time-fractional option pricing model which will play an important role in financial economics.

A deep kernel method for lithofacies identification using conventional well logs

How to fit a properly nonlinear classification model from conventional well logs to lithofacies is a key problem for machine learning methods.Kernel methods(e.g.,KFD,SVM,MSVM)are effective attempts to solve this issue due to abilities of handling nonlinear features by kernel functions.Deep mining of log features indicating lithofacies still needs to be improved for kernel methods.Hence,this work employs deep neural networks to enhance the kernel principal component analysis(KPCA)method and proposes a deep kernel method(DKM)for lithofacies identification using well logs.DKM includes a feature extractor and a classifier.The feature extractor consists of a series of KPCA models arranged according to residual network structure.A gradient-free optimization method is introduced to automatically optimize parameters and structure in DKM,which can avoid complex tuning of parameters in models.To test the validation of the proposed DKM for lithofacies identification,an open-sourced dataset with seven con-ventional logs(GR,CAL,AC,DEN,CNL,LLD,and LLS)and lithofacies labels from the Daniudi Gas Field in China is used.There are eight lithofacies,namely clastic rocks(pebbly,coarse,medium,and fine sand-stone,siltstone,mudstone),coal,and carbonate rocks.The comparisons between DKM and three commonly used kernel methods(KFD,SVM,MSVM)show that(1)DKM(85.7%)outperforms SVM(77%),KFD(79.5%),and MSVM(82.8%)in accuracy of lithofacies identification;(2)DKM is about twice faster than the multi-kernel method(MSVM)with good accuracy.The blind well test in Well D13 indicates that compared with the other three methods DKM improves about 24%in accuracy,35%in precision,41%in recall,and 40%in F1 score,respectively.In general,DKM is an effective method for complex lithofacies identification.This work also discussed the optimal structure and classifier for DKM.Experimental re-sults show that(m_(1),m_(2),O)is the optimal model structure and linear svM is the optimal classifier.(m_(1),m_(2),O)means there are m KPCAs,and then m2 residual units.A workflow to determine an optimal classifier in DKM for lithofacies identification is proposed,too.

On the Approximation of Fractal-Fractional Differential Equations Using Numerical Inverse Laplace Transform Methods

Laplace transform is one of the powerful tools for solving differential equations in engineering and other science subjects.Using the Laplace transform for solving differential equations,however,sometimes leads to solutions in the Laplace domain that are not readily invertible to the real domain by analyticalmeans.Thus,we need numerical inversionmethods to convert the obtained solution fromLaplace domain to a real domain.In this paper,we propose a numerical scheme based on Laplace transform and numerical inverse Laplace transform for the approximate solution of fractal-fractional differential equations with orderα,β.Our proposed numerical scheme is based on three main steps.First,we convert the given fractal-fractional differential equation to fractional-differential equation in Riemann-Liouville sense,and then into Caputo sense.Secondly,we transformthe fractional differential equation in Caputo sense to an equivalent equation in Laplace space.Then the solution of the transformed equation is obtained in Laplace domain.Finally,the solution is converted into the real domain using numerical inversion of Laplace transform.Three inversion methods are evaluated in this paper,and their convergence is also discussed.Three test problems are used to validate the inversion methods.We demonstrate our results with the help of tables and figures.The obtained results show that Euler’s and Talbot’s methods performed better than Stehfest’s method.

Galaxy Interactions in Filaments and Sheets:Effects of the Large-scale Structures Versus the Local Density

Major interactions are known to trigger star formation in galaxies and alter their color.We study the major interactions in filaments and sheets using SDSS data to understand the influence of large-scale environments on galaxy interactions.We identify the galaxies in filaments and sheets using the local dimension and also find the major pairs residing in these environments.The star formation rate(SFR) and color of the interacting galaxies as a function of pair separation are separately analyzed in filaments and sheets.The analysis is repeated for three volume limited samples covering different magnitude ranges.The major pairs residing in the filaments show a significantly higher SFR and bluer color than those residing in the sheets up to the projected pair separation of~50 kpc.We observe a complete reversal of this behavior for both the SFR and color of the galaxy pairs having a projected separation larger than 50 kpc.Some earlier studies report that the galaxy pairs align with the filament axis.Such alignment inside filaments indicates anisotropic accretion that may cause these differences.We do not observe these trends in the brighter galaxy samples.The pairs in filaments and sheets from the brighter galaxy samples trace relatively denser regions in these environments.The absence of these trends in the brighter samples may be explained by the dominant effect of the local density over the effects of the large-scale environment.

High-efciency improved symmetric successive over-relaxation preconditioned conjugate gradient method for solving large-scale finite element linear equations

Fast solving large-scale linear equations in the finite element analysis is a classical subject in computational mechanics. It is a key technique in computer aided engineering （CAE） and computer aided manufacturing （CAM）. This paper presents a high-efficiency improved symmetric successive over-relaxation （ISSOR） preconditioned conjugate gradient （PCG） method, which maintains lelism consistent with the original form. Ideally, the by 50% as compared with the original algorithm. the convergence and inherent paralcomputation can It is suitable for be reduced nearly high-performance computing with its inherent basic high-efficiency operations. By comparing with the numerical results, it is shown that the proposed method has the best performance.

Nuclear charge radius predictions by kernel ridge regression with odd-even effects

The extended kernel ridge regression(EKRR)method with odd-even effects was adopted to improve the description of the nuclear charge radius using five commonly used nuclear models.These are:(i)the isospin-dependent A^(1∕3) formula,(ii)relativistic continuum Hartree-Bogoliubov(RCHB)theory,(iii)Hartree-Fock-Bogoliubov(HFB)model HFB25,(iv)the Weizsacker-Skyrme(WS)model WS*,and(v)HFB25*model.In the last two models,the charge radii were calculated using a five-parameter formula with the nuclear shell corrections and deformations obtained from the WS and HFB25 models,respectively.For each model,the resultant root-mean-square deviation for the 1014 nuclei with proton number Z≥8 can be significantly reduced to 0.009-0.013 fm after considering the modification with the EKRR method.The best among them was the RCHB model,with a root-mean-square deviation of 0.0092 fm.The extrapolation abilities of the KRR and EKRR methods for the neutron-rich region were examined,and it was found that after considering the odd-even effects,the extrapolation power was improved compared with that of the original KRR method.The strong odd-even staggering of nuclear charge radii of Ca and Cu isotopes and the abrupt kinks across the neutron N=126 and 82 shell closures were also calculated and could be reproduced quite well by calculations using the EKRR method.

A SPARSE SUBSPACE TRUNCATED NEWTON METHOD FOR LARGE-SCALE BOUND CONSTRAINED NONLINEAR OPTIMIZATION

In this paper we report a sparse truncated Newton algorithm for handling large-scale simple bound nonlinear constrained minimixation problem. The truncated Newton method is used to update the variables with indices outside of the active set, while the projected gradient method is used to update the active variables. At each iterative level, the search direction consists of three parts, one of which is a subspace truncated Newton direction, the other two are subspace gradient and modified gradient directions. The subspace truncated Newton direction is obtained by solving a sparse system of linear equations. The global convergence and quadratic convergence rate of the algorithm are proved and some numerical tests are given.

Free-Interface Dual-Compatibility Modal Synthesis Substructure Method in Large-Scale Structures

Free-interface dual-compatibility modal synthesis method(compatibility of both force and displacement on interfaces)is introduced to large-scale civil engineering structure to enhance computation efficiency. The basic equations of the method are first set up, and then the mode cut-off principle and the dividing principle are proposed. MATLAB is used for simulation in different frame structures. The simulation results demonstrate the applicability of this substructure method to civil engineering structures and the correctness of the proposed mode cut-off principle. Studies are also conducted on how to divide the whole structure for better computation efficiency while maintaining better precision. It is observed that the geometry and material properties should be considered, and the synthesis results would be more precise when the inflection points of the mode shapes are taken into consideration. Furthermore, the simulation performed on a large-scale high-rise connected structure further proves the feasibility and efficiency of this modal synthesis method compared with the traditional global method. It is also concluded from the simulation results that the fewer number of DOFs in each substructure will result in better computation efficiency, but too many substructures will be time-consuming due to the tedious synthesis procedures. Moreover, the substructures with free interface will introduce errors and reduce the precision dramatically, which should be avoided.

h-ADAPTIVITY ANALYSIS BASED ON MULTIPLE SCALE REPRODUCING KERNEL PARTICLE METHOD

An h-adaptivity analysis scheme based on multiple scale reproducing kernel particle method was proposed, and two node refinement strategies were constructed using searching-neighbor-nodes(SNN) and local-Delaunay-triangulation(LDT) tech-niques, which were suitable and effective for h-adaptivity analysis on 2-D problems with the regular or irregular distribution of the nodes. The results of multiresolution and h-adaptivity analyses on 2-D linear elastostatics and bending plate problems demonstrate that the improper high-gradient indicator will reduce the convergence property of the h-adaptivity analysis, and that the efficiency of the LDT node refinement strategy is better than SNN, and that the presented h-adaptivity analysis scheme is provided with the validity, stability and good convergence property.

h-ADAPTIVITY ANALYSIS BASED ON MULTIPLE SCALE REPRODUCING KERNEL PARTICLE METHOD

An h-adaptivity analysis scheme based on multiple scale reproducing kernel particle method was proposed, and two node refinement strategies were constructed using searching-neighbor-nodes（SNN） and local-Delaunay-triangulation（LDT） techniques, which were suitable and effective for h-adaptivity analysis on 2-D problems with the regular or irregular distribution of the nodes. The results of multiresolution and h- adaptivity analyses on 2-D linear elastostatics and bending plate problems demonstrate that the improper high-gradient indicator will reduce the convergence property of the h- adaptivity analysis, and that the efficiency of the LDT node refinement strategy is better than SNN, and that the presented h-adaptivity analysis scheme is provided with the validity, stability and good convergence property.

The complex variable reproducing kernel particle method for two-dimensional elastodynamics

On the basis of the reproducing kernel particle method （RKPM）, a new meshless method, which is called the complex variable reproducing kernel particle method （CVRKPM）, for two-dimensional elastodynamics is presented in this paper. The advantages of the CVRKPM are that the correction function of a two-dimensional problem is formed with one-dimensional basis function when the shape function is obtained. The Galerkin weak form is employed to obtain the discretised system equations, and implicit time integration method, which is the Newmark method, is used for time history analysis. And the penalty method is employed to apply the essential boundary conditions. Then the corresponding formulae of the CVRKPM for two-dimensional elastodynamics are obtained. Three numerical examples of two-dimensional elastodynamics are presented, and the CVRKPM results are compared with the ones of the RKPM and analytical solutions. It is evident that the numerical results of the CVRKPM are in excellent agreement with the analytical solution, and that the CVRKPM has greater precision than the RKPM.

ANALYSIS OF THREE-DIMENSIONAL UPSETTING PROCESS BY THE RIGID-PLASTIC REPRODUCING KERNEL PARTICLE METHOD

A meshless approach, called the rigid-plastic reproducing kernel particle method （RKPM）, is presented for three-dimensional （3D） bulk metal forming simulation. The approach is a combination of RKPM with the flow theory of 3D rigid-plastic mechanics. For the treatments of essential boundary conditions and incompressibility constraint, the boundary singular kernel method and the modified penalty method are utilized, respectively. The arc-tangential friction model is employed to treat the contact conditions. The compression of rectangular blocks, a typical 3D upsetting operation, is analyzed for different friction conditions and the numerical results are compared with those obtained using commercial rigid-plastic FEM （finite element method） software Deform^3D. As results show, when handling 3D plastic deformations, the proposed approach eliminates the need of expensive meshing and remeshing procedures which are unavoidable in conventional FEM and can provide results that are in good agreement with finite element predictions.

Combining the complex variable reproducing kernel particle method and the finite element method for solving transient heat conduction problems

In this paper, the complex variable reproducing kernel particle （CVRKP） method and the finite element （FE） method are combined as the CVRKP-FE method to solve transient heat conduction problems. The CVRKP-FE method not only conveniently imposes the essential boundary conditions, but also exploits the advantages of the individual methods while avoiding their disadvantages, then the computational efficiency is higher. A hybrid approximation function is applied to combine the CVRKP method with the FE method, and the traditional difference method for two-point boundary value problems is selected as the time discretization scheme. The corresponding formulations of the CVRKP-FE method are presented in detail. Several selected numerical examples of the transient heat conduction problems are presented to illustrate the performance of the CVRKP-FE method.

An interpolating reproducing kernel particle method for two-dimensional scatter points

An interpolating reproducing kernel particle method for two-dimensional （2D） scatter points is introduced. It elim- inates the dependency of gridding in numerical calculations. The interpolating shape function in the interpolating repro- ducing kernel particle method satisfies the property of the Kronecker delta function. This method offers a mathematics basis for recognition technology and simulation analysis, which can be expressed as simultaneous differential equations in science or project problems. Mathematical examples are given to show the validity of the interpolating reproducing kernel particle method.

Kernel method-based fuzzy clustering algorithm

The fuzzy C-means clustering algorithm(FCM) to the fuzzy kernel C-means clustering algorithm(FKCM) to effectively perform cluster analysis on the diversiform structures are extended, such as non-hyperspherical data, data with noise, data with mixture of heterogeneous cluster prototypes, asymmetric data, etc. Based on the Mercer kernel, FKCM clustering algorithm is derived from FCM algorithm united with kernel method. The results of experiments with the synthetic and real data show that the FKCM clustering algorithm is universality and can effectively unsupervised analyze datasets with variform structures in contrast to FCM algorithm. It is can be imagined that kernel-based clustering algorithm is one of important research direction of fuzzy clustering analysis.

Kohn-Sham Density Matrix and the Kernel Energy Method

The kernel energy method(KEM) has been shown to provide fast and accurate molecular energy calculations for molecules at their equilibrium geometries.KEM breaks a molecule into smaller subsets,called kernels,for the purposes of calculation.The results from the kernels are summed according to an expression characteristic of KEM to obtain the full molecule energy.A generalization of the kernel expansion to density matrices provides the full molecule density matrix and orbitals.In this study,the kernel expansion for the density matrix is examined in the context of density functional theory(DFT) Kohn-Sham(KS) calculations.A kernel expansion for the one-body density matrix analogous to the kernel expansion for energy is defined,and is then converted into a normalizedprojector by using the Clinton algorithm.Such normalized projectors are factorizable into linear combination of atomic orbitals(LCAO) matrices that deliver full-molecule Kohn-Sham molecular orbitals in the atomic orbital basis.Both straightforward KEM energies and energies from a normalized,idempotent density matrix obtained from a density matrix kernel expansion to which the Clinton algorithm has been applied are compared to reference energies obtained from calculations on the full system without any kernel expansion.Calculations were performed both for a simple proof-of-concept system consisting of three atoms in a linear configuration and for a water cluster consisting of twelve water molecules.In the case of the proof-of-concept system,calculations were performed using the STO-3 G and6-31 G(d,p) bases over a range of atomic separations,some very far from equilibrium.The water cluster was calculated in the 6-31 G(d,p) basis at an equilibrium geometry.The normalized projector density energies are more accurate than the straightforward KEM energy results in nearly all cases.In the case of the water cluster,the energy of the normalized projector is approximately four times more accurate than the straightforward KEM energy result.The KS density matrices of this study are applicable to quantum crystallography.

Study of corn kernel breakage susceptibility as a function of its moisture content by using a laboratory grinding method

The rate of corn kernel breakage in the grain combine harvesters is a crucial factor affecting the quality of the grain shelled in the field. The objective of the present study was to determine the susceptibility of corn kernels to breakage based on the kernel moisture content in order to determine the moisture content that corresponds to the lowest rate of breakage.In addition, we evaluated the resistance to breakage of various corn cultivars. A total of 17 different corn cultivars were planted at two different sowing dates at the Beibuchang Experiment Station, Beijing and the Xinxiang Experiment Station(Henan Province) of the Chinese Academy of Agricultural Sciences. The corn kernel moisture content was systematically monitored and recorded over time, and the breakage rate was measured by using the grinding method. The results for all grain samples from the two experimental stations revealed that the breakage rate y is quadratic in moisture content x,y=0.0796 x^(2)-3.3929 x+78.779;R^(2)0=0.2646, n=512. By fitting to the regression equation, a minimum corn kernel breakage rate of 42.62% was obtained, corresponding to a corn kernel moisture content of 21.31%. Furthermore, in the 90% confidence interval, the corn kernel moisture ranging from 19.7 to 22.3% led to the lowest kernel breakage rate, which was consistent with the corn kernel moisture content allowing the lowest breakage rate of corn kernels shelled in the field with combine grain harvesters. Using the lowest breakage rate as the critical point, the correlation between breakage rate and moisture content was significantly negative for low moisture content but positive for high moisture content. The slope and correlation coefficient of the linear regression equation indicated that high moisture content led to greater sensitivity and correlation between grain breakage and moisture content. At the Beibuchang Experiment Station, the corn cultivars resistant to breakage were Zhengdan 958(ZD958) and Fengken 139(FK139), and the corn cultivars non-resistant to breakage were Lianchuang 825(LC825), Jidan 66(JD66), Lidan 295(LD295), and Jingnongke 728(JNK728). At the Xinxiang Experiment Station, the corn cultivars resistant to breakage were HT1, ZD958 and FK139, and the corn cultivars non-resistant to breakage were ZY8911, DK653 and JNK728. Thus, the breakage classifications of the six corn cultivars were consistent between the two experimental stations. In conclusion, the results suggested that the high stability of the grinding method allowed it to be used to determine the corn kernel breakage rates of different corn cultivars as a function of moisture content, thus facilitating the breeding and screening of breakage-resistant corn.