In this paper an algorithm based on fractional Brownian motion is used to simulate network traffic. The simulated traffic is compared with real network traffic and the results from the comparison show that they are similar to each other, as the difference between the relative errors of the Hurst parameter of the simulated traffic and the real traffic is less than 2%. Therefore this algorithm could be used for practical simulation research.
{"title":"Simulation of fractal network teletraffic","authors":"Mitko Gospodinov","doi":"10.1145/2516775.2516813","DOIUrl":"https://doi.org/10.1145/2516775.2516813","url":null,"abstract":"In this paper an algorithm based on fractional Brownian motion is used to simulate network traffic. The simulated traffic is compared with real network traffic and the results from the comparison show that they are similar to each other, as the difference between the relative errors of the Hurst parameter of the simulated traffic and the real traffic is less than 2%. Therefore this algorithm could be used for practical simulation research.","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":"115268473","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}
Cezary Bartoszuk, R. Dabrowski, K. Stencel, G. Timoszuk
By an architecture of a software system we mean the fundamental organization of the system embodied in its components, their relationships to one another and to the system's environment. It also encompasses principles governing the system's design and evolution. Architectures of complex systems are obviously complex as well. The goal of our research is to harness this complexity. In this paper we focus on providing software architects with ability to quickly comprehend the complexity and assess the quality of software. The essential tools we use are: (1) a graph-based repository for collecting information on software artefacts, accompanied by (2) tools to perform software intelligence tasks, like analyzing dependencies among those artefacts, calculating their importance, and quality. On top of those tools we implement visualization methods that render the relative importance using size and the quality using colours. By means of such methods a software architect can at glance comprehend and assess the software, He/she can (1) find the starting points to dig into a complex system; (2) judge the cohesion and coupling of system components; and (3) assess the overall quality. We demonstrate this method using selected open-source projects of various sizes and qualities.
{"title":"On quick comprehension and assessment of software","authors":"Cezary Bartoszuk, R. Dabrowski, K. Stencel, G. Timoszuk","doi":"10.1145/2516775.2516806","DOIUrl":"https://doi.org/10.1145/2516775.2516806","url":null,"abstract":"By an architecture of a software system we mean the fundamental organization of the system embodied in its components, their relationships to one another and to the system's environment. It also encompasses principles governing the system's design and evolution. Architectures of complex systems are obviously complex as well. The goal of our research is to harness this complexity. In this paper we focus on providing software architects with ability to quickly comprehend the complexity and assess the quality of software. The essential tools we use are: (1) a graph-based repository for collecting information on software artefacts, accompanied by (2) tools to perform software intelligence tasks, like analyzing dependencies among those artefacts, calculating their importance, and quality. On top of those tools we implement visualization methods that render the relative importance using size and the quality using colours. By means of such methods a software architect can at glance comprehend and assess the software, He/she can (1) find the starting points to dig into a complex system; (2) judge the cohesion and coupling of system components; and (3) assess the overall quality. We demonstrate this method using selected open-source projects of various sizes and qualities.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"100 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":"123634010","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}
M. Ivanović, A. Bogdanova, B. Milašinović, M. Savić, K. Bothe
Some aspects regarding delivering of different programming courses in three institutions from three countries (Serbia, FYR Macedonia and Croatia) are observed in the paper. Courses' profiles and the application of technology enhanced learning are described and compared. An analysis of the approaches and usage of a set of suitable software tools to enhance everyday teaching practice was conducted. At the end of the last school year, students filled-in appropriate questionnaire to provide feedback and their opinion. Results of questionnaire are presented, discussed and a comparative analysis is given.
{"title":"TEL in teaching and learning programming: international experience","authors":"M. Ivanović, A. Bogdanova, B. Milašinović, M. Savić, K. Bothe","doi":"10.1145/2516775.2516816","DOIUrl":"https://doi.org/10.1145/2516775.2516816","url":null,"abstract":"Some aspects regarding delivering of different programming courses in three institutions from three countries (Serbia, FYR Macedonia and Croatia) are observed in the paper. Courses' profiles and the application of technology enhanced learning are described and compared. An analysis of the approaches and usage of a set of suitable software tools to enhance everyday teaching practice was conducted. At the end of the last school year, students filled-in appropriate questionnaire to provide feedback and their opinion. Results of questionnaire are presented, discussed and a comparative analysis is given.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"27 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":"121186193","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 increased use of encryption in business, key recovery has emerged as a critical issue to users. As encryption is deployed to protect files and network communications, users must include safeguards that prevent the inadvertent loss of data and use of the network for malicious intent. This paper explains what key recovery is, presents a refined practical model of a key recovery scheme and describes a new key recovery scheme compliant with this model. A novel feature of this key recovery scheme is that it is resistant to online guessing attack. Most of key recovery schemes used today are able to detect online guessing attack but not able to prevent it. Consequently, users face the problem of denial of service which occurs when key recovery server shuts down the service to legitimate users though temporarily as a security measure. Key recovery server also, often ask users to change password which was attacked causing further inconvenience. So, a security solution Captcha is employed in this new key recovery scheme to make it secure against online guessing attack.
{"title":"A key recovery scheme","authors":"S. Aggarwal","doi":"10.1145/2516775.2516781","DOIUrl":"https://doi.org/10.1145/2516775.2516781","url":null,"abstract":"With the increased use of encryption in business, key recovery has emerged as a critical issue to users. As encryption is deployed to protect files and network communications, users must include safeguards that prevent the inadvertent loss of data and use of the network for malicious intent. This paper explains what key recovery is, presents a refined practical model of a key recovery scheme and describes a new key recovery scheme compliant with this model. A novel feature of this key recovery scheme is that it is resistant to online guessing attack. Most of key recovery schemes used today are able to detect online guessing attack but not able to prevent it. Consequently, users face the problem of denial of service which occurs when key recovery server shuts down the service to legitimate users though temporarily as a security measure. Key recovery server also, often ask users to change password which was attacked causing further inconvenience. So, a security solution Captcha is employed in this new key recovery scheme to make it secure against online guessing attack.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"71 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":"131765660","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 represents inference model that combines results from several different data sources. The model makes exclusive use of context properties as context is used to determine the mode different sources are combined. The mode of combining is dynamically set regarding both global and local characteristics of the context. This complicated combination schema is used in order to achieve better accuracy. The model is represented by factor graph with tree structure. That is a flexible implementation, which allows us to incorporate context usage in well-defined manner throughout inference process.
{"title":"Context-based ensemble model","authors":"I. Nikolova","doi":"10.1145/2516775.2516791","DOIUrl":"https://doi.org/10.1145/2516775.2516791","url":null,"abstract":"The paper represents inference model that combines results from several different data sources. The model makes exclusive use of context properties as context is used to determine the mode different sources are combined. The mode of combining is dynamically set regarding both global and local characteristics of the context. This complicated combination schema is used in order to achieve better accuracy. The model is represented by factor graph with tree structure. That is a flexible implementation, which allows us to incorporate context usage in well-defined manner throughout inference process.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"6 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":"124115739","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}
Automatic Metadata Generation in the context of e-learning standards is usually referred to algorithms able to process and annotate semi structured documents in plain text. As most of the information available on the web nowadays is unstructured and in the form of multimedia files, the need for more general approaches arises. We propose an automatic metadata generation procedure that allows to label specific unstructured data (video lectures) with metadata compliant to the Learning Object Metadata standard. After preprocessing, three different summarization algorithms are tested and used to obtain a synthetic description of video content, both in terms of Description and Title. Results show that, in the provided context, the obtained Description has a good agreement with the lesson abstract written by its author.
{"title":"Generation of description metadata for video files","authors":"A. Maratea, A. Petrosino, M. Manzo","doi":"10.1145/2516775.2516795","DOIUrl":"https://doi.org/10.1145/2516775.2516795","url":null,"abstract":"Automatic Metadata Generation in the context of e-learning standards is usually referred to algorithms able to process and annotate semi structured documents in plain text. As most of the information available on the web nowadays is unstructured and in the form of multimedia files, the need for more general approaches arises. We propose an automatic metadata generation procedure that allows to label specific unstructured data (video lectures) with metadata compliant to the Learning Object Metadata standard. After preprocessing, three different summarization algorithms are tested and used to obtain a synthetic description of video content, both in terms of Description and Title. Results show that, in the provided context, the obtained Description has a good agreement with the lesson abstract written by its author.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"73-74 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":"128484627","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}
Minimum quantity lubrication (MQL) has been used as an alternative to conventional wet processing in machining process due to many advantages such as increasing in tool life, improvement of productivity and elimination of the dangerous to the operator health. The main goal of this study is to design an artificial neural network to predict and analyze the performance of drilling of aluminium alloy with MQL Three neural networks with 3-inputs and 1-output have been developed based on experimental results. Results show that the developed models have acceptable ability to predict the performance of drilling process as well.
{"title":"Performance analysis of MQL drilling using artificial neural network","authors":"S. Azarrang, H. Baseri","doi":"10.1145/2516775.2516809","DOIUrl":"https://doi.org/10.1145/2516775.2516809","url":null,"abstract":"Minimum quantity lubrication (MQL) has been used as an alternative to conventional wet processing in machining process due to many advantages such as increasing in tool life, improvement of productivity and elimination of the dangerous to the operator health. The main goal of this study is to design an artificial neural network to predict and analyze the performance of drilling of aluminium alloy with MQL Three neural networks with 3-inputs and 1-output have been developed based on experimental results. Results show that the developed models have acceptable ability to predict the performance of drilling process as well.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"16 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":"114901004","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}
Natural Language Processing (NLP) has been viewed as a promising technology in medical informatics since decades. Despite the gradually improving quality of automatic text analysis, however, clinical NLP systems are still rarely used outside the research Labs due to the following reasons: (i) their development is very expensive so most of them are prototypes or proof-of-concept demonstrators, (ii) real exploitation of NLP modules would require constant support of the underlying linguistic resources and tuning the systems to new text types; (iii) the technology has potentially high accuracy but some results might be erroneous and misleading [1]. On the other hand, the quick adoption of Electronic Health Records worldwide implies constant growth of electronic narratives discussing patient-related information. According to the established medical practices, the most important findings about the patients are still kept as free texts in various documents and languages. In this way the so called Information Extraction (IE) becomes the dominating language technology that is currently applied to biomedical texts. The main idea is to extract automatically important entities, with accuracy as high as possible, and to operate on these entities skipping the remaining text fragments. IE is based on shallow analysis only but it is expected that even the progress in partial text understanding would enable radical improvements in clinical decision support, biomedical research and healthcare in general.
{"title":"Automatic information extraction from patient records in Bulgarian language","authors":"G. Angelova","doi":"10.1145/2516775.2516777","DOIUrl":"https://doi.org/10.1145/2516775.2516777","url":null,"abstract":"Natural Language Processing (NLP) has been viewed as a promising technology in medical informatics since decades. Despite the gradually improving quality of automatic text analysis, however, clinical NLP systems are still rarely used outside the research Labs due to the following reasons: (i) their development is very expensive so most of them are prototypes or proof-of-concept demonstrators, (ii) real exploitation of NLP modules would require constant support of the underlying linguistic resources and tuning the systems to new text types; (iii) the technology has potentially high accuracy but some results might be erroneous and misleading [1]. On the other hand, the quick adoption of Electronic Health Records worldwide implies constant growth of electronic narratives discussing patient-related information. According to the established medical practices, the most important findings about the patients are still kept as free texts in various documents and languages. In this way the so called Information Extraction (IE) becomes the dominating language technology that is currently applied to biomedical texts. The main idea is to extract automatically important entities, with accuracy as high as possible, and to operate on these entities skipping the remaining text fragments. IE is based on shallow analysis only but it is expected that even the progress in partial text understanding would enable radical improvements in clinical decision support, biomedical research and healthcare in general.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"80 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":"134018516","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 localization of first responders during a crisis is important to assess their safety, context and activity. The position of first responders having a mobile device can be assessed outdoors using GPS. Usually indoor localization systems require special hardware, advanced training and static environments. Nowadays a lot of public domain buildings have a Wi-Fi network and surveillance camera system installed. In this paper we research the possibility to use GSM and Wi-Fi to localize and track mobile devices of first responders inside buildings. Existing camera surveillance systems will be used to reduce the training phase and to design a dynamic system. The design of the system will be presented and preliminary test results.
{"title":"Dynamic indoor localization and awareness using sensor-networks","authors":"L. Rothkrantz, I. Lefter","doi":"10.1145/2516775.2516793","DOIUrl":"https://doi.org/10.1145/2516775.2516793","url":null,"abstract":"The localization of first responders during a crisis is important to assess their safety, context and activity. The position of first responders having a mobile device can be assessed outdoors using GPS. Usually indoor localization systems require special hardware, advanced training and static environments. Nowadays a lot of public domain buildings have a Wi-Fi network and surveillance camera system installed. In this paper we research the possibility to use GSM and Wi-Fi to localize and track mobile devices of first responders inside buildings. Existing camera surveillance systems will be used to reduce the training phase and to design a dynamic system. The design of the system will be presented and preliminary test results.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"14 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":"132357044","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}
Modern chip-multiprocessors pack an increasing amount of computational cores with each generation. Along with new computational power comes a problem of managing a large pool of active threads. Traditional debuggers often deal with concurrency style multi-threading with emphasis on a single thread. The problem of thread management when debugging parallel programs is analyzed and solutions are suggested. A related debugging framework for the massively multi-threaded, synchronous REPLICA architecture is proposed.
{"title":"Towards a parallel debugging framework for the massively multi-threaded, step-synchronous REPLICA architecture","authors":"Jari-Matti Mäkelä, V. Leppänen, M. Forsell","doi":"10.1145/2516775.2516818","DOIUrl":"https://doi.org/10.1145/2516775.2516818","url":null,"abstract":"Modern chip-multiprocessors pack an increasing amount of computational cores with each generation. Along with new computational power comes a problem of managing a large pool of active threads. Traditional debuggers often deal with concurrency style multi-threading with emphasis on a single thread. The problem of thread management when debugging parallel programs is analyzed and solutions are suggested. A related debugging framework for the massively multi-threaded, synchronous REPLICA architecture is proposed.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"61 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":"116281747","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
扫码关注我们
求助内容：
应助结果提醒方式：