2021 |
Wachulec, Małgorzata; Luckner, Marcin Fault detection of jet engine heat sensor Journal Article Procedia Computer Science, 192 , pp. 844–852, 2021, ISSN: 18770509. Abstract | Links | BibTeX | Tagi: Anomaly detection, Oil temperature sensor, Outlier detection, Sister engines, Time series @article{Wachulec2021, title = {Fault detection of jet engine heat sensor}, author = {Małgorzata Wachulec and Marcin Luckner}, url = {https://doi.org/10.1016/j.procs.2021.08.087}, doi = {10.1016/j.procs.2021.08.087}, issn = {18770509}, year = {2021}, date = {2021-01-01}, journal = {Procedia Computer Science}, volume = {192}, pages = {844--852}, publisher = {Elsevier B.V.}, abstract = {This paper presents an algorithm predicting oil level and temperature sensor (OLTS) failure to replace it before it carries serious costs. OLTS sensor showing too high oil temperature cockpit indications is a driver of significant air turnback events and commanded in-flight shutdown (IFSD). A prediction of sensor malfunction is possible, but an operator requires at least 11 months of historical data. The developed algorithm automates the process of identifying potential failures using a data-driven, dissimilarity based model. It calculates the rolling mean of the oil temperature difference between sister engines for short-term and long-term periods (counted in flights). If the difference between the short-term and long-term means is greater than a set threshold at least confirmation window times, it sets an alert. The proposed model requires less than three months of data to detect the malfunction, with the final F1 score measured on the test set equal to 0.71.}, keywords = {Anomaly detection, Oil temperature sensor, Outlier detection, Sister engines, Time series}, pubstate = {published}, tppubtype = {article} } This paper presents an algorithm predicting oil level and temperature sensor (OLTS) failure to replace it before it carries serious costs. OLTS sensor showing too high oil temperature cockpit indications is a driver of significant air turnback events and commanded in-flight shutdown (IFSD). A prediction of sensor malfunction is possible, but an operator requires at least 11 months of historical data. The developed algorithm automates the process of identifying potential failures using a data-driven, dissimilarity based model. It calculates the rolling mean of the oil temperature difference between sister engines for short-term and long-term periods (counted in flights). If the difference between the short-term and long-term means is greater than a set threshold at least confirmation window times, it sets an alert. The proposed model requires less than three months of data to detect the malfunction, with the final F1 score measured on the test set equal to 0.71. |
Luckner, Marcin; Krzemińska, Izabella; Wawrzyniak, Piotr; Legierski, Jarosław Contravening Citizen's Privacy : Warsaw Use Case Journal Article IEEE Transactions on Systems, Man, and Cybernetics: Systems, pp. 1–13, 2021. Abstract | Links | BibTeX | Tagi: Data models, Data privacy, Estimation, Privacy, Probes, Trajectory, Urban areas @article{Luckner2021, title = {Contravening Citizen's Privacy : Warsaw Use Case}, author = {Marcin Luckner and Izabella Krzemińska and Piotr Wawrzyniak and Jarosław Legierski}, url = {https://ieeexplore.ieee.org/document/9497518}, year = {2021}, date = {2021-01-01}, journal = {IEEE Transactions on Systems, Man, and Cybernetics: Systems}, pages = {1--13}, publisher = {IEEE}, abstract = {Spatial data on a cellular network load can be used to develop commercial and public services. However, such data is calculated based on individual users' behavior and can contravene their privacy rights. Moreover, direct tracking of individual devices violates the European Union's regulations. To solve this issue, we propose to use data aggregated in individual cells of the public land mobile network without tracking an individual mobile device in the entire process. To prove that the proposed data collection method is useful, we compared the obtained results with a closed-circuit television system in an estimation of the number of people. The proposed system is sensitive enough to detect untypical global events in an urban area and distinguish transport demand zones of various types as we showed on real data from the City of Warsaw.}, keywords = {Data models, Data privacy, Estimation, Privacy, Probes, Trajectory, Urban areas}, pubstate = {published}, tppubtype = {article} } Spatial data on a cellular network load can be used to develop commercial and public services. However, such data is calculated based on individual users' behavior and can contravene their privacy rights. Moreover, direct tracking of individual devices violates the European Union's regulations. To solve this issue, we propose to use data aggregated in individual cells of the public land mobile network without tracking an individual mobile device in the entire process. To prove that the proposed data collection method is useful, we compared the obtained results with a closed-circuit television system in an estimation of the number of people. The proposed system is sensitive enough to detect untypical global events in an urban area and distinguish transport demand zones of various types as we showed on real data from the City of Warsaw. |
2020 |
Luckner, Marcin; Grzenda, MacIej; Kunicki, Robert; Legierski, Jaroslaw IoT Architecture for Urban Data-Centric Services and Applications Journal Article ACM Transactions on Internet Technology, 20 (3), 2020, ISSN: 15576051. Abstract | Links | BibTeX | Tagi: big data, data processing, Data stream, public transport @article{Luckner2020ab, title = {IoT Architecture for Urban Data-Centric Services and Applications}, author = {Marcin Luckner and MacIej Grzenda and Robert Kunicki and Jaroslaw Legierski}, doi = {10.1145/3396850}, issn = {15576051}, year = {2020}, date = {2020-01-01}, journal = {ACM Transactions on Internet Technology}, volume = {20}, number = {3}, abstract = {In this work, we describe an urban Internet of Things (IoT) architecture, grounded in big data patterns and focused on the needs of cities and their key stakeholders. First, the architecture of the dedicated platform USE4IoT (Urban Service Environment for the Internet of Things), which gathers and processes urban big data and extends the Lambda architecture, is proposed. We describe how the platform was used to make IoT an enabling technology for intelligent transport planning. Moreover, key data processing components vital to provide high-quality IoT data streams in a near-real-time manner are defined. Furthermore, tests showing how the IoT platform described in this study provides a low-latency analytical environment for smart cities are included.}, keywords = {big data, data processing, Data stream, public transport}, pubstate = {published}, tppubtype = {article} } In this work, we describe an urban Internet of Things (IoT) architecture, grounded in big data patterns and focused on the needs of cities and their key stakeholders. First, the architecture of the dedicated platform USE4IoT (Urban Service Environment for the Internet of Things), which gathers and processes urban big data and extends the Lambda architecture, is proposed. We describe how the platform was used to make IoT an enabling technology for intelligent transport planning. Moreover, key data processing components vital to provide high-quality IoT data streams in a near-real-time manner are defined. Furthermore, tests showing how the IoT platform described in this study provides a low-latency analytical environment for smart cities are included. |
Luckner, Marcin; ł, Rafa Automatic detection of changes in signal strength characteristics in a wi-fi network for an indoor localisation system Journal Article Sensors (Switzerland), 20 (7), pp. 1–13, 2020, ISSN: 14248220. Abstract | Links | BibTeX | Tagi: Fingerprinting, Indoor localisation system, Quality of Service, System deployment and maintenance, Wi-Fi network @article{Luckner2020c, title = {Automatic detection of changes in signal strength characteristics in a wi-fi network for an indoor localisation system}, author = {Marcin Luckner and Rafa{ł} Górak}, doi = {10.3390/s20071828}, issn = {14248220}, year = {2020}, date = {2020-01-01}, journal = {Sensors (Switzerland)}, volume = {20}, number = {7}, pages = {1--13}, abstract = {This paper faces the issue of changing the received signal strength (RSS) from an observed access point (AP). Such a change can reduce the Quality of Service (QoS) of a Wi-Fi-based Indoor Localisation System. We have proposed a dynamic system based on an estimator of RSS using the readings from other APs. Using an optimal threshold, the algorithm recognises an AP that has changed its characteristics. Next, the system rebuilds the localisation model excluding the changed AP to keep QoS. For the tests, we simulated a change in the analysed Wi-Fi network by replacing the measured RSS by an RSS obtained from the same AP model that lies in another place inside the same multi-floor building. The algorithm was evaluated in simulations of an isolated single-floor building, a single-floor building and a multi-floor building. The mean increase of the localisation error obtained by the system varies from 0.25 to 0.61 m after the RSS changes, whereas the error increase without using the system is between 1.21 and 1.98 m. The system can be applied to any service based on a Wi-Fi network for various kinds of changes like a reconfiguration of the network, a local malfunction or ageing of the infrastructure.}, keywords = {Fingerprinting, Indoor localisation system, Quality of Service, System deployment and maintenance, Wi-Fi network}, pubstate = {published}, tppubtype = {article} } This paper faces the issue of changing the received signal strength (RSS) from an observed access point (AP). Such a change can reduce the Quality of Service (QoS) of a Wi-Fi-based Indoor Localisation System. We have proposed a dynamic system based on an estimator of RSS using the readings from other APs. Using an optimal threshold, the algorithm recognises an AP that has changed its characteristics. Next, the system rebuilds the localisation model excluding the changed AP to keep QoS. For the tests, we simulated a change in the analysed Wi-Fi network by replacing the measured RSS by an RSS obtained from the same AP model that lies in another place inside the same multi-floor building. The algorithm was evaluated in simulations of an isolated single-floor building, a single-floor building and a multi-floor building. The mean increase of the localisation error obtained by the system varies from 0.25 to 0.61 m after the RSS changes, whereas the error increase without using the system is between 1.21 and 1.98 m. The system can be applied to any service based on a Wi-Fi network for various kinds of changes like a reconfiguration of the network, a local malfunction or ageing of the infrastructure. |
Luckner, Marcin; ł, Rafa Automatic detection of changes in signal strength characteristics in a wi-fi network for an indoor localisation system Journal Article Sensors (Switzerland), 20 (7), pp. 1–13, 2020, ISSN: 14248220. Abstract | Links | BibTeX | Tagi: Fingerprinting, Indoor localisation system, Quality of Service, System deployment and maintenance, Wi-Fi network @article{Luckner2020b, title = {Automatic detection of changes in signal strength characteristics in a wi-fi network for an indoor localisation system}, author = {Marcin Luckner and Rafa{ł} Górak}, doi = {10.3390/s20071828}, issn = {14248220}, year = {2020}, date = {2020-01-01}, journal = {Sensors (Switzerland)}, volume = {20}, number = {7}, pages = {1--13}, abstract = {This paper faces the issue of changing the received signal strength (RSS) from an observed access point (AP). Such a change can reduce the Quality of Service (QoS) of a Wi-Fi-based Indoor Localisation System. We have proposed a dynamic system based on an estimator of RSS using the readings from other APs. Using an optimal threshold, the algorithm recognises an AP that has changed its characteristics. Next, the system rebuilds the localisation model excluding the changed AP to keep QoS. For the tests, we simulated a change in the analysed Wi-Fi network by replacing the measured RSS by an RSS obtained from the same AP model that lies in another place inside the same multi-floor building. The algorithm was evaluated in simulations of an isolated single-floor building, a single-floor building and a multi-floor building. The mean increase of the localisation error obtained by the system varies from 0.25 to 0.61 m after the RSS changes, whereas the error increase without using the system is between 1.21 and 1.98 m. The system can be applied to any service based on a Wi-Fi network for various kinds of changes like a reconfiguration of the network, a local malfunction or ageing of the infrastructure.}, keywords = {Fingerprinting, Indoor localisation system, Quality of Service, System deployment and maintenance, Wi-Fi network}, pubstate = {published}, tppubtype = {article} } This paper faces the issue of changing the received signal strength (RSS) from an observed access point (AP). Such a change can reduce the Quality of Service (QoS) of a Wi-Fi-based Indoor Localisation System. We have proposed a dynamic system based on an estimator of RSS using the readings from other APs. Using an optimal threshold, the algorithm recognises an AP that has changed its characteristics. Next, the system rebuilds the localisation model excluding the changed AP to keep QoS. For the tests, we simulated a change in the analysed Wi-Fi network by replacing the measured RSS by an RSS obtained from the same AP model that lies in another place inside the same multi-floor building. The algorithm was evaluated in simulations of an isolated single-floor building, a single-floor building and a multi-floor building. The mean increase of the localisation error obtained by the system varies from 0.25 to 0.61 m after the RSS changes, whereas the error increase without using the system is between 1.21 and 1.98 m. The system can be applied to any service based on a Wi-Fi network for various kinds of changes like a reconfiguration of the network, a local malfunction or ageing of the infrastructure. |
Luckner, Marcin; Grzenda, MacIej; Kunicki, Robert; Legierski, Jaroslaw IoT Architecture for Urban Data-Centric Services and Applications Journal Article ACM Transactions on Internet Technology, 20 (3), 2020, ISSN: 15576051. Abstract | Links | BibTeX | Tagi: big data, data processing, Data stream, public transport @article{Luckner2020a, title = {IoT Architecture for Urban Data-Centric Services and Applications}, author = {Marcin Luckner and MacIej Grzenda and Robert Kunicki and Jaroslaw Legierski}, doi = {10.1145/3396850}, issn = {15576051}, year = {2020}, date = {2020-01-01}, journal = {ACM Transactions on Internet Technology}, volume = {20}, number = {3}, abstract = {In this work, we describe an urban Internet of Things (IoT) architecture, grounded in big data patterns and focused on the needs of cities and their key stakeholders. First, the architecture of the dedicated platform USE4IoT (Urban Service Environment for the Internet of Things), which gathers and processes urban big data and extends the Lambda architecture, is proposed. We describe how the platform was used to make IoT an enabling technology for intelligent transport planning. Moreover, key data processing components vital to provide high-quality IoT data streams in a near-real-time manner are defined. Furthermore, tests showing how the IoT platform described in this study provides a low-latency analytical environment for smart cities are included.}, keywords = {big data, data processing, Data stream, public transport}, pubstate = {published}, tppubtype = {article} } In this work, we describe an urban Internet of Things (IoT) architecture, grounded in big data patterns and focused on the needs of cities and their key stakeholders. First, the architecture of the dedicated platform USE4IoT (Urban Service Environment for the Internet of Things), which gathers and processes urban big data and extends the Lambda architecture, is proposed. We describe how the platform was used to make IoT an enabling technology for intelligent transport planning. Moreover, key data processing components vital to provide high-quality IoT data streams in a near-real-time manner are defined. Furthermore, tests showing how the IoT platform described in this study provides a low-latency analytical environment for smart cities are included. |
2019 |
Luckner, Marcin Practical web spam lifelong machine learning system with automatic adjustment to current lifecycle phase Journal Article Security and Communication Networks, 2019 , 2019, ISSN: 19390122. Abstract | Links | BibTeX | Tagi: @article{Luckner2019ab, title = {Practical web spam lifelong machine learning system with automatic adjustment to current lifecycle phase}, author = {Marcin Luckner}, doi = {10.1155/2019/6587020}, issn = {19390122}, year = {2019}, date = {2019-01-01}, journal = {Security and Communication Networks}, volume = {2019}, abstract = {Machine learning techniques are a standard approach in spam detection. Their quality depends on the quality of the learning set, and when the set is out of date, the quality of classification falls rapidly. The most popular public web spam dataset that can be used to train a spam detector-WEBSPAM-UK2007-is over ten years old. Therefore, there is a place for a lifelong machine learning system that can replace the detectors based on a static learning set. In this paper, we propose a novel web spam recognition system. The system automatically rebuilds the learning set to avoid classification based on outdated data. Using a built-in automatic selection of the active classifier the system very quickly attains productive accuracy despite a limited learning set. Moreover, the system automatically rebuilds the learning set using external data from spam traps and popular web services. A test on real data from Quora, Reddit, and Stack Overflow proved the high recognition quality. Both the obtained average accuracy and the F-measure were 0.98 and 0.96 for semiautomatic and full-Automatic mode, respectively.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Machine learning techniques are a standard approach in spam detection. Their quality depends on the quality of the learning set, and when the set is out of date, the quality of classification falls rapidly. The most popular public web spam dataset that can be used to train a spam detector-WEBSPAM-UK2007-is over ten years old. Therefore, there is a place for a lifelong machine learning system that can replace the detectors based on a static learning set. In this paper, we propose a novel web spam recognition system. The system automatically rebuilds the learning set to avoid classification based on outdated data. Using a built-in automatic selection of the active classifier the system very quickly attains productive accuracy despite a limited learning set. Moreover, the system automatically rebuilds the learning set using external data from spam traps and popular web services. A test on real data from Quora, Reddit, and Stack Overflow proved the high recognition quality. Both the obtained average accuracy and the F-measure were 0.98 and 0.96 for semiautomatic and full-Automatic mode, respectively. |
Bukowski, Mateusz; Luckner, Marcin; Kunicki, Robert Estimation of Free Space on Car Park Using Computer Vision Algorithms Inproceedings Advances in Intelligent Systems and Computing, pp. 316–325, 2019, ISSN: 21945357. Abstract | Links | BibTeX | Tagi: @inproceedings{Bukowski2019b, title = {Estimation of Free Space on Car Park Using Computer Vision Algorithms}, author = {Mateusz Bukowski and Marcin Luckner and Robert Kunicki}, doi = {10.1007/978-3-030-13273-6_30}, issn = {21945357}, year = {2019}, date = {2019-01-01}, booktitle = {Advances in Intelligent Systems and Computing}, volume = {920}, pages = {316--325}, abstract = {A system for monitoring of vacant parking spots can save drivers a lot of time and costs. Other citizens can benefit from a reduction of pollutions too. In our work, we proposed the computer vision system that estimates free space in a car park. The system uses three separate estimation methods based on various approaches to the estimation issue. The free car park area is recognised on a video frame by as the broadest cohesive area, the largest group of pixels with similar colours, and background for parked cars. The raw results of the estimations are aggregated by a Multi-Layer Perceptron to obtain the final estimate. The test on real data from the City of Warsaw showed that the system reaches 95% accuracy. Moreover, the results were compared with the registers from the parking machines to estimate a gap between covered payment and the accurate number of parked cars.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } A system for monitoring of vacant parking spots can save drivers a lot of time and costs. Other citizens can benefit from a reduction of pollutions too. In our work, we proposed the computer vision system that estimates free space in a car park. The system uses three separate estimation methods based on various approaches to the estimation issue. The free car park area is recognised on a video frame by as the broadest cohesive area, the largest group of pixels with similar colours, and background for parked cars. The raw results of the estimations are aggregated by a Multi-Layer Perceptron to obtain the final estimate. The test on real data from the City of Warsaw showed that the system reaches 95% accuracy. Moreover, the results were compared with the registers from the parking machines to estimate a gap between covered payment and the accurate number of parked cars. |
Wilkowski, Artur; Mykhalevych, Ihor; Luckner, Marcin City Bus Monitoring Supported by Computer Vision and Machine Learning Algorithms Inproceedings Advances in Intelligent Systems and Computing, pp. 326–336, 2019, ISSN: 21945357. Abstract | Links | BibTeX | Tagi: Computer vision, Detection, Tracking, Traffic monitoring @inproceedings{Wilkowski2019b, title = {City Bus Monitoring Supported by Computer Vision and Machine Learning Algorithms}, author = {Artur Wilkowski and Ihor Mykhalevych and Marcin Luckner}, doi = {10.1007/978-3-030-13273-6_31}, issn = {21945357}, year = {2019}, date = {2019-01-01}, booktitle = {Advances in Intelligent Systems and Computing}, volume = {920}, pages = {326--336}, abstract = {In this paper there are proposed methods and algorithms supporting city traffic controllers in effective perception and analysis of the visual information from the public transport monitoring system implemented in the City of Warsaw. To achieve this goal, public transport vehicles must be recognised and tracked in camera view. In this work, we describe a structure and give preliminary results for the detection and tracking system proposed. The algorithms discussed in this paper uses background subtraction to extract moving vehicles from the scene and the classification system to reject objects that are not city buses. Furthermore, a custom tracking module is utilized to enable labeling of city buses instances. During the test performed in the City of Warsaw the system was able to successfully detect 89% bus instances giving less than 15% erroneous detections.}, keywords = {Computer vision, Detection, Tracking, Traffic monitoring}, pubstate = {published}, tppubtype = {inproceedings} } In this paper there are proposed methods and algorithms supporting city traffic controllers in effective perception and analysis of the visual information from the public transport monitoring system implemented in the City of Warsaw. To achieve this goal, public transport vehicles must be recognised and tracked in camera view. In this work, we describe a structure and give preliminary results for the detection and tracking system proposed. The algorithms discussed in this paper uses background subtraction to extract moving vehicles from the scene and the classification system to reject objects that are not city buses. Furthermore, a custom tracking module is utilized to enable labeling of city buses instances. During the test performed in the City of Warsaw the system was able to successfully detect 89% bus instances giving less than 15% erroneous detections. |
Grzenda, Maciej; Kunicki, Robert; ł, Jaros; Luckner, Marcin Big data w analizie funkcjonowania systemu komunikacji miejskiej Incollection Ocena wpływu miejskich projektów transportowych Programu Operacyjnego Infrastruktura i Środowisko, pp. 116–137, Centrum Unijnych Projektów Transportowych, 2019. BibTeX | Tagi: @incollection{Grzenda2019b, title = {Big data w analizie funkcjonowania systemu komunikacji miejskiej}, author = {Maciej Grzenda and Robert Kunicki and Jaros{ł}aw Legierski and Marcin Luckner}, year = {2019}, date = {2019-01-01}, booktitle = {Ocena wpływu miejskich projektów transportowych Programu Operacyjnego Infrastruktura i Środowisko}, pages = {116--137}, publisher = {Centrum Unijnych Projektów Transportowych}, keywords = {}, pubstate = {published}, tppubtype = {incollection} } |
Luckner, Marcin; Gad, Michal; Sobkowiak, Pawel Antyscam-Practical web spam classifier Journal Article International Journal of Electronics and Telecommunications, 65 (4), pp. 713–722, 2019, ISSN: 23001933. Abstract | Links | BibTeX | Tagi: Automatic classification, Imbalanced sets classification, Machine learning, Spam detection, Web spam detection @article{Luckner2019c, title = {Antyscam-Practical web spam classifier}, author = {Marcin Luckner and Michal Gad and Pawel Sobkowiak}, doi = {10.24425/ijet.2019.130255}, issn = {23001933}, year = {2019}, date = {2019-01-01}, journal = {International Journal of Electronics and Telecommunications}, volume = {65}, number = {4}, pages = {713--722}, abstract = {To avoid of manipulating search engines results by web spam, anti spam system use machine learning techniques to detect spam. However, if the learning set for the system is out of date the quality of classification falls rapidly. We present the web spam recognition system that periodically refreshes the learning set to create an adequate classifier. A new classifier is trained exclusively on data collected during the last period. We have proved that such strategy is better than an incrementation of the learning set. The system solves the starting-up issues of lacks in learning set by minimisation of learning examples and utilization of external data sets. The system was tested on real data from the spam traps and common known web services: Quora, Reddit, and Stack Overflow. The test performed among ten months shows stability of the system and improvement of the results up to 60 percent at the end of the examined period.}, keywords = {Automatic classification, Imbalanced sets classification, Machine learning, Spam detection, Web spam detection}, pubstate = {published}, tppubtype = {article} } To avoid of manipulating search engines results by web spam, anti spam system use machine learning techniques to detect spam. However, if the learning set for the system is out of date the quality of classification falls rapidly. We present the web spam recognition system that periodically refreshes the learning set to create an adequate classifier. A new classifier is trained exclusively on data collected during the last period. We have proved that such strategy is better than an incrementation of the learning set. The system solves the starting-up issues of lacks in learning set by minimisation of learning examples and utilization of external data sets. The system was tested on real data from the spam traps and common known web services: Quora, Reddit, and Stack Overflow. The test performed among ten months shows stability of the system and improvement of the results up to 60 percent at the end of the examined period. |
Luckner, Marcin; Gad, Michal; Sobkowiak, Pawel Antyscam-Practical web spam classifier Journal Article International Journal of Electronics and Telecommunications, 65 (4), pp. 713–722, 2019, ISSN: 23001933. Abstract | Links | BibTeX | Tagi: Automatic classification, Imbalanced sets classification, Machine learning, Spam detection, Web spam detection @article{Luckner2019b, title = {Antyscam-Practical web spam classifier}, author = {Marcin Luckner and Michal Gad and Pawel Sobkowiak}, doi = {10.24425/ijet.2019.130255}, issn = {23001933}, year = {2019}, date = {2019-01-01}, journal = {International Journal of Electronics and Telecommunications}, volume = {65}, number = {4}, pages = {713--722}, abstract = {To avoid of manipulating search engines results by web spam, anti spam system use machine learning techniques to detect spam. However, if the learning set for the system is out of date the quality of classification falls rapidly. We present the web spam recognition system that periodically refreshes the learning set to create an adequate classifier. A new classifier is trained exclusively on data collected during the last period. We have proved that such strategy is better than an incrementation of the learning set. The system solves the starting-up issues of lacks in learning set by minimisation of learning examples and utilization of external data sets. The system was tested on real data from the spam traps and common known web services: Quora, Reddit, and Stack Overflow. The test performed among ten months shows stability of the system and improvement of the results up to 60 percent at the end of the examined period.}, keywords = {Automatic classification, Imbalanced sets classification, Machine learning, Spam detection, Web spam detection}, pubstate = {published}, tppubtype = {article} } To avoid of manipulating search engines results by web spam, anti spam system use machine learning techniques to detect spam. However, if the learning set for the system is out of date the quality of classification falls rapidly. We present the web spam recognition system that periodically refreshes the learning set to create an adequate classifier. A new classifier is trained exclusively on data collected during the last period. We have proved that such strategy is better than an incrementation of the learning set. The system solves the starting-up issues of lacks in learning set by minimisation of learning examples and utilization of external data sets. The system was tested on real data from the spam traps and common known web services: Quora, Reddit, and Stack Overflow. The test performed among ten months shows stability of the system and improvement of the results up to 60 percent at the end of the examined period. |
Bukowski, Mateusz; Luckner, Marcin; Kunicki, Robert Estimation of Free Space on Car Park Using Computer Vision Algorithms Inproceedings Advances in Intelligent Systems and Computing, pp. 316–325, 2019, ISSN: 21945357. Abstract | Links | BibTeX | Tagi: @inproceedings{Bukowski2019, title = {Estimation of Free Space on Car Park Using Computer Vision Algorithms}, author = {Mateusz Bukowski and Marcin Luckner and Robert Kunicki}, doi = {10.1007/978-3-030-13273-6_30}, issn = {21945357}, year = {2019}, date = {2019-01-01}, booktitle = {Advances in Intelligent Systems and Computing}, volume = {920}, pages = {316--325}, abstract = {A system for monitoring of vacant parking spots can save drivers a lot of time and costs. Other citizens can benefit from a reduction of pollutions too. In our work, we proposed the computer vision system that estimates free space in a car park. The system uses three separate estimation methods based on various approaches to the estimation issue. The free car park area is recognised on a video frame by as the broadest cohesive area, the largest group of pixels with similar colours, and background for parked cars. The raw results of the estimations are aggregated by a Multi-Layer Perceptron to obtain the final estimate. The test on real data from the City of Warsaw showed that the system reaches 95% accuracy. Moreover, the results were compared with the registers from the parking machines to estimate a gap between covered payment and the accurate number of parked cars.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } A system for monitoring of vacant parking spots can save drivers a lot of time and costs. Other citizens can benefit from a reduction of pollutions too. In our work, we proposed the computer vision system that estimates free space in a car park. The system uses three separate estimation methods based on various approaches to the estimation issue. The free car park area is recognised on a video frame by as the broadest cohesive area, the largest group of pixels with similar colours, and background for parked cars. The raw results of the estimations are aggregated by a Multi-Layer Perceptron to obtain the final estimate. The test on real data from the City of Warsaw showed that the system reaches 95% accuracy. Moreover, the results were compared with the registers from the parking machines to estimate a gap between covered payment and the accurate number of parked cars. |
Wilkowski, Artur; Mykhalevych, Ihor; Luckner, Marcin City Bus Monitoring Supported by Computer Vision and Machine Learning Algorithms Inproceedings Advances in Intelligent Systems and Computing, pp. 326–336, 2019, ISSN: 21945357. Abstract | Links | BibTeX | Tagi: Computer vision, Detection, Tracking, Traffic monitoring @inproceedings{Wilkowski2019, title = {City Bus Monitoring Supported by Computer Vision and Machine Learning Algorithms}, author = {Artur Wilkowski and Ihor Mykhalevych and Marcin Luckner}, doi = {10.1007/978-3-030-13273-6_31}, issn = {21945357}, year = {2019}, date = {2019-01-01}, booktitle = {Advances in Intelligent Systems and Computing}, volume = {920}, pages = {326--336}, abstract = {In this paper there are proposed methods and algorithms supporting city traffic controllers in effective perception and analysis of the visual information from the public transport monitoring system implemented in the City of Warsaw. To achieve this goal, public transport vehicles must be recognised and tracked in camera view. In this work, we describe a structure and give preliminary results for the detection and tracking system proposed. The algorithms discussed in this paper uses background subtraction to extract moving vehicles from the scene and the classification system to reject objects that are not city buses. Furthermore, a custom tracking module is utilized to enable labeling of city buses instances. During the test performed in the City of Warsaw the system was able to successfully detect 89% bus instances giving less than 15% erroneous detections.}, keywords = {Computer vision, Detection, Tracking, Traffic monitoring}, pubstate = {published}, tppubtype = {inproceedings} } In this paper there are proposed methods and algorithms supporting city traffic controllers in effective perception and analysis of the visual information from the public transport monitoring system implemented in the City of Warsaw. To achieve this goal, public transport vehicles must be recognised and tracked in camera view. In this work, we describe a structure and give preliminary results for the detection and tracking system proposed. The algorithms discussed in this paper uses background subtraction to extract moving vehicles from the scene and the classification system to reject objects that are not city buses. Furthermore, a custom tracking module is utilized to enable labeling of city buses instances. During the test performed in the City of Warsaw the system was able to successfully detect 89% bus instances giving less than 15% erroneous detections. |
Grzenda, Maciej; Kunicki, Robert; Legierski, Jarosław; Luckner, Marcin Big data w analizie funkcjonowania systemu komunikacji miejskiej Incollection Ocena wpływu miejskich projektów transportowych Programu Operacyjnego Infrastruktura i Środowisko, pp. 116–137, Centrum Unijnych Projektów Transportowych, 2019. BibTeX | Tagi: @incollection{Grzenda2019, title = {Big data w analizie funkcjonowania systemu komunikacji miejskiej}, author = {Maciej Grzenda and Robert Kunicki and Jarosław Legierski and Marcin Luckner}, year = {2019}, date = {2019-01-01}, booktitle = {Ocena wpływu miejskich projektów transportowych Programu Operacyjnego Infrastruktura i Środowisko}, pages = {116--137}, publisher = {Centrum Unijnych Projektów Transportowych}, keywords = {}, pubstate = {published}, tppubtype = {incollection} } |
Luckner, Marcin Practical web spam lifelong machine learning system with automatic adjustment to current lifecycle phase Journal Article Security and Communication Networks, 2019 , 2019, ISSN: 19390122. Abstract | Links | BibTeX | Tagi: @article{Luckner2019a, title = {Practical web spam lifelong machine learning system with automatic adjustment to current lifecycle phase}, author = {Marcin Luckner}, doi = {10.1155/2019/6587020}, issn = {19390122}, year = {2019}, date = {2019-01-01}, journal = {Security and Communication Networks}, volume = {2019}, abstract = {Machine learning techniques are a standard approach in spam detection. Their quality depends on the quality of the learning set, and when the set is out of date, the quality of classification falls rapidly. The most popular public web spam dataset that can be used to train a spam detector-WEBSPAM-UK2007-is over ten years old. Therefore, there is a place for a lifelong machine learning system that can replace the detectors based on a static learning set. In this paper, we propose a novel web spam recognition system. The system automatically rebuilds the learning set to avoid classification based on outdated data. Using a built-in automatic selection of the active classifier the system very quickly attains productive accuracy despite a limited learning set. Moreover, the system automatically rebuilds the learning set using external data from spam traps and popular web services. A test on real data from Quora, Reddit, and Stack Overflow proved the high recognition quality. Both the obtained average accuracy and the F-measure were 0.98 and 0.96 for semiautomatic and full-Automatic mode, respectively.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Machine learning techniques are a standard approach in spam detection. Their quality depends on the quality of the learning set, and when the set is out of date, the quality of classification falls rapidly. The most popular public web spam dataset that can be used to train a spam detector-WEBSPAM-UK2007-is over ten years old. Therefore, there is a place for a lifelong machine learning system that can replace the detectors based on a static learning set. In this paper, we propose a novel web spam recognition system. The system automatically rebuilds the learning set to avoid classification based on outdated data. Using a built-in automatic selection of the active classifier the system very quickly attains productive accuracy despite a limited learning set. Moreover, the system automatically rebuilds the learning set using external data from spam traps and popular web services. A test on real data from Quora, Reddit, and Stack Overflow proved the high recognition quality. Both the obtained average accuracy and the F-measure were 0.98 and 0.96 for semiautomatic and full-Automatic mode, respectively. |
2018 |
ł, Rafa; Luckner, Marcin Automatic detection of missing access points in indoor positioning system Journal Article Sensors (Switzerland), 18 (11), 2018, ISSN: 14248220. Abstract | Links | BibTeX | Tagi: Fingerprinting, Indoor localisation system, System deployment and maintenance @article{Gorak2018b, title = {Automatic detection of missing access points in indoor positioning system}, author = {Rafa{ł} Górak and Marcin Luckner}, url = {https://doi.org/10.3390/s18113595}, doi = {10.3390/s18113595}, issn = {14248220}, year = {2018}, date = {2018-10-01}, journal = {Sensors (Switzerland)}, volume = {18}, number = {11}, abstract = { The paper presents a Wi-Fi-based indoor localisation system. It consists of two main parts, the localisation model and an Access Points (APs) detection module. The system uses a received signal strength (RSS) gathered by multiple mobile terminals to detect which AP should be included in the localisation model and whether the model needs to be updated (rebuilt). The rebuilding of the localisation model prevents the localisation system from a significant loss of accuracy. The proposed automatic detection of missing APs has a universal character and it can be applied to any Wi-Fi localisation model which was created using the fingerprinting method. The paper considers the localisation model based on the Random Forest algorithm. The system was tested on data collected inside a multi-floor academic building. The proposed implementation reduced the mean horizontal error by 5.5 m and the classification error for the floor's prediction by 0.26 in case of a serious malfunction of a Wi-Fi infrastructure. Several simulations were performed, taking into account different occupancy scenarios as well as different numbers of missing APs. The simulations proved that the system correctly detects missing and present APs in the Wi-Fi infrastructure. },keywords = {Fingerprinting, Indoor localisation system, System deployment and maintenance}, pubstate = {published}, tppubtype = {article} } <p>The paper presents a Wi-Fi-based indoor localisation system. It consists of two main parts, the localisation model and an Access Points (APs) detection module. The system uses a received signal strength (RSS) gathered by multiple mobile terminals to detect which AP should be included in the localisation model and whether the model needs to be updated (rebuilt). The rebuilding of the localisation model prevents the localisation system from a significant loss of accuracy. The proposed automatic detection of missing APs has a universal character and it can be applied to any Wi-Fi localisation model which was created using the fingerprinting method. The paper considers the localisation model based on the Random Forest algorithm. The system was tested on data collected inside a multi-floor academic building. The proposed implementation reduced the mean horizontal error by 5.5 m and the classification error for the floor's prediction by 0.26 in case of a serious malfunction of a Wi-Fi infrastructure. Several simulations were performed, taking into account different occupancy scenarios as well as different numbers of missing APs. The simulations proved that the system correctly detects missing and present APs in the Wi-Fi infrastructure.</p> |
ł, Rafa; Luckner, Marcin Automatic detection of missing access points in indoor positioning system Journal Article Sensors (Switzerland), 18 (11), 2018, ISSN: 14248220. Abstract | Links | BibTeX | Tagi: Fingerprinting, Indoor localisation system, System deployment and maintenance @article{Gorak2018, title = {Automatic detection of missing access points in indoor positioning system}, author = {Rafa{ł} Górak and Marcin Luckner}, url = {https://doi.org/10.3390/s18113595}, doi = {10.3390/s18113595}, issn = {14248220}, year = {2018}, date = {2018-10-01}, journal = {Sensors (Switzerland)}, volume = {18}, number = {11}, abstract = {textlessptextgreaterThe paper presents a Wi-Fi-based indoor localisation system. It consists of two main parts, the localisation model and an Access Points (APs) detection module. The system uses a received signal strength (RSS) gathered by multiple mobile terminals to detect which AP should be included in the localisation model and whether the model needs to be updated (rebuilt). The rebuilding of the localisation model prevents the localisation system from a significant loss of accuracy. The proposed automatic detection of missing APs has a universal character and it can be applied to any Wi-Fi localisation model which was created using the fingerprinting method. The paper considers the localisation model based on the Random Forest algorithm. The system was tested on data collected inside a multi-floor academic building. The proposed implementation reduced the mean horizontal error by 5.5 m and the classification error for the floor's prediction by 0.26 in case of a serious malfunction of a Wi-Fi infrastructure. Several simulations were performed, taking into account different occupancy scenarios as well as different numbers of missing APs. The simulations proved that the system correctly detects missing and present APs in the Wi-Fi infrastructure.textless/ptextgreater}, keywords = {Fingerprinting, Indoor localisation system, System deployment and maintenance}, pubstate = {published}, tppubtype = {article} } textlessptextgreaterThe paper presents a Wi-Fi-based indoor localisation system. It consists of two main parts, the localisation model and an Access Points (APs) detection module. The system uses a received signal strength (RSS) gathered by multiple mobile terminals to detect which AP should be included in the localisation model and whether the model needs to be updated (rebuilt). The rebuilding of the localisation model prevents the localisation system from a significant loss of accuracy. The proposed automatic detection of missing APs has a universal character and it can be applied to any Wi-Fi localisation model which was created using the fingerprinting method. The paper considers the localisation model based on the Random Forest algorithm. The system was tested on data collected inside a multi-floor academic building. The proposed implementation reduced the mean horizontal error by 5.5 m and the classification error for the floor's prediction by 0.26 in case of a serious malfunction of a Wi-Fi infrastructure. Several simulations were performed, taking into account different occupancy scenarios as well as different numbers of missing APs. The simulations proved that the system correctly detects missing and present APs in the Wi-Fi infrastructure.textless/ptextgreater |
Epperlein, J; Legierski, J; Luckner, M; č, Mare J; Nair, R The use of presence data in modelling demand for transportation Miscellaneous 2018. @misc{Epperlein2018b, title = {The use of presence data in modelling demand for transportation}, author = {J Epperlein and J Legierski and M Luckner and J Mare{č}ek and R Nair}, year = {2018}, date = {2018-01-01}, booktitle = {arXiv}, abstract = {Copyright textcopyright 2018, arXiv, All rights reserved. We consider the applicability of the data from operators of cellular systems to modelling demand for transportation. While individual-level data may contain precise paths of movement, stringent privacy rules prohibit their use without consent. Presence data aggregate the individual-level data to information on the numbers of transactions at each base transceiver station (BTS) per each time period. Our work is aimed at demonstrating value of such aggregate data for mobility management while maintaining privacy of users. In particular, given mobile subscriber activity aggregated to short time intervals for a zone, a convex optimisation problem estimates most likely transitions between zones. We demonstrate the method on presence data from Warsaw, Poland, and compare with official demand estimates obtained with classical econometric methods.}, keywords = {}, pubstate = {published}, tppubtype = {misc} } Copyright textcopyright 2018, arXiv, All rights reserved. We consider the applicability of the data from operators of cellular systems to modelling demand for transportation. While individual-level data may contain precise paths of movement, stringent privacy rules prohibit their use without consent. Presence data aggregate the individual-level data to information on the numbers of transactions at each base transceiver station (BTS) per each time period. Our work is aimed at demonstrating value of such aggregate data for mobility management while maintaining privacy of users. In particular, given mobile subscriber activity aggregated to short time intervals for a zone, a convex optimisation problem estimates most likely transitions between zones. We demonstrate the method on presence data from Warsaw, Poland, and compare with official demand estimates obtained with classical econometric methods. |
Epperlein, J; Legierski, J; Luckner, M; č, Mare J; Nair, R The use of presence data in modelling demand for transportation Miscellaneous 2018. @misc{Epperlein2018, title = {The use of presence data in modelling demand for transportation}, author = {J Epperlein and J Legierski and M Luckner and J Mare{č}ek and R Nair}, year = {2018}, date = {2018-01-01}, booktitle = {arXiv}, abstract = {Copyright textcopyright 2018, arXiv, All rights reserved. We consider the applicability of the data from operators of cellular systems to modelling demand for transportation. While individual-level data may contain precise paths of movement, stringent privacy rules prohibit their use without consent. Presence data aggregate the individual-level data to information on the numbers of transactions at each base transceiver station (BTS) per each time period. Our work is aimed at demonstrating value of such aggregate data for mobility management while maintaining privacy of users. In particular, given mobile subscriber activity aggregated to short time intervals for a zone, a convex optimisation problem estimates most likely transitions between zones. We demonstrate the method on presence data from Warsaw, Poland, and compare with official demand estimates obtained with classical econometric methods.}, keywords = {}, pubstate = {published}, tppubtype = {misc} } Copyright textcopyright 2018, arXiv, All rights reserved. We consider the applicability of the data from operators of cellular systems to modelling demand for transportation. While individual-level data may contain precise paths of movement, stringent privacy rules prohibit their use without consent. Presence data aggregate the individual-level data to information on the numbers of transactions at each base transceiver station (BTS) per each time period. Our work is aimed at demonstrating value of such aggregate data for mobility management while maintaining privacy of users. In particular, given mobile subscriber activity aggregated to short time intervals for a zone, a convex optimisation problem estimates most likely transitions between zones. We demonstrate the method on presence data from Warsaw, Poland, and compare with official demand estimates obtained with classical econometric methods. |
2017 |
Luckner, Marcin; ł, Pawe; ł, Pawe Public transport stops state detection and propagation warsaw use case Inproceedings SMARTGREENS 2017 - Proceedings of the 6th International Conference on Smart Cities and Green ICT Systems, pp. 235–241, 2017, ISBN: 9789897582417. Abstract | Links | BibTeX | Tagi: Data mining, Events detection, Extract informations, Geographic information systems, Geography, Markup languages @inproceedings{Luckner2017cb, title = {Public transport stops state detection and propagation warsaw use case}, author = {Marcin Luckner and Pawe{ł} Kobojek and Pawe{ł} Zawistowski}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85025476306&partnerID=40&md5=794077ac781c41cadefc7b7173a8a979}, isbn = {9789897582417}, year = {2017}, date = {2017-01-01}, booktitle = {SMARTGREENS 2017 - Proceedings of the 6th International Conference on Smart Cities and Green ICT Systems}, pages = {235--241}, abstract = {Publication of information on public transport in a form acceptable to third-party developers can improve a quality of services offered to the citizens. Usually, published data are limited to localisations of the stops and the schedules. However, a public transport model based on these data is incomplete without information about a current state of the stops. In this paper, we present a system that observes public sources of information on public transport such as Twitter feeds and official web pages hosted by the City of Warsaw. The incoming messages are parsed to extract information on events that concern public transport lines and stops. Extracted information allows us to detect a current state of the stops and to create linguistically independent and spatial oriented information in Geography Markup Language format that can be published using a web service. The system has been tested on real data from Warsaw district and the suburban zones. textcopyright 2017 by SCITEPRESS Science and Technology Publications, Lda. All Rights Reserved.}, keywords = {Data mining, Events detection, Extract informations, Geographic information systems, Geography, Markup languages}, pubstate = {published}, tppubtype = {inproceedings} } Publication of information on public transport in a form acceptable to third-party developers can improve a quality of services offered to the citizens. Usually, published data are limited to localisations of the stops and the schedules. However, a public transport model based on these data is incomplete without information about a current state of the stops. In this paper, we present a system that observes public sources of information on public transport such as Twitter feeds and official web pages hosted by the City of Warsaw. The incoming messages are parsed to extract information on events that concern public transport lines and stops. Extracted information allows us to detect a current state of the stops and to create linguistically independent and spatial oriented information in Geography Markup Language format that can be published using a web service. The system has been tested on real data from Warsaw district and the suburban zones. textcopyright 2017 by SCITEPRESS Science and Technology Publications, Lda. All Rights Reserved. |
ń, Kamil Bre; ł, Maciej Cho; Luckner, Marcin Evil-AP - Mobile man-in-the-middle threat Inproceedings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 617–627, 2017, ISSN: 16113349. Abstract | Links | BibTeX | Tagi: @inproceedings{Brenski2017b, title = {Evil-AP - Mobile man-in-the-middle threat}, author = {Kamil Bre{ń}ski and Maciej Cho{ł}uj and Marcin Luckner}, doi = {10.1007/978-3-319-59105-6_53}, issn = {16113349}, year = {2017}, date = {2017-01-01}, booktitle = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}, volume = {10244 LNCS}, pages = {617--627}, abstract = {textcopyright IFIP International Federation for Information Processing 2017. Clients of public hotspots are exposed to various threats including a man-in-the-middle attacks. To stress existing threats we created the Evil-AP application for demonstrating a man-in-the-middle attack. The application, installed on an Android phone with root permissions, turns on hotspot services and performs network redirection. We tested as the proposed techniques can be used to eavesdrop, redirect, inject, and strip the Internet traffic. A mobility of the created solution together with the wide functionality creates an extremely dangerous tool. Therefore, we concluded our work with good practices that allow the users to avoid similar threats as described in our work.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } textcopyright IFIP International Federation for Information Processing 2017. Clients of public hotspots are exposed to various threats including a man-in-the-middle attacks. To stress existing threats we created the Evil-AP application for demonstrating a man-in-the-middle attack. The application, installed on an Android phone with root permissions, turns on hotspot services and performs network redirection. We tested as the proposed techniques can be used to eavesdrop, redirect, inject, and strip the Internet traffic. A mobility of the created solution together with the wide functionality creates an extremely dangerous tool. Therefore, we concluded our work with good practices that allow the users to avoid similar threats as described in our work. |
Luckner, Marcin; Karwowski, Jan Estimation of Delays for Individual Trams to Monitor Issues in Public Transport Infrastructure Inproceedings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 518–527, 2017, ISSN: 16113349. Abstract | Links | BibTeX | Tagi: @inproceedings{Luckner2017bb, title = {Estimation of Delays for Individual Trams to Monitor Issues in Public Transport Infrastructure}, author = {Marcin Luckner and Jan Karwowski}, doi = {10.1007/978-3-319-67074-4_50}, issn = {16113349}, year = {2017}, date = {2017-01-01}, booktitle = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}, volume = {10448 LNAI}, pages = {518--527}, abstract = {From the Publisher: "Does Collective Intelligence (CI) exist and if so, how can it be characterized quantified, and harnessed? Questions such as these continue to be hotly debated within both the scientific and philosophical communities. Yet few researchers working in the fields of artificial intelligence or distributed computing doubt CI's enormous potential value to the future of computing. Unfortunately, for lack of a rigorous, formal theory of Collective Intelligence, most attempts to analyze CI systems have been disappointing, at best. In Computational Collective Intelligence, Professor Tadeusz Szuba does much to rectify that situation by developing, for the first time, both a formal definition of CI and practical guidelines for its assessment and applications." "Working from the ground up, Dr. Szuba begins with a stimulating and insightful discussion of the types of intelligence - including individual, artificial and collective - into which he brings ideas from AI, information theory, and distributed computing, as well as psychology, sociology, animal behavior, cognitive science, and other relevant disciplines. He tackles the problem of computational models for simulating and measuring CI. He explores all theoretically feasible of CI computations and presents a groundbreaking, nondeterministic approach using the Random PROLOG Processor (RPP) as a CI modeling and evaluation tool. He then introduces the Collective Intelligence Quotient (IQS) and develops clear-cut guidelines for measuring it. In the final chapters, he lays the foundation for a dynamic new discipline, Collective Intelligence Engineering (CIE), and considers its potential applications as an organizational restructuring tool."-BOOK JACKET.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } From the Publisher: "Does Collective Intelligence (CI) exist and if so, how can it be characterized quantified, and harnessed? Questions such as these continue to be hotly debated within both the scientific and philosophical communities. Yet few researchers working in the fields of artificial intelligence or distributed computing doubt CI's enormous potential value to the future of computing. Unfortunately, for lack of a rigorous, formal theory of Collective Intelligence, most attempts to analyze CI systems have been disappointing, at best. In Computational Collective Intelligence, Professor Tadeusz Szuba does much to rectify that situation by developing, for the first time, both a formal definition of CI and practical guidelines for its assessment and applications." "Working from the ground up, Dr. Szuba begins with a stimulating and insightful discussion of the types of intelligence - including individual, artificial and collective - into which he brings ideas from AI, information theory, and distributed computing, as well as psychology, sociology, animal behavior, cognitive science, and other relevant disciplines. He tackles the problem of computational models for simulating and measuring CI. He explores all theoretically feasible of CI computations and presents a groundbreaking, nondeterministic approach using the Random PROLOG Processor (RPP) as a CI modeling and evaluation tool. He then introduces the Collective Intelligence Quotient (IQS) and develops clear-cut guidelines for measuring it. In the final chapters, he lays the foundation for a dynamic new discipline, Collective Intelligence Engineering (CIE), and considers its potential applications as an organizational restructuring tool."-BOOK JACKET. |
Luckner, Marcin; ł, Aneta Ros; ń, Izabela Krzemi; ł, Jaros; Kunicki, Robert Clustering of Mobile Subscriber's Location Statistics for Travel Demand Zones Diversity Inproceedings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 315–326, 2017, ISSN: 16113349. Abstract | Links | BibTeX | Tagi: @inproceedings{Luckner2017f, title = {Clustering of Mobile Subscriber's Location Statistics for Travel Demand Zones Diversity}, author = {Marcin Luckner and Aneta Ros{ł}an and Izabela Krzemi{ń}ska and Jaros{ł}aw Legierski and Robert Kunicki}, url = {http://link.springer.com/10.1007/978-3-319-59105-6_27}, doi = {10.1007/978-3-319-59105-6_27}, issn = {16113349}, year = {2017}, date = {2017-01-01}, booktitle = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}, volume = {10244 LNCS}, pages = {315--326}, abstract = {textcopyright IFIP International Federation for Information Processing 2017. Current knowledge on travel demand is necessary to keep a travel demand model up to date. However, the data gathering is a laborious and costly task. One of the approaches to this issues can be the utilisation of mobile data. In this work, we used mobile subscriber's location statistics to define a daily characteristic of mobile events occurrences registered by Base Transceiver Stations (BTS). For types of preprocessed data were tested to create stable clusters of BTS according to registered routines. The obtained results were used to find similar travel demand zones from the Warsaw public transport demand model according to a daily activity of the citizens. The obtained results can be used to update the model or to plan a cohesive strategy of public transport development.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } textcopyright IFIP International Federation for Information Processing 2017. Current knowledge on travel demand is necessary to keep a travel demand model up to date. However, the data gathering is a laborious and costly task. One of the approaches to this issues can be the utilisation of mobile data. In this work, we used mobile subscriber's location statistics to define a daily characteristic of mobile events occurrences registered by Base Transceiver Stations (BTS). For types of preprocessed data were tested to create stable clusters of BTS according to registered routines. The obtained results were used to find similar travel demand zones from the Warsaw public transport demand model according to a daily activity of the citizens. The obtained results can be used to update the model or to plan a cohesive strategy of public transport development. |
Luckner, Marcin; Topolski, Bartosz; Mazurek, Magdalena Application of XGboost algorithm in fingerprinting localisation task Inproceedings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 661–671, 2017, ISSN: 16113349. Abstract | Links | BibTeX | Tagi: @inproceedings{Luckner2017ab, title = {Application of XGboost algorithm in fingerprinting localisation task}, author = {Marcin Luckner and Bartosz Topolski and Magdalena Mazurek}, doi = {10.1007/978-3-319-59105-6_57}, issn = {16113349}, year = {2017}, date = {2017-01-01}, booktitle = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}, volume = {10244 LNCS}, pages = {661--671}, abstract = {An Indoor Positioning System (IPS) issues regression and classification challenges in form of an horizontal localisation and a floor detection. We propose to apply the XGBoost algorithm for both tasks. The algorithm uses vectors of Received Signal Strengths from Wi–Fi access points to map the obtained fingerprints into horizontal coordinates and a current floor number. The original application schema for the algorithm to create IPS was proposed. The algorithm was tested using real data from an academic building. The testing data were split into two datasets. The first data set contains signals from all observed access points. The second dataset consist of signals from the academic network infrastructure. The second dataset was created to eliminate temporary hotspots and to improve a stability of the positioning system. The tested algorithm got similar results as reference methods on the wider set of access points. On the limited set the algorithm obtained the best results.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } An Indoor Positioning System (IPS) issues regression and classification challenges in form of an horizontal localisation and a floor detection. We propose to apply the XGBoost algorithm for both tasks. The algorithm uses vectors of Received Signal Strengths from Wi–Fi access points to map the obtained fingerprints into horizontal coordinates and a current floor number. The original application schema for the algorithm to create IPS was proposed. The algorithm was tested using real data from an academic building. The testing data were split into two datasets. The first data set contains signals from all observed access points. The second dataset consist of signals from the academic network infrastructure. The second dataset was created to eliminate temporary hotspots and to improve a stability of the positioning system. The tested algorithm got similar results as reference methods on the wider set of access points. On the limited set the algorithm obtained the best results. |
Luckner, Marcin; ł, Pawe; ł, Pawe Public transport stops state detection and propagation warsaw use case Inproceedings SMARTGREENS 2017 - Proceedings of the 6th International Conference on Smart Cities and Green ICT Systems, pp. 235–241, 2017, ISBN: 9789897582417. Abstract | Links | BibTeX | Tagi: Data mining, Events detection, Extract informations, Geographic information systems, Geography, Markup languages @inproceedings{Luckner2017c, title = {Public transport stops state detection and propagation warsaw use case}, author = {Marcin Luckner and Pawe{ł} Kobojek and Pawe{ł} Zawistowski}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85025476306&partnerID=40&md5=794077ac781c41cadefc7b7173a8a979}, isbn = {9789897582417}, year = {2017}, date = {2017-01-01}, booktitle = {SMARTGREENS 2017 - Proceedings of the 6th International Conference on Smart Cities and Green ICT Systems}, pages = {235--241}, abstract = {Publication of information on public transport in a form acceptable to third-party developers can improve a quality of services offered to the citizens. Usually, published data are limited to localisations of the stops and the schedules. However, a public transport model based on these data is incomplete without information about a current state of the stops. In this paper, we present a system that observes public sources of information on public transport such as Twitter feeds and official web pages hosted by the City of Warsaw. The incoming messages are parsed to extract information on events that concern public transport lines and stops. Extracted information allows us to detect a current state of the stops and to create linguistically independent and spatial oriented information in Geography Markup Language format that can be published using a web service. The system has been tested on real data from Warsaw district and the suburban zones. textcopyright 2017 by SCITEPRESS Science and Technology Publications, Lda. All Rights Reserved.}, keywords = {Data mining, Events detection, Extract informations, Geographic information systems, Geography, Markup languages}, pubstate = {published}, tppubtype = {inproceedings} } Publication of information on public transport in a form acceptable to third-party developers can improve a quality of services offered to the citizens. Usually, published data are limited to localisations of the stops and the schedules. However, a public transport model based on these data is incomplete without information about a current state of the stops. In this paper, we present a system that observes public sources of information on public transport such as Twitter feeds and official web pages hosted by the City of Warsaw. The incoming messages are parsed to extract information on events that concern public transport lines and stops. Extracted information allows us to detect a current state of the stops and to create linguistically independent and spatial oriented information in Geography Markup Language format that can be published using a web service. The system has been tested on real data from Warsaw district and the suburban zones. textcopyright 2017 by SCITEPRESS Science and Technology Publications, Lda. All Rights Reserved. |
Luckner, Marcin; Karwowski, Jan Estimation of Delays for Individual Trams to Monitor Issues in Public Transport Infrastructure Inproceedings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 518–527, 2017, ISSN: 16113349. Abstract | Links | BibTeX | Tagi: @inproceedings{Luckner2017b, title = {Estimation of Delays for Individual Trams to Monitor Issues in Public Transport Infrastructure}, author = {Marcin Luckner and Jan Karwowski}, doi = {10.1007/978-3-319-67074-4_50}, issn = {16113349}, year = {2017}, date = {2017-01-01}, booktitle = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}, volume = {10448 LNAI}, pages = {518--527}, abstract = {From the Publisher: "Does Collective Intelligence (CI) exist and if so, how can it be characterized quantified, and harnessed? Questions such as these continue to be hotly debated within both the scientific and philosophical communities. Yet few researchers working in the fields of artificial intelligence or distributed computing doubt CI's enormous potential value to the future of computing. Unfortunately, for lack of a rigorous, formal theory of Collective Intelligence, most attempts to analyze CI systems have been disappointing, at best. In Computational Collective Intelligence, Professor Tadeusz Szuba does much to rectify that situation by developing, for the first time, both a formal definition of CI and practical guidelines for its assessment and applications." "Working from the ground up, Dr. Szuba begins with a stimulating and insightful discussion of the types of intelligence - including individual, artificial and collective - into which he brings ideas from AI, information theory, and distributed computing, as well as psychology, sociology, animal behavior, cognitive science, and other relevant disciplines. He tackles the problem of computational models for simulating and measuring CI. He explores all theoretically feasible of CI computations and presents a groundbreaking, nondeterministic approach using the Random PROLOG Processor (RPP) as a CI modeling and evaluation tool. He then introduces the Collective Intelligence Quotient (IQS) and develops clear-cut guidelines for measuring it. In the final chapters, he lays the foundation for a dynamic new discipline, Collective Intelligence Engineering (CIE), and considers its potential applications as an organizational restructuring tool."-BOOK JACKET.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } From the Publisher: "Does Collective Intelligence (CI) exist and if so, how can it be characterized quantified, and harnessed? Questions such as these continue to be hotly debated within both the scientific and philosophical communities. Yet few researchers working in the fields of artificial intelligence or distributed computing doubt CI's enormous potential value to the future of computing. Unfortunately, for lack of a rigorous, formal theory of Collective Intelligence, most attempts to analyze CI systems have been disappointing, at best. In Computational Collective Intelligence, Professor Tadeusz Szuba does much to rectify that situation by developing, for the first time, both a formal definition of CI and practical guidelines for its assessment and applications." "Working from the ground up, Dr. Szuba begins with a stimulating and insightful discussion of the types of intelligence - including individual, artificial and collective - into which he brings ideas from AI, information theory, and distributed computing, as well as psychology, sociology, animal behavior, cognitive science, and other relevant disciplines. He tackles the problem of computational models for simulating and measuring CI. He explores all theoretically feasible of CI computations and presents a groundbreaking, nondeterministic approach using the Random PROLOG Processor (RPP) as a CI modeling and evaluation tool. He then introduces the Collective Intelligence Quotient (IQS) and develops clear-cut guidelines for measuring it. In the final chapters, he lays the foundation for a dynamic new discipline, Collective Intelligence Engineering (CIE), and considers its potential applications as an organizational restructuring tool."-BOOK JACKET. |
ń, Kamil Bre; ł, Maciej Cho; Luckner, Marcin Evil-AP - Mobile man-in-the-middle threat Inproceedings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 617–627, 2017, ISSN: 16113349. Abstract | Links | BibTeX | Tagi: @inproceedings{Brenski2017, title = {Evil-AP - Mobile man-in-the-middle threat}, author = {Kamil Bre{ń}ski and Maciej Cho{ł}uj and Marcin Luckner}, doi = {10.1007/978-3-319-59105-6_53}, issn = {16113349}, year = {2017}, date = {2017-01-01}, booktitle = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}, volume = {10244 LNCS}, pages = {617--627}, abstract = {textcopyright IFIP International Federation for Information Processing 2017. Clients of public hotspots are exposed to various threats including a man-in-the-middle attacks. To stress existing threats we created the Evil-AP application for demonstrating a man-in-the-middle attack. The application, installed on an Android phone with root permissions, turns on hotspot services and performs network redirection. We tested as the proposed techniques can be used to eavesdrop, redirect, inject, and strip the Internet traffic. A mobility of the created solution together with the wide functionality creates an extremely dangerous tool. Therefore, we concluded our work with good practices that allow the users to avoid similar threats as described in our work.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } textcopyright IFIP International Federation for Information Processing 2017. Clients of public hotspots are exposed to various threats including a man-in-the-middle attacks. To stress existing threats we created the Evil-AP application for demonstrating a man-in-the-middle attack. The application, installed on an Android phone with root permissions, turns on hotspot services and performs network redirection. We tested as the proposed techniques can be used to eavesdrop, redirect, inject, and strip the Internet traffic. A mobility of the created solution together with the wide functionality creates an extremely dangerous tool. Therefore, we concluded our work with good practices that allow the users to avoid similar threats as described in our work. |
Luckner, Marcin; Topolski, Bartosz; Mazurek, Magdalena Application of XGboost algorithm in fingerprinting localisation task Inproceedings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 661–671, 2017, ISSN: 16113349. Abstract | Links | BibTeX | Tagi: @inproceedings{Luckner2017a, title = {Application of XGboost algorithm in fingerprinting localisation task}, author = {Marcin Luckner and Bartosz Topolski and Magdalena Mazurek}, doi = {10.1007/978-3-319-59105-6_57}, issn = {16113349}, year = {2017}, date = {2017-01-01}, booktitle = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}, volume = {10244 LNCS}, pages = {661--671}, abstract = {An Indoor Positioning System (IPS) issues regression and classification challenges in form of an horizontal localisation and a floor detection. We propose to apply the XGBoost algorithm for both tasks. The algorithm uses vectors of Received Signal Strengths from Wi–Fi access points to map the obtained fingerprints into horizontal coordinates and a current floor number. The original application schema for the algorithm to create IPS was proposed. The algorithm was tested using real data from an academic building. The testing data were split into two datasets. The first data set contains signals from all observed access points. The second dataset consist of signals from the academic network infrastructure. The second dataset was created to eliminate temporary hotspots and to improve a stability of the positioning system. The tested algorithm got similar results as reference methods on the wider set of access points. On the limited set the algorithm obtained the best results.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } An Indoor Positioning System (IPS) issues regression and classification challenges in form of an horizontal localisation and a floor detection. We propose to apply the XGBoost algorithm for both tasks. The algorithm uses vectors of Received Signal Strengths from Wi–Fi access points to map the obtained fingerprints into horizontal coordinates and a current floor number. The original application schema for the algorithm to create IPS was proposed. The algorithm was tested using real data from an academic building. The testing data were split into two datasets. The first data set contains signals from all observed access points. The second dataset consist of signals from the academic network infrastructure. The second dataset was created to eliminate temporary hotspots and to improve a stability of the positioning system. The tested algorithm got similar results as reference methods on the wider set of access points. On the limited set the algorithm obtained the best results. |
Luckner, Marcin; ł, Aneta Ros; ń, Izabela Krzemi; ł, Jaros; Kunicki, Robert Clustering of Mobile Subscriber's Location Statistics for Travel Demand Zones Diversity Inproceedings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 315–326, 2017, ISSN: 16113349. Abstract | Links | BibTeX | Tagi: @inproceedings{Luckner2017, title = {Clustering of Mobile Subscriber's Location Statistics for Travel Demand Zones Diversity}, author = {Marcin Luckner and Aneta Ros{ł}an and Izabela Krzemi{ń}ska and Jaros{ł}aw Legierski and Robert Kunicki}, url = {http://link.springer.com/10.1007/978-3-319-59105-6_27}, doi = {10.1007/978-3-319-59105-6_27}, issn = {16113349}, year = {2017}, date = {2017-01-01}, booktitle = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}, volume = {10244 LNCS}, pages = {315--326}, abstract = {textcopyright IFIP International Federation for Information Processing 2017. Current knowledge on travel demand is necessary to keep a travel demand model up to date. However, the data gathering is a laborious and costly task. One of the approaches to this issues can be the utilisation of mobile data. In this work, we used mobile subscriber's location statistics to define a daily characteristic of mobile events occurrences registered by Base Transceiver Stations (BTS). For types of preprocessed data were tested to create stable clusters of BTS according to registered routines. The obtained results were used to find similar travel demand zones from the Warsaw public transport demand model according to a daily activity of the citizens. The obtained results can be used to update the model or to plan a cohesive strategy of public transport development.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } textcopyright IFIP International Federation for Information Processing 2017. Current knowledge on travel demand is necessary to keep a travel demand model up to date. However, the data gathering is a laborious and costly task. One of the approaches to this issues can be the utilisation of mobile data. In this work, we used mobile subscriber's location statistics to define a daily characteristic of mobile events occurrences registered by Base Transceiver Stations (BTS). For types of preprocessed data were tested to create stable clusters of BTS according to registered routines. The obtained results were used to find similar travel demand zones from the Warsaw public transport demand model according to a daily activity of the citizens. The obtained results can be used to update the model or to plan a cohesive strategy of public transport development. |
2016 |
ł, Rafa; Luckner, Marcin Modified random forest algorithm for Wi–Fi indoor localization system Journal Article Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9876 LNCS (208921), pp. 147–157, 2016, ISSN: 16113349. Abstract | Links | BibTeX | Tagi: @article{Gorak2016e, title = {Modified random forest algorithm for Wi–Fi indoor localization system}, author = {Rafa{ł} Górak and Marcin Luckner}, doi = {10.1007/978-3-319-45246-3_14}, issn = {16113349}, year = {2016}, date = {2016-01-01}, journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}, volume = {9876 LNCS}, number = {208921}, pages = {147--157}, abstract = {The paper presents a modification of Random Forest approach to the indoor localization problem. The localization solution is based on RSS (Received Signal Strength) from multiple sources of Wi–Fi signal. We analyze two localization models. The first one is built using a straightforward application of a random forest method. The second model is a combination of localization models built for each Access Point from the building's network using similar technique (Random Forests) as for the first model. The modification proposed in the second model gives us a substantial accuracy improvement when compared to the first model. We test also the solution against a network malfunction when some Access Points are turned off as the malfunction immunity is another important feature of the presented localization solution.}, keywords = {}, pubstate = {published}, tppubtype = {article} } The paper presents a modification of Random Forest approach to the indoor localization problem. The localization solution is based on RSS (Received Signal Strength) from multiple sources of Wi–Fi signal. We analyze two localization models. The first one is built using a straightforward application of a random forest method. The second model is a combination of localization models built for each Access Point from the building's network using similar technique (Random Forests) as for the first model. The modification proposed in the second model gives us a substantial accuracy improvement when compared to the first model. We test also the solution against a network malfunction when some Access Points are turned off as the malfunction immunity is another important feature of the presented localization solution. |
Wilkowski, Artur; Luckner, Marcin Low-cost canoe counting system for application in a natural environment Inproceedings Advances in Intelligent Systems and Computing, pp. 705–715, 2016, ISSN: 21945357. Abstract | Links | BibTeX | Tagi: Classification with rejection, Computer vision, Pattern recognition @inproceedings{Wilkowski2016b, title = {Low-cost canoe counting system for application in a natural environment}, author = {Artur Wilkowski and Marcin Luckner}, doi = {10.1007/978-3-319-29357-8_61}, issn = {21945357}, year = {2016}, date = {2016-01-01}, booktitle = {Advances in Intelligent Systems and Computing}, volume = {440}, pages = {705--715}, abstract = {? Springer International Publishing Switzerland 2016.This paper presents low-cost system for counting canoes and canoeists to control cannoning tourist routes. The created system was implemented on Raspberry Pi 2 and the total cost of the tracking device is less than 200$. The proposed algorithmuses background subtraction and Support Vector Machines to track vessels and recognize canoes among them. The obtained results are rewarding as for low-cost solution. Depending on considered group of objects the accuracy of the algorithm reaches 84, 89.5, and 96% for canoes, vessels, and all objects respectively.}, keywords = {Classification with rejection, Computer vision, Pattern recognition}, pubstate = {published}, tppubtype = {inproceedings} } ? Springer International Publishing Switzerland 2016.This paper presents low-cost system for counting canoes and canoeists to control cannoning tourist routes. The created system was implemented on Raspberry Pi 2 and the total cost of the tracking device is less than 200$. The proposed algorithmuses background subtraction and Support Vector Machines to track vessels and recognize canoes among them. The obtained results are rewarding as for low-cost solution. Depending on considered group of objects the accuracy of the algorithm reaches 84, 89.5, and 96% for canoes, vessels, and all objects respectively. |
ł, Rafa; Luckner, Marcin Long term analysis of the localization model based on Wi-Fi network Inproceedings Studies in Computational Intelligence, pp. 87–96, 2016, ISSN: 1860949X. Abstract | Links | BibTeX | Tagi: @inproceedings{Gorak2016bc, title = {Long term analysis of the localization model based on Wi-Fi network}, author = {Rafa{ł} Górak and Marcin Luckner}, doi = {10.1007/978-3-319-31277-4_8}, issn = {1860949X}, year = {2016}, date = {2016-01-01}, booktitle = {Studies in Computational Intelligence}, volume = {642}, pages = {87--96}, abstract = {The paper presents the analysis of long term accuracy of the localization solution based on Wi-Fi signals. The localization model is built using random forest algorithm and it was tested using data collected between years 2012–2014 inside of a six floor building.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } The paper presents the analysis of long term accuracy of the localization solution based on Wi-Fi signals. The localization model is built using random forest algorithm and it was tested using data collected between years 2012–2014 inside of a six floor building. |
Luckner, Marcin; ł, Rafa Hybrid algorithm for floor detection using GSM signals in indoor localisation task Inproceedings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 730–741, 2016, ISSN: 16113349. Abstract | Links | BibTeX | Tagi: @inproceedings{Luckner2016ab, title = {Hybrid algorithm for floor detection using GSM signals in indoor localisation task}, author = {Marcin Luckner and Rafa{ł} Górak}, doi = {10.1007/978-3-319-32034-2_61}, issn = {16113349}, year = {2016}, date = {2016-01-01}, booktitle = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}, volume = {9648}, pages = {730--741}, abstract = {The expression of flavin-containing monooxygenases (FMOs) in dog liver microsomes was suggested by a high methimazole S- oxidase activity. When the reaction was catalyzed by dog liver microsomes, apparent Vmax and Km values were 6.3 nmol/min/mg and 14 ? M, respectively. This reaction was highly inhibited (73%) in the presence of imipramine, but it was also weakly affected by trimethylamine, suggesting the involvement of different isoforms. The sequences of dog FMO1 and FMO3 were obtained by reverse transcription-polymerase chain reaction and 5?/3? terminal exten- sion. The cDNAs of dog FMO1 and dog FMO3 encode proteins of 532 amino acids, which contain the NADPH- and FAD-binding sites. The dog FMO1 amino acid sequence is 88, 86, and 89% identical to sequences of human, rabbit, and pig FMO1, respec- tively. The dog FMO3 amino acid sequence is 83, 84, and 82% identical to sequences of human, rabbit, and rat FMO3, respec- tively. Dog FMO1 and dog FMO3 exhibited only 56% identities. The FMO1 and FMO3 recombinant proteins and the FMO1 and FMO3 microsomal proteins migrated with the same mobility (56 kDa), as determined in SDS-polyacrylamide gel electrophoresis and immu- noblotting. By Western blotting, dog FMO1 and dog FMO3 were detected in microsomes from liver and lung but not in kidney microsomes. By Northern blotting, the probe for FMO1 specifically hybridized a 2.6-kilobase (kb) transcript in liver and lung samples only. The probe for FMO3 hybridized two transcripts of approxi- mately 3 and 4.2 kb in the liver and lung samples}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } The expression of flavin-containing monooxygenases (FMOs) in dog liver microsomes was suggested by a high methimazole S- oxidase activity. When the reaction was catalyzed by dog liver microsomes, apparent Vmax and Km values were 6.3 nmol/min/mg and 14 ? M, respectively. This reaction was highly inhibited (73%) in the presence of imipramine, but it was also weakly affected by trimethylamine, suggesting the involvement of different isoforms. The sequences of dog FMO1 and FMO3 were obtained by reverse transcription-polymerase chain reaction and 5?/3? terminal exten- sion. The cDNAs of dog FMO1 and dog FMO3 encode proteins of 532 amino acids, which contain the NADPH- and FAD-binding sites. The dog FMO1 amino acid sequence is 88, 86, and 89% identical to sequences of human, rabbit, and pig FMO1, respec- tively. The dog FMO3 amino acid sequence is 83, 84, and 82% identical to sequences of human, rabbit, and rat FMO3, respec- tively. Dog FMO1 and dog FMO3 exhibited only 56% identities. The FMO1 and FMO3 recombinant proteins and the FMO1 and FMO3 microsomal proteins migrated with the same mobility (56 kDa), as determined in SDS-polyacrylamide gel electrophoresis and immu- noblotting. By Western blotting, dog FMO1 and dog FMO3 were detected in microsomes from liver and lung but not in kidney microsomes. By Northern blotting, the probe for FMO1 specifically hybridized a 2.6-kilobase (kb) transcript in liver and lung samples only. The probe for FMO3 hybridized two transcripts of approxi- mately 3 and 4.2 kb in the liver and lung samples |
Luckner, Marcin; ł, Rafa Comparison of floor detection approaches for suburban area Inproceedings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 782–791, 2016, ISSN: 16113349. Abstract | Links | BibTeX | Tagi: @inproceedings{Luckner2016c, title = {Comparison of floor detection approaches for suburban area}, author = {Marcin Luckner and Rafa{ł} Górak}, doi = {10.1007/978-3-662-49390-8_76}, issn = {16113349}, year = {2016}, date = {2016-01-01}, booktitle = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}, volume = {9622}, pages = {782--791}, abstract = {? Springer-Verlag Berlin Heidelberg 2016.As a part of smart-buildings, indoor localisation systems ? alternative to Global Positioning System localisation ? bring constantly improving results. Several localisation methods works with a horizontal localisation error less than few meters. However, for small suburban houses, horizontal localisation is not as important as detection of the current floor, which in is still a challenge in multi-storey buildings. This paper compares several approaches that can be used in fingerprintingbased floor detection systems. The tests include the following fingerprints: pressure measures, Wi-Fi signals, and two generations of cellular networks signals. The tests have been done in the suburban 3-storey building with underdeveloped Wi-Fi and cellular infrastructure. Notwithstanding, the floor detection based on Received Signal Strength from both infrastructures reached from 98 to 100%. Additionally, we showed that differences in the number of measures and differences in the number of received signals were not a major factor that influenced on accuracy.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } ? Springer-Verlag Berlin Heidelberg 2016.As a part of smart-buildings, indoor localisation systems ? alternative to Global Positioning System localisation ? bring constantly improving results. Several localisation methods works with a horizontal localisation error less than few meters. However, for small suburban houses, horizontal localisation is not as important as detection of the current floor, which in is still a challenge in multi-storey buildings. This paper compares several approaches that can be used in fingerprintingbased floor detection systems. The tests include the following fingerprints: pressure measures, Wi-Fi signals, and two generations of cellular networks signals. The tests have been done in the suburban 3-storey building with underdeveloped Wi-Fi and cellular infrastructure. Notwithstanding, the floor detection based on Received Signal Strength from both infrastructures reached from 98 to 100%. Additionally, we showed that differences in the number of measures and differences in the number of received signals were not a major factor that influenced on accuracy. |
Homenda, Wladyslaw; Luckner, Marcin; Pedrycz, Witold Classification with rejection: Concepts and evaluations Inproceedings Advances in Intelligent Systems and Computing, pp. 413–425, 2016, ISSN: 21945357. Abstract | Links | BibTeX | Tagi: Binary classifiers ensemble, Reclassification, Rejection rule @inproceedings{Homenda2016b, title = {Classification with rejection: Concepts and evaluations}, author = {Wladyslaw Homenda and Marcin Luckner and Witold Pedrycz}, doi = {10.1007/978-3-319-19090-7_31}, issn = {21945357}, year = {2016}, date = {2016-01-01}, booktitle = {Advances in Intelligent Systems and Computing}, volume = {364}, pages = {413--425}, abstract = {? Springer International Publishing Switzerland 2016.Standard classification process allocates all processed elements to given classes. Such type of classification assumes that there are only native and no foreign elements, i.e., all processed elements are included in given classes. The quality of standard classification can be measured by two factors: numbers of correctly and incorrectly classified elements, called True Positives and False Positives. Admitting foreign elements in standard classification process increases False Positives and, in this way, deteriorates quality of classification. In this context, it is desired to reject foreign elements, i.e., not to assign them to any of given classes. Rejecting foreign elements will reduce the number of false positives, but can also reject native elements reducing True Positives as side effect. Therefore, it is important to build well-designed rejection, which will reject significant part of foreigners and only few natives. In this paper, evaluations of classification with rejection concepts are presented. Three main models: a classification without rejection, a classification with rejection, and a classification with reclassification are presented. The concepts are illustrated by flexible ensembles of binary classifiers with evaluations of eachmodel. The proposed models can be used, in particular, as classifiers working with noised data, where recognized input is not limited to elements of known classes.}, keywords = {Binary classifiers ensemble, Reclassification, Rejection rule}, pubstate = {published}, tppubtype = {inproceedings} } ? Springer International Publishing Switzerland 2016.Standard classification process allocates all processed elements to given classes. Such type of classification assumes that there are only native and no foreign elements, i.e., all processed elements are included in given classes. The quality of standard classification can be measured by two factors: numbers of correctly and incorrectly classified elements, called True Positives and False Positives. Admitting foreign elements in standard classification process increases False Positives and, in this way, deteriorates quality of classification. In this context, it is desired to reject foreign elements, i.e., not to assign them to any of given classes. Rejecting foreign elements will reduce the number of false positives, but can also reject native elements reducing True Positives as side effect. Therefore, it is important to build well-designed rejection, which will reject significant part of foreigners and only few natives. In this paper, evaluations of classification with rejection concepts are presented. Three main models: a classification without rejection, a classification with rejection, and a classification with reclassification are presented. The concepts are illustrated by flexible ensembles of binary classifiers with evaluations of eachmodel. The proposed models can be used, in particular, as classifiers working with noised data, where recognized input is not limited to elements of known classes. |
Luckner, Marcin; ł, Rafa Hybrid algorithm for floor detection using GSM signals in indoor localisation task Inproceedings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 730–741, 2016, ISSN: 16113349. Abstract | Links | BibTeX | Tagi: @inproceedings{Luckner2016a, title = {Hybrid algorithm for floor detection using GSM signals in indoor localisation task}, author = {Marcin Luckner and Rafa{ł} Górak}, doi = {10.1007/978-3-319-32034-2_61}, issn = {16113349}, year = {2016}, date = {2016-01-01}, booktitle = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}, volume = {9648}, pages = {730--741}, abstract = {The expression of flavin-containing monooxygenases (FMOs) in dog liver microsomes was suggested by a high methimazole S- oxidase activity. When the reaction was catalyzed by dog liver microsomes, apparent Vmax and Km values were 6.3 nmol/min/mg and 14 ? M, respectively. This reaction was highly inhibited (73%) in the presence of imipramine, but it was also weakly affected by trimethylamine, suggesting the involvement of different isoforms. The sequences of dog FMO1 and FMO3 were obtained by reverse transcription-polymerase chain reaction and 5?/3? terminal exten- sion. The cDNAs of dog FMO1 and dog FMO3 encode proteins of 532 amino acids, which contain the NADPH- and FAD-binding sites. The dog FMO1 amino acid sequence is 88, 86, and 89% identical to sequences of human, rabbit, and pig FMO1, respec- tively. The dog FMO3 amino acid sequence is 83, 84, and 82% identical to sequences of human, rabbit, and rat FMO3, respec- tively. Dog FMO1 and dog FMO3 exhibited only 56% identities. The FMO1 and FMO3 recombinant proteins and the FMO1 and FMO3 microsomal proteins migrated with the same mobility (56 kDa), as determined in SDS-polyacrylamide gel electrophoresis and immu- noblotting. By Western blotting, dog FMO1 and dog FMO3 were detected in microsomes from liver and lung but not in kidney microsomes. By Northern blotting, the probe for FMO1 specifically hybridized a 2.6-kilobase (kb) transcript in liver and lung samples only. The probe for FMO3 hybridized two transcripts of approxi- mately 3 and 4.2 kb in the liver and lung samples}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } The expression of flavin-containing monooxygenases (FMOs) in dog liver microsomes was suggested by a high methimazole S- oxidase activity. When the reaction was catalyzed by dog liver microsomes, apparent Vmax and Km values were 6.3 nmol/min/mg and 14 ? M, respectively. This reaction was highly inhibited (73%) in the presence of imipramine, but it was also weakly affected by trimethylamine, suggesting the involvement of different isoforms. The sequences of dog FMO1 and FMO3 were obtained by reverse transcription-polymerase chain reaction and 5?/3? terminal exten- sion. The cDNAs of dog FMO1 and dog FMO3 encode proteins of 532 amino acids, which contain the NADPH- and FAD-binding sites. The dog FMO1 amino acid sequence is 88, 86, and 89% identical to sequences of human, rabbit, and pig FMO1, respec- tively. The dog FMO3 amino acid sequence is 83, 84, and 82% identical to sequences of human, rabbit, and rat FMO3, respec- tively. Dog FMO1 and dog FMO3 exhibited only 56% identities. The FMO1 and FMO3 recombinant proteins and the FMO1 and FMO3 microsomal proteins migrated with the same mobility (56 kDa), as determined in SDS-polyacrylamide gel electrophoresis and immu- noblotting. By Western blotting, dog FMO1 and dog FMO3 were detected in microsomes from liver and lung but not in kidney microsomes. By Northern blotting, the probe for FMO1 specifically hybridized a 2.6-kilobase (kb) transcript in liver and lung samples only. The probe for FMO3 hybridized two transcripts of approxi- mately 3 and 4.2 kb in the liver and lung samples |
ł, Rafa; Luckner, Marcin Long term analysis of the localization model based on Wi-Fi network Inproceedings Studies in Computational Intelligence, pp. 87–96, 2016, ISSN: 1860949X. Abstract | Links | BibTeX | Tagi: @inproceedings{Gorak2016bb, title = {Long term analysis of the localization model based on Wi-Fi network}, author = {Rafa{ł} Górak and Marcin Luckner}, doi = {10.1007/978-3-319-31277-4_8}, issn = {1860949X}, year = {2016}, date = {2016-01-01}, booktitle = {Studies in Computational Intelligence}, volume = {642}, pages = {87--96}, abstract = {The paper presents the analysis of long term accuracy of the localization solution based on Wi-Fi signals. The localization model is built using random forest algorithm and it was tested using data collected between years 2012–2014 inside of a six floor building.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } The paper presents the analysis of long term accuracy of the localization solution based on Wi-Fi signals. The localization model is built using random forest algorithm and it was tested using data collected between years 2012–2014 inside of a six floor building. |
Luckner, Marcin; ł, Rafa Comparison of floor detection approaches for suburban area Inproceedings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 782–791, 2016, ISSN: 16113349. Abstract | Links | BibTeX | Tagi: @inproceedings{Luckner2016, title = {Comparison of floor detection approaches for suburban area}, author = {Marcin Luckner and Rafa{ł} Górak}, doi = {10.1007/978-3-662-49390-8_76}, issn = {16113349}, year = {2016}, date = {2016-01-01}, booktitle = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}, volume = {9622}, pages = {782--791}, abstract = {? Springer-Verlag Berlin Heidelberg 2016.As a part of smart-buildings, indoor localisation systems ? alternative to Global Positioning System localisation ? bring constantly improving results. Several localisation methods works with a horizontal localisation error less than few meters. However, for small suburban houses, horizontal localisation is not as important as detection of the current floor, which in is still a challenge in multi-storey buildings. This paper compares several approaches that can be used in fingerprintingbased floor detection systems. The tests include the following fingerprints: pressure measures, Wi-Fi signals, and two generations of cellular networks signals. The tests have been done in the suburban 3-storey building with underdeveloped Wi-Fi and cellular infrastructure. Notwithstanding, the floor detection based on Received Signal Strength from both infrastructures reached from 98 to 100%. Additionally, we showed that differences in the number of measures and differences in the number of received signals were not a major factor that influenced on accuracy.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } ? Springer-Verlag Berlin Heidelberg 2016.As a part of smart-buildings, indoor localisation systems ? alternative to Global Positioning System localisation ? bring constantly improving results. Several localisation methods works with a horizontal localisation error less than few meters. However, for small suburban houses, horizontal localisation is not as important as detection of the current floor, which in is still a challenge in multi-storey buildings. This paper compares several approaches that can be used in fingerprintingbased floor detection systems. The tests include the following fingerprints: pressure measures, Wi-Fi signals, and two generations of cellular networks signals. The tests have been done in the suburban 3-storey building with underdeveloped Wi-Fi and cellular infrastructure. Notwithstanding, the floor detection based on Received Signal Strength from both infrastructures reached from 98 to 100%. Additionally, we showed that differences in the number of measures and differences in the number of received signals were not a major factor that influenced on accuracy. |
Homenda, Wladyslaw; Luckner, Marcin; Pedrycz, Witold Classification with rejection: Concepts and evaluations Inproceedings Advances in Intelligent Systems and Computing, pp. 413–425, 2016, ISSN: 21945357. Abstract | Links | BibTeX | Tagi: Binary classifiers ensemble, Reclassification, Rejection rule @inproceedings{Homenda2016, title = {Classification with rejection: Concepts and evaluations}, author = {Wladyslaw Homenda and Marcin Luckner and Witold Pedrycz}, doi = {10.1007/978-3-319-19090-7_31}, issn = {21945357}, year = {2016}, date = {2016-01-01}, booktitle = {Advances in Intelligent Systems and Computing}, volume = {364}, pages = {413--425}, abstract = {? Springer International Publishing Switzerland 2016.Standard classification process allocates all processed elements to given classes. Such type of classification assumes that there are only native and no foreign elements, i.e., all processed elements are included in given classes. The quality of standard classification can be measured by two factors: numbers of correctly and incorrectly classified elements, called True Positives and False Positives. Admitting foreign elements in standard classification process increases False Positives and, in this way, deteriorates quality of classification. In this context, it is desired to reject foreign elements, i.e., not to assign them to any of given classes. Rejecting foreign elements will reduce the number of false positives, but can also reject native elements reducing True Positives as side effect. Therefore, it is important to build well-designed rejection, which will reject significant part of foreigners and only few natives. In this paper, evaluations of classification with rejection concepts are presented. Three main models: a classification without rejection, a classification with rejection, and a classification with reclassification are presented. The concepts are illustrated by flexible ensembles of binary classifiers with evaluations of eachmodel. The proposed models can be used, in particular, as classifiers working with noised data, where recognized input is not limited to elements of known classes.}, keywords = {Binary classifiers ensemble, Reclassification, Rejection rule}, pubstate = {published}, tppubtype = {inproceedings} } ? Springer International Publishing Switzerland 2016.Standard classification process allocates all processed elements to given classes. Such type of classification assumes that there are only native and no foreign elements, i.e., all processed elements are included in given classes. The quality of standard classification can be measured by two factors: numbers of correctly and incorrectly classified elements, called True Positives and False Positives. Admitting foreign elements in standard classification process increases False Positives and, in this way, deteriorates quality of classification. In this context, it is desired to reject foreign elements, i.e., not to assign them to any of given classes. Rejecting foreign elements will reduce the number of false positives, but can also reject native elements reducing True Positives as side effect. Therefore, it is important to build well-designed rejection, which will reject significant part of foreigners and only few natives. In this paper, evaluations of classification with rejection concepts are presented. Three main models: a classification without rejection, a classification with rejection, and a classification with reclassification are presented. The concepts are illustrated by flexible ensembles of binary classifiers with evaluations of eachmodel. The proposed models can be used, in particular, as classifiers working with noised data, where recognized input is not limited to elements of known classes. |
Wilkowski, Artur; Luckner, Marcin Low-cost canoe counting system for application in a natural environment Inproceedings Advances in Intelligent Systems and Computing, pp. 705–715, 2016, ISSN: 21945357. Abstract | Links | BibTeX | Tagi: Classification with rejection, Computer vision, Pattern recognition @inproceedings{Wilkowski2016, title = {Low-cost canoe counting system for application in a natural environment}, author = {Artur Wilkowski and Marcin Luckner}, doi = {10.1007/978-3-319-29357-8_61}, issn = {21945357}, year = {2016}, date = {2016-01-01}, booktitle = {Advances in Intelligent Systems and Computing}, volume = {440}, pages = {705--715}, abstract = {? Springer International Publishing Switzerland 2016.This paper presents low-cost system for counting canoes and canoeists to control cannoning tourist routes. The created system was implemented on Raspberry Pi 2 and the total cost of the tracking device is less than 200$. The proposed algorithmuses background subtraction and Support Vector Machines to track vessels and recognize canoes among them. The obtained results are rewarding as for low-cost solution. Depending on considered group of objects the accuracy of the algorithm reaches 84, 89.5, and 96% for canoes, vessels, and all objects respectively.}, keywords = {Classification with rejection, Computer vision, Pattern recognition}, pubstate = {published}, tppubtype = {inproceedings} } ? Springer International Publishing Switzerland 2016.This paper presents low-cost system for counting canoes and canoeists to control cannoning tourist routes. The created system was implemented on Raspberry Pi 2 and the total cost of the tracking device is less than 200$. The proposed algorithmuses background subtraction and Support Vector Machines to track vessels and recognize canoes among them. The obtained results are rewarding as for low-cost solution. Depending on considered group of objects the accuracy of the algorithm reaches 84, 89.5, and 96% for canoes, vessels, and all objects respectively. |
ł, Rafa; Luckner, Marcin Modified random forest algorithm for Wi–Fi indoor localization system Inproceedings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 147–157, 2016, ISSN: 16113349. Abstract | Links | BibTeX | Tagi: @inproceedings{Gorak2016b, title = {Modified random forest algorithm for Wi–Fi indoor localization system}, author = {Rafa{ł} Górak and Marcin Luckner}, doi = {10.1007/978-3-319-45246-3_14}, issn = {16113349}, year = {2016}, date = {2016-01-01}, booktitle = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}, volume = {9876 LNCS}, pages = {147--157}, abstract = {INTRODUCTION: Thoracotomy as surgical approach for esophageal atresia treatment entails the risk of deformation of the rib cage and consequently secondary thoracogenic scoliosis. The aim of our study was to assess these thoracic wall anomalies on a large national cohort and search for factors influencing this morbidity. MATERIALS AND METHODS: Pediatric surgery departments from our national network were asked to send recent thoracic X-ray and operative reports for patients born between 2008 and 2010 with esophageal atresia. The X-rays were read in a double-blind manner to detect costal and vertebral anomalies. RESULTS: Among 322 inclusions from 32 centers, 110 (34.2%) X-rays were normal and 25 (7.7%) displayed thoracic malformations, including 14 hemivertebrae. We found 187 (58.1%) sequelae of surgery, including 85 costal hypoplasia, 47 other types of costal anomalies, 46 intercostal space anomalies, 21 costal fusions and 12 scoliosis, with some patients suffering from several lesions. The rate of patients with these sequelae was not influenced by age at intervention, weight at birth, type of atresia, number of thoracotomy or size of the center. The rate of sequelae was higher following a classical thoracotomy (59.1%), whatever the way that thoracotomy was performed, compared to nonconverted thoracoscopy (22.2%; p=0.04). CONCLUSION: About 60 % of the patients suffered from a thoracic wall morbidity caused by the thoracotomy performed as part of surgical treatment of esophageal atresia. Minimally invasive techniques reduced thoracic wall morbidity. Further studies should be carried out to assess the potential benefit of minimally invasive approaches to patient pulmonary functions and on the occurrence of thoracogenic scoliosis in adulthood. LEVELS OF EVIDENCE: Level III retrospective comparative treatment study.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } INTRODUCTION: Thoracotomy as surgical approach for esophageal atresia treatment entails the risk of deformation of the rib cage and consequently secondary thoracogenic scoliosis. The aim of our study was to assess these thoracic wall anomalies on a large national cohort and search for factors influencing this morbidity. MATERIALS AND METHODS: Pediatric surgery departments from our national network were asked to send recent thoracic X-ray and operative reports for patients born between 2008 and 2010 with esophageal atresia. The X-rays were read in a double-blind manner to detect costal and vertebral anomalies. RESULTS: Among 322 inclusions from 32 centers, 110 (34.2%) X-rays were normal and 25 (7.7%) displayed thoracic malformations, including 14 hemivertebrae. We found 187 (58.1%) sequelae of surgery, including 85 costal hypoplasia, 47 other types of costal anomalies, 46 intercostal space anomalies, 21 costal fusions and 12 scoliosis, with some patients suffering from several lesions. The rate of patients with these sequelae was not influenced by age at intervention, weight at birth, type of atresia, number of thoracotomy or size of the center. The rate of sequelae was higher following a classical thoracotomy (59.1%), whatever the way that thoracotomy was performed, compared to nonconverted thoracoscopy (22.2%; p=0.04). CONCLUSION: About 60 % of the patients suffered from a thoracic wall morbidity caused by the thoracotomy performed as part of surgical treatment of esophageal atresia. Minimally invasive techniques reduced thoracic wall morbidity. Further studies should be carried out to assess the potential benefit of minimally invasive approaches to patient pulmonary functions and on the occurrence of thoracogenic scoliosis in adulthood. LEVELS OF EVIDENCE: Level III retrospective comparative treatment study. |
ł, Rafa; Luckner, Marcin; ł, Micha; Porter-Sobieraj, Joanna; Wawrzyniak, Piotr Indoor Localisation Based on GSM Signals: Multistorey Building Study Journal Article Mobile Information Systems, 2016 , 2016, ISSN: 1875905X. Abstract | Links | BibTeX | Tagi: @article{Gorak2016, title = {Indoor Localisation Based on GSM Signals: Multistorey Building Study}, author = {Rafa{ł} Górak and Marcin Luckner and Micha{ł} Okulewicz and Joanna Porter-Sobieraj and Piotr Wawrzyniak}, doi = {10.1155/2016/2719576}, issn = {1875905X}, year = {2016}, date = {2016-01-01}, journal = {Mobile Information Systems}, volume = {2016}, abstract = {Among the accurate indoor localisation systems that are using WiFi, Bluetooth, or infrared technologies, the ones that are based on the GSM rely on a stable external infrastructure that can be used even in an emergency. This paper presents an accurate GSM indoor localisation system that achieves a median error of 4.39 metres in horizontal coordinates and up to 64 percent accuracy in floor prediction (for 84 percent of cases the floor prediction is mistaken by not more than a single floor). The test and reference measurements were made inside a six-floor academic building, with an irregular shape, whose dimensions are around 50 metres by 70 metres. The localisation algorithm uses GSM signal readings from the 7 strongest cells available in the GSM standard (or fewer, if fewer than 7 are available). We estimate the location by a three-step method. Firstly, we propose a point localisation solution (i.e., localisation based on only one measurement). Then, by applying the central tendency filters and the Multilayer Perceptron, we build a localisation system that uses a sequence of estimations of current and past locations. We also discuss major accuracy factors such as the number of observed signals or the types of spaces in the building.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Among the accurate indoor localisation systems that are using WiFi, Bluetooth, or infrared technologies, the ones that are based on the GSM rely on a stable external infrastructure that can be used even in an emergency. This paper presents an accurate GSM indoor localisation system that achieves a median error of 4.39 metres in horizontal coordinates and up to 64 percent accuracy in floor prediction (for 84 percent of cases the floor prediction is mistaken by not more than a single floor). The test and reference measurements were made inside a six-floor academic building, with an irregular shape, whose dimensions are around 50 metres by 70 metres. The localisation algorithm uses GSM signal readings from the 7 strongest cells available in the GSM standard (or fewer, if fewer than 7 are available). We estimate the location by a three-step method. Firstly, we propose a point localisation solution (i.e., localisation based on only one measurement). Then, by applying the central tendency filters and the Multilayer Perceptron, we build a localisation system that uses a sequence of estimations of current and past locations. We also discuss major accuracy factors such as the number of observed signals or the types of spaces in the building. |
2015 |
ł, Rafa; Luckner, Marcin Malfunction immune wi–fi localisation method Inproceedings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 328–337, 2015, ISSN: 16113349. Abstract | Links | BibTeX | Tagi: @inproceedings{Gorak2015b, title = {Malfunction immune wi–fi localisation method}, author = {Rafa{ł} Górak and Marcin Luckner}, doi = {10.1007/978-3-319-24069-5_31}, issn = {16113349}, year = {2015}, date = {2015-01-01}, booktitle = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}, volume = {9329}, pages = {328--337}, abstract = {Indoor localisation systems based on a Wi–Fi local area wireless technology bring constantly improving results. However, the whole localisation system may fail when one or more Access Point (AP) malfunctions. In this paper we present how to limit the number of observed APs and how to create a malfunction immune localisation method. The presented solutions are an ensemble of random forests with an additional malfunction detection system. The proposed solution reduces a growth of the localisation error to 4 percent for the floor detection inside a six floor building and 2 metres for the horizontal detection in case of a gross malfunction of an AP infrastructure. The system without proposed improvements may give the errors greater than 30 percent and 7 metres respectively in case of not detected changes in the AP's infrastructure.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Indoor localisation systems based on a Wi–Fi local area wireless technology bring constantly improving results. However, the whole localisation system may fail when one or more Access Point (AP) malfunctions. In this paper we present how to limit the number of observed APs and how to create a malfunction immune localisation method. The presented solutions are an ensemble of random forests with an additional malfunction detection system. The proposed solution reduces a growth of the localisation error to 4 percent for the floor detection inside a six floor building and 2 metres for the horizontal detection in case of a gross malfunction of an AP infrastructure. The system without proposed improvements may give the errors greater than 30 percent and 7 metres respectively in case of not detected changes in the AP's infrastructure. |
Luckner, Marcin Conversion of decision tree into deterministic finite automaton for high accuracy online SYN flood detection Inproceedings Proceedings - 2015 IEEE Symposium Series on Computational Intelligence, SSCI 2015, pp. 75–82, 2015, ISBN: 9781479975600. Abstract | Links | BibTeX | Tagi: @inproceedings{Luckner2015b, title = {Conversion of decision tree into deterministic finite automaton for high accuracy online SYN flood detection}, author = {Marcin Luckner}, doi = {10.1109/SSCI.2015.21}, isbn = {9781479975600}, year = {2015}, date = {2015-01-01}, booktitle = {Proceedings - 2015 IEEE Symposium Series on Computational Intelligence, SSCI 2015}, pages = {75--82}, abstract = {? 2015 IEEE.While collecting data from network traffic, one can create classifiers that recognize threats, anomalies, or other events. The set of labelled Net Flow records collecting traffic statistics is a very useful source of decision rules that classify the records. These rules can be created automatically using machine learning techniques. However, the classifiers learned on such records may recognise only past events and cannot recognise current events, because not all data were collected. A deterministic finite automaton is a classifier that can recognise events online. However, the automaton is hard to project in case of complex issues. The paper proposes how to convert a decision tree into a deterministic finite automaton. The decision tree learns how to recognise threats using the collected data. Consequently, the set of decision rules is transformed into a finite automaton that can detect events before the full complement of data is collected. The method is limited to small trees, but can solve real problems. As an example, the detection of the TCP SYN flood attack is presented. For that example, the created automaton has the same high accuracy ratio as the decision tree, but can take decisions over three times faster.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } ? 2015 IEEE.While collecting data from network traffic, one can create classifiers that recognize threats, anomalies, or other events. The set of labelled Net Flow records collecting traffic statistics is a very useful source of decision rules that classify the records. These rules can be created automatically using machine learning techniques. However, the classifiers learned on such records may recognise only past events and cannot recognise current events, because not all data were collected. A deterministic finite automaton is a classifier that can recognise events online. However, the automaton is hard to project in case of complex issues. The paper proposes how to convert a decision tree into a deterministic finite automaton. The decision tree learns how to recognise threats using the collected data. Consequently, the set of decision rules is transformed into a finite automaton that can detect events before the full complement of data is collected. The method is limited to small trees, but can solve real problems. As an example, the detection of the TCP SYN flood attack is presented. For that example, the created automaton has the same high accuracy ratio as the decision tree, but can take decisions over three times faster. |
Luckner, Marcin Conversion of decision tree into deterministic finite automaton for high accuracy online SYN flood detection Inproceedings Proceedings - 2015 IEEE Symposium Series on Computational Intelligence, SSCI 2015, pp. 75–82, 2015, ISBN: 9781479975600. Abstract | Links | BibTeX | Tagi: @inproceedings{Luckner2015, title = {Conversion of decision tree into deterministic finite automaton for high accuracy online SYN flood detection}, author = {Marcin Luckner}, doi = {10.1109/SSCI.2015.21}, isbn = {9781479975600}, year = {2015}, date = {2015-01-01}, booktitle = {Proceedings - 2015 IEEE Symposium Series on Computational Intelligence, SSCI 2015}, pages = {75--82}, abstract = {? 2015 IEEE.While collecting data from network traffic, one can create classifiers that recognize threats, anomalies, or other events. The set of labelled Net Flow records collecting traffic statistics is a very useful source of decision rules that classify the records. These rules can be created automatically using machine learning techniques. However, the classifiers learned on such records may recognise only past events and cannot recognise current events, because not all data were collected. A deterministic finite automaton is a classifier that can recognise events online. However, the automaton is hard to project in case of complex issues. The paper proposes how to convert a decision tree into a deterministic finite automaton. The decision tree learns how to recognise threats using the collected data. Consequently, the set of decision rules is transformed into a finite automaton that can detect events before the full complement of data is collected. The method is limited to small trees, but can solve real problems. As an example, the detection of the TCP SYN flood attack is presented. For that example, the created automaton has the same high accuracy ratio as the decision tree, but can take decisions over three times faster.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } ? 2015 IEEE.While collecting data from network traffic, one can create classifiers that recognize threats, anomalies, or other events. The set of labelled Net Flow records collecting traffic statistics is a very useful source of decision rules that classify the records. These rules can be created automatically using machine learning techniques. However, the classifiers learned on such records may recognise only past events and cannot recognise current events, because not all data were collected. A deterministic finite automaton is a classifier that can recognise events online. However, the automaton is hard to project in case of complex issues. The paper proposes how to convert a decision tree into a deterministic finite automaton. The decision tree learns how to recognise threats using the collected data. Consequently, the set of decision rules is transformed into a finite automaton that can detect events before the full complement of data is collected. The method is limited to small trees, but can solve real problems. As an example, the detection of the TCP SYN flood attack is presented. For that example, the created automaton has the same high accuracy ratio as the decision tree, but can take decisions over three times faster. |
ł, Rafa; Luckner, Marcin Malfunction immune wi–fi localisation method Inproceedings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 328–337, 2015, ISSN: 16113349. Abstract | Links | BibTeX | Tagi: @inproceedings{Gorak2015, title = {Malfunction immune wi–fi localisation method}, author = {Rafa{ł} Górak and Marcin Luckner}, doi = {10.1007/978-3-319-24069-5_31}, issn = {16113349}, year = {2015}, date = {2015-01-01}, booktitle = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}, volume = {9329}, pages = {328--337}, abstract = {Indoor localisation systems based on a Wi–Fi local area wireless technology bring constantly improving results. However, the whole localisation system may fail when one or more Access Point (AP) malfunctions. In this paper we present how to limit the number of observed APs and how to create a malfunction immune localisation method. The presented solutions are an ensemble of random forests with an additional malfunction detection system. The proposed solution reduces a growth of the localisation error to 4 percent for the floor detection inside a six floor building and 2 metres for the horizontal detection in case of a gross malfunction of an AP infrastructure. The system without proposed improvements may give the errors greater than 30 percent and 7 metres respectively in case of not detected changes in the AP's infrastructure.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Indoor localisation systems based on a Wi–Fi local area wireless technology bring constantly improving results. However, the whole localisation system may fail when one or more Access Point (AP) malfunctions. In this paper we present how to limit the number of observed APs and how to create a malfunction immune localisation method. The presented solutions are an ensemble of random forests with an additional malfunction detection system. The proposed solution reduces a growth of the localisation error to 4 percent for the floor detection inside a six floor building and 2 metres for the horizontal detection in case of a gross malfunction of an AP infrastructure. The system without proposed improvements may give the errors greater than 30 percent and 7 metres respectively in case of not detected changes in the AP's infrastructure. |
2014 |
Homenda, Wladyslaw; Luckner, Marcin Pattern recognition with rejection: Application to handwritten digits Inproceedings 2014 4th World Congress on Information and Communication Technologies (WICT 2014), pp. 326–331, IEEE, 2014, ISBN: 978-1-4799-8115-1. Abstract | Links | BibTeX | Tagi: Accuracy, Classification with rejection, Handwriting recognition, native and foreign elements, pattern recognition with rejection, Standards, Support Vector Machines, Testing, Text recognition @inproceedings{Homenda2014ab, title = {Pattern recognition with rejection: Application to handwritten digits}, author = {Wladyslaw Homenda and Marcin Luckner}, url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7077288}, doi = {10.1109/WICT.2014.7077288}, isbn = {978-1-4799-8115-1}, year = {2014}, date = {2014-12-01}, booktitle = {2014 4th World Congress on Information and Communication Technologies (WICT 2014)}, pages = {326--331}, publisher = {IEEE}, abstract = {The paper considers rejecting option in pattern recognition problem. Studied are native and foreign elements in a multi-class pattern recognition. Native elements are those included in recognized classes, they are known at the stage of classifier design. Foreign elements do not belong to recognized classes. Usually foreign elements are not known when classifier is designed. If foreign elements are classified to recognized classes, recognition quality is deteriorated. So then, they are classified to native classes, if they are not rejected. In such the case, recognition quality is deteriorated. Therefore, they should be rejected by a classifier, i.e. not classified to any class. Several attempts to rejection of foreign elements are investigated in this study.}, keywords = {Accuracy, Classification with rejection, Handwriting recognition, native and foreign elements, pattern recognition with rejection, Standards, Support Vector Machines, Testing, Text recognition}, pubstate = {published}, tppubtype = {inproceedings} } The paper considers rejecting option in pattern recognition problem. Studied are native and foreign elements in a multi-class pattern recognition. Native elements are those included in recognized classes, they are known at the stage of classifier design. Foreign elements do not belong to recognized classes. Usually foreign elements are not known when classifier is designed. If foreign elements are classified to recognized classes, recognition quality is deteriorated. So then, they are classified to native classes, if they are not rejected. In such the case, recognition quality is deteriorated. Therefore, they should be rejected by a classifier, i.e. not classified to any class. Several attempts to rejection of foreign elements are investigated in this study. |
Homenda, Wladyslaw; Luckner, Marcin Pattern recognition with rejection: Application to handwritten digits Inproceedings 2014 4th World Congress on Information and Communication Technologies (WICT 2014), pp. 326–331, IEEE, 2014, ISBN: 978-1-4799-8115-1. Abstract | Links | BibTeX | Tagi: Accuracy, Classification with rejection, Handwriting recognition, native and foreign elements, pattern recognition with rejection, Standards, Support Vector Machines, Testing, Text recognition @inproceedings{Homenda2014a, title = {Pattern recognition with rejection: Application to handwritten digits}, author = {Wladyslaw Homenda and Marcin Luckner}, url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7077288}, doi = {10.1109/WICT.2014.7077288}, isbn = {978-1-4799-8115-1}, year = {2014}, date = {2014-12-01}, booktitle = {2014 4th World Congress on Information and Communication Technologies (WICT 2014)}, pages = {326--331}, publisher = {IEEE}, abstract = {The paper considers rejecting option in pattern recognition problem. Studied are native and foreign elements in a multi-class pattern recognition. Native elements are those included in recognized classes, they are known at the stage of classifier design. Foreign elements do not belong to recognized classes. Usually foreign elements are not known when classifier is designed. If foreign elements are classified to recognized classes, recognition quality is deteriorated. So then, they are classified to native classes, if they are not rejected. In such the case, recognition quality is deteriorated. Therefore, they should be rejected by a classifier, i.e. not classified to any class. Several attempts to rejection of foreign elements are investigated in this study.}, keywords = {Accuracy, Classification with rejection, Handwriting recognition, native and foreign elements, pattern recognition with rejection, Standards, Support Vector Machines, Testing, Text recognition}, pubstate = {published}, tppubtype = {inproceedings} } The paper considers rejecting option in pattern recognition problem. Studied are native and foreign elements in a multi-class pattern recognition. Native elements are those included in recognized classes, they are known at the stage of classifier design. Foreign elements do not belong to recognized classes. Usually foreign elements are not known when classifier is designed. If foreign elements are classified to recognized classes, recognition quality is deteriorated. So then, they are classified to native classes, if they are not rejected. In such the case, recognition quality is deteriorated. Therefore, they should be rejected by a classifier, i.e. not classified to any class. Several attempts to rejection of foreign elements are investigated in this study. |
a}, Katarzyna Rz{c; Luckner, Marcin 3D model reconstruction and evaluation using a collection of points extracted from the series of photographs Inproceedings 2014 Federated Conference on Computer Science and Information Systems, FedCSIS 2014, pp. 669–677, 2014, ISBN: 9788360810583. Abstract | Links | BibTeX | Tagi: 3D reconstruction, Epipolar geometry, Features extraction, Image matching, Models evaluation @inproceedings{Luckner2014bc, title = {3D model reconstruction and evaluation using a collection of points extracted from the series of photographs}, author = {Katarzyna Rz{c{a}}zewska and Marcin Luckner}, url = {https://fedcsis.org/proceedings/2014/drp/304.html}, doi = {10.15439/2014F304}, isbn = {9788360810583}, year = {2014}, date = {2014-09-01}, booktitle = {2014 Federated Conference on Computer Science and Information Systems, FedCSIS 2014}, pages = {669--677}, abstract = {This work describes the whole process of 3D model reconstruction. It begins with the representation of the method that is used to find the matching between photographs and the methodology to use the data to form the initial structure of the reconstructed model, represented by a point cloud. As a next stage, a refinement process is performed, using the bundle adjustment method. A set of stereovision methods is used later on to find a more detailed solution. Those algorithms use pairs of images, therefore as a prerequisite a set of routines that aggregates those results is studied. The paper is concluded with a description of how the point cloud is processed, including the surface reconstruction, to form the result. The described methodology is illustrated with reconstructions of three series of professional photographs from a public repository and one series of amateur photographs created especially for this work. The results were evaluated by the proposed area matching and contour matching measures.}, keywords = {3D reconstruction, Epipolar geometry, Features extraction, Image matching, Models evaluation}, pubstate = {published}, tppubtype = {inproceedings} } This work describes the whole process of 3D model reconstruction. It begins with the representation of the method that is used to find the matching between photographs and the methodology to use the data to form the initial structure of the reconstructed model, represented by a point cloud. As a next stage, a refinement process is performed, using the bundle adjustment method. A set of stereovision methods is used later on to find a more detailed solution. Those algorithms use pairs of images, therefore as a prerequisite a set of routines that aggregates those results is studied. The paper is concluded with a description of how the point cloud is processed, including the surface reconstruction, to form the result. The described methodology is illustrated with reconstructions of three series of professional photographs from a public repository and one series of amateur photographs created especially for this work. The results were evaluated by the proposed area matching and contour matching measures. |
Publikacje
2021 |
Fault detection of jet engine heat sensor Journal Article Procedia Computer Science, 192 , pp. 844–852, 2021, ISSN: 18770509. |
Contravening Citizen's Privacy : Warsaw Use Case Journal Article IEEE Transactions on Systems, Man, and Cybernetics: Systems, pp. 1–13, 2021. |
2020 |
IoT Architecture for Urban Data-Centric Services and Applications Journal Article ACM Transactions on Internet Technology, 20 (3), 2020, ISSN: 15576051. |
Automatic detection of changes in signal strength characteristics in a wi-fi network for an indoor localisation system Journal Article Sensors (Switzerland), 20 (7), pp. 1–13, 2020, ISSN: 14248220. |
Automatic detection of changes in signal strength characteristics in a wi-fi network for an indoor localisation system Journal Article Sensors (Switzerland), 20 (7), pp. 1–13, 2020, ISSN: 14248220. |
IoT Architecture for Urban Data-Centric Services and Applications Journal Article ACM Transactions on Internet Technology, 20 (3), 2020, ISSN: 15576051. |
2019 |
Practical web spam lifelong machine learning system with automatic adjustment to current lifecycle phase Journal Article Security and Communication Networks, 2019 , 2019, ISSN: 19390122. |
Estimation of Free Space on Car Park Using Computer Vision Algorithms Inproceedings Advances in Intelligent Systems and Computing, pp. 316–325, 2019, ISSN: 21945357. |
City Bus Monitoring Supported by Computer Vision and Machine Learning Algorithms Inproceedings Advances in Intelligent Systems and Computing, pp. 326–336, 2019, ISSN: 21945357. |
Big data w analizie funkcjonowania systemu komunikacji miejskiej Incollection Ocena wpływu miejskich projektów transportowych Programu Operacyjnego Infrastruktura i Środowisko, pp. 116–137, Centrum Unijnych Projektów Transportowych, 2019. |
Antyscam-Practical web spam classifier Journal Article International Journal of Electronics and Telecommunications, 65 (4), pp. 713–722, 2019, ISSN: 23001933. |
Antyscam-Practical web spam classifier Journal Article International Journal of Electronics and Telecommunications, 65 (4), pp. 713–722, 2019, ISSN: 23001933. |
Estimation of Free Space on Car Park Using Computer Vision Algorithms Inproceedings Advances in Intelligent Systems and Computing, pp. 316–325, 2019, ISSN: 21945357. |
City Bus Monitoring Supported by Computer Vision and Machine Learning Algorithms Inproceedings Advances in Intelligent Systems and Computing, pp. 326–336, 2019, ISSN: 21945357. |
Big data w analizie funkcjonowania systemu komunikacji miejskiej Incollection Ocena wpływu miejskich projektów transportowych Programu Operacyjnego Infrastruktura i Środowisko, pp. 116–137, Centrum Unijnych Projektów Transportowych, 2019. |
Practical web spam lifelong machine learning system with automatic adjustment to current lifecycle phase Journal Article Security and Communication Networks, 2019 , 2019, ISSN: 19390122. |
2018 |
Automatic detection of missing access points in indoor positioning system Journal Article Sensors (Switzerland), 18 (11), 2018, ISSN: 14248220. |
Automatic detection of missing access points in indoor positioning system Journal Article Sensors (Switzerland), 18 (11), 2018, ISSN: 14248220. |
The use of presence data in modelling demand for transportation Miscellaneous 2018. |
The use of presence data in modelling demand for transportation Miscellaneous 2018. |
2017 |
Public transport stops state detection and propagation warsaw use case Inproceedings SMARTGREENS 2017 - Proceedings of the 6th International Conference on Smart Cities and Green ICT Systems, pp. 235–241, 2017, ISBN: 9789897582417. |
Evil-AP - Mobile man-in-the-middle threat Inproceedings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 617–627, 2017, ISSN: 16113349. |
Estimation of Delays for Individual Trams to Monitor Issues in Public Transport Infrastructure Inproceedings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 518–527, 2017, ISSN: 16113349. |
Clustering of Mobile Subscriber's Location Statistics for Travel Demand Zones Diversity Inproceedings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 315–326, 2017, ISSN: 16113349. |
Application of XGboost algorithm in fingerprinting localisation task Inproceedings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 661–671, 2017, ISSN: 16113349. |
Public transport stops state detection and propagation warsaw use case Inproceedings SMARTGREENS 2017 - Proceedings of the 6th International Conference on Smart Cities and Green ICT Systems, pp. 235–241, 2017, ISBN: 9789897582417. |
Estimation of Delays for Individual Trams to Monitor Issues in Public Transport Infrastructure Inproceedings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 518–527, 2017, ISSN: 16113349. |
Evil-AP - Mobile man-in-the-middle threat Inproceedings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 617–627, 2017, ISSN: 16113349. |
Application of XGboost algorithm in fingerprinting localisation task Inproceedings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 661–671, 2017, ISSN: 16113349. |
Clustering of Mobile Subscriber's Location Statistics for Travel Demand Zones Diversity Inproceedings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 315–326, 2017, ISSN: 16113349. |
2016 |
Modified random forest algorithm for Wi–Fi indoor localization system Journal Article Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9876 LNCS (208921), pp. 147–157, 2016, ISSN: 16113349. |
Low-cost canoe counting system for application in a natural environment Inproceedings Advances in Intelligent Systems and Computing, pp. 705–715, 2016, ISSN: 21945357. |
Long term analysis of the localization model based on Wi-Fi network Inproceedings Studies in Computational Intelligence, pp. 87–96, 2016, ISSN: 1860949X. |
Hybrid algorithm for floor detection using GSM signals in indoor localisation task Inproceedings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 730–741, 2016, ISSN: 16113349. |
Comparison of floor detection approaches for suburban area Inproceedings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 782–791, 2016, ISSN: 16113349. |
Classification with rejection: Concepts and evaluations Inproceedings Advances in Intelligent Systems and Computing, pp. 413–425, 2016, ISSN: 21945357. |
Hybrid algorithm for floor detection using GSM signals in indoor localisation task Inproceedings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 730–741, 2016, ISSN: 16113349. |
Long term analysis of the localization model based on Wi-Fi network Inproceedings Studies in Computational Intelligence, pp. 87–96, 2016, ISSN: 1860949X. |
Comparison of floor detection approaches for suburban area Inproceedings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 782–791, 2016, ISSN: 16113349. |
Classification with rejection: Concepts and evaluations Inproceedings Advances in Intelligent Systems and Computing, pp. 413–425, 2016, ISSN: 21945357. |
Low-cost canoe counting system for application in a natural environment Inproceedings Advances in Intelligent Systems and Computing, pp. 705–715, 2016, ISSN: 21945357. |
Modified random forest algorithm for Wi–Fi indoor localization system Inproceedings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 147–157, 2016, ISSN: 16113349. |
Indoor Localisation Based on GSM Signals: Multistorey Building Study Journal Article Mobile Information Systems, 2016 , 2016, ISSN: 1875905X. |
2015 |
Malfunction immune wi–fi localisation method Inproceedings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 328–337, 2015, ISSN: 16113349. |
Conversion of decision tree into deterministic finite automaton for high accuracy online SYN flood detection Inproceedings Proceedings - 2015 IEEE Symposium Series on Computational Intelligence, SSCI 2015, pp. 75–82, 2015, ISBN: 9781479975600. |
Conversion of decision tree into deterministic finite automaton for high accuracy online SYN flood detection Inproceedings Proceedings - 2015 IEEE Symposium Series on Computational Intelligence, SSCI 2015, pp. 75–82, 2015, ISBN: 9781479975600. |
Malfunction immune wi–fi localisation method Inproceedings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 328–337, 2015, ISSN: 16113349. |
2014 |
Pattern recognition with rejection: Application to handwritten digits Inproceedings 2014 4th World Congress on Information and Communication Technologies (WICT 2014), pp. 326–331, IEEE, 2014, ISBN: 978-1-4799-8115-1. |
Pattern recognition with rejection: Application to handwritten digits Inproceedings 2014 4th World Congress on Information and Communication Technologies (WICT 2014), pp. 326–331, IEEE, 2014, ISBN: 978-1-4799-8115-1. |
3D model reconstruction and evaluation using a collection of points extracted from the series of photographs Inproceedings 2014 Federated Conference on Computer Science and Information Systems, FedCSIS 2014, pp. 669–677, 2014, ISBN: 9788360810583. |