Filtry
wszystkich: 409
Wyniki wyszukiwania dla: MINIMUM ENERGY
-
Gas selectivity enhancement by sampling-and-hold method in resistive gas sensors
PublikacjaCommercial resistive gas sensors exhibit various sensitivity to numerous gases when working at different elevated temperatures. That effect is due to a change in velocity of adsorption and desorption processes which can be modulated by temperature. Thus, to reach better selectivity of gas detection, we propose to apply a known method (called the sampling-and-hold method) of cooling down the gas sensor in the presence of the investigated...
-
Spectacular Oxygen Evolution Reaction Enhancement through Laser Processing of the Nickel‐Decorated Titania Nanotubes
PublikacjaThe selective, laser‐induced modification of the nickel‐decorated titania nanotubes provides remarkable enhancement toward oxygen evolution reaction. Particularly, the irradiation of the laterally spaced crystalline TiO2 nanotubes, results in the formation of the tight closure over irradiated end, preserving their hollow interior. The shape of the absorbance spectra is modulated along with applied energy, and the new absorption...
-
Experimental study on polymer mass used to repair damaged structures
PublikacjaA new method of repairing damaged structures by injecting the cracks with specially designed polymer mass (flexible two-component grout based on polyurethane resin) has been recently proposed. The technique is mainly dedicated to damaged masonries, especially historical structures where minimum intervention is permitted. The cracks are filled with the special injection, forming the flexible joints bonding the disrupted structural...
-
Spectacular Oxygen Evolution Reaction Enhancement Through Laser Processing of the Nickel-Decorated Titania Nanotubes
PublikacjaThe selective, laser-induced modification of the nickel-decorated titania nanotubes provides remarkable enhancement toward oxygen evolution reaction. Particularly, the irradiation of the laterally spaced crystalline TiO2 nanotubes, results in the formation of the tight closure over irradiated end, preserving their hollow interior. The shape of the absorbance spectra is modulated along with applied energy, and the new absorption...
-
Cutting model parameters from frame sawing of natural and impregnated Scots pine (Pinus sylvestris L.)
PublikacjaIn this paper, absolute and density normalized cutting model parameters of natural and impregnated Scots pine (Pinus sylvestris L.) are shown and a method for the calculation of their corresponding material properties in the principal material directions of wood is presented. The parameters were determined from measurements of cutting power on a sash gang saw, and are in detail the fracture toughness and the shear yield strength...
-
A dissimilar welded joint of grade 92 steel and AISI 304L steel obtained using IN82 buttering and IN617 fller: relationship of microstructure and mechanical properties
PublikacjaUnfavourable operating conditions of equipment in the energy industry resulting from high-temperature loads determine the need to use special materials and technological solutions, including welding procedures. In this article, buttering using IN82 (ERNiCr-3) consumables was proposed as a method to improve the weldability of grade 92 steel joined by the gas tungsten arc welding (GTAW) process with AISI 304L (IN617 fller). The...
-
Engineering TADF, Mechanochromism, and Second Harmonic Up- conversion Properties in Regioisomeric Substitution Space
PublikacjaThis research article explores the distinct TADF efficiency of three donor-acceptor based regio-isomers: DPAOCN (ortho- isomer), DPAMCN (meta-isomer), and DPAPCN (para-isomer). DPAPCN exhibits maximum TADF efficiency in both solution and solid-state with an impressive reverse inter-system crossing (RISC) rate of ~ 106 s-1; the underlying cause being the minimum singlet-triplet splitting energy or ∆EST and maximum SOC (spin-orbit...
-
Polymer based thick films - material quality and interface resistance evaluation
PublikacjaThe properties of polymer based thick film layers mede using different resistive pastes and dipping silvers have been studied. The composite of carbon and graphite (C/Gr) conducting particles suspended in different polymer vehicles were used for preparation resistive layers. Interface resistance Rc created between dipping silver (DiAg) contact layer and resistive layer was determined from the surface potential distribution measurements...
-
Corrosion Resistance and Surface Bioactivity of Ti6Al4V Alloy after Finish Turning under Ecological Cutting Conditions
PublikacjaThe influence of cooling conditions and surface topography after finish turning of Ti6Al4V titanium alloy on corrosion resistance and surface bioactivity was analyzed. The samples were machined under dry and minimum quantity lubrication (MQL) conditions to obtain different surface roughness. The surface topographies of the processed samples were assessed and measured using an optical profilometer. The produced samples were subjected...
-
Phosphorus removal by application of natural and semi-natural materials for possible recovery according to assumptions of circular economy and closed circuit of P
PublikacjaIn the last fewyears the idea of circular economy has become essential. Thus, designing methods of nutrients removal should be based on usingmaterials that make it possible to recover those nutrients. Recently,methods applied in wastewater treatment plants cannot provide optimal results; moreover, the application of commercial coagulants like ferric chloride and polyaluminumchloride can cause difficulties in potential recovery...
-
Understanding the Electronic Structure and Optical Properties of Vacancy-Ordered Double Perovskite A2BX6 for Optoelectronic Applications
PublikacjaOver the past few years, metal halide perovskite solar cells have made significant advances. Currently, the single-junction perovskite solar cells reach a conversion efficiency of 25.7%. Perovskite solar cells with a wide band gap can also be used as top absorber layers in multi-junction tandem solar cells. We examined the dynamical and thermal stability, electronic structure, and optical features of In2PtX 6 (X = Cl, Br, and I)...
-
Signature of Oxide-Ion Conduction in Alkaline-Earth-Metal-Doped Y3GaO6
PublikacjaWe have studied alkaline-earth-metal-doped Y3GaO6 as a new family of oxide-ion conductor. Solid solutions of Y3GaO6 and 2% −Ca2+-, −Sr2+-, and −Ba2+-doped Y3GaO6, i.e., Y(3−0.06)M0.06GaO6−δ (M = Ca2+, Sr2+, and Ba2+), were prepared via a conventional solid-state reaction route. X-ray Rietveld refined diffractograms of all the compositions showed the formation of an orthorhombic structure having the Cmc21 space group. Scanning electron...
-
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.
-
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ć...
-
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...
-
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...
-
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.
-
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...
-
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...
-
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.
-
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...
-
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...
-
Geometric working volume of a satellite positive displacement machine
PublikacjaThis 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...
-
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)....
-
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...
-
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}...
-
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.
-
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....
-
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...
-
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.
-
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...
-
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).
Publikacja"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
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...
-
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...
-
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...
-
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....
-
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...
-
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...