Pub Date : 2020-03-01DOI: 10.1109/ICICT50521.2020.00026
P. Biswas, Sarit Pal, S. Khatri
Protein folding has always been a key problem in the field of computational biology. Several models have been proposed for protein folding in the past. The sequence via which a protein folds has a strong impact on the presence or absence of a disease in an organism. Given their significance to the health of an organism, in this paper, we present a Probabilistic Model Checking (PMC) based approach which provides statistical answers to questions that one may pose about the protein folding process. In such an approach, the protein folding model is represented as a probabilistic state transition system, and the questions are expressed formally in form of temporal properties. The PMC engine provides the probability of satisfying the property, which provides an insight into the protein folding process. Such properties are of several kinds - liveness properties, safety properties and fairness properties. We verify the properties on a probabilistic model checker. In this paper, we present our approach, and demonstrate its applicability by using the protein pro-insulin as our test case. We first express the dynamics of this protein using a probabilistic state transition system. Based on the state transition model we express several liveness, fairness and safety properties which target the folding steps/transitions. The probabilistic model checker tool (Prism [29-32]) is invoked to provide the probability of satisfying each of these queries. We have analyzed the change in the property satisfaction probability as a function of the change in the concentration level of the oxidation and reduction reagents. To the best of the authors’ knowledge, this is the first paper to model protein folding dynamics probabilistically, using Probabilistic Model Checking, a powerful technique from the domain of formal verification of state transition systems.
蛋白质折叠一直是计算生物学领域的一个关键问题。过去已经提出了几种蛋白质折叠的模型。蛋白质折叠的顺序对生物体中疾病的存在与否有强烈的影响。鉴于它们对生物体健康的重要性，在本文中，我们提出了一种基于概率模型检查(PMC)的方法，该方法为人们可能提出的有关蛋白质折叠过程的问题提供了统计答案。在这种方法中，蛋白质折叠模型被表示为一个概率状态转移系统，问题以时间属性的形式正式表示。PMC引擎提供了满足该特性的概率，从而提供了对蛋白质折叠过程的深入了解。这些性质有几种:活跃性、安全性和公平性。我们在概率模型检查器上验证属性。在本文中，我们提出了我们的方法，并通过使用胰岛素原蛋白作为我们的测试案例来证明其适用性。我们首先用一个概率状态转移系统来表达这种蛋白质的动力学。在状态转移模型的基础上，我们表达了针对折叠步骤/转移的活泼性、公平性和安全性。调用概率模型检查器工具(Prism[29-32])来提供满足这些查询的概率。我们分析了性能满足概率随氧化还原试剂浓度水平变化的函数变化。据作者所知，这是第一篇使用概率模型检查(Probabilistic model Checking)对蛋白质折叠动力学进行概率建模的论文，这是一种来自状态转移系统形式化验证领域的强大技术。
{"title":"A Mathematical Framework for Exploring Protein Folding Dynamics using Probabilistic Model Checking","authors":"P. Biswas, Sarit Pal, S. Khatri","doi":"10.1109/ICICT50521.2020.00026","DOIUrl":"https://doi.org/10.1109/ICICT50521.2020.00026","url":null,"abstract":"Protein folding has always been a key problem in the field of computational biology. Several models have been proposed for protein folding in the past. The sequence via which a protein folds has a strong impact on the presence or absence of a disease in an organism. Given their significance to the health of an organism, in this paper, we present a Probabilistic Model Checking (PMC) based approach which provides statistical answers to questions that one may pose about the protein folding process. In such an approach, the protein folding model is represented as a probabilistic state transition system, and the questions are expressed formally in form of temporal properties. The PMC engine provides the probability of satisfying the property, which provides an insight into the protein folding process. Such properties are of several kinds - liveness properties, safety properties and fairness properties. We verify the properties on a probabilistic model checker. In this paper, we present our approach, and demonstrate its applicability by using the protein pro-insulin as our test case. We first express the dynamics of this protein using a probabilistic state transition system. Based on the state transition model we express several liveness, fairness and safety properties which target the folding steps/transitions. The probabilistic model checker tool (Prism [29-32]) is invoked to provide the probability of satisfying each of these queries. We have analyzed the change in the property satisfaction probability as a function of the change in the concentration level of the oxidation and reduction reagents. To the best of the authors’ knowledge, this is the first paper to model protein folding dynamics probabilistically, using Probabilistic Model Checking, a powerful technique from the domain of formal verification of state transition systems.","PeriodicalId":445000,"journal":{"name":"2020 3rd International Conference on Information and Computer Technologies (ICICT)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128771796","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-03-01DOI: 10.1109/ICICT50521.2020.00087
S. Karthikeyan, H. El-Razouk
The world is facing a new revolutionary technology transition, Internet of things (IoT). IoT systems requires secure connectivity of distributed entities, including in-field sensors. For such external devices, Side Channel Analysis poses a potential threat as it does not require complete knowledge about the crypto algorithm. In this work, we perform Horizontal Correlation Power Analysis (HCPA) which is a type of Side Channel Analysis (SCA) over the Elliptic Curve Diffie Hellman (ECDH) key exchange protocol. ChipWhisperer (CW) by NewAE Technologies is an open source toolchain which is utilized to perform the HCPA by using CW toolchain. To best of our knowledge, this is the first attempt to implemented ECDH on Artix-7 FPGA for HCPA. We compare our correlation results with the results from AES -128 bits provided by CW. Our point of attack is the Double and Add algorithm which is used to perform Scalar multiplication in ECC. We obtain a maximum correlation of 7% for the key guess using the HCPA. We also discuss about the possible cause for lower correlation and few potentials ways to improve it. In Addition to HCPA we also perform Simple Power Analysis (SPA) (visual) for ECDH, to guess the trailing zeros in the 128- bit secret key for different power traces.
{"title":"Horizontal Correlation Analysis of Elliptic Curve Diffie Hellman","authors":"S. Karthikeyan, H. El-Razouk","doi":"10.1109/ICICT50521.2020.00087","DOIUrl":"https://doi.org/10.1109/ICICT50521.2020.00087","url":null,"abstract":"The world is facing a new revolutionary technology transition, Internet of things (IoT). IoT systems requires secure connectivity of distributed entities, including in-field sensors. For such external devices, Side Channel Analysis poses a potential threat as it does not require complete knowledge about the crypto algorithm. In this work, we perform Horizontal Correlation Power Analysis (HCPA) which is a type of Side Channel Analysis (SCA) over the Elliptic Curve Diffie Hellman (ECDH) key exchange protocol. ChipWhisperer (CW) by NewAE Technologies is an open source toolchain which is utilized to perform the HCPA by using CW toolchain. To best of our knowledge, this is the first attempt to implemented ECDH on Artix-7 FPGA for HCPA. We compare our correlation results with the results from AES -128 bits provided by CW. Our point of attack is the Double and Add algorithm which is used to perform Scalar multiplication in ECC. We obtain a maximum correlation of 7% for the key guess using the HCPA. We also discuss about the possible cause for lower correlation and few potentials ways to improve it. In Addition to HCPA we also perform Simple Power Analysis (SPA) (visual) for ECDH, to guess the trailing zeros in the 128- bit secret key for different power traces.","PeriodicalId":445000,"journal":{"name":"2020 3rd International Conference on Information and Computer Technologies (ICICT)","volume":"154 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127513380","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}
Kagawa University has jointly developed a regional problem-solving information system with Ricoh Co., Ltd. These are Advertising Display Printer System (KadaPos), Travel Diary Generation/ Printing System (KaDiary) and Tourist Guidebook Generating/Printing System (KadaPam). These information systems were developed by combining Ricoh's image matching technology and print control technology with the information system development technology of Kagawa University. These systems were developed based on the "Kagawa University-type development model". The model is composed of "extraction of regional problems", "planning solutions for problems", "development of prototype systems to verify solutions" and "demonstration experiments using prototype systems". In this paper, we describe the practice of the "Kagawa University-type development model" in the development processes of KadaPos, KaDiary and KadaPam. The practice of regional problem-solving information system development based on "Kagawa University-type development model" shows that there is a certain effect in the development of regional problem-solving information system and technology verification in enterprises.
{"title":"Kagawa University-Type Development Model and Its Practice of Information System for Regional Problem Solution by Open Innovation","authors":"T. Kunieda, Satoru Yamada, Tetsuya Ikeda, Yusuke Kometani, Naka Gotoda, Rihito Yaegashi","doi":"10.1109/ICICT50521.2020.00035","DOIUrl":"https://doi.org/10.1109/ICICT50521.2020.00035","url":null,"abstract":"Kagawa University has jointly developed a regional problem-solving information system with Ricoh Co., Ltd. These are Advertising Display Printer System (KadaPos), Travel Diary Generation/ Printing System (KaDiary) and Tourist Guidebook Generating/Printing System (KadaPam). These information systems were developed by combining Ricoh's image matching technology and print control technology with the information system development technology of Kagawa University. These systems were developed based on the \"Kagawa University-type development model\". The model is composed of \"extraction of regional problems\", \"planning solutions for problems\", \"development of prototype systems to verify solutions\" and \"demonstration experiments using prototype systems\". In this paper, we describe the practice of the \"Kagawa University-type development model\" in the development processes of KadaPos, KaDiary and KadaPam. The practice of regional problem-solving information system development based on \"Kagawa University-type development model\" shows that there is a certain effect in the development of regional problem-solving information system and technology verification in enterprises.","PeriodicalId":445000,"journal":{"name":"2020 3rd International Conference on Information and Computer Technologies (ICICT)","volume":"4 2","pages":"177-182"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141226328","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-03-01DOI: 10.1109/ICICT50521.2020.00090
Adenilson Mumbelli, Robison Cris Brito, V. Pegorini, Luis Felipe Priester
These days, in order for the poultry farmers to be successful in their activities, it is necessary to control with precision all data related to the poultry management. Many times, such data are contained inside the own aviary, temperature, ventilation, level of feed, lighting, among others. These parameters exert influence directly on the chicken’s growth. The proposed model combines hardware and software in order to monitor and automatically control these environmental parameters, allowing the poultry farmer to configure predefined function standards, as well as control such data remotely through a smartphone application. Besides allowing the configuration of the control parameters, the proposed model allows to monitor the temperature values and actuators status in real time, creating logs of the sensors and alarms readings. Several of the concepts of Internet of Things (IoT) were applied in this work in order to build a systemic design with high scalability.
{"title":"Low Cost IoT-Based System for Monitoring and Remote Controlling Aviaries","authors":"Adenilson Mumbelli, Robison Cris Brito, V. Pegorini, Luis Felipe Priester","doi":"10.1109/ICICT50521.2020.00090","DOIUrl":"https://doi.org/10.1109/ICICT50521.2020.00090","url":null,"abstract":"These days, in order for the poultry farmers to be successful in their activities, it is necessary to control with precision all data related to the poultry management. Many times, such data are contained inside the own aviary, temperature, ventilation, level of feed, lighting, among others. These parameters exert influence directly on the chicken’s growth. The proposed model combines hardware and software in order to monitor and automatically control these environmental parameters, allowing the poultry farmer to configure predefined function standards, as well as control such data remotely through a smartphone application. Besides allowing the configuration of the control parameters, the proposed model allows to monitor the temperature values and actuators status in real time, creating logs of the sensors and alarms readings. Several of the concepts of Internet of Things (IoT) were applied in this work in order to build a systemic design with high scalability.","PeriodicalId":445000,"journal":{"name":"2020 3rd International Conference on Information and Computer Technologies (ICICT)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133559214","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-03-01DOI: 10.1109/ICICT50521.2020.00043
Raphael Bravo Dedo, Juan Jesus Cueto Yabar, David Mauricio
Nowadays, the game industry related to the interaction of multiples devices is still incipient due the current limitations between specific attributes like connection, compatibility of different platforms and documentation for development. In this paper we proposed a multiplayer game called INKATAN that integrates ensemble interactions and cross device technologies between Smart TVs and Android devices. We use a library based on Web sockets that allow, based on server-client principle, the connection of multiple devices that share similar environment independently of the platform that it belongs. INKATAN is a cooperative strategy game that allow up to 4 players to play at the same time using Android devices and a Smart TV as an interaction chart. The tests performed to 30 users divided in groups of 2 and 4 players show that the experience, quality and satisfaction present between accord and totally accord of all participants.
{"title":"Inkatán: A Game for Smart TV and Android with Ensemble Interactions","authors":"Raphael Bravo Dedo, Juan Jesus Cueto Yabar, David Mauricio","doi":"10.1109/ICICT50521.2020.00043","DOIUrl":"https://doi.org/10.1109/ICICT50521.2020.00043","url":null,"abstract":"Nowadays, the game industry related to the interaction of multiples devices is still incipient due the current limitations between specific attributes like connection, compatibility of different platforms and documentation for development. In this paper we proposed a multiplayer game called INKATAN that integrates ensemble interactions and cross device technologies between Smart TVs and Android devices. We use a library based on Web sockets that allow, based on server-client principle, the connection of multiple devices that share similar environment independently of the platform that it belongs. INKATAN is a cooperative strategy game that allow up to 4 players to play at the same time using Android devices and a Smart TV as an interaction chart. The tests performed to 30 users divided in groups of 2 and 4 players show that the experience, quality and satisfaction present between accord and totally accord of all participants.","PeriodicalId":445000,"journal":{"name":"2020 3rd International Conference on Information and Computer Technologies (ICICT)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133743644","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-03-01DOI: 10.1109/ICICT50521.2020.00047
Naoki Iijima, Koichiro Amemiya, J. Ogawa, H. Miyoshi
A large amount of stream data are generated from some devices such as sensors and cameras. These stream data should be timely processed for real-time applications to satisfy the data latency requirements. To process a large amount of data in a short time, utilizing stream processing on edge/fog computing is a promising technology. In the stream processing system, a snapshot of processes and replications of the stream data are stored on another server, and when server fault or load spike of server occurs, the process is continued by using the stored snapshots and replicated data. Therefore, with edge computing environment, which has low bandwidth resource, process recovery takes a long time due to the transferring of restored data. In this paper, we propose a stream processing system architecture to decide servers to store snapshots and replication data and redeploy processes by considering the load of each server and the network bandwidth. We also propose a semi-optimal algorithm that reduces the computational cost by appropriately sorting servers and tasks according to the network bandwidth and server load. The algorithm can find a solution over 1000 times faster than the Coin or Branch and Cut (CBC) solver.
{"title":"Deciding Backup Location Methods for Distributed Stream Processing System","authors":"Naoki Iijima, Koichiro Amemiya, J. Ogawa, H. Miyoshi","doi":"10.1109/ICICT50521.2020.00047","DOIUrl":"https://doi.org/10.1109/ICICT50521.2020.00047","url":null,"abstract":"A large amount of stream data are generated from some devices such as sensors and cameras. These stream data should be timely processed for real-time applications to satisfy the data latency requirements. To process a large amount of data in a short time, utilizing stream processing on edge/fog computing is a promising technology. In the stream processing system, a snapshot of processes and replications of the stream data are stored on another server, and when server fault or load spike of server occurs, the process is continued by using the stored snapshots and replicated data. Therefore, with edge computing environment, which has low bandwidth resource, process recovery takes a long time due to the transferring of restored data. In this paper, we propose a stream processing system architecture to decide servers to store snapshots and replication data and redeploy processes by considering the load of each server and the network bandwidth. We also propose a semi-optimal algorithm that reduces the computational cost by appropriately sorting servers and tasks according to the network bandwidth and server load. The algorithm can find a solution over 1000 times faster than the Coin or Branch and Cut (CBC) solver.","PeriodicalId":445000,"journal":{"name":"2020 3rd International Conference on Information and Computer Technologies (ICICT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131194497","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-03-01DOI: 10.1109/ICICT50521.2020.00062
Toshiya Kawato, Masayuki Higashino, Kenichi Takahashi, T. Kawamura
High-performance computers have spread at a lower cost than in the past by technological advancement. Thus, the performance of computers may be excessive for its usage. In this case, resources of computers such as CPU, memory, and storage are not utilized fully and resulting in an idle state; that is, these idle resources are wasted despite use-value. We should utilize them effectively. For this reason, we attempt to utilize surplus storage capacity, one of the idle resources, as distributed storage. In this paper, we design a distributed storage using surplus storage capacity by considering characteristics of surplus storage capacity and computers with its capacity.
{"title":"Attempt to Utilize Surplus Storage Capacity as Distributed Storage","authors":"Toshiya Kawato, Masayuki Higashino, Kenichi Takahashi, T. Kawamura","doi":"10.1109/ICICT50521.2020.00062","DOIUrl":"https://doi.org/10.1109/ICICT50521.2020.00062","url":null,"abstract":"High-performance computers have spread at a lower cost than in the past by technological advancement. Thus, the performance of computers may be excessive for its usage. In this case, resources of computers such as CPU, memory, and storage are not utilized fully and resulting in an idle state; that is, these idle resources are wasted despite use-value. We should utilize them effectively. For this reason, we attempt to utilize surplus storage capacity, one of the idle resources, as distributed storage. In this paper, we design a distributed storage using surplus storage capacity by considering characteristics of surplus storage capacity and computers with its capacity.","PeriodicalId":445000,"journal":{"name":"2020 3rd International Conference on Information and Computer Technologies (ICICT)","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129473347","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-03-01DOI: 10.1109/ICICT50521.2020.00088
A. Kamal, H. Dahshan, A. Elbayoumy
Network coding (NC) can significantly increase network performance and make lossy networks more reliable. Since the middle nodes modify the packets during their path to destination, integrity of the original packets cannot be checked using classical methods (MACs, Signatures, etc). Though, pollution attacks are the most common threat to network coded systems, where an infected node can inject the data flow of a network with a number of false packets and ban the receiver from properly decoding the packets. A lot of work in the security of NC in resisting pollution attacks has been investigated in recent years, majority have the same security parameter 1/q. A Homomorphic MAC scheme is presented earlier to resist pollution attacks with a security level 1/q^l, In this paper, we will show that the mentioned scheme is subject to known-plaintext attacks. This is due to that part of the key can be revealed in an initial process. Also, the whole key could be revealed if the key is used more than once. Then, a modification to the mentioned scheme is proposed to overcome this issue. Besides, the MAC length is adjustable according to the required security level and not variable according to the vector's length which will accordingly increase the performance and efficiency of the scheme.
{"title":"A New Homomorphic Message Authentication Code Scheme for Network Coding","authors":"A. Kamal, H. Dahshan, A. Elbayoumy","doi":"10.1109/ICICT50521.2020.00088","DOIUrl":"https://doi.org/10.1109/ICICT50521.2020.00088","url":null,"abstract":"Network coding (NC) can significantly increase network performance and make lossy networks more reliable. Since the middle nodes modify the packets during their path to destination, integrity of the original packets cannot be checked using classical methods (MACs, Signatures, etc). Though, pollution attacks are the most common threat to network coded systems, where an infected node can inject the data flow of a network with a number of false packets and ban the receiver from properly decoding the packets. A lot of work in the security of NC in resisting pollution attacks has been investigated in recent years, majority have the same security parameter 1/q. A Homomorphic MAC scheme is presented earlier to resist pollution attacks with a security level 1/q^l, In this paper, we will show that the mentioned scheme is subject to known-plaintext attacks. This is due to that part of the key can be revealed in an initial process. Also, the whole key could be revealed if the key is used more than once. Then, a modification to the mentioned scheme is proposed to overcome this issue. Besides, the MAC length is adjustable according to the required security level and not variable according to the vector's length which will accordingly increase the performance and efficiency of the scheme.","PeriodicalId":445000,"journal":{"name":"2020 3rd International Conference on Information and Computer Technologies (ICICT)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114950924","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-03-01DOI: 10.1109/ICICT50521.2020.00037
Toshiro Minami, Y. Ohura
The main aim of this paper is to investigate the social relationship among students using their seat position data. Together with the lecturer's intuitive recognition, we are able to know more about student's attitude and style to learning, which helps the lecturers to provide the students with more effective lectures. In this paper, we use the distance of seat positions of students as the index for their friendship relation and find student groups. By combining our findings in our previous studies, we are convinced that data analysis is a very useful tool for understanding students' behavior, which will help the lectures to have useful tips for delivering better lectures.
{"title":"An Investigation on Social Relations between University Students from Seat Position Data","authors":"Toshiro Minami, Y. Ohura","doi":"10.1109/ICICT50521.2020.00037","DOIUrl":"https://doi.org/10.1109/ICICT50521.2020.00037","url":null,"abstract":"The main aim of this paper is to investigate the social relationship among students using their seat position data. Together with the lecturer's intuitive recognition, we are able to know more about student's attitude and style to learning, which helps the lecturers to provide the students with more effective lectures. In this paper, we use the distance of seat positions of students as the index for their friendship relation and find student groups. By combining our findings in our previous studies, we are convinced that data analysis is a very useful tool for understanding students' behavior, which will help the lectures to have useful tips for delivering better lectures.","PeriodicalId":445000,"journal":{"name":"2020 3rd International Conference on Information and Computer Technologies (ICICT)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124099064","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-03-01DOI: 10.1109/icict50521.2020.00001
{"title":"[Title page i]","authors":"","doi":"10.1109/icict50521.2020.00001","DOIUrl":"https://doi.org/10.1109/icict50521.2020.00001","url":null,"abstract":"","PeriodicalId":445000,"journal":{"name":"2020 3rd International Conference on Information and Computer Technologies (ICICT)","volume":"577 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123405777","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
扫码关注我们
求助内容：
应助结果提醒方式：