基于Meta-Gaussian模型的陕西省农业干旱风险评估

近年来,世界各地高温干旱复合极端气候事件频发,导致农业干旱风险加剧,严重威胁区域的粮食安全和水资源安全。因此,定量评估高温干旱复合事件驱动下的农业干旱风险对防旱减灾具有重要意义。分别以6个月尺度的标准化降水指数(SPI)、3个月尺度的标准化温度指数(STI)和标准化土壤湿度指数(SSI)表征气象干旱、高温事件和农业干旱,并基于Meta-Gaussian模型的多变量条件概率和联合概率评估不同事件组合下陕西省夏季发生农业干旱的风险。结果表明:①随着驱动组合事件变量的增多和严重程度的加剧,陕西省遭受农业干旱的风险增大(条件概率二维>0.30,三维>0.35,四维>0.50)。其中,气象干旱和高温事件条件下,农业干旱发生风险最大的月份分别为8月和6月。②随着并发事件增多和严重程度的加剧,陕西省多变量复合事件的风险减小(联合概率二维<0.30,三维<0.20,四维<0.15)。相比陕北和陕南地区,关中平原遭遇多变量复合事件驱动的农业干旱风险更大。

基于自动终止准则改进的kd-tree粒子近邻搜索研究

对于大规模运动模拟问题而言,近邻点的搜索效率将对整体的运算效率产生显著影响。本文基于关联性分析建立kd-tree的最大深度dmax与粒子总数N的自适应关系式,提出了kd-tree自动终止准则,即ATC-kd-tree,同时还考虑了叶子节点大小阈值n_(0)对近邻搜索效率的影响。试验表明,ATC-kd-tree具有更高的近邻搜索效率,相较于不使用自动终止准则的kd-tree搜索效率最高提升46%,且适用性更强,可求解不同N值的近邻搜索问题,解决了粒子总数N发生改变时需要再次率定最大深度dmax的问题。同时,本文还提出了网格搜索法组合坐标下降法的两步参数优化算法GSCD法。通过2维阿米巴虫形状的参数优化试验发现,GSCD法可更为快速地率定ATC-kd-tree的可变参数,其优化效率比网格搜索法最高提升了205%,相较于改进网格搜索法最高提升了90%。研究结果表明,ATC-kd-tree和GSCD法不仅提高了近邻搜索的效率,也为复杂运动中近邻粒子搜索问题提供了一种更为高效的解决方案,能够显著降低计算资源的消耗,进一步提升模拟的精度和效率。

基于Gaussian、ECOSAR模型的紫外/次氯酸体系降解含卤阻燃剂的产物预测与毒性评估

含卤阻燃剂广泛应用于各类电子产品的生产,难降解且具有生物毒性.在生产和使用过程中,部分含卤阻燃剂会残留在水体并排放到水环境造成累积污染,威胁水环境安全,亟需探寻有效的降解去毒方法.本研究通过Gaussian与ECOSAR模型预测了四氯双酚A(TCBPA)、四溴双酚A(TBBPA)、十溴二苯乙烷(DBDPE)等3种典型含卤阻燃剂在紫外/次氯酸(UV/Cl)体系中的光催氧化降解路径与产物毒性.结果表明,UV/Cl体系中的含氯自由基(RCS)与羟基自由基(·OH)易攻击阻燃剂分子结构上键能较低、Fukui指数较高的位点,促使C—Cl键、C—Br键、C—C键等因为受到攻击而断裂,进而降解阻燃剂.同时,利用ECOSAR模型评估发现降解产物的急性毒性LC_(50)-96 h均低于100 mg·L^(-1),佐证了UV/Cl体系对含卤阻燃剂降解的有效性,并降低其环境危害.因此,采用Gaussian计算、ECOSAR模型相结合的分析方法,能够更加便捷地预测阻燃剂降解路径与产物毒性特征,为深入揭示UV/Cl体系光催氧化降解含卤阻燃剂机理提供新思路.

Improved Data Stream Clustering Method: Incorporating KD-Tree for Typicality and Eccentricity-Based Approach

