Filters
total: 7188
filtered: 1999
-
Catalog
- Publications 1999 available results
- Journals 15 available results
- People 65 available results
- Inventions 3 available results
- Projects 10 available results
- Laboratories 1 available results
- Research Equipment 4 available results
- e-Learning Courses 2419 available results
- Events 8 available results
- Open Research Data 2664 available results
Chosen catalog filters
displaying 1000 best results Help
Search results for: smt
-
Direct design of Controlled Modulus Columns (CMC) based on in-situ testing
PublicationIn 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
PublicationPurpose – 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...
-
Weakly convex and convex domination numbers of some products of graphs
PublicationIf $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
PublicationA 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...
-
A lower bound on the double outer-independent domination number of a tree
PublicationA 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...
-
Graphs with isolation number equal to one third of the order
PublicationA 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...
-
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...
-
MEMORY EFFECT ANALYSIS USING PIECEWISE CUBIC B-SPLINE OF TIME FRACTIONAL DIFFUSION EQUATION
PublicationThe 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
PublicationDesign 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
PublicationRozpuszczalne 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
PublicationThe 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
PublicationThis 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...
-
On trees attaining an upper bound on the total domination number
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. 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
PublicationThe 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...
-
Bounds on the vertex-edge domination number of a tree
PublicationA 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 optimal sliding mode control based on immune-wavelet algorithm for underwater robotic manipulator
PublicationIn 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...
-
An Alternative Proof of a Lower Bound on the 2-Domination Number of a Tree
PublicationA 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...
-
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,...
-
Interpolation properties of domination parameters of a graph
PublicationAn 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
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...
-
Graph security testing
PublicationSet 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...
-
SLIDING MODE-PID FUZZY CONTROLLER WITH A NEW REACHING MODE FOR UNDERWATER ROBOTIC MANIPULATORS
PublicationDesign 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...
-
Weakly connected Roman domination in graphs
PublicationA 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...
-
MRAS-Based Switching Linear Feedback Strategy for Sensorless Speed Control of Induction Motor Drives
PublicationThis 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
PublicationIf 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
PublicationLet 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...
-
Color-based Detection of Bleeding in Endoscopic Images
PublicationIn 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...
-
Influence of low-temperature physical hardening on stiffness and tensile strength of asphalt concrete and stone mastic asphalt
PublicationThis 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...
-
Common Independence in Graphs
PublicationAbstract: 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
PublicationThe 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...
-
Extending touch-less interaction with smart glasses by implementing EMG module
PublicationIn 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...
-
Comparing Arbitrary Unrooted Phylogenetic Trees Using Generalized Matching Split Distance
PublicationIn 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...
-
Characterization of the natural chemical and osmotic environment of early wheat embryogenesis
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...
-
Domination-Related Parameters in Rooted Product Graphs
PublicationAbstract A set S of vertices of a graph G is a dominating set in G if every vertex outside of S is adjacent to at least one vertex belonging to S. A domination parameter of G is related to those sets of vertices of a graph satisfying some domination property together with other conditions on the vertices of G. Here, we investigate several domination-related parameters in rooted product graphs.
-
Induction of the common-sense hierarchies in lexical data
PublicationUnsupervised organization of a set of lexical concepts that captures common-sense knowledge inducting meaningful partitioning of data is described. Projection of data on principal components allow for dentification of clusters with wide margins, and the procedure is recursively repeated within each cluster. Application of this idea to a simple dataset describing animals created hierarchical partitioning with each clusters related...
-
Comparison of Methods for Real and Imaginary Motion Classification from EEG Signals
PublicationA 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...
-
Construction of phylogenetic trees with topological constraints
PublicationThis paper proposes a method of reconstruction of phylogenetic trees based on heuristic search with topological constraints. Using topological constraints it is possible to reduce the set of solutions as well as to enforce that the result is consistent with a given hypothesis about the evolution process within some group of species. Along with this work a number of algorithms used for phylogenetic analysis were implemented. Those...
-
The importance of the bottom layer in double-layer porous asphalt for noise reduction
PublicationDouble-layer porous asphalt concrete (DPAC) surfaces are generally considered to be the acoustically most effective low noise road surfaces ready for implementation. While DPAC used on highways in warm climates may have an average life of around 8 years, in Scandinavia with severe winter climate DPAC usually survive only about 3 years; partly due to wear of studded tyres. An ongoing project in Sweden, applying DPAC and single-layer...
-
Fast Multi-Objective Optimization of Narrow-Band Antennas Using RSA Models and Design Space Reduction
PublicationComputationally efficient technique for multi-objective design optimization of narrow-band antennas is presented. In our approach, the corrected low-fidelity antenna model (obtained through coarse-discretization EM simulations) is enhanced using frequency scaling and response correction, sampled, and utilized to obtain a fast response surface approximation (RSA) antenna surrogate. The RSA model is constructed in the reduced design space....
-
Detection of sulfonamide resistance genes via in situ PCR-FISH
PublicationDue to the rising use of antibiotics and as a consequence of their concentration in the environment an increasing number of antibiotic resistant bacteria is observed. The phenomenon has a hazardous impact on human and animal life. Sulfamethoxazole is one of the sulfonamides commonly detected in surface waters and soil. The aim of the study was to detect sulfamethoxazole resistance genes in activated sludge biocenosis by use of...
-
Pareto Ranking Bisection Algorithm for Expedited Multi-Objective Optimization of Antenna Structures
PublicationThe purpose of this letter is introduction of a novel methodology for expedited multi-objective design of antenna structures. The key component of the presented approach is fast identification of the initial representation of the Pareto front (i.e., a set of design representing the best possible trade-offs between conflicting objectives) using a Pareto-ranking bisection algorithm. The algorithm finds a discrete set of Pareto-optimal...
-
Isolation Number versus Domination Number of Trees
PublicationIf 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)....
-
Diagnostyka obiektów przemysłowych z wykorzystaniem wspólnej magistrali usług DIAGNOSTIC SERVICE BUS DSB
PublicationKorzystając ze znanego pojęcia magistrali, w pracy przedstawia się sposób przystosowania i wykorzystania magistrali usług w systemie diagnostyki obiektów przemysłowych. Koncepcja takiego środka komunikacyjnego opiera się na architekturze SOA (z architekturą zorientowanej na usługi). Koncepcja ta stanowi metodę rozwiązania problemów wydajnościowych rozwijanego projektu pt. "Sieciowy Monitor Obiektu" (SMO). Wspólna szyna danych zwiększa...
-
Shape Memory Materials from Rubbers
PublicationSmart materials are much discussed in the current research scenario. The shape memory effect is one of the most fascinating occurrences in smart materials, both in terms of the phenomenon and its applications. Many metal alloys and polymers exhibit the shape memory effect (SME). Shape memory properties of elastomers, such as rubbers, polyurethanes, and other elastomers, are discussed in depth in this paper. The theory, factors...
-
Integration of a Multilevel Transport System Model into Sustainable Urban Mobility Planning
PublicationWhen planning their transport policy, cities usually focus on developing sustainable transport systems and reducing the negative consequences of transport. One way to deliver transport policies is to use the Sustainable Urban Mobility Plan (SUMP), a strategic document designed to meet the demand for mobility whilst ensuring adequate quality of life for the residents. The process of Sustainable Urban Mobility Planning (SUMP process)...
-
Preparation and Characterization of Films Based on Disintegrated Bacterial Cellulose and Montmorillonite
PublicationThe food packaging materials from natural polymers including polysaccharides offer an ecologically important alternative to commonly used synthetic, non-biodegradable counterparts. The purpose of this work was to modify of bacterial cellulose (BC) leading to the improvement of its functional properties in terms of use as a food packaging material. Effects of disintegration of BC and addition of montmorillonite (MMT) on its water...
-
Seismic Response Analysis of Knee-Braced Steel Frames Using Ni-Ti Shape Memory Alloys (SMAs)
PublicationShape Memory Alloys (SMAs) are known as active materials that can be widely used for structural purposes due to their flag-shape behavior under loading and reloading. Their unique characteristics provided a potential solution for civil engi-neers especially to model buildings with the capability of dissipating seismic en-ergy. In this study, the main purpose is to explore the seismic behavior of Knee-Braced Frames (KBFs) and...
-
Emotion recognition and its application in software engineering
PublicationIn this paper a novel application of multimodal emotion recognition algorithms in software engineering is described. Several application scenarios are proposed concerning program usability testing and software process improvement. Also a set of emotional states relevant in that application area is identified. The multimodal emotion recognition method that integrates video and depth channels, physiological signals and input devices...
-
Crystallization of space: Space-time fractals from fractal arithmetic
PublicationFractals such as the Cantor set can be equipped with intrinsic arithmetic operations (addition, subtraction, multiplication, division) that map the fractal into itself. The arithmetics allows one to define calculus and algebra intrinsic to the fractal in question, and one can formulate classical and quantum physics within the fractal set. In particular, fractals in space-time can be generated by means of homogeneous spaces associated...