Pub Date : 1900-01-01DOI: 10.1109/ICEDIF.2015.7280231
Linxia Zhang, Ting Ma, Enbin Song
We consider the linearly constrained separable convex minimization model, whose objective function is the sum of three convex functions without coupled variables. The generalized alternating direction method of multipliers (ADMM) is a very effective approach for solving this kind of problem. Recently, the literature of ADMM focus on three or more blocks. [14] has shown a global linear convergence of the generalized ADMM when the number of blocks is more than two by using an error bound analysis method. In contrast, in this paper we make the different assumptions and prove the linear convergence of the generalized ADMM with another approach. This paper shows the global convergence of the generalized ADMM when only one function is assumed to be strongly convex. Moreover, it also implies that global linear convergence can be guaranteed when two of the three separable convex functions are strongly convex and one of them has Lipschitz continuous gradient, along with certain rank assumptions on the linear constraint matrices.
{"title":"On the global and linear convergence of the generalized ADMM with three blocks","authors":"Linxia Zhang, Ting Ma, Enbin Song","doi":"10.1109/ICEDIF.2015.7280231","DOIUrl":"https://doi.org/10.1109/ICEDIF.2015.7280231","url":null,"abstract":"We consider the linearly constrained separable convex minimization model, whose objective function is the sum of three convex functions without coupled variables. The generalized alternating direction method of multipliers (ADMM) is a very effective approach for solving this kind of problem. Recently, the literature of ADMM focus on three or more blocks. [14] has shown a global linear convergence of the generalized ADMM when the number of blocks is more than two by using an error bound analysis method. In contrast, in this paper we make the different assumptions and prove the linear convergence of the generalized ADMM with another approach. This paper shows the global convergence of the generalized ADMM when only one function is assumed to be strongly convex. Moreover, it also implies that global linear convergence can be guaranteed when two of the three separable convex functions are strongly convex and one of them has Lipschitz continuous gradient, along with certain rank assumptions on the linear constraint matrices.","PeriodicalId":355975,"journal":{"name":"2015 International Conference on Estimation, Detection and Information Fusion (ICEDIF)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131406576","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1109/ICEDIF.2015.7280215
Chunxia Wang, Chenglin Wen, Yang Lu
It is difficult to be directly measured for some product quantities by sensors in industrial processes. There are many ways to use the relationship between process variables and quality variables to predict product quality information indirectly, and then use it to fault diagnosis, such as partial least squares (PLS), total projection to latent structures (T-PLS) algorithm and so on. T-PLS decomposes the principal component space into two subspaces: Y-related subspace and Y-unrelated subspace, according to the prediction value of quality variables based on PLS. This paper presents an improved method of T-PLS. The improved method uses the ELM theory to predict quality, then the projection space is further decomposed based on the quality predict results of ELM. According to the comparison of ELM and PLS as well as the comparison of T-PLS and the new method in this paper, it proves the validity of the proposed method. Simulation verifies its properties.
{"title":"A fault diagnosis method by using extreme learning machine","authors":"Chunxia Wang, Chenglin Wen, Yang Lu","doi":"10.1109/ICEDIF.2015.7280215","DOIUrl":"https://doi.org/10.1109/ICEDIF.2015.7280215","url":null,"abstract":"It is difficult to be directly measured for some product quantities by sensors in industrial processes. There are many ways to use the relationship between process variables and quality variables to predict product quality information indirectly, and then use it to fault diagnosis, such as partial least squares (PLS), total projection to latent structures (T-PLS) algorithm and so on. T-PLS decomposes the principal component space into two subspaces: Y-related subspace and Y-unrelated subspace, according to the prediction value of quality variables based on PLS. This paper presents an improved method of T-PLS. The improved method uses the ELM theory to predict quality, then the projection space is further decomposed based on the quality predict results of ELM. According to the comparison of ELM and PLS as well as the comparison of T-PLS and the new method in this paper, it proves the validity of the proposed method. Simulation verifies its properties.","PeriodicalId":355975,"journal":{"name":"2015 International Conference on Estimation, Detection and Information Fusion (ICEDIF)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122210102","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1109/ICEDIF.2015.7280232
Xing Zhang, Shaohua Ma, Wei Shi, Dong Han
In order to meet the need of source authentication in a wireless sensor network composed of IRIS nodes, this paper presents the implementation and performance analysis of the elliptic curve digital signature algorithm (ECDSA) on IRIS nodes. We choose 7 kinds of optimization algorithms for ECDSA to test and compare their performance further. By turning these optimizations on or off, we compare their ROM/RAM consumption, initialization time, signature generation time and signature verification time.
{"title":"Implementation of elliptic curve digital signature algorithm on IRIS nodes","authors":"Xing Zhang, Shaohua Ma, Wei Shi, Dong Han","doi":"10.1109/ICEDIF.2015.7280232","DOIUrl":"https://doi.org/10.1109/ICEDIF.2015.7280232","url":null,"abstract":"In order to meet the need of source authentication in a wireless sensor network composed of IRIS nodes, this paper presents the implementation and performance analysis of the elliptic curve digital signature algorithm (ECDSA) on IRIS nodes. We choose 7 kinds of optimization algorithms for ECDSA to test and compare their performance further. By turning these optimizations on or off, we compare their ROM/RAM consumption, initialization time, signature generation time and signature verification time.","PeriodicalId":355975,"journal":{"name":"2015 International Conference on Estimation, Detection and Information Fusion (ICEDIF)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114441262","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1109/ICEDIF.2015.7280207
Furong Liu, W. Yuan, Yongbao Ma, Yi Zhou, Hongqing Liu
This paper studies an enhanced robust kernel least mean square (KLMS) adaptive filtering algorithm for nonlinear acoustic echo cancellation (NLAEC) in impulsive noise environment. Robust KLMS algorithm based on M-estimate theory shows robustness to simulated, Contaminated Gaussian (CG) impulsive noise. However, it fails to combat real-world impulsive noise which normally consists of a few consecutive impulsive samples. In this work, the linear prediction (LP) scheme is applied to the KLMS algorithm to detect and cancel the impulsive noise. The resultant LP-based KLMS (LPKLMS) algorithm thus can achieve improved robustness to the real-world impulsive noise which is frequently encountered in NLAEC and other applications alike.
{"title":"New enhanced robust kernel least mean square adaptive filtering algorithm","authors":"Furong Liu, W. Yuan, Yongbao Ma, Yi Zhou, Hongqing Liu","doi":"10.1109/ICEDIF.2015.7280207","DOIUrl":"https://doi.org/10.1109/ICEDIF.2015.7280207","url":null,"abstract":"This paper studies an enhanced robust kernel least mean square (KLMS) adaptive filtering algorithm for nonlinear acoustic echo cancellation (NLAEC) in impulsive noise environment. Robust KLMS algorithm based on M-estimate theory shows robustness to simulated, Contaminated Gaussian (CG) impulsive noise. However, it fails to combat real-world impulsive noise which normally consists of a few consecutive impulsive samples. In this work, the linear prediction (LP) scheme is applied to the KLMS algorithm to detect and cancel the impulsive noise. The resultant LP-based KLMS (LPKLMS) algorithm thus can achieve improved robustness to the real-world impulsive noise which is frequently encountered in NLAEC and other applications alike.","PeriodicalId":355975,"journal":{"name":"2015 International Conference on Estimation, Detection and Information Fusion (ICEDIF)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129326718","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1109/ICEDIF.2015.7280229
Qingzhen Wen, Yan Zhou, Lan Hu, Jian-xun Li, Dongli Wang
Target tracking is one of the most important applications for wireless sensor networks (WSNs). It is usually assumed that the knowledge of the sensor nodes' position is known precisely. However, practically nodes are randomly deployed without prior knowledge about their own positions. In this situation, simultaneous localization and tracking (SLAT) is necessary and is receiving more and more research interest during the last few years. In this paper, several popular and practical filtering techniques are reviewed and compared for the problem of SLAT, including extended Kalman filtering (EKF), unscented Kalman filtering (UKF), and interactive multiple model (IMM). Simulation examples are included to demonstrate the superiority and shortcoming of each method. Results show that compared with other methods, IMM based on UKFs has better accuracy in both localization and tracking, as well as higher robustness.
{"title":"Comparison of filtering techniques for simultaneous localization and tracking","authors":"Qingzhen Wen, Yan Zhou, Lan Hu, Jian-xun Li, Dongli Wang","doi":"10.1109/ICEDIF.2015.7280229","DOIUrl":"https://doi.org/10.1109/ICEDIF.2015.7280229","url":null,"abstract":"Target tracking is one of the most important applications for wireless sensor networks (WSNs). It is usually assumed that the knowledge of the sensor nodes' position is known precisely. However, practically nodes are randomly deployed without prior knowledge about their own positions. In this situation, simultaneous localization and tracking (SLAT) is necessary and is receiving more and more research interest during the last few years. In this paper, several popular and practical filtering techniques are reviewed and compared for the problem of SLAT, including extended Kalman filtering (EKF), unscented Kalman filtering (UKF), and interactive multiple model (IMM). Simulation examples are included to demonstrate the superiority and shortcoming of each method. Results show that compared with other methods, IMM based on UKFs has better accuracy in both localization and tracking, as well as higher robustness.","PeriodicalId":355975,"journal":{"name":"2015 International Conference on Estimation, Detection and Information Fusion (ICEDIF)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125517696","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1109/ICEDIF.2015.7280195
Ying Wei
In this paper, transform domain LMS (TDLMS) and TDLMS based on decomposition technology (TDLMS-DT) are mixed together by so-called convex combination approach to achieve relatively fast convergence speed and low steady-state performance. The simulation results confirm the efficiency of the proposed algorithm.
{"title":"Convex combination for TDLMS adaptive filters","authors":"Ying Wei","doi":"10.1109/ICEDIF.2015.7280195","DOIUrl":"https://doi.org/10.1109/ICEDIF.2015.7280195","url":null,"abstract":"In this paper, transform domain LMS (TDLMS) and TDLMS based on decomposition technology (TDLMS-DT) are mixed together by so-called convex combination approach to achieve relatively fast convergence speed and low steady-state performance. The simulation results confirm the efficiency of the proposed algorithm.","PeriodicalId":355975,"journal":{"name":"2015 International Conference on Estimation, Detection and Information Fusion (ICEDIF)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130291732","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1109/ICEDIF.2015.7280218
Chenguang Zhang, Zeqing Yao
Targeting is the fundamental work in cyberspace operational plan. This paper investigates the basic tradeoffs and decision processes involved in cyber targeting and proposes a simple game theoretic model for cyberspace targeting to support operational plan. Then an optimal targeting strategy decision algorithm applying the game theoretic model is developed. The key component of this game theoretic model is its ability to predict equilibrium. The paper ends up with an example on showing how the game theoretic model supports targeting decision-making, which demonstrates the simplicity and effectiveness of this decision-making model.
{"title":"A game theoretic model of targeting in cyberspace","authors":"Chenguang Zhang, Zeqing Yao","doi":"10.1109/ICEDIF.2015.7280218","DOIUrl":"https://doi.org/10.1109/ICEDIF.2015.7280218","url":null,"abstract":"Targeting is the fundamental work in cyberspace operational plan. This paper investigates the basic tradeoffs and decision processes involved in cyber targeting and proposes a simple game theoretic model for cyberspace targeting to support operational plan. Then an optimal targeting strategy decision algorithm applying the game theoretic model is developed. The key component of this game theoretic model is its ability to predict equilibrium. The paper ends up with an example on showing how the game theoretic model supports targeting decision-making, which demonstrates the simplicity and effectiveness of this decision-making model.","PeriodicalId":355975,"journal":{"name":"2015 International Conference on Estimation, Detection and Information Fusion (ICEDIF)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122492451","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1109/ICEDIF.2015.7280211
Li Wang, Xianjin Fang
New botnet and bots using P2P protocols have become the increasing threat to network security because P2P botnet and bots do not have a centralized point to trace back or shut down, thus detecting the P2P bots is very difficult. In order to deal with these threats, the model in terms of the dendritic cells algorithm (DCA) is presented to detect P2P bots on an individual host. The detailed approach to detect P2P bots is also described. The raw data for P2P bots detection are obtained via APITrace tool. The processes ID are mapped into the antigens, and the behavioral data created by the processes are mapped into the signals, which are the time series input data of DCA. These data as the input data of the algorithm are used to implement data fusion and correlation. Through related experiments, the systems using the proposed method in this paper can detect p2p bots. The method should outperform the other existing P2P detection techniques due to its linear computation in the process of detection and analysis, and no training phrase.
{"title":"The detection of P2P bots using the dendritic cells algorithm","authors":"Li Wang, Xianjin Fang","doi":"10.1109/ICEDIF.2015.7280211","DOIUrl":"https://doi.org/10.1109/ICEDIF.2015.7280211","url":null,"abstract":"New botnet and bots using P2P protocols have become the increasing threat to network security because P2P botnet and bots do not have a centralized point to trace back or shut down, thus detecting the P2P bots is very difficult. In order to deal with these threats, the model in terms of the dendritic cells algorithm (DCA) is presented to detect P2P bots on an individual host. The detailed approach to detect P2P bots is also described. The raw data for P2P bots detection are obtained via APITrace tool. The processes ID are mapped into the antigens, and the behavioral data created by the processes are mapped into the signals, which are the time series input data of DCA. These data as the input data of the algorithm are used to implement data fusion and correlation. Through related experiments, the systems using the proposed method in this paper can detect p2p bots. The method should outperform the other existing P2P detection techniques due to its linear computation in the process of detection and analysis, and no training phrase.","PeriodicalId":355975,"journal":{"name":"2015 International Conference on Estimation, Detection and Information Fusion (ICEDIF)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127519286","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1109/ICEDIF.2015.7280208
Yuanzhang Fan, Zhiliang Yang, Xiangyuan Bu, Jianping An
In traffic environment, conventional FMCW radar with triangular transmit waveform may bring out many false targets in multi-target situations and result in a high false alarm rate. An improved FMCW waveform and multi-target detection algorithm for vehicular applications is presented. The designed waveform in each small cycle is composed of two-segment: LFM section and constant frequency section. They have the same duration, yet in two adjacent small cycles the two LFM slopes are opposite sign and different size. Then the two adjacent LFM bandwidths are unequal. Within a determinate frequency range, the constant frequencies are modulated by a unique PN code sequence for different automotive radar in a big period. Corresponding to the improved waveform, which combines the advantages of both FSK and FMCW formats, a judgment algorithm is used in the continuous small cycle to further eliminate the false targets. The combination of unambiguous ranges and relative velocities can confirm and cancel most false targets in two adjacent small cycles.
{"title":"Radar waveform design and multi-target detection in vehicular applications","authors":"Yuanzhang Fan, Zhiliang Yang, Xiangyuan Bu, Jianping An","doi":"10.1109/ICEDIF.2015.7280208","DOIUrl":"https://doi.org/10.1109/ICEDIF.2015.7280208","url":null,"abstract":"In traffic environment, conventional FMCW radar with triangular transmit waveform may bring out many false targets in multi-target situations and result in a high false alarm rate. An improved FMCW waveform and multi-target detection algorithm for vehicular applications is presented. The designed waveform in each small cycle is composed of two-segment: LFM section and constant frequency section. They have the same duration, yet in two adjacent small cycles the two LFM slopes are opposite sign and different size. Then the two adjacent LFM bandwidths are unequal. Within a determinate frequency range, the constant frequencies are modulated by a unique PN code sequence for different automotive radar in a big period. Corresponding to the improved waveform, which combines the advantages of both FSK and FMCW formats, a judgment algorithm is used in the continuous small cycle to further eliminate the false targets. The combination of unambiguous ranges and relative velocities can confirm and cancel most false targets in two adjacent small cycles.","PeriodicalId":355975,"journal":{"name":"2015 International Conference on Estimation, Detection and Information Fusion (ICEDIF)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128891765","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1109/ICEDIF.2015.7280149
Tian Tian, Shuli Sun
The optimal filtering problem is addressed for multi-rate systems with one-step auto-correlated noises. The state is updated at the highest sampling rate and the sensor has a lower sampling rate. System noise and measurement noise are one-step auto-correlated, respectively. An optimal filter in the linear minimum variance sense is proposed via an innovation analysis approach. A simulation example is given to show the effectiveness of the proposed algorithms.
{"title":"Optimal filtering for multi-rate systems with one-step auto-correlated noises","authors":"Tian Tian, Shuli Sun","doi":"10.1109/ICEDIF.2015.7280149","DOIUrl":"https://doi.org/10.1109/ICEDIF.2015.7280149","url":null,"abstract":"The optimal filtering problem is addressed for multi-rate systems with one-step auto-correlated noises. The state is updated at the highest sampling rate and the sensor has a lower sampling rate. System noise and measurement noise are one-step auto-correlated, respectively. An optimal filter in the linear minimum variance sense is proposed via an innovation analysis approach. A simulation example is given to show the effectiveness of the proposed algorithms.","PeriodicalId":355975,"journal":{"name":"2015 International Conference on Estimation, Detection and Information Fusion (ICEDIF)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128081632","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：