Search
Filters
total: 7140
-
Catalog
- Publications 5264 available results
- Journals 53 available results
- Conferences 70 available results
- People 97 available results
- Projects 7 available results
- Laboratories 1 available results
- Research Teams 1 available results
- e-Learning Courses 209 available results
- Events 37 available results
- Open Research Data 1401 available results
displaying 1000 best results Help
Search results for: PARTIAL GRID,CONNECTED SEARCH NUMBER,ON-LINE SEARCHING,PURSUIT-EVASION,DISTRIBUTED SEARCHING
-
Finding small-width connected path decompositions in polynomial time
PublicationA connected path decomposition of a simple graph $G$ is a path decomposition $(X_1,\ldots,X_l)$ such that the subgraph of $G$ induced by $X_1\cup\cdots\cup X_i$ is connected for each $i\in\{1,\ldots,l\}$. The connected pathwidth of $G$ is then the minimum width over all connected path decompositions of $G$. We prove that for each fixed $k$, the connected pathwidth of any input graph can be computed in polynomial-time. This answers...
-
Minimal number of periodic points for C^1 self-maps of compact simply-connected manifolds
PublicationNiech f będzie odwzorowaniem gładkiej zwartej i jednospójnej rozmaitości o wymiarze większym lub równym 3. W pracy zdefiniowany został topologiczny niezmiennik będący najlepszym dolnym oszacowaniem liczby punktów periodycznych w klasie gładkich odwzorowań homotopijnych z f.
-
Minimal number of periodic points for smooth self-maps of simply-connected manifolds
Open Research DataThe problem of finding the minimal number of periodic points in a given class of self-maps of a space is one of the central questions in periodic point theory. We consider a closed smooth connected and simply-connected manifold of dimension at least 4 and its self-map f. The topological invariant D_r[f] is equal to the minimal number of r-periodic points...
-
On-line ranking of split graphs
PublicationA vertex ranking of a graph G is an assignment of positive integers (colors) to the vertices of G such that each path connecting two vertices of the same color contains a vertex of a higher color. Our main goal is to find a vertex ranking using as few colors as possible. Considering on-line algorithms for vertex ranking of split graphs, we prove that the worst case ratio of the number of colors used by any on-line ranking algorithm...
-
Distributed Databases
e-Learning Courses -
Harmony Search for Self-configuration of Fault–Tolerant and Intelligent Grids
PublicationIn this paper, harmony search algorithms have been proposed to self-configuration of fault-tolerant grids for big data processing. Self-configuration of computer grids lies in the fact that new computer nodes are automatically configured by software agents and then integrated into the grid. A base node works due to several configuration parameters that define some aspects of data communications and energy power consumption. We...
-
Integration of cloud-based services into distributed workflow systems: challenges and solutions
PublicationThe paper introduces the challenges in modern workflow management in distributed environments spanning multiplecluster, grid and cloud systems. Recent developments in cloud computing infrastructures are presented and are referring howclouds can be incorporated into distributed workflow management, aside from local and grid systems considered so far. Severalchallenges concerning workflow definition, optimisation and execution are...
-
An algorithmic approach to estimating the minimal number of periodic points for smooth self-maps of simply-connected manifolds
Publication -
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...
-
Charakterystyka środowiska Knowledge Grid
PublicationZorganizowanie wiedzy zgromadzonej w Internecie to współcześnie ważne zagadnienie badawcze. Artykuł opisuje środowisko Knowledge Grid i mechanizmy jego działania. Wiedza przechowywana w Knowledge Grid może zostać zorganizowana w trójwymiarową strukturę. Opracowany został również Knowledge Grid Operating Language, który jest językiem służącym do operowania na danych udostępnianych w tym środowisku. Za jego pomocą możliwe jest umieszczenia...
-
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 a 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....
-
Crowdsourcing and Volunteer Computing as Distributed Approach for Problem Solving
PublicationIn this paper, a combination between volunteer computing and crowdsourcing is presented. Two paradigms of the web computing are described, analyzed and compared in detail: grid computing and volunteer computing. Characteristics of BOINC and its contribution to global Internet processing are shown with the stress put onto applications the system can facilitate and problems it can solve. An alternative instance of a grid computing...
-
Unicyclic graphs with equal total and total outer-connected domination numbers
PublicationLet G = (V,E) be a graph without an isolated vertex. A set D ⊆ V (G) is a total dominating set if D is dominating and the in- duced subgraph G[D] does not contain an isolated vertex. The total domination number of G is the minimum cardinality of a total domi- nating set of G. A set D ⊆ V (G) is a total outer–connected dominating set if D is total dominating and the induced subgraph G[V (G)−D] is a connected graph. The total outer–connected...
-
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...
-
Distributed infrastructure of self-organizing service servers
PublicationThis paper presents an idea of creating distributed system consisting of autonomous self-organizing service providers. It shows a real implemented system allowing for dynamic service search without interaction with client based on the inter-servers communication. Moreover presented system can be easily enriched with new elements without the need for restarting already existing servers.
-
Depth Images Filtering In Distributed Streaming
PublicationIn this paper, we propose a distributed system for point cloud processing and transferring them via computer network regarding to effectiveness-related requirements. We discuss the comparison of point cloud filters focusing on their usage for streaming optimization. For the filtering step of the stream pipeline processing we evaluate four filters: Voxel Grid, Radial Outliner Remover, Statistical Outlier Removal and Pass Through....
-
Some Optimization Methods for Simulations in Volunteer and Grid Systems
PublicationIn this chapter, some optimization methods have been presented for improving performance of simulations in the volunteer and grid computing system called Comcute. Some issues related to the cloud computing can be solved by presented approaches as well as the Comcute platform can be used to simulate execution of expensive and energy consuming long-term tasks in the cloud environment. In particular, evolutionary algorithms as well...
-
Harmony Search to Self-Configuration of Fault-Tolerant Grids for Big Data
PublicationIn this paper, harmony search algorithms have been proposed to self-configuration of fault-tolerant grids for big data processing. Some tasks related to big data processing have been considered. Moreover, two criteria have been applied to evaluate quality of grids. The first criterion is a probability that all tasks meet their deadlines and the second one is grid reliability. Furthermore, some intelligent agents based on harmony...
-
DEPTH IMAGES FILTERING IN DISTRIBUTED STREAMING
PublicationIn this paper we discuss the comparison of point cloud filters focusing on their applicability for streaming optimization. For the filtering stage within a stream pipeline processing we evaluate three filters: Voxel Grid, Pass Through and Statistical Outlier Removal. For the filters we perform series of the tests aiming at evaluation of changes of point cloud size and transmitting frequency (various fps ratio). We propose a distributed...
-
Searching for in vitro biomarkers of susceptibility to prostate and cervical cancers by analysis of chromosomal instability, γ-H2AX foci, polymorphisms in DNA repair genes and apoptosis
Publication -
N-(1-Piperidinepropionyl)amphotericin B methyl ester (PAME) - a new derivative of the antifungal antibiotic amphotericin B: Searching for the mechanism of its reduced
PublicationZ zastosowaniem techniki monowarstw Langmuira zbadano naturę oddziaływań pochodnej antybiotyku przeciwgrzybowego amfoterycyny B o obniżonej toksyczności tj. estru metylowego N-(1-piperydynopropionylo)amfoterycyny B (PAME) z komponentami błon biologicznych takich jak: ergosterol, cholesterol i modelowy fosfolipid DPPC i stwierdzono, że zróżnicowanie tych oddziaływań jest podstawą obniżonej toksyczności związku.
-
Estimates for minimal number of periodic points for smooth self-maps of simply-connected manifolds
Open Research DataWe consider a closed smooth connected and simply-connected manifold of dimension at least 4 and its self-map f. The topological invariant Dr[f] is equal to the minimal number of r-periodic points in the smooth homotopy class of f. We assume that r is odd and all coefficients b(k) of so-called periodic expansion of Lefschetz numbers of iterations are...
-
Neural Architecture Search for Skin Lesion Classification
PublicationDeep neural networks have achieved great success in many domains. However, successful deployment of such systems is determined by proper manual selection of the neural architecture. This is a tedious and time-consuming process that requires expert knowledge. Different tasks need very different architectures to obtain satisfactory results. The group of methods called the neural architecture search (NAS) helps to find effective architecture...
-
Profitability criteria of partial cogeneration in nuclear power plant.
PublicationIn this paper, profitability criteria and calculation methodology of profitability conditions for partial cogeneration in nuclear power plant (NPP) was presented. Considered NPP supplies electricity to consumers through public power system, whereas heat is expected to be supplied to consumption regions via long-distance heat transport line. First proposed profitability criterion was total annual costs of electricity and heat delivered...
-
Waldemar Korłub dr inż.
PeopleWaldemar Korłub obtained an Eng. degree in 2011, MSc.Eng. degree in 2012 and PhD in Computer Science in 2017 granted by the Faculty of Electronics, Telecommunications and Informatics at Gdansk University of Technology. His research interests include: distributed systems mainly grid and cloud computing platforms, autonomous systems capable of self-optimization, self-management, self-healing and self-protection, artificial intelligence...
-
Józef Kotus dr hab. inż.
People -
Isolation Number versus Domination Number of Trees
PublicationIf G=(VG,EG) is a graph of order n, we call S⊆VG an isolating set if the graph induced by VG−NG[S] contains no edges. The minimum cardinality of an isolating set of G is called the isolation number of G, and it is denoted by ι(G). It is known that ι(G)≤n3 and the bound is sharp. A subset S⊆VG is called dominating in G if NG[S]=VG. The minimum cardinality of a dominating set of G is the domination number, and it is denoted by γ(G)....
-
Design of the LLC Filter for AC Grid-Based Converter
PublicationThis paper emphasizes reducing harmonic distortion in the electrical current delivered by photovoltaic (PV) inverters to the power grid. It highlights the issue of significant harmonic components present in the output voltage of inverters, which is attributed to pulse width modulation (PWM) switching techniques. This necessitates the deployment of LCL filters as a strategic approach to limit current harmonics effectively. Additionally,...
-
Liczby Ramseya on-line dla różnych klas grafów
PublicationRozpatrujemy grę rozgrywaną na nieskończonej liczbie wierzchołków, w której każda runda polega na wskazaniu krawędzi przez jednego gracza - Budowniczego oraz pokolorowaniu jej przez drugiego gracza - Malarkę na jeden z dwóch kolorów, czerwony lub niebieski. Celem Budowniczego jest zmuszenie Malarki do stworzenia monochromatycznej kopii wcześniej ustalonego grafu H w jak najmniejszej możliwej liczbie ruchów. Zakładamy, że gracze...
-
Approximation Strategies for Generalized Binary Search in Weighted Trees
PublicationWe consider the following generalization of the binary search problem. A search strategy is required to locate an unknown target node t in a given tree T. Upon querying a node v of the tree, the strategy receives as a reply an indication of the connected component of T\{v} containing the target t. The cost of querying each node is given by a known non-negative weight function, and the considered objective is to minimize the total...
-
A NOTE ON ON-LINE RAMSEY NUMBERS FOR QUADRILATERALS
PublicationWe consider on-line Ramsey numbers defined by a game played between two players, Builder and Painter. In each round Builder draws an the edge and Painter colors it either red or blue, as it appears. Builder’s goal is to force Painter to create a monochromatic copy of a fixed graph H in as few rounds as possible. The minimum number of rounds (assuming both players play perfectly) is the on-line Ramsey number \widetilde{r}(H) of...
-
Propagation Characteristics of Partial Discharges in an Oil-Filled Power Transformer
PublicationPower transformers are among the most important assets in the power transmission and distribution grid. However, they suffer from degradation and possible faults causing major electrical and financial losses. Partial discharges (PDs) are used to identify the insulation health status and their degradation level. PDs are incipient, low-magnitude faults caused by localized dielectric breakdown. Those activities emit signals in many...
-
Issues of Estimating the Maximum Distributed Generation at High Wind Power Participation
PublicationThis paper presents the methods of estimating the maximum power that can be connected to the power system in distributed generation sources. Wind turbine generator systems (WTGS) were selected as the subject for analysis. Nonetheless, the considerations presented in this paper are only general and also apply to other types of power sources, including the sources that are not considered part of distributed generation.
-
Multi agent grid systems
PublicationThis chapter presents an idea of merging grid and volunteer systemswith multi agent systems. It gives some basics concerning multi agentsystem and the most followed standard. Some deliberations concerningsuch an existing systems were made in order to finally present possibilities of introducing agents into the Comcute system.
-
SMART GRID TECHNOLOGIES IN ELECTRIC POWER SUPPLY SYSTEMS OF PUBLIC TRANSPORT
PublicationNowadays the issue of electric energy saving in public transport is becoming a key area of interest which is connected both with a growth in environmental awareness of the society and an increase in the prices of fuel and electricity. It can be achieved by improving the usage of regenerative breaking. In 2016 the Przedsiębiorstwo Komunikacji Trolejbusowej (PKT, Trolleybus Transport Company) in Gdynia began practical implementation...
-
Single-phase power electronics transformer with active functions for smart grid
PublicationThis paper presents the control of one cell of a modular single-phase power electronics transformer with active functions for meeting the smart grid concept. In this way, the converter could be used not only as a conventional transformer but also for grid such as reactive power, harmonic elimination and energy storage. The topology of the cell is composed by a bidirectional converter with three stages: a half bridge in the input...
-
Simplified Distribution Grid Modelling for Connection Analyses
PublicationThis paper considers the modelling of medium and low voltage grids for the purpose of connection studies by distribution grid operators. Possible simplifications in grid modelling are discussed, which are acceptable from the viewpoint of the final result. The main driver of the modelling simplification is the MS Excel environment used as the computation platform, and the limitation of time for grid modelling.
-
The searchlight problem for road networks
PublicationWe consider the problem of searching for a mobile intruder hiding in a road network given as the union of two or more lines, or two or more line segments, in the plane. Some of the intersections of the road network are occupied by stationary guards equipped with a number of searchlights, each of which can emit a single ray of light in any direction along the lines (or line segments) it is on. The goal is to detect the intruder,...
-
Frequently updated noise threat maps created with use of supercomputing grid
PublicationAn innovative supercomputing grid services devoted to noise threat evaluation were presented. The services described in this paper concern two issues, first is related to the noise mapping, while the second one focuses on assessment of the noise dose and its influence on the human hearing system. The discussed services were developed within the PL-Grid Plus Infrastructure which accumulates Polish academic supercomputer centers....
-
Urszula Szybowska mgr
PeopleCurrently involved in academic library services and training of Polish and international users of the Gdańsk Tech Library, and Erasmus+ mobility projects. International cooperation coordinator at the Gdańsk Tech Library (2017-2020) ; since 2020 Erasmus+ program coordinator at Gdańsk Tech Library ; social media librarian: Facebook (2018-2023, September), Twitter (@LibraryPG - 2017, October - 2023, September ; @BridgeofData - 2019,...
-
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...
-
Progress on Roman and Weakly Connected Roman Graphs
PublicationA graph G for which γR(G)=2γ(G) is the Roman graph, and if γwcR(G)=2γwc(G), then G is the weakly connected Roman graph. In this paper, we show that the decision problem of whether a bipartite graph is Roman is a co-NP-hard problem. Next, we prove similar results for weakly connected Roman graphs. We also study Roman trees improving the result of M.A. Henning’s A characterization of Roman trees, Discuss. Math. Graph Theory 22 (2002)....
-
A novel method based on adaptive cuckoo search for optimal network reconfiguration and distributed generation allocation in distribution network
Publication -
Acoustic journal bearing - A search for adequate configuration
PublicationClassical non-contact bearings are already used in a number of specialist applications but there are somespecialist areas where they cannot be used for variety of reasons and acoustic sliding bearings could be an alternative. The paper presents the quest for a configuration of an acoustic journal bearing and shows that the overall shape of the bearing and its geometry are of a vital importance for the load capacity oft he bearing....
-
Ancillary services to grids provided with distributed generation
PublicationThe paper introduces system for utilization of the customer-side generated energy. Additionally system can secure some ancillary services to grids. Those services include: current active filtering, load voltage stabilization and in case of grid voltage faults - uninterruptible load supplying (possible with energy storage device). Presented experimental results confirm flexibility of this arrangement in processes of power delivery...
-
Towards Resource Theory of Coherence in Distributed Scenarios
PublicationThe search for a simple description of fundamental physical processes is an important part of quantum theory. One example for such an abstraction can be found in the distance lab paradigm: if two separated parties are connected via a classical channel, it is notoriously difficult to characterize all possible operations these parties can perform. This class of operations is widely known as local operations and classical communication....
-
Creating Dynamic Maps of Noise Threat Using PL-Grid Infrastructure
PublicationThe paper presents functionality and operation results of a system for creating dynamic maps of acoustic noise employing the PL-Grid infrastructure extended with a distributed sensor network. The work presented provides a demonstration of the services being prepared within the PLGrid Plus project for measuring, modeling and rendering data related to noise level distribution in city agglomerations. Specific computational environments,...
-
Bottom Line
Journals -
Geoambiente On-line
Journals -
Ciceroniana On Line
Journals