The relation is a semantic expression relevant to two named entities in a sentence.Since a sentence usually contains several named entities,it is essential to learn a structured sentence representation that encodes de...The relation is a semantic expression relevant to two named entities in a sentence.Since a sentence usually contains several named entities,it is essential to learn a structured sentence representation that encodes dependency information specific to the two named entities.In related work,graph convolutional neural networks are widely adopted to learn semantic dependencies,where a dependency tree initializes the adjacency matrix.However,this approach has two main issues.First,parsing a sentence heavily relies on external toolkits,which can be errorprone.Second,the dependency tree only encodes the syntactical structure of a sentence,which may not align with the relational semantic expression.In this paper,we propose an automatic graph learningmethod to autonomously learn a sentence’s structural information.Instead of using a fixed adjacency matrix initialized by a dependency tree,we introduce an Adaptive Adjacency Matrix to encode the semantic dependency between tokens.The elements of thismatrix are dynamically learned during the training process and optimized by task-relevant learning objectives,enabling the construction of task-relevant semantic dependencies within a sentence.Our model demonstrates superior performance on the TACRED and SemEval 2010 datasets,surpassing previous works by 1.3%and 0.8%,respectively.These experimental results show that our model excels in the relation extraction task,outperforming prior models.展开更多
The prediction for Multivariate Time Series(MTS)explores the interrelationships among variables at historical moments,extracts their relevant characteristics,and is widely used in finance,weather,complex industries an...The prediction for Multivariate Time Series(MTS)explores the interrelationships among variables at historical moments,extracts their relevant characteristics,and is widely used in finance,weather,complex industries and other fields.Furthermore,it is important to construct a digital twin system.However,existing methods do not take full advantage of the potential properties of variables,which results in poor predicted accuracy.In this paper,we propose the Adaptive Fused Spatial-Temporal Graph Convolutional Network(AFSTGCN).First,to address the problem of the unknown spatial-temporal structure,we construct the Adaptive Fused Spatial-Temporal Graph(AFSTG)layer.Specifically,we fuse the spatial-temporal graph based on the interrelationship of spatial graphs.Simultaneously,we construct the adaptive adjacency matrix of the spatial-temporal graph using node embedding methods.Subsequently,to overcome the insufficient extraction of disordered correlation features,we construct the Adaptive Fused Spatial-Temporal Graph Convolutional(AFSTGC)module.The module forces the reordering of disordered temporal,spatial and spatial-temporal dependencies into rule-like data.AFSTGCN dynamically and synchronously acquires potential temporal,spatial and spatial-temporal correlations,thereby fully extracting rich hierarchical feature information to enhance the predicted accuracy.Experiments on different types of MTS datasets demonstrate that the model achieves state-of-the-art single-step and multi-step performance compared with eight other deep learning models.展开更多
A watermarking algorithm of binary images using adaptable matrix is presented. An adaptable matrix is designed to evaluate the smoothness and the connectivity of binary images. The watermark is embedded according to t...A watermarking algorithm of binary images using adaptable matrix is presented. An adaptable matrix is designed to evaluate the smoothness and the connectivity of binary images. The watermark is embedded according to the adaptable matrix in this algorithm. In the proposed watermarking algorithm, each image block implements a XOR operation with the binary adaptable matrix, which has the same size with the image block, and in order to embed the watermark data, a multiplication operation are also implemented with the weight matrix. The experimental results show that proposed scheme has a good performance.展开更多
In the conceptual framework of adaptation policy assessment to climate change, adaptation measures can be categorized as two groups：facilitation and implementation. Facilitation measures refers to activities that enh...In the conceptual framework of adaptation policy assessment to climate change, adaptation measures can be categorized as two groups：facilitation and implementation. Facilitation measures refers to activities that enhance adaptive capacity, while implementation refers to activities that actually avoid adverse climate impacts on a system by reducing its exposure or sensitivity to climatic hazards, or by moderating relevant non-climatic factors. This paper aims to establish a matrix of implementation measures of adaptation to climate change, through four different ways how adaptation can influencc the relevant elements of climate change. reducing the exposure, reducing the sensitivity, alleviating the adverse impacts and reducing the negative non-climatic factors, and then further discuss the particular implementation measures of adaptation to climate change, through application studies on the selected sub-systems, intend to organize the disordered implementation measures in existent, and put forward some new measures under the guidance of this matrix, which could enrich and promote the system and content of implementation measures of adaptation.展开更多
This paper proposes a new kind of generalized Friendman's urn model,which with adaptive nonhomogeneous generating matrix.This model may be applied in sequential medical experiment.In this model some limit theorems...This paper proposes a new kind of generalized Friendman's urn model,which with adaptive nonhomogeneous generating matrix.This model may be applied in sequential medical experiment.In this model some limit theorems (strong consistency and asymptot- ical normality) have been obtained.展开更多
Cloud computing, a recently emerged paradigm faces major challenges in achieving the privacy of migrated data, network security, etc. Too many cryptographic technologies are raised to solve these issues based on ident...Cloud computing, a recently emerged paradigm faces major challenges in achieving the privacy of migrated data, network security, etc. Too many cryptographic technologies are raised to solve these issues based on identity, attributes and prediction algorithms yet;these techniques are highly prone to attackers. This would raise a need of an effective encryption technique, which would ensure secure data migration. With this scenario, our proposed methodology Efficient Probabilistic Public Key Encryption(EPPKE) is optimized with Covariance Matrix Adaptation Evolution Strategies(CMA-ES). It ensures data integrity through the Luhn algorithm with BLAKE 2b encapsulation. This enables an optimized security to the data which is migrated through cloud. The proposed methodology is implemented in Open Stack with Java Language. It achieves better results by providing security compared to other existing techniques like RSA, IBA, ABE, PBE, etc.展开更多
To address the problem of network security situation assessment in the Industrial Internet,this paper adopts the evidential reasoning(ER)algorithm and belief rule base(BRB)method to establish an assessment model.First...To address the problem of network security situation assessment in the Industrial Internet,this paper adopts the evidential reasoning(ER)algorithm and belief rule base(BRB)method to establish an assessment model.First,this paper analyzes the influencing factors of the Industrial Internet and selects evaluation indicators that contain not only quantitative data but also qualitative knowledge.Second,the evaluation indicators are fused with expert knowledge and the ER algorithm.According to the fusion results,a network security situation assessment model of the Industrial Internet based on the ER and BRB method is established,and the projection covariance matrix adaptive evolution strategy(P-CMA-ES)is used to optimize the model parameters.This method can not only utilize semiquantitative information effectively but also use more uncertain information and prevent the problem of combinatorial explosion.Moreover,it solves the problem of the uncertainty of expert knowledge and overcomes the problem of low modeling accuracy caused by insufficient data.Finally,a network security situation assessment case of the Industrial Internet is analyzed to verify the effectiveness and superiority of the method.The research results showthat this method has strong applicability to the network security situation assessment of complex Industrial Internet systems.It can accurately reflect the actual network security situation of Industrial Internet systems and provide safe and reliable suggestions for network administrators to take timely countermeasures,thereby improving the risk monitoring and emergency response capabilities of the Industrial Internet.展开更多
Consider the problems of frequency-invariant beampattern optimization and robustness in broadband beamforming.Firstly,a global optimization algorithm,which is based on phase compensation of the array manifolds,is used...Consider the problems of frequency-invariant beampattern optimization and robustness in broadband beamforming.Firstly,a global optimization algorithm,which is based on phase compensation of the array manifolds,is used to construct the frequency-invariant beampattern.Compared with some methods presented recently,the proposed algorithm is not only available to get the global optimal solution,but also simple for physical realization.Meanwhile,a robust adaptive broadband beamforming algorithm is also derived by reconstructing the covariance matrix.The essence of the proposed algorithm is to estimate the space-frequency spectrum using Capon estimator firstly,then integrate over a region separated from the desired signal direction to reconstruct the interference-plus-noise covariance matrix,and finally caleulate the adaptive beamformer weights with the reconstructed matrix.The design of beamformer is formulated as a convex optimization problem to be solved.Simulation results show that the performance of the proposed algorithm is almost always close to the optimal value across a wide range of signal to noise ratios.展开更多
Multiphoton microscopy is the enabling tool for biomedical research,but the aberrations of biological tissues have limited its imaging performance.Adaptive optics(AO)has been developed to partially overcome aberration...Multiphoton microscopy is the enabling tool for biomedical research,but the aberrations of biological tissues have limited its imaging performance.Adaptive optics(AO)has been developed to partially overcome aberration to restore imaging performance.For indirect AO,algorithm is the key to its successful implementation.Here,based on the fact that indirect AO has an analogy to the black-box optimization problem,we successfully apply the covariance matrix adaptation evolution strategy(CMA-ES)used in the latter,to indirect AO in multiphoton microscopy(MPM).Compared with the traditional genetic algorithm(GA),our algorithm has a greater improvement in convergence speed and convergence accuracy,which provides the possibility of realizing real-time dynamic aberration correction for deep in vivo biological tissues.展开更多
To accelerate the multi-objective optimization for expensive engineering cases, a Knowledge-Extraction-based Variable-Fidelity Surrogate-assisted Covariance Matrix Adaptation Evolution Strategy(KE-VFS-CMA-ES) is prese...To accelerate the multi-objective optimization for expensive engineering cases, a Knowledge-Extraction-based Variable-Fidelity Surrogate-assisted Covariance Matrix Adaptation Evolution Strategy(KE-VFS-CMA-ES) is presented. In the first part, the KE-VFS model is established. Firstly, the optimization is performed using the low-fidelity surrogate model to obtain the Low-Fidelity Non-Dominated Solutions(LF-NDS). Secondly, aiming to obtain the High-Fidelity(HF) sample points located in promising areas, the K-means clustering algorithm and the space-filling strategy are used to extract knowledge from the LF-NDS to the HF space. Finally,the KE-VFS model is established by means of the obtained HF and LF sample points. In the second part, a novel model management based on the Modified Hypervolume Improvement(MHVI) criterion and pre-screening strategy is proposed. In each generation of KE-VFS-CMA-ES, excessive candidate points are firstly generated and then calculated by the MHVI criterion to find out a few potential points, which will be evaluated by the HF model. Through the above two parts,the promising areas can be detected and the potential points can be screened out, which contributes to speeding up the optimization process twofold. Three classic benchmark functions and a time-consuming engineering case of the aerospace integrally stiffened shell are studied, and results illustrate the excellent efficiency, robustness and applicability of KE-VFS-CMA-ES compared with other four known multi-objective optimization algorithms.展开更多
To improve the accuracy of the network security situation, a security situation automatic prediction model based on accumulative data preprocess and support vector machine （SVM） optimized by covariance matrix adapti...To improve the accuracy of the network security situation, a security situation automatic prediction model based on accumulative data preprocess and support vector machine （SVM） optimized by covariance matrix adaptive evolutionary strategy （CMA-ES） is proposed. The proposed model adopts SVM which has strong nonlinear ability. Also, the hyper parameters for SVM are optimized through the CMA-ES which owns good performance in finding optimization automatically. Considering the irregularity of network security situation values, we accumulate the original sequence, so that the internal rules of discrete data can be revealed and it is easy to model. Simulation experiments show that the proposed model has faster convergence-speed and higher prediction accuracy than other extant prediction models.展开更多
基金supported by the Technology Projects of Guizhou Province under Grant[2024]003National Natural Science Foundation of China(GrantNos.62166007,62066008,62066007)Guizhou Provincial Science and Technology Projects under Grant No.ZK[2023]300.
文摘The relation is a semantic expression relevant to two named entities in a sentence.Since a sentence usually contains several named entities,it is essential to learn a structured sentence representation that encodes dependency information specific to the two named entities.In related work,graph convolutional neural networks are widely adopted to learn semantic dependencies,where a dependency tree initializes the adjacency matrix.However,this approach has two main issues.First,parsing a sentence heavily relies on external toolkits,which can be errorprone.Second,the dependency tree only encodes the syntactical structure of a sentence,which may not align with the relational semantic expression.In this paper,we propose an automatic graph learningmethod to autonomously learn a sentence’s structural information.Instead of using a fixed adjacency matrix initialized by a dependency tree,we introduce an Adaptive Adjacency Matrix to encode the semantic dependency between tokens.The elements of thismatrix are dynamically learned during the training process and optimized by task-relevant learning objectives,enabling the construction of task-relevant semantic dependencies within a sentence.Our model demonstrates superior performance on the TACRED and SemEval 2010 datasets,surpassing previous works by 1.3%and 0.8%,respectively.These experimental results show that our model excels in the relation extraction task,outperforming prior models.
基金supported by the China Scholarship Council and the CERNET Innovation Project under grant No.20170111.
文摘The prediction for Multivariate Time Series(MTS)explores the interrelationships among variables at historical moments,extracts their relevant characteristics,and is widely used in finance,weather,complex industries and other fields.Furthermore,it is important to construct a digital twin system.However,existing methods do not take full advantage of the potential properties of variables,which results in poor predicted accuracy.In this paper,we propose the Adaptive Fused Spatial-Temporal Graph Convolutional Network(AFSTGCN).First,to address the problem of the unknown spatial-temporal structure,we construct the Adaptive Fused Spatial-Temporal Graph(AFSTG)layer.Specifically,we fuse the spatial-temporal graph based on the interrelationship of spatial graphs.Simultaneously,we construct the adaptive adjacency matrix of the spatial-temporal graph using node embedding methods.Subsequently,to overcome the insufficient extraction of disordered correlation features,we construct the Adaptive Fused Spatial-Temporal Graph Convolutional(AFSTGC)module.The module forces the reordering of disordered temporal,spatial and spatial-temporal dependencies into rule-like data.AFSTGCN dynamically and synchronously acquires potential temporal,spatial and spatial-temporal correlations,thereby fully extracting rich hierarchical feature information to enhance the predicted accuracy.Experiments on different types of MTS datasets demonstrate that the model achieves state-of-the-art single-step and multi-step performance compared with eight other deep learning models.
基金China Postdoctoral Science Foundation (20070420707)the Natural Science Foundation of Education Bureau of Hunan Province (2008A520003)
文摘A watermarking algorithm of binary images using adaptable matrix is presented. An adaptable matrix is designed to evaluate the smoothness and the connectivity of binary images. The watermark is embedded according to the adaptable matrix in this algorithm. In the proposed watermarking algorithm, each image block implements a XOR operation with the binary adaptable matrix, which has the same size with the image block, and in order to embed the watermark data, a multiplication operation are also implemented with the weight matrix. The experimental results show that proposed scheme has a good performance.
基金supported by National Key Project of Scientific and Technical Supporting Programs Funded by Ministry of Science & Technology of China in the 11th Five-Year Plan (Grant No.2007BAC03A12)
文摘In the conceptual framework of adaptation policy assessment to climate change, adaptation measures can be categorized as two groups：facilitation and implementation. Facilitation measures refers to activities that enhance adaptive capacity, while implementation refers to activities that actually avoid adverse climate impacts on a system by reducing its exposure or sensitivity to climatic hazards, or by moderating relevant non-climatic factors. This paper aims to establish a matrix of implementation measures of adaptation to climate change, through four different ways how adaptation can influencc the relevant elements of climate change. reducing the exposure, reducing the sensitivity, alleviating the adverse impacts and reducing the negative non-climatic factors, and then further discuss the particular implementation measures of adaptation to climate change, through application studies on the selected sub-systems, intend to organize the disordered implementation measures in existent, and put forward some new measures under the guidance of this matrix, which could enrich and promote the system and content of implementation measures of adaptation.
基金This work is supported by a grant of National University of Singapore(RP 3972712)by partially National Science Foundation of
文摘This paper proposes a new kind of generalized Friendman's urn model,which with adaptive nonhomogeneous generating matrix.This model may be applied in sequential medical experiment.In this model some limit theorems (strong consistency and asymptot- ical normality) have been obtained.
文摘Cloud computing, a recently emerged paradigm faces major challenges in achieving the privacy of migrated data, network security, etc. Too many cryptographic technologies are raised to solve these issues based on identity, attributes and prediction algorithms yet;these techniques are highly prone to attackers. This would raise a need of an effective encryption technique, which would ensure secure data migration. With this scenario, our proposed methodology Efficient Probabilistic Public Key Encryption(EPPKE) is optimized with Covariance Matrix Adaptation Evolution Strategies(CMA-ES). It ensures data integrity through the Luhn algorithm with BLAKE 2b encapsulation. This enables an optimized security to the data which is migrated through cloud. The proposed methodology is implemented in Open Stack with Java Language. It achieves better results by providing security compared to other existing techniques like RSA, IBA, ABE, PBE, etc.
基金supported by the Provincial Universities Basic Business Expense Scientific Research Projects of Heilongjiang Province(No.2021-KYYWF-0179)the Science and Technology Project of Henan Province(No.212102310991)+2 种基金the Opening Project of Shanghai Key Laboratory of Integrated Administration Technologies for Information Security(No.AGK2015003)the Key Scientific Research Project of Henan Province(No.21A413001)the Postgraduate Innovation Project of Harbin Normal University(No.HSDSSCX2021-121).
文摘To address the problem of network security situation assessment in the Industrial Internet,this paper adopts the evidential reasoning(ER)algorithm and belief rule base(BRB)method to establish an assessment model.First,this paper analyzes the influencing factors of the Industrial Internet and selects evaluation indicators that contain not only quantitative data but also qualitative knowledge.Second,the evaluation indicators are fused with expert knowledge and the ER algorithm.According to the fusion results,a network security situation assessment model of the Industrial Internet based on the ER and BRB method is established,and the projection covariance matrix adaptive evolution strategy(P-CMA-ES)is used to optimize the model parameters.This method can not only utilize semiquantitative information effectively but also use more uncertain information and prevent the problem of combinatorial explosion.Moreover,it solves the problem of the uncertainty of expert knowledge and overcomes the problem of low modeling accuracy caused by insufficient data.Finally,a network security situation assessment case of the Industrial Internet is analyzed to verify the effectiveness and superiority of the method.The research results showthat this method has strong applicability to the network security situation assessment of complex Industrial Internet systems.It can accurately reflect the actual network security situation of Industrial Internet systems and provide safe and reliable suggestions for network administrators to take timely countermeasures,thereby improving the risk monitoring and emergency response capabilities of the Industrial Internet.
基金supported by the National Natural Science Foundation of China(51279043,61201411)the Fundamental Research Funds for the Central Universities(HEUCF120502)the National Key Laboratory on Underwater Acoustic Technology Foundation of China(9140C200203110C2001)
文摘Consider the problems of frequency-invariant beampattern optimization and robustness in broadband beamforming.Firstly,a global optimization algorithm,which is based on phase compensation of the array manifolds,is used to construct the frequency-invariant beampattern.Compared with some methods presented recently,the proposed algorithm is not only available to get the global optimal solution,but also simple for physical realization.Meanwhile,a robust adaptive broadband beamforming algorithm is also derived by reconstructing the covariance matrix.The essence of the proposed algorithm is to estimate the space-frequency spectrum using Capon estimator firstly,then integrate over a region separated from the desired signal direction to reconstruct the interference-plus-noise covariance matrix,and finally caleulate the adaptive beamformer weights with the reconstructed matrix.The design of beamformer is formulated as a convex optimization problem to be solved.Simulation results show that the performance of the proposed algorithm is almost always close to the optimal value across a wide range of signal to noise ratios.
基金supported by the National Natural Science Foundation of China(Nos.62075135 and 61975126)the Science,Technology and Innovation Commission of Shenzhen Municipality(Nos.JCYJ20190808174819083 and JCYJ20190808175201640)。
文摘Multiphoton microscopy is the enabling tool for biomedical research,but the aberrations of biological tissues have limited its imaging performance.Adaptive optics(AO)has been developed to partially overcome aberration to restore imaging performance.For indirect AO,algorithm is the key to its successful implementation.Here,based on the fact that indirect AO has an analogy to the black-box optimization problem,we successfully apply the covariance matrix adaptation evolution strategy(CMA-ES)used in the latter,to indirect AO in multiphoton microscopy(MPM).Compared with the traditional genetic algorithm(GA),our algorithm has a greater improvement in convergence speed and convergence accuracy,which provides the possibility of realizing real-time dynamic aberration correction for deep in vivo biological tissues.
基金supported by the National Natural Science Foundation of China(Nos.11902065,11825202)the Fundamental Research Funds for the Central Universities,China(No.DUT21RC(3)013).
文摘To accelerate the multi-objective optimization for expensive engineering cases, a Knowledge-Extraction-based Variable-Fidelity Surrogate-assisted Covariance Matrix Adaptation Evolution Strategy(KE-VFS-CMA-ES) is presented. In the first part, the KE-VFS model is established. Firstly, the optimization is performed using the low-fidelity surrogate model to obtain the Low-Fidelity Non-Dominated Solutions(LF-NDS). Secondly, aiming to obtain the High-Fidelity(HF) sample points located in promising areas, the K-means clustering algorithm and the space-filling strategy are used to extract knowledge from the LF-NDS to the HF space. Finally,the KE-VFS model is established by means of the obtained HF and LF sample points. In the second part, a novel model management based on the Modified Hypervolume Improvement(MHVI) criterion and pre-screening strategy is proposed. In each generation of KE-VFS-CMA-ES, excessive candidate points are firstly generated and then calculated by the MHVI criterion to find out a few potential points, which will be evaluated by the HF model. Through the above two parts,the promising areas can be detected and the potential points can be screened out, which contributes to speeding up the optimization process twofold. Three classic benchmark functions and a time-consuming engineering case of the aerospace integrally stiffened shell are studied, and results illustrate the excellent efficiency, robustness and applicability of KE-VFS-CMA-ES compared with other four known multi-objective optimization algorithms.
基金supported by the National Natural Science Foundation of China (61403109,61202458)the Specialized Research Fund for the Doctoral Program of Higher Education of China (20112303120007)the Specialized Research Fund for Scientific and Technological Innovation Talents of Harbin (2016RAQXJ036)
文摘To improve the accuracy of the network security situation, a security situation automatic prediction model based on accumulative data preprocess and support vector machine （SVM） optimized by covariance matrix adaptive evolutionary strategy （CMA-ES） is proposed. The proposed model adopts SVM which has strong nonlinear ability. Also, the hyper parameters for SVM are optimized through the CMA-ES which owns good performance in finding optimization automatically. Considering the irregularity of network security situation values, we accumulate the original sequence, so that the internal rules of discrete data can be revealed and it is easy to model. Simulation experiments show that the proposed model has faster convergence-speed and higher prediction accuracy than other extant prediction models.
