Pub Date : 2020-05-18DOI: 10.4108/eai.18-5-2020.164585
Hue Nam K. Nguyen, N. Tran, B. Vu, B. Q. Ho
In the recent years, air pollution has become a severe problem not only for Vietnam, but also for other countries. Ho Chi Minh City (HCMC) is the largest city in Vietnam where many air pollutants exceeded the Vietnam national technical regulation in ambient air quality including PM2.5, NOx, Ozone and CO. These high pollutant concentrations have destroyed human health of people in Ho Chi Minh City. This research is aimed to (i) analyse and assess the change in spatiotemporal of the air polluted substances in Ho Chi Minh City; (ii) study the impact of weather patern to air pollutants dispersion over Ho Chi Minh City. The description statistical method is applied to evaluate the air quality in every monitoring location during the period 2005 to 2016, and the Inverse Distance Weighting (IDW) spatial interpolation from Geographical Information Systems (GIS) was applied to create a map of polluted substances in air quality, especially Total Suspended Particles (TSP), Nitrogen oxides (NOx), Lead (Pb) and Carbon monoxide (CO), of the change in concentration of the polluted substances for every pixel in all researched locations. IDW method was validated by comparing between air quality monitoring and IDW spatial interpolation method. The results shown that IDW method is qualify for this study with R2 = 0.93 and d = 0.74 at Dinh Tien Hoang – Dien Bien Phu, An Suong and Go Vap monitoring locations. The IDW interpolation method was also good result for NOx with R2 = 0.96 and d = 0.75 at the Hang Xanh, An Suong, and Huynh Tan Phat monitoring locations. The results shown that the highest CO concentration is in Go Vap district, with the average is 14.849 mg/m3, TSP is highest in An Suong area with the average is 0.687mg/m3. NOx is highest in Dien Bien Phu wih 0.199 mg/m3. The spatial of air quality shown that the spread continues towards the north, northwest, and northeast direction of Ho Chi Minh City because the main air emission sources are in the center of HCMC and the main wind direction is south, southeast and northeast. The wind direction blows air pollutants from center of city toward to the north, northwest, and northeast of Ho Chi Minh City. The results of study also shown that the relations between policy and air pollution level. Policy interventions on air quality management will have a major impact on reducing air pollution for HCMC, such as policies that tighten vehicle exhaust emissions (from EURO II standard to EURO VI standard) and policy on cleaner fuel.
近年来，空气污染不仅对越南，而且对其他国家都是一个严重的问题。胡志明市(HCMC)是越南最大的城市，许多空气污染物超过了越南国家环境空气质量技术法规，包括PM2.5, NOx，臭氧和CO。这些高污染物浓度已经破坏了胡志明市人民的健康。本研究旨在(1)分析和评估胡志明市空气污染物质的时空变化;(ii)研究天气型态对胡志明市空气污染物扩散的影响。利用描述统计方法对2005 - 2016年各监测点的空气质量进行评价，并利用地理信息系统(GIS)的逆距离加权(IDW)空间插值方法绘制空气质量污染物质分布图，重点分析了总悬浮粒子(TSP)、氮氧化物(NOx)、铅(Pb)和一氧化碳(CO)等污染物质。在所有研究地点的每个像素的污染物质的浓度变化。通过对比空气质量监测和IDW空间插值方法，验证了IDW方法的有效性。结果表明，IDW法在丁天黄县-奠边府县、安淞县和高Vap监测点的R2 = 0.93, d = 0.74，适用于本研究。在Hang Xanh、An Suong和Huynh Tan Phat监测点，IDW插值法对NOx的测量结果也很好，R2 = 0.96, d = 0.75。结果表明:Go Vap地区CO浓度最高，平均值为14.849 mg/m3;安淞地区TSP最高，平均值为0.687mg/m3;奠边府的氮氧化物含量最高，为0.199 mg/m3。空气质量的空间分布表明，由于主要空气排放源位于胡志明市中心，主要风向为南、东南和东北，胡志明市空气质量继续向北、西北和东北方向扩散。风向将空气污染物从市中心吹向胡志明市的北部、西北部和东北部。研究结果还表明了政策与空气污染水平之间的关系。空气质素管理方面的政策干预措施，如收紧车辆废气排放(由欧盟II标准降至欧盟VI标准)及使用更清洁燃料的政策，将会对减少胡志明市的空气污染产生重大影响。
{"title":"Spatiotemporal Variability of Air Quality Time Series for developing countries: Case of Ho Chi Minh city, Vietnam","authors":"Hue Nam K. Nguyen, N. Tran, B. Vu, B. Q. Ho","doi":"10.4108/eai.18-5-2020.164585","DOIUrl":"https://doi.org/10.4108/eai.18-5-2020.164585","url":null,"abstract":"In the recent years, air pollution has become a severe problem not only for Vietnam, but also for other countries. Ho Chi Minh City (HCMC) is the largest city in Vietnam where many air pollutants exceeded the Vietnam national technical regulation in ambient air quality including PM2.5, NOx, Ozone and CO. These high pollutant concentrations have destroyed human health of people in Ho Chi Minh City. This research is aimed to (i) analyse and assess the change in spatiotemporal of the air polluted substances in Ho Chi Minh City; (ii) study the impact of weather patern to air pollutants dispersion over Ho Chi Minh City. The description statistical method is applied to evaluate the air quality in every monitoring location during the period 2005 to 2016, and the Inverse Distance Weighting (IDW) spatial interpolation from Geographical Information Systems (GIS) was applied to create a map of polluted substances in air quality, especially Total Suspended Particles (TSP), Nitrogen oxides (NOx), Lead (Pb) and Carbon monoxide (CO), of the change in concentration of the polluted substances for every pixel in all researched locations. IDW method was validated by comparing between air quality monitoring and IDW spatial interpolation method. The results shown that IDW method is qualify for this study with R2 = 0.93 and d = 0.74 at Dinh Tien Hoang – Dien Bien Phu, An Suong and Go Vap monitoring locations. The IDW interpolation method was also good result for NOx with R2 = 0.96 and d = 0.75 at the Hang Xanh, An Suong, and Huynh Tan Phat monitoring locations. The results shown that the highest CO concentration is in Go Vap district, with the average is 14.849 mg/m3, TSP is highest in An Suong area with the average is 0.687mg/m3. NOx is highest in Dien Bien Phu wih 0.199 mg/m3. The spatial of air quality shown that the spread continues towards the north, northwest, and northeast direction of Ho Chi Minh City because the main air emission sources are in the center of HCMC and the main wind direction is south, southeast and northeast. The wind direction blows air pollutants from center of city toward to the north, northwest, and northeast of Ho Chi Minh City. The results of study also shown that the relations between policy and air pollution level. Policy interventions on air quality management will have a major impact on reducing air pollution for HCMC, such as policies that tighten vehicle exhaust emissions (from EURO II standard to EURO VI standard) and policy on cleaner fuel.","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":"18 1","pages":"e4"},"PeriodicalIF":0.0,"publicationDate":"2020-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81764361","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 : 2020-04-17DOI: 10.4108/eai.13-7-2018.163988
A. Samad, Mamoona Qadir, Ishrat Nawaz, Muhammad Arshad Islam, Muhammad Aleem
A growing trend of using social networking sites is attracting researchers to study and analyze different aspects of social network. Besides many problems, link prediction is a fascinating problem in the field of social network analysis (SNA). Link prediction, in social network analysis, is a task of identifying the missing links and predicting the new links. Several researchers have proposed solutions for the link prediction problem during the past two decades. However, there is a need to provide comprehensive overview of the significant contributions for a thorough analysis. The objective of this review is to summaries and discuss the existing link prediction algorithms in a common context for an unbiased analysis. The extensive review is presented by constructing the systematical category for proposed algorithms, selected problems, evaluation measures along with selected network datasets. Finally, applications of link prediction are discussed.
{"title":"A Comprehensive Survey of Link Prediction Techniques for Social Network","authors":"A. Samad, Mamoona Qadir, Ishrat Nawaz, Muhammad Arshad Islam, Muhammad Aleem","doi":"10.4108/eai.13-7-2018.163988","DOIUrl":"https://doi.org/10.4108/eai.13-7-2018.163988","url":null,"abstract":"A growing trend of using social networking sites is attracting researchers to study and analyze different aspects of social network. Besides many problems, link prediction is a fascinating problem in the field of social network analysis (SNA). Link prediction, in social network analysis, is a task of identifying the missing links and predicting the new links. Several researchers have proposed solutions for the link prediction problem during the past two decades. However, there is a need to provide comprehensive overview of the significant contributions for a thorough analysis. The objective of this review is to summaries and discuss the existing link prediction algorithms in a common context for an unbiased analysis. The extensive review is presented by constructing the systematical category for proposed algorithms, selected problems, evaluation measures along with selected network datasets. Finally, applications of link prediction are discussed.","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":"52 1","pages":"e3"},"PeriodicalIF":0.0,"publicationDate":"2020-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85080404","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 : 2020-04-16DOI: 10.4108/eai.13-7-2018.163985
A. Samad, Mamoona Qadir, Ishrat Nawaz, Muhammad Arshad Islam, Muhammad Aleem
Majority of researcher are attracted by the social network analysis due to the rush of people towards social network. Along with many problems, social network analysis is facing an interesting problem that is ranking of users in social network which is gaining more attention due to the increasing number of social users. Measuring centrality of nodes in a social graph, have been important issue in social network analysis. Lot of centrality methods have been proposed in this regard. In this paper, hop based centrality measures called SAM is purposed. To investigate the measure, we applied on various dataset. In comparisons, on all these social graphs, we obtain better results than other centrality measures (i.e., Degree, PageRank, Betweeness and Closeness) using SIR model. Received on 08 January 2020; accepted on 08 April 2020; published on 16 April 2020
{"title":"SAM Centrality: a Hop-Based Centrality Measure for Ranking Users in Social Network","authors":"A. Samad, Mamoona Qadir, Ishrat Nawaz, Muhammad Arshad Islam, Muhammad Aleem","doi":"10.4108/eai.13-7-2018.163985","DOIUrl":"https://doi.org/10.4108/eai.13-7-2018.163985","url":null,"abstract":"Majority of researcher are attracted by the social network analysis due to the rush of people towards social network. Along with many problems, social network analysis is facing an interesting problem that is ranking of users in social network which is gaining more attention due to the increasing number of social users. Measuring centrality of nodes in a social graph, have been important issue in social network analysis. Lot of centrality methods have been proposed in this regard. In this paper, hop based centrality measures called SAM is purposed. To investigate the measure, we applied on various dataset. In comparisons, on all these social graphs, we obtain better results than other centrality measures (i.e., Degree, PageRank, Betweeness and Closeness) using SIR model. Received on 08 January 2020; accepted on 08 April 2020; published on 16 April 2020","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":"38 1","pages":"e2"},"PeriodicalIF":0.0,"publicationDate":"2020-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83004375","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 : 2020-01-31DOI: 10.4108/eai.31-1-2020.162831
Anh M. Le, L. Truong, Toan V. Quyen, Cuong V. Nguyen, M. Nguyen
Wireless power transfer (WPT) techniques are being popular currently with the development of midrange wireless powering and charging technology to gradually substitute the need for wired devices during charging. Unmanned Aerial Vehicles (UAVs) are also being used with many practical purposes for agriculture, surveillance, and healthcare, etc. There is a trade-off between the weight of the UAVs or their batteries and their flying time. In order to support those UAVs perform better in their tasks, WPT is applied in UAVs to recharge batteries which help to increase their working time. This paper highlights up-to-date studies that are specific to near-field WPT deploying into UAVs. The charging distances, the transfer efficiency, and transfer power, etc. are considered to provide an overview of all common problems in using and charging UAVs, especially for autonomous landing and charging. By classification and suggestions in specific problems will be provided opportunities and challenges with respect to apply near-field WPT techniques for charging the battery of UAVs and other applications in the real world. Received on 29 November 2019; accepted on 18 January 2020; published on 31 January 2020
{"title":"Wireless Power Transfer Near-field Technologies for Unmanned Aerial Vehicles (UAVs): A Review","authors":"Anh M. Le, L. Truong, Toan V. Quyen, Cuong V. Nguyen, M. Nguyen","doi":"10.4108/eai.31-1-2020.162831","DOIUrl":"https://doi.org/10.4108/eai.31-1-2020.162831","url":null,"abstract":"Wireless power transfer (WPT) techniques are being popular currently with the development of midrange wireless powering and charging technology to gradually substitute the need for wired devices during charging. Unmanned Aerial Vehicles (UAVs) are also being used with many practical purposes for agriculture, surveillance, and healthcare, etc. There is a trade-off between the weight of the UAVs or their batteries and their flying time. In order to support those UAVs perform better in their tasks, WPT is applied in UAVs to recharge batteries which help to increase their working time. This paper highlights up-to-date studies that are specific to near-field WPT deploying into UAVs. The charging distances, the transfer efficiency, and transfer power, etc. are considered to provide an overview of all common problems in using and charging UAVs, especially for autonomous landing and charging. By classification and suggestions in specific problems will be provided opportunities and challenges with respect to apply near-field WPT techniques for charging the battery of UAVs and other applications in the real world. Received on 29 November 2019; accepted on 18 January 2020; published on 31 January 2020","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":"7 1","pages":"e5"},"PeriodicalIF":0.0,"publicationDate":"2020-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78455705","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 : 2020-01-31DOI: 10.4108/eai.24-10-2019.161367
Maciej Pietowski, Quoc-Tuan Vien, T. K. Phan
This paper undertakes the challenge of server selection problem in Erlang-loss system (ELS). We propose a novel approach to the server selection problem in the ELS taking into account probabilistic modelling to reflect a practical scenario when user arrivals vary over time. The proposed framework is divided into three stages, including i) developing a new method for server selection based on the M/M/n/n queuing model with probabilistic arrivals; ii) combining server allocation results with further research on utility-maximising server selection to optimise system performance; and iii) designing a heuristic approach to efficiently solve the developed optimisation problem. Simulation results show that by using this framework, Internet Service Providers (ISPs) can significantly improve QoS for better revenue with optimal server allocation in their data centre networks.
{"title":"Optimisation of Server Selection for Maximising Utility in Erlang-Loss Systems","authors":"Maciej Pietowski, Quoc-Tuan Vien, T. K. Phan","doi":"10.4108/eai.24-10-2019.161367","DOIUrl":"https://doi.org/10.4108/eai.24-10-2019.161367","url":null,"abstract":"This paper undertakes the challenge of server selection problem in Erlang-loss system (ELS). We propose a novel approach to the server selection problem in the ELS taking into account probabilistic modelling to reflect a practical scenario when user arrivals vary over time. The proposed framework is divided into three stages, including i) developing a new method for server selection based on the M/M/n/n queuing model with probabilistic arrivals; ii) combining server allocation results with further research on utility-maximising server selection to optimise system performance; and iii) designing a heuristic approach to efficiently solve the developed optimisation problem. Simulation results show that by using this framework, Internet Service Providers (ISPs) can significantly improve QoS for better revenue with optimal server allocation in their data centre networks.","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":"31 7 1","pages":"e1"},"PeriodicalIF":0.0,"publicationDate":"2020-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79682041","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 : 2020-01-31DOI: 10.4108/eai.31-1-2020.162830
Md Hasan Rahman, M. Ranjbar, N. Tran
This paper addresses the optimal signaling scheme and capacity of an additive Gaussian mixture (GM) noise channel using 1-bit analog-to-digital converters (ADCs). The consideration of GM noise provides a more realistic baseline for the analysis and design of co-channel interference links and networks. Towards that goal, we first show that the capacityachieving input signal is π/2 circularly symmetric. By examining a necessary and sufficient Kuhn–Tucker condition (KTC) for an input to be optimal, we demonstrate that the maximum number of optimal mass points is four. Our proof relies on Dubin’s theorem and the fact that the KTC coefficient is positive, i.e., the power constraint is active. By combining with the π/2 circularly symmetric property, it is then concluded the optimal input is unique, and it has exactly four mass points forming a square centered at the origin. By further checking the first and second derivatives of the modified KTC, it is then shown that the phase of the optimal mass point located in the first quadrant is π/4. Thus, the capacity-achieving input signal is QPSK. This result helps us obtain the channel capacity in closed-form.
{"title":"On the Capacity-Achieving Scheme and Capacity of 1-Bit ADC Gaussian-Mixture Channels","authors":"Md Hasan Rahman, M. Ranjbar, N. Tran","doi":"10.4108/eai.31-1-2020.162830","DOIUrl":"https://doi.org/10.4108/eai.31-1-2020.162830","url":null,"abstract":"This paper addresses the optimal signaling scheme and capacity of an additive Gaussian mixture (GM) noise channel using 1-bit analog-to-digital converters (ADCs). The consideration of GM noise provides a more realistic baseline for the analysis and design of co-channel interference links and networks. Towards that goal, we first show that the capacityachieving input signal is π/2 circularly symmetric. By examining a necessary and sufficient Kuhn–Tucker condition (KTC) for an input to be optimal, we demonstrate that the maximum number of optimal mass points is four. Our proof relies on Dubin’s theorem and the fact that the KTC coefficient is positive, i.e., the power constraint is active. By combining with the π/2 circularly symmetric property, it is then concluded the optimal input is unique, and it has exactly four mass points forming a square centered at the origin. By further checking the first and second derivatives of the modified KTC, it is then shown that the phase of the optimal mass point located in the first quadrant is π/4. Thus, the capacity-achieving input signal is QPSK. This result helps us obtain the channel capacity in closed-form.","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":"65 1","pages":"e4"},"PeriodicalIF":0.0,"publicationDate":"2020-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77774028","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 : 2020-01-17DOI: 10.4108/EAI.24-10-2019.162795
Xuan-Tu Tran, Ngoc-Sinh Nguyen, Duy-Hieu Bui, Minh-Trien Pham, Hung K. Nguyen, C. Pham
In image compression and video coding, quantization error helps to reduce the amount of information of the high frequency components. However, in temporal prediction the quantization error contributes its value as noise in the total residual information. Therefore, the residual signal of the inter-picture prediction is greater than the expected one and always differs zero value even input video contains only homogeneous frames. In this paper, we reveal negative effects of quantization errors in inter prediction and propose a video encoding scheme which is able to avoid side effects of quantization errors in the stationary parts. We propose to implement a motion detection algorithm as the first stage of video encoding to separate the video into two parts: motion and static. The motion information allows us to force residual data of non-changed part to zero and keep the residual signal of motion regularly. Beside, we design block-based filters which improve motion results and filter those results fit into block encode size well. Fixed residual data of static information permits us to pre-calculate its quantized coefficient and create a bypass encoding path for it. Experimental results with the JPEG compression (MJPEG-DPCM) showed that the proposed method produces lower bitrate than the conventional MJPEG-DPCM at the same quantization parameter and a lower computational complexity. Received on 13 September 2019; accepted on 11 December 2019; published on 17 January 2020
{"title":"Reducing Bitrate and Increasing the Quality of Inter Frame by Avoiding Quantization Errors in Stationary Blocks","authors":"Xuan-Tu Tran, Ngoc-Sinh Nguyen, Duy-Hieu Bui, Minh-Trien Pham, Hung K. Nguyen, C. Pham","doi":"10.4108/EAI.24-10-2019.162795","DOIUrl":"https://doi.org/10.4108/EAI.24-10-2019.162795","url":null,"abstract":"In image compression and video coding, quantization error helps to reduce the amount of information of the high frequency components. However, in temporal prediction the quantization error contributes its value as noise in the total residual information. Therefore, the residual signal of the inter-picture prediction is greater than the expected one and always differs zero value even input video contains only homogeneous frames. In this paper, we reveal negative effects of quantization errors in inter prediction and propose a video encoding scheme which is able to avoid side effects of quantization errors in the stationary parts. We propose to implement a motion detection algorithm as the first stage of video encoding to separate the video into two parts: motion and static. The motion information allows us to force residual data of non-changed part to zero and keep the residual signal of motion regularly. Beside, we design block-based filters which improve motion results and filter those results fit into block encode size well. Fixed residual data of static information permits us to pre-calculate its quantized coefficient and create a bypass encoding path for it. Experimental results with the JPEG compression (MJPEG-DPCM) showed that the proposed method produces lower bitrate than the conventional MJPEG-DPCM at the same quantization parameter and a lower computational complexity. Received on 13 September 2019; accepted on 11 December 2019; published on 17 January 2020","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":"20 1","pages":"e2"},"PeriodicalIF":0.0,"publicationDate":"2020-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83474329","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 : 2020-01-17DOI: 10.4108/eai.13-7-2018.162796
C. Nguyen, T. Dinh, Van-Hau Nguyen, N. Tran, Anh Le
Clustering trajectories from GPS data is a crucial task for developing applications in intelligent transportation systems. Most existing approaches perform clustering on raw data consisting of series of GPS positions of moving objects over time. Such approaches are not suitable for classifying moving behaviours of vehicles, e.g., how to distinguish between a trajectory of a taxi and a trajectory of a private car. In this paper, we focus on the problem of clustering trajectories of vehicles having the same moving behaviours. Our approach is based on histogram-based feature extraction to model moving behaviours of objects and utilizes traditional clustering algorithms to group trajectories. We perform experiments on real datasets and obtain better results than existing approaches.
{"title":"Histogram-based Feature Extraction for GPS Trajectory Clustering","authors":"C. Nguyen, T. Dinh, Van-Hau Nguyen, N. Tran, Anh Le","doi":"10.4108/eai.13-7-2018.162796","DOIUrl":"https://doi.org/10.4108/eai.13-7-2018.162796","url":null,"abstract":"Clustering trajectories from GPS data is a crucial task for developing applications in intelligent transportation systems. Most existing approaches perform clustering on raw data consisting of series of GPS positions of moving objects over time. Such approaches are not suitable for classifying moving behaviours of vehicles, e.g., how to distinguish between a trajectory of a taxi and a trajectory of a private car. In this paper, we focus on the problem of clustering trajectories of vehicles having the same moving behaviours. Our approach is based on histogram-based feature extraction to model moving behaviours of objects and utilizes traditional clustering algorithms to group trajectories. We perform experiments on real datasets and obtain better results than existing approaches.","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":"57 1","pages":"e3"},"PeriodicalIF":0.0,"publicationDate":"2020-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88526898","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 : 2019-10-24DOI: 10.4108/eai.24-10-2019.160983
Van-Thanh Ta, Van‐Phuc Hoang, X. Tran
This paper presents a method for all-digital background calibration of multiple channel mismatches including offset, gain and timing mismatches in time-interleaved analog to digital converters (TIADCs). The averaging technique is used to remove the offset mismatch at each channel. The gain mismatch is calibrated by calculating the power ratio of the subADC over the reference ADC. Timing skew is compensated by using Hadamard transform for error correction and least mean squares (LMS) algorithm for estimation of the clock skew. The performance improvement of TIADCs employing these techniques is demonstrated through numerical simulations.
{"title":"All-Digital Background Calibration Technique for Offset, Gain and Timing Mismatches in Time-Interleaved ADCs","authors":"Van-Thanh Ta, Van‐Phuc Hoang, X. Tran","doi":"10.4108/eai.24-10-2019.160983","DOIUrl":"https://doi.org/10.4108/eai.24-10-2019.160983","url":null,"abstract":"This paper presents a method for all-digital background calibration of multiple channel mismatches including offset, gain and timing mismatches in time-interleaved analog to digital converters (TIADCs). The averaging technique is used to remove the offset mismatch at each channel. The gain mismatch is calibrated by calculating the power ratio of the subADC over the reference ADC. Timing skew is compensated by using Hadamard transform for error correction and least mean squares (LMS) algorithm for estimation of the clock skew. The performance improvement of TIADCs employing these techniques is demonstrated through numerical simulations.","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":"134 1","pages":"e3"},"PeriodicalIF":0.0,"publicationDate":"2019-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86334814","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
扫码关注我们
求助内容：
应助结果提醒方式：