{"title":"Predicting Student Performance in an ITS Using Task-Driven Features","authors":"Ritu Chaturvedi, C. Ezeife","doi":"10.1109/CIT.2017.34","DOIUrl":"https://doi.org/10.1109/CIT.2017.34","url":null,"abstract":"Intelligent Tutoring Systems (ITS) are typically designed to offer one-on-one tutoring on a subject to students in an adaptive way so that students can learn the subject at their own pace. The ability to predict student performance enables an ITS to make informed decisions towards meeting the individual needs of students. It is also useful for ITS designers to validate if students are actually able to succeed in learning the subject. Predicting student performance is a function of two complex and dynamic factors: (f1) student learning behavior and (f2) their current knowledge in the subject. Learning behavior is captured from student interaction with the ITS (e.g. time spent on an assigned task) and is stored in the form of web logs. Student knowledge in the subject is represented by the marks they score in assigned tasks and is stored in a specific component of the ITS called student model. In order to build an accurate prediction model, this raw data from student model and web logs must be engineered carefully and transformed into meaningful features. Existing systems such as LON-CAPA predict students performance using their learning behavior alone, without considering their (current) knowledge on the subject. Lack of proper feature engineering is evident from the low values of accuracy of their prediction models. This research proposes a highly accurate model that predicts student success in assigned tasks with a 96% accuracy by using features that are better informed not only about students in terms of the two factors f1 and f2 mentioned above, but also on the assigned task itself (e.g. task's difficulty level). In order to accomplish this, an Example Recommendation System (ERS) is designed with a fine-grained student model (to represent student data) and a fine-grained domain model (to represent domain resources such as tasks).","PeriodicalId":378423,"journal":{"name":"2017 IEEE International Conference on Computer and Information Technology (CIT)","volume":"6 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":"124391847","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":"The Enumeration of Flippable Edges in Maximal Planar Graphs","authors":"Dongyan Zhao, Yangyang Zhou, Jin Xu","doi":"10.1109/CIT.2017.44","DOIUrl":"https://doi.org/10.1109/CIT.2017.44","url":null,"abstract":"Much attention has been paid to the diagonal flips in maximal planar graphs. In this paper, we firstly focus on the properties of the unflippable edges in maximal planar graphs, and propose the concept of K4-embedding. Also, we prove that for a maximal planar graph G with order n(⋝ 5), an edge e ∊ E(G) is unflippable if and only if e is either incident to a 3-degree vertex or a supporting edge of a K4-embedding. Secondly, we give the necessary and sufficient condition for a maximal planar graph G has a given number of flippable edges. Finally, we show a general algorithm of the enumeration of flippable edges in maximal planar graphs by the extending-contracting operational system, with the time complexity of O(n2).","PeriodicalId":378423,"journal":{"name":"2017 IEEE International Conference on Computer and Information Technology (CIT)","volume":"142 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":"123454930","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":"Changing for Win-Win: Change Management on Global Value Chain Optimization","authors":"G. Xiong, T. Nyberg, Gang-Yu Xiong","doi":"10.1109/CIT.2017.25","DOIUrl":"https://doi.org/10.1109/CIT.2017.25","url":null,"abstract":"A GVC (Global Value Chain) optimization requires appropriate approach to make it happen, however, a good approach is not enough when the optimization requires a big changing throughout the chain. It is very important to have a methodology of change management during change processes for GVC optimization. This paper describes the principle of change management, and illustrates a case study on how to apply concepts of change management to obtain successful change for GVC project's achievement. Firstly, a brief literature review relevant to change management in a business environment is introduced. Some general methodologies and tools to make a change effectively are explained. A general GVC approach is reviewed. Next a case study of change management based on a GVC project is introduced, which conducts for three partners along the chain. Then, several critical success factors for buy-in changing are identified, which support the relevant people or group to accept the changing solutions. Then, actual result shows a success of buy-in changing throughout the GVC from the upstream suppliers to downstream customers. Obviously, the successful change management helps the GVC optimization project to make a win-win scenarios for all partners. Finally, the case study's findings are in line with in the field, the method of change management on a GVC project is concluded.","PeriodicalId":378423,"journal":{"name":"2017 IEEE International Conference on Computer and Information Technology (CIT)","volume":"210 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":"133177392","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":"A Software-Hardware Co-designed Methodology for Efficient Thread Level Speculation","authors":"Qiong Wang, Jialong Wang, Li Shen, Zhiying Wang","doi":"10.1109/CIT.2017.49","DOIUrl":"https://doi.org/10.1109/CIT.2017.49","url":null,"abstract":"Thread-Level Speculation (TLS) mechanism has been extensively studied due to its capability of simplifying parallel programming and achieving effective performance speedup. In this paper, we investigate the study of improving current TLS models for high efficiency on present multi-core architectures. Particularly, we propose a new TLS model called Cache Copy-on-Write (CCoW). The main features of our CCoW model include: 1) software/hardware co-designed implementation of TLS; 2) more efficient sharing management of speculative variables among speculative threads to resolve loop-carried dependence; 3) a novel speculative variable storage mechanism to enhance efficiency and effectiveness of the speculative execution. A prototype for our Cache-COW is built on SESC simulator and experimental results indicate that the proposed CCoW accelerates typical benchmarks by an average of 5.69x and 10.04x using 8 and 16 speculative threads respectively.","PeriodicalId":378423,"journal":{"name":"2017 IEEE International Conference on Computer and Information Technology (CIT)","volume":"3 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":"124241273","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}
V. Cavalcanti, Eduado Antonio Guimaraes Tavares, Meuse Nogueira de O. Junior, Dennys Azevedo, Jonas Pontes
{"title":"A Sensitivity Approach to Energy-Efficient Mapping of Dependable Virtual Networks","authors":"V. Cavalcanti, Eduado Antonio Guimaraes Tavares, Meuse Nogueira de O. Junior, Dennys Azevedo, Jonas Pontes","doi":"10.1109/CIT.2017.47","DOIUrl":"https://doi.org/10.1109/CIT.2017.47","url":null,"abstract":"Network virtualization is a promising solution to overcome the resistance to architectural changes in Internet, and virtual network embedding (VNE) is a remarkable challenge. Virtualization makes possible resource sharing as an effective energy saving technology, but few works consider energy consumption in the mapping. In addition, important QoS metrics, such as availability, are usually neglected. In this paper, we propose a sensitivity approach to energy-efficient mapping of dependable virtual networks. Results demonstrate the feasibility of the proposed approach, and they show the trade-off between availability, energy consumption and cost.","PeriodicalId":378423,"journal":{"name":"2017 IEEE International Conference on Computer and Information Technology (CIT)","volume":"34 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":"116980042","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":"Sentiment Classification: Feature Selection Based Approaches Versus Deep Learning","authors":"A. Uysal, Y. Murphey","doi":"10.1109/CIT.2017.53","DOIUrl":"https://doi.org/10.1109/CIT.2017.53","url":null,"abstract":"Classification of text documents is commonly carried out using various models of bag-of-words that are generated using feature selection methods. In these models, selected features are used as input to well-known classifiers such as Support Vector Machines (SVM) and neural networks. In recent years, a technique called word embeddings has been developed for text mining and, deep learning models using word embeddings have become popular for sentiment classification. However, there is no extensive study has been conducted to compare these approaches for sentiment classification. In this paper, we present an in-depth comparative study on these two types of approaches, feature selection based approaches and and deep learning models for document-level sentiment classification. Experiments were conducted using four datasets with varying characteristics. In order to investigate the effectiveness of word embeddings features, feature sets including combination of selected bag-of-words features and averaged word embedding features were used in sentiment classification. For analyzing deep learning models, we implemented three different deep learning architecture, convolutional neural network, long short-term memory network, and long-term recurrent convolutional network. Our experimental results show that that deep learning models performed better on three out of the four datasets, a combination of selected bag-of-words features and averaged word embedding features gave the best performance on one dataset. In addition, we will show that a deep learning model initialized with either one-hot vectors or fine-tuned word embeddings performed better than the model initialized using than word embeddings without tuning.","PeriodicalId":378423,"journal":{"name":"2017 IEEE International Conference on Computer and Information Technology (CIT)","volume":"13 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":"133095794","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":"Cooperative Multi-relay Assisted Multicast Beamforming in Wirelessly Powered Communications","authors":"Jiachen Li, Yue Mi, Shimin Gong, Jing Xu, Xiaoxia Huang, Yanyan Shen","doi":"10.1109/CIT.2017.62","DOIUrl":"https://doi.org/10.1109/CIT.2017.62","url":null,"abstract":"This paper studied downlink multicasting in a wirelessly powered communication network, where multiple energy-constrained relay nodes collaboratively assist the transmissions from a multi-antenna hybrid access point (HAP) to multiple receivers in the downlink. Each relay is equipped with a single antenna and capable of energy harvesting (EH) from the HAP's RF signals in a power splitting protocol. Due to the confliction between EH and information transmission at the relays, they need to optimally control the power splitting ratio, according to the relays' channel conditions and energy status, with the aim of improving the signal-to-noise ratio (SNR) at all receivers. We propose a SNR maximization problem by jointly optimizing the HAP's signal beamforming and the relays' EH parameters. Though it is non-convex and difficult to solve optimally, we design an iterative algorithm by efficiently solving semi-definite programs successively. Simulation results show the efficacy of the proposed algorithm and validate our findings that relays will choose not to broadcast signal when its channel condition is poor.","PeriodicalId":378423,"journal":{"name":"2017 IEEE International Conference on Computer and Information Technology (CIT)","volume":"95 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":"114161900","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":"Indoor Localization Using Ambient FM Radio RSS Fingerprinting: A 9-Month Study","authors":"A. Popleteev","doi":"10.1109/CIT.2017.57","DOIUrl":"https://doi.org/10.1109/CIT.2017.57","url":null,"abstract":"While indoor positioning systems aspire for higher accuracy, their coverage is typically limited to buildings with dedicated hardware. A possible alternative is offered by infrastructure-free positioning methods. In particular, several studies have demonstrated feasibility of indoor positioning using broadcast FM radio signals, which are available in most populated areas worldwide. However, previous work provides little information about long-term performance of FM-based indoor localization.This paper presents a longitudinal study of FM indoor positioning based on received signal strength (RSS) fingerprinting. We evaluate system's performance on a large dataset of real-world FM signals, systematically collected in several large-scale multi-floor testbeds over the course of 9 months. We also investigate the impact of different classifiers, training schedules and fingerprint sizes on localization accuracy. The results demonstrate that well-trained FM-based system can provide reliable indoor positioning even several months after deployment.","PeriodicalId":378423,"journal":{"name":"2017 IEEE International Conference on Computer and Information Technology (CIT)","volume":"390 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":"115207001","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}
N. Gois, Pedro Porfírio Muniz de Farias, André L. V. Coelho
{"title":"A Multi-objective Metaheuristic Approach to Search-Based Stress Testing","authors":"N. Gois, Pedro Porfírio Muniz de Farias, André L. V. Coelho","doi":"10.1109/CIT.2017.19","DOIUrl":"https://doi.org/10.1109/CIT.2017.19","url":null,"abstract":"Nowadays applications need to deal with a large number of concurrent requests. These systems must be stress tested to ensure that they can function correctly under a load. In this context, a research field called Search-based Software Testing has become increasingly important. Most of the search-based test methods are based on single objective optimization. In the case of multi-objective optimization of tests, usually researchers assign different weight values to different objectives and combine them as a single objective. This research paper verifies the use of a multi-objective algorithm in search-based stress testing. The NSGA-II algorithm was implemented in the IAdapter tool using the jMetal framework. IAdapter is a JMeter plugin used for performing search-based stress tests. jMetal is an object-oriented Java-based framework for multi-objective optimization with metaheuristics. One experiment was conducted to validate the proposed approach.","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":"124827644","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":"Dynamic MAC Protocol for Tactical Data Links","authors":"Zhe Guo, Zheng Yan","doi":"10.1109/CIT.2017.43","DOIUrl":"https://doi.org/10.1109/CIT.2017.43","url":null,"abstract":"Tactical Data Links (TDLs) enable a military to exchange tactical information in a precise, efficient and timely manner. With the development of military information technologies, the data rate and the number of nodes participated in a network are experiencing explosive growth. Traditional TDLs medium access control (MAC) layer lacks sufficient flexibility, thus cannot meet the demand of real-time communications and efficiency. In this paper, a dynamic MAC (D-MAC) protocol is presented. With a Bayesian-estimation-based algorithm, the D-MAC adaptively selects the most high-priority packets to transmit. Meanwhile, the D-MAC divides all time-slots into fix slots and dynamic slots in order to increase the ratio of channel utilization. Those nodes with high-priority would occupy as more dynamic slots and transmit as more data as possible. The simulation results demonstrate that the D-MAC can efficiently use radio channel resources and achieve good performance.","PeriodicalId":378423,"journal":{"name":"2017 IEEE International Conference on Computer and Information Technology (CIT)","volume":"1 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":"117054429","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}