Filters
total: 3951
-
Catalog
- Publications 2274 available results
- Journals 99 available results
- Conferences 6 available results
- Publishing Houses 1 available results
- People 145 available results
- Projects 19 available results
- Laboratories 1 available results
- Research Teams 1 available results
- e-Learning Courses 51 available results
- Events 10 available results
- Open Research Data 1344 available results
displaying 1000 best results Help
Search results for: CRYOCONITE, CRYOSPHERE, GLACIERS, GRAINS, INVERTEBRATES
-
Karta zawodowa inżyniera - legitymacja bez granic.
PublicationPrzedstawiono działalność Europejskiej Federacji Inżynierskich Stowarzyszeń Narodowych FEANI. Omówiono zasady ubiegania się o tytuł Inżyniera Europejskiego oraz kartę zawodową inżyniera. Mija właśnie dwa lata od chwili rozpoczęcia wydawania inżynierom różnych specjalności europejskiej legitymacji zawodowej. Wskazano na rolę w tym zakresie Federacji Stowarzyszeń Naukowo-Technicznych NOT. Sharakteryzowano również aktywność Europejskiego...
-
The use of Markov chains in the social convergence analysis
PublicationThe main goal of this article is to analyze the social convergence process using Markov chains. In this research, term social convergence refers to the reduction of dispersion in the standard of living among countries. The use of Markov chains in the social convergence analysis allowed describing movements of observational units within the distribution and providing more details about the mechanism of the convergence process. A...
-
Domination-Related Parameters in Rooted Product Graphs
PublicationAbstract A set S of vertices of a graph G is a dominating set in G if every vertex outside of S is adjacent to at least one vertex belonging to S. A domination parameter of G is related to those sets of vertices of a graph satisfying some domination property together with other conditions on the vertices of G. Here, we investigate several domination-related parameters in rooted product graphs.
-
Edge and Pair Queries-Random Graphs and Complexity
PublicationWe investigate two types of query games played on a graph, pair queries and edge queries. We concentrate on investigating the two associated graph parameters for binomial random graphs, and showing that determining any of the two parameters is NP-hard for bounded degree graphs.
-
program verification strategy and edge ranking of graphs
PublicationW artykule rozważamy model, w którym zakładamy, że dany jest zbiór asercji/testów dla pewnych bloków programu. Celem jest znalezienie optymalnej, tzn. wymagającej wykonania minimalnej liczby testów strategii wyszukiwania błędu w kodzie programu. Pomimo założenia w modelu, iż program posiada dokładnie jeden błąd, rozważania można uogólnić na testowanie kodu z dowolną liczbą błędów. Analizujemy teoretyczne własności tego modelu oraz...
-
Synchronous black hole search in directed graphs
PublicationThe paper considers a team of robots which has to explore a graph G, where some nodes can be harmful. Robots are initially located at the so-called home base node. The dangerous nodes are the so-called black hole nodes, and once a robot enters in one of them, it is destroyed. The goal is to find a strategy in order to explore G in such a way that minimum number of robots is wasted. The exploration ends if there is at least one...
-
Parallel query processing and edge ranking of graphs
PublicationArtykuł poświęcony jest problemowi szukania drzewa spinającego o minimalnym uporządkowanym indeksie chromatycznym. Jednym z zastosowań jest poszukiwanie optymalnych harmonogramów w równoległym przetwarzaniu zapytań w relacyjnych bazach danych. Podajemy nowe oszacowanie funkcji dobroci przybliżonego algorytmu autorstwa Makino, Uno i Ibaraki wraz z rezultatami testów komputerowych przeprowadzonych dla grafów losowych.
-
Topology of vibro-impact systems in the neighborhood of grazing
Publication -
Towards Increasing Density of Relations in Category Graphs
PublicationIn the chapter we propose methods for identifying new associations between Wikipedia categories. The first method is based on Bag-of-Words (BOW) representation of Wikipedia articles. Using similarity of the articles belonging to different categories allows to calculate the information about categories similarity. The second method is based on average scores given to categories while categorizing documents by our dedicated score-based...
-
Bipartite theory of graphs: outer-independent domination
PublicationLet $G = (V,E)$ be a bipartite graph with partite sets $X$ and $Y$. Two vertices of $X$ are $X$-adjacent if they have a common neighbor in $Y$, and they are $X$-independent otherwise. A subset $D \subseteq X$ is an $X$-outer-independent dominating set of $G$ if every vertex of $X \setminus D$ has an $X$-neighbor in $D$, and all vertices of $X \setminus D$ are pairwise $X$-independent. The $X$-outer-independent domination number...
-
Minimum order of graphs with given coloring parameters
PublicationA complete k-coloring of a graph G=(V,E) is an assignment F: V -> {1,...,k} of colors to the vertices such that no two vertices of the same color are adjacent, and the union of any two color classes contains at least one edge. Three extensively investigated graph invariants related to complete colorings are the minimum and maximum number of colors in a complete coloring (chromatic number χ(G) and achromatic number ψ(G), respectively),...
-
Strong weakly connected domination subdivisible graphs
PublicationArtykuł dotyczy wpływu podziału krawędzi na liczbę dominowania słabo spójnego. Charakteryzujemy grafy dla których podział dowolnej krawędzi zmienia liczbę dominowania słabo spójnego oraz grafy dla których podział dowolnych dwóch krawędzi powoduje zmianę liczby dominowania słabo spójnego.
-
On extremal sizes of locally k-tree graphs
PublicationA graph G is a locally k-tree graph if for any vertex v the subgraph induced by the neighbours of v is a k-tree, k>=0, where 0-tree is an edgeless graph, 1-tree is a tree. We characterize the minimum-size locally k-trees with n vertices. The minimum-size connected locally k-trees are simply (k + 1)-trees. For k >= 1, we construct locally k-trees which are maximal with respect to the spanning subgraph relation. Consequently, the...
-
On bipartization of cubic graphs by removal of an independent set
PublicationWe study a new problem for cubic graphs: bipartization of a cubic graph Q by deleting sufficiently large independent set.
-
Graphs hard-to-process for greedy algorithm MIN
PublicationWe compare results of selected algorithms that approximate the independence number in terms of the quality of constructed solutions. Furthermore, we establish smallest hard- to-process graphs for the greedy algorithm MIN.
-
Progress on Roman and Weakly Connected Roman Graphs
PublicationA graph G for which γR(G)=2γ(G) is the Roman graph, and if γwcR(G)=2γwc(G), then G is the weakly connected Roman graph. In this paper, we show that the decision problem of whether a bipartite graph is Roman is a co-NP-hard problem. Next, we prove similar results for weakly connected Roman graphs. We also study Roman trees improving the result of M.A. Henning’s A characterization of Roman trees, Discuss. Math. Graph Theory 22 (2002)....
-
Paired domination subdivision and multisubdivision numbers of graphs
PublicationThe paired domination subdivision number sdpr(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the paired domination number of G. We prove that the decision problem of the paired domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the paired domination muttisubdivision number of a nonempty graph...
-
On the super domination number of lexicographic product graphs
PublicationThe neighbourhood of a vertexvof a graphGis the setN(v) of all verticesadjacent tovinG. ForD⊆V(G) we defineD=V(G)\D. A setD⊆V(G) is called a super dominating set if for every vertexu∈D, there existsv∈Dsuch thatN(v)∩D={u}. The super domination number ofGis theminimum cardinality among all super dominating sets inG. In this article weobtain closed formulas and tight bounds for the super dominating number oflexicographic product...
-
Graphs with equal domination and certified domination numbers
PublicationA setDof vertices of a graphG= (VG,EG) is a dominating set ofGif every vertexinVG−Dis adjacent to at least one vertex inD. The domination number (upper dominationnumber, respectively) ofG, denoted byγ(G) (Γ(G), respectively), is the cardinality ofa smallest (largest minimal, respectively) dominating set ofG. A subsetD⊆VGis calleda certified dominating set ofGifDis a dominating set ofGand every vertex inDhas eitherzero...
-
Chromatic cost coloring of weighted bipartite graphs
PublicationGiven a graph G and a sequence of color costs C, the Cost Coloring optimization problem consists in finding a coloring of G with the smallest total cost with respect to C. We present an analysis of this problem with respect to weighted bipartite graphs. We specify for which finite sequences of color costs the problem is NP-hard and we present an exact polynomial algorithm for the other finite sequences. These results are then extended...
-
Nilpotent singularities and chaos: Tritrophic food chains
PublicationLocal bifurcation theory is used to prove the existence of chaotic dynamics in two well-known models of tritrophic food chains. To the best of our knowledge, the simplest technique to guarantee the emergence of strange attractors in a given family of vector fields consists of finding a 3-dimensional nilpotent singularity of codimension 3 and verifying some generic algebraic conditions. We provide the essential background regarding...
-
Graphs with convex domination number close to their order
PublicationW pracy opisane są grafy z liczbą dominowania wypukłego bliską ilości ich wierzchołków.
-
Self-stabilizing algorithm for edge-coloring of graphs
PublicationReferat ten poświęcony jest kolorowaniu grafów w modelu rozproszonym.Podano samostabilizujący się algorytm kolorowania krawędzi grafu wraz z dowodem poprawności oraz oszacowaniem jego czasu działania.
-
Optimization of Energetic Train Cooperation
PublicationIn the article, possible ways of using energy recovered during regenerative braking of trains are presented. It is pointed out that the return of recovered electricity directly to the catenary and its use in the energy cooperation of vehicles can be a no-cost method (without additional infrastructure). The method of energy cooperation between trains and its main assumptions, that uses the law of conservation of energy, are described...
-
Günter Grass - kolekcja plus
Publication -
Weakly cooperative guards in grids
PublicationW pracy autorzy zajmują się rozmieszczaniem strażników mobilnych w kratach ortogonalnych, podali wzór na minimalną liczbę strażników w kracie oraz przeanalizowali złożoność obliczeniową problemu.
-
Cooperative mobile guards in grids
PublicationPraca dotyczy problemu strzeżenia dwuwymiarowych krat ortogonalnych, przy założeniu, że obszar widoczności strażnika obejmuje jedną ulicę oraz wszystkie ulice ją przecinające. Rozważano wariant straży słabo współpracujących, w którym dodatkowo każdy strażnik musi widzieć przynajmniej jednego innego strażnika. Podano dowód NP-trudności problemu optymalizacyjnego w przypadku ogólnym, algorytm dokładny o złożoności O(n log n) dla...
-
Fault tolerant guarding of grids
PublicationW pracy rozważano problem strzeżenia krat dwuwymiarowych przez dwa niezależne zespoły straży. Wykazano, że zagadnienie minimalizacyjne jest NP-trudne i zaproponowano dla niego wielomianowy algorytm 6/5-przybliżony.
-
Nitrogen-Incorporated Boron-Doped Nanocrystalline Diamond Nanowires for Microplasma Illumination
PublicationThe origin of nitrogen-incorporated boron-doped nanocrystalline diamond (NB-NCD) nanowires as a function of substrate temperature (Ts) in H2/CH4/B2H6/N2 reactant gases is systematically addressed. Because of Ts, there is a drastic modification in the dimensional structure and microstructure and hence in the several properties of the NB-NCD films. The NB-NCD films grown at low Ts (400 °C) contain faceted diamond grains. The morphology...
-
Bio-inspired approaches for explosives detection
PublicationDue to unique abilities of the animals regarding analysis of complex gas substances, they still remain a gold standard in analysis of explosives. Unusual capabilities of biological chemosensory systems, including both vertebrates and invertebrates, stimulate elaboration of the devices mimicking their activity and operation parameters as precisely as possible. The electronic analogues are a subject of investigation in many research...
-
Key-Marker Volatile Compounds in Aromatic Rice (Oryza sativa) Grains: An HS-SPME Extraction Method Combined with GC×GC-TOFMS
PublicationThe aroma of rice essentially contributes to the quality of rice grains. For some varieties, their aroma properties really drive consumer preferences. In this paper, using a dynamic headspace solid-phase microextraction (HS-SPME) system coupled to a two-dimensional gas chromatography (GC×GC) using a time-of-flight mass spectrometric detector (TOFMS) and multivariate analysis, the volatile compounds of aromatic and non-aromatic...
-
Farmyard manure alone and combined with immobilizing amendments reduced cadmium accumulation in wheat and rice grains grown in field irrigated with raw effluents
Publication -
Detection and segmentation of moving vehicles and trains using Gaussian mixtures, shadow detection and morphological processing
PublicationSolution presented in this paper combines background modelling, shadow detection and morphological and temporal processing into one system responsible for detection and segmentation of moving objects recorded with a static camera. Vehicles and trains are detected based on their pixellevel difference from the continually updated background model utilizing a Gaussian mixture calculated separately for every pixel. The shadow detection...
-
Shear-Jamming in Two-Dimensional Granular Materials with Power-Law Grain-Size Distribution
Publication -
Microwave Assisted Liquefaction with Crude Glycerol as a Potential Method of Brewer’s Spent Grain Utilization
Publication -
Numerical simulations of sand behavior using DEM with 2 different descriptions of grain roughness
PublicationW rozdziale przedstawiono wyniki dyskretnych symulacji jednorodnego trójosiowego ściskania piasku przy zastosowaniu metody elementów dyskretnych. Obliczenia wykonano stosując 2 różne opisy szorstkości ziaren: kule z uwzględnieniem momentów kontaktu oraz grona kul. Obliczono energię sprężystą i dysypację plastyczną. Wyniki symulacji numerycznych porównano z wynikami doświadczalnymi.
-
Powder metallurgy of the porous Ti-13Nb-13Zr alloy of different powder grain size
PublicationThe objective of the present project was to determine the effects of powder granulation (fraction of grain size) for the Ti-13Nb-13Zr alloy, produced by powder metallurgy, on its porosity, grain cohesion, compressive strength, and Young`s modulus. Two powder fractions, 45–105 µm, and 106–250 µm were applied. The 50 mass pct of NH4HCO3 was added as a space holder. The specimens were in compaction stage uniaxially pressed at pressure...
-
Analysis of the grain boundary conductivity for nanocrystalline doped ceria using the brick layer model.
PublicationW pracy przedstawiono wyniki badań elektrycznych i mikrostrukturalnych ceru domieszkowanego itrem. Gęste i nanokrystaliczne filmy przygotowane zostały z użyciem prekursorów polimerowych na szafirze. Konduktancja elektryczna była badana w funkcji temperatury syntezy, która jest skorelowana z wielkością ziaren. Otrzymano mniejszą konduktancję nanokrystalicznego filmu ceru w porównaniu z próbkami ceramicznymi.
-
Microwave assisted liquefaction with crude glycerol as a potential method of brewer's spent grain utylization
PublicationBrewer's spent grain was applied as a low-cost industrial type of lignocellulose biomass in a liquefaction and solvent: biomass ratio on the efficiency of the process, chemical structure and basic properties of obtained prepared polyols and soil residues shed light on the biomass degradation mechanism through application of microwaves and further reaction of degradation products with solvent particles.
-
Insights into the Thermo-Mechanical Treatment of Brewers’ Spent Grain as a Potential Filler for Polymer Composites
PublicationThis paper investigated the impact of twin-screw extrusion parameters on the properties of brewers’ spent grain. The chemical structure, antioxidant activity, particle size, and color properties, as well as the emission of volatile organic compounds during extrusion, were investigated. The main compounds detected in the air during modifications were terpenes and terpenoids, such as α-pinene, camphene, 3-carene, limonene, or terpinene....
-
Sustainable upcycling of brewers’ spent grain by thermo-mechanical treatment in twin-screw extruder
PublicationThermo-mechanical treatment of brewers’ spent grain (a by-product of beer manufacturing) was successfully performed via the extrusion process. The impact of temperature (from 30 to 180 °C), throughput (from 1 to 5 kg/h) and screw speed (from 75 to 375 rpm) on particle size, color, chemical structure, antioxidant activity and thermal stability of resulting material, as well as correlations between particular properties, were investigated....
-
Effect of grain crushing on shear localization in granular bodies within micro-polar hypoplasticity
PublicationW artykule przedstawiono efekt miażdżenia ziaren na zachowanie się materiału granulowanego podczas ścinania nieskończenie długiej warstwy piasku. Obliczenia wykonano przy pomocy mikropolarnego prawa hipoplastycznego rozszerzonego o efekt miażdżenia ziaren w oparciu o teorię mechaniki zniszczenia. Zbadano wpływ wstępnego zagęszczenia i poziomu naprężeń na strefy lokalizacji.
-
Aluminium in glacial meltwater demonstrates an association with nutrient export (Werenskiöldbreen, Svalbard)
PublicationThe aluminium (Al) cycle in glacierised basins has not received a great deal of attention in studies of biogeochemical cycles. As Almay be toxic for biota, it is important to investigate the processes leading to its release into the environment. It has not yet been ascertained whether filterable Al (passing through a pore size of 0.45 m) is incorporated into biogeochemical cycles in glacierised basins. Our study aims to determine...
-
The complexity of the T-coloring problem for graphs with small degree
Publication -
Some results concerning the complexity of restricted colorings of graphs
Publication -
Edge-chromatic sum of trees and bounded cyclicity graphs
Publication -
Biodegradation and sorption of nodularin (NOD) in fine-grained sediments
Publication -
Numerical mesoscopic analysis of fracture in fine-grained concrete
PublicationArtykuł omawia wyniki analizy mezoskopowej procesu pękania w betonie podczas zginania. Obliczenia wykonano na poziomie mezo wykorzystując model degradacji sztywności z nielokalnym osłabieniem. Zbadano wpływ właściwości kruszywa, stref przejściowych, nacięcia oraz długości charakterystycznej mikrostruktury na zachowanie sie betonu.
-
Total domination in versus paired-domination in regular graphs
PublicationA subset S of vertices of a graph G is a dominating set of G if every vertex not in S has a neighbor in S, while S is a total dominating set of G if every vertex has a neighbor in S. If S is a dominating set with the additional property that the subgraph induced by S contains a perfect matching, then S is a paired-dominating set. The domination number, denoted γ(G), is the minimum cardinality of a dominating set of G, while the...
-
Cops, a fast robber and defensive domination on interval graphs
PublicationThe game of Cops and ∞-fast Robber is played by two players, one controlling c cops, the other one robber. The players alternate in turns: all the cops move at once to distance at most one each, the robber moves along any cop-free path. Cops win by sharing a vertex with the robber, the robber by avoiding capture indefinitely. The game was proposed with bounded robber speed by Fomin et al. in “Pursuing a fast robber on a graph”,...