Pub Date : 1900-01-01DOI: 10.1109/ICACT.2016.7423537
Minghui Zhang, Huifang Li, Zhaoqiang Xia
The multi-user quantum signature protocol makes the message can be signed by more than one signatory. In this paper, we put forward an enhanced quantum multi-signature scheme based on Bell states and the controlled quantum teleportation. Compared to the previous multi-signature schemes, our protocol can offer higher security guaranteed by the fundamental laws of physics. While ensuring the nice security of the protocol we also pay attention to keeping its efficiency. Moreover, the scheme is more feasible with the present-day technique.
{"title":"Enhanced quantum multi-signature protocol based on controlled teleportation","authors":"Minghui Zhang, Huifang Li, Zhaoqiang Xia","doi":"10.1109/ICACT.2016.7423537","DOIUrl":"https://doi.org/10.1109/ICACT.2016.7423537","url":null,"abstract":"The multi-user quantum signature protocol makes the message can be signed by more than one signatory. In this paper, we put forward an enhanced quantum multi-signature scheme based on Bell states and the controlled quantum teleportation. Compared to the previous multi-signature schemes, our protocol can offer higher security guaranteed by the fundamental laws of physics. While ensuring the nice security of the protocol we also pay attention to keeping its efficiency. Moreover, the scheme is more feasible with the present-day technique.","PeriodicalId":125854,"journal":{"name":"2016 18th International Conference on Advanced Communication Technology (ICACT)","volume":"41 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":"124541448","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.7423493
Chun Yeow Yeoh, M. Mokhtar, A. Rahman, A. Samingan
The next generation, 5G wireless access, is going to support a wide range of new applications and use cases, with the capabilities including very high achievable data rate, very low latency, ultra-high reliability and the possibility to handle extreme device densities. To avoid the costly deployment, operation and maintenance of future mobile network, Radio Access Network (RAN) virtualization or Cloud RAN is the answer to the problem. The idea is to move the baseband processing to the data center and run the RAN L1, L2 and L3 protocol layers using the commodity hardware, such as high-performance general purpose processors. An open source software-based LTE implementation, such as OpenAirInterface (OAI), is definitely accelerating the RAN cloudization and also realizing the possibility of low cost LTE network deployment in the future. In this paper, we describe the OAI LTE implementation emphasizing on the user plane data flow. We have successfully emulated over-the-air transmission for 1 UE and 1 eNB LTE network supporting both FDD Band 5 and TDD Band 38. We have also performed a thorough profiling of OAI, in terms of execution time, on the user plane data flow. Our results could be served as the reference for future optimization by open source community.
下一代5G无线接入将支持广泛的新应用和用例，其功能包括非常高的可实现数据速率、非常低的延迟、超高的可靠性以及处理极端设备密度的可能性。为了避免未来移动网络高昂的部署、运营和维护成本，无线接入网(RAN)虚拟化或云RAN是解决这一问题的答案。其想法是将基带处理转移到数据中心，并使用商用硬件(如高性能通用处理器)运行RAN L1、L2和L3协议层。基于开源软件的LTE实现，如OpenAirInterface (OAI)，无疑加速了RAN的云化，也实现了未来低成本LTE网络部署的可能性。本文以用户平面数据流为重点，描述了OAI LTE的实现。我们成功地模拟了支持FDD Band 5和TDD Band 38的1 UE和1 eNB LTE网络的空中传输。我们还在用户平面数据流上就执行时间对OAI进行了全面的分析。我们的结果可以作为开源社区未来优化的参考。
{"title":"Performance study of LTE experimental testbed using OpenAirInterface","authors":"Chun Yeow Yeoh, M. Mokhtar, A. Rahman, A. Samingan","doi":"10.1109/ICACT.2016.7423493","DOIUrl":"https://doi.org/10.1109/ICACT.2016.7423493","url":null,"abstract":"The next generation, 5G wireless access, is going to support a wide range of new applications and use cases, with the capabilities including very high achievable data rate, very low latency, ultra-high reliability and the possibility to handle extreme device densities. To avoid the costly deployment, operation and maintenance of future mobile network, Radio Access Network (RAN) virtualization or Cloud RAN is the answer to the problem. The idea is to move the baseband processing to the data center and run the RAN L1, L2 and L3 protocol layers using the commodity hardware, such as high-performance general purpose processors. An open source software-based LTE implementation, such as OpenAirInterface (OAI), is definitely accelerating the RAN cloudization and also realizing the possibility of low cost LTE network deployment in the future. In this paper, we describe the OAI LTE implementation emphasizing on the user plane data flow. We have successfully emulated over-the-air transmission for 1 UE and 1 eNB LTE network supporting both FDD Band 5 and TDD Band 38. We have also performed a thorough profiling of OAI, in terms of execution time, on the user plane data flow. Our results could be served as the reference for future optimization by open source community.","PeriodicalId":125854,"journal":{"name":"2016 18th International Conference on Advanced Communication Technology (ICACT)","volume":"30 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":"114786043","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.7423620
Wonsun Bong, Y. C. Kim
Constant amplitude multi-code (CAMC) CDMA has the same structure as a recursively generated single parity check product code. A top-level codeword of CAMC is recursively constructed from lower-level codewords. In the iterative decoding of CAMC, log likelihood ratio (LLR), a priori information and extrinsic information (EI) of a codeword is a weighted sum of LLR values of associated codewords from which it is despread or into which it is spread. In this paper, we show that differentiated assignment of EI in the computation of LLR can improve the performance of bit error correction. The weights of CAMC codewords are fixed at two fixed values. We let EI converge fast to saturation value when a codeword has the correct weight. The proposed method achieved performance improvement of 0.1 ~ 0.3 dB in Eb/No over the regular iterated decoding of CAMC. When compared with despreading ON/OFF control, a gain of about 0. 1 dB is achieved, which is meaningful near the Shannon capacity limit.
{"title":"Differentiated assignment of extrinsic information in iterated decoding of fixed weight codewords","authors":"Wonsun Bong, Y. C. Kim","doi":"10.1109/ICACT.2016.7423620","DOIUrl":"https://doi.org/10.1109/ICACT.2016.7423620","url":null,"abstract":"Constant amplitude multi-code (CAMC) CDMA has the same structure as a recursively generated single parity check product code. A top-level codeword of CAMC is recursively constructed from lower-level codewords. In the iterative decoding of CAMC, log likelihood ratio (LLR), a priori information and extrinsic information (EI) of a codeword is a weighted sum of LLR values of associated codewords from which it is despread or into which it is spread. In this paper, we show that differentiated assignment of EI in the computation of LLR can improve the performance of bit error correction. The weights of CAMC codewords are fixed at two fixed values. We let EI converge fast to saturation value when a codeword has the correct weight. The proposed method achieved performance improvement of 0.1 ~ 0.3 dB in Eb/No over the regular iterated decoding of CAMC. When compared with despreading ON/OFF control, a gain of about 0. 1 dB is achieved, which is meaningful near the Shannon capacity limit.","PeriodicalId":125854,"journal":{"name":"2016 18th International Conference on Advanced Communication Technology (ICACT)","volume":"25 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":"117027208","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}
Most of the existing DTN routing algorithms have been studied in the simulation environment. They are not sufficiently used to the historical location and historical neighbor's information. So AAaS (Area Approaching and Spray-and-Wait) routing algorithm is proposed, which considers the practicability of the algorithm and the rules of the node's movement and the law of the meeting. AAaS divides the map into areas by the administrative area, public places and areas the DTN nodes clustered with historical GPS position. Each area maintenance the frequency vectors of different time scales and the frequency vectors of the historical encountered neighbor. AAaS forwards the bundles by these frequency vectors in the bundle lifetime, select the appropriate next hop, more efficient use of the limited bandwidth of encountered nodes in DTN network. Finally, the prototype of AAaS routing algorithm is implemented in Android based on Bytewalla. The experimental results prove that, even in the case of the buffer is not limited, the AAaS is more efficient than Epidemic in the use of the limited bandwidth between encountered nodes.
现有的DTN路由算法大多在仿真环境下进行了研究。他们对历史位置和历史邻居的信息没有充分的了解。为此提出了AAaS (Area approached and Spray-and-Wait)路由算法，该算法考虑了算法的实用性以及节点的运动规律和相遇规律。AAaS根据行政区域、公共场所和DTN节点与历史GPS位置聚集的区域将地图划分为区域。每个区域保持不同时间尺度的频率向量和历史上遇到的相邻区域的频率向量。AAaS在包生命周期内通过这些频率向量转发包，选择合适的下一跳，更有效地利用DTN网络中遇到的节点的有限带宽。最后，基于Bytewalla在Android平台上实现了AAaS路由算法的原型。实验结果证明，即使在缓冲区不受限制的情况下，AAaS在利用遇到节点之间有限的带宽方面也比Epidemic更有效。
{"title":"AAaS: Area approaching and spray-and-wait routing scheme for DTN in Android","authors":"Weitao Wang, Huimei Lu, Yong Xiang, Bingying Cai, Jingbang Wu, Rui Gao","doi":"10.1109/ICACT.2016.7423451","DOIUrl":"https://doi.org/10.1109/ICACT.2016.7423451","url":null,"abstract":"Most of the existing DTN routing algorithms have been studied in the simulation environment. They are not sufficiently used to the historical location and historical neighbor's information. So AAaS (Area Approaching and Spray-and-Wait) routing algorithm is proposed, which considers the practicability of the algorithm and the rules of the node's movement and the law of the meeting. AAaS divides the map into areas by the administrative area, public places and areas the DTN nodes clustered with historical GPS position. Each area maintenance the frequency vectors of different time scales and the frequency vectors of the historical encountered neighbor. AAaS forwards the bundles by these frequency vectors in the bundle lifetime, select the appropriate next hop, more efficient use of the limited bandwidth of encountered nodes in DTN network. Finally, the prototype of AAaS routing algorithm is implemented in Android based on Bytewalla. The experimental results prove that, even in the case of the buffer is not limited, the AAaS is more efficient than Epidemic in the use of the limited bandwidth between encountered nodes.","PeriodicalId":125854,"journal":{"name":"2016 18th International Conference on Advanced Communication Technology (ICACT)","volume":"25 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":"125828706","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.7423374
Boo-Sun Jeon, Jungchan Na
The security of industrial control systems has been a big topic by the Stuxnet case in 2010. As a solution which can solve these requirements, data diode has emerged. A data diode is a computer security device that restricts the communication along a network connection between two computers so that data can only be transmitted in one direction. This enables a more sensitive or highly classified computer network to receive data directly from a less secure source while prohibiting the transmission of data in the opposite direction. In this paper, we describe data diode applied into industrial control system, after reviewing the commercial product, we address the various ways to apply a data diode in ICS and future works.
{"title":"A study of cyber security policy in industrial control system using data diodes","authors":"Boo-Sun Jeon, Jungchan Na","doi":"10.1109/ICACT.2016.7423374","DOIUrl":"https://doi.org/10.1109/ICACT.2016.7423374","url":null,"abstract":"The security of industrial control systems has been a big topic by the Stuxnet case in 2010. As a solution which can solve these requirements, data diode has emerged. A data diode is a computer security device that restricts the communication along a network connection between two computers so that data can only be transmitted in one direction. This enables a more sensitive or highly classified computer network to receive data directly from a less secure source while prohibiting the transmission of data in the opposite direction. In this paper, we describe data diode applied into industrial control system, after reviewing the commercial product, we address the various ways to apply a data diode in ICS and future works.","PeriodicalId":125854,"journal":{"name":"2016 18th International Conference on Advanced Communication Technology (ICACT)","volume":"7 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":"129466063","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.7423563
Jeaho Hwang, K. Won
FAT file system is one of the most common file systems on various targets and operating systems. However, it has a performance issue on sequential writing to low-bandwidth storage due to reading FAT area and directory entries. In this paper, we design and implement an efficient FAT caching mechanism for sequential writing to low-bandwidth. The mechanism consists two parts: metadata cache and whole FAT read-ahead cache. As a result, we show 20x improvement for sequential writing to low bandwidth storage with our caching mechanism.
{"title":"A caching mechanism for FAT file system in low-performance embedded system","authors":"Jeaho Hwang, K. Won","doi":"10.1109/ICACT.2016.7423563","DOIUrl":"https://doi.org/10.1109/ICACT.2016.7423563","url":null,"abstract":"FAT file system is one of the most common file systems on various targets and operating systems. However, it has a performance issue on sequential writing to low-bandwidth storage due to reading FAT area and directory entries. In this paper, we design and implement an efficient FAT caching mechanism for sequential writing to low-bandwidth. The mechanism consists two parts: metadata cache and whole FAT read-ahead cache. As a result, we show 20x improvement for sequential writing to low bandwidth storage with our caching mechanism.","PeriodicalId":125854,"journal":{"name":"2016 18th International Conference on Advanced Communication Technology (ICACT)","volume":"108 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":"133007488","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.7423523
T. Jo
In this research, we propose the table based KNN as the approach to the text categorization. In previous works, we discovered that encoding texts into tables improved the performance in the text categorization, so in this research, become to consider the possibility of encoding words into tables as well as texts. In this research, we encode words into tables where entries are texts and their weights, and apply the table based version of the KNN to the task of word categorization. As the benefits from this research, we expect the better performance and more stability than the traditional version of the KNN, by doing so. Therefore, the goal of this research is to provide the improved approach to the word categorization task.
{"title":"Table based KNN for categorizing words","authors":"T. Jo","doi":"10.1109/ICACT.2016.7423523","DOIUrl":"https://doi.org/10.1109/ICACT.2016.7423523","url":null,"abstract":"In this research, we propose the table based KNN as the approach to the text categorization. In previous works, we discovered that encoding texts into tables improved the performance in the text categorization, so in this research, become to consider the possibility of encoding words into tables as well as texts. In this research, we encode words into tables where entries are texts and their weights, and apply the table based version of the KNN to the task of word categorization. As the benefits from this research, we expect the better performance and more stability than the traditional version of the KNN, by doing so. Therefore, the goal of this research is to provide the improved approach to the word categorization task.","PeriodicalId":125854,"journal":{"name":"2016 18th International Conference on Advanced Communication Technology (ICACT)","volume":"42 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":"121443019","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.7423390
Jeman Park, Taeho Kim
Legacy real-time and embedded systems have been small scale and standalone. However, recently they are increasingly being connected to create large-scale distributed system. Such distributed embedded system is realized in automotive, medical, and manufacturing automation. Also, there are many researches about software platform for large-scale distributed system. Verification of the application is required in SW platform for safety-critical distributed system. However, the verification complexity increases in practice as several factors such as delay, jitter and error. An equivalent synchronized execution of distributed tasks are required in distributed realtime system. Our method is based on the PALS (Physically Asynchronous Logically Synchronous) which is a complexity-reducing architectural pattern for distributed real-time systems. It allows developers to design, verify and implement a logically synchronous implementation of real-time distributed applications. In this paper, we introduce a logical time synchronization for reducing complexity between distributed nodes in distributed embedded system. It make verification and development of distributed software easier. It is helpful to develop distributed embedded system which requires safety and reliability. This paper is useful for application programmer or system manager who wants to establish distributed embedded system which requires safety and reliability.
{"title":"A method of logically time synchronization for safety-critical distributed system","authors":"Jeman Park, Taeho Kim","doi":"10.1109/ICACT.2016.7423390","DOIUrl":"https://doi.org/10.1109/ICACT.2016.7423390","url":null,"abstract":"Legacy real-time and embedded systems have been small scale and standalone. However, recently they are increasingly being connected to create large-scale distributed system. Such distributed embedded system is realized in automotive, medical, and manufacturing automation. Also, there are many researches about software platform for large-scale distributed system. Verification of the application is required in SW platform for safety-critical distributed system. However, the verification complexity increases in practice as several factors such as delay, jitter and error. An equivalent synchronized execution of distributed tasks are required in distributed realtime system. Our method is based on the PALS (Physically Asynchronous Logically Synchronous) which is a complexity-reducing architectural pattern for distributed real-time systems. It allows developers to design, verify and implement a logically synchronous implementation of real-time distributed applications. In this paper, we introduce a logical time synchronization for reducing complexity between distributed nodes in distributed embedded system. It make verification and development of distributed software easier. It is helpful to develop distributed embedded system which requires safety and reliability. This paper is useful for application programmer or system manager who wants to establish distributed embedded system which requires safety and reliability.","PeriodicalId":125854,"journal":{"name":"2016 18th International Conference on Advanced Communication Technology (ICACT)","volume":"353 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":"116677707","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.7423533
Hyunho Kim, N. Bruce, Suhyun Park, Hoonjae Lee
The growth of both IT technology and the Internet Communication has involved the development of lot of encrypted information. Among others techniques of message hiding, stenography is one them but more suspicious as no one cannot see the secret message. As we always use the MS Office, there are many ways to hide secret messages by using PowerPoint as normal file. In this paper, we propose a new technique to find a hidden message by analysing the in PowerPoint file using EnCase Transcript. The result analysis shows that Steganography technique had hidden a certain number of message which are invisible to naked eye.
{"title":"EnCase forensic technology for decrypting stenography algorithm applied in the PowerPoint file","authors":"Hyunho Kim, N. Bruce, Suhyun Park, Hoonjae Lee","doi":"10.1109/ICACT.2016.7423533","DOIUrl":"https://doi.org/10.1109/ICACT.2016.7423533","url":null,"abstract":"The growth of both IT technology and the Internet Communication has involved the development of lot of encrypted information. Among others techniques of message hiding, stenography is one them but more suspicious as no one cannot see the secret message. As we always use the MS Office, there are many ways to hide secret messages by using PowerPoint as normal file. In this paper, we propose a new technique to find a hidden message by analysing the in PowerPoint file using EnCase Transcript. The result analysis shows that Steganography technique had hidden a certain number of message which are invisible to naked eye.","PeriodicalId":125854,"journal":{"name":"2016 18th International Conference on Advanced Communication Technology (ICACT)","volume":"53 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":"127783912","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.7423571
M. Sajjad, Karandeep Singh, Euihyun Paik, Chang-Won Ahn
Agent-based modeling and simulation (ABMS) has attracted social scientists and demographers in the field of social simulation. Due to large number of computer simulation technologies, ABMS approaches have been proposed with majority applications. ABMS composed of heterogeneous interacting agents, with several features which turn them into a significantly attractive modeling approach to simulate complex social systems. In this paper, first we explore the underlying social theories for ABMS, its simulation and modeling techniques, and computational frameworks. Second, our paper concentrate on the potential need of ABM techniques in the context of social simulation. An alternative ABM approach that is getting popularity is to inject data into agent-based simulation. To validate our model, we compare our results with actual-data. Our results closely matched with actual-data results in the case of mean-age at the demographic transition of first childbirth. Our work encourage ABM modelers to promote this trend while designing their models. Further, our paper is an attempt to merge the microsimulation approach into the agent-based simulation through injecting data into ABM approach.
{"title":"Social simulation: The need of data-driven agent-based modelling approach","authors":"M. Sajjad, Karandeep Singh, Euihyun Paik, Chang-Won Ahn","doi":"10.1109/ICACT.2016.7423571","DOIUrl":"https://doi.org/10.1109/ICACT.2016.7423571","url":null,"abstract":"Agent-based modeling and simulation (ABMS) has attracted social scientists and demographers in the field of social simulation. Due to large number of computer simulation technologies, ABMS approaches have been proposed with majority applications. ABMS composed of heterogeneous interacting agents, with several features which turn them into a significantly attractive modeling approach to simulate complex social systems. In this paper, first we explore the underlying social theories for ABMS, its simulation and modeling techniques, and computational frameworks. Second, our paper concentrate on the potential need of ABM techniques in the context of social simulation. An alternative ABM approach that is getting popularity is to inject data into agent-based simulation. To validate our model, we compare our results with actual-data. Our results closely matched with actual-data results in the case of mean-age at the demographic transition of first childbirth. Our work encourage ABM modelers to promote this trend while designing their models. Further, our paper is an attempt to merge the microsimulation approach into the agent-based simulation through injecting data into ABM approach.","PeriodicalId":125854,"journal":{"name":"2016 18th International Conference on Advanced Communication Technology (ICACT)","volume":"22 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":"132186708","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
扫码关注我们
求助内容：
应助结果提醒方式：