Pub Date : 2013-12-01DOI: 10.1109/ICICS.2013.6782865
Xing Guang John Yang, W. Ser, S. G. Razul, C. See
In this paper, we propose an adaptive WMA-MVDR estimator for mitigating impulsive noise in a multiple-access interference (MAI) environment. A time-domain Bernoulli-Gaussian process is used to model the impulsive noise. The estimator comprises two stages of processing: an adaptive window-mean amplitude (WMA) filter and a modified MVDR (Minimum Variance Distortionless Response) estimator. Numerical results show that the bit error rate (BER) performance of the proposed algorithm outperforms some existing estimators under the impulsive noise environment.
{"title":"Impulsive noise mitigation using an adaptive WMA-MVDR estimator for array based wireless communications","authors":"Xing Guang John Yang, W. Ser, S. G. Razul, C. See","doi":"10.1109/ICICS.2013.6782865","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782865","url":null,"abstract":"In this paper, we propose an adaptive WMA-MVDR estimator for mitigating impulsive noise in a multiple-access interference (MAI) environment. A time-domain Bernoulli-Gaussian process is used to model the impulsive noise. The estimator comprises two stages of processing: an adaptive window-mean amplitude (WMA) filter and a modified MVDR (Minimum Variance Distortionless Response) estimator. Numerical results show that the bit error rate (BER) performance of the proposed algorithm outperforms some existing estimators under the impulsive noise environment.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124556443","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 : 2013-12-01DOI: 10.1109/ICICS.2013.6782795
K. Feng, Jhih-Heng Yan, You-Wei Chen
In this paper, we demonstrate a simple receiving system for decoding a >100-Gb/s double-sided multiband DDO-OFDM system. In a LR-PON system, with this simple receiving design, 120 Gb/s capacity and splitting ratio of 128 have been achieved.
{"title":"A simple >100-Gb/s multiband DDO-OFDM receiver for high splitting ratio long reach PON systems","authors":"K. Feng, Jhih-Heng Yan, You-Wei Chen","doi":"10.1109/ICICS.2013.6782795","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782795","url":null,"abstract":"In this paper, we demonstrate a simple receiving system for decoding a >100-Gb/s double-sided multiband DDO-OFDM system. In a LR-PON system, with this simple receiving design, 120 Gb/s capacity and splitting ratio of 128 have been achieved.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129082412","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 : 2013-12-01DOI: 10.1109/ICICS.2013.6782847
T. Hwang, P. Gope
With the widespread use of several mobile gadgets, privacy and anonymity of the mobile subscriber becomes a major issue in mobile communication. Through the roaming technology of the global mobility networks, a legitimate subscriber can enjoy the ubiquitous services. Where, the mutual authentication and key agreement between the mobile subscriber and roaming network (VLR/SGSN) is the primary security aspect of many commercial mobile networks. For personal privacy perspective, it is important to develop a mutual authentication and key agreement scheme with several security features including the user anonymity. In this article, we come up with a novel authentication and key agreement scheme, which can assure privacy against eavesdroppers (PAE) with the subscriber anonymity. Simultaneously, here we argue that the proposed scheme can also withstand several other security vulnerabilities like redirection attack, forging-mobile-user attack and location privacy etc. with the less communication cost.
{"title":"Provably secure mutual authentication and key agreement scheme with user anonymity","authors":"T. Hwang, P. Gope","doi":"10.1109/ICICS.2013.6782847","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782847","url":null,"abstract":"With the widespread use of several mobile gadgets, privacy and anonymity of the mobile subscriber becomes a major issue in mobile communication. Through the roaming technology of the global mobility networks, a legitimate subscriber can enjoy the ubiquitous services. Where, the mutual authentication and key agreement between the mobile subscriber and roaming network (VLR/SGSN) is the primary security aspect of many commercial mobile networks. For personal privacy perspective, it is important to develop a mutual authentication and key agreement scheme with several security features including the user anonymity. In this article, we come up with a novel authentication and key agreement scheme, which can assure privacy against eavesdroppers (PAE) with the subscriber anonymity. Simultaneously, here we argue that the proposed scheme can also withstand several other security vulnerabilities like redirection attack, forging-mobile-user attack and location privacy etc. with the less communication cost.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129347223","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 : 2013-12-01DOI: 10.1109/ICICS.2013.6782921
Rongkuan Liu, G. Wang, Bo Li
Physical-layer network coding (PNC) is a natural extension of network coding in wireless communication networks. PNC utilizes the addition characteristic of the electromagnetic wave rationally and improves the throughout in wireless networks significantly. This paper focuses on a key issue in PNC: the effect of pulse shaping on the performance of time synchronization errors. Analysis and simulation results show that raised cosine pulse with roll-off coefficient of zero can resist power penalty furthest due to time synchronization errors in PNC when adopting pulse shaping without ISI. Also when adopting Gaussian pulse shaping, we can get the best effect with parameter of one on resisting power penalty due to time synchronization errors in PNC.
{"title":"The effect of pulse shaping on the performance of physical-layer network coding with time synchronization errors","authors":"Rongkuan Liu, G. Wang, Bo Li","doi":"10.1109/ICICS.2013.6782921","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782921","url":null,"abstract":"Physical-layer network coding (PNC) is a natural extension of network coding in wireless communication networks. PNC utilizes the addition characteristic of the electromagnetic wave rationally and improves the throughout in wireless networks significantly. This paper focuses on a key issue in PNC: the effect of pulse shaping on the performance of time synchronization errors. Analysis and simulation results show that raised cosine pulse with roll-off coefficient of zero can resist power penalty furthest due to time synchronization errors in PNC when adopting pulse shaping without ISI. Also when adopting Gaussian pulse shaping, we can get the best effect with parameter of one on resisting power penalty due to time synchronization errors in PNC.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115924186","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}
The traditional test usually uses a score to present the students' learning performance; however, it seems difficult to clearly understand the students' learning performance only by the score. As a result, this paper proposes an adaptive fuzzy ontology for student learning assessment and applies it to mathematics area. First, the domain experts construct the adaptive mathematics fuzzy ontology by referring to the guidelines of mathematics learning area in Grades 1-9 curriculum. The natural language processing mechanism tags each term with its speech and then filters the terms with useless speeches from the response data. Based on the genetic learning mechanism, the fuzzy reasoning mechanism then reasons the similarity strength between the kept terms and the constructed ontology. The semantic summary mechanism next summarizes the students' learning performance based on the inferred results. Finally, the diagnosis report mechanism presents the diagnosed reports to make officers, teachers, and students themselves much understand examinees' learning progress. Experimental results indicate that the proposed method can generate the suitable summarized sentences to allow teachers to quickly understand which mathematical topic is the one that students should be improved in the future.
{"title":"Adaptive fuzzy ontology for student assessment","authors":"Chang-Shing Lee, Mei-Hui Wang, I-Hsiang Chen, Su-Wei Lin, Pi-Hsia Hung","doi":"10.1109/ICICS.2013.6782880","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782880","url":null,"abstract":"The traditional test usually uses a score to present the students' learning performance; however, it seems difficult to clearly understand the students' learning performance only by the score. As a result, this paper proposes an adaptive fuzzy ontology for student learning assessment and applies it to mathematics area. First, the domain experts construct the adaptive mathematics fuzzy ontology by referring to the guidelines of mathematics learning area in Grades 1-9 curriculum. The natural language processing mechanism tags each term with its speech and then filters the terms with useless speeches from the response data. Based on the genetic learning mechanism, the fuzzy reasoning mechanism then reasons the similarity strength between the kept terms and the constructed ontology. The semantic summary mechanism next summarizes the students' learning performance based on the inferred results. Finally, the diagnosis report mechanism presents the diagnosed reports to make officers, teachers, and students themselves much understand examinees' learning progress. Experimental results indicate that the proposed method can generate the suitable summarized sentences to allow teachers to quickly understand which mathematical topic is the one that students should be improved in the future.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125824744","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 : 2013-12-01DOI: 10.1109/ICICS.2013.6782945
Hao Yu, Li-Chung Lo, Wan-Jen Huang
In this work, we consider relay selection strategy in an amplify-and-forward cooperative cognitive ratio system in order to prolong lifetime of the energy-constrained relay network. The network lifetime considered in this work is based on the outage probability of the secondary cooperative system. Not only the channel condition of each relay, selection of best relay has to satisfy the interference constraint for primary user as well as the residual power of each relay. Here, we proposed four strategies to select the relay for prolonging the lifetime depending on the channel state information (CSI) and residual energy information (REI). From the simulation results, the minimum outage probability strategy (MOP) performs the best among four strategies.
{"title":"Lifetime maximization of secondary cooperative systems in underlay cognitive radio networks","authors":"Hao Yu, Li-Chung Lo, Wan-Jen Huang","doi":"10.1109/ICICS.2013.6782945","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782945","url":null,"abstract":"In this work, we consider relay selection strategy in an amplify-and-forward cooperative cognitive ratio system in order to prolong lifetime of the energy-constrained relay network. The network lifetime considered in this work is based on the outage probability of the secondary cooperative system. Not only the channel condition of each relay, selection of best relay has to satisfy the interference constraint for primary user as well as the residual power of each relay. Here, we proposed four strategies to select the relay for prolonging the lifetime depending on the channel state information (CSI) and residual energy information (REI). From the simulation results, the minimum outage probability strategy (MOP) performs the best among four strategies.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125866893","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 : 2013-12-01DOI: 10.1109/ICICS.2013.6782831
S. K. Sahoo, A. Makur
We have recently proposed a Sequential Generalization of K-means (SGK) to train dictionary for sparse representation. SGK's training performance is as effective as the standard dictionary training algorithm K-SVD, alongside it has a simpler implementation to its advantage. In this piece of work, through the problem of image denoising, we are making a fair comparison between the usability of SGK and K-SVD. The obtained results suggest that we can successfully replace K-SVD with SGK, due to its quicker execution and comparable outcomes. Similarly, it is possible to extend the use of SGK to other applications of sparse representation.
{"title":"Image denoising via sparse representations over Sequential Generalization of K-means (SGK)","authors":"S. K. Sahoo, A. Makur","doi":"10.1109/ICICS.2013.6782831","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782831","url":null,"abstract":"We have recently proposed a Sequential Generalization of K-means (SGK) to train dictionary for sparse representation. SGK's training performance is as effective as the standard dictionary training algorithm K-SVD, alongside it has a simpler implementation to its advantage. In this piece of work, through the problem of image denoising, we are making a fair comparison between the usability of SGK and K-SVD. The obtained results suggest that we can successfully replace K-SVD with SGK, due to its quicker execution and comparable outcomes. Similarly, it is possible to extend the use of SGK to other applications of sparse representation.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126697649","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 : 2013-12-01DOI: 10.1109/ICICS.2013.6782846
Martina Lindorfer, Bernhard Miller, M. Neugschwandtner, Christian Platzer
When it comes to security risks, especially malware, Mac OS X has the questionable reputation of being inherently safe. While there is a substantial body of research and implementations dealing with malware on Windows and, more recently, Android systems, Mac OS X has received little attention so far. To amend this shortcoming, we built a Mac OS X based high-interaction honeypot and used it to evaluate over 6,000 blacklisted URLs to estimate how widespread malware for Mac OS X is today. We further built a dynamic analysis environment and analyzed 148 malicious samples to gain insight into the current state of Mac OS X malware. To the best of our knowledge, we are the first to tackle this task.
说到安全风险，尤其是恶意软件，Mac OS X天生安全的名声值得商榷。虽然有大量的研究和实现处理Windows和最近的Android系统上的恶意软件，但到目前为止，Mac OS X几乎没有受到关注。为了弥补这个缺点，我们建立了一个基于Mac OS X的高交互性蜜罐，并使用它来评估超过6000个黑名单url，以估计Mac OS X恶意软件的传播程度。我们进一步构建了一个动态分析环境，分析了148个恶意样本，以了解Mac OS X恶意软件的现状。据我们所知，我们是第一个处理这项任务的国家。
{"title":"Take a bite - Finding the worm in the Apple","authors":"Martina Lindorfer, Bernhard Miller, M. Neugschwandtner, Christian Platzer","doi":"10.1109/ICICS.2013.6782846","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782846","url":null,"abstract":"When it comes to security risks, especially malware, Mac OS X has the questionable reputation of being inherently safe. While there is a substantial body of research and implementations dealing with malware on Windows and, more recently, Android systems, Mac OS X has received little attention so far. To amend this shortcoming, we built a Mac OS X based high-interaction honeypot and used it to evaluate over 6,000 blacklisted URLs to estimate how widespread malware for Mac OS X is today. We further built a dynamic analysis environment and analyzed 148 malicious samples to gain insight into the current state of Mac OS X malware. To the best of our knowledge, we are the first to tackle this task.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131562733","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 : 2013-12-01DOI: 10.1109/ICICS.2013.6782965
Jing-Ming Guo, Heri Prasetyo
Vehicle verification based on still image feature can be considered as supervised classification problem. An image descriptor is directly derived from the Gabor filtered output statistics of a given image. In general, the magnitude of the Gabor filtered output is modeled as the Gaussian distribution. So that the image descriptor is composed from mean, standard deviation, and skewness value of the Gabor filter magnitude [5, 6, 8]. However, Arrospide et. al. [9] argued that the skewness parameter is not meaningful for the class separation. Then, the feature descriptor is well defined only using mean and standard deviation of Gabor output distribution which leads to lower feature dimensionality. Based on our observation, the magnitude of the Gabor filter has strong tendency to follow the Gamma distribution. We propose a new texture descriptor derived from the maximum likelihood estimation of the Gamma distribution for effectively vehicle verification task. Experimental result shows that the proposed method is superior to the former approach under several classifier techniques.
{"title":"Statistical modeling of the Gabor filter magnitude using Gamma distribution for effectively vehicle verification","authors":"Jing-Ming Guo, Heri Prasetyo","doi":"10.1109/ICICS.2013.6782965","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782965","url":null,"abstract":"Vehicle verification based on still image feature can be considered as supervised classification problem. An image descriptor is directly derived from the Gabor filtered output statistics of a given image. In general, the magnitude of the Gabor filtered output is modeled as the Gaussian distribution. So that the image descriptor is composed from mean, standard deviation, and skewness value of the Gabor filter magnitude [5, 6, 8]. However, Arrospide et. al. [9] argued that the skewness parameter is not meaningful for the class separation. Then, the feature descriptor is well defined only using mean and standard deviation of Gabor output distribution which leads to lower feature dimensionality. Based on our observation, the magnitude of the Gabor filter has strong tendency to follow the Gamma distribution. We propose a new texture descriptor derived from the maximum likelihood estimation of the Gamma distribution for effectively vehicle verification task. Experimental result shows that the proposed method is superior to the former approach under several classifier techniques.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129520608","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 : 2013-12-01DOI: 10.1109/ICICS.2013.6782785
Bilal Mirza, Zhiping Lin
The performance of support vector machines (SVMs) can deteriorate when the number of samples in one class is much greater than that in the other. Existing methods tackle this problem by modifying the learning algorithms or resampling the datasets. In this paper, we propose a new method called one-vs-all for class imbalance learning (OVACIL) which neither modifies the SVM learning algorithms nor resamples the datasets. In the OVACIL method, we re-group a given imbalanced dataset into a number of new datasets comprising of all the original samples and train standard SVM classifiers using each of the datasets. The output scores of these classifiers on a testing sample are then compared and a final decision is made without a fixed decision threshold. This comparison is not biased toward any particular class, resulting in high accuracies of both classes. The Gmean and Fmeasure values obtained by OVACIL on 18 real-world imbalanced datasets surpass the previous best values reported by other state-of-the-art CIL methods on most of these datasets.
{"title":"One-vs-all for class imbalance learning","authors":"Bilal Mirza, Zhiping Lin","doi":"10.1109/ICICS.2013.6782785","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782785","url":null,"abstract":"The performance of support vector machines (SVMs) can deteriorate when the number of samples in one class is much greater than that in the other. Existing methods tackle this problem by modifying the learning algorithms or resampling the datasets. In this paper, we propose a new method called one-vs-all for class imbalance learning (OVACIL) which neither modifies the SVM learning algorithms nor resamples the datasets. In the OVACIL method, we re-group a given imbalanced dataset into a number of new datasets comprising of all the original samples and train standard SVM classifiers using each of the datasets. The output scores of these classifiers on a testing sample are then compared and a final decision is made without a fixed decision threshold. This comparison is not biased toward any particular class, resulting in high accuracies of both classes. The Gmean and Fmeasure values obtained by OVACIL on 18 real-world imbalanced datasets surpass the previous best values reported by other state-of-the-art CIL methods on most of these datasets.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132848476","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
扫码关注我们
求助内容：
应助结果提醒方式：