Filters
total: 5184
filtered: 3260
-
Catalog
- Publications 3260 available results
- Journals 112 available results
- Conferences 6 available results
- Publishing Houses 1 available results
- People 223 available results
- Projects 32 available results
- Laboratories 1 available results
- Research Teams 1 available results
- e-Learning Courses 55 available results
- Events 15 available results
- Open Research Data 1478 available results
Chosen catalog filters
displaying 1000 best results Help
Search results for: RICE GRAINS
-
Architektura przyszłości – przekraczanie granic poprzez interfejsy
PublicationArchitektura przyszłości rozpatrywana jest w kontekście rozwoju technologii cyfrowych, które umożliwiają nadawanie obiektom architektonicznym cech interfejsów. Przekraczanie granic dotyczy więc nadawania architekturze nowych funkcji - funkcjonalności zapożyczonych ze świata wirtualnego, emisji informacji oraz interakcji. W tym ujęciu „interfejs architektoniczny” stanowi płaszczyznę komunikacji pomiędzy obiektem architektonicznym...
-
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.
-
Modeling of active fiber Bragg grating sensors
PublicationW artykule omówiono działanie przetwornika hydrofonu wykorzystującego profilowaną membranę sprzężoną z aktywną światłowodową siatką Bragga. W wyniku modelowania, wykonanego Metodą Elementów Skończonych, stwierdzono występowanie gradientów naprężeń wzdłuż siatki. Opracowano program do modelowania pasywnych i aktywnych światłowodowych siatek Bragga wykorzystujący metodę modów sprzężonych. Przedstawiono charakterystyki widmowe pasywnych...
-
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.
-
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.
-
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.
-
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),...
-
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.
-
On the size of identifying codes in triangle-free graphs
PublicationIn an undirected graph G, a subset C⊆V(G) such that C is a dominating set of G, and each vertex in V(G) is dominated by a distinct subset of vertices from C, is called an identifying code of G. The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. For a given identifiable graph G, let gammaID(G) be the minimum cardinality of an identifying code in G. In this paper, we show that for any connected...
-
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...
-
Decontaminating Arbitrary Graphs by Mobile Agents: a Survey
PublicationA team of mobile agents starting from homebases need to visit and clean all nodes of the network. The goal is to find a strategy, which would be optimal in the sense of the number of needed entities, the number of moves performed by them or the completion time of the strategy. Currently, the field of distributed graph searching by a team of mobile agents is rapidly expanding and many new approaches and models are being presented...
-
Total Domination Versus Domination in Cubic Graphs
PublicationA dominating set in a graph G is a set S of vertices of G such that every vertex not in S has a neighbor in S. Further, if every vertex of G has a neighbor in S, then S is a total dominating set of G. The domination number,γ(G), and total domination number, γ_t(G), are the minimum cardinalities of a dominating set and total dominating set, respectively, in G. The upper domination number, \Gamma(G), and the upper total domination...
-
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)....
-
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.
-
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...
-
Domination subdivision and domination multisubdivision numbers of graphs
PublicationThe domination subdivision number sd(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 domination number of G. It has been shown [10] that sd(T)<=3 for any tree T. We prove that the decision problem of the domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the domination multisubdivision number...
-
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...
-
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...
-
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...
-
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.
-
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.
-
Günter Grass - kolekcja plus
Publication -
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...
-
Wave energy attenuation in fields of colliding ice floes &#8211; Part 1: Discrete-element modelling of dissipation due to ice&#8211;water drag
Publication -
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...
-
An evaluation and implementation of the regional coupled ice-ocean model of the Baltic Sea
Publication -
Conditions of spatiotemporal variability of the thickness of the ice cover on lakes in the Tatra Mountains
Publication -
A quantitative approach for risk assessment of a ship stuck in ice in Arctic waters
Publication -
Towards a probabilistic model for predicting ship besetting in ice in Arctic waters
Publication -
A probabilistic model of ship performance in ice based on full-scale data
Publication -
Mathematical Modeling of Ice Dynamics as a Decision Support Tool in River Engineering
PublicationThe prediction of winter flooding is a complicated task since it is affected by many meteorological and hydraulic factors. Typically, information on river ice conditions is based on historical observations, which are usually incomplete. Recently, data have been supplemented by information extracted from satellite images. All the above mentioned factors provide a good background of the characteristics of ice processes, but are not...
-
Assessing and Mitigating Ice-Jam Flood Hazards and Risks: A European Perspective
PublicationThe assessment and mapping of riverine flood hazards and risks is recognized by many countries as an important tool for characterizing floods and developing flood management plans. Often, however, these management plans give attention primarily to open-water floods, with ice-jam floods being mostly an afterthought once these plans have been drafted. In some Nordic regions, ice-jam floods can be more severe than open-water floods,...
-
Both activating and inhibitory Fc gamma receptors mediate rituximab-induced trogocytosis of CD20 in mice
Publication -
The Clinical Use of Platelet-Rich Plasma in Knee Disorders and Surgery—A Systematic Review and Meta-Analysis
Publication -
The Effects of the Anthropological Race, Gender and Location of Verbal-Pictorial Stimuli on the Usability of Visual Information Conveyance
Publication -
Biological and Physico-Chemical Characteristics of Arginine-Rich Peptide Gemini Surfactants with Lysine and Cystine Spacers
Publication -
Single Triglyceride-Rich Meal Destabilizes Barrier Functions and Initiates Inflammatory Processes of Endothelial Cells
Publication -
Ovocystatin Induced Changes in Expression of Alzheimer’s Disease Relevant Proteins in APP/PS1 Transgenic Mice
Publication -
Injectable Platelet-Rich Fibrin (I-PRF) Administered to Temporomandibular Joint Cavities: A Scoping Review
Publication -
System edukacyjny w Polsce - asynchronizacja oświaty względem szkolnictwa wyższego i vice versa
Publication -
Low-dose radiation accelerates aging of the T-cell receptor repertoire in CBA/Ca mice
Publication -
Fuel price, income and road safety as determinants of the level of the population’s economic well-being in Poland
PublicationThe opportunity to travel is one of the most favorite human activities, given that on a trip a person gets new knowledge, impressions and positive emotions. Recreational trips occupy a prominent place in the concept of the economics of happiness, and the study of factors that influence decision-making regarding travel is important for forecasting the number of tourists, infrastructure development, income and expenses of businesses...
-
Numerical Analysis of Mice Carotid Arteries’ Response Emphasizing the Importance of Material Law Constants’ Validation
PublicationIn this paper, a detailed validation of the passive material properties of mice carotid arteries and constants of the Fung and Holzapfel hyperelastic material laws is conducted by means of static nonlinear FEM analyses. The response of the carotid arteries in an inflation test is studied here for the following mouse models: wild-type, mdx, sgcd−/−, Eln+/+, Eln+/−, Fbln5+/+, and Fbln5−/−. All FEM computations are conducted on models...
-
sp2-rich dendrite-like carbon nanowalls as effective electrode for environmental monitoring of explosive nitroaromatic
PublicationNitroaromatic compounds are commonly used explosive materials that pose a risk to human health and ecosystems due to their acute toxicity and carcinogenicity. Nitroaromatics have numerous pathways into the environment via discarded munitions (e.g. into the Baltic Sea after World War II), after use in mining operations, and in industrial run-off from factories producing these compounds (which are produced across the world to date)....