Search results for: edge subdivision
-
Stable Field Electron Emission and Plasma Illumination from Boron and Nitrogen Co‐Doped Edge‐Rich Diamond‐Enhanced Carbon Nanowalls
PublicationSuperior field electron emission (FEE) characteristics are achieved in edge-rich diamond-enhanced carbon nanowalls (D-ECNWs) grown in a single-step chemical vapor deposition process co-doped with boron and nitrogen. The structure consists of sharp, highly conductive graphene edges supplied by a solid, diamond-rich bottom. The Raman and transmission electron microscopy studies reveal a hybrid nature of sp3-diamond and sp2-graphene...
-
Double wedge prism based beam deflector for precise laser beam steering
Publication -
Size effects in wedge indentation predicted by a gradient-enhanced crystal-plasticity model
Publication -
Accurate and continuous adhesive fracture energy determination using an instrumented wedge test
PublicationThe wedge test and the related double cantilever beam test are practical methods of assessing structural adhesive fracture energy. In the former, and to a lesser extent the latter, a recognised problem is the difficulty of following the length of the growing crack, required to calculate fracture energy with any accuracy. We present a novel method of measurement of crack length that has the advantages of being accurate and allowing...
-
Modelling of acoustic backscattering by southern Baltic herring
PublicationAssessment of Baltic herring abundance can be carried out using acoustic techniques. Analysis of the relationship between the Baltic herring individual target strength, TS, and the total fish length, L, important for the acoustic assessment, showed the relationship to be dependent on the location of the study area. This finding motivated a detailed analysis of the relationship for the herring occurring in the southern Baltic...
-
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 -
The XAS spectra of O-K edges, Fe-L edges in pristine, La-, and Nb-doped SFM in 3 states: as-prepared, reduced and reoxidized
Open Research DataThis dataset contains the normalized and exported to *.txt spectra for x-ray absorption spectroscopy. The samples analyzed were strontium ferrite molybdate based, doped with lanthanum and niobium. The powders were measured in as-prepared state (denoted in filename as AP), reduced (red) and reoxidized (reox). The filenames are written accordingly: Edge_(optional:...
-
Interactions: Ege Journal of British and American Studies
Journals -
Dataset of non-isomorphic graphs of the coloring types (K4,K4;n), 1<n<R(4,4)
Open Research DataFor K4 graph, a coloring type (K4,K4;n) is such an edge coloring of the full Kn graph, which does not have the K4 subgraph in the first color (representing by no edges in the graph) or the K4 subgraph in the second color (representing by edges in the graph).The Ramsey number R(4,4) is the smallest natural number n such that for any edge coloring of...
-
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...
-
Dataset of non-isomorphic graphs of the coloring types (K4,Km-e;n), 2<m<5, 1<n<R(K4,Km-e)
Open Research DataFor K4 and Km-e graphs, a coloring type (K4,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K4 subgraph in the first color (representing by no edges in the graph) or the Km-e subgraph in the second color (representing by edges in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K4,Km-e)...
-
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...
-
Dataset of non-isomorphic graphs of the coloring types (Km,K3-e;n), 4<m<8, 1<n<R(Km,K3-e)
Open Research DataFor Km and K3-e graphs, a coloring type (Km,K3-e;n) is such an edge coloring of the full Kn graph, which does not have the Km subgraph in the first color (representing by no edges in the graph) or the K3-e subgraph in the second color (representing by edges in the graph). K3-e means the full Km graph with one edge removed.The Ramsey number R(Km,K3-e)...
-
ACM/IEEE Symposium on Edge Computing
Conferences -
Dataset of non-isomorphic graphs of the coloring types (K3,Km-e;n), 2<m<7, 1<n<R(K3,Km-e).
Open Research DataFor K3 and Km-e graphs, a coloring type (K3,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K3 subgraph in the first color (representing by no edges in the graph) or the Km-e subgraph in the second color (representing by edges in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K3,Km-e)...
-
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...
-
Dataset of non-isomorphic graphs of the coloring types (K3,Km;n), 2<m<7, 1<n<R(3,m)
Open Research DataFor K3 and Km graphs, a coloring type (K3,Km;n) is such an edge coloring of the full Kn graph, which does not have the K3 subgraph in the first color (representing by no edges in the graph) or the Km subgraph in the second color (representing by edges in the graph).The Ramsey number R(3,m) is the smallest natural number n such that for any edge coloring...
-
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...
-
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...
-
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...
-
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...
-
IEEE International Conference on Fog and Edge Computing
Conferences -
EGE-Revista de Expresion Grafica en la Edificacion
Journals -
A collection of directed graphs for the minimum cycle mean weight computation
Open Research DataThis dataset contains definitions of the 16 directed graphs with weighted edges that were described in the following paper: Paweł Pilarczyk, A space-efficient algorithm for computing the minimum cycle mean in a directed graph, Journal of Mathematics and Computer Science, 20 (2020), no. 4, 349--355, DOI: 10.22436/jmcs.020.04.08, URL: http://dx.doi.org/10.22436/jmcs.020.04.08 These...
-
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...
-
A New Adaptive Method for the Extraction of Steel Design Structures from an Integrated Point Cloud
Open Research DataA new automatic and adaptive algorithm for edge extraction from a random point cloud was developed and presented herein. The proposed algorithm was tested using real measurement data. The developed algorithm is able to realistically reduce the amount of redundant data and correctly extract stable edges representing the geometric structures of a studied...
-
X-ray images of Baltic herring
Open Research DataA methodology for studying the geometric shape of Baltic herring swimbladders including the optimal way of catching, transporting and storing fish, the X-ray measurements and the X-ray image analysis, that does not change the natural shape of the fish swimbladder was developed. Fish for research was obtained in the area of the Polish coastal zone...
-
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...
-
Dataset of non-isomorphic graphs being coloring types (K5-e,Km-e;n), 2<m<5, 1<n<R(K5-e,Km-e)
Open Research DataFor K5-e and Km-e graphs, the type coloring (K5-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K5-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K5-e,Km-e) is the smallest...
-
Dataset of non-isomorphic graphs being coloring types (K6-e,Km-e;n), 2<m<5, 1<n<R(K6-e,Km-e)
Open Research DataFor K6-e and Km-e graphs, the type coloring (K6-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K6-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed. The Ramsey number R(K6-e,Km-e) is the smallest...
-
Maciej Wierzbowski dr inż.
People -
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...
-
Dataset of non-isomorphic graphs being coloring types (K4-e,Km-e;n), 2<m<7, 1<n<R(K4-e,Km-e)
Open Research DataFor K4-e and Km-e graphs, the type coloring (K4-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K4-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K4-e,Km-e) is the smallest...
-
Tomasz Wąsowicz dr hab.
PeopleTomasz Wąsowicz's research was first related to high-resolution atomic spectroscopy and focused on measurements and analysis of the transition probabilities of the forbidden lines, the hyperfine and isotopic structure of spectral lines of heavy elements, Stark effect in the helium atom. Tomasz Wąsowicz currently studies physicochemical processes occurring during interactions of various forms of radiation with atoms and molecules...
-
Dataset of non-isomorphic graphs being coloring types (K3-e,Km-e;n), 2<m<8, 1<n<R(K3-e,Km-e)
Open Research DataFor K3-e and Km-e graphs, the type coloring (K3-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K3-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K3-e,Km-e) is the smallest...
-
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...
-
Terrestrial Survey Images - Multispectral Exterior Model - Gdansk Church Pw. Św. Wojciecha - Micasense Dual
Open Research DataDataset description: Raw images from photogrammetric survey. Object: Kościół Rzymskokatolicki Pw. Św. WojciechaLocation: Gdansk, Pomerania, PolandDrone type: N/A (terrestrial images)Flight plan: Free - walk around the object with camera. 3 images taken at the point.Target Product: 3D Model - Multispectral ModelDate: 24.04.2022Direct georeferencing:...