In this paper we present the design, development and implementation of the pervasive learning system for children. The required hardware is a Near Field Communication (NFC)-enabled mobile phone with built-in accelerometer. Trainers (teachers or parents) describe the objects from the learning environment through their voice and associate this voice-based description to a specific object by using the radio frequency identification (RFID) tags. They are able to sync their audio recordings, to share and re-associate with their own RFID tags (clone) audio recordings of other trainers through Google App Engine cloud environment. Children can later use the service to scan surrounding augmented objects and verbalize their identity and characteristics. The service allows the development of a variety of learning scenarios, such as getting started with the colors, letters and numbers, shape recognition, recognition of objects from learning environment, learning foreign languages, and many others. Interaction between children and objects from learning environment should be simple and intuitive. To meet this goal for invisible computing, we simulate human-human interaction than use well known human-computer interaction models. We use a tangible user interface (TUI) based on following interaction techniques: touch, gesture recognition, natural voice-based output. Preliminary results show that the service can be used easily by young children, thanks to its tangible interface that is simple, easy to use, useful, accessible and invisible to technology.
{"title":"NFC-based pervasive learning service for children","authors":"R. Ivanov","doi":"10.1145/2516775.2516804","DOIUrl":"https://doi.org/10.1145/2516775.2516804","url":null,"abstract":"In this paper we present the design, development and implementation of the pervasive learning system for children. The required hardware is a Near Field Communication (NFC)-enabled mobile phone with built-in accelerometer. Trainers (teachers or parents) describe the objects from the learning environment through their voice and associate this voice-based description to a specific object by using the radio frequency identification (RFID) tags. They are able to sync their audio recordings, to share and re-associate with their own RFID tags (clone) audio recordings of other trainers through Google App Engine cloud environment. Children can later use the service to scan surrounding augmented objects and verbalize their identity and characteristics. The service allows the development of a variety of learning scenarios, such as getting started with the colors, letters and numbers, shape recognition, recognition of objects from learning environment, learning foreign languages, and many others. Interaction between children and objects from learning environment should be simple and intuitive. To meet this goal for invisible computing, we simulate human-human interaction than use well known human-computer interaction models. We use a tangible user interface (TUI) based on following interaction techniques: touch, gesture recognition, natural voice-based output. Preliminary results show that the service can be used easily by young children, thanks to its tangible interface that is simple, easy to use, useful, accessible and invisible to technology.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128546457","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}
In this paper we propose a model of load traffic with variable intensity for a switch node. Our model is based on a family of periodic input patterns (PI-patterns) for uniform traffic. We have used the family of patterns in order to study the throughput of a crossbar switch node. Our simulation studies use the Generalized Nets (GN) model of the known PIM-algorithm. The simulation results of a GN-model using the family of PI-Patterns are presented and analyzed. It is shown that our family of patterns for variable traffic intensity enables us to estimate the maximal throughput of the switch in case of uniform traffic.
{"title":"A computer modeling of the throughput of a crossbar switch by PI-patterns for uniform traffic with variable intensity","authors":"T. Tashev, V. Monov","doi":"10.1145/2516775.2516790","DOIUrl":"https://doi.org/10.1145/2516775.2516790","url":null,"abstract":"In this paper we propose a model of load traffic with variable intensity for a switch node. Our model is based on a family of periodic input patterns (PI-patterns) for uniform traffic. We have used the family of patterns in order to study the throughput of a crossbar switch node. Our simulation studies use the Generalized Nets (GN) model of the known PIM-algorithm. The simulation results of a GN-model using the family of PI-Patterns are presented and analyzed. It is shown that our family of patterns for variable traffic intensity enables us to estimate the maximal throughput of the switch in case of uniform traffic.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125209002","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 goal of our research is the design and implementation of a surveillance system based on an Automatic Identification System (AIS). The AIS system enables operators in a control room to monitor ship movements in and along the harbour. There is a need to support human operators. The automated system is modelled after human operator. The transitions between the four steps Observation-Orientation-Decision-Action (OODA-loop) are realised using a rule based expert system and Bayesian networks. The design, implementation and results of experiments are reported in the paper.
{"title":"A surveillance system of a military harbour using an automatic identification system","authors":"L. Rothkrantz, K. Scholte","doi":"10.1145/2516775.2516785","DOIUrl":"https://doi.org/10.1145/2516775.2516785","url":null,"abstract":"The goal of our research is the design and implementation of a surveillance system based on an Automatic Identification System (AIS). The AIS system enables operators in a control room to monitor ship movements in and along the harbour. There is a need to support human operators. The automated system is modelled after human operator. The transitions between the four steps Observation-Orientation-Decision-Action (OODA-loop) are realised using a rule based expert system and Bayesian networks. The design, implementation and results of experiments are reported in the paper.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114595086","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}
In this paper a practical multifactor modelling system is described implementing heuristic searching of polynomial formula that describe an unpredictable time series by a set of predictable series. The data needed for the calculations are pre-processed by a cloud computing system to fill the missing values. The features and problems of both pre-processing and formula searching systems are presented and analyzed.
{"title":"Multifactor modelling system with cloud based pre-processing","authors":"Ventsislav Nikolov, Danko Naydenov","doi":"10.1145/2516775.2516802","DOIUrl":"https://doi.org/10.1145/2516775.2516802","url":null,"abstract":"In this paper a practical multifactor modelling system is described implementing heuristic searching of polynomial formula that describe an unpredictable time series by a set of predictable series. The data needed for the calculations are pre-processed by a cloud computing system to fill the missing values. The features and problems of both pre-processing and formula searching systems are presented and analyzed.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128897244","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}
Ioannis Chionis, Maria Chroni, Stavros D. Nikolopoulos
We have recently presented an efficient codec system for encoding a watermark number w as a reducible permutation graph F [π*], through the use of self-inverting permutations π* and proposed a dynamic watermarking model, which we named WaterRpg, for embedding the watermark graph F [π*] into an application program P. In this paper, we implement our watermarking model WaterRpg in real application programs, taken from a game database, and evaluate its functionality under various watermarking issues supported by our WaterRpg model. More precisely, we selected a number of Java application programs and watermark them using two main approaches. First, we show in detail a straightforward or naive approach for watermarking a given program P which is based only on the well-defined call patterns of our model, and then we prove structural and programming properties of the call patterns based on which we can watermark the program P in a more stealthy way. The experimental results show the efficient functionality of all the programs P* watermarked under the naive-case and all the stealthy-cases. The size and the time overhead of the propose watermarking are very low.
{"title":"Watermarking Java application programs using the WaterRpg dynamic model","authors":"Ioannis Chionis, Maria Chroni, Stavros D. Nikolopoulos","doi":"10.1145/2516775.2516819","DOIUrl":"https://doi.org/10.1145/2516775.2516819","url":null,"abstract":"We have recently presented an efficient codec system for encoding a watermark number w as a reducible permutation graph F [π*], through the use of self-inverting permutations π* and proposed a dynamic watermarking model, which we named WaterRpg, for embedding the watermark graph F [π*] into an application program P. In this paper, we implement our watermarking model WaterRpg in real application programs, taken from a game database, and evaluate its functionality under various watermarking issues supported by our WaterRpg model. More precisely, we selected a number of Java application programs and watermark them using two main approaches. First, we show in detail a straightforward or naive approach for watermarking a given program P which is based only on the well-defined call patterns of our model, and then we prove structural and programming properties of the call patterns based on which we can watermark the program P in a more stealthy way. The experimental results show the efficient functionality of all the programs P* watermarked under the naive-case and all the stealthy-cases. The size and the time overhead of the propose watermarking are very low.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130216996","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 paper presents a working prototype of an adaptive learning management system (LMS) and a generalized schema for achieving process awareness in an LMS (or other type of system). Further, it proposes a reference implementation to the generalized schema based on the open-source computer learning environment Moodle and achieves adaptability by utilizing the Workflow Management System Activiti.
{"title":"Supporting adaptive e-Learning: an approach based on open-source learning management systems","authors":"Hristo Indzhov, Polina Zhelyazkova, G. Totkov","doi":"10.1145/2516775.2516815","DOIUrl":"https://doi.org/10.1145/2516775.2516815","url":null,"abstract":"The paper presents a working prototype of an adaptive learning management system (LMS) and a generalized schema for achieving process awareness in an LMS (or other type of system). Further, it proposes a reference implementation to the generalized schema based on the open-source computer learning environment Moodle and achieves adaptability by utilizing the Workflow Management System Activiti.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128706462","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}
In this paper an exact QRS detection algorithm of Holter electrocardiogram signals using Wavelet Transform is present. The orthogonal wavelet functions -- Haar and Daubechies -- is studied and compared. Analysis is carried out using Visual C++ Software. The results show that the described algorithm provides excellent QRS detection even if the signals are contaminated with noises. The presented algorithm is less computationally involved. This makes it ideal for wide range of diagnostic applications, especially for real-time Holter monitoring.
{"title":"QRS detection algorithm for long term Holter records","authors":"G. Georgieva-Tsaneva","doi":"10.1145/2516775.2516811","DOIUrl":"https://doi.org/10.1145/2516775.2516811","url":null,"abstract":"In this paper an exact QRS detection algorithm of Holter electrocardiogram signals using Wavelet Transform is present. The orthogonal wavelet functions -- Haar and Daubechies -- is studied and compared. Analysis is carried out using Visual C++ Software. The results show that the described algorithm provides excellent QRS detection even if the signals are contaminated with noises. The presented algorithm is less computationally involved. This makes it ideal for wide range of diagnostic applications, especially for real-time Holter monitoring.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116072950","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 describes a concept of an algorithm, which can be used for automated identification of vulnerable parts of web applications based on increased occurrence of anomalies detected by the anomaly-based IDS (Intrusion Detection System). The output of our anomaly evaluation algorithm can direct security engineers and application developers to those modules of a web application, which are "attractive" for the attackers, or even point to some security vulnerabilities in particular modules of the application. The methods of anomaly detection in HTTP traffic and process of building the model of the application's structure by analysis of requested URLs are also discussed in this paper.
{"title":"Identification of vulnerable parts of web applications based on anomaly detection in HTTP","authors":"Rastislav Szabó, L. Hudec","doi":"10.1145/2516775.2516796","DOIUrl":"https://doi.org/10.1145/2516775.2516796","url":null,"abstract":"This paper describes a concept of an algorithm, which can be used for automated identification of vulnerable parts of web applications based on increased occurrence of anomalies detected by the anomaly-based IDS (Intrusion Detection System). The output of our anomaly evaluation algorithm can direct security engineers and application developers to those modules of a web application, which are \"attractive\" for the attackers, or even point to some security vulnerabilities in particular modules of the application. The methods of anomaly detection in HTTP traffic and process of building the model of the application's structure by analysis of requested URLs are also discussed in this paper.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"362 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122851481","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}
Web sites, which enable watching video clips online, have become very popular nowadays. One of the main problems with regard to that is the highly increasing workload of the machines that support those sites. The text describes the structure of Apache HTTP Server and focuses on the parameters that influence the efficiency of its usage. It also carefully considers new opportunities for better service of Apache users' requests. With this respect, the potential of mod_deflate module have been explored. The results obtained from all the conducted experiments are analyzed and graphically presented.
{"title":"Loading test of Apache HTTP server by video file and usage measurements of the hardware components","authors":"Stanislav Dimitrov, T. Stoilov","doi":"10.1145/2516775.2516799","DOIUrl":"https://doi.org/10.1145/2516775.2516799","url":null,"abstract":"Web sites, which enable watching video clips online, have become very popular nowadays. One of the main problems with regard to that is the highly increasing workload of the machines that support those sites. The text describes the structure of Apache HTTP Server and focuses on the parameters that influence the efficiency of its usage. It also carefully considers new opportunities for better service of Apache users' requests. With this respect, the potential of mod_deflate module have been explored. The results obtained from all the conducted experiments are analyzed and graphically presented.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127491450","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}
Network security is an essential part of modern computer systems and networks. There are many aspects of security, but one of the modern features built in some network switches is port security -- a feature preventing network users from address spoofing, network flooding and unauthorized access through switching to another switch port. This feature is offered from some vendors, but usually it is part of the software of most advanced and expensive series switches. This paper aims to propose another implementation of port security features -- using the SNMP protocol.
{"title":"Implementing port security feature using SNMP protocol","authors":"D. Genkov","doi":"10.1145/2516775.2516798","DOIUrl":"https://doi.org/10.1145/2516775.2516798","url":null,"abstract":"Network security is an essential part of modern computer systems and networks. There are many aspects of security, but one of the modern features built in some network switches is port security -- a feature preventing network users from address spoofing, network flooding and unauthorized access through switching to another switch port. This feature is offered from some vendors, but usually it is part of the software of most advanced and expensive series switches. This paper aims to propose another implementation of port security features -- using the SNMP protocol.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134185780","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
扫码关注我们
求助内容：
应助结果提醒方式：