Data stream clustering is integral to contemporary big data applications.However,addressing the ongoing influx of data streams efficiently and accurately remains a primary challenge in current research.This paper aims to elevate the efficiency and precision of data stream clustering,leveraging the TEDA(Typicality and Eccentricity Data Analysis)algorithm as a foundation,we introduce improvements by integrating a nearest neighbor search algorithm to enhance both the efficiency and accuracy of the algorithm.The original TEDA algorithm,grounded in the concept of“Typicality and Eccentricity Data Analytics”,represents an evolving and recursive method that requires no prior knowledge.While the algorithm autonomously creates and merges clusters as new data arrives,its efficiency is significantly hindered by the need to traverse all existing clusters upon the arrival of further data.This work presents the NS-TEDA(Neighbor Search Based Typicality and Eccentricity Data Analysis)algorithm by incorporating a KD-Tree(K-Dimensional Tree)algorithm integrated with the Scapegoat Tree.Upon arrival,this ensures that new data points interact solely with clusters in very close proximity.This significantly enhances algorithm efficiency while preventing a single data point from joining too many clusters and mitigating the merging of clusters with high overlap to some extent.We apply the NS-TEDA algorithm to several well-known datasets,comparing its performance with other data stream clustering algorithms and the original TEDA algorithm.The results demonstrate that the proposed algorithm achieves higher accuracy,and its runtime exhibits almost linear dependence on the volume of data,making it more suitable for large-scale data stream analysis research.

基于KD-Tree与DBSCAN的水电机组状态监测数据清洗方法

针对水电机组状态监测数据量逐步增大,数据质量差的问题,提出了一种基于改进K维树(K-Dimensional Tree,KD-Tree)与基于密度的空间聚类算法(Density-Based Spatial Clustering of Applications with Noise,DBSCAN)的水电机组状态监测数据清洗方法,首先对输入数据建立KD-Tree,再使用DBSCAN在最近邻样本上扫描完成聚类,聚类结束以后会分离出噪声点,将噪声点去除即可完成对水电机组状态监测数据清洗。选取某水电站状态监测系统上导摆度数据1 088条,再以相同时间间隔插入随机数据100条,通过算例与常规DBScan、K-means、OCSVM算法对比聚类性能与时间性能,所提出的方法识别正确率最高,为97.78%,消耗时间最少,为0.007 732 s,数据清洗效果最优,并可以大幅减少计算时间。

Density Clustering Algorithm Based on KD-Tree and Voting Rules

Traditional clustering algorithms often struggle to produce satisfactory results when dealing with datasets withuneven density. Additionally, they incur substantial computational costs when applied to high-dimensional datadue to calculating similarity matrices. To alleviate these issues, we employ the KD-Tree to partition the dataset andcompute the K-nearest neighbors (KNN) density for each point, thereby avoiding the computation of similaritymatrices. Moreover, we apply the rules of voting elections, treating each data point as a voter and casting a votefor the point with the highest density among its KNN. By utilizing the vote counts of each point, we develop thestrategy for classifying noise points and potential cluster centers, allowing the algorithm to identify clusters withuneven density and complex shapes. Additionally, we define the concept of “adhesive points” between two clustersto merge adjacent clusters that have similar densities. This process helps us identify the optimal number of clustersautomatically. Experimental results indicate that our algorithm not only improves the efficiency of clustering butalso increases its accuracy.

Bose–Einstein distribution temperature features of quasiparticles around magnetopolaron in Gaussian quantum wells of alkali halogen ions

We have applied strong coupling unitary transformation method combined with Bose–Einstein statistical law to investigate magnetopolaron energy level temperature effects in halogen ion crystal quantum wells.The obtained results showed that under magnetic field effect,magnetopolaron quasiparticle was formed through the interaction of electrons and surrounding phonons.At the same time,magnetopolaron was influenced by phonon temperature statistical law and important energy level shifts down and binding energy increases.This revealed that lattice temperature and magnetic field could easily affect magnetopolaron and the above results could play key roles in exploring thermoelectric conversion and conductivity of crystal materials.

Reliable calculations of nuclear binding energies by the Gaussian process of machine learning

