Search
displaying 1000 best results Help
Search results for: minimum sample size
-
RSS-Based DoA Estimation Using ESPAR Antenna for V2X Applications in 802.11p Frequency Band
PublicationIn this paper, we have proposed direction-of arrival (DoA) estimation of incoming signals for V2X applications in 802. 11p frequency band, based on recording of received signal strength (RSS) at electronically steerable parasitic array radiator (ESPAR) antenna's output port. The motivation of the work was to prove that ESPAR antenna used to increase connectivity and security in V2X communication can be also used for DoA estimation....
-
Self-Optimizing Adaptive Vibration Controller
PublicationThis paper presents a new approach to rejection of sinusoidal disturbances acting at the output of a discrete-time linear stable plant with unknown dynamics. It is assumed that the frequency of the sinusoidal disturbance is known, and that the output signal is contaminated with wideband measurement noise. The proposed controller, called SONIC (self-optimizing narrowband interference canceller), combines the coefficient fixing technique,...
-
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 upper bound on the 2-outer-independent domination number of a tree
PublicationA 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
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,...
-
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 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,...
-
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...
-
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...
-
A note on polynomial algorithm for cost coloring of bipartite graphs with Δ ≤ 4
PublicationIn the note we consider vertex coloring of a graph in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of coloring is the sum of costs incurred at each vertex. We show that the minimum cost coloring problem for n-vertex bipartite graph of degree ∆≤4 can be solved in O(n^2) time. This extends Jansen’s result [K.Jansen,The optimum cost chromatic partition problem, in:...
-
Finding small-width connected path decompositions in polynomial time
PublicationA connected path decomposition of a simple graph $G$ is a path decomposition $(X_1,\ldots,X_l)$ such that the subgraph of $G$ induced by $X_1\cup\cdots\cup X_i$ is connected for each $i\in\{1,\ldots,l\}$. The connected pathwidth of $G$ is then the minimum width over all connected path decompositions of $G$. We prove that for each fixed $k$, the connected pathwidth of any input graph can be computed in polynomial-time. This answers...
-
Scheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines
PublicationThe problem of scheduling n identical jobs on 4 uniform machines with speeds s1>=s2>=s3>=s4 is considered.The aim is to find a schedule with minimum possible length. We assume that jobs are subject to mutual exclusion constraints modeled by a bipartite incompatibility graph of degree delta. We show that the general problem is NP-hard even if s1=s2=s3. If, however, delta<5 and s1>12s2 s2=s3=s4, then the problem can be solved to...
-
THE METHOD OF ANALYSIS OF DAMAGE REINFORCED CONCRETE BEAMS USING TERRESTRIAL LASER SCANNING
PublicationThe authors present an analysis of the possibility to assess deformations and mode of failure of R-C beams using terrestrial laser scanning. As part of experiments carried out at the Regional Laboratory of Construction (at Gdansk University of Technology), reinforced concrete beams were subjected to destruction by bending and by shear. The process of press impact on the reinforced concrete beam was recorded using terrestrial laser...
-
“Green” nature of the process of derivatization in analytical sample preparation
PublicationNowadays, the idea of Green Analytical Chemistry (GAC) is of high importance what impacts on the rapid growth in the sample preparation area with special emphasis on sample preparation simplification, miniaturization, and automation. Because the derivatization process is often an essential element of the analytical procedure, it should be important to focus on this issue from GAC perspective and conduct a series of experiments...
-
Solventless sample preparation techniques based on solid- and vapour-phase extraction
PublicationThe main objective of this review is to critically evaluate recent developments in solventless sample preparation techniques. The potential of a variety of sample preparation techniques based on solid- and vapour-phase extraction techniques is evaluated. Direct thermal extraction and derivatization processes to facilitate the extraction of analytes in different areas are included. The applicability, disadvantages and advantages...
-
Zarządzanie projektami w podejściu zwinnym
PublicationW opracowaniu opisane zostały wzorce postępowania stosowane w przypadku realizacji przedsięwzięć dużych i złożonych, takie jak Scaled Agile Framework (SAFe), Large-Scale Scrum (LeSS) czy Nexus, spośród których najbardziej popularne jest to pierwsze podejście. Każda z tych metodyk zawiera wskazówki i wytyczne dotyczące tego, w jaki sposób koordynować prace wielu Zespołów Scrum. Wprowadzają one wydarzenia oraz role niezbędne w bardziej...
-
Measured and predicted freeze-thaw days frequencies in climate change conditions in central Poland
PublicationThe rate of progression of geomorphological phenomena is greatly influenced by freeze-thaw processes. In the face of air temperature increasing over the past few decades, a question of the future impact of these processes arises, notably in the temperate and cold climate zones. Using the mean, maximum and minimum daily air temperature data in the period 1951–2018 obtained from three weather stations located in the vicinity of Jeziorsko...
-
Chemical identification of rubber fender sample and hardness and density measurements
PublicationScope of testing: Chemical identification of rubber fender sample and hardness and density measurements. - Raport z badań zleconych - Numer umowy: 031178
-
Green Aspects of Miniaturized Sample Preparation Techniques
PublicationCorrect monitoring and control of the state of the environment and scientific research on the subject of environmental protection often require that determinations of compounds present at very low concentrations be made in samples characterized by a matrix of complex composition (e.g., biological samples, water and soil samples). Moreover, due to the limited number of analytical techniques which are sufficiently sensitive to conduct...
-
A note on the strength and minimum color sum of bipartite graphs
PublicationSiłą grafu G nazywamy najmniejszą liczbę całkowitą s, taką że istniej pokolorowanie grafu G, o minimalnej sumie przy użyciu kolorów {1,...,s}. W pracy pokazano, że w grafach dwudzielnych stopnia D zachodzi oszacowanie s <= ceil(D/2) + 1. Z obserwacji tej wynika algorytm wielomianowy do obliczania siły i sumy chromatycznej w grafach dwudzielnych stopnia co najwyżej 4.
-
WPŁYW TECHNIKI MONITORINGU CIŚNIENIA KRWI NA KRĄŻENIE W DŁONI CZŁOWIEKA
PublicationPrzeprowadzono badania dotyczące wpływu pracy profesjonalnego monitora ciśnienia krwi CNAP 500 Monitor na krąŜenie w badanej dłoni. Zmierzono czas od zespołu QRS sygnału EKG do momentu pojawienia się minimum i maksimum sygnału fali tętna na nadgarstku oraz palcu pomierzonych z zastosowaniem czujników optycznych. Dodatkowo przeprowadzono oszacowanie teoretyczne moŜliwych zmian oraz analizę impedancyjną...
-
Analiza efektywności metod estymacji położenia terminala ruchomego w środowisku propagacji wielodrogowej
PublicationW referacie została zaprezentowana analiza efektywności metod estymacji położenia terminala ruchomego w systemie WCDMA/FDD (Wideband Code Division Multiple Access / Frequency Division Duplex) w warunkach propagacji wielodrogowej. Analizie poddano cztery, najczęściej spotykane w literaturze przedmiotu, metody: Chan'a, Foy'a, Fang'a oraz Friedlander'a. Metody te umożliwiają wyznaczanie położenia geograficznego termi-nala ruchomego...
-
An upper bound on the total outer-independent domination number of a tree
PublicationA 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...
-
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...
-
The dimensions of national competitiveness: the empirical analysis based on The World Economic Forum’s data
PublicationThe aim of this research is to determine the minimum number of uncorrelated dimensions which can describe national competitiveness (NC). NC is thought of as the ability of a nation to provide a conducive environment for its firms to prosper. It is shown that the environment affects national productivity catalytically through the interactions with the production factors while itself remaining unchanged. Selected World Economic...
-
TOTAL DOMINATION MULTISUBDIVISION NUMBER OF A GRAPH
PublicationThe domination multisubdivision number of a nonempty graph G was defined in [3] as the minimum positive integer k such that there exists an edge which must be subdivided k times to increase the domination number of G. Similarly we define the total domination multisubdivision number msd_t (G) of a graph G and we show that for any connected graph G of order at least two, msd_t (G) ≤ 3. We show that for trees the total domination...
-
Environmentally acceptable lubricants (EAL) compared with a reference mineral oil as marine stern tube bearing lubricant – Experimental and theoretical investigations
PublicationThe purpose of this research is to indicate the potential differences in bearing characteristics resulting from the application of different lubricant types with the same viscosity grade. The effect of different environmentally acceptable lubricants (EALs) on hydrodynamic journal bearing properties is studied experimentally and compared to the properties obtained after lubrication with a reference mineral oil. The results of the...
-
Sample Preparation in Foodomics: Miniaturized Solid-Phase Extraction
PublicationAnalytical chemists face a challenge to bring comprehensive information on a given food and biological sample by using the best available analytical techniques and meet the requirements of sustainable development and green chemistry at the same time. A key objective of this chapter is to review selected literature data on the utilization of solid-phase extraction techniques with special attention to their miniaturized modes in...
-
The generalization by simplification operator with Sester’s method of objects representing groups of buildings in Kartuzy district - scale 1:10000. Data from OSM
Open Research DataThe process of automatic generalization is one of the elements of spatial data preparation for the purpose of creating digital cartographic studies. The presented data include a part of the process of generalization of building groups obtained from the Open Street Map databases (OSM) [1].
-
On Sample Rate Conversion Based on Variable Fractional Delay Filters
PublicationThe sample rate conversion algorithm based on variable fractional delay filters is often used if the resampling ratio cannot be expressed as the ratio of small integer numbers or if it is not constant. The main advantage of such solution is that it allows for arbitrary resampling ratios which can even be changed during the resampling process. In this paper a discussion on influence of different approaches to fractional filter...
-
ANALYSIS OF CLIMATIC ZONES IN POLAND WITH REGARD TO ASPHALT PERFORMANCE GRADING
PublicationTowards the end of the last century a new system of bitumen grading was developed and implemented as part of the American Strategic Highway Research Program (SHRP). Its aim was to better adjust the testing methods and requirements for road bitumens to the actual conditions in which those bitumens serve in road pavements. Currently in Poland, similarly as in the other EU countries, road bitumens are tested and classified with regard...
-
Prevention of resonance oscillations in gear mechanisms using non-circular gears
PublicationOne of the main disadvantages of gear mechanisms is the occurrence of noise and vibrations. This study investigated the applicability of non-circular gears for preventing resonance oscillations in gear mechanisms. The influence of a small deviation of the gear centrodes from the nominal circles on kinematic and oscillatory characteristics was analysed. It was shown that a larger deviation results in a smaller resonance amplitude...
-
Optimum Control of Gyroscopic Systems
PublicationThe problem of optimum control of transverse rotor vibrations with gyroscopic interactions has been described and solved in the paper. An integral performance index has been defined for such system in order to minimize vibration level of a chosen rotor point. For this reason, an efficient way of finding the weight coefficients of integral performance index for multi-degrees-of-freedom system with gyroscopic interactions has been...
-
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...
-
Bipartite theory of graphs: outer-independent domination
PublicationLet $G = (V,E)$ be a bipartite graph with partite sets $X$ and $Y$. Two vertices of $X$ are $X$-adjacent if they have a common neighbor in $Y$, and they are $X$-independent otherwise. A subset $D \subseteq X$ is an $X$-outer-independent dominating set of $G$ if every vertex of $X \setminus D$ has an $X$-neighbor in $D$, and all vertices of $X \setminus D$ are pairwise $X$-independent. The $X$-outer-independent domination number...
-
An upper bound for 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 γ_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We prove...
-
Optymalizacja nieciągłych funkcji wielomodalnych z wykorzystaniem kooperacyjnego algorytmu koewolucyjnego
PublicationW artykule przedstawiono algorytmy koewolucyjne, heurystyczną metodę rozwiązywania złożonych obliczeniowo problemów opartą na zasadzie korelacji oraz darwinowskiej teorii ewolucji. Opisano zalety algorytmu, możliwe zastosowania, sposób działania oraz niektóre z dotychczasowych implementacji. Następnie wybrano trzy wielomodalne lub nieciągłe funkcje testowe: Rosenbrocka, Styblinskiego-Tanga oraz Schaffer’a. Dokonano dekompozycji...
-
Lean Startup as a New Way of Managing Technology Ventures Illustrated by the Example of Wlcome App
PublicationThe dot-com bubble in the 1990s made the technology industry aware that even excellent ideas backed by amazing teams are not sufficient to ensure a startup’s success. The biggest risk of startups is that they have to operate within many uncertainties, their market and customers are unknown, and their business model is not yet validated. Therefore, successful execution of such a venture requires a rigorous process that would validate...
-
New sample preparation strategies for comprehensive lipidomics of human breast milk
PublicationGLOBAL PROFILING ANALYSIS OF HUMAN BREAST MILK (HBM) LIPIDS IS HINDERED BY COMPLEX COMPOSITION OF HBM. THIS PROBLEM IS HUGE FROM ANALYTICAL POINT OF VIEW, SINCE DUE TO THAT DETECTION OF ALL HBM LIPIDS DURING ONE ANALYTICAL RUN IS LIMITED. THUS, SAMPLE PREPARATION STEP CONSTITUTES A CRUCIAL STEP IN UNTARGETED LIPIDOMIC ANALYSIS OF HBM, ESPECIALLY WHEN SEMI-QUANTITATIVE ANALYSIS IS ASSUMED. HEREIN, WE PRESENT A COMPARISON OF PUBLISHED...
-
Medium-Voltage Drives: Challenges and existing technology
PublicationThe article presents an overview of state-of-art solutions, advances, and design and research trends in medium-voltage (MV) drive technologies - and also discusses the challenges and requirements associated with the use of such drives. The choice and deployment of MV drives in industries are associated with numerous requirements related to the front-end converter (grid side) and inverter (machine side). The focus is on solutions...
-
Gossiping by energy-constrained mobile agents in tree networks
PublicationEvery 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...
-
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...
-
Average Size of a Suffix Tree for Markov Sources
PublicationWe study a suffix tree built from a sequence generated by a Markovian source. Such sources are more realistic probabilistic models for text generation, data compression, molecular applications, and so forth. We prove that the average size of such a suffix tree is asymptotically equivalent to the average size of a trie built over n independentsequences from the same Markovian source. This equivalenceis only known for memoryless...
-
Advances in Sample Preparation
Journals -
Sample Rate Conversion Based on Frequency Response Masking Filter
PublicationThe sample rate conversion with high resampling ratios requires low-pass digital filters with very narrow transition band which results in high computational complexity and makes filter design problematic. Therefore in this work we propose to use the FRM method, which breaks the filter with a narrow transition band into a group of filters with reduced design requirements. These decreases the number of non-zero coefficients and...
-
Influence of plastic deformation on stray magnetic field distribution of soft magnetic steel sample
PublicationThe effect of various combinations of conditions, i.e., presence of the Earth’s magnetic field during and after deformation on the distribution of stray magnetic field of S355 steel sample, which is locally deformed, was investigated. Some of the stages of the experiment were carried out in zero magnetic field. Compensation of the Earth’s magnetic field was obtained by the application of a pair of Helmholtz coils. These coils are...
-
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...
-
A decision-making system supporting selection of commanded outputs for a ship's propulsion system with a controllable pitch propeller
PublicationThe ship's operators have to make decisions regarding the values of commanded outputs (commanded engine speed and pitch ratio) which ensure maximum vessel speed and minimum fuel consumption. Obviously, the presented decision problems are opposed. Therefore, there is a need for a compromise solution that enables more flexible vessel voyage planning. This paper deals with development of a computer-aided system supporting selection...
-
Visual Lip Contour Detection for the Purpose of Speech Recognition
PublicationA method for visual detection of lip contours in frontal recordings of speakers is described and evaluated. The purpose of the method is to facilitate speech recognition with visual features extracted from a mouth region. Different Active Appearance Models are employed for finding lips in video frames and for lip shape and texture statistical description. Search initialization procedure is proposed and error measure values are...
-
INFLUENCE OF A VERTEX REMOVING ON THE CONNECTED DOMINATION NUMBER – APPLICATION TO AD-HOC WIRELESS NETWORKS
PublicationA minimum connected dominating set (MCDS) can be used as virtual backbone in ad-hoc wireless networks for efficient routing and broadcasting tasks. To find the MCDS is an NP- complete problem even in unit disk graphs. Many suboptimal algorithms are reported in the literature to find the MCDS using local information instead to use global network knowledge, achieving an important reduction in complexity. Since a wireless network...