Piotr Beling
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Piotr Beling has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Maciej Dems
Lodz University of Technology
2 shared publications Maciej Kuc
Lodz Univ. of Technology (Poland)
2 shared publications- Marcin Gebski
Institute of Physics, Lodz University of Technology, Łódź, Poland
2 shared publications - Michał Wasiak
Institute of Physics, Lodz University of Technology, Lodz, Poland
2 shared publications - Robert P. Sarzala
Institute of Physics, Lodz University of Technology, ul. Wólczańska 217/221, 90-003 Łódź, Poland
2 shared publications - Łukasz Piskorski
Lodz Univ. of Technology (Poland)
2 shared publications
Latest Publications
- Open Access
- 26 June 2023
- Published by Association for Computing Machinery (ACM) in ACM Journal of Experimental Algorithmics
- Vol. 28, 1-16
Fingerprinting-based Minimal Perfect Hashing Revisited
In this paper we study a fingerprint-based minimal perfect hash function ( FMPH for short). While FMPH is not as space-efficient as some other minimal perfect hash functions (for example RecSplit, CHD, or PTHash), it has a number of practical advantages that make it worthy of consideration. FMPH is simple and quite fast to evaluate. Its construction requires very little auxiliary memory, takes a short time and, in addition, can be parallelized or carried out without holding keys in memory. In this paper, we propose an effective method (called FMPHGO ) that reduces the size of FMPH, as well as a number of implementation improvements. In addition, we experimentally study FMPHGO performance and find the best values for its parameters. Our benchmarks show that with our method and an efficient structure to support the rank queries on a bit vector, the FMPH size can be reduced to about 2.1 bits/key, which is close to the size achieved by state-of-the-art methods and noticeably larger only compared to RecSplit. FMPHGO preserves most of the FMPH advantages mentioned above, but significantly reduces its construction speed. However, FMPHGO’s construction speed is still competitive with methods of similar space efficiency (like CHD or PTHash), and seems to be good enough for practical applications.
- 26 June 2023
- Published by Association for Computing Machinery (ACM) in ACM Journal of Experimental Algorithmics
- Vol. 28, 1-16
Open AccessFingerprinting-based Minimal Perfect Hashing Revisited
In this paper we study a fingerprint-based minimal perfect hash function ( FMPH for short). While FMPH is not as space-efficient as some other minimal perfect hash functions (for example RecSplit, CHD, or PTHash), it has a number of practical advantages that make it worthy of consideration. FMPH is simple and quite fast to evaluate. Its construction requires very little auxiliary memory, takes a short time and, in addition, can be parallelized or carried out without holding keys in memory. In this paper, we propose an effective method (called FMPHGO ) that reduces the size of FMPH, as well as a number of implementation improvements. In addition, we experimentally study FMPHGO performance and find the best values for its parameters. Our benchmarks show that with our method and an efficient structure to support the rank queries on a bit vector, the FMPH size can be reduced to about 2.1 bits/key, which is close to the size achieved by state-of-the-art methods and noticeably larger only compared to RecSplit. FMPHGO preserves most of the FMPH advantages mentioned above, but significantly reduces its construction speed. However, FMPHGO’s construction speed is still competitive with methods of similar space efficiency (like CHD or PTHash), and seems to be good enough for practical applications.
- 4 April 2022
- Published by Springer Nature
- p. 62-78
Deep Infeasibility Exploration Method for Vehicle Routing Problems
- 4 April 2022
- Published by Springer Nature
- p. 62-78
Deep Infeasibility Exploration Method for Vehicle Routing Problems
- 24 March 2020
- Published by Elsevier in Artificial Intelligence
- Vol. 283, 103262
On pruning search trees of impartial games
- 24 March 2020
- Published by Elsevier in Artificial Intelligence
- Vol. 283, 103262
On pruning search trees of impartial games
- 3 December 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Intelligence and AI in Games
- Vol. 9 (1) , 76-87
Partition Search Revisited
Partition search is a form of game search, proposed by Matthew L. Ginsberg in 1996, who wrote that the method “incorporates dependency analysis, allowing substantial reductions in the portion of the tree that needs to be expanded.” In this paper, some improvements of the partition search algorithm are proposed. The effectiveness of the most important extension we contribute, which we call local partition search, has been verified experimentally. The results obtained (which we present in the paper) show that using this extension, leads, in the case of bridge, to a significant reduction (almost by half) of the search tree size and calculation time. Another extension we proposed allows for more effective usage of the transposition table (using it to narrow the search window or by cutting more than one entry). Additionally, we contribute a formal proof of the correctness of all presented partition search variants. We draw conclusions from it about a possible generalization of partition search by making the definition of a partition system less restrictive. We also provide a formal definition of a partition system for the double dummy bridge.
- 3 December 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Intelligence and AI in Games
- Vol. 9 (1) , 76-87
Partition Search Revisited
Partition search is a form of game search, proposed by Matthew L. Ginsberg in 1996, who wrote that the method “incorporates dependency analysis, allowing substantial reductions in the portion of the tree that needs to be expanded.” In this paper, some improvements of the partition search algorithm are proposed. The effectiveness of the most important extension we contribute, which we call local partition search, has been verified experimentally. The results obtained (which we present in the paper) show that using this extension, leads, in the case of bridge, to a significant reduction (almost by half) of the search tree size and calculation time. Another extension we proposed allows for more effective usage of the transposition table (using it to narrow the search window or by cutting more than one entry). Additionally, we contribute a formal proof of the correctness of all presented partition search variants. We draw conclusions from it about a possible generalization of partition search by making the definition of a partition system less restrictive. We also provide a formal definition of a partition system for the double dummy bridge.
- 4 March 2015
- Published by SPIE-Intl Soc Optical Eng
- Vol. 9381, 93810K
VCSEL modeling with self-consistent models: From simple approximations to comprehensive numerical analysis
In the talk we show the process of modeling complete physical properties of VCSELs and we present a step-by-step development of its complete multi-physics model, gradually improving its accuracy. Then we introduce high contrast gratings to the VCSEL design, which strongly complicates its optical modeling, making the comprehensive multi-physics VCSEL simulation a challenging task. We show, however, that a proper choice of a self-consistent simulation algorithm can still make such a simulation a feasible one, which is necessary for an efficient optimization of the laser prior to its costly manufacturing.
- 4 March 2015
- Published by SPIE-Intl Soc Optical Eng
- Vol. 9381, 93810K
VCSEL modeling with self-consistent models: From simple approximations to comprehensive numerical analysis
In the talk we show the process of modeling complete physical properties of VCSELs and we present a step-by-step development of its complete multi-physics model, gradually improving its accuracy. Then we introduce high contrast gratings to the VCSEL design, which strongly complicates its optical modeling, making the comprehensive multi-physics VCSEL simulation a challenging task. We show, however, that a proper choice of a self-consistent simulation algorithm can still make such a simulation a feasible one, which is necessary for an efficient optimization of the laser prior to its costly manufacturing.
- 1 June 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 36 (21627339) , 1-4
Automated self-consistent approach to modeling of photonic devices
In the talk a new automated and self-consistent approach to modeling photonic devices is presented. Is is based on a new software being developed at Lodz University of Technology and its main idea is automated consideration of mutual interactions between various physical phenomena taking place in photonic devices. The software consists of several solvers that can model temperature distribution within the investigated structure, the electric current flow and carriers diffusion, the optical eigenmodes of the analyzed cavity or waveguide and the light-matter interaction. Results of the modeling performed with one solver are automatically provided as the input state of another one, and the calculations are performed in a user-controlled self-consistent loop. In the talk the basic idea of the approach is presented and it is supported by examples of simulation results of semiconductor lasers.
- 1 June 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 36 (21627339) , 1-4
Automated self-consistent approach to modeling of photonic devices
In the talk a new automated and self-consistent approach to modeling photonic devices is presented. Is is based on a new software being developed at Lodz University of Technology and its main idea is automated consideration of mutual interactions between various physical phenomena taking place in photonic devices. The software consists of several solvers that can model temperature distribution within the investigated structure, the electric current flow and carriers diffusion, the optical eigenmodes of the analyzed cavity or waveguide and the light-matter interaction. Results of the modeling performed with one solver are automatically provided as the input state of another one, and the calculations are performed in a user-controlled self-consistent loop. In the talk the basic idea of the approach is presented and it is supported by examples of simulation results of semiconductor lasers.
- Open Access
- 1 January 2012
- Published by Termedia Sp. z.o.o. in Archives of Medical Science
- Vol. 5 (5) , 892-898
The sound of a mobile phone ringing affects the complex reaction time of its owner
Introduction: Mobile phone conversation decreases the ability to concentrate and impairs the attention necessary to perform complex activities, such as driving a car. Does the ringing sound of a mobile phone affect the driver’s ability to perform complex sensory-motor activities? We compared...
- 1 January 2012
- Published by Termedia Sp. z.o.o. in Archives of Medical Science
- Vol. 5 (5) , 892-898
Open AccessThe sound of a mobile phone ringing affects the complex reaction time of its owner
Introduction: Mobile phone conversation decreases the ability to concentrate and impairs the attention necessary to perform complex activities, such as driving a car. Does the ringing sound of a mobile phone affect the driver’s ability to perform complex sensory-motor activities? We compared...