{"title":"ROBOMO: Effects of a Motivational Intervention to Adress the Barriers During Science Learning","authors":"Youssef Khaoula, Walid Boukadida, M. Okada","doi":"10.1109/CIT.2017.40","DOIUrl":"https://doi.org/10.1109/CIT.2017.40","url":null,"abstract":"Social robots are regarded as convenient tools in education due to their capabilities of improving knowledge acquisition. Using cognitive dissonance as a teaching tool has been popular in STEM learning too. This paper presents a design for a cutting-edge different experiments where we describe a procedure that induces cognitive dissonance and different conditions that may boost the student's ability to overcome the STEM learning barriers. In our first experiment, we verified whether the STEM exercises that we will use for the future experiments may lead to the cognitive dissonance. Then, we tested whether using a motivational source (box containing a tablet) may encourage the student to strive for answering STEM exercises that were previously answered incorrectly. Cracking a joke has been proved to release the students from cognitive laziness. That is why, in our third experiment, we tested whether using an explicit joke or an implicit joke is better to encourage the student continue with answering the STEM exercises. As many researchers highlight the persuasive messages strategies usefulness in manipulating people towards new behaviors, in our fourth experiment, we managed to test whether using an implicit or an explicit persuasive message strategy is better. We compared as well whether it is better to use a joke or a persuasive message strategy to encourage the student continue with reanswering STEM exercises that were previously answered incorrectly. Finally, in our last study, we manipulated three factors which are the interaction level (dynamic or static), agency (a robot or a mascot) and timing (during or before gamma window) to choose finally the best combination boosting the student's strive for science learning.","PeriodicalId":378423,"journal":{"name":"2017 IEEE International Conference on Computer and Information Technology (CIT)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126624515","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}
Ge Zhang, Haozhan Wang, Zhongzhi Luan, Weiguo Wu, D. Qian
{"title":"Improving Performance for Geo-Distributed Data Process in Wide-Area","authors":"Ge Zhang, Haozhan Wang, Zhongzhi Luan, Weiguo Wu, D. Qian","doi":"10.1109/CIT.2017.48","DOIUrl":"https://doi.org/10.1109/CIT.2017.48","url":null,"abstract":"Many organizations and end sensors produce massive data around the globe. To analyze the data as a whole, the traditional way is to copy all data to a central datacenter for analysis. This is neither practical nor efficient as the huge transfer data size and the limited network bandwidth. What's more, the data privacy may also matters. Instead of transferring data, we believe moving the computation to where the data is can be a better way to solve this problem. In this paper, we design an algorithm for geo-distributed big data process which is both data-aware and network-aware. Considering the computation's characteristics, we take advantage of data dependency to find out the data locality. And use the integer linear programming (ILP) to achieve network-aware. The implementation of our algorithm is on the top of Spark. We improve the performance of geo-distributed data process by 22% in our experiments.","PeriodicalId":378423,"journal":{"name":"2017 IEEE International Conference on Computer and Information Technology (CIT)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125632988","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}
{"title":"Fast Transmission Mechanism for Secure VPLS Architectures","authors":"Madhusanka Liyanage, M. Ylianttila, A. Gurtov","doi":"10.1109/CIT.2017.46","DOIUrl":"https://doi.org/10.1109/CIT.2017.46","url":null,"abstract":"Ethernet based secure VPLS (Virtual Private LAN Services) networks require to establish full mesh of VPLS tunnels between the customer sites. However, the tunnel establishment between geographically distant customer sites introduces a significantly high delay to the user traffic transportation.In this article, we propose a novel fast transmission mechanism for secure VPLS architectures to reduce the waiting time before transmitting the data and the average data transmission delay between geographically distant customer sites. The performance of proposed mechanism is analyzed by using a simulation model and a testbed implementation.","PeriodicalId":378423,"journal":{"name":"2017 IEEE International Conference on Computer and Information Technology (CIT)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134094671","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}
{"title":"Security Assessment of a Distributed, Modbus-Based Building Automation System","authors":"T. Tenkanen, T. Hämäläinen","doi":"10.1109/CIT.2017.38","DOIUrl":"https://doi.org/10.1109/CIT.2017.38","url":null,"abstract":"Building automation systems were designed in an era when security was not a concern as the systems were closed from outside access. However, multiple benefits can be found in connecting such systems over the Internet and controlling a number of buildings from a single location. Security breaches towards building automation systems are increasing and may cause direct or indirect damages to the target organization or even the residents of the building. This work presents an approach to apply a method of data flow recognition and environment analysis to building automation through a case study on a distributed building automation system utilizing the Modbus protocol at the sites and presents suggested methods for mitigating the risks.","PeriodicalId":378423,"journal":{"name":"2017 IEEE International Conference on Computer and Information Technology (CIT)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131768883","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}
{"title":"Some Cryptography Models Designed by Double Odd-Edge Labelling of Trees","authors":"Hongyu Wang, Jin Xu, B. Yao","doi":"10.1109/CIT.2017.41","DOIUrl":"https://doi.org/10.1109/CIT.2017.41","url":null,"abstract":"Cryptography has been around for thousands of years. We propose a new cryptographic model, lock trees and key trees, and our idea differs from current graphical passwords in this paper. Graphs and their labellings are applied to establish the concepts of key-trees and lock-trees based on abundant of graphs having smaller orders and their corresponding double odd-edge labellings. We propose two methods, called Edge-Construction and Paste-Construction-w, to construct trees of larger orders by some smaller trees such that the new trees have some DOElabellings. Our results may be valued to information security and graph theory, at the end of this article we propose several conjectures.","PeriodicalId":378423,"journal":{"name":"2017 IEEE International Conference on Computer and Information Technology (CIT)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114970332","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}
Lei Ni, Yuxin Wang, Haoyang Tang, Zhao Yin, Yanming Shen
{"title":"Accurate Localization Using LTE Signaling Data","authors":"Lei Ni, Yuxin Wang, Haoyang Tang, Zhao Yin, Yanming Shen","doi":"10.1109/CIT.2017.59","DOIUrl":"https://doi.org/10.1109/CIT.2017.59","url":null,"abstract":"In this paper, we propose a novel localization algorithm using LTE signaling data. Specifically, we use TA (Timing Advance) and RSRP (Reference Signal Receiving Power) data that are required in LTE standard and already available in current LTE systems. The combination of (TA, RSRP) is used as a signature, and one can expect that different locations will have distinctive signatures. Our real world data first showed that both TA and RSRP at a particular location have a small variance, and therefor good for localization purpose. We then consider the spatial-temporal dependencies of these data to improve the localization accuracy. We design and implement a novel machine learning based algorithm to infer a user's latitude-longitude given a (TA, RSRP) measurement. We have evaluated our system using traces collected in our city covering more than 800 km. The results show that our cellular signaling based localization algorithm achieves a median localization accuracy around 25 m.","PeriodicalId":378423,"journal":{"name":"2017 IEEE International Conference on Computer and Information Technology (CIT)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115014791","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}