A5021657351- Machine Learning and Algorithms
- semigroups and automata theory
- Algorithms and Data Compression
- Agriculture, Plant Science, Crop Management
- Natural Language Processing Techniques
- Evolutionary Algorithms and Applications
- DNA and Biological Computing
- Metaheuristic Optimization Algorithms Research
- Botany and Plant Ecology Studies
- Artificial Intelligence in Games
- Airway Management and Intubation Techniques
- Computability, Logic, AI Algorithms
- Machine Learning in Bioinformatics
- Geometric and Algebraic Topology
- Cardiac Arrest and Resuscitation
- Global Health Care Issues
- Geometric Analysis and Curvature Flows
- Agricultural economics and policies
- Flowering Plant Growth and Cultivation
- Geometry and complex manifolds
- Insect Pest Control Strategies
- Software Testing and Debugging Techniques
- Digital Games and Media
- Formal Methods in Verification
- Logic, Reasoning, and Knowledge
Medical University of Warsaw
2023-2025
AGH University of Krakow
2022-2023
University of Bielsko-Biała
2020-2023
Medical University of Białystok
2022
University of Silesia in Katowice
2009-2020
Institute of Computer Science
2010-2020
Krajowa Spółka Cukrowa (Poland)
2019
Jastrzębska Spółka Węglowa (Poland)
2017
Czech Academy of Sciences, Institute of Computer Science
2017
Institute of Industrial Organic Chemistry
1997-2002
Background/Objectives: Effective infant cardiopulmonary resuscitation (CPR) relies on high-quality chest compressions, yet the optimal technique for single-rescuer scenarios remains debated. Although widely used, two-finger (TFT) is associated with an inadequate compression depth and increased rescuer fatigue. While two-thumb encircling hands (TTHT) provides a superior depth, its application in impractical. This study evaluates novel (nT) as potential alternative, aiming to optimize both...
In this work polymer derived ceramic (PDC) coatings, based on SiAlOC glasses, were successfully applied 48-2-2 TiAl alloy samples. These coatings showed a significant improvement in oxidation resistance both dry and humid air conditions. The uncoated material poor independent of the atmosphere. SEM, EPMA Raman confocal imaging used to investigate mechanisms coated air. coating suppressed outward Ti diffusion promoted alumina scale formation.
Lead-free Ba1−xSrxTiO3 (BST) (x = 0, 0.1, 0.2, 0.3, 0.4 and 0.45) ceramics were successfully prepared via the solid-state reaction route. A pure perovskite crystalline structure was identified for all compositions by X-ray diffraction analysis. The basic phase transition temperatures in these studied over a wide temperature range. change symmetry from tetragonal to cubic detected, which further proven phonon anomalies composition/temperature-dependent Raman spectra. incorporation of Sr2+...
In this paper, an algorithm for the decomposition of a finite language is presented. The goal to represent as product (catenation) two languages. This problem thought be intractable, although its NP-hardness has not been proven. based on checking through some subsets states minimal acyclic DFA. We also investigate additional algorithms: first use integer linear programming, and second finding cliques in graph. It appears that latter approaches are inappropriate terms time consumption....
The present paper is a novel contribution to the field of bioinformatics by using grammatical inference in analysis data. We developed an algorithm for generating star-free regular expressions which turned out be good recommendation tools, as they are characterized relatively high correlation coefficient between observed and predicted binary classifications. experiments have been performed three datasets amyloidogenic hexapeptides, our results compared with those obtained graph approaches,...
The goal of this paper is to develop the parallel algorithms that, on input a learning sample, identify regular language by means nondeterministic finite automaton (NFA). A sample pair sets containing positive and negative examples. Given minimal NFA that represents target sought. We define task finding an NFA, which accepts all examples rejects ones, as constraint satisfaction problem, then propose solve problem. results comprehensive computational experiments variety inference tasks are...
A new two-stage method for the construction of a decision tree is developed. The first stage based on definition minimum query set, which smallest set attribute-value pairs any two objects can be distinguished. To obtain this an appropriate linear programming model proposed. queries from are building blocks second in we try to find optimal using genetic algorithm. In series experiments, show that some databases, our approach should considered as alternative classical ones (CART, C4.5) and...
Abstract A cover-grammar of a finite language is context-free grammar that accepts all words in the and possibly other are longer than any word language. In this paper, we describe an efficient algorithm aided by Ant Colony System that, for given language, synthesizes (constructs) small We also check its ability to solve grammatical inference task through series experiments.
In this study, we investigated the effect of adding two different intermetallics, Ti5Si3 and TiSi2, for preparation TiB2-SiC-B4C composites. As part research, stoichiometric composites consisting only phases TiB2 SiC were obtained. The prepared via pressureless sintering. presence in sintered was confirmed using X-ray diffraction scanning electron microscopy. SEM-EDS examination revealed that formed during composite process synthesis distributed homogeneously B4C matrix. obtained results...
Application of pesticides leads to contamination the natural environment, which entails necessity seek solutions that use substances do not pose ecological hazards. The presented investigations tested efficacy a preparation containing organomodified trisiloxane and cross-linking agent (Siltac EC) limit number two-spotted spider mite (Tetranychus urticae) on leaves raspberry (Rubus idaeus) blackcurrant (Ribes nigrum), as well numbers green apple aphid (Aphis pomi) trees (Malus domestica)....
It is known that Monte-Carlo Tree Search (MCTS) usually weak in the very early stages of game development. To improve performance MCTS we have analyzed a grammatical inference problem. The research led us to devise an efficient algorithm, for given small finite sets game's winning and losing positions, inductively synthesizes regular expression predicting similar positions ones part. On foundation built opening book showed-in conducted experiments on Toads-and-Frogs game-that it helped...