Filtry
wszystkich: 969
wybranych: 496
-
Katalog
Filtry wybranego katalogu
Wyniki wyszukiwania dla: ETERY KORONOWE
-
Badania modelowe nośności i osiadania fundamentów bezpośrednich posadowionych na zboczu z gruntu zbrojonego.
PublikacjaFUNDAMENTY BEZPOŚREDNIE. ZBOCZA Z GRUNTU ZBROJONEGO. NOŚNOŚĆ. OSIADANIE. Scharakteryzowano stanowiska badawcze, zastosowane rodzaje gruntów i zbrojenia oraz metodykę badań modelowych fundamentów bezpośrednich posadowionych na koronie zboczy z gruntu zbrojonego. Przeanalizowano jakościowe i ilościowe wyniki badań modelowych. Przedstawiono zalecenia praktyczne dotyczące ilości i rozmieszczenia zbrojenia w zboczu. Określono współczynniki...
-
Definition gleichartiger Dokumententypen zur Verbesserung der Erkennbarkeit und ihre XML-Beschreibung
PublikacjaPrzedstawiono krokowe podejście do projektowania interaktywnych, elektronicznych dokumentów z ich analogowej postaci. Postać analogowa rozumiana jest jako typowa kartka papieru, natomiast jako interaktywny, elektroniczny dokument rozumiemy dokument zdefiniowany w formacie XML przystępnym do przetwarzania przez dowolną przeglądarkę internetową. Wprowadza się pojęcie - cyklu życia dokumentu cyfrowego - składającego się z faz zawierających...
-
Weryfikacja autentyczności kolorów na zdjęciach wykonanych w technice analogowej
PublikacjaW artykule opisano zagadnienie odróżniania historycznych fotografii pomiędzy oryginalnie kolorowe a koloryzowane. Rozważono problem doboru zdjęć pod względem technologii, w jakiej zostały wykonane. Następnie wykorzystując sieci neuronowe już w części wyuczone na innych zbiorach danych, sprawdzono ich efektywność w rozwiązywaniu badanego problemu. Rozważono wpływ rozmiaru obrazu podanego na wejściu, architektury zastosowanej sieci,...
-
Revalorisation of Modernist and Social Modernist Interiors in Gdynia
PublikacjaIn the 1920s and 1930s, elaborate designing of prestigious interiors of public buildings, shops or tenement houses was important challenge for every architect who respected theri work. Apart from creating, at the design decor, the designers usually made sure that their concept was executed in every single detail. Only an overall aestetic solution could form a complete picture of a unique pieceod architecture.
-
Selective transport of Pb(II) across polymer inclusion membrane using imidazole azocrown ethers as carriers.
PublikacjaZbadano selektywność transportu jonów ołowiu(II) z równomolowych roztworów jonów Zn(II), Cd(II) i Pb(II) przez polimerowe membrany inkluzyjne (PIM) zawierające imidazolowe etery azokoronowe.Wykazano, że polimerowe membrany inkluzyjne z imidazolowymi azokoronami wykazują dużą stabilność, zależną w dużym stopniu od rodzaju jonoforu.
-
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}...
-
DSC and thermal stability investigation of novel poly(ester-ether) glycolsand poly(ester-ether)urethanes.
PublikacjaOtrzymano serie nowych poli(estro-etero)dioli z kwasu adypinowgo.........
-
Kierunki rozwoju inteligentnych systemów produkcyjnych
PublikacjaNiniejszy rozdział jest konsekwentnym rozwinieciem wybranych wniosków pracy [8]. W szczególności nadal aktualne pozostaje twierdzenie, że projektowanie Elastycznych Systemów Sterowania Produkcją nalezy do kręgu podstawowych kierunków prac badawczych o istotnym znaczeniu w nauce o inzynierii i zarządzania produkcją. Zatem po charakteryzowaniu trendów interpretacji elastyczności systemów produkcyjnych przystąpiono do analizy jej...
-
On trees with equal domination and total outer-independent domination numbers
PublikacjaFor a graph G=(V,E), a subset D subseteq V(G) is a dominating set if every vertex of V(G)D has a neighbor in D, while it is a total outer-independent dominating set if every vertex of G has a neighbor in D, and the set V(G)D is independent. The domination (total outer-independent domination, respectively) number of G is the minimum cardinality of a dominating (total outer-independent dominating, respectively) set of G. We characterize...
-
A lower bound on the total outer-independent domination number of a tree
PublikacjaA total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_t^{oi}(T) >= (2n-2l+2)/3,...
-
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...
-
Bounds on the vertex-edge domination number of a tree
PublikacjaA vertex-edge dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every edge of $G$ is incident with a vertex of $D$ or a vertex adjacent to a vertex of $D$. The vertex-edge domination number of a graph $G$, denoted by $\gamma_{ve}(T)$, is the minimum cardinality of a vertex-edge dominating set of $G$. We prove that for every tree $T$ of order $n \ge 3$ with $l$ leaves and $s$ support vertices we have $(n-l-s+3)/4...
-
An upper bound on the 2-outer-independent domination number of a tree
PublikacjaA 2-outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)D has a at least two neighbors in D, and the set V(G)D is independent. The 2-outer-independent domination number of a graph G, denoted by gamma_2^{oi}(G), is the minimum cardinality of a 2-outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_2^{oi}(T) <= (n+l)/2,...
-
On trees with double domination number equal to 2-domination number plus one
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A subset D subseteq V(G) is a 2-dominating set of G if every vertex of V(G)D is dominated by at least two vertices of D, while it is a double dominating set of G if every vertex of G is dominated by at least two vertices of D. The 2-domination (double domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (double dominating,...
-
On trees with double domination number equal to total domination number plus one
PublikacjaA total dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D. A vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The total (double, respectively) domination number of a graph G is the minimum cardinality of a total (double,...
-
Ochronić ląd.
PublikacjaArtykuł poświęcony jest metodom ochrony brzegów morskich. W pierwszej jego części omówiono przyczyny powodujące, że prawie 80% polskiego brzegu cofa się, przy czym tempo cofania się stopniowo rośnie. Opisano zalety i wady stosowanych w świecie metod ochrony brzegów wraz z uwzględnieniem współczesnych zaleceń projektowania ochrony brzegu, tj. możliwie jak najmniejszej ingerencji w środowisko naturalne. Na koniec w pracy pokazano,...
-
On the ratio between 2-domination and total outer-independent domination numbers of trees
PublikacjaA 2-dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)D has a at least two neighbors in D. A total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The 2-domination (total outer-independent domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (total...
-
An upper bound on the total outer-independent domination number of a tree
PublikacjaA total outer-independent dominating set of a graph G=(V(G),E(G)) is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every tree T of order n >= 4, with l leaves and s support vertices we have...
-
Limits Theorems for Random Walks on Homeo(S1)
PublikacjaThe central limit theorem and law of the iterated logarithm for Markov chains corresponding to random walks on the space Homeo(S1) of circle homeomorphisms for centered Lipschitz functions and every starting point are proved.
-
Developing students' spatial skills and teaching the history of architecture through structural drawing
PublikacjaThe method of “structural drawing" is used in teaching history of architecture in the Architectural Faculty of Gdańsk University of Technology. It is addressed to students of the first semester of study – so to the architectural beginners. There are three main goals of the structural drawing method used in that educational course: (1) developing the students’ spatial skills; (2) training architectural drawing ability; (3) teaching...
-
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')...
-
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)....
-
An upper bound for the double outer-independent domination number of a tree
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)\D is independent. The double outer-independent domination number of a graph G, denoted by γ_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We prove...
-
Multidimensional Monitoring System of State Machines
PublikacjaTechnical systems are more complex every day as their electronics and mechanics. Technical advances tend to be autonomous in its performance and perform an auto-diagnosis that allows determining an abnormality existence in a component or subsystem and deciding if the system has to be stopped or not.
-
Updating the Coupling Algorithm between HYDRUS and MODFLOW in the HYDRUS Package for MODFLOW
PublikacjaThe HYDRUS-based flow package for MODFLOW (the HPM or the HYDRUS package) is an existing unsaturated zone flow package for MODFLOW. In MODFLOW with the HPM, the groundwater modeling domain is discretized into regular grids that can be combined into multiple zones based on similarities in soil hydrology, topographical characteristics, and the depth to the groundwater. Each of these zones is assigned one unsaturated soil profile...
-
Comparative analysis of balancing of V6 engines with common- and split-pin crankshafts
PublikacjaAn analysis of balancing of V6 engines equipped with split-pin crankshafts with any cylinder bank angle based on the mathematical relations derived in the paper was carried out. A comparison of the quality of their balancing with engines equipped with common-pin crankshafts was also carried out. The bank angle ranges beneficial for balancing of moments of inertia forces in reciprocating motion were determined. A mathematical relation...
-
Graphs with equal domination and certified domination numbers
PublikacjaA setDof vertices of a graphG= (VG,EG) is a dominating set ofGif every vertexinVG−Dis adjacent to at least one vertex inD. The domination number (upper dominationnumber, respectively) ofG, denoted byγ(G) (Γ(G), respectively), is the cardinality ofa smallest (largest minimal, respectively) dominating set ofG. A subsetD⊆VGis calleda certified dominating set ofGifDis a dominating set ofGand every vertex inDhas eitherzero...
-
Once in a season – the pragmatic function of fuck in “BoJack Horseman” TV Show
PublikacjaThis article investigates the use and pragmatic functions of the swear word fuck in the “BoJack Horseman” produced by Netflix and bridges the gap in the linguistic research on this particular TVshow. Incorporating corpus linguistics tools, the BoJack Horseman Corpus was compiled and thelemma fuck has been investigated and analysed from the multimodal perspective....
-
A lower bound on the double outer-independent domination number of a tree
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)D is independent. The double outer-independent domination number of a graph G, denoted by gamma_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We...
-
An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree
PublikacjaWe provide an algorithm for listing all minimal 2-dominating sets of a tree of order n in time O(1.3248n) . This implies that every tree has at most 1.3248 n minimal 2-dominating sets. We also show that this bound is tigh.
-
Minimal 2-dominating sets in Trees
PublikacjaWe provide an algorithm for listing all minimal 2-dominating sets of a tree of order n in time O(1.3247^n). This leads to that every tree has at most 1.3247^n minimal 2-dominating sets. We also show that thisbound is tight.
-
Minimal double dominating sets in trees
PublikacjaWe provide an algorithm for listing all minimal double dominating sets of a tree of order $n$ in time $\mathcal{O}(1.3248^n)$. This implies that every tree has at most $1.3248^n$ minimal double dominating sets. We also show that this bound is tight.
-
An algorithm for listing all minimal double dominating sets of a tree
PublikacjaWe provide an algorithm for listing all minimal double dominating sets of a tree of order $n$ in time $\mathcal{O}(1.3248^n)$. This implies that every tree has at most $1.3248^n$ minimal double dominating sets. We also show that this bound is tight.
-
EVALUATION OF THE SEMIVARIOGRAM SELECTION ON THE KRIGING INTERPOLATION
PublikacjaThe aim of the paper is to present the possibilities of geostatistical interpolation kriging method using in the process of generating digital terrain models (DTM). The source of data is a direct measurements realized with a precision GNSS positioning kinematic measurement technique RTN. Kriging algorithm was analysed, especially in the meaning of a semivariogram every step. Theoretical semivariogram selection influence on the...
-
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...
-
Total Domination Versus Domination in Cubic Graphs
PublikacjaA dominating set in a graph G is a set S of vertices of G such that every vertex not in S has a neighbor in S. Further, if every vertex of G has a neighbor in S, then S is a total dominating set of G. The domination number,γ(G), and total domination number, γ_t(G), are the minimum cardinalities of a dominating set and total dominating set, respectively, in G. The upper domination number, \Gamma(G), and the upper total domination...
-
Modyfikacja właściwości fizykochemicznych triacylogliceroli na drodze enzymatycznego przeestryfikowania.
PublikacjaPrzeestryfikowano mieszaniny oleju rzepakowego i łoju wołowego (4:6w/w). Katalizatorami reakcji były immobilizowane enzymy lipolityczne: Lipozyme RM IM, Lipozyme TL IM oraz Novozym 435 (Novo Nordisk). Produkty reakcji rozdzielano przy pomocy chromatografii kolumnowej. Triacyloglicerole (TAG) eluowano mieszaniną eteru naftowego i eteru dietylowego(87:13). W otrzymanych produktach oraz w wyizolowanych z nich TAG oznaczano temperaturę...
-
Preferences and Transport Behavior of Gdansk Residents in the Light of the Result of Complex Traffic Survey
PublikacjaPreferences and transport behavior of the population are a fundamental aspect of research in public transport. Identifying the basic postulates of transport, the factors determining the specific behavior of transport and modal split allow to analyze the differences between the groups singled passengers and to prepare better offer of an urban transport. In Poland, still in many cities urban transport research is conducted ad hoc,...
-
Consequences of suboptimal design of Building Integrated Photovoltaic Installation – a case study for Gdansk, Poland
PublikacjaThe carried out analysis concerns 2 kWp building integrated photovoltaic installation (BIPV) at the Chemistry Faculty of Gdansk University of Technology. It was proven that the generated energy data for every month diverge significantly from the expected vales. It is corelated with suboptimal orientation of the installation itself, as well as with the tilt angle varying from optimal.
-
Wpływ glikoli i styrenu na właściwości nienasyconych poli(estro-eterouretanów)
PublikacjaW pracy przedstawiono wyniki badań dotyczące syntezy i właściwości poli(estro-eterouretanów) otrzymywanych z nienasyconych prepolimerów uretanowych, uzyskanych z oligo(alkilenoestro-etero)dioli, syntetyzowanych z użyciem dwóch różnych glikoli oraz diizocyjanianu 4,4'-difenylometanu i poddawanych reakcji sieciowania ze styrenem.
-
Badania nowego czujnika wilgotności z filmem polimerowym
PublikacjaW pracy przedstawione zostały wyniki pomiarów widm impedancji czujników wilgotności z epoksydowymi filmami polimerowymi, zawierającymi czułe na wilgoć czwartorzędowe sole amoniowe. Filmy spreparowano z polietylenoiminy (PEI), usieciowanej przy pomocy eteru diglicydylowego 1,4-butanodiolu (BDDGE) z dodatkiem chlorku trójmetyloamoniowoglicydylowego (GTMAC).
-
Occurrence and Determination of Volatile Fatty Acids in Wastewater of Different Origin
PublikacjaOpracowano metodykę oznaczania krótkołańcuchowych alifatycznych kwasów monokarboksylowych w ściekach rożnego pochodzenia stosując ekstrakcję za pomocą eteru metylo-tert-butylowego na etapie przygotowania próbek i chromatografię gazową z kolumną kapilarną Stabilwax-DA i Rtx-624, natomiast na etapie detekcji stosowano spektrometr mas.
-
Gossiping by energy-constrained mobile agents in tree networks
PublikacjaEvery node of an edge-weighted tree network contains a data packet. At some nodes are placed mobile agents, each one possessing an amount of energy (not necessarily the same for all agents). While walking along the network, the agents spend the energy proportionally to the distance traveled and collect copies of the data packets present at the visited network nodes. An agent visiting a node deposits there copies of all currently...
-
The moonuments of gdynia post-war construction pace
PublikacjaThe impresive pace of building objects realisation in the 1950s and 1960s was a continuation of the traditional gdynia building pace of the pre-war period. A particular attention and admiration must the reserved for the use at almost every construction site in Gdynia of a considerable quantify of prototypical meterial/construction solutions implemented above all in order to simplify technology and accelerate the pace of building...
-
Control of mass concentration of reagents by sound in a gas with nonequilibrium chemical reactions
PublikacjaThe weakly nonlinear dynamics of a chemically reacting gas is studied. Nonlinear interaction of acoustic and nonacoustic types of motion are considered. We decompose the base equations using the relationships of the gas-dynamic perturbations specific for every type of motion. The governing equation for the mass fraction of a reagent influenced by dominating sound is derived and discussed. The conclusions concern the equilibrium...
-
THE FUNCTION OF GREENERY IN A SKYSCRAPER: THE PLACEMENT AND ITS INFLUENCE
PublikacjaThe contrast between the high rise buildings; with their mostly geometric shapes, and the organic form of the greenery was visible even in the idea of a skyscraper. Yet the realizations and recent projects show emerging interest and the link between them. To better understand the developing function of the greenery in the context of a skyscraper, both literature and case studies are conducted. The aim is to relate the location...
-
GC-FID determination of C2-C4 aliphatic monocarboxylic acids in aqueous samples preceded by solvent extraction
PublikacjaEkstrakcja za pomocą eteru metylo-tert-butylowego (MTBE) została wykorzystana do izolacji krótkołańcuchowych alkanowych kwasów monokarboksylowych (2-4 atomy węgla w cząsteczce) z próbek o matrycy wodnej. Całkowita wydajność dwukrotnej ekstrakcji z próbek wodnych kwasów: octowego, propionowego i masłowego wynosiła odpowiednio ok. 55% , ok. 90% i ponad 90%. Wydajności ekstrakcji są porównywalne z wartościami uzyskiwanymi w przypadku...
-
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...
-
The effect of the motor filters on earth fault current waveform in circuits with variable speed drives
PublikacjaIn circuits with variable speed drives distorted earth fault current flows. Earth fault current distortion influences the threshold of ventricular fibrillation. This paper presents earth fault current distortion in circuits with variable speed drives when motor filter is used. Two types of motor filter are analyzed. For every type of filter the effect of earth fault current distortion on ventricular fibrillation is evaluated.
-
The effect of the motor filters on earth fault current waveform in circuits with variable speed drives
PublikacjaIn circuits with variable speed drives distorted earth fault current flows. Earth fault current distortion influences the threshold of ventricular fibrillation. This paper presents earth fault current distortion in circuits with variable speed drives when motor filter is used. Two types of motor filter are analyzed. For every type of filter the effect of earth fault current distortion on ventricular fibrillation is evaluated.