VLDB 2026 Research / reviewers in the wild / expert
Witold Holubowicz
dblp:79/6847
· DBLP profile ↗
17ranked-venue papers
6as first author
1since 2021 · last 2021
0000-0001-5945-8698ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 5 · 4 first-authorArtificial intelligence and machine learning · 4 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 3Security and privacy · 2Theory of computation · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer networks
7 papers |
Physical-layer communications · 91% Cellular and mobile networks · 7% Network optimization and economics · 2% |
Topics — the 16 heaviest of 17, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Physical-layer communications › modulation
continuous phase modulation |
0.0 | 5 | 1995 | Convolutional coding of binary CPM schemes with no increase in receiver complexity · IEEE Trans. Commun. 1995 Good multi-T phase codes under bandwidth and complexity constraints · IEEE Trans. Inf. Theory 1994 Simulation study of multi-T phase codes · IEEE Trans. Commun. 1990 |
Physical-layer communications
channel coding |
0.0 | 2 | 1994 | Good multi-T phase codes under bandwidth and complexity constraints · IEEE Trans. Inf. Theory 1994 Multi-T realization of multi- h phase codes · IEEE Trans. Inf. Theory 1985 |
Physical-layer communications › channel coding › error control coding
code design |
0.0 | 2 | 1994 | Good multi-T phase codes under bandwidth and complexity constraints · IEEE Trans. Inf. Theory 1994 Multi-T realization of multi- h phase codes · IEEE Trans. Inf. Theory 1985 |
Physical-layer communications › modulation
coded modulation |
0.0 | 2 | 1994 | Good multi-T phase codes under bandwidth and complexity constraints · IEEE Trans. Inf. Theory 1994 Multi-T realization of multi- h phase codes · IEEE Trans. Inf. Theory 1985 |
Physical-layer communications › channel coding › error control coding
convolutional codes |
0.0 | 1 | 1995 | Convolutional coding of binary CPM schemes with no increase in receiver complexity · IEEE Trans. Commun. 1995 |
Physical-layer communications
channel coding and estimation |
0.0 | 1 | 1994 | Optimization of trellis coded TFM via matched codes · IEEE Trans. Commun. 1994 |
Cellular and mobile networks › mobile networks
land mobile radio |
0.0 | 1 | 1994 | Land mobile radio systems in Poland · IEEE J. Sel. Areas Commun. 1994 |
Physical-layer communications › modulation › coded modulation
trellis-coded modulation |
0.0 | 1 | 1994 | Optimization of trellis coded TFM via matched codes · IEEE Trans. Commun. 1994 |
Physical-layer communications › modulation › continuous phase modulation
multi-h CPM |
0.0 | 1 | 1990 | Optimum parameter combinations for multi-h phase codes · IEEE Trans. Commun. 1990 |
Network optimization and economics › network design › network planning
frequency planning |
0.0 | 1 | 1994 | Land mobile radio systems in Poland · IEEE J. Sel. Areas Commun. 1994 |
Physical-layer communications
modulation |
0.0 | 1 | 1994 | Optimization of trellis coded TFM via matched codes · IEEE Trans. Commun. 1994 |
Physical-layer communications › modulation › continuous phase modulation
tamed frequency modulation |
0.0 | 1 | 1994 | Optimization of trellis coded TFM via matched codes · IEEE Trans. Commun. 1994 |
Physical-layer communications › synchronization
carrier recovery |
0.0 | 1 | 1990 | Simulation study of multi-T phase codes · IEEE Trans. Commun. 1990 |
Physical-layer communications › modulation › continuous phase modulation
continuous phase frequency shift keying |
0.0 | 1 | 1990 | Optimum parameter combinations for multi-h phase codes · IEEE Trans. Commun. 1990 |
Physical-layer communications
signal processing for communications |
0.0 | 1 | 1985 | Multi-T realization of multi- h phase codes · IEEE Trans. Inf. Theory 1985 |
Physical-layer communications › signal processing for communications
spectral analysis |
0.0 | 1 | 1985 | Multi-T realization of multi- h phase codes · IEEE Trans. Inf. Theory 1985 |
Methods — techniques the papers use, named apart from their topics
systematic search · 0.0viterbi algorithm · 0.0euclidean distance optimization · 0.0simulation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Missing and Incomplete Data Handling in Cybersecurity Applications
Marek Pawlicki, Michal Choras, Rafal Kozik, Witold Holubowicz |
ACIIDS | 4 |
| 2019 | The Identification and Creation of Ontologies for the Use in Law Enforcement AI Solutions - MAGNETO Platform Use Case
Rafal Kozik, Michal Choras, Marek Pawlicki, Witold Holubowicz, Dirk Pallmer, Wilmuth Müller, Ernst-Josef Behmer, Ioannis V. Loumiotis, Konstantinos P. Demestichas, Roxana Horincar, Claire Laudy, David Faure |
ICCCI (2) | 4 |
| 2017 | The Concept of Applying Lifelong Learning Paradigm to Cybersecurity
Michal Choras, Rafal Kozik, Rafal Renk, Witold Holubowicz |
ICIC (3) | 4 |
| 2016 | Evolutionary-based packets classification for anomaly detection in web layerabstractAbstract In this paper, we propose a novel method for web layer anomaly detection. In contrast to the majority of other state of the art approaches, we do not adapt manually configured parsers or packet content type detection techniques to partition the request sent from clients to server. In our experiments, we showed that making certain assumptions about the request content types may lead to the degradation of the detection performance. Therefore, we proposed unsupervised algorithm for automated packet structure extraction. We formulate this as the optimisation problem that is solved by means of genetic algorithm. Moreover, on top of the request segmentation schema, we provide the set of algorithms that measure statistics and apply machine learning techniques to solve the classification problems. The effectiveness of our methods is proved by the results achieved on the extended benchmark database. Copyright © 2016 John Wiley & Sons, Ltd. Rafal Kozik, Michal Choras, Witold Holubowicz |
Secur. Commun. Networks | 3 |
| 2012 | Statistical and signal-based network traffic recognition for anomaly detectionabstractAbstract In this paper, a framework for recognizing network traffic in order to detect anomalies is proposed. We propose to combine and correlate parameters from different layers in order to detect 0‐day attacks and reduce false positives. Moreover, we propose to combine statistical and signal‐based features. The major contribution of this paper is novel framework for network security based on the correlation approach as well as new signal‐based algorithm for intrusion detection on the basis of the Matching Pursuit (MP) algorithm. As to our best knowledge, we are the first to use MP for intrusion and anomaly detection in computer networks. In the presented experiments, we proved that our solution gives better results than intrusion detection based on discrete wavelet transform. Michal Choras, Lukasz Saganowski, Rafal Renk, Witold Holubowicz |
Expert Syst. J. Knowl. Eng. | 4 |
| 2010 | Admission Control and System Capacity Assessment of WiMAX with ACM and nb-LDPC CodesabstractAuthors propose to use cell level simulation as a natural follow up of the link level tests and a preliminary stage of the systematic approach to the system level tests in the context of IMT-Advanced candidates performance evaluation. The system under test (SUT) consists of flexible realizations of the WiMAX physical layer abstraction (providing customized fidelity and thus simulation complexity) with the nb-LDPC codes. The preliminary assessment of system capacity under quasi-mobility conditions (with ACM) is performed using human mobility models and freeware software for radio coverage planning. Moreover two symbol reservation schemes are evaluated in terms of effective bandwidth utilization, blocking and dropping probability. Complete sharing admission control mechanism (CSCAC) is used to show system performance under various load and mobility patterns. It is shown that using nb-LDPC codes improves system throughput in poor radio conditions as compared to RS-CC coding as in the IEEE 802.16e-2005 specification. Adam Flizikowski, Witold Holubowicz, Marcin Przybyszewski, Slawomir Grzegorzewski |
AINA | 2 |
| 2010 | Ontology Applied in Decision Support System for Critical Infrastructures Protection
Michal Choras, Rafal Kozik, Adam Flizikowski, Witold Holubowicz |
IEA/AIE (1) | 4 |
| 2010 | Intersection Approach to Vulnerability Handling
Michal Choras, Salvatore D'Antonio, Rafal Kozik, Witold Holubowicz |
WEBIST (1) | 4 |
| 2009 | Decision Aid Tool and Ontology-Based Reasoning for Critical Infrastructure Vulnerabilities and Threats Analysis
Michal Choras, Adam Flizikowski, Rafal Kozik, Witold Holubowicz |
CRITIS | 4 |
| 2009 | Ontology-Based Decision Support for Security Management in Heterogeneous Networks
Michal Choras, Rafal Kozik, Adam Flizikowski, Rafal Renk, Witold Holubowicz |
ICIC (2) | 5 |
| 1995 | Convolutional coding of binary CPM schemes with no increase in receiver complexityabstractIn this paper, we deal with convolutionally encoded MSK, DMSK and TFM signals. The matched convolutional encoding technique is used which was shown earlier to lead in some eases to the optimum Viterbi demodulation/decoder which is not more complex than the optimum receiver for the uncoded signal. Results of a systematic search for such cases are presented and discussed.> Witold Holubowicz, Fidel Morales-Moreno |
IEEE Trans. Commun. | 1 |
| 1994 | Land mobile radio systems in PolandabstractThe current situation of land mobile radio (LMR) systems in Poland is described. This includes paging, dispatch, trunking, and cellular systems. Frequency plan and organization of LMR communication in Poland are presented. Finally, the plan for the future development of LMR systems in Poland, prepared by the Ministry of Telecommunications, is summarized.> Witold Holubowicz, Tadeusz Bortnik |
IEEE J. Sel. Areas Commun. | 1 |
| 1994 | Optimization of trellis coded TFM via matched codesabstractA matched code is a convolutional code chosen in such a way that when combined with modulation with memory the resulting receiver for the coded modulation has the smallest possible number of states. In the paper, the matched coding technique is applied to coded tamed frequency modulation (TFM) schemes and a formal procedure is developed to find the best combination of a code and a modulation. The optimization criterion is the maximum free Euclidean distance for a given code rate and a given number of states in the Viterbi receiver used for the coded modulation. A search for the best codes was carried out for code rates 1/2 and 2/3, and for receivers with up to 256 and 64 states, respectively. Good coding gains (more than 7 dB for rate 1/2) were achieved. Some of the best codes were catastrophic, yet the coded modulation was not. The codes obtained using the matched coding approach were in many cases better than those obtained using traditional optimization techniques.> Fidel Morales-Moreno, Witold Holubowicz, Subbarayan Pasupathy |
IEEE Trans. Commun. | 2 |
| 1994 | Good multi-T phase codes under bandwidth and complexity constraintsabstractMulti-T phase codes are an equivalent realization of multi-h phase codes within the class of continuous phase modulations (CPM). The authors present, in the form of code tables, the results of a systematic search for binary and quaternary multi-T phase codes which maximize the free Euclidean distance under given bandwidth and complexity constraints.> Witold Holubowicz, R. Bobrowski |
IEEE Trans. Inf. Theory | 1 |
| 1990 | Optimum parameter combinations for multi-h phase codesabstractIt has been believed that the superiority of multi-h phase codes over constant-h continuous-phase frequency shift keying (CPFSK) schemes is based entirely on the longer temporal separation of any two signal paths. This assumption forces the number of states in the receiver to be lower bounded and requires a fast processor in the receiver. Counterexamples to this common belief are presented as well as results of a systematic search for good multi-h codes for a given bandwidth and complexity constraints. It is shown that quaternary multi-h codes exist for which the first merge of the phase paths in the phase tree is not delayed as compared to the CPFSK scheme, yet which still offer a significant coding gain over the corresponding CPFSK signals. Some quaternary and octal multi-h codes are found with large minimum distance values and a smaller number of receiver states than those known previously.> Witold Holubowicz |
IEEE Trans. Commun. | 1 |
| 1990 | Simulation study of multi-T phase codesabstractMulti-h and multi-T phase codes, two classes of continuous phase modulation (CPM) with cyclically varying values of modulation index, are compared. The multi-h receiver with decision-directed carrier recovery loop is simulated for multi-T codes. The simulation study shows that despite a different signal shape, the error performance and synchronization properties of the two classes of codes are similar.> Witold Holubowicz, Frank A. Cassara |
IEEE Trans. Commun. | 1 |
| 1985 | Multi-T realization of multi- h phase codesabstractA multi-Trealization of multi-hphase codes is considered, and distance structure and spectral properties are investigated. Witold Holubowicz, Pawel Szulakiewicz |
IEEE Trans. Inf. Theory | 1 |