Filters
total: 504
filtered: 432
Search results for: edge subdivision
-
Methodology of the Morphometry Study on Baltic Herring
PublicationAcoustic techniques are used in the estimation of the abundance of Baltic herring. Investigations of the relationship between the Baltic herring individual target strength TS and the total fish length L, significant in the acoustic assessment, demonstrated its de-pendence on the study area location. It motivated the detailed analysis of the relationship between herring from the southern Baltic ICES Subdivisions 24, 25, and 26,...
-
Tuning the Wettability of a Thin Polymer Film by Gradually Changing the Geometry of Nanoscale Pore Edges
Publication -
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...
-
Laser beam angular stabilization system based on a compact interferometer and a precise double-wedge deflector
Publication -
Yields and Time-of-Flight Spectra of Neutral High-Rydberg Fragments at the K Edges of the CO2 Molecule
PublicationWe have studied the production of neutral fragments in high-Rydberg (HR) states at the C 1s and O 1s edges of the CO2 molecule by performing two kinds of experiments. First, the yields of neutral HR fragments were measured indirectly by ionizing such fragments in a static electric field and by collecting resulting singly charged positive ions as a function of the photon energy. Such measurements reveal not only excitations below...
-
On domination multisubdivision number of unicyclic graphs
PublicationThe paper continues the interesting study of the domination subdivision number and the domination multisubdivision number. On the basis of the constructive characterization of the trees with the domination subdivision number equal to 3 given in [H. Aram, S.M. Sheikholeslami, O. Favaron, Domination subdivision number of trees, Discrete Math. 309 (2009), 622–628], we constructively characterize all connected unicyclic graphs with...
-
An experimental study of self-sensing concrete enhanced with multi-wall carbon nanotubes in wedge splitting test and DIC
PublicationConcrete is the worldwide most utilized construction material because of its very good performance, forming ability, long-term durability, and low costs. Concrete is a brittle material prone to cracking. Extensive cracking may impact durability and performance over time considerably. The addition of a small amount of carbon nanotubes (CNT) increases the concrete’s overall electrical conductivity, enabling internal structure...
-
Searching by Heterogeneous Agents
PublicationIn this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search problem by considering edge-labeled graphs. In such setting a searcher, once a search strategy initially decides on the label of the searcher, can be present on an edge only if the label of the searcher and the label of the edge are the same. We prove...
-
Scene Segmentation Basing on Color and Depth Images for Kinect Sensor
PublicationIn this paper we propose a method for segmenting single images from Kinect sensor by considering both color and depth information. The algorithm is based on a series of edge detection procedures designed for particular features of the scene objects. RGB and HSV color planes are separately analyzed in the first step with Canny edge detector, resulting in overall color edges mask. In depth images both clear boundaries and smooth...
-
Core–shell excitation of isoxazole at the C, N, and O K-edges – an experimental NEXAFS and theoretical TD-DFT study
PublicationThe near-edge X-ray absorption fine structure (NEXAFS) spectra of the gas-phase isoxazole molecule have been measured by collecting total ion yields at the C, N, and O K-edges. The spectral structures have been interpreted using time-dependent density functional theory (TD-DFT) with the short-range corrected SRC2-BLYP exchange–correlation functional. Experimental and calculated energies of core excitations are generally in good...
-
Searching by heterogeneous agents
PublicationIn this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search problem by considering edge-labeled graphs: once a search strategy initially assigns labels to the searchers, each searcher can be only present on an edge of its own label. We prove that this problem is not monotone even for trees and we give instances...
-
Three-fast-searchable graphs
PublicationIn the edge searching problem, searchers move from vertex to vertex in a graph to capture an invisible, fast intruder that may occupy either vertices or edges. Fast searching is a monotonic internal model in which, at every move, a new edge of the graph G must be guaranteed to be free of the intruder. That is, once all searchers are placed the graph G is cleared in exactly |E(G)| moves. Such a restriction obviously necessitates...
-
Tool Wear Monitoring Using Improved Dragonfly Optimization Algorithm and Deep Belief Network
PublicationIn recent decades, tool wear monitoring has played a crucial role in the improvement of industrial production quality and efficiency. In the machining process, it is important to predict both tool cost and life, and to reduce the equipment downtime. The conventional methods need enormous quantities of human resources and expert skills to achieve precise tool wear information. To automatically identify the tool wear types, deep...
-
Rozpoznawanie oraz lokalizacja w obrazie przewodów linii wysokiego napięcia
PublicationW pracy przedstawiono opracowany algorytm rozpoznawania oraz lokalizacji przewodów linii wysokiego napięcia na podstawie obrazu horyzontalnego. Procedura detekcji przewodu została podzielona na trzy etapy. Pierwszy etap zawiera algorytm wykrywania krawędzi wykazujący największą czułość na krawędzie poziome, a jednocześnie brak czułości na krawędzie pionowe. Efektem jest znaczna redukcja liczby wykrytych krawędzi w porównaniu do...
-
Distributed graph searching with a sense of direction
PublicationIn this work we consider the edge searching problem for vertex-weighted graphs with arbitrarily fast and invisible fugitive. The weight function w provides for each vertex v the minimum number of searchers required to guard v, i.e., the fugitive may not pass through v without being detected only if at least w(v) searchers are present at v. This problem is a generalization of the classical edge searching problem, in which one has...
-
Application of genetic algorithms in graph searching problem
PublicationGraph searching is a common approach to solving a problem of capturing a hostile intruder by a group of mobile agents. We assume that this task is performed in environment which we are able to model as a graph G. The question asked is how many agents are needed to capture an arbitrary fast, invisible and smart intruder. This number is called the (edge) search number of G. The strategy which must be performed by agents is called...
-
Eine Eeue Technik zur Präzisen Rissfortschrittsmessung im DCB oder im Keilversuch = A novel technique for precise crack length measurement in the DCB or wedge test
PublicationDiverse methods have been tried to study crack length, most basic relying on direct, or microscopic, observation of the crack tip position. Optical correlation, both lasermoiré and speckle interferometry, a single strain gauge and displacement sensorshave also been employed. Crack length measurement is, however, delicate. We present a novel method making use of strain gauges attached to one of the adherends.
-
Badania stanu technicznego ścianek szczelnych strony południowej i północnej komory południowej śluzy Dzierżno
PublicationPrace dotyczyły badań nieniszczących łączników (zamków) Paine`a oraz ścianek szczelnych. Ściany boczne komory południowej śluzy Dzierżno zbudowane są ze stalowych pasów blachy o grubości około 16mm i długości 22m połączonych ze sobą wzdłuż dłuższej krawędzi za pomocą zamków Peine`a. System ten umożliwia uzyskanie szczelnego połączenia na całej długości ścianki. Zaawansowany proces korozji spowodował rozszczelnienie połączenia...
-
Mechanism of Li nucleation at graphite anodes and mitigation strategies
PublicationLithium metal plating is a critical safety issue in Li-ion cells with graphite anodes, and contributes significantly to ageing, drastically limiting the lifetime and inducing capacity loss. Nonetheless, the nucleation mechanism of metallic Li on graphite anodes is still poorly understood. But in-depth understanding is needed to rationally design mitigation measures. In this work, we conducted FirstPrinciples studies to elucidate...
-
An assessment of teeth quality of the mini gang saw blade
PublicationIn this work, the assessment of the effect of the operating time (90 min.) of the mini gang saw blades during sawing Scotch pine (Pinus sylvestris L.) samples upon changes of the saw blade teeth sharpness (bluntness), which was defined as an effective radius of the nose ρ , has been described. The research activities have been carried out on the Nikon Ti-S optical microscope equipped with the Nikon DS-30W camera allowing high-speed...
-
Graph Decomposition for Memoryless Periodic Exploration
PublicationWe consider a general framework in which a memoryless robot periodically explores all the nodes of a connected anonymous graph by following local information available at each vertex. For each vertex v, the endpoints of all edges adjacent to v are assigned unique labels within the range 1 to deg (v) (the degree of v). The generic exploration strategy is implemented using a right-hand-rule transition function: after entering vertex...
-
Comparison of reproduction strategies in genetic algorithm approach to graph searching
Publicationgenetic algorithms (ga) are a well-known tool used to obtain approximate solutions to optimization problems. successful application of genetic algorithm in solving given problem is largely dependant on selecting appropriate genetic operators. selection, mutation and crossover techniques play a fundamental role in both time needed to obtain results and their accuracy. in this paper we focus on applying genetic algorithms in calculating...
-
Formation and Growth of the Crack in Bonded Joints Under Mode I Fracture: Substrate Deflection at Crack Vicinity
PublicationAdhesive bonding is now commonly used in aircraft, cars, boats, etc. In these applications, thin panels are often bonded. In such thin structures, heterogeneous mechanical loading along the bondline edge (or potential crack front), is likely to arise due to 3D structural effects. The crack front and its vicinity is a special region, in that it is where structural properties of the adherend material meet those of the adhesive (discontinuity)....
-
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...
-
Algorytmy wykrywania krawędzi w obrazie
PublicationWykrywanie krawędzi jest pierwszym etapem w cyfrowym przetwarzaniu obrazów. Operacja ta polega na usunięciu informacji takich jak kolor czy też jasność, a pozostawieniu jedynie krawędzi. Efektem tej operacji jest znaczna redukcja ilości danych do dalszej analizy. Pozwala to na zastosowanie w następnych etapach bardziej złożonych algorytmów rozpoznawania obiektów na podstawie kształtu. W artykule zaprezentowano zastosowanie algorytmów...
-
ASSESSMENT OF WEAR OF THE BANDSAW TEETH IN INDUSTRIAL CONDITIONS
PublicationA methodology for measuring bandsaw tooth wear is presented in this paper. This type of measurement is proposed as an alternative way of determining tooth wear in industrial conditions. The method is based on determining the KE value, i.e., the distance of the radius of the rounded cutting edge of the tooth and the intersection of the surface of the back and the surface of the face of the cutting wedge of the bandsaw tooth....
-
A New Adaptive Method for the Extraction of Steel Design Structures from an Integrated Point Cloud
PublicationThe continuous and intensive development of measurement technologies for reality modelling with appropriate data processing algorithms is currently being observed. The most popular methods include remote sensing techniques based on reflected-light digital cameras, and on active methods in which the device emits a beam. This research paper presents the process of data integration from terrestrial laser scanning (TLS) and image data...
-
Analysis of the Surface Stereometry of Alloyed Austenitic Steel after Fibre Laser Cutting using Confocal Microscopy
PublicationThe paper extends the concept of cut edge quality and examines the fibre laser cutting process. A Prima Power Platino Fiber Evo device with a reference speed (RS) of 3500 mm/min was used for laser cutting. In order to analyse the influence of the laser cutting speed on the cut edge quality of X5CrNi18-10 stainless steel sheets, macroscopic studies were conducted on a stereoscopic microscope and surface stereometry on a confocal...
-
Optimal backbone coloring of split graphs with matching backbones
PublicationFor a graph G with a given subgraph H, the backbone coloring is defined as the mapping c: V(G) -> N+ such that |c(u)-c(v)| >= 2 for each edge uv \in E(H) and |c(u)-c(v)| >= 1 for each edge uv \in E(G). The backbone chromatic number BBC(G;H) is the smallest integer k such that there exists a backbone coloring with max c(V(G)) = k. In this paper, we present the algorithm for the backbone coloring of split graphs with matching backbone.
-
Pupil detection supported by Haar feature based cascade classifier for two-photon vision examinations
PublicationThe aim of this paper is to present a novel method, called Adaptive Edge Detection (AED), of extraction of precise pupil edge coordinates from eye image characterized by reflections of external illuminators and laser beams. The method is used for monitoring of pupil size and position during psychophysical tests of two-photon vision performed by dedicated optical set-up. Two-photon vision is a new phenomenon of perception of short-pulsed...
-
Proposal of New Tracer Concentration Model in Lung PCT Study Comparison with Commonly Used Gamma-variate Model
PublicationPerfusion computed tomography (pCT) is one of the methods that enable non-invasive imaging of the hemodynamics of organs and tissues. On the basis of pCT measurements, perfusion parameters such as blood flow (BF), blood volume (BV), mean transit time (MTT) and permeability surface (PS) are calculated and then used for quantitative evaluation of the tissue condition. To calculate perfusion parameters it is necessary to approximate...
-
A CNN based coronavirus disease prediction system for chest X-rays
PublicationCoronavirus disease (COVID-19) proliferated globally in early 2020, causing existential dread in the whole world. Radiography is crucial in the clinical staging and diagnosis of COVID-19 and offers high potential to improve healthcare plans for tackling the pandemic. However high variations in infection characteristics and low contrast between normal and infected regions pose great challenges in preparing radiological reports....
-
Implementacja w FPGA algorytmu detekcji krawędzi obrazu w czasie rzeczywistym
PublicationW artykule przedstawiono projekt architektury oraz implementację układową toru przetwarzania wstępnego obrazu z modułem detekcji krawędzi. Układ został zaimplementowany w FPGA Intel Cyclone. Zrealizowany moduł wykorzystuje pięć wybranych algorytmów wykrywania krawędzi, w tym Robertsa, Sobela i Prewitt.
-
T-colorings, divisibility and circular chromatic number
PublicationLet T be a T-set, i.e., a finite set of nonnegative integers satisfying 0 ∈ T, and G be a graph. In the paper we study relations between the T-edge spans espT (G) and espd⊙T (G), where d is a positive integer and d ⊙ T = {0 ≤ t ≤ d (max T + 1): d |t ⇒ t/d ∈ T} . We show that espd⊙T (G) = d espT (G) − r, where r, 0 ≤ r ≤ d − 1, is an integer that depends on T and G. Next we focus on the case T = {0} and show that espd⊙{0} (G) =...
-
Fracture in composite/aluminium joints of variable adhesive properties
PublicationA strain gauge technique recently developed with the wedge test, for estimating crack length and, thus, the fracture energy of structural adhesive bonding, has been employed on a system in which one adherend had two types of surface treatment. Simple polishing and polishing with subsequent sandblasting were the treatments used, with a distinct straight line, perpendicular to the sample edges, separating the two. Despite the clear-cut...
-
Backscattering properties of southern Baltic herring
PublicationReliable TS(L) relationship is required to improve acoustic algorithms of abundanceestimation of Baltic herring. The relationships, empirically obtained in different parts of theBaltic Sea, produce up to 8 dB – difference in the herring TS. In order to develop an accurateTS(L) relationship, it is important to analyze factors controlling the TS variability. Thepossible impact of the regional difference...
-
Polynomial triset metric for unrooted phylogenetic trees
Publicationthe following paper presents a polynomial triset metric for unrooted phylogenetic trees (based on weighted bipartite graphs and the method of determining a minimum edge cover) and its basic characteristics. also a list of further directions of research and examples of the wider use of this metric is presented.
-
Brief Announcement: Energy Constrained Depth First Search
PublicationDepth first search is a natural algorithmic technique for constructing a closed route that visits all vertices of a graph. The length of such route equals, in an edge-weighted tree, twice the total weight of all edges of the tree and this is asymptotically optimal over all exploration strategies. This paper considers a variant of such search strategies where the length of each route is bounded by a positive integer B (e.g. due...
-
Kodowanie kanałowe w cyfrowych systemach komórkowych
PublicationW referacie przedstawiono metody kodowania kanałowego stosowane w systemach komórkowych. Zaprezentowano kody splotowe stosowane w systemie komórkowym GSM i podsystemach GPRS i EDGE. Przedstawiono również kody splotowe i turbokody stosowane w systemie UMTS i standardzie LTE.
-
Block graphs with large paired domination multisubdivision number
PublicationThe paired domination multisubdivision number of a nonempty graph G, denoted by msdpr(G), is the smallest positive integer k such that there exists an edge which must be subdivided k times to increase the paired domination number of G. It is known that msdpr(G) ≤ 4 for all graphs G. We characterize block graphs with msdpr(G) = 4.
-
Multi-DBD plasma actuator for flow separation control around NACA 0012 and NACA 0015 airfoil models
PublicationIn this paper application of innovative multi-DBD plasma actuator for flow separation control is presented. The influence of the airflowgenerated by this actuator on the flow around NACA 0012 and NACA 0015 airfoil models was investigated. The results obtained from 2D PIVmeasurements showed that the multi-DBD actuator with floating interelectrode can be attractive for leading and trailing edge separation control.
-
Experimental tests of lintel hybrid beams
PublicationThe results of experimental tests of lintel hybrid beams made of air concrete and prestressed concrete were presented in paper. Blocks of air concrete was a protective element for the construction one. The length of hybrid beams was 3.0 m, while total height 27 cm. It was assumed that hybrid beams will work in the simply-supported scheme (with a 10 cm support) loaded uniformly over the entire length. The object of the tests were...
-
Scanning networks with cactus topology
PublicationThe family of Pursuit and Evasion problems is widelystudied because of its numerous practical applications,ranging from communication protocols to cybernetic andphysical security. Calculating the search number of a graphis one of most commonly analyzed members of this problemfamily. The search number is the smallest number of mobileagents required to capture an invisible and arbitrarily fastfugitive, for instance piece of malicious...
-
On-line Ramsey Numbers of Paths and Cycles
PublicationConsider a game played on the edge set of the infinite clique by two players, Builder and Painter. In each round, Builder chooses an edge and Painter colours it red or blue. Builder wins by creating either a red copy of $G$ or a blue copy of $H$ for some fixed graphs $G$ and $H$. The minimum number of rounds within which Builder can win, assuming both players play perfectly, is the \emph{on-line Ramsey number} $\tilde{r}(G,H)$. In...
-
SAWING PROCESS AS A NEW ALTERNATIVE WAY OF DETERMINING SOME WOOD PROPERTIES
PublicationCutting forces (power) could be considered from a point of view of modern fracture mechanics. The developed cutting model, derived from fracture mechanics, includes work of separation (fracture toughness) in addition to plasticity and friction, and also dullness of the cutting edge described by the cutting edge radius. Moreover, forecasting of the shear plane angle for the cutting models, broaden possibilities of energetic effects...
-
Direct determination of paraquat herbicide by square-wave voltammetry by two-step transfer mechanism at heterogeneous boron-doped carbon nanowall electrodes
PublicationBoron-doped carbon nanowalls (B:CNW) versus boron-doped diamond (BDD) materials were investigated for the effective electrochemical detection of highly toxic herbicide paraquat (PQ). Depending on the surface morphology and functional groups of BDD and B:CNWs, the electrochemical absorption and detection of the target analyte PQ revealed different detection mechanisms. The surface absorption mechanism was mainly observed for BDD,...
-
On some open questions for Ramsey and Folkman numbers
PublicationWe discuss some of our favorite open questions about Ramsey numbers and a related problem on edge Folkman numbers. For the classical two-color Ramsey numbers, we first focus on constructive bounds for the difference between consecutive Ramsey numbers. We present the history of progress on the Ramsey number R(5,5) and discuss the conjecture that it is equal to 43.
-
Pressure Pulsations in Turbine Blade Seal
PublicationThe paper presents the results of experimental investigations into pressure forces generated in a turbine labyrinth seal. The experiments were performed on a single-stage air model turbine of the impulse type. The performed experimental research proved that in a shroud clearance the pressure pulsates and the effects of the nozzle trailing edge thickness as well as the influence of the rotor blades are observed. The exemplary results...
-
AN ALTERNATIVE WAY OF DETERMINING MECHANICAL PROPERTIES OF WOOD BY MEASURING CUTTING FORCES
PublicationThe cutting force is an energetic effect of splitting material, and might be therefore considered from a point of view of modern fracture mechanics. The dedicated mathematical model developed for description of the wood cutting has been developed here on the base of fracture theory, and includes work of separation (fracture toughness) in addition to the material plasticity and friction. The effect of the cutting edge dullness is...
-
The Backbone Coloring Problem for Bipartite Backbones
PublicationLet G be a simple graph, H be its spanning subgraph and λ≥2 be an integer. By a λ -backbone coloring of G with backbone H we mean any function c that assigns positive integers to vertices of G in such a way that |c(u)−c(v)|≥1 for each edge uv∈E(G) and |c(u)−c(v)|≥λ for each edge uv∈E(H) . The λ -backbone chromatic number BBCλ(G,H) is the smallest integer k such that there exists a λ -backbone coloring c of G with backbone H satisfying...