Reliable calculations of nuclear binding energies are crucial for advancing the research of nuclear physics. Machine learning provides an innovative approach to exploring complex physical problems. In this study, the nuclear binding energies are modeled directly using a machine-learning method called the Gaussian process. First, the binding energies for 2238 nuclei with Z > 20 and N > 20 are calculated using the Gaussian process in a physically motivated feature space, yielding an average deviation of 0.046 MeV and a standard deviation of 0.066 MeV. The results show the good learning ability of the Gaussian process in the studies of binding energies. Then, the predictive power of the Gaussian process is studied by calculating the binding energies for 108 nuclei newly included in AME2020. The theoretical results are in good agreement with the experimental data, reflecting the good predictive power of the Gaussian process. Moreover, the α-decay energies for 1169 nuclei with 50 ≤ Z ≤ 110 are derived from the theoretical binding energies calculated using the Gaussian process. The average deviation and the standard deviation are, respectively, 0.047 MeV and 0.070 MeV. Noticeably, the calculated α-decay energies for the two new isotopes ^ (204 )Ac(Huang et al. Phys Lett B 834, 137484(2022)) and ^ (207) Th(Yang et al. Phys Rev C 105, L051302(2022)) agree well with the latest experimental data. These results demonstrate that the Gaussian process is reliable for the calculations of nuclear binding energies. Finally, the α-decay properties of some unknown actinide nuclei are predicted using the Gaussian process. The predicted results can be useful guides for future research on binding energies and α-decay properties.

MULTIPLE INTERSECTIONS OF SPACE-TIME ANISOTROPIC GAUSSIAN FIELDS

Let X={X(t)∈R^(d),t∈R^(N)}be a centered space-time anisotropic Gaussian field with indices H=(H_(1),…,H_(N))∈(0,1)~N,where the components X_(i)(i=1,…,d)of X are independent,and the canonical metric√(E(X_(i)(t)-X_(i)(s))^(2))^(1/2)(i=1,…,d)is commensurate with■for s=(s_(1),…,s_(N)),t=(t_(1),…,t_(N))∈R~N,α_(i)∈(0,1],and with the continuous functionγ(·)satisfying certain conditions.First,the upper and lower bounds of the hitting probabilities of X can be derived from the corresponding generalized Hausdorff measure and capacity,which are based on the kernel functions depending explicitly onγ(·).Furthermore,the multiple intersections of the sample paths of two independent centered space-time anisotropic Gaussian fields with different distributions are considered.Our results extend the corresponding results for anisotropic Gaussian fields to a large class of space-time anisotropic Gaussian fields.

Optimization of Artificial Viscosity in Production Codes Based on Gaussian Regression Surrogate Models

To accurately model flows with shock waves using staggered-grid Lagrangian hydrodynamics, the artificial viscosity has to be introduced to convert kinetic energy into internal energy, thereby increasing the entropy across shocks. Determining the appropriate strength of the artificial viscosity is an art and strongly depends on the particular problem and experience of the researcher. The objective of this study is to pose the problem of finding the appropriate strength of the artificial viscosity as an optimization problem and solve this problem using machine learning (ML) tools, specifically using surrogate models based on Gaussian Process regression (GPR) and Bayesian analysis. We describe the optimization method and discuss various practical details of its implementation. The shock-containing problems for which we apply this method all have been implemented in the LANL code FLAG (Burton in Connectivity structures and differencing techniques for staggered-grid free-Lagrange hydrodynamics, Tech. Rep. UCRL-JC-110555, Lawrence Livermore National Laboratory, Livermore, CA, 1992, 1992, in Consistent finite-volume discretization of hydrodynamic conservation laws for unstructured grids, Tech. Rep. CRL-JC-118788, Lawrence Livermore National Laboratory, Livermore, CA, 1992, 1994, Multidimensional discretization of conservation laws for unstructured polyhedral grids, Tech. Rep. UCRL-JC-118306, Lawrence Livermore National Laboratory, Livermore, CA, 1992, 1994, in FLAG, a multi-dimensional, multiple mesh, adaptive free-Lagrange, hydrodynamics code. In: NECDC, 1992). First, we apply ML to find optimal values to isolated shock problems of different strengths. Second, we apply ML to optimize the viscosity for a one-dimensional (1D) propagating detonation problem based on Zel’dovich-von Neumann-Doring (ZND) (Fickett and Davis in Detonation: theory and experiment. Dover books on physics. Dover Publications, Mineola, 2000) detonation theory using a reactive burn model. We compare results for default (currently used values in FLAG) and optimized values of the artificial viscosity for these problems demonstrating the potential for significant improvement in the accuracy of computations.

