This paper introduces a novel blind recognition of non-binary low-density parity-check(LDPC)codes without a candidate set,using ant colony optimization(ACO)algorithm over additive white Gaussian noise(AWGN)channels.Sp...This paper introduces a novel blind recognition of non-binary low-density parity-check(LDPC)codes without a candidate set,using ant colony optimization(ACO)algorithm over additive white Gaussian noise(AWGN)channels.Specifically,the scheme that effectively combines the ACO algorithm and the non-binary elements over finite fields is proposed.Furthermore,an improved,simplified elitist ACO algorithm based on soft decision reliability is introduced to recognize the parity-check matrix over noisy channels.Simulation results show that the recognition rate continuously increases with an increased signalto-noise ratio(SNR)over the AWGN channel.展开更多
Open-set recognition(OSR)is a realistic problem in wireless signal recogni-tion,which means that during the inference phase there may appear unknown classes not seen in the training phase.The method of intra-class spl...Open-set recognition(OSR)is a realistic problem in wireless signal recogni-tion,which means that during the inference phase there may appear unknown classes not seen in the training phase.The method of intra-class splitting(ICS)that splits samples of known classes to imitate unknown classes has achieved great performance.However,this approach relies too much on the predefined splitting ratio and may face huge performance degradation in new environment.In this paper,we train a multi-task learning(MTL)net-work based on the characteristics of wireless signals to improve the performance in new scenes.Besides,we provide a dynamic method to decide the splitting ratio per class to get more precise outer samples.To be specific,we make perturbations to the sample from the center of one class toward its adversarial direction and the change point of confidence scores during this process is used as the splitting threshold.We conduct several experi-ments on one wireless signal dataset collected at 2.4 GHz ISM band by LimeSDR and one open modulation recognition dataset,and the analytical results demonstrate the effective-ness of the proposed method.展开更多
Since its inception,the Internet has been rapidly evolving.With the advancement of science and technology and the explosive growth of the population,the demand for the Internet has been on the rise.Many applications i...Since its inception,the Internet has been rapidly evolving.With the advancement of science and technology and the explosive growth of the population,the demand for the Internet has been on the rise.Many applications in education,healthcare,entertainment,science,and more are being increasingly deployed based on the internet.Concurrently,malicious threats on the internet are on the rise as well.Distributed Denial of Service(DDoS)attacks are among the most common and dangerous threats on the internet today.The scale and complexity of DDoS attacks are constantly growing.Intrusion Detection Systems(IDS)have been deployed and have demonstrated their effectiveness in defense against those threats.In addition,the research of Machine Learning(ML)and Deep Learning(DL)in IDS has gained effective results and significant attention.However,one of the challenges when applying ML and DL techniques in intrusion detection is the identification of unknown attacks.These attacks,which are not encountered during the system’s training,can lead to misclassification with significant errors.In this research,we focused on addressing the issue of Unknown Attack Detection,combining two methods:Spatial Location Constraint Prototype Loss(SLCPL)and Fuzzy C-Means(FCM).With the proposed method,we achieved promising results compared to traditional methods.The proposed method demonstrates a very high accuracy of up to 99.8%with a low false positive rate for known attacks on the Intrusion Detection Evaluation Dataset(CICIDS2017)dataset.Particularly,the accuracy is also very high,reaching 99.7%,and the precision goes up to 99.9%for unknown DDoS attacks on the DDoS Evaluation Dataset(CICDDoS2019)dataset.The success of the proposed method is due to the combination of SLCPL,an advanced Open-Set Recognition(OSR)technique,and FCM,a traditional yet highly applicable clustering technique.This has yielded a novel method in the field of unknown attack detection.This further expands the trend of applying DL and ML techniques in the development of intrusion detection systems and cybersecurity.Finally,implementing the proposed method in real-world systems can enhance the security capabilities against increasingly complex threats on computer networks.展开更多
In the traditional pattern classification method,it usually assumes that the object to be classified must lie in one of given(known)classes of the training data set.However,the training data set may not contain the cl...In the traditional pattern classification method,it usually assumes that the object to be classified must lie in one of given(known)classes of the training data set.However,the training data set may not contain the class of some objects in practice,and this is considered as an Open-Set Recognition(OSR)problem.In this paper,we propose a new progressive open-set recognition method with adaptive probability threshold.Both the labeled training data and the test data(objects to be classified)are put into a common data set,and the k-Nearest Neighbors(k-NNs)of each object are sought in this common set.Then,we can determine the probability of object lying in the given classes.If the majority of k-NNs of the object are from labeled training data,this object quite likely belongs to one of the given classes,and the density of the object and its neighbors is taken into account here.However,when most of k-NNs are from the unlabeled test data set,the class of object is considered very uncertain because the class of test data is unknown,and this object cannot be classified in this step.Once the objects belonging to known classes with high probability are all found,we re-calculate the probability of the other uncertain objects belonging to known classes based on the labeled training data and the objects marked with the estimated probability.Such iteration will stop when the probabilities of all the objects belonging to known classes are not changed.Then,a modified Otsu’s method is employed to adaptively seek the probability threshold for the final classification.If the probability of object belonging to known classes is smaller than this threshold,it will be assigned to the ignorant(unknown)class that is not included in training data set.The other objects will be committed to a specific class.The effectiveness of the proposed method has been validated using some experiments.展开更多
Background： Cochlear implants （Cls） can improve speech recognition for children with severe congenital hearing loss, and open-set word recognition is an important efficacy measure. This study examined Mandarin open...Background： Cochlear implants （Cls） can improve speech recognition for children with severe congenital hearing loss, and open-set word recognition is an important efficacy measure. This study examined Mandarin open-set word recognition development among Chinese children with Cls and normal hearing （NH）. Methods： This study included 457 children with CIs and 131 children with NH, who completed the Mandarin lexical neighborhood test. The results for children at 1-8 years alter receiving their Cls were compared to those from the children with NH using linear regression analysis and analysis of variance. Results： Recognition of disyllabic easy words, disyllabic hard words, monosyllabic easy words, and monosyllabic hard words increased with time after CI implantation. Scores for cases with implantation before 3 years old were significantly better than those for implantation after 3 years old. There were significant differences in open-set word recognition between the CI and NH groups. For implantation before 2 years, there was no significant difference in recognition at the ages of 6-7 years, compared to 3-year-old children with NH, or at the age of 10 years, compared to 6-year-old children with NH. For implantation before 3 years, there was no significant difference in recognition at the ages of 8 9 years, compared to 3-year-old children with NH, or at the age of 10 years, compared to 6-year-old children with NH. For implantation after 3 years, there was a significant difference in recognition at the age of 13 years, compared to 3-year-old children with NH. Conclusions： Mandarin open-set word recognition increased with time after CI implantation, and the age at implantation had a significant effect on long-term speech recognition. Chinese children with Cls had delayed but similar development of recognition, compared to norrnal children. Early CI implantation can shorten the gap between children with Cls and normal children.展开更多
A novel face verification algorithm using competitive negative samples is proposed.In the algorithm,the tested face matches not only with the claimed client face but also with competitive negative samples,and all the ...A novel face verification algorithm using competitive negative samples is proposed.In the algorithm,the tested face matches not only with the claimed client face but also with competitive negative samples,and all the matching scores are combined to make a final decision.Based on the algorithm,three schemes,including closestnegative-sample scheme,all-negative-sample scheme,and closest-few-negative-sample scheme,are designed.They are tested and compared with the traditional similaritybased verification approach on several databases with different features and classifiers.Experiments demonstrate that the three schemes reduce the verification error rate by 25.15%,30.24%,and 30.97%,on average,respectively.展开更多
文摘This paper introduces a novel blind recognition of non-binary low-density parity-check(LDPC)codes without a candidate set,using ant colony optimization(ACO)algorithm over additive white Gaussian noise(AWGN)channels.Specifically,the scheme that effectively combines the ACO algorithm and the non-binary elements over finite fields is proposed.Furthermore,an improved,simplified elitist ACO algorithm based on soft decision reliability is introduced to recognize the parity-check matrix over noisy channels.Simulation results show that the recognition rate continuously increases with an increased signalto-noise ratio(SNR)over the AWGN channel.
文摘Open-set recognition(OSR)is a realistic problem in wireless signal recogni-tion,which means that during the inference phase there may appear unknown classes not seen in the training phase.The method of intra-class splitting(ICS)that splits samples of known classes to imitate unknown classes has achieved great performance.However,this approach relies too much on the predefined splitting ratio and may face huge performance degradation in new environment.In this paper,we train a multi-task learning(MTL)net-work based on the characteristics of wireless signals to improve the performance in new scenes.Besides,we provide a dynamic method to decide the splitting ratio per class to get more precise outer samples.To be specific,we make perturbations to the sample from the center of one class toward its adversarial direction and the change point of confidence scores during this process is used as the splitting threshold.We conduct several experi-ments on one wireless signal dataset collected at 2.4 GHz ISM band by LimeSDR and one open modulation recognition dataset,and the analytical results demonstrate the effective-ness of the proposed method.
基金This research was partly supported by the National Science and Technology Council,Taiwan with Grant Numbers 112-2221-E-992-045,112-2221-E-992-057-MY3 and 112-2622-8-992-009-TD1.
文摘Since its inception,the Internet has been rapidly evolving.With the advancement of science and technology and the explosive growth of the population,the demand for the Internet has been on the rise.Many applications in education,healthcare,entertainment,science,and more are being increasingly deployed based on the internet.Concurrently,malicious threats on the internet are on the rise as well.Distributed Denial of Service(DDoS)attacks are among the most common and dangerous threats on the internet today.The scale and complexity of DDoS attacks are constantly growing.Intrusion Detection Systems(IDS)have been deployed and have demonstrated their effectiveness in defense against those threats.In addition,the research of Machine Learning(ML)and Deep Learning(DL)in IDS has gained effective results and significant attention.However,one of the challenges when applying ML and DL techniques in intrusion detection is the identification of unknown attacks.These attacks,which are not encountered during the system’s training,can lead to misclassification with significant errors.In this research,we focused on addressing the issue of Unknown Attack Detection,combining two methods:Spatial Location Constraint Prototype Loss(SLCPL)and Fuzzy C-Means(FCM).With the proposed method,we achieved promising results compared to traditional methods.The proposed method demonstrates a very high accuracy of up to 99.8%with a low false positive rate for known attacks on the Intrusion Detection Evaluation Dataset(CICIDS2017)dataset.Particularly,the accuracy is also very high,reaching 99.7%,and the precision goes up to 99.9%for unknown DDoS attacks on the DDoS Evaluation Dataset(CICDDoS2019)dataset.The success of the proposed method is due to the combination of SLCPL,an advanced Open-Set Recognition(OSR)technique,and FCM,a traditional yet highly applicable clustering technique.This has yielded a novel method in the field of unknown attack detection.This further expands the trend of applying DL and ML techniques in the development of intrusion detection systems and cybersecurity.Finally,implementing the proposed method in real-world systems can enhance the security capabilities against increasingly complex threats on computer networks.
基金supported by the National Natural Science Foundation of China(Nos.U20B2067).
文摘In the traditional pattern classification method,it usually assumes that the object to be classified must lie in one of given(known)classes of the training data set.However,the training data set may not contain the class of some objects in practice,and this is considered as an Open-Set Recognition(OSR)problem.In this paper,we propose a new progressive open-set recognition method with adaptive probability threshold.Both the labeled training data and the test data(objects to be classified)are put into a common data set,and the k-Nearest Neighbors(k-NNs)of each object are sought in this common set.Then,we can determine the probability of object lying in the given classes.If the majority of k-NNs of the object are from labeled training data,this object quite likely belongs to one of the given classes,and the density of the object and its neighbors is taken into account here.However,when most of k-NNs are from the unlabeled test data set,the class of object is considered very uncertain because the class of test data is unknown,and this object cannot be classified in this step.Once the objects belonging to known classes with high probability are all found,we re-calculate the probability of the other uncertain objects belonging to known classes based on the labeled training data and the objects marked with the estimated probability.Such iteration will stop when the probabilities of all the objects belonging to known classes are not changed.Then,a modified Otsu’s method is employed to adaptively seek the probability threshold for the final classification.If the probability of object belonging to known classes is smaller than this threshold,it will be assigned to the ignorant(unknown)class that is not included in training data set.The other objects will be committed to a specific class.The effectiveness of the proposed method has been validated using some experiments.
基金This study was supported by a grant from the National Natural Science Foundation of China （No. 81670923）.
文摘Background： Cochlear implants （Cls） can improve speech recognition for children with severe congenital hearing loss, and open-set word recognition is an important efficacy measure. This study examined Mandarin open-set word recognition development among Chinese children with Cls and normal hearing （NH）. Methods： This study included 457 children with CIs and 131 children with NH, who completed the Mandarin lexical neighborhood test. The results for children at 1-8 years alter receiving their Cls were compared to those from the children with NH using linear regression analysis and analysis of variance. Results： Recognition of disyllabic easy words, disyllabic hard words, monosyllabic easy words, and monosyllabic hard words increased with time after CI implantation. Scores for cases with implantation before 3 years old were significantly better than those for implantation after 3 years old. There were significant differences in open-set word recognition between the CI and NH groups. For implantation before 2 years, there was no significant difference in recognition at the ages of 6-7 years, compared to 3-year-old children with NH, or at the age of 10 years, compared to 6-year-old children with NH. For implantation before 3 years, there was no significant difference in recognition at the ages of 8 9 years, compared to 3-year-old children with NH, or at the age of 10 years, compared to 6-year-old children with NH. For implantation after 3 years, there was a significant difference in recognition at the age of 13 years, compared to 3-year-old children with NH. Conclusions： Mandarin open-set word recognition increased with time after CI implantation, and the age at implantation had a significant effect on long-term speech recognition. Chinese children with Cls had delayed but similar development of recognition, compared to norrnal children. Early CI implantation can shorten the gap between children with Cls and normal children.
基金supported by the National Natural Science Foundation of China (No.69972024)the National High Technology Research and Development Program of China (No.2001A4114081).
文摘A novel face verification algorithm using competitive negative samples is proposed.In the algorithm,the tested face matches not only with the claimed client face but also with competitive negative samples,and all the matching scores are combined to make a final decision.Based on the algorithm,three schemes,including closestnegative-sample scheme,all-negative-sample scheme,and closest-few-negative-sample scheme,are designed.They are tested and compared with the traditional similaritybased verification approach on several databases with different features and classifiers.Experiments demonstrate that the three schemes reduce the verification error rate by 25.15%,30.24%,and 30.97%,on average,respectively.
