Search results for: GLOBAL EDGE ALLIANCE - Bridge of Knowledge

Search

Search results for: GLOBAL EDGE ALLIANCE

Search results for: GLOBAL EDGE ALLIANCE

  • Global edge alliances in graphs

    In the paper we introduce and study a new problem of finding a minimum global edge alliance in a graph which is related to the global defensive alliance (Haynes et al., 2013; Hedetniemi, 2004) and the global defensive set (Lewoń et al., 2016). We proved the NP-completeness of the global edge alliance problem for subcubic graphs and we constructed polynomial time algorithms for trees. We found the exact values of the size of the...

    Full text available to download

  • Tight bounds on global edge and complete alliances in trees

    In the talk the authors present some tight upper bounds on global edge alliance number and global complete alliance number of trees. Moreover, we present our NP-completeness results from [8] for global edge alliances and global complete alliances on subcubic bipartite graphs without pendant vertices. We discuss also polynomial time exact algorithms for finding the minimum global edge alliance on trees [7] and complete alliance...

    Full text to download in external service

  • Global defensive secure structures

    Publication

    Let S ⊂ V (G) for a given simple non-empty graph G. We define for any nonempty subset X of S the predicate SECG,S(X) = true iff |NG[X]∩S| ≥ |NG[X]\S|. Let H be a non-empty family of graphs such that for each vertex v ∈ V (G) there is a subgraph H of G containing v and isomorphic to a member of H. We introduce the concept of H-alliance extending the concept of global defensive secure structures. By an H-alliance in a graph G we...

    Full text to download in external service

  • Justyna Szostak dr inż.

    I Gdańsk University of Technology: Chair of the Rector’s Internationalization Committee (October 2020 - Present) Erasmus + Coordinator for students and staff members, Faculty of Applied Physics and Mathematics (Mar 2017 - Present) Dean's Proxy for Internationalization, Faculty of Applied Physics and Mathematics (October 2020 - Present) Coordinator of the International Relations Office of the Faculty of Applied Physics and...

  • Modele i algorytmy dla grafowych struktur defensywnych

    Publication

    - Year 2023

    W niniejszej pracy przeprowadzono analizę złożoności istnienia struktur defensywnych oraz równowag strategicznych w grafach. W przypadku struktur defensywnych badano modele koalicji defensywnych, zbiorów defensywnych i koalicji krawędziowych – każdy z nich w wersji globalnej, tj. z wymogiem dominacji całego grafu. W przypadku modeli równowagi strategicznej badano równowagę strategiczną koalicji defensywnych, równowagę strategiczną...

    Full text available to download

  • Global defensive sets in graphs

    In the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if | N [ X ] ∩ S | ≥ | N [ X ] \ S | holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...

    Full text available to download

  • Leading Edge

    Journals

    ISSN: 1070-485X

  • Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs

    Publication

    - Opuscula Mathematica - Year 2016

    Given 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...

    Full text available to download

  • Optimal edge-coloring with edge rate constraints

    Publication

    - NETWORKS - Year 2013

    We 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....

    Full text to download in external service

  • Edge-coloring of 3-uniform hypergraphs

    We consider edge-colorings of 3-uniform hypergraphs which is a natural generalization of the problem of edge-colorings of graphs. Various classes of hypergraphs are discussed and we make some initial steps to establish the border between polynomial and NP-complete cases. Unfortunately, the problem appears to be computationally difficult even for relatively simple classes of hypergraphs.

    Full text available to download

  • On minimum cost edge searching

    Publication

    We consider the problem of finding edge search strategies of minimum cost. The cost of a search strategy is the sum of searchers used in the clearing steps of the search. One of the natural questions is whether it is possible to find a search strategy that minimizes both the cost and the number of searchers used to clear a given graph G. We call such a strategy ideal. We prove, by an example, that ideal search strategies do not...

    Full text available to download

  • Influence of edge subdivision on the convex domination number

    We study the influence of edge subdivision on the convex domination number. We show that in general an edge subdivision can arbitrarily increase and arbitrarily decrease the convex domination number. We also find some bounds for unicyclic graphs and we investigate graphs G for which the convex domination number changes after subdivision of any edge in G.

    Full text available to download

  • Bounds on the vertex-edge domination number of a tree

    Publication

    - COMPTES RENDUS MATHEMATIQUE - Year 2014

    A 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...

    Full text available to download

  • Life Science Alliance

    Journals

    eISSN: 2575-1077

  • Edge and Pair Queries-Random Graphs and Complexity

    Publication

    - ELECTRONIC JOURNAL OF COMBINATORICS - Year 2023

    We investigate two types of query games played on a graph, pair queries and edge queries. We concentrate on investigating the two associated graph parameters for binomial random graphs, and showing that determining any of the two parameters is NP-hard for bounded degree graphs.

    Full text available to download

  • Comparison of edge detection algorithms for electric wire recognition

    Publication

    Edge 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...

    Full text to download in external service

  • Aleksandra Parteka dr hab. inż.

    About me: I am an associate professor and head of doctoral studies at the Faculty of Management and Economics, Gdansk University of Technology (GdanskTech, Poland).  I got my MSc degree in Economics from Gdansk University of Technology (2003) and Universita’ Politecnica delle Marche (2005), as well as MA degree in Contemporary European Studies from Sussex University (2006, with distinction).  I received my PhD in Economics...

  • Badanie jakości transmisji w podsystemie EDGE.

    Publication

    Przedstawiono wyniki badań symulacyjnych jakości transmisji w podsystemie EDGE, będącego rozwinięciem systemu GSM w kierunku systemu trzeciej generacji. Uzyskane wyniki odnoszą się do szybkiej transmisji danych, realizowanej w oparciu o komutację kanałów ECSD oraz komutację pakietów EGPRS dla wybranych środowisk propagacyjnych.

  • Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees

    An 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...

    Full text to download in external service

  • Big Data and the Internet of Things in Edge Computing for Smart City

    Publication

    - Year 2019

    Requests expressing collective human expectations and outcomes from city service tasks can be partially satisfied by processing Big Data provided to a city cloud via the Internet of Things. To improve the efficiency of the city clouds an edge computing has been introduced regarding Big Data mining. This intelligent and efficient distributed system can be developed for citizens that are supposed to be informed and educated by the...

    Full text to download in external service

  • On the approximation of the UWB dipole elliptical arms with stepped-edge polygon

    A simple method of approximation of the ellipticalpatch with stepped-edge polygon is proposed as an introductionto wider studies over the planar ultrawideband (UWB) antennas.The general idea is to replace the elliptical patch with an equivalentpolygonal patch, with minimum loss in the performance. Theprinciples of the proposed method are presented in this letter, aswell as the results of performed numerical studies and its experimentalverification....

    Full text to download in external service

  • A Method and Device for 3D Recognition of Cutting Edge Micro Geometry

    Publication

    - Drvna Industrija - Year 2014

    A very useful method was successfully applied in the investigation of tools for machining wood and wood based composites. It allows scanning of the cutting edge micro geometry in three dimensions and reproducing it in a virtual space as a 3D surface. The application of the method opens new possibilities of studying tool wear by scanning, including the calculation of volume loss and other analysis of tool wedge geometry along and...

    Full text available to download

  • Edge-Computing based Secure E-learning Platforms

    Publication

    - Year 2022

    Implementation of Information and Communication Technologies (ICT) in E-Learning environments have brought up dramatic changes in the current educational sector. Distance learning, online learning, and networked learning are few examples that promote educational interaction between students, lecturers and learning communities. Although being an efficient form of real learning resource, online electronic resources are subject to...

    Full text available to download

  • Tuning the work function of graphite nanoparticles via edge termination

    Publication
    • M. P. Mercer
    • A. Bhandari
    • C. Peng
    • J. Dziedzic
    • C. Skylaris
    • D. Kramer

    - PHYSICAL CHEMISTRY CHEMICAL PHYSICS - Year 2024

    Graphite 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...

    Full text available to download

  • Edge-Guided Mode Performance and Applications in Nonreciprocal Millimeter-Wave Gyroelectric Components

    The analogies between the behavior of gyromagnetic and gyroelectric nonreciprocal structures, the use of the simple transfer matrix approach, and the edge-guided (EG) wave property, supported in a parallel plate model for integrated magnetized semiconductor waveguide, are investigated in those frequency regions, where the effective permittivity is negative or positive. As with their ferrite counterparts, the leakage of the EG waves...

    Full text to download in external service

  • The edge of the [dis]order

    Publication
    • R. Barelkowski

    - Year 2012

    Full text to download in external service

  • An O ( n log n ) algorithm for finding edge span of cacti

    Let G=(V,E) be a nonempty graph and xi be a function. In the paper we study the computational complexity of the problem of finding vertex colorings c of G such that: (1) |c(u)-c(v)|>=xi(uv) for each edge uv of E; (2) the edge span of c, i.e. max{|c(u)-c(v)|: uv belongs to E}, is minimal. We show that the problem is NP-hard for subcubic outerplanar graphs of a very simple structure (similar to cycles) and polynomially solvable for...

    Full text available to download

  • Space and Landscape in a Global Context

    e-Learning Courses
    • R. Orlik
    • I. Mironowicz

    Module SPACE AND LANDSCAPE IN A GLOBAL CONTEXT (2022/2023, autumn semester) Objective The objective of the module is to debate different approaches to managing spatial development and contemporary issues in a global context. The course is founded on the students' knowledge about urban planning and instruments used to make them better places both for people and the environment.  Course proceedings Lectures and classes run online...

  • Some Artificial Intelligence Driven Algorithms For Mobile Edge Computing in Smart City

    Publication

    - Year 2019

    Smart mobile devices can share computing workload with the computer cloud that is important when artificial intelligence tools support computer systems in a smart city. This concept brings computing on the edge of the cloud, closer to citizens and it can shorten latency. Edge computing removes a crucial drawback of the smart city computing because city services are usually far away from citizens, physically. Besides, we introduced...

    Full text to download in external service

  • The maximum edge-disjoint paths problem in complete graphs

    Publication

    Rozważono problem ścieżek krawędziowo rozłącznych w grafach pełnych. Zaproponowano wielomianowe algorytmy: 3.75-przybliżony (off-line) oraz 6.47-przybliżony (on-line), poprawiając tym samym wyniki wcześniej znane z literatury [P. Carmi, T. Erlebach, Y. Okamoto, Greedy edge-disjoint paths in complete graphs, in: Proc. 29th Workshop on Graph Theoretic Concepts in Computer Science, in: LNCS, vol. 2880, 2003, pp. 143-155]. Ponadto...

    Full text available to download

  • Global Trends 2022

    e-Learning Courses
    • L. Segreto

    The course reflects on the different models of capitalism, starting with the debate on "Varieties of capitalism". It will deal with the relationships between historical dimension, juridical and economic cultures, institutions, financial markets and ownership structures in today's world economy. The aim of the course is trying to give an answer to a couple of very simple questions: why economic systems react in a different way...

  • Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks

    Publication

    - Year 2014

    We 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...

    Full text to download in external service

  • Rendezvous of heterogeneous mobile agents in edge-weighted networks

    We 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...

    Full text available to download

  • POLDER AND CITY: SUSTAINING WATER LANDSCAPES ON AN URBAN EDGE

    Publication

    - Year 2016

    The question investigated in this paper is how to maintain the environmental quality of the polder landscape encompassing the city in the condition of urban pressure on this landscape. On the basis of theoretical approaches, historical surveys and introductory study models new ideas are tested on the case study of Gdansk, a city located in the Vistula River delta in northern Poland. Research shows that the city was created as a...

  • Interval Edge-Coloring of Graphs

    Publication

    - Year 2004

    Full text to download in external service

  • Interval edge-coloring of graphs.

    Publication

    - Year 2004

    Rozdział poświęcony prezentacji modelu zwartego kolorowania krawędziowego grafów i jego znanych własności. Szczególny nacisk położono na opis klas grafów dających się pokolorować zwarcie w czasie wielomianowym. Omówiono także stratność jako miarę niepodatności grafu na kolorowanie zwarte.

  • Mixed graph edge coloring

    Publication

    - DISCRETE MATHEMATICS - Year 2009

    W pracy rozważany jest problem kolorowania krawędzi grafu mieszanego, tj. grafu zawierającego zawiero skierowane, jak i nieskierowane krawędzie. Motywację do badań stanowią zagadnienia komunikacyjne z zakresu szeregowania zadań.

    Full text to download in external service

  • Novel Analytic-Numerical Model of Free Convection: with Leading Edge Considered

    Publication

    A novel solution of the free convection boundary problem is represented in analytical form for velocity and temperature for an isothermal vertical plate, as an example. These fields are built as a Taylor Series in the x coordinate with coefficients as functions of the vertical coordinate (y). We restrict ourselves by cubic approximation for both functions. The basic Navier-Stokes and Fourier-Kirchhoff equations and boundary conditions...

    Full text available to download

  • QUANTITATIVE EASING POLICY AND ITS IMPACT ON THE GLOBAL ECONOMY

    Publication

    Based on the analysis of the impact of quantitative easing policies on the global economy, there was concluded that the world’s largest central banks and widespread debt stimulation have created the model of economic growth. This model was based on the productivity growth. The lack of productivity growth in the developed world, the active integration of developing countries (first of all China and India) in the global economy have...

    Full text available to download

  • An Analysis of Sustainability Reporting Practices of the Global Airline Industry

    Publication

    - Year 2022

    Sustainability reporting (SR) has become a standard practice for many organisations worldwide. The purpose of this paper is to explore and develop our understanding of the global airline industry’s SR practices. Content analysis was employed to map which reporting frameworks the global commercial airline industry has recently used to report their non-financial impacts. Additionally, comparisons were made in the application of SR...

    Full text available to download

  • Global value chains and wages under different wage setting mechanisms

    This study examines whether, and how, differences in wage bargaining schemes shape the relationship between global value chains (GVCs) and the wages of workers while considering both GVC participation and position in GVC. Our dataset is derived from the European Structure of Earnings Survey (SES), containing employee–employer data from 18 European countries, merged with sectoral data from the World Input-Output Database (WIOD)....

    Full text available to download

  • Big Data from Sensor Network via Internet of Things to Edge Deep Learning for Smart City

    Publication

    - Year 2021

    Data from a physical world is sampled by sensor networks, and then streams of Big Data are sent to cloud hosts to support decision making by deep learning software. In a smart city, some tasks may be assigned to smart devices of the Internet of Things for performing edge computing. Besides, a part of workload of calculations can be transferred to the cloud hosts. This paper proposes benchmarks for division tasks between an edge...

    Full text to download in external service

  • Entrepreneurship nests in a polish edge city

    Publication

    - Year 2020

    The last two decades in Poland have been a period of both a dynamic development of the small and medium-sized enterprise sector and a transformation of the city surrounding territories. This development began during the economy transformation after 1989. Population migration and movement of economic entities away from central cities resulted in development of territorial structures within some Polish suburban areas, defined as...

    Full text to download in external service

  • Compact cyclic edge-colorings of graphs

    Publication

    Artykuł jest poświęcony modelowi zwartego cyklicznego kolorowania krawędzi grafów. Ten wariant kolorowania jest stosowany w modelowaniu uszeregowań w systemach produkcyjnych, w których proces produkcyjny ma charakter cykliczny. W pracy podano konstrukcje grafów, które nie zezwalają na istnienie pokolorowania w rozważanym modelu. Wykazano także kilka własności teoretycznych, takich jak ograniczenia górne na liczbę kolorów w optymalnym...

    Full text to download in external service

  • Edge ranking and searching in partial orders

    Publication

    Artykuł jest poświęcony problemowi konstrukcji optymalnej (wymagającej minimalnej ilości porównań/zapytań) strategii wyszukiwania elementu w częściowym porządku. W pracy wskazano związki pomiędzy tym problemem oraz uporządkowanym kolorowaniem krawędzi grafów, co implikuje liniowy algorytm dla częściowych porządków o strukturze drzewa. Pokazano również, że znalezienie optymalnej strategii jest problemem obliczeniowo trudnym dla...

    Full text available to download

  • Global and regional economic inequality: Methods of measurement and evidences

    Publication

    - Year 2019

    The lack of countries’ statistical income data, comparable across countries and years, seems to be the main reason of controversial conjectures concerning global inequality and its evolution over time. In the databases, which purport to collect income data on a worldwide scale, only some summary statistics (quantile income shares, means, Gini indices) are presented. Therefore, the development of efficient methods of extracting...

    Full text to download in external service

  • Space and Landscape in a Global Context - 2023/24

    e-Learning Courses
    • R. Orlik
    • I. Mironowicz
    • A. Zimnicka

    Module SPACE AND LANDSCAPE IN A GLOBAL CONTEXT (2022/2023, autumn semester) Objective The objective of the module is to debate different approaches to managing spatial development and contemporary issues in a global context. The course is founded on the students' knowledge about urban planning and instruments used to make them better places both for people and the environment.  Course proceedings Lectures and classes run online...

  • The condition of economies. Do most valuable global brands matter?

    Research background: Brands are considered to be the most valuable asset of a company. Some of them achieve spectacular global results. The significance of global brands is proved by the fact that their value is often greater than the sum of all company’s net assets. Purpose of the article: The aim of this article is to highlight that brand value does not only create company’s value, but also leverages economies. The Authors claim...

    Full text available to download

  • Mission impossible for cellular internalization: When porphyrin alliance with UiO-66-NH2 MOF gives the cell lines a ride

    Publication
    • S. Ahmadi
    • V. Jajarmi
    • M. Ashrafizadeh
    • A. Zarrabi
    • J. T. Haponiuk
    • M. Saeb
    • E. C. Lima
    • M. Rabiee
    • N. Rabiee

    - JOURNAL OF HAZARDOUS MATERIALS - Year 2022

    Is it possible to accelerate cell internalization by hybridization of nanomaterials? Herein we support the realization of using metal-organic frameworks (MOFs) with the assistance of rigid porphyrin structure (H2TMP) aimed at drug loading, drug release, relative cell viability, and targeted in vitro drug delivery. There are several MOFs, i.e., UiO-66-NH2 (125 ± 12.5 nm), UiO-66-NH2 @H2TMP (160 ± 14 nm), UiO-66-NH2 @H2TMP@DOX, and...

    Full text to download in external service

  • Doing well by doing good — CSR in a global context

    Publication

    Motivation: Nowadays, there is a general understanding that stakeholders are crucial for the successful enterprise. There is also a need to think about Corporate Social Responsibility (CSR) in a global context. Never before corporations enjoyed so much power and authority. Corporations need to evolve, re-think their strategies and change their processes accordingly. However, as of now, there is no agreed way of measuring overall...

    Full text available to download