{"title":"Simulation and formal modelling of yaw control in a drive-by-wire application","authors":"R. Banach, P. V. Schaik, E. Verhulst","doi":"10.15439/2015F132","DOIUrl":"https://doi.org/10.15439/2015F132","url":null,"abstract":"Cyberphysical systems, with their interdependence between physical behaviour and digital control, need insights from frequency domain control engineering, state space control engineering and discrete formal systems theory for their proper description. Neglecting any of these, results in descriptions that omit essential details. Hybrid Event-B is a formalism that enables all the relevant detail to be assimilated. A case study based on yaw control for the KURT e-vehicle is used as a testbed to explore the effective interaction between the various needed disciplines in exploring a specific design issue, the formalisation of yaw control discretization, using Hybrid Event-B.","PeriodicalId":276884,"journal":{"name":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"454 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131944534","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":"Pedestrian tracking in video sequences: A particle filtering approach","authors":"Mateusz Owczarek, P. Baranski, P. Strumiłło","doi":"10.15439/2015F158","DOIUrl":"https://doi.org/10.15439/2015F158","url":null,"abstract":"In this work we study the methods for pedestrian tracking in video sequences and indicate various applications of these methods ranging from surveillance systems to aiding the visually impaired persons. First, we define the general problem of object tracking that comprises the tasks of object detection, identifying the flow of object location in consecutive video images and finally analysis of the tracked trajectory data. We review the well known object tracking techniques i.e. the Mean-Shift and the CAMSHIFT algorithm and discuss their properties. Then we introduce the computational technique known as particle filtering (PF) and explain how we have applied it to the tasks of pedestrian tracking. We compare the PF approach against the Mean-Shift and the CAMSHIFT algorithms in terms of tracking robustness and the required computational demand. We conclude, that on the tested video sequences, the PF tracker outperforms the Mean-Shift and by a small margin the CAMSHIFT algorithm. The PF tracker requires more computational power, however, its tracking performance can be flexibly adjusted to the application requirements.","PeriodicalId":276884,"journal":{"name":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129265750","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":"InterCriteria Analysis of crossover and mutation rates relations in simple genetic algorithm","authors":"M. Angelova, O. Roeva, T. Pencheva","doi":"10.15439/2015F178","DOIUrl":"https://doi.org/10.15439/2015F178","url":null,"abstract":"In this investigation recently developed InterCriteria Analysis (ICA) is applied to examine the influences of two main genetic algorithms parameters - crossover and mutation rates during the model parameter identification of S. cerevisiae and E. coli fermentation processes. The apparatuses of index matrices and intuitionistic fuzzy sets, which are the core of ICA, are used to establish the relations between investigated genetic algorithms parameters, from one hand, and fermentation process model parameters, from the other hand. The obtained results after ICA application are analysed towards convergence time and model accuracy and some conclusions about derived interactions are reported.","PeriodicalId":276884,"journal":{"name":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123283224","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":"Trigger based on the artificial neural network implemented in the cyclone V FPGA for a detection of neutrino-origin showers in the Pierre Auger surface detector","authors":"Z. Szadkowski, K. Pytel","doi":"10.15439/2015F208","DOIUrl":"https://doi.org/10.15439/2015F208","url":null,"abstract":"Observations of ultra-high energy neutrinos became a priority in experimental astroparticle physics. Up to now, the Pierre Auger Observatory did not find any candidate on a neutrino event. This imposes competitive limits to the diffuse flux of ultra-high energy neutrinos in the EeV range and above. The prototype Front-End boards for Auger-Beyond-2015 with Cyclone® V E can test the neural network algorithm in real pampas conditions in 2015. Showers for muon and tau neutrino initiating particles on various altitudes, angles and energies were simulated in CORSIKA and OffLine platforms giving pattern of ADC traces in Auger water Cherenkov detectors. The 3-layer 12-10-1 neural network was taught in MATLAB by simulated ADC traces according the Levenberg - Marquardt algorithm. New sophisticated trigger implemented in Cyclone® V E FPGAs with large amount of DSP blocks, embedded memory running with 120 - 160 MHz sampling may support to discover neutrino events in the Pierre Auger Observatory.","PeriodicalId":276884,"journal":{"name":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122201842","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":"Genetic algorithms for balanced spanning tree problem","authors":"Riham Moharam, E. Morsy, Ismail A. Ismail","doi":"10.15439/2015F249","DOIUrl":"https://doi.org/10.15439/2015F249","url":null,"abstract":"Given an undirected weighted connected graph G = (V,E) with vertex set V and edge set E and a designated vertex r ∈ V , we consider the problem of constructing a spanning tree in G that balances both the minimum spanning tree and the shortest paths tree rooted at r. Formally, for any two constants α, β ≥ 1, we consider the problem of computing an (α, β)-balanced spanning tree T in G, in the sense that, (i) for every vertex v ∈ V , the distance between r and v in T is at most a times the shortest distance between the two vertices in G, and (ii) the total weight of T is at most β times that of the minimum tree weight in G. It is well known that, for any α, β ≥ 1, the problem of deciding whether G contains an (α, β)-balanced spanning tree is NP-complete [15]. Consequently, given any α ≥ 1 (resp., β ≥ 1), the problem of finding an (α, β)-balanced spanning tree that minimizes β (resp., α) is NP-complete. In this paper, we present efficient genetic algorithms for these problems. Our experimental results show that the proposed algorithm returns high quality balanced spanning trees.","PeriodicalId":276884,"journal":{"name":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131171365","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":"Comparison of SVM and k-NN classifiers in the estimation of the state of the arteriovenous fistula problem","authors":"Marcin Grochowina, L. Leniowska","doi":"10.15439/2015F194","DOIUrl":"https://doi.org/10.15439/2015F194","url":null,"abstract":"The paper presents a concise report on the comparison of the classifiers k-NN and SVM in the case of a fuzzy classification of the arterio-venous fistula based on audio recordings. What has been used in the studies are the acoustic signals taken from both healthy patients as well as those diagnosed with the narrowing of a fistula in a mild and major degree of stenosis. In the publication there have been selected two features, each presenting one- time and frequency domain, which enable a quite clear depiction of the classification result. The aim of the study is to develop a solution enabling the detection of fistula's pathologies at an early stage.","PeriodicalId":276884,"journal":{"name":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132918766","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}
Eftim Zdravevski, Petre Lameski, A. Kulakov, S. Kalajdziski
{"title":"Transformation of nominal features into numeric in supervised multi-class problems based on the weight of evidence parameter","authors":"Eftim Zdravevski, Petre Lameski, A. Kulakov, S. Kalajdziski","doi":"10.15439/2015F90","DOIUrl":"https://doi.org/10.15439/2015F90","url":null,"abstract":"Machine learning has received increased interest by both the scientific community and the industry. Most of the machine learning algorithms rely on certain distance metrics that can only be applied to numeric data. This becomes a problem in complex datasets that contain heterogeneous data consisted of numeric and nominal (i.e. categorical) features. Thus the need of transformation from nominal to numeric data. Weight of evidence (WoE) is one of the parameters that can be used for transformation of the nominal features to numeric. In this paper we describe a method that uses WoE to transform the features. Although the applicability of this method is researched to some extent, in this paper we extend its applicability for multi-class problems, which is a novelty. We compared it with the method that generates dummy features. We test both methods on binary and multi-class classification problems with different machine learning algorithms. Our experiments show that the WoE based transformation generates smaller number of features compared to the technique based on generation of dummy features while also improving the classification accuracy, reducing memory complexity and shortening the execution time. Be that as it may, we also point out some of its weaknesses and make some recommendations when to use the method based on dummy features generation instead.","PeriodicalId":276884,"journal":{"name":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132252995","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":"Segmentation of cerebrospinal fluid from 3D CT brain scans using modified Fuzzy C-Means based on super-voxels","authors":"Abdelkhalek Bakkari, A. Fabijańska","doi":"10.15439/2015F154","DOIUrl":"https://doi.org/10.15439/2015F154","url":null,"abstract":"In this paper, the problem of segmentation of 3D Computed Tomography (CT) brain datasets is addressed using the fuzzy logic rules. In particular, a new method which combines Fuzzy C-Means clustering and the idea of super-voxels is introduced. Firstly, the method applies the extended Simple Linear Iterative Clustering (SLIC) method to divide image into super-voxels, which are next clustered by Modified Fuzzy C-Means algorithm. The method deals with 3D images and performs fully three dimensional image segmentation. Ten samples are supplied proving that our Modified Fuzzy C-Means (MFCM) together with super-voxels are apt to take into account a large diversity of special domains that appear and which are inappropriate solved adopting classical Fuzzy C-Means approach. The results of applying the introduced method to segmentation of the Cerebro-Spinal Fluid (CSF) from the brain ventricles are presented and discussed.","PeriodicalId":276884,"journal":{"name":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124802941","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":"Management of requirements for the projects of the diagnostic systems","authors":"M. Amarowicz","doi":"10.15439/2015F175","DOIUrl":"https://doi.org/10.15439/2015F175","url":null,"abstract":"The paper deals with the problem of designing diagnostic systems for technical objects such as power plant, machining etc. The new approach for this problem that is based on the methodology that are used in the design of machines and some aspects of requirement engineering that derived from the software area is considered in the article. In general case the requirements may be used to formalized notation of the project need, that described the designed diagnostic systems. The evaluation of gathered set of requirements may be done by using the specialized expert systems, that may be developed as part of proposed approach. The whole process related to gathering, writing and evaluation of requirements for the purpose of designing diagnostic system is presented in the article.","PeriodicalId":276884,"journal":{"name":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"08 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116122095","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":"Research proposal: Barriers to new user and new domain adoption of the XSEDE cyberinfrastructure","authors":"R. Knepper","doi":"10.15439/2015F244","DOIUrl":"https://doi.org/10.15439/2015F244","url":null,"abstract":"This research proposal proposes the examination of user attitudes about the Extreme Science and Engineering Discovery Environment (XSEDE). The XSEDE project supports basic research with a common system for making use of national cyberinfrastructure. The systems and infrastructure that make XSEDE useful for researchers are part of an actor network: these systems are socially constructed and they play their own part in the work of XSEDE, and in turn have an effect on the progress of basic research. I have completed previous work on the user relationships in the predecessor to XSEDE, the TeraGrid, and currently carry out participant observation with the management groups of the XSEDE project. By understanding the barriers to adoption of XSEDE by new researchers and new scientific domains, I hope to explore the linkage between resources (in this case computational resources) and scientific outputs.","PeriodicalId":276884,"journal":{"name":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116288695","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}