Application of Gaussian Beam Summation Migration in Reflected In-seam Wave Imaging

The geological conditions for coal mining in China are complex,with various structural issues such as faults and collapsed columns seriously compromising the safety of coal mine production.In-seam wave exploration is an effective technique for acquiring detailed information on geological structures in coal seam working faces.However,the existing reflected in-seam wave imaging technique can no longer meet the exploration precision requirements,making it imperative to develop a new reflected in-seam wave imaging technique.This study applies the Gaussian beam summation(GBS)migration method to imaging coal seams'reflected in-seam wave data.Firstly,with regard to the characteristics of the reflected in-seam wave data,methods such as wavefield removal and enveloped superposition are employed for the corresponding wavefield separation,wave train compression and other processing of reflected in-seam waves.Thereafter,imaging is performed using the GBS migration technique.The feasibility and effectiveness of the proposed method for reflected in-seam wave imaging are validated by conducting GBS migration tests on 3D coal-seam fault models with different dip angles and throws.By applying the method to reflected in-seam wave data for an actual coal seam working face,accurate imaging of a fault structure is obtained,thereby validating its practicality.

Bessel–Gaussian beam-based orbital angular momentum holography

Orbital angular momentum(OAM), as a new degree of freedom, has recently been applied in holography technology.Due to the infinite helical mode index of OAM mode, a large number of holographic images can be reconstructed from an OAM-multiplexing hologram. However, the traditional design of an OAM hologram is constrained by the helical mode index of the selected OAM mode, for a larger helical mode index OAM mode has a bigger sampling distance, and the crosstalk is produced for different sampling distances for different OAM modes. In this paper, we present the design of the OAM hologram based on a Bessel–Gaussian beam, which is non-diffractive and has a self-healing property during its propagation. The Fourier transform of the Bessel–Gaussian beam is the perfect vortex mode that has the fixed ring radius for different OAM modes. The results of simulation and experiment have demonstrated the feasibility of the generation of the OAM hologram with the Bessel–Gaussian beam. The quality of the reconstructed holographic image is increased, and the security is enhanced. Additionally, the anti-interference property is improved owing to its self-healing property of the Bessel-OAM holography.

Quantum correlations and entanglement in coupled optomechanical resonators with photon hopping via Gaussian interferometric power analysis

Quantum correlations that surpass entanglement are of great importance in the realms of quantum information processing and quantum computation.Essentially,for quantum systems prepared in pure states,it is difficult to differentiate between quantum entanglement and quantum correlation.Nonetheless,this indistinguishability is no longer holds for mixed states.To contribute to a better understanding of this differentiation,we have explored a simple model for both generating and measuring these quantum correlations.Our study concerns two macroscopic mechanical resonators placed in separate Fabry–Pérot cavities,coupled through the photon hopping process.this system offers a comprehensively way to investigate and quantify quantum correlations beyond entanglement between these mechanical modes.The key ingredient in analyzing quantum correlation in this system is the global covariance matrix.It forms the basis for computing two essential metrics:the logarithmic negativity(E_(N)^(m))and the Gaussian interferometric power(P_(G)^(m)).These metrics provide the tools to measure the degree of quantum entanglement and quantum correlations,respectively.Our study reveals that the Gaussian interferometric power(P_(G)^(m))proves to be a more suitable metric for characterizing quantum correlations among the mechanical modes in an optomechanical quantum system,particularly in scenarios featuring resilient photon hopping.

Operational optimization of copper flotation process based on the weighted Gaussian process regression and index-oriented adaptive differential evolution algorithm

