Filters
total: 7031
filtered: 4152
-
Catalog
- Publications 4152 available results
- Journals 813 available results
- Conferences 74 available results
- Publishing Houses 1 available results
- People 950 available results
- Inventions 3 available results
- Projects 74 available results
- Laboratories 1 available results
- Research Equipment 1 available results
- e-Learning Courses 113 available results
- Events 28 available results
- Open Research Data 821 available results
Chosen catalog filters
displaying 1000 best results Help
Search results for: HTAC/G TECHNOLOGY
-
New potential functions for greedy independence and coloring
PublicationA potential function $f_G$ of a finite, simple and undirected graph $G=(V,E)$ is an arbitrary function $f_G : V(G) \rightarrow \mathbb{N}_0$ that assigns a nonnegative integer to every vertex of a graph $G$. In this paper we define the iterative process of computing the step potential function $q_G$ such that $q_G(v)\leq d_G(v)$ for all $v\in V(G)$. We use this function in the development of new Caro-Wei-type and Brooks-type...
-
On trees with double domination number equal to total domination number plus one
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. A vertex of a graph is said to dominate itself and all of its neighbors. A double 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. The total (double, respectively) domination number of a graph G is the minimum cardinality of a total (double,...
-
Laser Induced Piezo-Optical Effects in Chalcogenides
Publication -
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...
-
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),...
-
Multi Queue Approach for Network Services Implemented for Multi Core CPUs
PublicationMultiple core processors have already became the dominant design for general purpose CPUs. Incarnations of this technology are present in solutions dedicated to such areas like computer graphics, signal processing and also computer networking. Since the key functionality of network core components is fast package servicing, multicore technology, due to multi tasking ability, seems useful to support packet processing. Dedicated...
-
Action of an Antiserum to a-Tocoquinone on Photosystem II-Particle Preparations of N icotiana tabacum
Publication -
An analysis of the prevalence of thyroid autoantibodies: thyroid peroxidase antibodies (ATA) and thyroglobulin antibodies (ATG) in children with newly diagnosed diabetes mellitus type 1 during 2000–2004 in the Upper Silesia region, Poland
Publication -
Dielectric and electro-optic studies of a bimesogenic liquid crystal composed of bent-core and calamitic units
Publication -
Augmentation index, pulse pressure amplification and superoxide anion production in patients with coronary artery disease
Publication -
A review of phosphorus recovery methods at various steps of wastewater treatment and sewage sludge management. The concept of “no solid waste generation” and analytical methods
PublicationPhosphorus deposits around the world are rapidly depleting, therefore phosphorus recovery methods are gaining more and more interest both in science and industry. This article presents the main methods of phosphorus recovery from sewage sludge. The described approaches are divided in two groups: phosphorus recovery from sewage sludge and leachate, and recovery of phosphorus from sewage sludge ashes. The latter seems to have more...
-
2007 Guidelines for the management of arterial hypertension: The Task Force for the Management of Arterial Hypertension of the European Society of Hypertension (ESH) and of the European Society of Cardiology (ESC)
Publication -
Some Progress on Total Bondage in Graphs
PublicationThe total bondage number b_t(G) of a graph G with no isolated vertex is the cardinality of a smallest set of edges E'⊆E(G) for which (1) G−E' has no isolated vertex, and (2) γ_t(G−E')>γ_t(G). We improve some results on the total bondage number of a graph and give a constructive characterization of a certain class of trees achieving the upper bound on the total bondage number.
-
A lower bound on the total outer-independent domination number of a tree
PublicationA total outer-independent 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, 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 nontrivial tree T of order n with l leaves we have gamma_t^{oi}(T) >= (2n-2l+2)/3,...
-
On trees with equal domination and total outer-independent domination numbers
PublicationFor a graph G=(V,E), a subset D subseteq V(G) is a dominating set if every vertex of V(G)D has a neighbor in D, while it is a total outer-independent dominating set if every vertex of G has a neighbor in D, and the set V(G)D is independent. The domination (total outer-independent domination, respectively) number of G is the minimum cardinality of a dominating (total outer-independent dominating, respectively) set of G. We characterize...
-
T-colorings, divisibility and circular chromatic number
PublicationLet T be a T-set, i.e., a finite set of nonnegative integers satisfying 0 ∈ T, and G be a graph. In the paper we study relations between the T-edge spans espT (G) and espd⊙T (G), where d is a positive integer and d ⊙ T = {0 ≤ t ≤ d (max T + 1): d |t ⇒ t/d ∈ T} . We show that espd⊙T (G) = d espT (G) − r, where r, 0 ≤ r ≤ d − 1, is an integer that depends on T and G. Next we focus on the case T = {0} and show that espd⊙{0} (G) =...
-
GreedyMAX-type Algorithms for the Maximum Independent Set Problem
PublicationA maximum independent set problem for a simple graph G = (V,E) is to find the largest subset of pairwise nonadjacent vertices. The problem is known to be NP-hard and it is also hard to approximate. Within this article we introduce a non-negative integer valued functionp defined on the vertex set V(G) and called a potential function of agraph G, while P(G) = max{vinV(G)| p(v)} is called a potential of G. For any graph P(G) <= D(G),...
-
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,...
-
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,...
-
Sustainable recovery of plant essential Nitrogen and Phosphorus from human urine using industrial coal fly ash
PublicationCoal-based thermal power plants play a pivotal role in meeting global energy demand. The amount of fly ash generated from these plants increases every year, and its successful use has posed a significant environmental risk in the last decade. In this study, coal fly ash was packed in a fixed-bed adsorption column to remove Urea–N from synthetic human urine. To assess the efficacy of fly ash in the removal of Nitrogen, various process...
-
Parity vertex colouring of graphs
PublicationA 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...
-
Equitable coloring of corona products of graphs
PublicationIn this paper we consider an equitable coloring of some corona products of graphs G and H in symbols, G o H). In particular, we show that deciding the colorability of G o H is NP-complete even if G is 4-regular and H is K_2. Next, we prove exact values or upper bounds on the equitable chromatic number of G o H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a path, a cycle or a complete graph.
-
Bone status in adolescents with type 1 diabetes
Publication -
The Escherichia coli RNA polymerase alpha subunit and transcriptional activation by bacteriophage lambda CII protein.
Publication -
SU‐E‐T‐103: Three‐Dimensional Measurements of Dose and LET from a Proton Beam via Polymer Gel Dosimetry
Publication -
Magnetic resonance imaging of radiation dose distributions using a polymer-gel dosimeter
Publication -
Ecological trends in machining as a key factor in sustainable production – A review
Publication -
Engineering Au nanoparticle arrays on SiO2 glass by pulsed UV laser irradiation
PublicationWe study semi-regular arrays of Au nanoparticles (NP) obtained via UV laser irradiation of thin Au films on glass substrate. The NP structures are prepared from films of a thickness up to 60 nm produced by discharge sputtering or pulsed laser deposition, and annealed by nanosecond laser pulses at 266 or 308 nm, respectively, at fluencies in the range of 60-410 mJ/cm2. For the rare- and close-packed NP structures, consistent description...
-
Vehicular Communication Environments
PublicationCommunication to and between road vehicles (cars, truck, buses, trains, etc.) are of growing interest. This is partly due to the attractive services that cooperative intelligent transport systems (C-ITSs) provides, mainly in the areas of traffic safety and traffic efficiency. An enabler for C-ITS is wireless vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communication, collectively referred to as vehicle-to-X (V2X)...
-
Carbon Nanotubes Chemically Derivatized with Redox Systems as Mediators for Biofuel Cell Applications
PublicationEnzymatyczne bioogniwa paliwowe to urządzenia wykorzystujące enzymy do przemiany energii chemicznej w elektryczną. Zyskana w ten sposób energia może służyć do zasilania wszczepialnych urządzeń (np. czujników glukozy, rozruszników serca). Przedstawiono sposób otrzymywania i właściwości bioelektrod, w których wykorzystano nanorurki węglowe modyfikowane mediatorami enzymatycznych reakcji redoks. Do nanorurek przyłączano zarówno mediatory...
-
Low frequency noise and reliability properties of 0.12um CMOS devices with Ta2O5 as gate dielectrics
PublicationW artykule przedstawiono wyniki badań jakości tranzystorów CMOS 0.12um z Ta2O5 użytym jako dielektryk bramki. Przedstawione są charakterystyki statyczne elementów oraz wyniki pomiarów szumów prowadzonych w celu określenia jakości warstwy dielektrycznej Ta2O5, a także wyniki badań przeciążeniowych elementów.
-
RDF dataset profiling - a survey of features, methods, vocabularies and applications
PublicationThe Web of Data, and in particular Linked Data, has seen tremendous growth over the past years. However, reuse and take-up of these rich data sources is often limited and focused on a few well-known and established RDF datasets. This can be partially attributed to the lack of reliable and up-to-date information about the characteristics of available datasets. While RDF datasets vary heavily with respect to the features related...
-
Isolation Number versus Domination Number of Trees
PublicationIf G=(VG,EG) is a graph of order n, we call S⊆VG an isolating set if the graph induced by VG−NG[S] contains no edges. The minimum cardinality of an isolating set of G is called the isolation number of G, and it is denoted by ι(G). It is known that ι(G)≤n3 and the bound is sharp. A subset S⊆VG is called dominating in G if NG[S]=VG. The minimum cardinality of a dominating set of G is the domination number, and it is denoted by γ(G)....
-
Silver-doped TiO2 prepared by microemulsion method: surface properties, bio- and photoactivity
PublicationOtrzymane fotokatalizatory typu Ag-TiO2 wykazywały wyższą aktywność w reakcjach fotodegradacji fenolu w obecności promieniowania z zakresu UV oraz światła widzialnego w porównaniu z komercyjnym katalizatorem Degussa P25 oraz czystym niedomieszkowanym TiO2, otrzymanym w mikroemulsji woda-AOT-cykloheksan. Powierzchnia właściwa (BET) otrzymanych katalizatorów wynosiła od 100 do 160 m2/g. Na podstawie analizy rentgenowskiej (XRD) stwierdzono,...
-
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...
-
The Backbone Coloring Problem for Bipartite Backbones
PublicationLet G be a simple graph, H be its spanning subgraph and λ≥2 be an integer. By a λ -backbone coloring of G with backbone H we mean any function c that assigns positive integers to vertices of G in such a way that |c(u)−c(v)|≥1 for each edge uv∈E(G) and |c(u)−c(v)|≥λ for each edge uv∈E(H) . The λ -backbone chromatic number BBCλ(G,H) is the smallest integer k such that there exists a λ -backbone coloring c of G with backbone H satisfying...
-
Review of cigars and cigar-type products as potential sources of consumer exposure to heavy metals
PublicationThe popularity of cigars, growing since 1993, has not gone hand in hand with the increased interest of researchers in these products. Although the literature widely describes the harmfulness of tobacco and the content of toxic substances in tobacco products, the topic is often treated selectively as relating primarily to cigarettes and rarely extends to other products of the broadly defined tobacco industry. However, there is no...
-
angielski
PublicationA subset D of V (G) is a dominating set of a graph G if every vertex of V (G) − D has at least one neighbour in D; let the domination number γ(G) be the minimum cardinality among all dominating sets in G. We say that a graph G is γ-q-critical if subdividing any q edges results in a graph with domination number greater than γ(G) and there exists a set of q − 1 edges such that subdividing these edges results in a graph with domination...
-
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...
-
Impact of aeration conditions on the removal of low concentrations of nitrogen in a tertiary partially aerated biological filter
PublicationA submerged biological aerated filter (BAF) partially aerated was used to study the removal of low concentrations of ammonia nitrogen (0.3 g N/m3 to 30.5 g N/m3) typically found in nutrient enriched river and lake waters, and treated effluents. Four series of experiments were performed with a synthetic wastewater at ammonia loading rates between 6 g N/m3 d and 903 g N/m3 d and C/N ratios from 2 to 20. The results showed that ammonia...
-
BTEX concentration levels in urban air in the area of the Tri-City agglomeration (Gdansk, Gdynia, Sopot), Poland
PublicationThe paper presents and discusses the results of atmospheric air quality research conducted in 2012 with reference to the level of BTEX compounds in the Tri-City agglomeration—Gdansk, Gdynia, and Sopot (northern Poland). At the stage of BTEX sampling from the ambient air, Radiello® diffusive passive samplers were applied. The annual time-weighted average concentrations for benzene, toluene, ethylbenzene, and xylenes (BTEX) in the...
-
A Noether theorem for stochastic operators on Schatten classes
PublicationWe prove that a stochastic (Markov) operator S acting on a Schatten class C_1 satisfies the Noether condition S'(A) = A and S'(A^2) = A^2, where A is a Hermitian bounded linear operator on a complex Hilbert space H, if and only if, S(E(G)XE(G)) = E(G)S(X)E(G) holds true for every Borel subset G of the real line R, where E(G) denotes the orthogonal projection coming from the spectral resolution of A. Similar results are obtained...
-
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)....
-
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...
-
Electric chips for rapid detection and quantification of nucleic acids
Publication -
Limonene: electronic state spectroscopy by high-resolution vacuum ultraviolet photoabsorption, electron scattering, He(I) photoelectron spectroscopy and ab initio calculations
PublicationZbadano limonen metodami spektroskopii absorpcyjnej, elektronowej, fotojonizacyjnej. Wyniki porównano z obliczeniami ab initio. Otrzymano strukturę wibracyjną molekuły.
-
Interval incidence coloring of subcubic graphs
PublicationIn 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.
-
Generalized Gradient Equivariant Multivalued Maps, Approximation and Degree
PublicationConsider the Euclidean space Rn with the orthogonal action of a compact Lie group G. We prove that a locally Lipschitz G-invariant mapping f from Rn to R can be uniformly approximated by G-invariant smooth mappings g in such a way that the gradient of g is a graph approximation of Clarke’s generalized gradient of f . This result enables a proper development of equivariant gradient degree theory for a class of set-valued gradient...
-
Coronas and Domination Subdivision Number of a Graph
PublicationIn this paper, for a graph G and a family of partitions P of vertex neighborhoods of G, we define the general corona G ◦P of G. Among several properties of this new operation, we focus on application general coronas to a new kind of characterization of trees with the domination subdivision number equal to 3.
-
Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
PublicationGiven two types of graph theoretical parameters ρ and σ, we say that a graph G is (σ, ρ)- perfect if σ(H) = ρ(H) for every non-trivial connected induced subgraph H of G. In this work we characterize (γw, τ )-perfect graphs, (γw, α′)-perfect graphs, and (α′, τ )-perfect graphs, where γw(G), τ (G) and α′(G) denote the weakly connected domination number, the vertex cover number and the matching number of G, respectively. Moreover,...