Andrzej Sikora, E. Niewiadomska-Szynkiewicz, Mateusz Krzyszton
{"title":"Simulation of mobile wireless ad hoc networks for emergency situation awareness","authors":"Andrzej Sikora, E. Niewiadomska-Szynkiewicz, Mateusz Krzyszton","doi":"10.15439/2015F52","DOIUrl":"https://doi.org/10.15439/2015F52","url":null,"abstract":"Mobile self-organizing ad hoc networks (MANETs) can significantly enhance the capability to coordinate the emergency actions as well as monitor contaminated areas, explore unmanned space, inspect and control working environments. The management of networks that can dynamically and freely organize into temporary topologies raises interesting problems, that are particularly challenging for networks formed by mobile devices. Due to the inherent complexity of these systems, the development of applications relying on mobile network nodes and wireless communication protocols would be greatly simplified by the use of specific tools for supporting testing and performance evaluation. Modeling and simulation are widely used in the design and development of wireless ad hoc networks. In this paper we model mobile ad hoc network (MANET) using discrete event systems methodology (DEVS) and describe the functionality and performance of the Java-based simulation tool for the performance evaluation of self-organizing and cooperative networks for emergency situation awareness. The simulator can provide a useful support for the verification of the design of a network system, employed communication protocols, control and coordination algorithms, allowing the user to display a step-by-step evolution of the network in a suitable graphical interface. The practical case studies are provided to illustrate the operation and performance of the presented software.","PeriodicalId":276884,"journal":{"name":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121243983","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Pawlak's flow graph extensions for video surveillance systems","authors":"Karol Lisowski, A. Czyżewski","doi":"10.15439/2015F384","DOIUrl":"https://doi.org/10.15439/2015F384","url":null,"abstract":"The idea of the Pawlak's flow graphs is applicable to many problems in various fields related to decision algorithms or data mining. The flow graphs can be used also in the video surveillance systems. Especially in distributed multi-camera systems which are problematic to be handled by human operators because of their limited perception. In such systems automated video analysis needs to be implemented. Important part of this analysis is tracking object within a single camera and between cameras' fields of vision. One of element needed to re-identify the single real object besides object's visual features and spatiotemporal dependencies between cameras is a behaviour model. The flow graph after some modifications, is a suitable data structure, which concept is based on the rough set theory, to contained as a behaviour model in it. Additionally, the flow graph can be used to predict the future movement of given object. In this paper a survey of authors research works related to employing flowgraphs in video surveillance systems is contained. The flow graph creation based on the paths of objects inside supervised area will presented. Moreover, a method of building a probability tree on the basis of the flow graph and a method for adapting the flowgraph to the changing topology of the camera network are also discussed.","PeriodicalId":276884,"journal":{"name":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130559310","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}
Sunday Iliya, E. Goodyer, J. Gow, J. Shell, M. Gongora
{"title":"Application of Artificial Neural Network and Support Vector Regression in cognitive radio networks for RF power prediction using compact differential evolution algorithm","authors":"Sunday Iliya, E. Goodyer, J. Gow, J. Shell, M. Gongora","doi":"10.15439/2015F14","DOIUrl":"https://doi.org/10.15439/2015F14","url":null,"abstract":"Cognitive radio (CR) technology has emerged as a promising solution to many wireless communication problems including spectrum scarcity and underutilization. To enhance the selection of channel with less noise among the white spaces (idle channels), the a priory knowledge of Radio Frequency (RF) power is very important. Computational Intelligence (CI) techniques cans be applied to these scenarios to predict the required RF power in the available channels to achieve optimum Quality of Service (QoS). In this paper, we developed a time domain based optimized Artificial Neural Network (ANN) and Support Vector Regression (SVR) models for the prediction of real world RF power within the GSM 900, Very High Frequency (VHF) and Ultra High Frequency (UHF) FM and TV bands. Sensitivity analysis was used to reduce the input vector of the prediction models. The inputs of the ANN and SVR consist of only time domain data and past RF power without using any RF power related parameters, thus forming a nonlinear time series prediction model. The application of the models produced was found to increase the robustness of CR applications, specifically where the CR had no prior knowledge of the RF power related parameters such as signal to noise ratio, bandwidth and bit error rate. Since CR are embedded communication devices with memory constrain limitation, the models used, implemented a novel and innovative initial weight optimization of the ANN's through the use of compact differential evolutionary (cDE) algorithm variants which are memory efficient. This was found to enhance the accuracy and generalization of the ANN model.","PeriodicalId":276884,"journal":{"name":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115378707","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Rule quality measures settings in a sequential covering rule induction algorithm - an empirical approach","authors":"M. Michalak, M. Sikora, Lukasz Wróbel","doi":"10.15439/2015F388","DOIUrl":"https://doi.org/10.15439/2015F388","url":null,"abstract":"The paper presents the results of research related to the efficiency of the so called rule quality measures which are used to evaluate the quality of rules at each stage of the rule induction. The stages of rule growing and pruning were considered along with the issue of conflicts resolution which may occur during the classification. The work is the continuation of research on the efficiency of quality measures employed in sequential covering rule induction algorithm. In this paper we analyse only these quality measures (9 measures) which had been recognised as effective based on previously conducted research.","PeriodicalId":276884,"journal":{"name":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131138004","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Evaluation of methods to combine different speech recognizers","authors":"Tomas Rasymas, V. Rudzionis","doi":"10.15439/2015F62","DOIUrl":"https://doi.org/10.15439/2015F62","url":null,"abstract":"The paper deals with the problem of improving speech recognition by combining outputs of several different recognizers. We are presenting our results obtained by experimenting with different classification methods which are suitable to combine outputs of different speech recognizers. Methods which were evaluated are: k-Nearest neighbors (KNN), Linear Discriminant Analysis (LDA), Quadratic Discriminant Analysis (QDA), Logistic Regression (LR) and maximum likelihood (ML). Results showed, that highest accuracy (98.16 %) was obtained when k-Nearest neighbors method was used with 15 nearest neighbors. In this case accuracy was increased by 7.78 % compared with best single recognizer result. In our experiments we tried to combine one native (Lithuanian language) and few foreign speech recognizers: Russian, English and two German recognizers. For the adaptation of foreign language speech recognizers we used text transcribing method which is based on formal rules. Our experiments proved, that recognition accuracy improves when few speech recognizers are combined.","PeriodicalId":276884,"journal":{"name":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"58 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128269276","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"DISESOR - decision support system for mining industry","authors":"M. Kozielski, M. Sikora, Lukasz Wróbel","doi":"10.15439/2015F168","DOIUrl":"https://doi.org/10.15439/2015F168","url":null,"abstract":"This paper presents the DISESOR integrated decision support system. The system integrates data from different monitoring and dispatching systems and contains such modules as data preparation and cleaning, analytical, prediction and expert system. Architecture of the system is presented in the paper and a special focus is put on the presentation of two issues: data integration and cleaning, and creation of prediction model. The work contains also a case study presenting an example of the system application.","PeriodicalId":276884,"journal":{"name":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134083417","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Strategies of parallelizing nested loops on the multicore architectures on the example of the WZ factorization for the dense matrices","authors":"B. Bylina, J. Bylina","doi":"10.15439/2015F354","DOIUrl":"https://doi.org/10.15439/2015F354","url":null,"abstract":"In the WZ factorization the outermost parallel loop decreases the number of iterations executed at each step and this changes the amount of parallelism in each step. The aim of the paper is to present four strategies of parallelizing nested loops on multicore architectures on the example of the WZ factorization.","PeriodicalId":276884,"journal":{"name":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"154 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114417809","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"New similarity index based on the aggregation of membership functions through OWA operator","authors":"A. A. Younes, Frédéric Blanchard, M. Herbin","doi":"10.15439/2015F174","DOIUrl":"https://doi.org/10.15439/2015F174","url":null,"abstract":"In the field of data analysis, the use of metrics is a classical way to assess pairwise similarity. Unfortunately the popular distances are often inoperative because of the noise, the multidimensionality and the heterogeneous nature of data. These drawbacks lead us to propose a similarity index based on fuzzy set theory. Each object of the dataset is described with the vector of its fuzzy attributes. Thanks to aggregation operators, the object is fuzzified by using the fuzzy attributes. Thus each object becomes a fuzzy subset within the dataset. The similarity of a reference object compared to another one is assessed through the membership function of the fuzzified reference object and an aggregation method using OWA operator.","PeriodicalId":276884,"journal":{"name":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121272043","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Behavior-preserving abstraction of ESTEREL programs","authors":"Nir Koblenc, S. Tyszberowicz","doi":"10.15439/2015F190","DOIUrl":"https://doi.org/10.15439/2015F190","url":null,"abstract":"Reactive programs often control safety-critical systems, thus it is essential to verify their safety requirements. ESTEREL is a synchronous programming language for developing control-dominated reactive systems, and XEVE is a verification environment that analyzes circuit descriptions generated from ESTEREL programs. However, a circuit generated by the ESTEREL compiler from non-pure ESTEREL program often displays behaviors which may violate safety properties even when the source program does not. We introduce an automatic abstraction process for ESTEREL programs developed to tackle this problem. When the process is applied to a program augmented with observers to monitor the program's behavior, it results in a pure program that preserves the behavior of the source program, replacing value-carrying objects with pure signals. We have built a prototype tool that implements the abstraction and used it to purify control programs and robotic systems.","PeriodicalId":276884,"journal":{"name":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123934002","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Real-time schedule for mobile robotics and WSN aplications","authors":"M. Chovanec, P. Sarafín","doi":"10.15439/2015F146","DOIUrl":"https://doi.org/10.15439/2015F146","url":null,"abstract":"This paper presents real-time scheduler in operating system running on ARM Cortex (M0, M3, M4) usable in small mobile robotics with kernel response around 1ms. Thanks to the strong modularity, advanced sleep modes and event driven programming ability, it can be used for WSN applications too.","PeriodicalId":276884,"journal":{"name":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131175370","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}