Filters
total: 33145
filtered: 11016
-
Catalog
- Publications 11016 available results
- Journals 190 available results
- Conferences 10 available results
- Publishing Houses 85 available results
- People 275 available results
- Inventions 26 available results
- Projects 69 available results
- Laboratories 9 available results
- Research Teams 21 available results
- Research Equipment 2 available results
- e-Learning Courses 673 available results
- Events 83 available results
- Open Research Data 20686 available results
Chosen catalog filters
displaying 1000 best results Help
Search results for: LAMINATION PROCESS
-
APPLICATION OF APRIORI ALGORITHM IN THE LAMINATION PROCESS IN YACHT PRODUCTION
PublicationThe article specifies the dependence of defects occurring in the lamination process in the production of yachts. Despite great knowledge about their genesis, they cannot be completely eliminated. Authentic data obtained through cooperation with one of the Polish yacht shipyards during the years 2013–2017 were used for the analysis. To perform a simulation, the sample size was observed in 1450 samples, consisting of 6 models of...
-
The study on the appearance of deformation defects in the yacht lamination process using an AI algorithm and expert knowledge
PublicationThis article describes the application of the A-priori algorithm for defining the rule-based relationships between individual defects caused during the lamination process, affecting the deformation defect of the yacht shell. The data from 542 yachts were collected and evaluated. For the proper development of the algorithm, a technological process of the yacht lamination supported by expert decisions was described. The laminating...
-
Influence of Fragment Size on the Time and Temperature of Ethylene Vinyl Acetate Lamination Decomposition in the Photovoltaic Module Recycling Process
PublicationPhotovoltaics is a commercially available and reliable technology with significant potential for long-term growth in nearly all global regions. Several research institutes and companies are working on recycling concepts for thin film modules and modules with crystalline cells. The establishment of recycling and reuse technologies appropriate and applicable to all photovoltaics (PV) modules is a key issue to be addressed as part...
-
SAXS examination of the water evaporation process from silica materials coated with a polysaccharide–polyimine copolymer layer
Publication -
Paired domination and doubly domination in graphs
PublicationW rozprawie poruszane są zagadnienia związane z dominowaniem parami w grafach oraz domiowaniem totalno - powściągniętym w grafach. Ponadto omawiane są zagadnienia związane ze złożonością obliczeniową różnych problemów dominowania w grafach.
-
Production of process water using integrated membrane processes
Publication -
Domination subdivision and domination multisubdivision numbers of graphs
PublicationThe domination subdivision number sd(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the domination number of G. It has been shown [10] that sd(T)<=3 for any tree T. We prove that the decision problem of the domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the domination multisubdivision number...
-
Graphs with equal domination and certified domination numbers
PublicationA 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...
-
Total Domination Versus Domination in Cubic Graphs
PublicationA 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...
-
Application of TiO2 Supported on Nickel Foam for Limitation of NOx in the Air via Photocatalytic Processes
Publication -
Paired domination versus domination and packing number in graphs
PublicationGiven 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...
-
Graphs with equal domination and 2-distance domination numbers
PublicationW publikacji scharakteryzowane są wszystkie te drzewa i grafy jednocykliczne, w których liczba dominowania oraz liczba 2-dominowania na odległość są sobie równe.
-
The paired-domination and the upper paired-domination numbers of graphs
PublicationIn this paper we obtain the upper bound for the upper paired-domination number and we determine the extremal graphs achieving this bound. Moreover we determine the upper paired- domination number for cycles.
-
Total domination in versus paired-domination in regular graphs
PublicationA subset S of vertices of a graph G is a dominating set of G if every vertex not in S has a neighbor in S, while S is a total dominating set of G if every vertex has a neighbor in S. If S is a dominating set with the additional property that the subgraph induced by S contains a perfect matching, then S is a paired-dominating set. The domination number, denoted γ(G), is the minimum cardinality of a dominating set of G, while the...
-
Certified domination
PublicationImagine that we are given a set D of officials and a set W of civils. For each civil x ∈ W, there must be an official v ∈ D that can serve x, and whenever any such v is serving x, there must also be another civil w ∈ W that observes v, that is, w may act as a kind of witness, to avoid any abuse from v. What is the minimum number of officials to guarantee such a service, assuming a given social network? In this paper, we introduce...
-
Trees with equal restrained domination and total restrained domination numbers
PublicationW publikacji scharakteryzowano wszystkie drzewa, w których liczby dominowania powściągniętego oraz podwójnie totalnego są sobie równe.
-
On trees with equal domination and total outer-independent domination numbers
PublicationFor a graph G=(V,E), a subset D subseteq V(G) is a dominating set if every vertex of V(G)D has a neighbor in D, while it is a total outer-independent dominating set if every vertex of G has a neighbor in D, and the set V(G)D is independent. The domination (total outer-independent domination, respectively) number of G is the minimum cardinality of a dominating (total outer-independent dominating, respectively) set of G. We characterize...
-
Modelowanie procesów biznesowych z wykorzystaniem narzędzi iGrafx Process 2015
PublicationKsiążka przeznaczona jest dla studentów studiów ekonomicznych, w programie których znajdują się przedmioty związane z modelowaniem i symulacją procesów biznesowych, ale także dla analityków wykorzystujących narzędzia informatyczne do opisu i wizualizacji procesów. Poszczególne zagadnienia zostały zamknięte w 14 rozdziałach. W rozdziale 1 omówiono podstawowe zagadnienia definicyjne związane z podejściem procesowym oraz zarządzaniem...
-
Assessing the industrialization progress of hydrodynamic cavitation process intensification technology: a review
PublicationHydrodynamic cavitation (HC) is widely acknowledged as a promising green approach for enhancing various production and waste management processes, such as water treatment, sludge pretreatment, lignocellulosic biomass (LCB) pretreatment, emulsification, and food processing. Despite demonstrating superior industrialization potential compared with other emerging technologies such as ultrasound and microwave, the widespread commercial...
-
On trees with equal 2-domination and 2-outer-independent domination numbers
PublicationFor a graph G = (V,E), a subset D \subseteq V(G) is a 2-dominating set if every vertex of V(G)\D$ has at least two neighbors in D, while it is a 2-outer-independent dominating set if additionally the set V(G)\D is independent. The 2-domination (2-outer-independent domination, respectively) number of G, is the minimum cardinality of a 2-dominating (2-outer-independent dominating, respectively) set of G. We characterize all trees...
-
Modelowanie asymetrycznego procesu walcowania blach bimetalowych = The modeling of asymetrical rolling process of bimetallic plate
PublicationW pracy rozważano problem płynięcia plastycznego bimetalowego pasma podczas asymetrycznego procesu walcowania blach bimetalowych. Asymetrię procesu uzyskano w wyniku wprowadzenia różnic w wartościach sił tarcia na powierzchniach styku pasma z poszczególnymi walcami.
-
Choosing Exploration Process Path in Data Mining Processes for Complex Internet Objects
PublicationWe present an experimental case study of a novel and original framework for classifying aggregate objects, i.e. objects that consist of other objects. The features of the aggregated objects are converted into the features of aggregate ones, by use of aggregate functions. The choice of the functions, along with the specific method of classification can be automated by choosing of one of several process paths, and different paths...
-
On simplification of residue scaling process in pipelined Radix-4 MQRNS FFT processor
PublicationResidue scaling is needed in pipelined FFT radix-4 processors based on the Modified Quadratic Residue Number System (MQRNS) at the output of each butterfly. Such processor uses serial connection of radix-4 butterflies. Each butterfly comprises n subunits, one for each modulus of the RNS base and generates four complex residue numbers. In order to prevent arithmetic overflow intermediate results after each butterfly have to be...
-
On configuration of residue scaling process in pipelined radix-4 MQRNS FFT processor
PublicationResidue scaling is needed in pipelined FFT radix-4 processors based on the Modified Quadratic Residue Number System (MQRNS) at the output of each butterfly. Such processor uses serial connection of radix-4 butterflies. Each butterfly comprises n subunits, one for each modulus of the RNS base and outputs four complex residue numbers. In order to prevent the arithmetic overflow in the succesive stage, every number has to be scaled,...
-
Choosing Exploration Process Path in Data Mining Processes for Complex Internet Objects
PublicationWe present an experimental case study of a novel and original framework for classifying aggregate objects, i.e. objects that consist of other objects. The features of the aggregated objects are converted into the features of aggregate ones, by use of aggregate functions. The choice of the functions, along with the specific method of classification can be automated by choosing of one of several process paths, and different paths...
-
On the ratio between 2-domination and total outer-independent domination numbers of trees
PublicationA 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...
-
On trees with double domination number equal to total domination number plus one
PublicationA total dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D. A vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The total (double, respectively) domination number of a graph G is the minimum cardinality of a total (double,...
-
On trees with double domination number equal to 2-domination number plus one
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A subset D subseteq V(G) is a 2-dominating set of G if every vertex of V(G)D is dominated by at least two vertices of D, while it is a double dominating set of G if every vertex of G is dominated by at least two vertices of D. The 2-domination (double domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (double dominating,...
-
Exhaust gas temperature measurements in diagnostic examination of naval gas turbine engines. Part II. Unsteady processes
PublicationThe second part of the article presents the results of operating diagnostic tests of a two- and three-shaft engine with a separate power turbine during the start-up and acceleration of the rotor units. Attention was paid to key importance of the correctness of operation of the automatic engine load control system, the input for which, among other signals, is the rate of increase of the exhaust gas flow temperature. The article...
-
Raman modular system with fibre-optic probes for remote monitoring of CVD process
PublicationW pracy opisano konstrukcję modułowego spektroskopu ramanowskiego umożliwiającego monitorowanie wzrostu warstw w procesach CVD. Przedstawiono rezultaty testów skostruowanego układu oraz wstępne wyniki pomiarów warstw diamentowych.
-
Zastosowanie metody FMEA w ocenie procesu technologicznego = Application of Fmea method to estimation of technological process
PublicationPrzedstawiono wykorzystanie metody FMEA do oceny technologii części klasy tuleja. Szczegółowo omówiono wyniki analizy toczenia kształtującego, operacji hartowania i odpuszczania oraz obróbki wykańczającej przez szlifowanie.
-
Usprawnienie procesu zarządzania wymaganiami w projekcie produkcyjnym na bazie metodyki Rational Unified Process
PublicationArtykuł opisuje koncepcję usprawnienia procesu zarządzania wymaganiami w informatycznym przedsięwzięciu produkcyjnym z wykorzystaniem metodyki Rational Unified Process (RUP). Jest również próbą przedstawienia doświadczeń z przedsięwzięcia wdrożeniowego obejmującego automatyzację tej koncepcji z wykorzystaniem technologii IBM Rational Software i Oracle. Artykuł podkreśla krytyczną rolę mentoringu oraz efektywnego transferu wiedzy...
-
Business process management - integracja reinżynierii procesów gospodarczych z kompleksowym zarządzaniem jakością
Publication -
Business process management - integracja reinżynierii procesów gospodarczych z kompleksowym zarządzaniem jakością
PublicationW artykule przedstawiono analizę zasadniczych nurtów procesowego podejścia do zarządzania organizacjami. W celu uzasadnienia tezy, że koncepcja zarządzania procesami gospodarczymi (BPM) jest rezultatem ewolucji orientacji procesowej, integrującej cechy reinżynierii procesowej oraz kompleksowego zarządzania jakością (TQM), przedstawiono charakterystykę BPR a następnie na bazie krytyki tego podejścia zaprezentowano najważniejsze...
-
Semi-Markow Processes as Models of Devices´ Operating Process of Ship Pro-pulsion System
PublicationReferat zawiera formalny opis procesu eksploatacji urządzeń.
-
Secure Italian domination in graphs
PublicationAn Italian dominating function (IDF) on a graph G is a function f:V(G)→{0,1,2} such that for every vertex v with f(v)=0, the total weight of f assigned to the neighbours of v is at least two, i.e., ∑u∈NG(v)f(u)≥2. For any function f:V(G)→{0,1,2} and any pair of adjacent vertices with f(v)=0 and u with f(u)>0, the function fu→v is defined by fu→v(v)=1, fu→v(u)=f(u)−1 and fu→v(x)=f(x) whenever x∈V(G)∖{u,v}. A secure Italian dominating...
-
Independent Domination Subdivision in Graphs
PublicationA set $S$ of vertices in a graph $G$ is a dominating set if every vertex not in $S$ is adjacent to a vertex in~$S$. If, in addition, $S$ is an independent set, then $S$ is an independent dominating set. The independent domination number $i(G)$ of $G$ is the minimum cardinality of an independent dominating set in $G$. The independent domination subdivision number $\sdi(G)$ is the minimum number of edges that must be subdivided (each...
-
The limit case of a domination property
PublicationPraca dotyczy dolnego ograniczenia liczby dominowania w grafach, ze względu na ilość wierzchołków oraz największą liczbę liści w drzewie spinającym.
-
Experimental examination of an elastomeric polymer
PublicationA new method of repairing damaged structures by filling the cracks with a specially prepared elastomeric polymer mass has been recently proposed. This new and innovative technique, known as the Flexible Joint Method (FJM), is mainly dedicated to masonries and historical objects, where minimum intervention is permitted. The flexible joint bonds the disrupted elements and ensures further safe exploitation of a damaged structure....
-
Exhaust gas temperature measurements in diagnostic examination of naval gas turbine engines. Part I: Steady-state processes
PublicationThe article presents a possible method of detecting failures in the flow section and supply system of a naval gas turbine engine based on the exhaust gas temperature measured behind the gas generator. This temperature is a basic diagnostic parameter use for evaluating the technical state of the turbine engine in operation, and is monitored during engine start-ups, accelerations and decelerations of rotor units, and steady-load...
-
On trees with double domination number equal to 2-outer-independent domination number plus one
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The double domination number of a graph G is the minimum cardinality of a double dominating set of G. For a graph G=(V,E), a subset D subseteq V(G) is a 2-dominating set if every vertex of V(G)D has at least two neighbors...
-
Diagnostyka procesu CVD metodą optycznej spektroskopii emisyjnej. Diagnostics of CVD process by means of optical emission spectroscopy.
PublicationZastosowano optyczną spektroskopię emisyjną do badania w trybie in-situ dysocjacji cząsteczek oraz wzbudzenia i jonizacji atomów wodoru podczas procesu syntezy cienkich warstw diamentowych metodą chemicznego osadzania z par gazowych wspomaganego plazmą mikrofalową (mPACVD). Zbudowano tor światłowodowy, umożliwiający sprzężenie komory CVD z systemem spektroskopowym i wykonywanie pomiarów bezinwazyjnych. Wykonano pomiary spektralne...
-
Weakly connected domination subdivision numbers
PublicationLiczba podziału krawędzi dla dominowania słabo spójnego to najmniejsza liczba krawędzi jaką należy podzielić, aby wzrosła liczba dominowania słabo wypukłego. W pracy przedstawione są własności liczby podziału krawędzi dla dominowania słabo spójnego dla różnych grafów.
-
Weakly connected domination critical graphs
PublicationPraca dotyczy niektórych klas grafów krytycznych ze względu na liczbę dominowania słabo spójnego.
-
On the connected and weakly convex domination numbers
PublicationIn this paper we study relations between connected and weakly convex domination numbers. We show that in general the difference between these numbers can be arbitrarily large and we focus on the graphs for which a weakly convex domination number equals a connected domination number. We also study the influence of the edge removing on the weakly convex domination number, in particular we show that a weakly convex domination number...
-
Total restrained domination numbers of trees
PublicationOpisane są wszystkie drzewa, w których liczby dominowania totalnego i totalno - powściągniętego są sobie równe, a także podano dolne ograniczenie na liczbę dominowania totalno - powściągniętego w drzewach.
-
The outer-connected domination number of a graph
PublicationW pracy została zdefiniowana liczba dominowania zewnętrznie spójnego i przedstawiono jej podstawowe własności.
-
Distance paired domination numbers of graphs
PublicationW pracy przedstawione są pewne własności liczb k-dominowania parami w grafach. Wykazane jest, że problem decyzyjny liczby k-dominowania parami jest problemem NP-zupełnym nawet dla grafów dwudzielnych. Przedstawione są ograniczenia górne i dolne dla liczby k-dominowania parami w drzewach i scharakteryzowane drzewa, w których te ograniczenia są osiągnięte.
-
Complexity Issues on of Secondary Domination Number
PublicationIn this paper we study the computational complexity issues of the problem of secondary domination (known also as (1, 2)-domination) in several graph classes. We also study the computational complexity of the problem of determining whether the domination and secondary domination numbers are equal. In particular, we study the influence of triangles and vertices of degree 1 on these numbers. Also, an optimal algorithm for finding...
-
Lower bound on the domination number of a tree.
PublicationW pracy przedstawiono dolne ograniczenie na liczbę dominowania w drzewach oraz przedstawiono pełną charakterystykę grafów ekstremalnych.