Leszek Siwik

Prof. Leszek Siwik

AGH Univeristy of Science and Technology
orcid

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2015 in The Knowledge Engineering Review
Verified
Journal Article
Closed access
PDF file
ABAleksander Byrski
Aleksander Byrski
Rafal DrezewskiRafal Drezewski
Rafal Drezewski
Leszek SiwikLeszek Siwik
Leszek Siwik
MKMarek Kisiel-Dorohinicki
Marek Kisiel-Dorohinicki
The aim of this paper is to give a survey on the development and applications of evolutionary multi-agent systems (EMAS). The paper starts with a general introduction describing the background, structure and behaviour of EMAS. EMAS application to solving global optimisation problems is presented in the next section along with its modification targeted at lowering the computation costs by early removing certain agents based on immunological inspirations. Subsequent sections deal with the elitist variant of EMAS aimed at solving multi-criteria optimisation problems, and the co-evolutionary one aimed at solving multi-modal optimisation problems. Each variation of EMAS is illustrated with selected experimental results.

Verified
Journal Article
Open access
PDF file
MPMateusz Piech
Mateusz Piech
ASAleksander Smywiński-Pohl
Aleksander Smywiński-Pohl
RMRobert Marcjan
Robert Marcjan
Leszek SiwikLeszek Siwik
Leszek Siwik
Complementing information about particular points, places, or institutions, i.e., so-called Points of Interest (POIs) can be achieved by matching data from the growing number of geospatial databases; these include Foursquare, OpenStreetMap, Yelp, and Facebook Places. Doing this potentially allows for the acquisition of more accurate and more complete information about POIs than would be possible by merely extracting the information from each of the systems alone. Problem: The task of Points of Interest matching, and the development of an algorithm to perform this automatically, are quite challenging problems due to the prevalence of different data structures, data incompleteness, conflicting information, naming differences, data inaccuracy, and cultural and language differences; in short, the difficulties experienced in the process of obtaining (complementary) information about the POI from different sources are due, in part, to the lack of standardization among Points of Interest descriptions; a further difficulty stems from the vast and rapidly growing amount of data to be assessed on each occasion. Research design and contributions: To propose an efficient algorithm for automatic Points of Interest matching, we: (1) analyzed available data sources—their structures, models, attributes, number of objects, the quality of data (number of missing attributes), etc.—and defined a unified POI model; (2) prepared a fairly large experimental dataset consisting of 50,000 matching and 50,000 non-matching points, taken from different geographical, cultural, and language areas; (3) comprehensively reviewed metrics that can be used for assessing the similarity between Points of Interest; (4) proposed and verified different strategies for dealing with missing or incomplete attributes; (5) reviewed and analyzed six different classifiers for Points of Interest matching, conducting experiments and follow-up comparisons to determine the most effective combination of similarity metric, strategy for dealing with missing data, and POIs matching classifier; and (6) presented an algorithm for automatic Points of Interest matching, detailing its accuracy and carrying out a complexity analysis. Results and conclusions: The main results of the research are: (1) comprehensive experimental verification and numerical comparisons of the crucial Points of Interest matching components (similarity metrics, approaches for dealing with missing data, and classifiers), indicating that the best Points of Interest matching classifier is a combination of random forest algorithm coupled with marking of missing data and mixing different similarity metrics for different POI attributes; and (2) an efficient greedy algorithm for automatic POI matching. At a cost of just 3.5% in terms of accuracy, it allows for reducing POI matching time complexity by two orders of magnitude in comparison to the exact algorithm.

31 January 2009
Verified
Book Chapter
Closed access
PDF file
Rafal DrezewskiRafal Drezewski
Rafal Drezewski
JSJan Sepielak
Jan Sepielak
Leszek SiwikLeszek Siwik
Leszek Siwik

23 March 2022 in Computers & Mathematics with Applications
Verified
Journal Article
Closed access
MPMaciej Paszynski
Maciej Paszynski
Leszek SiwikLeszek Siwik
Leszek Siwik
WDWitold Dzwinel
Witold Dzwinel
KPKeshav Pingali
Keshav Pingali


4 November 2018 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Open access
Leszek SiwikLeszek Siwik
Leszek Siwik
MWMaciej Wozniak
Maciej Wozniak
VTVictor Trujillo
Victor Trujillo
DPDavid Pardo
David Pardo
Victor CaloVictor Calo
Victor Calo
MPMaciej Paszynski
Maciej Paszynski
We study three-dimensional isogeometric analysis (IGA) and the solution of the resulting system of linear equations via a direct solver. IGA uses highly continuous $C^{p-1}$Cp-1 basis functions, which provide multiple benefits in terms of stability and convergence properties. However, smooth basis significantly deteriorate the direct solver performance and its parallel scalability. As a partial remedy for this, refined Isogeometric Analysis (rIGA) method improves the sequential execution of direct solvers. The refinement strategy enriches traditional highly-continuous $C^{p-1}$Cp-1 IGA spaces by introducing low-continuity $C^0$C0-hyperplanes along the boundaries of certain pre-defined macro-elements. In this work, we propose a solution strategy for rIGA for parallel distributed memory machines and compare the computational costs of solving rIGA versus IGA discretizations. We verify our estimates with parallel numerical experiments. Results show that the weak parallel scalability of the direct solver improves approximately by a factor of $p^2$p2 when considering rIGA discretizations rather than highly-continuous IGA spaces.