In the past decade, the role of data has increased exponentially from something that is queried or reported on, to becoming a true corporate asset. The same time period has also seen marked growth in corporate structural complexity. This combination has lead to information management challenges, as the data moving across a multitude of systems lends itself to a higher likelihood of impacting dependent processes and systems, should something go wrong or be changed. Many enterprise data projects are faced with low success rates and consequently subject to high amounts of scrutiny as senior leadership struggles to identify return on investment. While there are many tools and methods to increase a companies' ability to govern data, this research is based on the premise that you can not govern what you do not know. This lack of awareness of the corporate data landscape impacts the ability to govern data, which in turn impacts overall data quality within organizations. This paper seeks to propose a tools and techniques for companies to better gain an awareness of the landscape of their data, processes, and organizational attributes through the use of linked data, via the Resource Description Framework (RDF) and ontology. The outcome of adopting such techniques is an increased level of data awareness within the organization, resulting in improved ability to govern corporate data assets, and in turn increased data quality.
{"title":"Improving Data Governance in Large Organizations through Ontology and Linked Data","authors":"R. DeStefano, Lixin Tao, Keke Gai","doi":"10.1109/CSCloud.2016.47","DOIUrl":"https://doi.org/10.1109/CSCloud.2016.47","url":null,"abstract":"In the past decade, the role of data has increased exponentially from something that is queried or reported on, to becoming a true corporate asset. The same time period has also seen marked growth in corporate structural complexity. This combination has lead to information management challenges, as the data moving across a multitude of systems lends itself to a higher likelihood of impacting dependent processes and systems, should something go wrong or be changed. Many enterprise data projects are faced with low success rates and consequently subject to high amounts of scrutiny as senior leadership struggles to identify return on investment. While there are many tools and methods to increase a companies' ability to govern data, this research is based on the premise that you can not govern what you do not know. This lack of awareness of the corporate data landscape impacts the ability to govern data, which in turn impacts overall data quality within organizations. This paper seeks to propose a tools and techniques for companies to better gain an awareness of the landscape of their data, processes, and organizational attributes through the use of linked data, via the Resource Description Framework (RDF) and ontology. The outcome of adopting such techniques is an increased level of data awareness within the organization, resulting in improved ability to govern corporate data assets, and in turn increased data quality.","PeriodicalId":410477,"journal":{"name":"2016 IEEE 3rd International Conference on Cyber Security and Cloud Computing (CSCloud)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122556802","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}
Recent quick expansions of mobile heterogeneous embedded systems have led to a remarkable hardware upgrade that support multiple core processors. The energy consumption is becoming greater along with the computation capacity grows. Cloud computing is considered one of the solutions to mitigating energy costs. However, the simply offloading the computations to the remote side cannot efficiently reduce the energy consumptions when the energy costs caused by wireless communications are greater than it is on mobile devices. In this paper, we focus on the problem of energy wastes when tasks are assigned to remote cloud servers or heterogeneous core processors. Our solution aims to minimize the total energy cost of the mobile heterogeneous embedded systems by using an optimal task assignment to heterogeneous cores and mobile clouds. The propose model is named as Energy-Aware Heterogeneous Resource Management Model (EA-HRM2), which is supported by a main algorithm Optimal Heterogeneous Task Assignment (OHTA) algorithm. Our experimental evaluations have proved our approach is effective to save energy when deploying heterogenous embedded systems in mobile cloud systems.
{"title":"Energy-Aware Optimal Task Assignment for Mobile Heterogeneous Embedded Systems in Cloud Computing","authors":"Keke Gai, Meikang Qiu, Hui Zhao, Meiqin Liu","doi":"10.1109/CSCloud.2016.48","DOIUrl":"https://doi.org/10.1109/CSCloud.2016.48","url":null,"abstract":"Recent quick expansions of mobile heterogeneous embedded systems have led to a remarkable hardware upgrade that support multiple core processors. The energy consumption is becoming greater along with the computation capacity grows. Cloud computing is considered one of the solutions to mitigating energy costs. However, the simply offloading the computations to the remote side cannot efficiently reduce the energy consumptions when the energy costs caused by wireless communications are greater than it is on mobile devices. In this paper, we focus on the problem of energy wastes when tasks are assigned to remote cloud servers or heterogeneous core processors. Our solution aims to minimize the total energy cost of the mobile heterogeneous embedded systems by using an optimal task assignment to heterogeneous cores and mobile clouds. The propose model is named as Energy-Aware Heterogeneous Resource Management Model (EA-HRM2), which is supported by a main algorithm Optimal Heterogeneous Task Assignment (OHTA) algorithm. Our experimental evaluations have proved our approach is effective to save energy when deploying heterogenous embedded systems in mobile cloud systems.","PeriodicalId":410477,"journal":{"name":"2016 IEEE 3rd International Conference on Cyber Security and Cloud Computing (CSCloud)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131252118","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}
Big data has revealed itself as a powerful tool for many sectors ranging from science to business. Distributed data-parallel computing is then common nowadays: using a large number of computing and storage resources makes possible data processing of a yet unknown scale. But to develop large-scale distributed big data processing, we have to tackle many challenges. One of the most complex is scheduling. As it is known to be an optimal online scheduling policy when it comes to minimize the average flowtime, Shortest Processing Time First (SPT) is a classic scheduling policy used in many systems. We then decided to integrate this policy into Hadoop, a framework for big data processing, and realize an implementation prototype. This paper describes this integration, as well as tests results obtained on our testbed.
{"title":"Shortest Processing Time First Algorithm for Hadoop","authors":"Laurent Bobelin, P. Martineau, Di Zhao, Haiwu He","doi":"10.1109/CSCloud.2016.12","DOIUrl":"https://doi.org/10.1109/CSCloud.2016.12","url":null,"abstract":"Big data has revealed itself as a powerful tool for many sectors ranging from science to business. Distributed data-parallel computing is then common nowadays: using a large number of computing and storage resources makes possible data processing of a yet unknown scale. But to develop large-scale distributed big data processing, we have to tackle many challenges. One of the most complex is scheduling. As it is known to be an optimal online scheduling policy when it comes to minimize the average flowtime, Shortest Processing Time First (SPT) is a classic scheduling policy used in many systems. We then decided to integrate this policy into Hadoop, a framework for big data processing, and realize an implementation prototype. This paper describes this integration, as well as tests results obtained on our testbed.","PeriodicalId":410477,"journal":{"name":"2016 IEEE 3rd International Conference on Cyber Security and Cloud Computing (CSCloud)","volume":"427 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133888501","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}
Internet of vehicles(IOV) is an application of Internet of things in Intelligent Transport System, and has attracted high attention of researchers. IOV brings network connectivity to traditional vehicles, while also introduces security risks. This paper presents experimental analysis on the security of vehicles with Internet connections and propose an approach to Controlling a Car Through OBD Injection. In the experiments, we successfully penetrated several types of cars in a wireless way. We also put out a multi-level safety model of cars, which divides cars into different groups and gives analysis and explanations of each group. All of these things are done for indicating a point of view that traditional cars are not safe enough on information security. It is surely risky to put a car without the ability to resist the attack of informational ways into the Internet of vehicles.
{"title":"Controlling a Car Through OBD Injection","authors":"Yu Zhang, Binbin Ge, Xiang Li, Bin Shi, Bo Li","doi":"10.1109/CSCloud.2016.42","DOIUrl":"https://doi.org/10.1109/CSCloud.2016.42","url":null,"abstract":"Internet of vehicles(IOV) is an application of Internet of things in Intelligent Transport System, and has attracted high attention of researchers. IOV brings network connectivity to traditional vehicles, while also introduces security risks. This paper presents experimental analysis on the security of vehicles with Internet connections and propose an approach to Controlling a Car Through OBD Injection. In the experiments, we successfully penetrated several types of cars in a wireless way. We also put out a multi-level safety model of cars, which divides cars into different groups and gives analysis and explanations of each group. All of these things are done for indicating a point of view that traditional cars are not safe enough on information security. It is surely risky to put a car without the ability to resist the attack of informational ways into the Internet of vehicles.","PeriodicalId":410477,"journal":{"name":"2016 IEEE 3rd International Conference on Cyber Security and Cloud Computing (CSCloud)","volume":"617 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116211260","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}
This paper looks at cyber security threats to cyber banking in South Africa. Cyber-attacks on information systems, especially financial systems have been a common phenomenon in recent times. This phenomenon has spurred financial institutions in South Africa to look at risk management as a crucial entity in their business model. Continuous investment in up-to-date security measures and technologies helps to prevent heavy financial and information loses that may be caused by cyber-attacks. The growth of cyber-crimes is becoming a serious economic issue to South African organizations in particular and the country as a whole. This paper begins by analyzing the various cyber threats involved in cyber banking. Secondly, it proposes a cyber-banking security architecture, with the boundary and application security. The boundary security architecture comprises of four components and the application security proposes strategies to avoid vulnerabilities. Lastly this paper proposes a cyber-banking security framework to be adopted by financial institutions.
{"title":"Cyber Security, a Threat to Cyber Banking in South Africa: An Approach to Network and Application Security","authors":"Thierry Mbah Mbelli, B. Dwolatzky","doi":"10.1109/CSCloud.2016.18","DOIUrl":"https://doi.org/10.1109/CSCloud.2016.18","url":null,"abstract":"This paper looks at cyber security threats to cyber banking in South Africa. Cyber-attacks on information systems, especially financial systems have been a common phenomenon in recent times. This phenomenon has spurred financial institutions in South Africa to look at risk management as a crucial entity in their business model. Continuous investment in up-to-date security measures and technologies helps to prevent heavy financial and information loses that may be caused by cyber-attacks. The growth of cyber-crimes is becoming a serious economic issue to South African organizations in particular and the country as a whole. This paper begins by analyzing the various cyber threats involved in cyber banking. Secondly, it proposes a cyber-banking security architecture, with the boundary and application security. The boundary security architecture comprises of four components and the application security proposes strategies to avoid vulnerabilities. Lastly this paper proposes a cyber-banking security framework to be adopted by financial institutions.","PeriodicalId":410477,"journal":{"name":"2016 IEEE 3rd International Conference on Cyber Security and Cloud Computing (CSCloud)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122395959","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}
The correctness of implementation codes is important especially for safety-critical software usually written in C programming language. We present a correctness verification method (CVM for short) for C codes based on an automatic theorem proving tool-VCC, and propose a specification simplification method to im-prove the correctness and readability of verification specification codes. Using CVM method, the scheduling module of a real-time operating system FreeRTOS6.1.1 is verified, which shows the feasibility and effectiveness when CVM method is applied to the real production software. Experiments show that the CVM method is feasible and effective in verifying the correctness the C codes, and the specification simplification method is also effective.
{"title":"A Correctness Verification Method for C Programs Based on VCC","authors":"Hongliang Liang, Daijie Zhang, Xiaoxiao Pei, Xiaodong Jia, Guangyuan Li, Jiuyun Xu","doi":"10.1109/CSCloud.2016.30","DOIUrl":"https://doi.org/10.1109/CSCloud.2016.30","url":null,"abstract":"The correctness of implementation codes is important especially for safety-critical software usually written in C programming language. We present a correctness verification method (CVM for short) for C codes based on an automatic theorem proving tool-VCC, and propose a specification simplification method to im-prove the correctness and readability of verification specification codes. Using CVM method, the scheduling module of a real-time operating system FreeRTOS6.1.1 is verified, which shows the feasibility and effectiveness when CVM method is applied to the real production software. Experiments show that the CVM method is feasible and effective in verifying the correctness the C codes, and the specification simplification method is also effective.","PeriodicalId":410477,"journal":{"name":"2016 IEEE 3rd International Conference on Cyber Security and Cloud Computing (CSCloud)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117075795","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}
Zhiping Peng, Delong Cui, Yuanjia Ma, Jianbin Xiong, Bo Xu, Weiwei Lin
Job scheduling is a necessary prerequisite for performance optimization and resource management in the cloud computing system. Focusing on accurate scaled cloud computing environment and efficient job scheduling under Virtual Machine (VM) resource and Server Level Agreement (SLA) constraints, we introduce the architecture of cloud computing platform and optimization job scheduling scheme in this study. The system model is comprised of clearly defined separate constituent parts, including portal, job scheduler, and resources pool. By analyzing the execution process of user jobs, we designed a novel job scheduling scheme based on reinforcement learning to minimize the makespan and Average Waiting Time (AWT) under the VM resource and deadline constraints, and employ parallel multi-age parallel technologies to balance the exploration and exploitation in learning process and accelerate the convergence of Q-learning algorithm. Both statistical and numerical analysis results demonstrate the efficiency of the proposed job scheduling scheme.
{"title":"A Reinforcement Learning-Based Mixed Job Scheduler Scheme for Cloud Computing under SLA Constraint","authors":"Zhiping Peng, Delong Cui, Yuanjia Ma, Jianbin Xiong, Bo Xu, Weiwei Lin","doi":"10.1109/CSCloud.2016.16","DOIUrl":"https://doi.org/10.1109/CSCloud.2016.16","url":null,"abstract":"Job scheduling is a necessary prerequisite for performance optimization and resource management in the cloud computing system. Focusing on accurate scaled cloud computing environment and efficient job scheduling under Virtual Machine (VM) resource and Server Level Agreement (SLA) constraints, we introduce the architecture of cloud computing platform and optimization job scheduling scheme in this study. The system model is comprised of clearly defined separate constituent parts, including portal, job scheduler, and resources pool. By analyzing the execution process of user jobs, we designed a novel job scheduling scheme based on reinforcement learning to minimize the makespan and Average Waiting Time (AWT) under the VM resource and deadline constraints, and employ parallel multi-age parallel technologies to balance the exploration and exploitation in learning process and accelerate the convergence of Q-learning algorithm. Both statistical and numerical analysis results demonstrate the efficiency of the proposed job scheduling scheme.","PeriodicalId":410477,"journal":{"name":"2016 IEEE 3rd International Conference on Cyber Security and Cloud Computing (CSCloud)","volume":"42 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132236905","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}
Cloud computing is a new paradigm that provides computing, storage and networking services to end users. Data distribution for cloud computing is different from that in traditional content distribution networks in that it has a direct implication on efficiency of using cloud resources. In this paper we propose a new block-based data distribution mechanism for cloud computing. Instead of using the whole file as a unit of delivery, we divide a file into blocks to improve the efficiency. We design a scheduling algorithm to manage the delivery of blocks to all receivers. The novel aspect of the algorithm is that it can achieve constant distribution time no matter how many receivers need to get the file. We further analyze the overhead caused by dividing a file into blocks. The performance results show that our mechanism can significantly reduce the distribution time, compared with the traditional method and a non-block-based method.
{"title":"A New Block-Based Data Distribution Mechanism in Cloud Computing","authors":"Chandrima Dadi, P. Yi, Zongming Fei, Hui Lu","doi":"10.1109/CSCloud.2016.25","DOIUrl":"https://doi.org/10.1109/CSCloud.2016.25","url":null,"abstract":"Cloud computing is a new paradigm that provides computing, storage and networking services to end users. Data distribution for cloud computing is different from that in traditional content distribution networks in that it has a direct implication on efficiency of using cloud resources. In this paper we propose a new block-based data distribution mechanism for cloud computing. Instead of using the whole file as a unit of delivery, we divide a file into blocks to improve the efficiency. We design a scheduling algorithm to manage the delivery of blocks to all receivers. The novel aspect of the algorithm is that it can achieve constant distribution time no matter how many receivers need to get the file. We further analyze the overhead caused by dividing a file into blocks. The performance results show that our mechanism can significantly reduce the distribution time, compared with the traditional method and a non-block-based method.","PeriodicalId":410477,"journal":{"name":"2016 IEEE 3rd International Conference on Cyber Security and Cloud Computing (CSCloud)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125928775","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}
With the rapid increase of mobile devices, the computing load of roadside cloudlets is fast growing. When the computation tasks of the roadside cloudlet reach the limit, the overload may generate heat radiation problem and unacceptable delay to mobile users. In this paper, we leverage the characteristics of buses and propose a scalable fog computing paradigm with servicing offloading in bus networks. The bus fog servers not only provide fog computing services for the mobile users on bus, but also are motivated to accomplish the computation tasks offloaded by roadside cloudlets. By this way, the computing capability of roadside cloudlets is significantly extended. We consider an allocation strategy using genetic algorithm (GA). With this strategy, the roadside cloudlets spend the least cost to offload their computation tasks. Meanwhile, the user experience of mobile users are maintained. The simulations validate the advantage of the propose scheme.
{"title":"Scalable Fog Computing with Service Offloading in Bus Networks","authors":"Dongdong Ye, Maoqiang Wu, Shensheng Tang, Rong Yu","doi":"10.1109/CSCloud.2016.34","DOIUrl":"https://doi.org/10.1109/CSCloud.2016.34","url":null,"abstract":"With the rapid increase of mobile devices, the computing load of roadside cloudlets is fast growing. When the computation tasks of the roadside cloudlet reach the limit, the overload may generate heat radiation problem and unacceptable delay to mobile users. In this paper, we leverage the characteristics of buses and propose a scalable fog computing paradigm with servicing offloading in bus networks. The bus fog servers not only provide fog computing services for the mobile users on bus, but also are motivated to accomplish the computation tasks offloaded by roadside cloudlets. By this way, the computing capability of roadside cloudlets is significantly extended. We consider an allocation strategy using genetic algorithm (GA). With this strategy, the roadside cloudlets spend the least cost to offload their computation tasks. Meanwhile, the user experience of mobile users are maintained. The simulations validate the advantage of the propose scheme.","PeriodicalId":410477,"journal":{"name":"2016 IEEE 3rd International Conference on Cyber Security and Cloud Computing (CSCloud)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115558939","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}
Cyberlearning is challenged by the lack of personal and assessment-driven learning, and students are often puzzled by the lack of instructor guidance and feedback, the huge volume and diversity of the learning materials, and thelack of the ability to zoom in from the general concepts to the more specific ones, or the opposite. Intelligent tutoring systems are needed to improve the cyberlearning quality. One of the major difficulties is knowledge representation. The current industry standard is to use Web Ontology Language (OWL) for representing knowledge structure. But OWL only supports one "first-class" relation, "is-a", between the concepts, and different knowledge areas usually need different custom relations to describe the relations among the concepts. For example "part-of" and time dependency are important relations torepresent most engineering knowledge bodies. OWL has to use object properties to emulate such custom relations, leading to awkward knowledge representation hard for domain experts to code, validate and use such knowledge bases. This research uses Pace University's extension to OWL, named Knowledge Graph (KG), to support knowledge representation with custom relations. The instructors can use Pace University extended Protege IDE to declare and apply custom relations in a single document. The instructor teaching experience is also coded in the KG to better support custom learning order by students with different backgrounds. The prototype of a knowledge-driven tutoring system was designed and implemented to illustrate how the KG supports integrated assessments, using assessment results to custom student learning order or material, and let the students freely navigate in the knowledge space from general to specific or the opposite, and following various custom relations. A web technology tutorial is used to validate the design and effectiveness of this approach.
网络学习面临的挑战是缺乏个人和评估驱动的学习，学生经常被缺乏讲师的指导和反馈、学习材料的巨大数量和多样性、缺乏从一般概念到更具体概念的放大能力或相反的能力所困惑。提高网络学习质量需要智能辅导系统。其中一个主要的困难是知识表示。目前的行业标准是使用Web Ontology Language (OWL)来表示知识结构。但是OWL只支持概念之间的一个“一级”关系“is-a”，并且不同的知识领域通常需要不同的自定义关系来描述概念之间的关系。例如，“部分”和时间依赖关系是表示大多数工程知识体的重要关系。OWL必须使用对象属性来模拟这样的自定义关系，这使得领域专家难以编码、验证和使用这样的知识库。本研究使用佩斯大学对OWL的扩展知识图谱(Knowledge Graph, KG)来支持基于自定义关系的知识表示。教师可以使用Pace University扩展的Protege IDE在单个文档中声明和应用自定义关系。教师的教学经验也被编码在KG中，以更好地支持不同背景的学生自定义学习顺序。设计并实现了知识驱动型辅导系统的原型，以说明KG如何支持综合评估，利用评估结果定制学生的学习顺序或材料，让学生在知识空间中自由导航，从一般到特定或相反，遵循各种定制关系。一个网络技术教程被用来验证这种方法的设计和有效性。
{"title":"A Semantic Approach to Intelligent and Personal Tutoring System","authors":"Maria Sette, Lixin Tao, Keke Gai, Ning Jiang","doi":"10.1109/CSCloud.2016.50","DOIUrl":"https://doi.org/10.1109/CSCloud.2016.50","url":null,"abstract":"Cyberlearning is challenged by the lack of personal and assessment-driven learning, and students are often puzzled by the lack of instructor guidance and feedback, the huge volume and diversity of the learning materials, and thelack of the ability to zoom in from the general concepts to the more specific ones, or the opposite. Intelligent tutoring systems are needed to improve the cyberlearning quality. One of the major difficulties is knowledge representation. The current industry standard is to use Web Ontology Language (OWL) for representing knowledge structure. But OWL only supports one \"first-class\" relation, \"is-a\", between the concepts, and different knowledge areas usually need different custom relations to describe the relations among the concepts. For example \"part-of\" and time dependency are important relations torepresent most engineering knowledge bodies. OWL has to use object properties to emulate such custom relations, leading to awkward knowledge representation hard for domain experts to code, validate and use such knowledge bases. This research uses Pace University's extension to OWL, named Knowledge Graph (KG), to support knowledge representation with custom relations. The instructors can use Pace University extended Protege IDE to declare and apply custom relations in a single document. The instructor teaching experience is also coded in the KG to better support custom learning order by students with different backgrounds. The prototype of a knowledge-driven tutoring system was designed and implemented to illustrate how the KG supports integrated assessments, using assessment results to custom student learning order or material, and let the students freely navigate in the knowledge space from general to specific or the opposite, and following various custom relations. A web technology tutorial is used to validate the design and effectiveness of this approach.","PeriodicalId":410477,"journal":{"name":"2016 IEEE 3rd International Conference on Cyber Security and Cloud Computing (CSCloud)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114368330","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
扫码关注我们
求助内容：
应助结果提醒方式：