Concentrate copper grade(CCG)is one of the important production indicators of copper flotation processes,and keeping the CCG at the set value is of great significance to the economic benefit of copper flotation industrial processes.This paper addresses the fluctuation problem of CCG through an operational optimization method.Firstly,a density-based affinity propagationalgorithm is proposed so that more ideal working condition categories can be obtained for the complex raw ore properties.Next,a Bayesian network(BN)is applied to explore the relationship between the operational variables and the CCG.Based on the analysis results of BN,a weighted Gaussian process regression model is constructed to predict the CCG that a higher prediction accuracy can be obtained.To ensure the predicted CCG is close to the set value with a smaller magnitude of the operation adjustments and a smaller uncertainty of the prediction results,an index-oriented adaptive differential evolution(IOADE)algorithm is proposed,and the convergence performance of IOADE is superior to the traditional differential evolution and adaptive differential evolution methods.Finally,the effectiveness and feasibility of the proposed methods are verified by the experiments on a copper flotation industrial process.

Persymmetric adaptive polarimetric detection of subspace range-spread targets in compound Gaussian sea clutter

This paper focuses on the adaptive detection of range and Doppler dual-spread targets in non-homogeneous and nonGaussian sea clutter.The sea clutter from two polarimetric channels is modeled as a compound-Gaussian model with different parameters,and the target is modeled as a subspace rangespread target model.The persymmetric structure is used to model the clutter covariance matrix,in order to reduce the reliance on secondary data of the designed detectors.Three adaptive polarimetric persymmetric detectors are designed based on the generalized likelihood ratio test(GLRT),Rao test,and Wald test.All the proposed detectors have constant falsealarm rate property with respect to the clutter texture,the speckle covariance matrix.Experimental results on simulated and measured data show that three adaptive detectors outperform the competitors in different clutter environments,and the proposed GLRT detector has the best detection performance under different parameters.

Gaussian Mixture-Learned Approximate Message Passing(GM-LAMP)Based Hybrid Precoders for mmWave Massive MIMO Systems

Hybrid precoder design is a key technique providing better antenna gain and reduced hardware complexity in millimeter-wave(mmWave)massive multiple-input multiple-output(MIMO)systems.In this paper,Gaussian Mixture learned approximate message passing(GM-LAMP)network is presented for the design of optimal hybrid precoders suitable for mmWave Massive MIMO systems.Optimal hybrid precoder designs using a compressive sensing scheme such as orthogonal matching pursuit(OMP)and its derivatives results in high computational complexity when the dimensionality of the sparse signal is high.This drawback can be addressed using classical iterative algorithms such as approximate message passing(AMP),which has comparatively low computational complexity.The drawbacks of AMP algorithm are fixed shrinkage parameter and non-consideration of prior distribution of the hybrid precoders.In this paper,the fixed shrinkage parameter problem of the AMP algorithm is addressed using learned AMP(LAMP)network,and is further enhanced as GMLAMP network using the concept of Gaussian Mixture distribution of the hybrid precoders.The simula-tion results show that the proposed GM-LAMP network achieves optimal hybrid precoder design with enhanced achievable rates,better accuracy and low computational complexity compared to the existing algorithms.

A Gaussian Noise-Based Algorithm for Enhancing Backdoor Attacks

Deep Neural Networks(DNNs)are integral to various aspects of modern life,enhancing work efficiency.Nonethe-less,their susceptibility to diverse attack methods,including backdoor attacks,raises security concerns.We aim to investigate backdoor attack methods for image categorization tasks,to promote the development of DNN towards higher security.Research on backdoor attacks currently faces significant challenges due to the distinct and abnormal data patterns of malicious samples,and the meticulous data screening by developers,hindering practical attack implementation.To overcome these challenges,this study proposes a Gaussian Noise-Targeted Universal Adversarial Perturbation(GN-TUAP)algorithm.This approach restricts the direction of perturbations and normalizes abnormal pixel values,ensuring that perturbations progress as much as possible in a direction perpendicular to the decision hyperplane in linear problems.This limits anomalies within the perturbations improves their visual stealthiness,and makes them more challenging for defense methods to detect.To verify the effectiveness,stealthiness,and robustness of GN-TUAP,we proposed a comprehensive threat model.Based on this model,extensive experiments were conducted using the CIFAR-10,CIFAR-100,GTSRB,and MNIST datasets,comparing our method with existing state-of-the-art attack methods.We also tested our perturbation triggers using various defense methods and further experimented on the robustness of the triggers against noise filtering techniques.The experimental outcomes demonstrate that backdoor attacks leveraging perturbations generated via our algorithm exhibit cross-model attack effectiveness and superior stealthiness.Furthermore,they possess robust anti-detection capabilities and maintain commendable performance when subjected to noise-filtering methods.

