Filtry
wszystkich: 7214
-
Katalog
- Publikacje 1999 wyników po odfiltrowaniu
- Czasopisma 15 wyników po odfiltrowaniu
- Osoby 65 wyników po odfiltrowaniu
- Wynalazki 3 wyników po odfiltrowaniu
- Projekty 10 wyników po odfiltrowaniu
- Laboratoria 1 wyników po odfiltrowaniu
- Aparatura Badawcza 4 wyników po odfiltrowaniu
- Kursy Online 2445 wyników po odfiltrowaniu
- Wydarzenia 8 wyników po odfiltrowaniu
- Dane Badawcze 2664 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: smt
-
Partial characterization of proteins from mussel Mytilus galloprovincialis as a biomarker of contamination
PublikacjaPrzedmiotem zainteresowania były:- funkcjonalne i przeciwutleniające właściwości białek małża Mytilus galloprovincialis,- poziom zawartości metali ciężkich (ołów i kadm) w tkankach.Badania przeprowadzono dla małży zebranych zarówno w zanieczyszczonych, jak i w czystych obszarach strefy brzegowej Morza Czarnego w regionie Warny (Bułgaria). W badaniach wykorzystano takie techniki analityczne jak: spektroskopia FTIR, fluorescencja,...
-
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,...
-
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...
-
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...
-
The symmetrization method and limit cycles of vibro-impact systems
Publikacja -
Structural stability of invariant sets of vibro-impact systems
Publikacja -
Sea surface temperature in the Baltic Sea derived from Landsat 8 satellite data - path 194
Dane BadawczeThe data set contains high resolution sea surface temperature (SST) maps estimated from Landsat 8 Level 1 Thermal Infrared Sensor (TIRS) data using NLSST algorithm. SST was calculated only for granules (185 x 180 km) from satellite path number 194, that covered at least 2000 km2 of the cloud-free area of the Baltic Sea.
-
Sea surface temperature in the Baltic Sea derived from Landsat 8 satellite data - path 192
Dane BadawczeThe data set contains high resolution sea surface temperature (SST) maps estimated from Landsat 8 Level 1 Thermal Infrared Sensor (TIRS) data using NLSST algorithm. SST was calculated only for granules (185 x 180 km) from satellite path number 192, that covered at least 2000 km2 of the cloud-free area of the Baltic Sea.
-
Sea surface temperature in the Baltic Sea derived from Landsat 8 satellite data - path 191
Dane BadawczeThe data set contains high resolution sea surface temperature (SST) maps estimated from Landsat 8 Level 1 Thermal Infrared Sensor (TIRS) data using NLSST algorithm. SST was calculated only for granules (185 x 180 km) from satellite path number 191, that covered at least 2000 km2 of the cloud-free area of the Baltic Sea.
-
Sea surface temperature in the Baltic Sea derived from Landsat 8 satellite data - path 193
Dane BadawczeThe data set contains high resolution sea surface temperature (SST) maps estimated from Landsat 8 Level 1 Thermal Infrared Sensor (TIRS) data using NLSST algorithm. SST was calculated only for granules (185 x 180 km) from satellite path number 193, that covered at least 2000 km2 of the cloud-free area of the Baltic Sea.
-
Sea surface temperature in the Baltic Sea derived from Landsat 8 satellite data - path 190
Dane BadawczeThe data set contains high resolution sea surface temperature (SST) maps estimated from Landsat 8 Level 1 Thermal Infrared Sensor (TIRS) data using NLSST algorithm. SST was calculated only for granules (185 x 180 km) from satellite path number 190, that covered at least 2000 km2 of the cloud-free area of the Baltic Sea.
-
Direct design of Controlled Modulus Columns (CMC) based on in-situ testing
PublikacjaIn this paper, the serviceability limit state and bearing capacity of tension screw displacement piles were analyzed using the results of static pile load tests, carried out on the test plot near the Elbląg city, and field, and laboratory tests. The paper presents the methodology of determining the pile load-settlement curve using different types of t-z transfer functions. The new method of constructing the pile load-settlement...
-
Antecedents and outcomes of social media fatigue
PublikacjaPurpose – This study aims to explore which of four chosen factors (i.e. privacy concerns, FoMO, self-disclosure and time cost) induce a feeling of strain among Facebook users in terms of social media fatigue (SMF), and if this occurs, whether it further influences such outcomes as discontinuance of usage (DoU) and interaction engagement decrement (IED). Design/methodology/approach – Through an online structured questionnaire, empirical...
-
Aleksander Piwek prof. dr hab. inż. arch.
Osoby -
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...
-
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}...
-
Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph
PublikacjaA vertex cover of a graph G = (V, E) is a set X ⊂ V such that each edge of G is incident to at least one vertex of X. The ve cardinality of a vertex cover of G. A dominating set D ⊆ V is a weakly connected dominating set of G if the subgraph G[D]w = (N[D], Ew) weakly induced by D, is connected, where Ew is the set of all edges having at least one vertex in D. The weakly connected domination number γw(G) of G is the minimum cardinality...
-
Anita Ilska Mgr szt.
Osoby -
Graphs with isolation number equal to one third of the order
PublikacjaA set D of vertices of a graph G is isolating if the set of vertices not in D and with no neighbor in D is independent. The isolation number of G, denoted by \iota(G) , is the minimum cardinality of an isolating set of G. It is known that \iota(G) \leq n/3 , if G is a connected graph of order n, , distinct from C_5 . The main result of this work is the characterisation of unicyclic and block graphs of order n with isolating number...
-
Jakub Drewnowski dr hab. inż.
Osoby -
Total domination in versus paired-domination in regular graphs
PublikacjaA 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...
-
Data on LEGO sets release dates and retail prices combined with aftermarket transaction prices between June 2018 and June 2023.
Dane BadawczeThe dataset contains LEGO bricks sets item count and pricing history for AI-based set pricing prediction.
-
MEMORY EFFECT ANALYSIS USING PIECEWISE CUBIC B-SPLINE OF TIME FRACTIONAL DIFFUSION EQUATION
PublikacjaThe purpose of this work is to study the memory effect analysis of Caputo–Fabrizio time fractional diffusion equation by means of cubic B-spline functions. The Caputo–Fabrizio interpretation of fractional derivative involves a non-singular kernel that permits to describe some class of material heterogeneities and the effect of memory more effectively. The proposed numerical technique relies on finite difference approach and cubic...
-
A New Fuzzy Sliding Mode Controller with PID Sliding Surface for Underwater Manipulators
PublikacjaDesign of an accurate and robust controller is challenging topic in underwater manipulator control. This is due to hydrodynamic disturbances in underwater environment. In this paper a sliding mode control (SMC) included a PID sliding surface and fuzzy tunable gain is designed. In this proposed controller robustness property of SMC and fast response of PID are incorporated with fuzzy rules to reduce error tracking. In the control...
-
The influence of soluble microbial products on microbial community composition: hypothesis of microbial community succession
PublikacjaRozpuszczalne produkty mikrobiologiczne (SMP) są związkami organicznymi wytwarzanymi podczas rozkładu substratów przez mikroorganizmy osadu czynnego. Zbadano mikroskopowo zmiany składu zespołów mikrobiologicznych (organizmów jedno- i wielokomórkowych) pod wpływem obniżonego lub zwiększonego poziomu SMP. Wysoka zawartość SMP w znacznym stopniu zmieniła skład zespołów mikrobiologicznych, od orzęsków osiadłych (12-175 µm), do...
-
Thermodynamic Studies of Interactions between Sertraline Hydrochloride and Randomly Methylated β-Cyclodextrin Molecules Supported by Circular Dichroism Spectroscopy and Molecular Docking Results
PublikacjaThe interaction between sertraline hydrochloride (SRT) and randomly methylated β-cyclodextrin (RM β CD) molecules have been investigated at 298.15 K under atmospheric pressure. The method used—Isothermal Titration Calorimetry (ITC) enabled to determine values of the thermodynamic functions like the enthalpy (DH), the entropy (DS) and the Gibbs free energy (DG) of binding for the examined system. Moreover, the stoichiometry coefficient...
-
Optimizing FSO networks resilient to adverse weather conditions by means of enhanced uncertainty sets
PublikacjaThis work deals with dimensioning of wireless mesh networks (WMN) composed of FSO (free space optics) links. Although FSO links realize broadband transmission at low cost, their drawback is sensitivity to adverse weather conditions causing transmission degradation on multiple links. Hence, designing such FSO networks requires an optimization model to find the cheapest configuration of link capacities that will be able to carry...
-
An optimal sliding mode control based on immune-wavelet algorithm for underwater robotic manipulator
PublikacjaIn this paper, a robust optimal Sliding Mode Controller (SMC) based on new algorithm of Artificial Immune System (AIS) is proposed for trajectory tracking of underwater manipulators. A new AIS algorithm is used to derive optimal values of surface parameters and boundary layer thickness in SMC with considering minimum torques and error. Surface parameters and boundary layer thickness are considered as antibody in AIS and Morlet...
-
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,...
-
An Alternative Proof of a Lower Bound on the 2-Domination Number of a Tree
PublikacjaA 2-dominating set of a graph G is a set D of vertices of G such that every vertex not in D has a 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. Fink and Jacobson [n-domination in graphs, Graph theory with applications to algorithms and computer science, Wiley, New York, 1985, 283-300] established the following lower bound on the 2-domination...
-
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...
-
On trees attaining an upper bound on the total domination number
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. The total domination number of a graph G, denoted by γ_t(G), is the minimum cardinality of a total dominating set of G. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International Journal of Graphs and Combinatorics 1 (2004), 69-75] established the following upper bound on the total domination...
-
Thermodynamic Cycles of Air Microturbine Power Plants Working on Biomass Fuels
PublikacjaThe gas turbine engine is modified to work as an air turbine set which consists, in the simplest arrangement, of a compressor, a heat exchanger and a turbine. Air is a working medium for both: the compressor and the turbine. This kind of air turbine set can be applied in power plants working on biomass fuels. In this solution we can burn fuels of varying parameters in the external combustion chamber without any harmful effects...
-
Interpolation properties of domination parameters of a graph
PublikacjaAn integer-valued graph function π is an interpolating function if a set π(T(G))={π(T): T∈TT(G)} consists of consecutive integers, where TT(G) is the set of all spanning trees of a connected graph G. We consider the interpolation properties of domination related parameters.
-
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...
-
Weakly connected Roman domination in graphs
PublikacjaA Roman dominating function on a graph G=(V,E) is defined to be a function f :V → {0,1,2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v)=2. A dominating set D⊆V is a weakly connected dominating set of G if the graph (V,E∩(D×V)) is connected. We define a weakly connected Roman dominating function on a graph G to be a Roman dominating function such that the set...
-
SLIDING MODE-PID FUZZY CONTROLLER WITH A NEW REACHING MODE FOR UNDERWATER ROBOTIC MANIPULATORS
PublikacjaDesign of an accurate and robust controller is a challenging topic in an underwater manipulator control. This is due to hydrodynamic disturbances in underwater environment. In this paper a sliding mode control (SMC) included a PID sliding surface and fuzzy tunable gain is designed. In this proposed controller robustness property of SMC and fast response of PID are incorporated with fuzzy rules to reduce error tracking. In the...
-
Graph security testing
PublikacjaSet S ⊂ V is called secure set iff ∀ X ⊂ S | N [ X ] ∩ S | ≥ | N ( X ) \ S | [3]. That means that every subset of a secure set has at least as many friends (neighbour vertices in S) as enemies (neighbour vertices outside S) and will be defended in case of attack. Problem of determining if given set is secure is co −NP -complete, there is no efficient algorithm solving it [3]. Property testers are algorithms that distinguish inputs...
-
MRAS-Based Switching Linear Feedback Strategy for Sensorless Speed Control of Induction Motor Drives
PublikacjaThis paper presents a newly designed switching linear feedback structure of sliding mode control (SLF-SMC) plugged with an model reference adaptive system (MRAS) based sensorless fieldoriented control (SFOC) for induction motor (IM). Indeed, the performance of the MRAS depends mainly on the operating point and the parametric variation of the IM. Hence, the sliding mode control (SMC) could be considered a good control alternative...
-
A remark on singular sets of vector bundle morphisms
PublikacjaIf characteristic classes for two vector bundles over the same base space do not coincide, then the bundles are not isomorphic. We give under rather common assumptions a lower bound on the topological dimension of the set of all points in the base over which a morphism between such bundles is not bijective. Moreover, we show that this set is topologically non-trivial.
-
All graphs with paired-domination number two less than their order
PublikacjaLet G=(V,E) be a graph with no isolated vertices. A set S⊆V is a paired-dominating set of G if every vertex not in S is adjacent with some vertex in S and the subgraph induced by S contains a perfect matching. The paired-domination number γp(G) of G is defined to be the minimum cardinality of a paired-dominating set of G. Let G be a graph of order n. In [Paired-domination in graphs, Networks 32 (1998), 199-206] Haynes and Slater...
-
Influence of low-temperature physical hardening on stiffness and tensile strength of asphalt concrete and stone mastic asphalt
PublikacjaThis paper presents laboratory testing of stiffness modulus and indirect tensile strength of three asphalt concrete (AC) and three stone mastic asphalt (SMA) mixes after isothermal storage at temperature of -20oC, at different time intervals up to 16 days. The tests under repeated dynamic loading showed physical hardening of all tested mixes which was manifested by an evident increase of their stiffness moduli after isothermal...
-
Color-based Detection of Bleeding in Endoscopic Images
PublikacjaIn this paper a color descriptor designed for bleeding detection in endoscopic images is proposed. The development of the algorithm was carried out on a representative training set of 36 images of bleeding and 25 clear images. Another 38 bleeding and 26 normal images were used in the final stage as a test set. All of the considered images were extracted from separate endoscopic examinations. The experiments include color distribution...
-
Common Independence in Graphs
PublikacjaAbstract: The cardinality of a largest independent set of G, denoted by α(G), is called the independence number of G. The independent domination number i(G) of a graph G is the cardinality of a smallest independent dominating set of G. We introduce the concept of the common independence number of a graph G, denoted by αc(G), as the greatest integer r such that every vertex of G belongs to some independent subset X of VG with |X|...
-
Sensorless Control of Induction Motor Based on Super-Twisting Sliding Mode Observer With Speed Convergence Improvement
PublikacjaThe super twisting sliding-mode observer (ST-SMO) has been proposed to achieve an effective method for alleviating low-order harmonics of measured quantities, issues related to DC drift, and suppression of chattering due to low-frequency sampling. The conventional ST-SMO, on the other hand, suffers from control delay in the convergence trajectory due to the system disturbance, resulting in decreased anti-disturbance capability...
-
Comparing Arbitrary Unrooted Phylogenetic Trees Using Generalized Matching Split Distance
PublikacjaIn the paper, we describe a method for comparing arbitrary, not necessary fully resolved, unrooted phylogenetic trees. Proposed method is based on finding a minimum weight matching in bipartite graphs and can be regarded as a generalization of well-known Robinson-Foulds distance. We present some properties and advantages of the new distance. We also investigate some properties of presented distance in a common biological problem...
-
Extending touch-less interaction with smart glasses by implementing EMG module
PublikacjaIn this paper we propose to use temporal muscle contraction to perform certain actions. Method: The set of muscle contractions corresponding to one of three actions including “single-click”, “double-click” “click-n-hold” and “non-action” were recorded. After recording certain amount of signals, the set of five parameters was calculated. These parameters served as an input matrix for the neural network. Two-layer feedforward neural...
-
Characterization of the natural chemical and osmotic environment of early wheat embryogenesis
Publikacja -
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...
-
Comparison of Methods for Real and Imaginary Motion Classification from EEG Signals
PublikacjaA method for feature extraction and results of classification of EEG signals obtained from performed and imagined motion are presented. A set of 615 features was obtained to serve for the recognition of type and laterality of motion using 8 different classifications approaches. A comparison of achieved classifiers accuracy is presented in the paper, and then conclusions and discussion are provided. Among applied algorithms the...