The piecewise linear recursive convolution （PLRC） finite-different time-domain （FDTD） method greatly improves accuracy over the original recursive convolution （RC） FDTD approach but retains its speed and efficie...The piecewise linear recursive convolution （PLRC） finite-different time-domain （FDTD） method greatly improves accuracy over the original recursive convolution （RC） FDTD approach but retains its speed and efficiency advantages. A PLRC-FDTD formulation for magnetized plasma which incorporates both anisotropy and frequency dispersion at the same time is presented, enabled the transient analysis of magnetized plasma media. The technique is illustrated by numerical simulations the reflection and transmission coefficients through a magnetized plasma layer. The results show that the PLRC-FDTD method has significantly improved the accuracy over the original RC method.展开更多
The piecewise linear recursive convolution （PLRC） finite-different time-domain （FDTD） method improves accuracy over the original recursive convolution （RC） FDTD approach and current density convolution （JEC） b...The piecewise linear recursive convolution （PLRC） finite-different time-domain （FDTD） method improves accuracy over the original recursive convolution （RC） FDTD approach and current density convolution （JEC） but retains their advantages in speed and efficiency. This paper describes a revised piecewise linear recursive convolution PLRC-FDTD formulation for magnetized plasma which incorporates both anisotropy and frequency dispersion at the same time, enabling the transient analysis of magnetized plasma media. The technique is illustrated by numerical simulations of the reflection and transmission coefficients through a magnetized plasma layer. The results show that the revised PLRC-FDTD method has improved the accuracy over the original RC FDTD method and JEC FDTD method.展开更多
Recently,many researchers have concentrated on using neural networks to learn features for Distant Supervised Relation Extraction(DSRE).These approaches generally use a softmax classifier with cross-entropy loss,which...Recently,many researchers have concentrated on using neural networks to learn features for Distant Supervised Relation Extraction(DSRE).These approaches generally use a softmax classifier with cross-entropy loss,which inevitably brings the noise of artificial class NA into classification process.To address the shortcoming,the classifier with ranking loss is employed to DSRE.Uniformly randomly selecting a relation or heuristically selecting the highest score among all incorrect relations are two common methods for generating a negative class in the ranking loss function.However,the majority of the generated negative class can be easily discriminated from positive class and will contribute little towards the training.Inspired by Generative Adversarial Networks(GANs),we use a neural network as the negative class generator to assist the training of our desired model,which acts as the discriminator in GANs.Through the alternating optimization of generator and discriminator,the generator is learning to produce more and more discriminable negative classes and the discriminator has to become better as well.This framework is independent of the concrete form of generator and discriminator.In this paper,we use a two layers fully-connected neural network as the generator and the Piecewise Convolutional Neural Networks(PCNNs)as the discriminator.Experiment results show that our proposed GAN-based method is effective and performs better than state-of-the-art methods.展开更多
By incorporating the higher order concept,the piecewise linear recursive convolution(PLRC)method and CrankNicolson Douglas-Gunn(CNDG)algorithm,the unconditionally stable complex frequency shifted nearly perfectly matc...By incorporating the higher order concept,the piecewise linear recursive convolution(PLRC)method and CrankNicolson Douglas-Gunn(CNDG)algorithm,the unconditionally stable complex frequency shifted nearly perfectly matched layer(CFS-NPML)is proposed to terminate the left-handed material(LHM)domain.The proposed scheme takes advantages of CFSNPML formulation,the higher order concept PLRC method and the unconditionally stable CNDG algorithm in terms of absorbing performance,computational efficiency,calculation accuracy and convenient implementation.A numerical example is carried out to demonstrate the effectiveness and efficiency of the proposed scheme.The results indicate that the proposed scheme can not only have considerable absorbing performance but also maintain the unconditional stability of the algorithm with the enlargement of time steps.展开更多
Most supervised methods for relation extraction(RE) involve time-consuming human annotation. Distant supervision for RE is an efficient method to obtain large corpora that contains thousands of instances and various r...Most supervised methods for relation extraction(RE) involve time-consuming human annotation. Distant supervision for RE is an efficient method to obtain large corpora that contains thousands of instances and various relations. However, the existing approaches rely heavily on knowledge bases(e.g., Freebase), thereby introducing data noise. Various relations and noisy labeling instances make the issue difficult to solve. In this study, we propose a model based on a piecewise convolution neural network with adversarial training. Inspired by generative adversarial networks, we adopt a heuristic algorithm to identify noisy datasets and apply adversarial training to RE. Experiments on the extended dataset of SemEval-2010 Task 8 show that our model can obtain more accurate training data for RE and significantly outperforms several competitive baseline models. Our model has an F1 score of 89.61%.展开更多
基金The project was supported by the National Natural Science Foundation of China (60471002) and the Jiangxi ProvincialNatural Science Foundation (0412014)
文摘The piecewise linear recursive convolution （PLRC） finite-different time-domain （FDTD） method greatly improves accuracy over the original recursive convolution （RC） FDTD approach but retains its speed and efficiency advantages. A PLRC-FDTD formulation for magnetized plasma which incorporates both anisotropy and frequency dispersion at the same time is presented, enabled the transient analysis of magnetized plasma media. The technique is illustrated by numerical simulations the reflection and transmission coefficients through a magnetized plasma layer. The results show that the PLRC-FDTD method has significantly improved the accuracy over the original RC method.
基金National Natural Science Foundation of China (No. 60471002) and the Natural Science Foundation ofJiangxi Province (No. 0412014)
文摘The piecewise linear recursive convolution （PLRC） finite-different time-domain （FDTD） method improves accuracy over the original recursive convolution （RC） FDTD approach and current density convolution （JEC） but retains their advantages in speed and efficiency. This paper describes a revised piecewise linear recursive convolution PLRC-FDTD formulation for magnetized plasma which incorporates both anisotropy and frequency dispersion at the same time, enabling the transient analysis of magnetized plasma media. The technique is illustrated by numerical simulations of the reflection and transmission coefficients through a magnetized plasma layer. The results show that the revised PLRC-FDTD method has improved the accuracy over the original RC FDTD method and JEC FDTD method.
基金This research work is supported by the National Natural Science Foundation of China(NO.61772454,6171101570,61602059)Hunan Provincial Natural Science Foundation of China(No.2017JJ3334)+1 种基金the Research Foundation of Education Bureau of Hunan Province,China(No.16C0045)the Open Project Program of the National Laboratory of Pattern Recognition(NLPR).Professor Jin Wang is the corresponding author.
文摘Recently,many researchers have concentrated on using neural networks to learn features for Distant Supervised Relation Extraction(DSRE).These approaches generally use a softmax classifier with cross-entropy loss,which inevitably brings the noise of artificial class NA into classification process.To address the shortcoming,the classifier with ranking loss is employed to DSRE.Uniformly randomly selecting a relation or heuristically selecting the highest score among all incorrect relations are two common methods for generating a negative class in the ranking loss function.However,the majority of the generated negative class can be easily discriminated from positive class and will contribute little towards the training.Inspired by Generative Adversarial Networks(GANs),we use a neural network as the negative class generator to assist the training of our desired model,which acts as the discriminator in GANs.Through the alternating optimization of generator and discriminator,the generator is learning to produce more and more discriminable negative classes and the discriminator has to become better as well.This framework is independent of the concrete form of generator and discriminator.In this paper,we use a two layers fully-connected neural network as the generator and the Piecewise Convolutional Neural Networks(PCNNs)as the discriminator.Experiment results show that our proposed GAN-based method is effective and performs better than state-of-the-art methods.
文摘By incorporating the higher order concept,the piecewise linear recursive convolution(PLRC)method and CrankNicolson Douglas-Gunn(CNDG)algorithm,the unconditionally stable complex frequency shifted nearly perfectly matched layer(CFS-NPML)is proposed to terminate the left-handed material(LHM)domain.The proposed scheme takes advantages of CFSNPML formulation,the higher order concept PLRC method and the unconditionally stable CNDG algorithm in terms of absorbing performance,computational efficiency,calculation accuracy and convenient implementation.A numerical example is carried out to demonstrate the effectiveness and efficiency of the proposed scheme.The results indicate that the proposed scheme can not only have considerable absorbing performance but also maintain the unconditional stability of the algorithm with the enlargement of time steps.
基金supported in part by the National Natural Science Foundation of China (Nos. U1936104 and 2020JCJQ-ZD-012)。
文摘Most supervised methods for relation extraction(RE) involve time-consuming human annotation. Distant supervision for RE is an efficient method to obtain large corpora that contains thousands of instances and various relations. However, the existing approaches rely heavily on knowledge bases(e.g., Freebase), thereby introducing data noise. Various relations and noisy labeling instances make the issue difficult to solve. In this study, we propose a model based on a piecewise convolution neural network with adversarial training. Inspired by generative adversarial networks, we adopt a heuristic algorithm to identify noisy datasets and apply adversarial training to RE. Experiments on the extended dataset of SemEval-2010 Task 8 show that our model can obtain more accurate training data for RE and significantly outperforms several competitive baseline models. Our model has an F1 score of 89.61%.
