Wyszukiwarka
Filtry
wszystkich: 153
wybranych: 127
Filtry wybranego katalogu
Wyniki wyszukiwania dla: K EDGES
-
Yields and Time-of-Flight Spectra of Neutral High-Rydberg Fragments at the K Edges of the CO2 Molecule
PublikacjaWe 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...
-
Core–shell excitation of isoxazole at the C, N, and O K-edges – an experimental NEXAFS and theoretical TD-DFT study
PublikacjaThe 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...
-
On extremal sizes of locally k-tree graphs
PublikacjaA graph G is a locally k-tree graph if for any vertex v the subgraph induced by the neighbours of v is a k-tree, k>=0, where 0-tree is an edgeless graph, 1-tree is a tree. We characterize the minimum-size locally k-trees with n vertices. The minimum-size connected locally k-trees are simply (k + 1)-trees. For k >= 1, we construct locally k-trees which are maximal with respect to the spanning subgraph relation. Consequently, the...
-
On some Zarankiewicz numbers and bipartite Ramsey Numbers for Quadrilateral
PublikacjaThe Zarankiewicz number z ( m, n ; s, t ) is the maximum number of edges in a subgraph of K m,n that does not contain K s,t as a subgraph. The bipartite Ramsey number b ( n 1 , · · · , n k ) is the least positive integer b such that any coloring of the edges of K b,b with k colors will result in a monochromatic copy of K n i ,n i in the i -th color, for some i , 1 ≤ i ≤ k . If n i = m for all i , then we denote this number by b k ( m )....
-
Equitable coloring of hypergraphs
PublikacjaA hypergraph is equitablyk-colorable if its vertices can be partitioned into k sets/colorclasses in such a way that monochromatic edges are avoided and the number of verticesin any two color classes differs by at most one. We prove that the problem of equitable 2-coloring of hypergraphs is NP-complete even for 3-uniform hyperstars. Finally, we apply the method of dynamic programming for designing a polynomial-time algorithm to...
-
Bounds on the Cover Time of Parallel Rotor Walks
PublikacjaThe rotor-router mechanism was introduced as a deterministic alternative to the random walk in undirected graphs. In this model, a set of k identical walkers is deployed in parallel, starting from a chosen subset of nodes, and moving around the graph in synchronous steps. During the process, each node maintains a cyclic ordering of its outgoing arcs, and successively propagates walkers which visit it along its outgoing arcs in...
-
Brushing with additional cleaning restrictions
PublikacjaIn graph cleaning problems, brushes clean a graph by traversing it subject to certain rules. We consider the process where at each time step, a vertex that has at least as many brushes as incident, contaminated edges, sends brushes down these edges to clean them. Various problems arise, such as determining the minimum number of brushes (called the brush number) that are required to clean the entire graph. Here, we study a new variant...
-
Bounds on the cover time of parallel rotor walks
PublikacjaThe rotor-router mechanism was introduced as a deterministic alternative to the random walk in undirected graphs. In this model, a set of k identical walkers is deployed in parallel, starting from a chosen subset of nodes, and moving around the graph in synchronous steps. During the process, each node successively propagates walkers visiting it along its outgoing arcs in round-robin fashion, according to a fixed ordering. We consider...
-
Paired domination subdivision and multisubdivision numbers of graphs
PublikacjaThe paired domination subdivision number sdpr(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the paired domination number of G. We prove that the decision problem of the paired domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the paired domination muttisubdivision number of a nonempty graph...
-
Domination subdivision and domination multisubdivision numbers of graphs
PublikacjaThe domination subdivision number sd(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the domination number of G. It has been shown [10] that sd(T)<=3 for any tree T. We prove that the decision problem of the domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the domination multisubdivision number...
-
Towards a classification of networks with asymmetric inputs
PublikacjaCoupled cell systems associated with a coupled cell network are determined by (smooth) vector fields that are consistent with the network structure. Here, we follow the formalisms of Stewart et al (2003 SIAM J. Appl. Dyn. Syst. 2, 609–646), Golubitsky et al (2005 SIAM J. Appl. Dyn. Syst. 4, 78–100) and Field (2004 Dyn. Syst. 19, 217–243). It is known that two non-isomorphic n-cell coupled networks can determine the same sets of...
-
Exploiting multi-interface networks: Connectivity and Cheapest Paths
PublikacjaLet G = (V,E) be a graph which models a set of wireless devices (nodes V) that can communicate by means of multiple radio interfaces, according to proximity and common interfaces (edges E). The problem of switching on (activating) the minimum cost set of interfaces at the nodes in order to guarantee the coverage of G was recently studied. A connection is covered (activated) when the endpoints of the corresponding edge share at...
-
Inner-shell fragmentation of molecules into neutral fragments in high-Rydberg states induced by soft X-ray excitation with pulsed-field ionization
PublikacjaIn the present communication, we will show the results of measurements probing the production of neutral high-Rydberg fragments at the K edges of the molecules containing oxygen and nitrogen atoms. The experiments were performed at the Gas Phase beamline of the Elettra synchrotron radiation laboratory (Trieste, Italy), exploiting a combined soft X-ray excitation with pulsed-field ionization and ion time-of-flight (TOF) spectrometry...
-
Dynamic coloring of graphs
PublikacjaDynamics is an inherent feature of many real life systems so it is natural to define and investigate the properties of models that reflect their dynamic nature. Dynamic graph colorings can be naturally applied in system modeling, e.g. for scheduling threads of parallel programs, time sharing in wireless networks, session scheduling in high-speed LAN's, channel assignment in WDM optical networks as well as traffic scheduling. In...
-
Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees
PublikacjaAn edge coloring of a graph G is called interval edge coloring if for each v ∈ V(G) the set of colors on edges incident to v forms an interval of integers. A graph G is interval colorable if there is an interval coloring of G. For an interval colorable graph G, by the interval chromatic index of G, denoted by χ'_i(G), we mean the smallest number k such that G is interval colorable with k colors. A bipartite graph G is called (α,β)-biregular...
-
Optimal edge-coloring with edge rate constraints
PublikacjaWe consider the problem of covering the edges of a graph by a sequence of matchings subject to the constraint that each edge e appears in at least a given fraction r(e) of the matchings. Although it can be determined in polynomial time whether such a sequence of matchings exists or not [Grötschel et al., Combinatorica (1981), 169–197], we show that several questions about the length of the sequence are computationally intractable....
-
Limited dissolution of transition metals in the nanocrystalline cerium (IV) oxide
PublikacjaNanocrystalline cerium (IV) oxides doped with transition metals have gained significant interest recently, mostly in the field of catalysis. Herein, we present the comprehensive studies on ceria doped with 10 mol.% of transition metals (Mn, Fe, Co, Ni or Cu) synthesized by the reverse microemulsion method. The aim of this work is to study the properties of those materials with the use of different complementary methods like XRD,...
-
angielski
PublikacjaA subset D of V (G) is a dominating set of a graph G if every vertex of V (G) − D has at least one neighbour in D; let the domination number γ(G) be the minimum cardinality among all dominating sets in G. We say that a graph G is γ-q-critical if subdividing any q edges results in a graph with domination number greater than γ(G) and there exists a set of q − 1 edges such that subdividing these edges results in a graph with domination...
-
Recovering Evaluation of Narrow-Kerf Teeth of Mini Sash Gang Saws
PublikacjaSash gang saws with narrow-kerf saw blades are used in the production of glued laminate flooring elements in plants where dry technology is applied. This means that boards or friezes are sawn into top layer lamellae in dry conditions (moisture content of about 10–12%) from expensive wood species, often exotic. The object of this research was stellite-tipped teeth of narrow kerf saw blades sharpened under industrial conditions....
-
Deterministic Rendezvous in Restricted Graphs
PublikacjaIn this paper we consider the problem of synchronous rendezvous in which two anonymous mobile entities (robots) A and B are expected to meet at the same time and point in a graph G = (V;E). Most of the work devoted to rendezvous in graphs assumes that robots have access to the same sets of nodes and edges, where the topology of connections may be initially known or unknown. In our work we assume the movement of robots is restricted...
-
Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs
PublikacjaGiven a graph G= (V, E), the subdivision of an edge e=uv∈E(G) means the substitution of the edge e by a vertex x and the new edges ux and xv. The domination subdivision number of a graph G is the minimum number of edges of G which must be subdivided (where each edge can be subdivided at most once) in order to increase the domination number. Also, the domination multisubdivision number of G is the minimum number of subdivisions...
-
Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks
PublikacjaWe introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is unaware of the corresponding traversal...
-
Rendezvous of heterogeneous mobile agents in edge-weighted networks
PublikacjaWe introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is unaware of the corresponding traversal...
-
Scene Segmentation Basing on Color and Depth Images for Kinect Sensor
PublikacjaIn 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...
-
On Tradeoffs Between Width- and Fill-like Graph Parameters
PublikacjaIn this work we consider two two-criteria optimization problems: given an input graph, the goal is to find its interval (or chordal) supergraph that minimizes the number of edges and its clique number simultaneously. For the interval supergraph, the problem can be restated as simultaneous minimization of the path width pw(G) and the profile p(G) of the input graph G. We prove that for an arbitrary graph G and an integer t ∈ {1,...
-
Network Approach to Increments of RR-intervals for Visualization of Dynamics of Cardiac Regulation
PublikacjaThe transition network for RR -increments is pre- sented in a directed and weighted graph, with vertices represent- ing RR -increments and edges corresponding to the order in a sequence of increments. The adjacency matrix and the transition matrix of this network provide a graphical tool which could be useful in the assessment of cardiac regulation. As an example, the method is applied in detecting differences between diurnal activity...
-
On weak solutions of the boundary value problem within linear dilatational strain gradient elasticity for polyhedral Lipschitz domains
PublikacjaWe provide the proof of an existence and uniqueness theorem for weak solutions of the equilibrium problem in linear dilatational strain gradient elasticity for bodies occupying, in the reference configuration, Lipschitz domains with edges. The considered elastic model belongs to the class of so-called incomplete strain gradient continua whose potential energy density depends quadratically on linear strains and on the gradient of...
-
Tuning the work function of graphite nanoparticles via edge termination
PublikacjaGraphite nanoparticles are important in energy materials applications such as lithium-ion batteries (LIBs), supercapacitors and as catalyst supports. Tuning the work function of the nanoparticles allows local control of lithiation behaviour in LIBs, and the potential of zero charge of electrocatalysts and supercapacitors. Using large scale density functional theory (DFT) calculations, we find that the surface termination of multilayer...
-
Layered Morphology of Gdansk: Past, Present and Future.
PublikacjaThis study aims to analyze the urban fabric and form of the city of Gdańsk based on the Muratorian and Italian school of urban morphology, to deepen the understanding of the morphological process of the urban fabric. It can be seen that the urban fabric of the city is a juxtaposition of all these layers, and based on Muratori’s approach these are indicative of not just the past, present but also the future. The study sample is...
-
Total chromatic sum for trees
PublikacjaThe total chromatic sum of a graph is the minimum sum of colors (natural numbers) taken over all proper colorings of vertices and edges of a graph. We provide infinite families of trees for which the minimum number of colors to achieve the total chromatic sum is equal to the total chromatic number. We construct infinite families of trees for which these numbers are not equal, disproving the conjecture from 2012.
-
Some Progress on Total Bondage in Graphs
PublikacjaThe total bondage number b_t(G) of a graph G with no isolated vertex is the cardinality of a smallest set of edges E'⊆E(G) for which (1) G−E' has no isolated vertex, and (2) γ_t(G−E')>γ_t(G). We improve some results on the total bondage number of a graph and give a constructive characterization of a certain class of trees achieving the upper bound on the total bondage number.
-
Bondage number of grid graphs
PublikacjaThe bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with domination number greater than the domination number of G. Here we study the bondage number of some grid-like graphs. In this sense, we obtain some bounds or exact values of the bondage number of some strong product and direct product of two paths.
-
Comparison of edge detection algorithms for electric wire recognition
PublikacjaEdge detection is the preliminary step in image processing for object detection and recognition procedure. It allows to remove useless information and reduce amount of data before further analysis. The paper contains the comparison of edge detection algorithms optimized for detection of horizontal edges. For comparison purposes the algorithms were implemented in the developed application dedicated to detection of electric line...
-
Evolution of Edges and Porosity of Urban Blue Spaces: A Case Study of Gdańsk
PublikacjaCurrent waterfront studies focus mainly on a land-based perspective, failing to include the water side. Water is, however, not just a resource for port and industrial purposes and an edge to the waterfront; it is also a feature of the waterfront and the complex relation between water and city. Thus, the article suggests that water-land edges need to be re-contextualised, taking into consideration also their shape, functionality,...
-
Pier of the future- investigation of green and blue strategies as tools for modernization of Gdynia's public waterfront
PublikacjaBetween rising water levels and global migration to cities, architects and designers need to critically reimagine the relationship between coastal landscapes and public space. Cities are facing entirely new risks and environmental conditions. Resiliency, infrastructure, and ecology are increasingly common terms, reflecting the growing demand to address the spatial and formal challenges faced by cities worldwide. Rethinking boundaries...
-
Stable Field Electron Emission and Plasma Illumination from Boron and Nitrogen Co‐Doped Edge‐Rich Diamond‐Enhanced Carbon Nanowalls
PublikacjaSuperior 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...
-
Embedded Representations of Wikipedia Categories
PublikacjaIn this paper, we present an approach to building neural representations of the Wikipedia category graph. We test four different methods and examine the neural embeddings in terms of preservation of graphs edges, neighborhood coverage in representation space, and their influence on the results of a task predicting parent of two categories. The main contribution of this paper is application of neural representations for improving the...
-
Rainscreen panels deformations mods
PublikacjaIn rainscreen panels designing simplified calculation models are used. For plate computation simply supported panels or panels with fixed edges are commonly used. Such approximations are subjected to large errors that lead to inefficient rainscreen panels design. In order to develop a method for determining the optimal geometry of the rainscreen panels, that would take into consideration the real stiffness of both continuous and...
-
Investigation of abdomen surface deformation due to life excitation: implications for implant selection and orientation in laparoscopic ventral hernia repair
PublikacjaVentral hernia is a common medical problem. Statistically there are around 10% recurrences of the sickness. The authors' former investigation proved edges of the hernia orifice displacements to be one of the factors causing recurrence. Thus, experimental investigation of the abdomen surface deformation due to some normal activities of people is studied.The extreme strains, their localization and directions are identified. The acquired...
-
Improving Savonius rotor performance by shaping its blade edges
PublikacjaThe article presents the results of the numerical analysis of the flow inside the Savonius rotor. Particular at-tention has been paid to the vicinity of the blade gap in order to recognise the mechanisms controlling the flow in this area. The conclusions resulting from the analysis made the basis for an attempt to improve Savonius turbine performance via shaping rotor blade edges. The paper presents selected characteristic flow...
-
Broad Stopband, Low-Loss, and Ultra-Compact Dual-Mode Bandpass Filter Based on HMSIRC
PublikacjaIn this investigation, an ultra-compact dual-mode bandpass filter (BPF) with a wide stopband re-sponse is realized by using a half-mode substrate-integrated rectangular cavity (HMSIRC). The HMSIRC resonator is designed with a cavity that is rectangular in shape and has metallic vias along three of the sides. The fourth side is open-ended and contains microstrip feed lines. For the purpose of constructing a magnetic wall, a rectangular...
-
Implementation of the Boundary Element Method to Two-Dimensional Heat Transfer with Thermal Bridge Effects
PublikacjaThe work presents an application of the boundary element method applied to a two-dimensional conductive heat transfer. The algorithm of the method is explained and its advantages are outlined. Green's function as a fundamental solution for Poisson's equation in two dimensions was used and the direct approach was applied. The presented results concern building construction elements as typical cases of thermal bridges. Some properties...
-
Three-fast-searchable graphs
PublikacjaIn 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
PublikacjaIn 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...
-
Scheduling of identical jobs with bipartite incompatibility graphs on uniform machines. Computational experiments
PublikacjaWe consider the problem of scheduling unit-length jobs on three or four uniform parallel machines to minimize the schedule length or total completion time. We assume that the jobs are subject to some types of mutual exclusion constraints, modeled by a bipartite graph of a bounded degree. The edges of the graph correspond to the pairs of jobs that cannot be processed on the same machine. Although the problem is generally NP-hard,...
-
Processing of Hydroacoustic and LiDAR Data for Three-dimensional Surface Reconstruction
PublikacjaThe technologies of sonar and laser scanning are commonly used for obtaining spatial information about underwater and over ground environments in the form of point clouds. Since this data model has known disadvantages, a more practical solution of visualising such data involves the creation of solid three-dimensional meshes composed of edges and facets. In this paper, several methods for 3D shape reconstruction of data obtained...
-
Functionality of road safety devices - identification and analysis of factors
PublikacjaRoad safety devices are designed to protect road users from the risk of injury or death. The principal type of restraint is the safety barrier. Deployed on sites with the highest risk of run-off-road accidents, safety barriers are mostly found on bridges, flyovers, central reservations, and on road edges which have fixed obstacles next to them. If properly designed and installed, safety barriers just as other road safety devices,...
-
A prototype femtosecond laser system for MEMS fabrication
Publikacjan this article, the concept of a prototype femtosecond laser micromachining system and a femtosecond solid-state Yb:KYW laser is presented. Ultrashort laser pulses have many advantages over the long pulses in laser micromachining, due to their unique ability to interact with different materials without transferring heat to them. This allows very precise and pure laser-processing, clean cuts and sharp edges. A femtosecond laser...
-
Influence of local bush wear on water lubricated sliding bearing load carrying capacity
PublikacjaOne of main problems concerning water-lubricated bearings is their durability. There are known cases of bearings with life time measured in decades, and some, whose refurbishment was necessary just days after start-up. Obtaining stable fluid film friction plays key role in the durability of these bearings. Unfortunately, their load-carrying capacity is limited due to water's low-viscosity. The conducted experimental...
-
Risk Analysis by a Probabilistic Model of the Measurement Process
PublikacjaThe aim of the article is presentation of the testing methodology and results of examination the probabilistic model of the measurement process. The case study concerns the determination of the risk of an incorrect decision in the assessment of the compliance of products by measurement. Measurand is characterized by the generalized Rayleigh distribution. The model of the meas-urement process was tested in parallel mode by six risk...