MAXIMAL FUNCTION CHARACTERIZATIONS OF HARDY SPACES ASSOCIATED WITH BOTH NON-NEGATIVE SELF-ADJOINT OPERATORS SATISFYING GAUSSIAN ESTIMATES AND BALL QUASI-BANACH FUNCTION SPACES

Assume that L is a non-negative self-adjoint operator on L^(2)(ℝ^(n))with its heat kernels satisfying the so-called Gaussian upper bound estimate and that X is a ball quasi-Banach function space onℝ^(n) satisfying some mild assumptions.Let HX,L(ℝ^(n))be the Hardy space associated with both X and L,which is defined by the Lusin area function related to the semigroup generated by L.In this article,the authors establish various maximal function characterizations of the Hardy space HX,L(ℝ^(n))and then apply these characterizations to obtain the solvability of the related Cauchy problem.These results have a wide range of generality and,in particular,the specific spaces X to which these results can be applied include the weighted space,the variable space,the mixed-norm space,the Orlicz space,the Orlicz-slice space,and the Morrey space.Moreover,the obtained maximal function characterizations of the mixed-norm Hardy space,the Orlicz-slice Hardy space,and the Morrey-Hardy space associated with L are completely new.

GRU Enabled Intrusion Detection System for IoT Environment with Swarm Optimization and Gaussian Random Forest Classification

In recent years,machine learning(ML)and deep learning(DL)have significantly advanced intrusion detection systems,effectively addressing potential malicious attacks across networks.This paper introduces a robust method for detecting and categorizing attacks within the Internet of Things(IoT)environment,leveraging the NSL-KDD dataset.To achieve high accuracy,the authors used the feature extraction technique in combination with an autoencoder,integrated with a gated recurrent unit(GRU).Therefore,the accurate features are selected by using the cuckoo search algorithm integrated particle swarm optimization(PSO),and PSO has been employed for training the features.The final classification of features has been carried out by using the proposed RF-GNB random forest with the Gaussian Naïve Bayes classifier.The proposed model has been evaluated and its performance is verified with some of the standard metrics such as precision,accuracy rate,recall F1-score,etc.,and has been compared with different existing models.The generated results that detected approximately 99.87%of intrusions within the IoT environments,demonstrated the high performance of the proposed method.These results affirmed the efficacy of the proposed method in increasing the accuracy of intrusion detection within IoT network systems.

用于ICP的近似KD-Tree搜索加速器设计及FPGA实现

为了加速迭代最近点(iterative closest point,ICP)算法中k近邻(k-nearest neighbor,KNN)搜索过程,文章根据近似K维树(K-dimensional tree,KD-Tree)数据结构,基于现场可编程门阵列(field programmable gate array,FPGA)提出一种高性能的KNN搜索加速器;分析近似KD-Tree数据结构的可行性,结果表明该数据结构能够满足ICP算法精度要求,并提高计算的并行度和性能;为了解决近似KD-Tree建树过程耗费时间长的问题,设计基于分治归并排序的具有反馈数据通路的树构建计算模块,该模块可在8.95 ms内计算出256个空间的树节点并完成树构建;为了优化点云暴力搜索过程,设计一种高吞吐率的点云搜索模块,可以在0.49 ms内完成近30000个点的最近点搜索。研究结果表明,与相关的设计相比,该文提出的硬件加速方法可以有效降低KNN搜索时间复杂度,提高算法性能。