Pub Date : 2016-09-01DOI: 10.1109/NICS.2016.7725630
Pham Vo Tuan Anh, Vo Nguyen Quoc Bao, K. Le
Performance of dual-hop decode-and-forward (DF) relaying networks employing a limited-energy relay antenna with transmit antenna selection (TAS) for the first hop and maximal ratio combining (MRC) for the second hop is studied. Specifically, a closed-form expression for the system outage probability over uncorrelated Nakagami-m fading channels is derived. Detailed simulation results are given.
{"title":"On the performance of wireless energy harvesting TAS/MRC relaying networks over Nakagami-m fading channels","authors":"Pham Vo Tuan Anh, Vo Nguyen Quoc Bao, K. Le","doi":"10.1109/NICS.2016.7725630","DOIUrl":"https://doi.org/10.1109/NICS.2016.7725630","url":null,"abstract":"Performance of dual-hop decode-and-forward (DF) relaying networks employing a limited-energy relay antenna with transmit antenna selection (TAS) for the first hop and maximal ratio combining (MRC) for the second hop is studied. Specifically, a closed-form expression for the system outage probability over uncorrelated Nakagami-m fading channels is derived. Detailed simulation results are given.","PeriodicalId":347057,"journal":{"name":"2016 3rd National Foundation for Science and Technology Development Conference on Information and Computer Science (NICS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133924587","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 : 2016-09-01DOI: 10.1109/NICS.2016.7725673
H. Thuy, D. T. Anh, Vo Thi Ngoc Chau
The problem of discord detection in a time series has recently attracted much attention and several algorithms have been developed to tackle this problem. However, most of them suffer from high computational cost and hence can not suit real world applications well. In this paper, we propose a novel discord discovery algorithm, named Hash_DD, which is based on SAX representation and hashing. In comparison with HOT SAX, one of the most popular time series discord discovery algorithms, our hash-based algorithm accelerates the discord discovery process remarkably as well as reduces the memory cost. The experimental results have demonstrated that the proposed approach can not only effectively find discords in time series, but also greatly improve the computational efficiency.
{"title":"An effective and efficient hash-based algorithm for time series discord discovery","authors":"H. Thuy, D. T. Anh, Vo Thi Ngoc Chau","doi":"10.1109/NICS.2016.7725673","DOIUrl":"https://doi.org/10.1109/NICS.2016.7725673","url":null,"abstract":"The problem of discord detection in a time series has recently attracted much attention and several algorithms have been developed to tackle this problem. However, most of them suffer from high computational cost and hence can not suit real world applications well. In this paper, we propose a novel discord discovery algorithm, named Hash_DD, which is based on SAX representation and hashing. In comparison with HOT SAX, one of the most popular time series discord discovery algorithms, our hash-based algorithm accelerates the discord discovery process remarkably as well as reduces the memory cost. The experimental results have demonstrated that the proposed approach can not only effectively find discords in time series, but also greatly improve the computational efficiency.","PeriodicalId":347057,"journal":{"name":"2016 3rd National Foundation for Science and Technology Development Conference on Information and Computer Science (NICS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121802636","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 : 2016-09-01DOI: 10.1109/NICS.2016.7725634
P. Phong, B. Cuong, Le Thi Thu Thuy
Intuitionistic linguistic labels (ILLs) as well as intuitionistic linguistic numbers (ILNs), which play some first efforts to deal with intuitionistic linguistic information, were independently developed in recent years. Several aggregation operators for ILNs were proposed. In this paper, arithmetic averaging, weighted arithmetic averaging, ordered weighted averaging and hybrid aggregation operators for ILLs are given. We further investigate that the aforementioned concepts are mathematically equivalent. On the other hand, the aggregation operators for ILLs are simpler and more intuitive than the those of ILNs. This suggests that, in the multi-criteria decision making (MCDM) problem with intuitionistic linguistic information, instead of aggregating ILNs directly, we first convert ILNs into ILLs, then aggregate ILLs. The experimental results also indicate that using the second approach is more effective than the first one.
{"title":"Intuitionistic linguistic label: An equivalent form of intuitionistic linguistic number","authors":"P. Phong, B. Cuong, Le Thi Thu Thuy","doi":"10.1109/NICS.2016.7725634","DOIUrl":"https://doi.org/10.1109/NICS.2016.7725634","url":null,"abstract":"Intuitionistic linguistic labels (ILLs) as well as intuitionistic linguistic numbers (ILNs), which play some first efforts to deal with intuitionistic linguistic information, were independently developed in recent years. Several aggregation operators for ILNs were proposed. In this paper, arithmetic averaging, weighted arithmetic averaging, ordered weighted averaging and hybrid aggregation operators for ILLs are given. We further investigate that the aforementioned concepts are mathematically equivalent. On the other hand, the aggregation operators for ILLs are simpler and more intuitive than the those of ILNs. This suggests that, in the multi-criteria decision making (MCDM) problem with intuitionistic linguistic information, instead of aggregating ILNs directly, we first convert ILNs into ILLs, then aggregate ILLs. The experimental results also indicate that using the second approach is more effective than the first one.","PeriodicalId":347057,"journal":{"name":"2016 3rd National Foundation for Science and Technology Development Conference on Information and Computer Science (NICS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122059433","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 : 2016-09-01DOI: 10.1109/NICS.2016.7725668
T. Hoang, Tran Trung Duy, Vo Nguyen Quoc Bao
In this paper, we propose a partial relay selection protocol using decode-and-forward non-linear energy harvesting model. For performance evaluation, we derive an analytical expression of outage probability for the proposed protocol over Rayleigh fading channels. Monte Carlo simulations are then performed to verify the theoretical results. The results present the efficiency of the relay selection method. Moreover, from the results obtained, the optimal value of the time switching is also investigated.
{"title":"On the performance of non-linear wirelessly powered partial relay selection networks over Rayleigh fading channels","authors":"T. Hoang, Tran Trung Duy, Vo Nguyen Quoc Bao","doi":"10.1109/NICS.2016.7725668","DOIUrl":"https://doi.org/10.1109/NICS.2016.7725668","url":null,"abstract":"In this paper, we propose a partial relay selection protocol using decode-and-forward non-linear energy harvesting model. For performance evaluation, we derive an analytical expression of outage probability for the proposed protocol over Rayleigh fading channels. Monte Carlo simulations are then performed to verify the theoretical results. The results present the efficiency of the relay selection method. Moreover, from the results obtained, the optimal value of the time switching is also investigated.","PeriodicalId":347057,"journal":{"name":"2016 3rd National Foundation for Science and Technology Development Conference on Information and Computer Science (NICS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132620788","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 : 2016-09-01DOI: 10.1109/NICS.2016.7725663
Tam Nguyen Kieu, H. H. Duy, L. N. Ngoc, Tuan Dao Huy, N. N. Hong, M. Voznák
The energy harvesting (EH) protocol lied on the surrounding radio frequency (RF) has lastly become the progressive approach to extend the lifetime of the wireless systems. This paper mentions the energy harvesting structure of the half duplex and the full duplex relaying networks. We extract the closed-form expression of the instantaneous throughput and then compare them together by applying time switching based relaying (TSR) protocol and Amplify-and-Forward (AF) scheme. An essential result can be found distinctly that the time fraction, the position of relay, the noise at relay, the energy conversion factor as well as the target rate in TSR act on their throughput. At last, the numerical results give an efficiency relaying strategic way in the half-duplex and full duplex cooperation systems.
{"title":"An instantaneous transmission mode analysis in the half-duplex and full-duplex relaying network","authors":"Tam Nguyen Kieu, H. H. Duy, L. N. Ngoc, Tuan Dao Huy, N. N. Hong, M. Voznák","doi":"10.1109/NICS.2016.7725663","DOIUrl":"https://doi.org/10.1109/NICS.2016.7725663","url":null,"abstract":"The energy harvesting (EH) protocol lied on the surrounding radio frequency (RF) has lastly become the progressive approach to extend the lifetime of the wireless systems. This paper mentions the energy harvesting structure of the half duplex and the full duplex relaying networks. We extract the closed-form expression of the instantaneous throughput and then compare them together by applying time switching based relaying (TSR) protocol and Amplify-and-Forward (AF) scheme. An essential result can be found distinctly that the time fraction, the position of relay, the noise at relay, the energy conversion factor as well as the target rate in TSR act on their throughput. At last, the numerical results give an efficiency relaying strategic way in the half-duplex and full duplex cooperation systems.","PeriodicalId":347057,"journal":{"name":"2016 3rd National Foundation for Science and Technology Development Conference on Information and Computer Science (NICS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133490807","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 : 2016-09-01DOI: 10.1109/NICS.2016.7725644
D. Nguyen, Pham Ngoc Hung, Viet-Ha Nguyen
This research proposes an automated test case generation method for C functions. In this method, the source code is transformed into a control flow graph corresponding to the given coverage criterion. After that, a list of feasible test paths are discovered by traversing the control flow graph using backtracking algorithm, symbolic execution, and Z3 solver. We also generate test cases for functions containing one loop or two-nested loop. A tool supporting the proposed method has been developed and applied to test on some C functions. The experimental results show the high coverage with the minimum number of test cases, the ability to improve the total time of the test case generation with a specified coverage criterion, and the increasing precision of checking the feasibility of test paths if comparing with the random technique. The experimental results display the potential usefulness of this tool for automated test case generation in practice.
{"title":"A method for automated unit testing of C programs","authors":"D. Nguyen, Pham Ngoc Hung, Viet-Ha Nguyen","doi":"10.1109/NICS.2016.7725644","DOIUrl":"https://doi.org/10.1109/NICS.2016.7725644","url":null,"abstract":"This research proposes an automated test case generation method for C functions. In this method, the source code is transformed into a control flow graph corresponding to the given coverage criterion. After that, a list of feasible test paths are discovered by traversing the control flow graph using backtracking algorithm, symbolic execution, and Z3 solver. We also generate test cases for functions containing one loop or two-nested loop. A tool supporting the proposed method has been developed and applied to test on some C functions. The experimental results show the high coverage with the minimum number of test cases, the ability to improve the total time of the test case generation with a specified coverage criterion, and the increasing precision of checking the feasibility of test paths if comparing with the random technique. The experimental results display the potential usefulness of this tool for automated test case generation in practice.","PeriodicalId":347057,"journal":{"name":"2016 3rd National Foundation for Science and Technology Development Conference on Information and Computer Science (NICS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131137198","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 : 2016-09-01DOI: 10.1109/NICS.2016.7725656
Kisman, S. M. Isa
Software development time is a critical issue in software development process, hibernate has been widely used to increase development speed. It is used in database manipulation layer. This research develops a library to simplify hibernate criteria. The library that is called as Hibernate Criteria Extension (HCE) provides API functions to simplify code and easily to be used. Query associations can be defined by using dot. The library will automatically detect the join association(s) based on mapping in entity class. It can also be used in restriction and order. HCE is a hibernate wrapper library. The configuration is based on hibernate configuration. This library can be easily used by the developers whom familiar with hibernate usage.
{"title":"Hibernate ORM query simplication using hibernate criteria extension (HCE)","authors":"Kisman, S. M. Isa","doi":"10.1109/NICS.2016.7725656","DOIUrl":"https://doi.org/10.1109/NICS.2016.7725656","url":null,"abstract":"Software development time is a critical issue in software development process, hibernate has been widely used to increase development speed. It is used in database manipulation layer. This research develops a library to simplify hibernate criteria. The library that is called as Hibernate Criteria Extension (HCE) provides API functions to simplify code and easily to be used. Query associations can be defined by using dot. The library will automatically detect the join association(s) based on mapping in entity class. It can also be used in restriction and order. HCE is a hibernate wrapper library. The configuration is based on hibernate configuration. This library can be easily used by the developers whom familiar with hibernate usage.","PeriodicalId":347057,"journal":{"name":"2016 3rd National Foundation for Science and Technology Development Conference on Information and Computer Science (NICS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127621573","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 : 2016-09-01DOI: 10.1109/NICS.2016.7725638
P. Nguyen, Tien Do, Anh-Thu Nguyen-Thi, T. Ngo, Duy-Dinh Le, T. Nguyen
Convolutional Neural Networks (CNNs) have been established as a powerful class of models for image recognition problems giving state-of-the-art results on recognition, detection, segmentation, classification and retrieval. Encouraged by these results, we develop our previous work [14] by implementing deep neural network architecture for extracting and representing visual features to improve the clustering quality of web video search results. Experiments were conducted on a dataset published in [14]. This dataset includes 1580 videos from 18 queries issued to the YouTube search engine. Our method exhibits significant performance improvements over the previously published result evaluated by Entropy measure (23.27% vs. 39.46%) and Purity measure (77.09% vs. 61.50%).
卷积神经网络(cnn)已经被建立为一类强大的图像识别问题模型，在识别、检测、分割、分类和检索方面提供了最先进的结果。受这些结果的鼓舞，我们通过实现用于提取和表示视觉特征的深度神经网络架构来改进web视频搜索结果的聚类质量，从而发展了我们之前的工作[14]。实验是在[14]发表的数据集上进行的。该数据集包括来自YouTube搜索引擎的18个查询的1580个视频。与先前发表的熵测度(23.27% vs. 39.46%)和纯度测度(77.09% vs. 61.50%)评价结果相比，我们的方法表现出显著的性能改进。
{"title":"Clustering web video search results with convolutional neural networks","authors":"P. Nguyen, Tien Do, Anh-Thu Nguyen-Thi, T. Ngo, Duy-Dinh Le, T. Nguyen","doi":"10.1109/NICS.2016.7725638","DOIUrl":"https://doi.org/10.1109/NICS.2016.7725638","url":null,"abstract":"Convolutional Neural Networks (CNNs) have been established as a powerful class of models for image recognition problems giving state-of-the-art results on recognition, detection, segmentation, classification and retrieval. Encouraged by these results, we develop our previous work [14] by implementing deep neural network architecture for extracting and representing visual features to improve the clustering quality of web video search results. Experiments were conducted on a dataset published in [14]. This dataset includes 1580 videos from 18 queries issued to the YouTube search engine. Our method exhibits significant performance improvements over the previously published result evaluated by Entropy measure (23.27% vs. 39.46%) and Purity measure (77.09% vs. 61.50%).","PeriodicalId":347057,"journal":{"name":"2016 3rd National Foundation for Science and Technology Development Conference on Information and Computer Science (NICS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121242177","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 : 2016-09-01DOI: 10.1109/NICS.2016.7725655
Nga Ly-Tu, T. Le-Tien, Linh Mai
In this paper, we focus on the target tracking in wireless sensor network based on Received Signal Strength (RSS). The tracking via particle filter technique is enhanced by improving the effect of the RSS variations. We propose a modified Particle Filter (PF) that finding the optimal bound error for Kullback-Leibler Distance (KLD)-resampling algorithm to ameliorate the effect of the RSS variations by generating a sample set near the high-likelihood region. The key problem of this method is to determine bound error values for the resample-based approximation to minimize both the Root Mean Square Error (RMSE) and the number of particles used. By combining the new finding bound error with KLD-resampling, our experiments show that the new technique not only enhances the estimation accuracy but also improves the efficient number of particles compared with the traditional methods.
{"title":"A modified particle filter through Kullback-Leibler distance based on received signal strength","authors":"Nga Ly-Tu, T. Le-Tien, Linh Mai","doi":"10.1109/NICS.2016.7725655","DOIUrl":"https://doi.org/10.1109/NICS.2016.7725655","url":null,"abstract":"In this paper, we focus on the target tracking in wireless sensor network based on Received Signal Strength (RSS). The tracking via particle filter technique is enhanced by improving the effect of the RSS variations. We propose a modified Particle Filter (PF) that finding the optimal bound error for Kullback-Leibler Distance (KLD)-resampling algorithm to ameliorate the effect of the RSS variations by generating a sample set near the high-likelihood region. The key problem of this method is to determine bound error values for the resample-based approximation to minimize both the Root Mean Square Error (RMSE) and the number of particles used. By combining the new finding bound error with KLD-resampling, our experiments show that the new technique not only enhances the estimation accuracy but also improves the efficient number of particles compared with the traditional methods.","PeriodicalId":347057,"journal":{"name":"2016 3rd National Foundation for Science and Technology Development Conference on Information and Computer Science (NICS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116927415","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 : 2016-09-01DOI: 10.1109/NICS.2016.7725639
Phan Cam Thao, D. L. Khoa, N. Tu, Le Huu Phuc, N. H. Phuong
Optical Wireless Communication (OWC) is superior to radio wireless communication in several technical applications. In order to study the characteristics of Optical Multiple Input Multiple Output (OMIMO) channels, first, this paper presents the simulation of the optical wireless channel to analyze effects of dispersion multipath. We use ray tracing method to calculate the impulse response as well as the frequency response of the channel limit the reflections within seconds. Afterwards, we firstly investigate the OMIMO DCO-OFDM using Space Time Block Code (STBC) of Alamouti in diffuse fading channels to analyze the bit error rate (BER) of the system. The simulation results of the channel, as well as the communication system, are calculated and evaluated specifically.
{"title":"Optical MIMO DCO-OFDM wireless communication systems using STBC in diffuse fading channels","authors":"Phan Cam Thao, D. L. Khoa, N. Tu, Le Huu Phuc, N. H. Phuong","doi":"10.1109/NICS.2016.7725639","DOIUrl":"https://doi.org/10.1109/NICS.2016.7725639","url":null,"abstract":"Optical Wireless Communication (OWC) is superior to radio wireless communication in several technical applications. In order to study the characteristics of Optical Multiple Input Multiple Output (OMIMO) channels, first, this paper presents the simulation of the optical wireless channel to analyze effects of dispersion multipath. We use ray tracing method to calculate the impulse response as well as the frequency response of the channel limit the reflections within seconds. Afterwards, we firstly investigate the OMIMO DCO-OFDM using Space Time Block Code (STBC) of Alamouti in diffuse fading channels to analyze the bit error rate (BER) of the system. The simulation results of the channel, as well as the communication system, are calculated and evaluated specifically.","PeriodicalId":347057,"journal":{"name":"2016 3rd National Foundation for Science and Technology Development Conference on Information and Computer Science (NICS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128864972","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
扫码关注我们
求助内容：
应助结果提醒方式：