Search results for: MINIMUM RASAUERA-TOWNSENDA
-
Properties of the triset metric for phylogenetic trees
Publicationthe following paper presents a new polynomial time metric for unrootedphylogenetic trees (based on weighted bipartite graphs and the method ofdetermining a minimum perfect matching) and its properties. also many its properties are presented.
-
Unicyclic graphs with equal total and total outer-connected domination numbers
PublicationLet G = (V,E) be a graph without an isolated vertex. A set D ⊆ V (G) is a total dominating set if D is dominating and the in- duced subgraph G[D] does not contain an isolated vertex. The total domination number of G is the minimum cardinality of a total domi- nating set of G. A set D ⊆ V (G) is a total outer–connected dominating set if D is total dominating and the induced subgraph G[V (G)−D] is a connected graph. The total outer–connected...
-
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...
-
Critical minima in elastic scattering of electrons from Ar and Zn.
PublicationDokonano obliczeń różniczkowych przekrojów czynnych na sprężyste rozpraszanie elektronów na atomach argonu i cynku. Otrzymane minimum krytyczne z tych przekrojów porównano z niedawno otrzymanymi danymi doświadczalnymi.
-
Modelowanie procesów nierównowagowych, W/C ,Energetyka. sem 1, lato 23/24PG_00057424
e-Learning CoursesPrzedstawienie głównych mechanizmów i praw dotyczących termodynamiki procesów nierównowagowych. Zapoznanie z podejściami do analizy procesów nierównowagowych. Analiza przykładów procesów nierównowagowych i ich opis. Wprowadzenie do zagadnień związanych z analizą procesów za pomocą kryterium minimum produkcji entropii
-
Feature Reduction Using Similarity Measure in Object Detector Learning with Haar-like Features
PublicationThis paper presents two methods of training complexity reduction by additional selection of features to check in object detector training task by AdaBoost training algorithm. In the first method, the features with weak performance at first weak classifier building process are reduced based on a list of features sorted by minimum weighted error. In the second method the feature similarity measures are used to throw away that features...
-
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...
-
Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs
PublicationGiven a graph G= (V, E), the subdivision of an edge e=uv∈E(G) means the substitution of the edge e by a vertex x and the new edges ux and xv. The domination subdivision number of a graph G is the minimum number of edges of G which must be subdivided (where each edge can be subdivided at most once) in order to increase the domination number. Also, the domination multisubdivision number of G is the minimum number of subdivisions...
-
Geometric working volume of a satellite positive displacement machine
PublicationThis article describes a method for determining the geometric working volume of satellite positive displacement machines (pump and motor). The working mechanism of these machines is satellite mechanism consisting of two non-circular gears (rotor and curvature) and circular gears (satellites). Two variants of the satellite mechanism are presented. In the first mechanism, the rolling line of the rotor is a sinusoid "wrapped" around...
-
Three-objective antenna optimization by means of kriging surrogates and domain segmentation
PublicationIn this paper, an optimization framework for multi-objective design of antenna structures is discussed which exploits data-driven surrogates, a multi-objective evolutionary algorithm, response correction techniques for design refinement, as well as generalized domain segmentation. The last mechanism is introduced to constrain the design space region subjected to sampling, which permits reduction of the number of training data samples...
-
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}...
-
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)....
-
Results of experimental research of hydraulic satellite motor
Open Research DataThe study of the flow rate in the motor and the torque on the motor shaft at low constant speed were carried out.The file contains measurement data of the torque on the motor shaft and the flow rate in the motor as a function of the angle of shaft rotation at various constant pressure drops in the motor.
-
Polynomial triset metric for unrooted phylogenetic trees
Publicationthe following paper presents a polynomial triset metric for unrooted phylogenetic trees (based on weighted bipartite graphs and the method of determining a minimum edge cover) and its basic characteristics. also a list of further directions of research and examples of the wider use of this metric is presented.
-
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...
-
Selection of Electrode Material for Inconel 617/P92 Steel SMAW Dissimilar Welds
PublicationThe present work aimed to investigate the microstructure and mechanical properties of the dissimilar shielded metal arc welded (SMAW) joint of Alloy 617 and P92 steel for advanced ultrasupercritical boilers. The SMAW joint was produced using three different types of electrodes, namely, ENiCrFe-3, ENiCrMo-3, and ENiCrCoMo-1. During microstructural observation of the welded joints, no possible cracking was detected in the weldments....
-
On trees with double domination number equal to 2-outer-independent domination number plus one
PublicationA 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 double domination number of a graph G is the minimum cardinality of a double dominating set of G. For 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...
-
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...
-
NUTRITECH I – spotkanie informacyjne
EventsInformacje podstawowe, finansowe i o generatorze wniosków. Podstawowe informacje o przeprowadzeniu oceny.
-
Wysokociśnieniowe uszczelnienia ruchu obrotowego wału hydraulicznych maszyn wyporowych
PublicationW artykule przedstawiono wyniki badań mające na celu wytypowanie węzła uszczelniającego wał silnika hydraulicznego zapewniającego najwyższą trwałość przy smarowaniu wodą. Parametry pracy: ciśnienie 2 MPa i minimalna prędkość poślizgu uszczelek 2 m/s. Opisano również nowatorski przyrząd, na którym przeprowadzono pomiary wszystkich parametrów węzła uszczelniającego.
-
THE PROBLEM OF THE CALCULATION OF THE FREQUENCY OF DIAGNOSTIC EXAMINATIONS BASED ON DEVICE’S PROPER OPERATION TIME
PublicationThe paper presents the proposal to apply the normal distribution to solve the problem of the frequency of diagnostic tests. Particular emphasis is placed on simplicity of the method. This method may be useful for the average user technical system. The method reduces the number of assumptions to a minimum. The results do not raise of serious doubts but they require verification of course.
-
VAT rates in particular member states of the European Union in 2015
Open Research DataUnder European Union law, the minimum standard rate of VAT that Member States can apply is 15%. An upper limit has not been specified. Despite attempts to harmonize the value added tax rates, the range of tax rates applied between countries is large. Currently, Luxembourg uses the lowest standard rate (15%), and Hungary uses the highest (27%). Due to...
-
Multi-objective design optimization of antennas for reflection, size, and gain variability using kriging surrogates and generalized domain segmentation
PublicationCost-efficient multi-objective design optimization of antennas is presented. The framework exploits auxiliary data-driven surrogates, a multi-objective evolutionary algorithm for initial Pareto front identification, response correction techniques for design refinement, as well as generalized domain segmentation. The purpose of this last mechanism is to reduce the volume of the design space region that needs to be sampled in order...
-
Stateczność czołowego obwałowania nasypu przeciwpowodziowego Jeziora Druzno
PublicationPrzedstawiono analizę stateczności czołowego obwałowania przeciwpowodziowego Jeziora Druzno w miejscowości Nowe Dolno. Obliczenia przeprowadzono zarówno w naprężeniach całkowitych jak i efektywnych uproszczoną metodą Bishopa oraz metodą Felleniusa-Peterssona. Uzyskano wysokie wartości minimalnego wskaźnika stateczności, zapewniające znaczny zapas stateczności nasypu podczas długotrwałych piętrzeń wody w jeziorze. Mogłoby to wskazywać...
-
Glosa aprobująca do wyroku Izby Karnej Sądu Najwyższego z 29 maja 2018 r. o sygn. akt II KK 99/18. A comment of approval on the verdict of 29 May 2018 issued by the Criminal Law Chamber of the Polish Supreme Court (II KK 99/18).
Publication"Glosowany wyrok Sądu Najwyższego dotyczy problematyki orzekania o czynach przeciwko mieniu, w stosunku do których od 9 listopada 2013 r. kryterium uznania danego czynu za przestępstwo albo za wykroczenie stanowi określony w kodeksie wykroczeń wskaźnik minimalnego wynagrodzenia za pracę. We wskazanym zakresie należy mieć na uwadze minimalne wynagrodzenie z daty orzekania w przedmiocie odpowiedzialności za taki czyn, a nie z...
-
2-bondage in graphs
PublicationA 2-dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of V(G)D has 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. The 2-bondage number of G, denoted by b_2(G), is the minimum cardinality among all sets of edges E' subseteq E such that gamma_2(G-E') > gamma_2(G). If for every E' subseteq E we have...
-
Evaluation of pounding effects between reinforced concrete frames subjected to far-field earthquakes in terms of damage index
PublicationIn this paper, three different damage indexes were used to detect nonlinear damages in two adjacent Reinforced Concrete (RC) structures considering pounding effects. 2-, 4- and 8-story benchmark RC Moment Resisting Frames (MRFs) were selected for this purpose with 60%, 75%, and 100% of minimum separation distance and also without any in-between separation gap. These structures were analyzed using the incremental dynamic analysis...
-
Exploiting multi-interface networks: Connectivity and Cheapest Paths
PublicationLet G = (V,E) be a graph which models a set of wireless devices (nodes V) that can communicate by means of multiple radio interfaces, according to proximity and common interfaces (edges E). The problem of switching on (activating) the minimum cost set of interfaces at the nodes in order to guarantee the coverage of G was recently studied. A connection is covered (activated) when the endpoints of the corresponding edge share at...
-
Novel single-stage buck-boost inverter with unfolding circuit
PublicationA novel solution of a single-stage buck-boost inverter with unfolding circuit at the output stage is presented. The inverter has a wide range of input voltage regulation, minimum passive components and a very flexible control structure. It can be applied for renewable energy systems where high power density is required. Our simulation results confirmed all theoretical statements
-
Topological modifications for performance improvement and size reduction of wideband antenna structures
PublicationCompact antennas belong to the key components of modern communication systems. Their miniaturization is often achieved by introducing appropriate topological changes such as simple ground plane slots or tapered feeds. More sophisticated modifications are rarely considered in the literature because they normally lead to significant increase of the number of tunable parameters, which makes the antenna design process more challenging....
-
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...
-
Computational aspects of greedy partitioning of graphs
PublicationIn this paper we consider a variant of graph partitioning consisting in partitioning the vertex set of a graph into the minimum number of sets such that each of them induces a graph in hereditary class of graphs P (the problem is also known as P-coloring). We focus on the computational complexity of several problems related to greedy partitioning. In particular, we show that given a graph G and an integer k deciding if the greedy...
-
Double bondage in graphs
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The double domination number of a graph G, denoted by gamma_d(G), is the minimum cardinality of a double dominating set of G. The double bondage number of G, denoted by b_d(G), is the minimum cardinality among all sets...
-
The convex domination subdivision number of a graph
PublicationLet G = (V;E) be a simple graph. A set D\subset V is a dominating set of G if every vertex in V - D has at least one neighbor in D. The distance d_G(u, v) between two vertices u and v is the length of a shortest (u, v)-path in G. An (u, v)-path of length d_G(u; v) is called an (u, v)-geodesic. A set X\subset V is convex in G if vertices from all (a, b)-geodesics belong to X for any two vertices a, b \in X. A set X is a convex dominating...
-
Evaluation of the Influence of Farming Practices and Land Use on Groundwater Resources in a Coastal Multi-Aquifer System in Puck Region (Northern Poland)
PublicationThis study focuses on the modeling of groundwater flow and nitrate transport in a multi-aquifer hydrosystem in northern Poland, adjacent to Puck Bay (Baltic sea). The main goal was to investigate how changes in land use and farming practices may affect groundwater recharge and submarine groundwater discharge (SGD) to the sea and the associated N-NO3 fluxes. An integrated modelling approach has been developed, which couples the...
-
Disaster-Resilient Routing Schemes for Regional Failures
PublicationLarge-scale natural disasters can have a profound effect on the telecommunication services in the affected geographical area. Hence, it is important to develop routing approaches that may help in circumventing damaged regional areas of a network. This prompted the development of geographically diverse routing schemes and also of disaster-risk aware routing schemes. A minimum-cost geodiverse routing, where a minimum geographical...
-
Electron collision with sulfuryl chloride (SO2Cl2) molecule
PublicationStosując liniową metodę transmisyjną zmierzono całkowite przekroje czynne (TCS) na zderzenie elektronów z drobinami SO2Cl2 w zakresie energii 0.5-150 eV. Stwierdzono obecność głębokiego minimum przy ok. 1.8 eV i szerokiego maksimum w pobliżu 9.5 eV. Przeprowadzono porównanie z dostępnymi wynikami dla innych związków zawierających grupę sulfonową.
-
Global defensive sets in graphs
PublicationIn 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...
-
CPLFD-GDPT5: High-resolution gridded daily precipitation and temperature data set for two largest Polish river basins
PublicationThe CHASE-PL (Climate change impact assessment for selected sectors in Poland) Forcing Data–Gridded Daily Precipitation & Temperature Dataset–5 km (CPLFD-GDPT5) consists of 1951–2013 daily minimum and maximum air temperatures and precipitation totals interpolated onto a 5 km grid based on daily meteorological observations from the Institute of Meteorology and Water Management (IMGW-PIB; Polish stations), Deutscher Wetterdienst...
-
Optymalizacja parametrów technologicznych przecinania ściernicowego w układzie rotacyjnym.
PublicationZaproponowano układ przecinania ściernicowego, który umozliwia zastosowanie optymalnych parametrów technologicznych w procesie przecinania. Sformułowano zagadnienie optymalizacji, w którym maksymalizuje się funkcję celu (powierzchniową wydajność względną) wyznaczając optymalne technologiczne parametry przecinania, zapewniające wysoką jakość powierzchni przecinanego przedmiotu i minimum zapotrzebowania mocy. Realizację procesu wykonuje...
-
Complexity Issues on of Secondary Domination Number
PublicationIn this paper we study the computational complexity issues of the problem of secondary domination (known also as (1, 2)-domination) in several graph classes. We also study the computational complexity of the problem of determining whether the domination and secondary domination numbers are equal. In particular, we study the influence of triangles and vertices of degree 1 on these numbers. Also, an optimal algorithm for finding...
-
Load-carrying capacity of axially loaded concrete-filled steel tubular columns made of thin tubes
PublicationAn experimental investigation was conducted on 30 CFST columns. An influence of the following factors on load-carrying capacity of the investigated columns was analyzed: the column slenderness (l1 = 42, l2 = 27 and l3 = 15), the tube thickness (the reinforcement ratio was equal to 4% or 6%), the way of applying the load to CFST columns (through the concrete core or through the entire cross-section), the bond strength between a...
-
Non-isolating 2-bondage in graphs
PublicationA 2-dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of V(G)D has 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. The non-isolating 2-bondage number of G, denoted by b_2'(G), is the minimum cardinality among all sets of edges E' subseteq E such that delta(G-E') >= 1 and gamma_2(G-E') > gamma_2(G)....
-
Non-isolating bondage in graphs
PublicationA 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')...
-
Efektywność filtracji przestrzennej sygnałów w przeciwdziałaniu spoofingowi GPS
PublicationPrzedstawiono metodę przeciwdziałania spoofingowi GPS poprzez formowanie minimum charakterystyki kierunkowej układu antenowego. Opisano metodykę i wyniki badań tłumienia sygnałów niepożądanych w obecności szumu. Zaprezentowano rezultaty statystycznej analizy wpływu filtracji przestrzennej na tłumienie prawdziwych sygnałów GPS. W podsumowaniu wykazano korzyści wynikające z użycia przyjętej metody, w...
-
Electrochemical capacitor temperature fluctuations during charging/discharging processes
PublicationThepaperpresentsaproposalofusingadditionalstatisticalparameterssuchas:standarddeviation,variance, maximum and minimum increases of the observed value that were determined during measurements of temperature fields created on the surface of the tested electrochemical capacitor. The measurements were carriedoutusingthermographicmethodsinordertosupportassessmentoftheconditionofelectrochemical capacitorunderclassicdurabilitytestsbasedonmethodsofdeterminationofcapacityandequivalentseries...
-
Distorsional analysis of I-section beam
PublicationAn elastic stiffness matrix was derived in the case of distortion of a restrained thin-walled I-section beam using the minimum total stationary elastic energy condition. The function describing the angle of distortion was adopted form the solution of differential equation in the case of restrained distortion. The example presented in the paper helps to assess the correctness of the proposed solution. The proposed elastic stiffness...
-
СИСТЕМА КОНТРОЛЯ СОСТОЯНИЯ ИЗОЛЯЦИИ ЭЛЕКТРОПРИВОДОВ В СЕТЯХ С ГЛУХОЗАЗЕМЛЕННОЙ НЕЙТРАЛЬЮ (System of insulation status monitoring for electric drives in networks with a dead-earth neutral)
PublicationПредложен метод контроля изоляции частотно-регулируемых электроприводов в сетях с глухозаземленной нейтралью. Система контроля изоляции включается в момент остановки электропривода. Ключи инвертора коммутируются по специальному закону, и с помощью сигнала трансформатора тока, который изме- ряет ток во всех трех фазах привода одновременно, определяется ток утечки. Рассмотрена схема датчика тока утечки и приведены экспериментальные...
-
Employee benefits in comparision to the personal payroll fund in 2017-2019 on given example
Open Research DataIn modern employee relations, employers offer employees a whole range of benefits, which usually are required by the relevant regulations on the part of the employer, which serve to create appropriate working conditions.
-
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...