Search
Filters
total: 3746
filtered: 2470
-
Catalog
- Publications 2470 available results
- Journals 164 available results
- Conferences 7 available results
- Publishing Houses 1 available results
- People 39 available results
- Projects 5 available results
- e-Learning Courses 34 available results
- Events 8 available results
- Open Research Data 1018 available results
Chosen catalog filters
displaying 1000 best results Help
Search results for: GLOBAL DEFENSIVE SET
-
On trees with equal 2-domination and 2-outer-independent domination numbers
PublicationFor a graph G = (V,E), a subset D \subseteq V(G) is a 2-dominating set if every vertex of V(G)\D$ has at least two neighbors in D, while it is a 2-outer-independent dominating set if additionally the set V(G)\D is independent. The 2-domination (2-outer-independent domination, respectively) number of G, is the minimum cardinality of a 2-dominating (2-outer-independent dominating, respectively) set of G. We characterize all trees...
-
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...
-
An upper bound on the 2-outer-independent domination number of a tree
PublicationA 2-outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)D has a at least two neighbors in D, and the set V(G)D is independent. The 2-outer-independent domination number of a graph G, denoted by gamma_2^{oi}(G), is the minimum cardinality of a 2-outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_2^{oi}(T) <= (n+l)/2,...
-
Data on LEGO sets release dates and worldwide retail prices combined with aftermarket transaction prices in Poland between June 2018 and June 2023
PublicationThe dataset contains LEGO bricks sets item count and pricing history for AI-based set pricing prediction. The data spans the timeframe from June 2018 to June 2023. The data was obtained from three sources: Brickset.com (LEGO sets retail prices, release dates, and IDs), Lego.com official web page (ID number of each set that was released by Lego, its retail prices, the current status of the set) and promoklocki.pl web page (the retail...
-
An upper bound on the total outer-independent domination number of a tree
PublicationA total outer-independent dominating set of a graph G=(V(G),E(G)) is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every tree T of order n >= 4, with l leaves and s support vertices we have...
-
Interactions between polyphenolic antioxidants quercetin and naringenin dictate the distinctive redox-related chemical and biological behaviour of their mixtures
PublicationFood synergy concept is suggested to explain observations that isolated antioxidants are less bioactive than real foods containing them. However, mechanisms behind this discrepancy were hardly studied. Here, we demonstrate the profound impact of interactions between two common food flavonoids (individual: aglycones quercetin—Q and naringenin—N− or their glycosides rutin—R and naringin—N+ vs. mixed: QN− and RN+) on their electrochemical...
-
Thermo-oxidative exfoliation of carbon black from ground tire rubber as potential reinforcement in green tires
PublicationConsidering the balance between rapidly growing global tire demand and scarcity of natural resources, recycling and reclaiming techniques of tire rubber have become the state of the art. Herein, we set out to implement a self-designed thermo-oxidative reactor for the exfoliation of carbon black (CB) from ground tire rubber, which is efficiently functioned under a thermo-oxidative reclaiming condition without any additive. The exfoliation...
-
Community of Practice for Product Innovation Towards the Establishment of Industry 4.0
PublicationThe aim of this paper is to present the necessity of formulating the Community of Practice for Product Innovation process based on Cyber-Physical Production Systems towards the establishment of Industry 4.0. At this developing phase of Industry 4.0, there is a need to define a clear and more realistic approach for implementation process of Cyber-Physical Production Systems in manufacturing industries. Today Knowledge Management...
-
Mercury in Living Organisms: Sources and Forms of Occurrence, Bioaccumulation, and Determination Methods
PublicationMercury (Hg) is a heavy metal with well-known and broadly tested toxicity. Since Hg pollution and its impacts on human health are of global concern, it has become necessary to develop analytical methodologies that will provide tools to obtain reliable analytical information about the levels of Hg in samples, which very often have a complex matrix composition. This chapter summarizes key information on Hg and its chemical forms,...
-
2-outer-independent domination in graphs
PublicationWe initiate the study of 2-outer-independent domination in graphs. A 2-outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)\D has at least two neighbors in D, and the set V(G)\D is independent. The 2-outer-independent domination number of a graph G is the minimum cardinality of a 2-outer-independent dominating set of G. We show that if a graph has minimum degree at least two,...
-
An upper bound for the double outer-independent domination number of a tree
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)\D is independent. The double outer-independent domination number of a graph G, denoted by γ_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We prove...
-
Study on the Positioning Accuracy of GNSS/INS Systems Supported by DGPS and RTK Receivers for Hydrographic Surveys
PublicationHydrographic surveys, in accordance with the International Hydrographic Organization (IHO) S-44 standard, can be carried out in the following five orders: Exclusive, Special, 1a, 1b and 2, for which minimum accuracy requirements for the applied positioning system have been set out. They are as follows, respectively: 1, 2, 5, 5 and 20 m, with a confidence level of 95% in twodimensional space. The Global Navigation Satellite System...
-
Accurate Modeling of Antenna Structures by Means of Domain Confinement and Pyramidal Deep Neural Networks
PublicationThe importance of surrogate modeling techniques has been gradually increasing in the design of antenna structures over the recent years. Perhaps the most important reason is a high cost of full-wave electromagnetic (EM) analysis of antenna systems. Although imperative in ensuring evaluation reliability, it entails considerable computational expenses. These are especially pronounced when carrying out EM-driven design tasks such...
-
Weakly convex domination subdivision number of a graph
PublicationA set X is weakly convex in G if for any two vertices a; b \in X there exists an ab–geodesic such that all of its vertices belong to X. A set X \subset V is a weakly convex dominating set if X is weakly convex and dominating. The weakly convex domination number \gamma_wcon(G) of a graph G equals the minimum cardinality of a weakly convex dominating set in G. The weakly convex domination subdivision number sd_wcon (G) is the minimum...
-
Sustainable Investing. Socio-Economic Impacts of Exchange-Traded Funds
PublicationSustainable Investing: Socio-Economic Impacts of Exchange-Traded Funds examines the social and economic effects of sustainable investing ETFs and their impacts on the global financial system. The book presents the key issues with regard to sustainable investing, discussing exchange-traded funds mechanisms and categories in comparison to competing investment funds. The book outlines the theoretical determinants of ETF markets development...
-
ANALYZING TITLES OF ECONOMY NEWS TO UNDERSTAND IMPACT OF COVID-19 ON ECONOMICAL SITUATION
PublicationCovid-19 affected the whole world in a short time, causing serious panic and uncertainty in society. Because it was an unprecedented disease, the medical community has worked hard to find out how to deal with it, and it continues to do so. The rapid spread of the disease, the shortage of hospital capacity and the increase in deaths drove the whole world to a closure, so to speak. In this time period, life in the world came to a...
-
Third sector characteristics and importance
PublicationThis article aims to present a brief overview of existing definitions and specific characteristics of the third sector. It also highlights the basic functions of NGOs as an important institutional and organizational actor in the global political and economic landscape.
-
Edible black ant Smith (Carebara vidua) as human food – A systematic review
PublicationMeeting food security is one of the major global challenges to ensure sufficient supply of food for current and future generations, considering increasing population growth and climate change issues. Consequently, the consumption of edible insects as an alternative food source has recently gained global attention for combating global food insecurity. The present review aims to provide information on the recent progress in consumption...
-
Weakly convex and convex domination numbers of some products of graphs
PublicationIf $G=(V,E)$ is a simple connected graph and $a,b\in V$, then a shortest $(a-b)$ path is called a $(u-v)$-{\it geodesic}. A set $X\subseteq V$ is called {\it weakly convex} in $G$ if for every two vertices $a,b\in X$ exists $(a-b)$- geodesic whose all vertices belong to $X$. A set $X$ is {\it convex} in $G$ if for every $a,b\in X$ all vertices from every $(a-b)$-geodesic belong to $X$. The {\it weakly convex domination number}...
-
Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph
PublicationA vertex cover of a graph G = (V, E) is a set X ⊂ V such that each edge of G is incident to at least one vertex of X. The ve cardinality of a vertex cover of G. A dominating set D ⊆ V is a weakly connected dominating set of G if the subgraph G[D]w = (N[D], Ew) weakly induced by D, is connected, where Ew is the set of all edges having at least one vertex in D. The weakly connected domination number γw(G) of G is the minimum cardinality...
-
A lower bound on the double outer-independent domination number of a tree
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)D is independent. The double outer-independent domination number of a graph G, denoted by gamma_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We...
-
Numerical analysis and in situ tests of the Grot Rowecki Bridge in Warsaw
PublicationThe paper presents the FEM analysis of the reconstructed the Grot-Rowecki Bridge over Vistula river in Warsaw. The bridge has seven spans and consists of two independent structures with the longest spans of 120 m. After reconstruction the bridge is over 10 m wider. The numerical, nonlinear analysis has been con-ducted on a global and local FEM models. These models are defined so as they strictly comply with global structural bridge...
-
Environmental Impacts of Renewable Energy Technologies
PublicationNowadays, fossil fuels are the main sources energy from which electricity is obtained. But these sources will not last forever, so in due course renewable energies will have to replace them in this role. All energy sources have some impact on our environment. Fossil fuels — coal, oil, and natural gas — do substantially more harm than renewable energy sources by most measures, including air and water pollution, damage to public...
-
Reconstruction of 3D image of corona discharge streamer
PublicationIn this paper, the method of reconstruction of the 3D structure of streamers in DC positive corona discharge in nozzle-to-plate electrode configuration is presented. For reconstructing of 3D image of corona discharge streamer we propose a stereographical method, where streamers are observed from several directions simultaneously. The multi-directional observation enabled to obtain fine positional coordinates of streamers for a...
-
Wisdom in the context of globalization and civilization
PublicationThe book seeks to answer the question - what is wisdom and how should it be used in everyday life? A model of wisdom is presented in which wisdom describes three attributes: knowledge, qualifications (skills) and inspirations leading to consciously controlled processes of correct assessment of the situation and the correct choice of solution options in the context of the art of living. For each attribute, we can specify a set of...
-
Determinants and effects of Poland’s road accidents in the context of the 2030 agenda for sustainable development – poviat level analysis for the years 2010-2019
PublicationThe objective of the research was to assess how selected factors influence road safety in Poland’s poviats. To that end, an analysis was conducted of road accident determinants and effects in the poviats in the years 2010-2019. The time horizon fits in with Goal 3.6. of Agenda 2030, which is to halve the number of global deaths and injuries from road traffic accidents by 2020. The article pres-ents the analysis results for the...
-
Graphs with isolation number equal to one third of the order
PublicationA set D of vertices of a graph G is isolating if the set of vertices not in D and with no neighbor in D is independent. The isolation number of G, denoted by \iota(G) , is the minimum cardinality of an isolating set of G. It is known that \iota(G) \leq n/3 , if G is a connected graph of order n, , distinct from C_5 . The main result of this work is the characterisation of unicyclic and block graphs of order n with isolating number...
-
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...
-
Competitiveness of the Visegrad Countries - Paths for Competitiveness Growth
PublicationThe article includes two objectives: 1) to determine competitiveness of V4 countries in terms of 12 pillars of competitiveness used by The Global Competitiveness Report of the WEF, 2) to propose taxonomic method to appoint a path of competitiveness growth of economies.
-
Establishing intelligent enterprise through community of practice for product innovation
PublicationThis paper presents the idea of implementing the virtual Community of Practice for Product Innovation processes towards the establishment of intelligent enterprise. Since the fourth industrial revolution is passing through the developing phase, implementation of Cyber-Physical Production Systems require more realistic approach. Knowledge Management and Engineering plays an important role in manufacturing industries facing global...
-
POMERANIAN LANDSCAPES OF MODERNIST ZASPA. CONCEPTS OF REVITALISATION OF THE HOUSING ESTATE
PublicationZaspa is a neighbourhood in Gdansk with a long locational history and numerous build-ups. It is situated in a complex landscape between the coastal strip and moraine hills. The housing estates built here in the 1970s followed the postulates of modernist urbanism, ignoring the topographical and natural specifics and the regional heritage. The result was an ergonomic but anonymous space with many current strengths...
-
Optimizing FSO networks resilient to adverse weather conditions by means of enhanced uncertainty sets
PublicationThis work deals with dimensioning of wireless mesh networks (WMN) composed of FSO (free space optics) links. Although FSO links realize broadband transmission at low cost, their drawback is sensitivity to adverse weather conditions causing transmission degradation on multiple links. Hence, designing such FSO networks requires an optimization model to find the cheapest configuration of link capacities that will be able to carry...
-
Thermodynamic Cycles of Air Microturbine Power Plants Working on Biomass Fuels
PublicationThe gas turbine engine is modified to work as an air turbine set which consists, in the simplest arrangement, of a compressor, a heat exchanger and a turbine. Air is a working medium for both: the compressor and the turbine. This kind of air turbine set can be applied in power plants working on biomass fuels. In this solution we can burn fuels of varying parameters in the external combustion chamber without any harmful effects...
-
Bounds on the vertex-edge domination number of a tree
PublicationA vertex-edge dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every edge of $G$ is incident with a vertex of $D$ or a vertex adjacent to a vertex of $D$. The vertex-edge domination number of a graph $G$, denoted by $\gamma_{ve}(T)$, is the minimum cardinality of a vertex-edge dominating set of $G$. We prove that for every tree $T$ of order $n \ge 3$ with $l$ leaves and $s$ support vertices we have $(n-l-s+3)/4...
-
On trees attaining an upper bound on the total domination number
PublicationA total dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D. The total domination number of a graph G, denoted by γ_t(G), is the minimum cardinality of a total dominating set of G. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International Journal of Graphs and Combinatorics 1 (2004), 69-75] established the following upper bound on the total domination...
-
An Alternative Proof of a Lower Bound on the 2-Domination Number of a Tree
PublicationA 2-dominating set of a graph G is a set D of vertices of G such that every vertex not in D has a at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. Fink and Jacobson [n-domination in graphs, Graph theory with applications to algorithms and computer science, Wiley, New York, 1985, 283-300] established the following lower bound on the 2-domination...
-
On trees with double domination number equal to 2-domination number plus one
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A subset D subseteq V(G) is a 2-dominating set of G if every vertex of V(G)D is dominated by at least two vertices of D, while it is a double dominating set of G if every vertex of G is dominated by at least two vertices of D. The 2-domination (double domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (double dominating,...
-
Interpolation properties of domination parameters of a graph
PublicationAn integer-valued graph function π is an interpolating function if a set π(T(G))={π(T): T∈TT(G)} consists of consecutive integers, where TT(G) is the set of all spanning trees of a connected graph G. We consider the interpolation properties of domination related parameters.
-
Independent Domination Subdivision in Graphs
PublicationA 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...
-
Weakly connected Roman domination in graphs
PublicationA Roman dominating function on a graph G=(V,E) is defined to be a function f :V → {0,1,2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v)=2. A dominating set D⊆V is a weakly connected dominating set of G if the graph (V,E∩(D×V)) is connected. We define a weakly connected Roman dominating function on a graph G to be a Roman dominating function such that the set...
-
Graph security testing
PublicationSet S ⊂ V is called secure set iff ∀ X ⊂ S | N [ X ] ∩ S | ≥ | N ( X ) \ S | [3]. That means that every subset of a secure set has at least as many friends (neighbour vertices in S) as enemies (neighbour vertices outside S) and will be defended in case of attack. Problem of determining if given set is secure is co −NP -complete, there is no efficient algorithm solving it [3]. Property testers are algorithms that distinguish inputs...
-
Physical, chemical and biochemical properties of Western Siberia Sphagnum and Carex peat soils
Publication -
Influence of the type of photocatalyst on photocatalytic oxidation of triclosan in the aquatic environment
Publication -
Do Organizational Ethics Improve IT Job Satisfaction in the Visegrád Group Countries? Insights from Poland
Publication -
Effects of Harvesting Dates on Qualitative Characteristics of Bread Wheat Cultivars
Publication -
Analysis of pesticide residue in fruits and vegetables using analytical analytical protocol based on application of QuEChERS technique and GC-ECD system
PublicationQuEChERS sample preparation method was used for the determination of 10 pesticides and their metabolites in fruits (apple, grape) and vegetables (tomato, paprika), coupled to gas chromatography with electron capture detector (GC-ECD). The experimental parameters including amount of the sample, types of solvents, extraction time and types of sorbent at the purification stage were optimized. The GC-ECD method was validated in terms...
-
The impact of initial and boundary conditions on severe weather event simulations using a high-resolution WRF model. Case study of the derecho event in Poland on 11 August 2017
PublicationPrecise simulations of severe weather events are a challenge in the era of changing climate. By performing simulations correctly and accurately, these phenomena can be studied and better understood. In this paper, we have verified how different initial and boundary conditions affect the quality of simulations performed using the Weather Research and Forecasting Model (WRF). For our analysis, we chose...
-
A Method for Determination and Compensation of a Cant Influence in a Track Centerline Identification Using GNSS Methods and Inertial Measurement
PublicationAt present, the problem of rail routes reconstruction in a global reference system is increasingly important. This issue is called Absolute Track Geometry, and its essence is the determination of the axis of railway tracks in the form of Cartesian coordinates of a global or local coordinate system. To obtain such a representation of the track centerline, the measurement methods are developed in many countries mostly by the using...
-
A remark on singular sets of vector bundle morphisms
PublicationIf characteristic classes for two vector bundles over the same base space do not coincide, then the bundles are not isomorphic. We give under rather common assumptions a lower bound on the topological dimension of the set of all points in the base over which a morphism between such bundles is not bijective. Moreover, we show that this set is topologically non-trivial.
-
Evaluation of propagation parameters of open guiding structures with the use of complex root finding algorithms
PublicationAn efficient complex root tracing algorithm is utilized for the investigation of electromagnetic wave propagation in open guiding structures. The dispersion characteristics of propagated and leaky waves are calculated for a couple of chosen waveguides. The efficiency of the root tracing algorithm is discuses and compared to a global root finding algorithm.