Pub Date : 2011-06-23DOI: 10.1109/ROEDUNET.2011.5993711
Ioan-Alexandru Eftimie, Mircea Bardac, R. Rughinis
Student examination is an important part of the educational process. Although various electronic testing and grading solutions have been developed and gained interest in the last years, classic paper quiz examination is still a preferred method of examination, due to the simplicity of implementation and low technical requirements. Korect is a complete solution for automatic test generation, processing and grading, with inline answer marks, and answer sheet processing using auto feed scanners and OCR detection. This paper presents the research performed for optimizing the preprocessing phase and the scan folder polling during the automatic verification flow. This research brings improved stability and performance for the Korect automatic quiz evaluation solution presented in the paper.
{"title":"Optimizing the workflow for automatic quiz evaluation","authors":"Ioan-Alexandru Eftimie, Mircea Bardac, R. Rughinis","doi":"10.1109/ROEDUNET.2011.5993711","DOIUrl":"https://doi.org/10.1109/ROEDUNET.2011.5993711","url":null,"abstract":"Student examination is an important part of the educational process. Although various electronic testing and grading solutions have been developed and gained interest in the last years, classic paper quiz examination is still a preferred method of examination, due to the simplicity of implementation and low technical requirements. Korect is a complete solution for automatic test generation, processing and grading, with inline answer marks, and answer sheet processing using auto feed scanners and OCR detection. This paper presents the research performed for optimizing the preprocessing phase and the scan folder polling during the automatic verification flow. This research brings improved stability and performance for the Korect automatic quiz evaluation solution presented in the paper.","PeriodicalId":277269,"journal":{"name":"2011 RoEduNet International Conference 10th Edition: Networking in Education and Research","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127532811","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 : 2011-06-23DOI: 10.1109/ROEDUNET.2011.5993706
Tudorica Daniela
This paper is dealing with the problem of communication security for automated systems. This problem became more and more stringent along with the growing use of automation in many technological procedures and keeping the pace with the increase of performance in the digital communications area. In the first part, it is made a critical analysis of a SCADA (Supervisory Control And Data Acquisition) system's vulnerabilities against cyber-attacks, with a case study - a SCADA monitoring system of a pipeline network for oil products transportation. In the second part, there are presented, with advantages and disadvantages, possible solutions for security communication in the system. Cyber-attack is defined as a computer-to-computer attack that undermines the confidentiality, integrity, or availability of a computer or information resident on it.
{"title":"Communication security in SCADA pipeline monitoring systems","authors":"Tudorica Daniela","doi":"10.1109/ROEDUNET.2011.5993706","DOIUrl":"https://doi.org/10.1109/ROEDUNET.2011.5993706","url":null,"abstract":"This paper is dealing with the problem of communication security for automated systems. This problem became more and more stringent along with the growing use of automation in many technological procedures and keeping the pace with the increase of performance in the digital communications area. In the first part, it is made a critical analysis of a SCADA (Supervisory Control And Data Acquisition) system's vulnerabilities against cyber-attacks, with a case study - a SCADA monitoring system of a pipeline network for oil products transportation. In the second part, there are presented, with advantages and disadvantages, possible solutions for security communication in the system. Cyber-attack is defined as a computer-to-computer attack that undermines the confidentiality, integrity, or availability of a computer or information resident on it.","PeriodicalId":277269,"journal":{"name":"2011 RoEduNet International Conference 10th Edition: Networking in Education and Research","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123478877","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 : 2011-06-23DOI: 10.1109/ROEDUNET.2011.5993697
Demeter Robert, Sarkany Istvan
The main purpose of a home automation system is to monitor and control devices from a central location. In this paper, we present the design and implementation of low-cost, flexible and secure home automation system based on SNMP standard protocol, now widely supported by device vendors for their products, such as routers, bridges and printers. Communication between SNMP agents is done on Ethernet and wireless networks. The protocol implemented between the agents is optimized to be suitable for most applications. The system is designed for low-cost and flexibility in order to reuse existing local data communication network.
{"title":"SNMP protocol based home automation system","authors":"Demeter Robert, Sarkany Istvan","doi":"10.1109/ROEDUNET.2011.5993697","DOIUrl":"https://doi.org/10.1109/ROEDUNET.2011.5993697","url":null,"abstract":"The main purpose of a home automation system is to monitor and control devices from a central location. In this paper, we present the design and implementation of low-cost, flexible and secure home automation system based on SNMP standard protocol, now widely supported by device vendors for their products, such as routers, bridges and printers. Communication between SNMP agents is done on Ethernet and wireless networks. The protocol implemented between the agents is optimized to be suitable for most applications. The system is designed for low-cost and flexibility in order to reuse existing local data communication network.","PeriodicalId":277269,"journal":{"name":"2011 RoEduNet International Conference 10th Edition: Networking in Education and Research","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123185362","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 : 2011-06-23DOI: 10.1109/ROEDUNET.2011.5993704
T. Popeea, V. Olteanu, L. Gheorghe, R. Rughinis
Port knocking is a form of host-to-host communication which relies on deliberately failed TCP connection attempts. The information is encoded into a port sequence. The client attempts to initiate several three-way-handshakes and receives no reply. These connection attempts are monitored by a daemon which interprets their destination port numbers as data. This mechanism has vulnerabilities that can be exploited by hackers with the help of data sniffed off the network. Through synchronization, these vulnerabilities can be minimized. A knock sequence is less vulnerable to replay and brute force attacks if its lifespan is shorter. All the entities involved in the knock sequence need to be aware all the time of the knock sequence that can be used. For this, it is required that clients and server share the same time. Both possess the means of the determining the sequence, which consists of a hash based on a preshared key, time value, client IP address and destination port. We present the means to achieve the client-server synchronization and describe an application that implements this.
{"title":"Extension of a port knocking client-server architecture with NTP synchronization","authors":"T. Popeea, V. Olteanu, L. Gheorghe, R. Rughinis","doi":"10.1109/ROEDUNET.2011.5993704","DOIUrl":"https://doi.org/10.1109/ROEDUNET.2011.5993704","url":null,"abstract":"Port knocking is a form of host-to-host communication which relies on deliberately failed TCP connection attempts. The information is encoded into a port sequence. The client attempts to initiate several three-way-handshakes and receives no reply. These connection attempts are monitored by a daemon which interprets their destination port numbers as data. This mechanism has vulnerabilities that can be exploited by hackers with the help of data sniffed off the network. Through synchronization, these vulnerabilities can be minimized. A knock sequence is less vulnerable to replay and brute force attacks if its lifespan is shorter. All the entities involved in the knock sequence need to be aware all the time of the knock sequence that can be used. For this, it is required that clients and server share the same time. Both possess the means of the determining the sequence, which consists of a hash based on a preshared key, time value, client IP address and destination port. We present the means to achieve the client-server synchronization and describe an application that implements this.","PeriodicalId":277269,"journal":{"name":"2011 RoEduNet International Conference 10th Edition: Networking in Education and Research","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126381680","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 : 2011-06-23DOI: 10.1109/ROEDUNET.2011.5993712
Monica Vladoiu
In this paper we overview the state-of-the-art in open courseware initiatives worldwide. First, the MIT OpenCourseWare project is surveyed, as it has been the real starting point of the OCW movement. Generally, open courseware refers to a free and open digital publication of high quality university-level educational materials that are organized as courses, and include course planning materials, evaluation tools, and thematic content, under a Creative Commons license. OCW is free and openly licensed, accessible to anyone, anywhere, anytime via the Internet. The OCW initiative started in 2002, and since then many more projects that offer open access to courseware have been initiated: Carnegie Mellon Open Learning Initiative, Harvard Medical School's MyCourses, Webcast. Berkeley, Rice University's Connexions, OpenCourseWare Consortium, Open Education Resources Commons, and The Saylor Foundation's Free Education Initiative, along with open courseware projects worldwide. All these endeavors boost and contribute to the emerging open educational models.
{"title":"Open courseware initiatives - after 10 years","authors":"Monica Vladoiu","doi":"10.1109/ROEDUNET.2011.5993712","DOIUrl":"https://doi.org/10.1109/ROEDUNET.2011.5993712","url":null,"abstract":"In this paper we overview the state-of-the-art in open courseware initiatives worldwide. First, the MIT OpenCourseWare project is surveyed, as it has been the real starting point of the OCW movement. Generally, open courseware refers to a free and open digital publication of high quality university-level educational materials that are organized as courses, and include course planning materials, evaluation tools, and thematic content, under a Creative Commons license. OCW is free and openly licensed, accessible to anyone, anywhere, anytime via the Internet. The OCW initiative started in 2002, and since then many more projects that offer open access to courseware have been initiated: Carnegie Mellon Open Learning Initiative, Harvard Medical School's MyCourses, Webcast. Berkeley, Rice University's Connexions, OpenCourseWare Consortium, Open Education Resources Commons, and The Saylor Foundation's Free Education Initiative, along with open courseware projects worldwide. All these endeavors boost and contribute to the emerging open educational models.","PeriodicalId":277269,"journal":{"name":"2011 RoEduNet International Conference 10th Edition: Networking in Education and Research","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115040148","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 : 2011-06-23DOI: 10.1109/ROEDUNET.2011.5993698
B. Iancu, V. Dădârlat, A. Peculea, E. Cebuc, C. Ardelean
Quality of service frameworks in computer networks are sets of mechanisms that run over multiple network equipment with the aim of ensuring network services. Several frameworks have been developed using different approaches, each framework showing advantages but also drawbacks. In order to eliminate these shortcomings, a new organization of the bandwidth is proposed and a new framework for ensuring end-to-end quality of service was developed and implemented. The functionalities and performances of the proposed framework were tested and validated through an experimental methodology, using a software system for developing and testing of quality of services sensitive frameworks and technologies.
{"title":"SAR — A self-adaptive QoS aware network layer framework","authors":"B. Iancu, V. Dădârlat, A. Peculea, E. Cebuc, C. Ardelean","doi":"10.1109/ROEDUNET.2011.5993698","DOIUrl":"https://doi.org/10.1109/ROEDUNET.2011.5993698","url":null,"abstract":"Quality of service frameworks in computer networks are sets of mechanisms that run over multiple network equipment with the aim of ensuring network services. Several frameworks have been developed using different approaches, each framework showing advantages but also drawbacks. In order to eliminate these shortcomings, a new organization of the bandwidth is proposed and a new framework for ensuring end-to-end quality of service was developed and implemented. The functionalities and performances of the proposed framework were tested and validated through an experimental methodology, using a software system for developing and testing of quality of services sensitive frameworks and technologies.","PeriodicalId":277269,"journal":{"name":"2011 RoEduNet International Conference 10th Edition: Networking in Education and Research","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121097396","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 : 2011-06-23DOI: 10.1109/ROEDUNET.2011.5993693
Lucian Mihai Itu, C. Suciu, Florin Moldoveanu, A. Postelnicu
The paper describes an optimized GPU based approach for stencil based algorithms. The simulations have been performed for a two dimensional steady state heat conduction problem, which has been solved through the red black point successive over relaxation method. Two kernels have been developed and their performance has been greatly improved through coalesced memory accesses and special shared memory approaches. The approach described in the paper does not only represent a step forward for the steady state heat conduction problem but also for any other algorithm which performs the numerical solution of partial differential equations or which is stencil based. The paper not only describes the various code versions but also the process which has lead to these improvements. Also the optimized GPU code version has been compared with the corresponding CPU version. The testing results show that the GPU algorithm always leads to an improvement. The value of the improvement though greatly depends on the number of grid points on which the computations are performed.
{"title":"GPU optimized computation of stencil based algorithms","authors":"Lucian Mihai Itu, C. Suciu, Florin Moldoveanu, A. Postelnicu","doi":"10.1109/ROEDUNET.2011.5993693","DOIUrl":"https://doi.org/10.1109/ROEDUNET.2011.5993693","url":null,"abstract":"The paper describes an optimized GPU based approach for stencil based algorithms. The simulations have been performed for a two dimensional steady state heat conduction problem, which has been solved through the red black point successive over relaxation method. Two kernels have been developed and their performance has been greatly improved through coalesced memory accesses and special shared memory approaches. The approach described in the paper does not only represent a step forward for the steady state heat conduction problem but also for any other algorithm which performs the numerical solution of partial differential equations or which is stencil based. The paper not only describes the various code versions but also the process which has lead to these improvements. Also the optimized GPU code version has been compared with the corresponding CPU version. The testing results show that the GPU algorithm always leads to an improvement. The value of the improvement though greatly depends on the number of grid points on which the computations are performed.","PeriodicalId":277269,"journal":{"name":"2011 RoEduNet International Conference 10th Edition: Networking in Education and Research","volume":"198 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132341439","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 : 2011-06-23DOI: 10.1109/ROEDUNET.2011.5993679
Ioana Apetroaei, I. Oprea, B. Proca, L. Gheorghe
Wireless sensors have the capacity to gather information like temperature, sound, motion or pollutants, being distribute in an environment that has to be monitored and controlled for many domains like industry, healthcare or military applications. Grouped in networks with one Base Station gathering the useful data, the sensors are characterized by limited battery life and low processing power, which results in a limited network lifetime.
{"title":"Genetic algorithms applied in routing protocols for wireless sensor networks","authors":"Ioana Apetroaei, I. Oprea, B. Proca, L. Gheorghe","doi":"10.1109/ROEDUNET.2011.5993679","DOIUrl":"https://doi.org/10.1109/ROEDUNET.2011.5993679","url":null,"abstract":"Wireless sensors have the capacity to gather information like temperature, sound, motion or pollutants, being distribute in an environment that has to be monitored and controlled for many domains like industry, healthcare or military applications. Grouped in networks with one Base Station gathering the useful data, the sensors are characterized by limited battery life and low processing power, which results in a limited network lifetime.","PeriodicalId":277269,"journal":{"name":"2011 RoEduNet International Conference 10th Edition: Networking in Education and Research","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122650768","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 : 2011-06-23DOI: 10.1109/ROEDUNET.2011.5993702
A. Suciu, P. Cobârzan, K. Marton
The problem of counting the ones of a bit sequence (commonly known as the “popcount” function) is one of the most interesting problems in cryptography. Although it has received attention for a very long time, it was brought back into focus by the new developments in hardware, both for CPUs (SSE 4.2) and for GPUs. The problem is of special interest in the field of testing the quality of random sequences and occurs in the first tests of the NIST battery of statistical tests for randomness. Obviously, for a “good” random sequence we would expect a “popcount” of about half the length of that sequence. Since testing the quality of a random number generator is notoriously computationally intensive we are of course interested in implementing efficiently the “popcount” function. In the present paper we analyze several implementation methods in search of the most efficient one; for now, we restrict our attention to the serial implementations for CPUs.
{"title":"The never ending problem of counting bits efficiently","authors":"A. Suciu, P. Cobârzan, K. Marton","doi":"10.1109/ROEDUNET.2011.5993702","DOIUrl":"https://doi.org/10.1109/ROEDUNET.2011.5993702","url":null,"abstract":"The problem of counting the ones of a bit sequence (commonly known as the “popcount” function) is one of the most interesting problems in cryptography. Although it has received attention for a very long time, it was brought back into focus by the new developments in hardware, both for CPUs (SSE 4.2) and for GPUs. The problem is of special interest in the field of testing the quality of random sequences and occurs in the first tests of the NIST battery of statistical tests for randomness. Obviously, for a “good” random sequence we would expect a “popcount” of about half the length of that sequence. Since testing the quality of a random number generator is notoriously computationally intensive we are of course interested in implementing efficiently the “popcount” function. In the present paper we analyze several implementation methods in search of the most efficient one; for now, we restrict our attention to the serial implementations for CPUs.","PeriodicalId":277269,"journal":{"name":"2011 RoEduNet International Conference 10th Edition: Networking in Education and Research","volume":"43 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125828383","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 : 2011-06-23DOI: 10.1109/ROEDUNET.2011.5993709
E. A. Gamukama, O. Popov
The framework gives the characteristics of what would be the environment of the Internet services provision and usage in view of fostering development in a poor nation. It depicts the current Internet market state of art in most developing nations. Building on the domain of utility theory and the concept of fairness, the characteristics of the network services provision are set to maximize the users satisfaction through a utility fair function that unifies/equalizes the utilities of all users for a given traffic case. The utility value gained from the providers' utility equalization is used as a performance measure of the service delivery to the end-user. The framework strives to characterize the end-users by mapping the utility value to actual benefits that foster a positive social change in one's basic dimensions of life. This mapping is based on the leisure-labour theory that endeavours to explain why people seek some equity in the ability to access the Internet.
{"title":"A framework for achieving optimal benefits from the internet in the context of development","authors":"E. A. Gamukama, O. Popov","doi":"10.1109/ROEDUNET.2011.5993709","DOIUrl":"https://doi.org/10.1109/ROEDUNET.2011.5993709","url":null,"abstract":"The framework gives the characteristics of what would be the environment of the Internet services provision and usage in view of fostering development in a poor nation. It depicts the current Internet market state of art in most developing nations. Building on the domain of utility theory and the concept of fairness, the characteristics of the network services provision are set to maximize the users satisfaction through a utility fair function that unifies/equalizes the utilities of all users for a given traffic case. The utility value gained from the providers' utility equalization is used as a performance measure of the service delivery to the end-user. The framework strives to characterize the end-users by mapping the utility value to actual benefits that foster a positive social change in one's basic dimensions of life. This mapping is based on the leisure-labour theory that endeavours to explain why people seek some equity in the ability to access the Internet.","PeriodicalId":277269,"journal":{"name":"2011 RoEduNet International Conference 10th Edition: Networking in Education and Research","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127252182","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
扫码关注我们
求助内容：
应助结果提醒方式：