Wyszukiwarka
Wyniki wyszukiwania dla: MINIMUM RASAUERA-TOWNSENDA
-
On minimum cost edge searching
PublikacjaWe consider the problem of finding edge search strategies of minimum cost. The cost of a search strategy is the sum of searchers used in the clearing steps of the search. One of the natural questions is whether it is possible to find a search strategy that minimizes both the cost and the number of searchers used to clear a given graph G. We call such a strategy ideal. We prove, by an example, that ideal search strategies do not...
-
Reconfiguring Minimum Dominating Sets in Trees
PublikacjaWe provide tight bounds on the diameter of γ-graphs, which are reconfiguration graphs of the minimum dominating sets of a graph G. In particular, we prove that for any tree T of order n ≥ 3, the diameter of its γ-graph is at most n/2 in the single vertex replacement adjacency model, whereas in the slide adjacency model, it is at most 2(n − 1)/3. Our proof is constructive, leading to a simple linear-time algorithm for determining...
-
The high-energy critical minimum in elastic electron scattering by argon.
PublikacjaZostało zbadane położenie wysokoenergetycznego minimum krytycznego w rozpraszaniu elektronów na argonie. W celu przeprowadzenia dyskusji zachowania się czynnego przekroju różniczkowego w okolicy minimum krytycznego przeprowadzono analizę położenia minimum zarówno dla energii, jak i kątów.
-
Minimum order of graphs with given coloring parameters
PublikacjaA 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),...
-
Elastic electron scattering by argon in the vicinity of the high-energy critical minimum.
PublikacjaZostały obliczone różniczkowe przekroje czynne na sprężyste rozpraszanie elektronów na argonie. Przedział energetyczny rozpraszanych elektronów został tak dobrany, aby zbadać położenie tzw. minimum krytycznego.
-
Minimum drag shape bodies moving in inviscid fluid - revisited
PublikacjaThis paper presents the classic approach to minimum drag shape body problem, moving at hypersonic speeds, leading to famous power law shapes with value of the exponent of 3/4. Two- and three-dimensional cases are considered. Furthermore, an exact pseudo solution is given and its uselessness is discussed. Two new solutions are introduced, namely an approximate solution due to form of the functional and solution by means of optimisation...
-
A space-efficient algorithm for computing the minimum cycle mean in a directed graph
PublikacjaAn algorithm is introduced for computing the minimum cycle mean in a strongly connected directed graph with n vertices and m arcs that requires O(n) working space. This is a considerable improvement for sparse graphs in comparison to the classical algorithms that require O(n^2) working space. The time complexity of the algorithm is still O(nm). An implementation in C++ is made publicly available at http://www.pawelpilarczyk.com/cymealg/.
-
No-Wait & No-Idle Open Shop Minimum Makespan Scheduling with Bioperational Jobs
PublikacjaIn the open shop scheduling with bioperational jobs each job consists of two unit operations with a delay between the end of the first operation and the beginning of the second one. No-wait requirement enforces that the delay between operations is equal to 0. No-idle means that there is no idle time on any machine. We model this problem by the interval incidentor (1, 1)-coloring (IIR(1, 1)-coloring) of a graph with the minimum...
-
Objective selection of minimum acceptable mesh refinement for EMC simulations
PublikacjaOptimization of computational electromagnetics (CEM) simulation models can be costly in both time and computing resources. Mesh refinement is a key parameter in determining the number of unknowns to be processed. In turn, this controls the time and memory required for a simulation. Hence, it is important to use only a mesh that is good enough for the objectives of the simulation, whether for direct handling of high-fidelity EM...
-
The complexity of minimum-length path decompositions
PublikacjaWe consider a bi-criteria generalization of the pathwidth problem, where, for given integers k, l and a graph G, we ask whether there exists a path decomposition P of G such that the width of P is at most k and the number of bags in P, i.e., the length of P, is at most l. We provide a complete complexity classification of the problem in terms of k and l for general graphs. Contrary to the original pathwidth problem, which is fixed-parameter...
-
A framework estimating the minimum sample size and margin of error for maritime quantitative risk analysis
PublikacjaThe average accident frequency is essential for quantitative risk analysis and is conventionally estimated from accident statistics. This paper has systematically synthesised the knowledge on statistical errors and offered the missing instructions, a framework, for determining the minimum sample size and the margin of error (MOE) when calculating the average accident frequency from an accident database at hand. We have applied...
-
Subadditivity of the minimum output entropy and superactivation of the classical capacity of quantum multiple access channels
PublikacjaWe study subadditivity of the minimum output entropy (Hmin) of quantum multiple access channels (MACs). We provide an example of violation of the additivity theorem for Hmin known in classical information theory. Our result is based on a fundamental property of MACs, i.e., independence of each sender. The channels used in the example can be constructed explicitly. On the basis of subadditivity of Hmin we also provide an example...
-
Minimum vertex ranking spanning tree problem for chordal and proper interval graphs
PublikacjaW pracy rozważamy problem szukania, dla danego grafu prostego, drzewa spinającego, którego uporządkowana liczba chromatyczna jest minimalna. K.~Miyata i inni dowiedli w [Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem,Discrete Appl. Math. 154 (2006) 2402-2410], że odpowiedni problem decyzyjny jest NP-trudny już w przypadku pytania o istnienie uporządkowanego 4-pokolorowania....
-
Looking for a minimum exergy destruction in hierarchical cycle
PublikacjaThe paper presents results of energy analysis, complemented with an exergy balance, of hierarchical thermodynamic cycle. Proposed cycle is a binary vapour cycle based on a model of real supercritical steam power plant. Energy analysis is used to preliminary optimization of the cycle and the exergy losses analysis is proposed to perform optimization of heat transfer processes, which are essential for hierarchical cycles. Proposed...
-
A note on the strength and minimum color sum of bipartite graphs
PublikacjaSiłą grafu G nazywamy najmniejszą liczbę całkowitą s, taką że istniej pokolorowanie grafu G, o minimalnej sumie przy użyciu kolorów {1,...,s}. W pracy pokazano, że w grafach dwudzielnych stopnia D zachodzi oszacowanie s <= ceil(D/2) + 1. Z obserwacji tej wynika algorytm wielomianowy do obliczania siły i sumy chromatycznej w grafach dwudzielnych stopnia co najwyżej 4.
-
Power quality conditioners with minimum number of current sensor requirement
Publikacja -
Measures for interoperability of phenotypic data: minimum information requirements and formatting
Publikacja -
Comparing phylogenetic trees using a minimum weight perfect matching
PublikacjaA phylogenetic tree represents historical evolutionary relationshipbetween different species or organisms. There are various methods for reconstructing phylogenetic trees.Applying those techniques usually results in different treesfor the same input data. An important problem is to determinehow distant two trees reconstructed in such a wayare from each other. Comparing phylogenetic trees is alsouseful in mining phylogenetic information...
-
Verification of Formulas for Periods of Adjacent Buildings Used to Assess Minimum Separation Gap Preventing Structural Pounding during Earthquakes
PublikacjaInsufficient separation distance between adjacent buildings may lead to serious damages during earthquakes due to structural pounding. The best way to prevent collisions is to provide sufficiently large separation distance between the structures. In this paper, the periods of two closely-spaced linear and nonlinear buildings have been investigated so as to accurately assess the minimum in-between separation gap. A new equation...
-
Metrological analysis of surface quality aspects in minimum quantity cooling lubrication
Publikacja -
Using Minimum Actuators to Control Shape and Stress of a Double Layer Spherical Model Under Gravity and Lateral Loadings
PublikacjaSpherical domes are picturesque structures built in developed countries to attract tourists. Due to horizontal and vertical overloading, the structures’ attractive shapes may be disturbed, and some members' stress may exceed the elastic level. In this paper, the shape and stress of a deformed double-layer spherical numerical model due to simultaneous lateral and vertical loadings are controlled, meanwhile, the number of actuators...
-
A collection of directed graphs for the minimum cycle mean weight computation
Dane BadawczeThis dataset contains definitions of the 16 directed graphs with weighted edges that were described in the following paper: Paweł Pilarczyk, A space-efficient algorithm for computing the minimum cycle mean in a directed graph, Journal of Mathematics and Computer Science, 20 (2020), no. 4, 349--355, DOI: 10.22436/jmcs.020.04.08, URL: http://dx.doi.org/10.22436/jmcs.020.04.08 These...
-
Minimum Information about T Regulatory Cells: A Step toward Reproducibility and Standardization
Publikacja -
Determination of the minimum inhibitory concentration of C-1305 derivatives (IKE1-IKE8) against Candida strains
Dane BadawczeThe datasets contain the results of determining the minimum inhibitory concentration of acridone derivatives against C. albicans ATCC 10231, C. glabrata ATCC 90030, C. krusei ATCC 6258 and C. parapsilosis ATCC 22019 by the modified M27-A3 specified by the CLSI.
-
Determination of the minimum inhibitory concentration of C-1330 derivatives (IKE9-IKE14) against Candida strains
Dane BadawczeThe datasets contain the results of determining the minimum inhibitory concentration of C-1330 derivatives (IKE9-IKE14) against C. albicans ATCC 10231, C. glabrata ATCC 90030, C. krusei ATCC 6258 and C. parapsilosis ATCC 22019 by the modified M27-A3 specified by the CLSI.
-
Determination of the minimum inhibitory concentration of new bisacridines IKE15-19 and IKE21, against yeast strains
Dane BadawczeThe datasets contain the results of determining the minimum inhibitory concentration of new bisacridines against C. albicans ATCC 10231, C. glabrata ATCC 90030, C. krusei ATCC 6258 and C. parapsilosis ATCC 22019, S. cerevisiae ATCC 9763 and fluconazole resistant C. albicans strains by the modified M27-A3 specified by the CLSI.
-
Structural and Microhardness Changes After Turning of the AISI 1045 Steel for Minimum Quantity Cooling Lubrication
Publikacja -
Minimum mean square error estimation of speech short-term predictor parameters under noisy conditions
Publikacja -
Examining Impact of Speed Recommendation Algorithm Operating in Autonomous Road Signs on Minimum Distance between Vehicles
PublikacjaAn approach to a new kind of recommendation system design that suggests safe speed on the road is presented. Real data obtained on roads were used for the simulations. As part of a project related to autonomous road sign development, a number of measurements were carried out on both local roads and expressways. A speed recommendation model was created based on gathered traffic data employing the traffic simulator. Depending on...
-
Estimation of Minimum Uncut Chip Thickness during Precision and Micro-Machining Processes of Various Materials—A Critical Review
Publikacja -
Determination of the MIC (minimum inhibitory concentration) of new bisacridines IKE16-19, IKE21 and IE10 against C. glabrata clinical strains
Dane BadawczeThe datasets contain the results of determining the MIC value (minimum inhibitory concentration) of new bisacridines IKE16-19, IKE21 and IE10 against Candida glabrata clinical strains CZD 310, 373, 377, 513 and collection strain DSM 11226 by the modified M27-A3 specified by the CLSI.
-
The study on minimum uncut chip thickness and cutting forces during laser-assisted turning of WC/NiCr clad layers
Publikacja -
Determination of the minimum inhibitory concentration of C-1311 derivatives (C-1296, C-1410, Compound 1, Compound 1-R8) against Candida strains
Dane BadawczeThe datasets contain the results of determining the minimum inhibitory concentration of imidazoacridinone derivatives against C. albicans ATCC 10231, C. glabrata ATCC 90030, C. krusei ATCC 6258 and C. parapsilosis ATCC 22019 and C. albicans clinical strains by the modified M27-A3 specified by the CLSI.
-
The Influence of the Application of EP Additive in the Minimum Quantity Cooling Lubrication Method on the Tool Wear and Surface Roughness in the Process of Turning 316L Steel
Publikacja -
A dressing of zero-range potentials and electron-molecule scattering problem at low energies
PublikacjaTechnika ''ubierania'' jest używana do poprawy modelu potencjału zerowego promienia (ZRP). Rozważamy przekształcenia Darboux zaczynające się od ZRP, wynik ''ubierania'' daje potencjał z niezerowym promieniem, który zależy od parametrów rozwiązania.
-
Electron scattering on N2O - from cross section to diffusion coefficients.
PublikacjaW pracy przedstawiono wyniki pomiarów współczynników transportu: stosunek współczynnika dyfuzji w kierunku prostopadłym do pola elektrycznego do ruchliwości, stosunek współczynnika dyfuzji podłużnej do ruchliwości oraz prędkość dryfu elektronów w funkcji zredukowanego pola elektrycznego. Współczynniki zmierzono metodą Townsenda-Huxley´a a prędkość dryfu otrzymano wykorzystując metodę Bradbury - Nielsena. Zmierzone współczynniki...
-
Energy Security of Polish Consumers in 2004-2021
Dane BadawczeEnergy security is one of the most important components of economic security. It is influenced not only by access to energy sources and the economic situation of the state and the individual consumer. In the years 2004–2021, energy security of the individual consumer in the economic dimension significantly improved. This was due to several factors:1....
-
ANALYSIS OF CLIMATIC ZONES IN POLAND WITH REGARD TO ASPHALT PERFORMANCE GRADING
PublikacjaTowards the end of the last century a new system of bitumen grading was developed and implemented as part of the American Strategic Highway Research Program (SHRP). Its aim was to better adjust the testing methods and requirements for road bitumens to the actual conditions in which those bitumens serve in road pavements. Currently in Poland, similarly as in the other EU countries, road bitumens are tested and classified with regard...
-
2-outer-independent domination in graphs
PublikacjaWe 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,...
-
Total chromatic sum for trees
PublikacjaThe total chromatic sum of a graph is the minimum sum of colors (natural numbers) taken over all proper colorings of vertices and edges of a graph. We provide infinite families of trees for which the minimum number of colors to achieve the total chromatic sum is equal to the total chromatic number. We construct infinite families of trees for which these numbers are not equal, disproving the conjecture from 2012.
-
A model of liquid film breakdown formed due to impingement of a two-phase jet on a horizontal surface
PublikacjaThe present work aims to provide an explanation to the phenomenon of breakdown of the thin liquid film created by impinging two-phase, liquid-gas jet. Existing in the literature models describe merely thebreakdown of single phase liquid films. The model presented here is based on examination of mass and energy equations under the applied criterion of the minimum of total energy. That allows to determinethe minimum thickness of...
-
Wpływ nagniatania ślizgowego na chropowatość zewnętrznych powierzchni obrotowych w częściach maszyn
PublikacjaPodano wyniki badań technologicznych nagniatania ślizgowego wałków ze stali C45.Obróbkę przeprowadzono na tokarce CNC z użyciem nagniataka z tensometrycznym pomiarem siły docisku.Zamieszczono wytyczne dla doboru parametrów obróbki według kryterium wymaganej chropowatości powierzchni obrobianej.
-
Experimental research on water lubricated three layer sliding bearing with lubrication grooves in the upper part of the bush and its comparison with a rubber bearing
Publikacjacomposite. Eachofitslayershasanimportantfunction.Speciallypreparedslidingsurfaceensures minimum resistance.Followingrunning-initssmoothnessbecomesveryhighandthebearingmay continue workingunder fluid lubricationregime.NBRlayerensuresbearingelasticity,goodvibration damping propertiesandinsusceptibilitytoshaftaxismisalignment.Theexternalbrasslayermakes fitting thebearingeasier. Experiment resultsoftheconductedresearchwerecomparedwiththoseforarubberbearingof similar...
-
Sposób segmentacji przebiegu losowego, złożonego z szumu białego i impulsów prostokątnych o stałych amplitudach oraz przypadkowych czasach trwania i przerw
PublikacjaPodano sposób segmentacji sygnału losowego o składowej stacjonarnej będącej szumem białym oraz niestacjonarnej w formie impulsów prostokątnych o stałych amplitudach oraz przypadkowych czasach trwania i przerw. Obserwowany sygnał jest dzielony na N segmentów, w których składowa niestacjonarna, impulsowa posiada ustaloną amplitudę. Momenty czasu, w których zaczynają się i kończą kolejne segmenty określono przez wyznaczenie minimum...
-
Paired domination versus domination and packing number in graphs
PublikacjaGiven a graph G = (V(G), E(G)), the size of a minimum dominating set, minimum paired dominating set, and a minimum total dominating set of a graph G are denoted by γ (G), γpr(G), and γt(G), respectively. For a positive integer k, a k-packing in G is a set S ⊆ V(G) such that for every pair of distinct vertices u and v in S, the distance between u and v is at least k + 1. The k-packing number is the order of a largest kpacking and...
-
Drawing maps with advice
PublikacjaW pracy podejmujemy temat konstrukcji algorytmu dla agenta, który zostaje umieszczony w dowolnym wierzchołku grafu (wierzchołki są nierozróżnialne, krawędzie mają etykiety portów), po czym realizuje algorytm zmierzający do znalezienia drzewa spinającego grafu lub izomorficznej kopii grafu. Dla obu problemów podajemy asymptotycznie dokładne lub prawie dokładne oszacowania na ilość bitów dodatkowej informacji, którą agent musi otrzymać...
-
Mechanizacja napraw głównych dróg szynowych
PublikacjaSzybki rozwój techniki i znaczący wzrost kosztów pracy wymusza na wykonawcach robót ograniczenie do niezbędnego minimum liczby robotników, i w to miejsce wprowadzenie nowoczesnych, bardzo wydajnych maszyn, które skrócą czas wykonania napraw.Drugą zasadniczą przyczyną wprowadzenia nowoczesnych maszyn jest skrócenie do niezbędnego minimum czasu zamknięcia toru, co ogranicza utrudnienia w prowadzeniu ruchu pociągów, a dodatkowo...
-
Mechanizacja napraw głównych podtorza i nawierzchni szynowych
PublikacjaSzybki rozwój techniki i znaczący wzrost kosztów pracy wymusza na wykonawcach robót ograniczenie do niezbędnego minimum liczby robotników, i wto miejsce wprowadzenie nowoczesnych, bardzo wydajnych maszyn, które skracają czas wykonania naprawy. Druga zasadniczą przyczyną wprowadzenia nowoczesnych maszyn jest ograniczenie do niezbędnego minimum czasu zamknięcia torów, co zmniejsza utrudnienia w prowadzeniu ruchu pociągów, a ponadto...
-
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...
-
Properties of the triset metric for phylogenetic trees
Publikacjathe 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.
-
Weakly convex domination subdivision number of a graph
PublikacjaA 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...
-
Unicyclic graphs with equal total and total outer-connected domination numbers
PublikacjaLet 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...
-
Critical minima in elastic scattering of electrons from Ar and Zn.
PublikacjaDokonano 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
Kursy OnlinePrzedstawienie 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
PublikacjaThis 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...
-
Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs
PublikacjaGiven 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...
-
On extremal sizes of locally k-tree graphs
PublikacjaA 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...
-
Three-objective antenna optimization by means of kriging surrogates and domain segmentation
PublikacjaIn 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...
-
Isolation Number versus Domination Number of Trees
PublikacjaIf 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)....
-
Weakly convex and convex domination numbers of some products of graphs
PublikacjaIf $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}...
-
Results of experimental research of hydraulic satellite motor
Dane BadawczeThe 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
Publikacjathe 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.
-
On trees with double domination number equal to 2-outer-independent domination number plus one
PublikacjaA 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...
-
Domination subdivision and domination multisubdivision numbers of graphs
PublikacjaThe 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...
-
Paired domination subdivision and multisubdivision numbers of graphs
PublikacjaThe 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...
-
Selection of Electrode Material for Inconel 617/P92 Steel SMAW Dissimilar Welds
PublikacjaThe 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....
-
NUTRITECH I – spotkanie informacyjne
WydarzeniaInformacje podstawowe, finansowe i o generatorze wniosków. Podstawowe informacje o przeprowadzeniu oceny.
-
THE PROBLEM OF THE CALCULATION OF THE FREQUENCY OF DIAGNOSTIC EXAMINATIONS BASED ON DEVICE’S PROPER OPERATION TIME
PublikacjaThe 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.
-
Wysokociśnieniowe uszczelnienia ruchu obrotowego wału hydraulicznych maszyn wyporowych
PublikacjaW 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.
-
VAT rates in particular member states of the European Union in 2015
Dane BadawczeUnder 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
PublikacjaCost-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
PublikacjaPrzedstawiono 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ć...
-
2-bondage in graphs
PublikacjaA 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
PublikacjaIn 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
PublikacjaLet 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
PublikacjaA 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
-
On the double bondage in graphs
PublikacjaA 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...
-
On the size of identifying codes in triangle-free graphs
PublikacjaIn 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
PublikacjaIn 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...
-
The convex domination subdivision number of a graph
PublikacjaLet 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...
-
Topological modifications for performance improvement and size reduction of wideband antenna structures
PublikacjaCompact 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....
-
Disaster-Resilient Routing Schemes for Regional Failures
PublikacjaLarge-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...
-
Evaluation of the Influence of Farming Practices and Land Use on Groundwater Resources in a Coastal Multi-Aquifer System in Puck Region (Northern Poland)
PublikacjaThis 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...
-
Electron collision with sulfuryl chloride (SO2Cl2) molecule
PublikacjaStosują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ą.
-
CPLFD-GDPT5: High-resolution gridded daily precipitation and temperature data set for two largest Polish river basins
PublikacjaThe 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...
-
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...
-
Optymalizacja parametrów technologicznych przecinania ściernicowego w układzie rotacyjnym.
PublikacjaZaproponowano 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
PublikacjaIn 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...
-
Non-isolating 2-bondage in graphs
PublikacjaA 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)....
-
Load-carrying capacity of axially loaded concrete-filled steel tubular columns made of thin tubes
PublikacjaAn 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 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')...
-
Efektywność filtracji przestrzennej sygnałów w przeciwdziałaniu spoofingowi GPS
PublikacjaPrzedstawiono 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
PublikacjaThepaperpresentsaproposalofusingadditionalstatisticalparameterssuchas: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
PublikacjaAn 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...
-
Employee benefits in comparision to the personal payroll fund in 2017-2019 on given example
Dane BadawczeIn 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.
-
Innovative Turbine Intake Air Cooling Systems and Their Rational Designing
PublikacjaThe improved methodology of the engine intake air cooling system designing based on the annual effect due to cooling was developed. It involves determining the optimal value of cooling capacity, providing the minimum system sizes at maximum rate of annual effect increment, and its rational value, providing a close to maximum annual effect without system oversizing at the second maximum rate of annual effect increment within the...
-
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...
-
СИСТЕМА КОНТРОЛЯ СОСТОЯНИЯ ИЗОЛЯЦИИ ЭЛЕКТРОПРИВОДОВ В СЕТЯХ С ГЛУХОЗАЗЕМЛЕННОЙ НЕЙТРАЛЬЮ (System of insulation status monitoring for electric drives in networks with a dead-earth neutral)
PublikacjaПредложен метод контроля изоляции частотно-регулируемых электроприводов в сетях с глухозаземленной нейтралью. Система контроля изоляции включается в момент остановки электропривода. Ключи инвертора коммутируются по специальному закону, и с помощью сигнала трансформатора тока, который изме- ряет ток во всех трех фазах привода одновременно, определяется ток утечки. Рассмотрена схема датчика тока утечки и приведены экспериментальные...
-
The concept of anti-collision system of autonomous surface vehicle
PublikacjaThe use of unmanned vehicles in various fields of science and the economy is becoming more common. An extremely important aspect of creating this type of solution is to provide autonomous vehicle navigation, which does not require interference of the human factor or in which it is limited to a minimum. This article discusses the concept of autonomous anti-collision system of unmanned surface vehicle. It proposed a sensor system...
-
Tight bounds on global edge and complete alliances in trees
PublikacjaIn the talk the authors present some tight upper bounds on global edge alliance number and global complete alliance number of trees. Moreover, we present our NP-completeness results from [8] for global edge alliances and global complete alliances on subcubic bipartite graphs without pendant vertices. We discuss also polynomial time exact algorithms for finding the minimum global edge alliance on trees [7] and complete alliance...