Pub Date : 1900-01-01DOI: 10.1109/ICACT.2016.7423567
T. Jo
This research is concerned with the table based KNN as the approach to the keyword extraction task. The keyword extraction task is viewed as an instance of word classification, and it is discovered that encoding words into tables improved the word categorization performance. In this research, words are encoded into tables and the correspondingly modified version of KNN is applied to the keyword extraction task. As the benefits from this research, like the case in the general word categorization, we expect the better performance in the keyword extraction, as the special word classification. Therefore, the goal of this research is to provide the better scheme of extracting keywords from each text.
{"title":"Table based KNN for extracting keywords","authors":"T. Jo","doi":"10.1109/ICACT.2016.7423567","DOIUrl":"https://doi.org/10.1109/ICACT.2016.7423567","url":null,"abstract":"This research is concerned with the table based KNN as the approach to the keyword extraction task. The keyword extraction task is viewed as an instance of word classification, and it is discovered that encoding words into tables improved the word categorization performance. In this research, words are encoded into tables and the correspondingly modified version of KNN is applied to the keyword extraction task. As the benefits from this research, like the case in the general word categorization, we expect the better performance in the keyword extraction, as the special word classification. Therefore, the goal of this research is to provide the better scheme of extracting keywords from each text.","PeriodicalId":125854,"journal":{"name":"2016 18th International Conference on Advanced Communication Technology (ICACT)","volume":"84 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":"127305074","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/ICACT.2016.7423415
Jong-Hun Kim, Jong-Bum You, Ji-Hwan Park, Kyoungsik Yu, HyoDerk Park
We propose nano-photonic phased-array antennas suitable for wide-angle beam-steering. Two types of the antennas are designed based on the grating structure and the plasmonic metal thin film, and their radiation performances are simulated using a finite-difference-time-domain simulator. From both antenna arrays with narrow array pitches near the wavelength scale, we show a possibility of wide beam-steering over 90° in the lateral direction.
{"title":"Design of nano-photonic phased-array antennas for wide-angle beam-steering","authors":"Jong-Hun Kim, Jong-Bum You, Ji-Hwan Park, Kyoungsik Yu, HyoDerk Park","doi":"10.1109/ICACT.2016.7423415","DOIUrl":"https://doi.org/10.1109/ICACT.2016.7423415","url":null,"abstract":"We propose nano-photonic phased-array antennas suitable for wide-angle beam-steering. Two types of the antennas are designed based on the grating structure and the plasmonic metal thin film, and their radiation performances are simulated using a finite-difference-time-domain simulator. From both antenna arrays with narrow array pitches near the wavelength scale, we show a possibility of wide beam-steering over 90° in the lateral direction.","PeriodicalId":125854,"journal":{"name":"2016 18th International Conference on Advanced Communication Technology (ICACT)","volume":"1 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":"116542194","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/ICACT.2016.7423370
Guang Zhu, Xiangyang Luo, Fenlin Liu, Fan Zhao
For the existing network entity geolocation algorithms based on the delay measurement are usually suffer from the inflation and jitter of the network delay, a new algorithm of city-level geolocation based on landmark clustering is proposed in this paper. According to the feature of the delays tend to be similar among the neighboring network entities generally, city-level network entities geolocation algorithm based on landmark clustering is given. In the proposed algorithm, the city-level landmarks are divided into several clusters based on the "delay similarity" principle to filters out the high-reliability landmarks for improving the precision of city-level geolocation algorithm, the minimal relative delay between cluster and target is calculated based on the minimal relative delay, and the region of this cluster is taken as the estimation of target's location. The rationality of the delay clustering, feasibility of the proposed algorithm, and experimental results show that the proposed algorithm reduces effectively the delay influence on the IP geolocation algorithms, and the geolocation accuracy is higher than the classic GeoPing algorithm.
{"title":"City-level geolocation algorithm of network entities based on landmark clustering","authors":"Guang Zhu, Xiangyang Luo, Fenlin Liu, Fan Zhao","doi":"10.1109/ICACT.2016.7423370","DOIUrl":"https://doi.org/10.1109/ICACT.2016.7423370","url":null,"abstract":"For the existing network entity geolocation algorithms based on the delay measurement are usually suffer from the inflation and jitter of the network delay, a new algorithm of city-level geolocation based on landmark clustering is proposed in this paper. According to the feature of the delays tend to be similar among the neighboring network entities generally, city-level network entities geolocation algorithm based on landmark clustering is given. In the proposed algorithm, the city-level landmarks are divided into several clusters based on the \"delay similarity\" principle to filters out the high-reliability landmarks for improving the precision of city-level geolocation algorithm, the minimal relative delay between cluster and target is calculated based on the minimal relative delay, and the region of this cluster is taken as the estimation of target's location. The rationality of the delay clustering, feasibility of the proposed algorithm, and experimental results show that the proposed algorithm reduces effectively the delay influence on the IP geolocation algorithms, and the geolocation accuracy is higher than the classic GeoPing algorithm.","PeriodicalId":125854,"journal":{"name":"2016 18th International Conference on Advanced Communication Technology (ICACT)","volume":"1 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":"129437349","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/ICACT.2016.7423437
Liu Changtong
Hadoop is an open source distributed computing platform, and HDFS is Hadoop distributed file system. The HDFS has a powerful data storage capacity. Therefore, it is suitable for cloud storage system. However, HDFS was originally developed for the streaming access on large software, it has low storage efficiency for massive small files. To solve this problem, the HDFS file storage process is improved. The files are judged before uploading to HDFS clusters. If the file is a small file, it is merged and the index information of the small file is stored in the index file with the form of key-value pairs. The simulation shows that the improved HDFS has lower NameNode memory consumption than original HDFS and Hadoop Archives (HAR files). Thus, it can improve the access efficiency.
{"title":"An improved HDFS for small file","authors":"Liu Changtong","doi":"10.1109/ICACT.2016.7423437","DOIUrl":"https://doi.org/10.1109/ICACT.2016.7423437","url":null,"abstract":"Hadoop is an open source distributed computing platform, and HDFS is Hadoop distributed file system. The HDFS has a powerful data storage capacity. Therefore, it is suitable for cloud storage system. However, HDFS was originally developed for the streaming access on large software, it has low storage efficiency for massive small files. To solve this problem, the HDFS file storage process is improved. The files are judged before uploading to HDFS clusters. If the file is a small file, it is merged and the index information of the small file is stored in the index file with the form of key-value pairs. The simulation shows that the improved HDFS has lower NameNode memory consumption than original HDFS and Hadoop Archives (HAR files). Thus, it can improve the access efficiency.","PeriodicalId":125854,"journal":{"name":"2016 18th International Conference on Advanced Communication Technology (ICACT)","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":"126800848","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/ICACT.2016.7423439
Chuanqi Kan
Internet is growing at an alarming rate, and Web applications have permeated every aspect of people's life. Cloud computing provides a powerful computing model that allows users to access resources on-demand and pay as they use. Cloud computing attracts an increasing number of developers to migrate their Web applications to cloud platforms. Cloud platforms should provide elasticity ability to change the amount of resources allocated to a Web application in order to meet the actual varying demands because of the changing workload. In this paper, we design and implement DoCloud which is an elastic cloud platform based on Docker. In DoCloud, we adopt adding or removing Docker containers to change a Web application's resource and we build a hybrid elasticity controller that incorporates proactive model and reactive model for scale out coupled with proactive model for scale in. Our experiments show that DoCloud can dynamically allocate resources to applications within seconds and maintain higher resource utilization in a single container.
{"title":"DoCloud: An elastic cloud platform for Web applications based on Docker","authors":"Chuanqi Kan","doi":"10.1109/ICACT.2016.7423439","DOIUrl":"https://doi.org/10.1109/ICACT.2016.7423439","url":null,"abstract":"Internet is growing at an alarming rate, and Web applications have permeated every aspect of people's life. Cloud computing provides a powerful computing model that allows users to access resources on-demand and pay as they use. Cloud computing attracts an increasing number of developers to migrate their Web applications to cloud platforms. Cloud platforms should provide elasticity ability to change the amount of resources allocated to a Web application in order to meet the actual varying demands because of the changing workload. In this paper, we design and implement DoCloud which is an elastic cloud platform based on Docker. In DoCloud, we adopt adding or removing Docker containers to change a Web application's resource and we build a hybrid elasticity controller that incorporates proactive model and reactive model for scale out coupled with proactive model for scale in. Our experiments show that DoCloud can dynamically allocate resources to applications within seconds and maintain higher resource utilization in a single container.","PeriodicalId":125854,"journal":{"name":"2016 18th International Conference on Advanced Communication Technology (ICACT)","volume":"151 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":"121539400","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/ICACT.2016.7423272
Jian Shen, Dengzhi Liu, Qi Liu, Baowei Wang, Zhangjie Fu
Cloud computing is a newfound service which has a rapid growth in IT industry recent years. Despite it has a huge contribution to the development of the technology and society, the cloud still exists some security deficiencies to block its development such as data leakage, illegal access and privacy risks. Hence, access control and user authentication is very important in cloud environment. Some related access control schemes has been proposed to solve the security problems in cloud, however, the high computation cost is a crucial factor in practical use. In this paper we propose a novel lightweight identity authentication-based access control scheme for cloud, due to adopt an authorized agency to assist the authentication and key distribution, this scheme is more efficient and practical than the related work.
{"title":"An authorized identity authentication-based data access control scheme in cloud","authors":"Jian Shen, Dengzhi Liu, Qi Liu, Baowei Wang, Zhangjie Fu","doi":"10.1109/ICACT.2016.7423272","DOIUrl":"https://doi.org/10.1109/ICACT.2016.7423272","url":null,"abstract":"Cloud computing is a newfound service which has a rapid growth in IT industry recent years. Despite it has a huge contribution to the development of the technology and society, the cloud still exists some security deficiencies to block its development such as data leakage, illegal access and privacy risks. Hence, access control and user authentication is very important in cloud environment. Some related access control schemes has been proposed to solve the security problems in cloud, however, the high computation cost is a crucial factor in practical use. In this paper we propose a novel lightweight identity authentication-based access control scheme for cloud, due to adopt an authorized agency to assist the authentication and key distribution, this scheme is more efficient and practical than the related work.","PeriodicalId":125854,"journal":{"name":"2016 18th International Conference on Advanced Communication Technology (ICACT)","volume":"98 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":"124092575","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/ICACT.2016.7423542
Wei-Han Hsiao, Chia-Chi Huang
Mobile communications toward the fifth generation (5G) have been popularly discussed and investigated worldwide in academia and industry. 5G, as an evolution from the previous generations, demands both high system capacity and high data rate. A novel multiple access scheme based on millimeter wave transmission and massive antennas at a base station (BS), named multipath division multiple access (MDMA), is proposed in this paper to be a future 5G possible solution. MDMA is defined here as a method to use massive antennas at BS to achieve a processing gain to suppress multiple access interference (MAI) in cellular mobile radio system. The processing gain is obtained by implementing RAKE receivers at BS. The system concept is also demonstrated by computer simulations. Moreover, it has been shown through simple but crucial analysis that the system capacity and the aggregated data throughput could be boosted up to a considerable level.
{"title":"Multipath division multiple access for 5G cellular system based on massive antennas in millimeter wave band","authors":"Wei-Han Hsiao, Chia-Chi Huang","doi":"10.1109/ICACT.2016.7423542","DOIUrl":"https://doi.org/10.1109/ICACT.2016.7423542","url":null,"abstract":"Mobile communications toward the fifth generation (5G) have been popularly discussed and investigated worldwide in academia and industry. 5G, as an evolution from the previous generations, demands both high system capacity and high data rate. A novel multiple access scheme based on millimeter wave transmission and massive antennas at a base station (BS), named multipath division multiple access (MDMA), is proposed in this paper to be a future 5G possible solution. MDMA is defined here as a method to use massive antennas at BS to achieve a processing gain to suppress multiple access interference (MAI) in cellular mobile radio system. The processing gain is obtained by implementing RAKE receivers at BS. The system concept is also demonstrated by computer simulations. Moreover, it has been shown through simple but crucial analysis that the system capacity and the aggregated data throughput could be boosted up to a considerable level.","PeriodicalId":125854,"journal":{"name":"2016 18th International Conference on Advanced Communication Technology (ICACT)","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":"125983155","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/ICACT.2016.7423431
Varvara Mikhailova, A. Mochalova, V. Mochalov, V. Zakharov
This paper describes performance of an interpreter uncovering meanings of prepositions in "master" - preposition - "slave" constructions. The basis of the semantic interpreter is a set of "if A, than B" rules, with the left parts containing lexical and semantic markers of the "masters" and the "slaves" and morphological markers of the "slaves" (cases) and the right parts containing the meanings of the prepositions which should be attributed if the conditions of the left parts are fulfilled. It is described how, on the basis of the interpreter, the basic onto-sematic rules can be formalized to be implemented into an onto-sematic analyzer and how performance of the analyzer can be improved with implementation of new rules.
{"title":"Uncovering semantic relations conveyed by Russian prepositions","authors":"Varvara Mikhailova, A. Mochalova, V. Mochalov, V. Zakharov","doi":"10.1109/ICACT.2016.7423431","DOIUrl":"https://doi.org/10.1109/ICACT.2016.7423431","url":null,"abstract":"This paper describes performance of an interpreter uncovering meanings of prepositions in \"master\" - preposition - \"slave\" constructions. The basis of the semantic interpreter is a set of \"if A, than B\" rules, with the left parts containing lexical and semantic markers of the \"masters\" and the \"slaves\" and morphological markers of the \"slaves\" (cases) and the right parts containing the meanings of the prepositions which should be attributed if the conditions of the left parts are fulfilled. It is described how, on the basis of the interpreter, the basic onto-sematic rules can be formalized to be implemented into an onto-sematic analyzer and how performance of the analyzer can be improved with implementation of new rules.","PeriodicalId":125854,"journal":{"name":"2016 18th International Conference on Advanced Communication Technology (ICACT)","volume":"38 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":"131925093","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/ICACT.2016.7423504
Won-Jeong Choi, Ramneek, Woojin Seok
Content Centric Networking(CCN) is using similar principle such as that of ICN, CDN, NDN which are the next generation of the Internet. Forwarding control is one of the important mechanism for the performance in content centric networking. When there is congestion in the network, the consumer have to adapt the alternative path in order to download the Data packet. If the consumer keeps the current path, the probability of packet loss will increase. For this situation, we will check the performance of time-based forwarding control to increase the consumer's throughput with reduced packet loss.
{"title":"Time-based forwarding control in content centric networking","authors":"Won-Jeong Choi, Ramneek, Woojin Seok","doi":"10.1109/ICACT.2016.7423504","DOIUrl":"https://doi.org/10.1109/ICACT.2016.7423504","url":null,"abstract":"Content Centric Networking(CCN) is using similar principle such as that of ICN, CDN, NDN which are the next generation of the Internet. Forwarding control is one of the important mechanism for the performance in content centric networking. When there is congestion in the network, the consumer have to adapt the alternative path in order to download the Data packet. If the consumer keeps the current path, the probability of packet loss will increase. For this situation, we will check the performance of time-based forwarding control to increase the consumer's throughput with reduced packet loss.","PeriodicalId":125854,"journal":{"name":"2016 18th International Conference on Advanced Communication Technology (ICACT)","volume":"62 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":"134046864","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/ICACT.2016.7423574
Jin Ma, Jong-Suk Ruth Lee, Kumwon Cho, Minjae Park
Nowadays, the importance of big data processing has been mentioned. So, we propose a data analysis system for big data processing. The proposed system is considered the processing of GPDB and HDFS, and also supports the processing of files, and a relational database. This paper describes a conceptual analysis of the big data processing system, and provides the processed data and display the results.
{"title":"A design for big data analysis system","authors":"Jin Ma, Jong-Suk Ruth Lee, Kumwon Cho, Minjae Park","doi":"10.1109/ICACT.2016.7423574","DOIUrl":"https://doi.org/10.1109/ICACT.2016.7423574","url":null,"abstract":"Nowadays, the importance of big data processing has been mentioned. So, we propose a data analysis system for big data processing. The proposed system is considered the processing of GPDB and HDFS, and also supports the processing of files, and a relational database. This paper describes a conceptual analysis of the big data processing system, and provides the processed data and display the results.","PeriodicalId":125854,"journal":{"name":"2016 18th International Conference on Advanced Communication Technology (ICACT)","volume":"13 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":"133776418","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
扫码关注我们
求助内容：
应助结果提醒方式：