Filtry
wszystkich: 3951
wybranych: 2274
-
Katalog
- Publikacje 2274 wyników po odfiltrowaniu
- Czasopisma 99 wyników po odfiltrowaniu
- Konferencje 6 wyników po odfiltrowaniu
- Wydawnictwa 1 wyników po odfiltrowaniu
- Osoby 145 wyników po odfiltrowaniu
- Projekty 19 wyników po odfiltrowaniu
- Laboratoria 1 wyników po odfiltrowaniu
- Zespoły Badawcze 1 wyników po odfiltrowaniu
- Kursy Online 51 wyników po odfiltrowaniu
- Wydarzenia 10 wyników po odfiltrowaniu
- Dane Badawcze 1344 wyników po odfiltrowaniu
Filtry wybranego katalogu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: CRYOCONITE, CRYOSPHERE, GLACIERS, GRAINS, INVERTEBRATES
-
Common Independence in Graphs
PublikacjaAbstract: The cardinality of a largest independent set of G, denoted by α(G), is called the independence number of G. The independent domination number i(G) of a graph G is the cardinality of a smallest independent dominating set of G. We introduce the concept of the common independence number of a graph G, denoted by αc(G), as the greatest integer r such that every vertex of G belongs to some independent subset X of VG with |X|...
-
Influence of analysis of features geometrical abrasive grains stress, strain and displacement of material in zone microgrinding
Publikacja -
Silicon nanoparticles enhanced the growth and reduced the cadmium accumulation in grains of wheat (Triticum aestivum L.)
Publikacja -
Atomic force microscopy based approach to local impedance measurements of grain interiors and grain boundaries of sensitized AISI 304 stainless steel
Publikacja -
Atomic force microscopy based approach to local impedance measurements of grain interiors and grain boundaries of sensitized AISI 304 stanless steel
PublikacjaPraca prezentuje wyniki badań uzyskane z pomiarów techniką lokalnej spektroskopii impedancyjnej (LIS) wykonanych w trybie kontaktowym mikroskopii sił atomowych (AFM), które zostały przeprowadzone w lokalnych obszarach powierzchni ziarna austenitu i na granicy ziarna austenitu wysokostopowej stali austenitycznej AISI 304 poddanej procesowi uczulania oraz na próbkach odniesienia nie poddanych obróbce cieplnej.Badania LIS-AFM były...
-
Influence of grain shape on the mechanical behaviour of granular materials
PublikacjaWe performed series of numerical vertical compression tests on assemblies of 2D granular material using a Discrete Element code and studied the results in regard to the grain shape. The samples consist of 5000 grains made either of 3 overlapping discs (clump - grain with concavities) or of six-edged polygons (convex grain). These two types of grains have a similar external envelope, ruled with a geometrical parameter α. In the...
-
Influence of the grain boundaries on conductivity of yttrium stabilized zirconia
PublikacjaW pracy przedstawiono wyniki badań przewodności domieszkowanego tlenku cyrkonu. Przygotowano tlenk cyrkonu o krystalitach od 100nm to 10um. Badania impedancyjne pozwoliły na określenie przedności ziaren oraz obszarów międzyziarnowych.
-
Biodiversity of Weeds in Fields of Grain in South-Eastern Poland
Publikacja -
Use of Sustainable Fine-Grain Aggregates in Cement Composites
Publikacja -
Trans Theorizing
Publikacja -
Trans Theorizing
Publikacja -
The Brain of the city
PublikacjaIn order to highlight the characteristics of the West End of Wrocław, we conducted a site analysis. Using the strengths of the site, we were able to create a unique concept of the district while minimizing the impacts of weaknesses by design. The purpose of redesigning the West End of Wrocław is to attract new people to the district through the transformation of an identity. Initially, we conducted a SWOT analysis to identify the...
-
Bondage number of grid graphs
PublikacjaThe bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with domination number greater than the domination number of G. Here we study the bondage number of some grid-like graphs. In this sense, we obtain some bounds or exact values of the bondage number of some strong product and direct product of two paths.
-
Interval Edge-Coloring of Graphs
Publikacja -
Total restrained bondage in graphs
PublikacjaPodzbiór D zbioru wierzchołków grafu nazywamy zewnętrznie totalnym dominującym w grafie, jeśli każdy wierzchołek spoza D ma sąsiada zarówno w D jak i poza D. Moc najmniejszego zbioru o tej własności nazywamy liczbą dominowania zewnętrznie totalnego. W artykule badamy wpływ usuwania krawędzi na liczbę dominowania zewnętrznie totalnego, czyli liczbę zewnętrznego totalnego zniewolenie w grafach.
-
Global edge alliances in graphs
PublikacjaIn the paper we introduce and study a new problem of finding a minimum global edge alliance in a graph which is related to the global defensive alliance (Haynes et al., 2013; Hedetniemi, 2004) and the global defensive set (Lewoń et al., 2016). We proved the NP-completeness of the global edge alliance problem for subcubic graphs and we constructed polynomial time algorithms for trees. We found the exact values of the size of the...
-
Global defensive sets in graphs
PublikacjaIn the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if | N [ X ] ∩ S | ≥ | N [ X ] \ S | holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...
-
Correction to: Serialization for Property Graphs
Publikacja -
Interval edge-coloring of graphs.
PublikacjaRozdział poświęcony prezentacji modelu zwartego kolorowania krawędziowego grafów i jego znanych własności. Szczególny nacisk położono na opis klas grafów dających się pokolorować zwarcie w czasie wielomianowym. Omówiono także stratność jako miarę niepodatności grafu na kolorowanie zwarte.
-
Path Coloring and Routing in Graphs.
PublikacjaW rozdziale omówione zostały problemy kolorowania ścieżek i routingu w grafach. Podano podstawowe definicje związane z tymi problemami, znane wyniki wraz z dyskusją złożoności obliczeniowej dla grafów ogólnych i dla kilku podstawowych klas grafów oraz zastosowania.
-
Algorithms for testing security in graphs
PublikacjaIn this paper we propose new algorithmic methods giving with the high probability the correct answer to the decision problem of security in graphs. For a given graph G and a subset S of a vertex set of G we have to decide whether S is secure, i.e. every subset X of S fulfils the condition: |N[X] \cap S| >= |N[X] \ S|, where N[X] is a closed neighbourhood of X in graph G. We constructed a polynomial time property pseudotester based...
-
Super Dominating Sets in Graphs
PublikacjaIn this paper some results on the super domination number are obtained. We prove that if T is a tree with at least three vertices, then n2≤γsp(T)≤n−s, where s is the number of support vertices in T and we characterize the extremal trees.
-
A note on total reinforcement in graphs
PublikacjaIn this note we prove a conjecture and inprove some results presendet in a recent paper of N. Sridharan, M.D. Elias, V.S.A. Subramanian, Total reinforcement number of a graph, AKCE Int. J. Graphs Comb. 4 (2) (2007) 197-202.
-
Greedy T-colorings of graphs
PublikacjaTreścią artykułu są pokolorowania kontrastowe wygenerowane przez algorytm zachłanny. Zbadane zostały ich własności, obejmujące liczbę kolororów, rozpiętość i rozpiętość krawędziową.
-
Non-isolating bondage in graphs
PublikacjaA dominating set of a graph $G = (V,E)$ is a set $D$ of vertices of $G$ such that every vertex of $V(G) \setminus D$ has a neighbor in $D$. The domination number of a graph $G$, denoted by $\gamma(G)$, is the minimum cardinality of a dominating set of $G$. The non-isolating bondage number of $G$, denoted by $b'(G)$, is the minimum cardinality among all sets of edges $E' \subseteq E$ such that $\delta(G-E') \ge 1$ and $\gamma(G-E')...
-
Deterministic Rendezvous in Restricted Graphs
PublikacjaIn this paper we consider the problem of synchronous rendezvous in which two anonymous mobile entities (robots) A and B are expected to meet at the same time and point in a graph G = (V;E). Most of the work devoted to rendezvous in graphs assumes that robots have access to the same sets of nodes and edges, where the topology of connections may be initially known or unknown. In our work we assume the movement of robots is restricted...
-
Parity vertex colouring of graphs
PublikacjaA parity path in a vertex colouring of a graph is a path along which each colour is used an even number of times. Let Xp(G) be the least number of colours in a proper vertex colouring of G having no parity path. It is proved that for any graph G we have the following tight bounds X(G) <= Xp(G) <=|V(G)|− a(G)+1, where X(G) and a(G) are the chromatic number and the independence number of G, respectively. The bounds are improved for...
-
On efficient coloring of chordless graphs
PublikacjaArtykuł omawia zagadnienie optymalnego, wielomianowego rozpoznawania i kolorowania grafów bezcięciwowych. Zawiera dowód tego, że takie grafy są zawsze 4-kolorowalne oraz opis wielomianowego algorytmu, który koloruje je minimalną możliwą liczbą kolorów.
-
Three-fast-searchable graphs
PublikacjaIn the edge searching problem, searchers move from vertex to vertex in a graph to capture an invisible, fast intruder that may occupy either vertices or edges. Fast searching is a monotonic internal model in which, at every move, a new edge of the graph G must be guaranteed to be free of the intruder. That is, once all searchers are placed the graph G is cleared in exactly |E(G)| moves. Such a restriction obviously necessitates...
-
On-line ranking of split graphs
PublikacjaA vertex ranking of a graph G is an assignment of positive integers (colors) to the vertices of G such that each path connecting two vertices of the same color contains a vertex of a higher color. Our main goal is to find a vertex ranking using as few colors as possible. Considering on-line algorithms for vertex ranking of split graphs, we prove that the worst case ratio of the number of colors used by any on-line ranking algorithm...
-
Some variations of perfect graphs
PublikacjaWe consider (ψk−γk−1)-perfect graphs, i.e., graphs G for which ψk(H) =γk−1(H) for any induced subgraph H of G, where ψk and γk−1 are the k -path vertex cover number and the distance (k−1)-domination number, respectively. We study (ψk−γk−1)-perfect paths, cycles and complete graphs for k≥2. Moreover, we provide a complete characterisation of (ψ2−γ1)-perfect graphs describing the set of its forbidden induced subgraphs and providing...
-
On-line P-coloring of graphs
PublikacjaFor a given induced hereditary property P, a P-coloring of a graph G is an assignment of one color to each vertex such that the subgraphs induced by each of the color classes have property P. We consider the effectiveness of on-line P-coloring algorithms and give the generalizations and extensions of selected results known for on-line proper coloring algorithms. We prove a linear lower bound for the performance guarantee function...
-
Independent Domination Subdivision in Graphs
PublikacjaA set $S$ of vertices in a graph $G$ is a dominating set if every vertex not in $S$ is adjacent to a vertex in~$S$. If, in addition, $S$ is an independent set, then $S$ is an independent dominating set. The independent domination number $i(G)$ of $G$ is the minimum cardinality of an independent dominating set in $G$. The independent domination subdivision number $\sdi(G)$ is the minimum number of edges that must be subdivided (each...
-
Secure Italian domination in graphs
PublikacjaAn Italian dominating function (IDF) on a graph G is a function f:V(G)→{0,1,2} such that for every vertex v with f(v)=0, the total weight of f assigned to the neighbours of v is at least two, i.e., ∑u∈NG(v)f(u)≥2. For any function f:V(G)→{0,1,2} and any pair of adjacent vertices with f(v)=0 and u with f(u)>0, the function fu→v is defined by fu→v(v)=1, fu→v(u)=f(u)−1 and fu→v(x)=f(x) whenever x∈V(G)∖{u,v}. A secure Italian dominating...
-
Equitable vertex coloring of graphs
PublikacjaW pracy podajemy wartości sprawiedliwej liczby chromatycznej dla niektórych klas grafów. Podajemy również dwa algorytmy heurystyczne dla sprawiedliwego kolorowania grafów z suboptymalna liczba koloru.
-
Polygons vs. clumps of discs: A numerical study of the influence of grain shape on the mechanical behaviour of granular materials
PublikacjaWe performed a series of numerical vertical compression tests on assemblies 01 20 granular material using a Discrete Element code and studied the results with regard to the grain shape. The samples consist of 5000 grains made from either 3 overlapping discs (clumps - grains with concavities) or six-edged polygons (convex grains). These two grain type have similar external envelope, which is a fund ion of a geometrical parameter...
-
Effect of Long-Term Storage on Mycobiota of Barley Grain and Malt
Publikacja -
A Universal Gains Selection Method for Speed Observers of Induction Machine
PublikacjaProperties of state observers depend on proper gains selection. Each method of state estimation may require the implementation of specific techniques of finding those gains. The aim of this study is to propose a universal method of automatic gains selection and perform its verification on an induction machine speed observer. The method utilizes a genetic algorithm with fitness function which is directly based on the impulse response...
-
Condition Monitoring of Metallized Polypropylene Film Capacitors in Railway Power Trains
Publikacja -
A method for predicting main propulsion power for inland waterways push trains
PublikacjaPraca zawiera założenia teoretyczne i model matematyczny metody służącej do wyznaczania wstępnej, przybliżonej prognozy wielkości zapotrzebowanej mocy napędu głównego śródlądowego zestawu pchanego.
-
The effect of exogenous application of methyl jasmonate on the lipid and carbohydrate content and composition of winter triticale (Triticosecale Wittm.) grain and the severity of fungal infections in triticale plants and grain
PublikacjaKernels of winter triticale (Triticosecale Wittm. cv. Dinaro) were analyzed. In the autumn of 2015, the effect of methyl jasmonate (MJ) on the germination of triticale kernels and the development of triticale seedlings was analyzed in a laboratory before kernels were sown in experimental plots. Kernels harvested from plots in August 2016 were analyzed to determine their lipid and carbohydrate content and composition and the severity...
-
Contamination of Arctic Lakes with Persistent Toxic PAH Substances in the NW Part of Wedel Jarlsberg Land (Bellsund, Svalbard)
PublikacjaThe expansion of glacier‐free areas in polar regions favours the appearance of lakes in the non‐glaciated parts of glacier basins. This paper presents the differentiation of organic compound concentrations in fifty‐four Arctic lakes collected in four locations (Logne Valley, in the vicinity of the Scott, Renard and Antonia glaciers). We cover meteorological measurements, chemical analysis of sixteen dioxin‐like compounds (Polycyclic...
-
Multicopy Suppressor Analysis of Strains Lacking Cytoplasmic Peptidyl-Prolyl cis/trans Isomerases Identifies Three New PPIase Activities in Escherichia coli That Includes the DksA Transcription Factor
PublikacjaConsistent with a role in catalyzing rate-limiting step of protein folding, removal of genes encoding cytoplasmic protein folding catalysts belonging to the family of peptidyl-prolyl cis/trans isomerases (PPIs) in Escherichia coli confers conditional lethality. To address the molecular basis of the essentiality of PPIs, a multicopy suppressor approach revealed that overexpression of genes encoding chaperones (DnaK/J and GroL/S),...
-
Grass a Kaszuby/i
Publikacja -
Train the trainer course
PublikacjaThis chapter presents the concept, evaluation and evaluation results for the train the trainer. This concept of train the trainers is prepared within Workpackage 5 of EU-funded project: MASTER BSR (Erasmus+ Strategic Partnership Programme). Due to the nature of adult learning the content is designed for the use of participatory methods (involved, active). This method uses various techniques of active learning e.g. group work,...
-
Interval incidence coloring of subcubic graphs
PublikacjaIn this paper we study the problem of interval incidence coloring of subcubic graphs. In [14] the authors proved that the interval incidence 4-coloring problem is polynomially solvable and the interval incidence 5-coloring problem is N P-complete, and they asked if χii(G) ≤ 2∆(G) holds for an arbitrary graph G. In this paper, we prove that an interval incidence 6-coloring always exists for any subcubic graph G with ∆(G) = 3.
-
On domination multisubdivision number of unicyclic graphs
PublikacjaThe paper continues the interesting study of the domination subdivision number and the domination multisubdivision number. On the basis of the constructive characterization of the trees with the domination subdivision number equal to 3 given in [H. Aram, S.M. Sheikholeslami, O. Favaron, Domination subdivision number of trees, Discrete Math. 309 (2009), 622–628], we constructively characterize all connected unicyclic graphs with...
-
Dynamic F-free Coloring of Graphs
PublikacjaA problem of graph F-free coloring consists in partitioning the vertex set of a graph such that none of the resulting sets induces a graph containing a fixed graph F as an induced subgraph. In this paper we consider dynamic F-free coloring in which, similarly as in online coloring, the graph to be colored is not known in advance; it is gradually revealed to the coloring algorithm that has to color each vertex upon request as well...
-
Architektura i woda - przekraczanie granic
PublikacjaPublikacja daje wgląd w procesy kształtowania połączeń wody i form zbudowanych. W obserwowanych współcześnie eksperymentach struktury budynków przeplatają się z zarysami pól wodnych, powstają konstrukcje architektoniczne unoszące się na różnego rodzaju platformach pływających. Woda jest także coraz częściej włączana w projekty urbanistyczne. Linie styku pomiędzy lądem i wodą ulegają modyfikacjom, przywraca się dawne kanały i tworzy...
-
Consecutive colorings of the edges of general graphs
Publikacja