IT Services Centre - Administrative Units - Bridge of Knowledge

Search

IT Services Centre

Filters

total: 118

  • Category
  • Year
  • Options

clear Chosen catalog filters disabled

Catalog Publications

Year 2024
Year 2023
  • Edge coloring of graphs of signed class 1 and 2
    Publication

    - DISCRETE APPLIED MATHEMATICS - Year 2023

    Recently, Behr (2020) introduced a notion of the chromatic index of signed graphs and proved that for every signed graph (G, σ) it holds that ∆(G) ≤ χ′(G,σ) ≤ ∆(G) + 1, where ∆(G) is the maximum degree of G and χ′ denotes its chromatic index. In general, the chromatic index of (G, σ) depends on both the underlying graph G and the signature σ. In the paper we study graphs G for which χ′(G, σ) does not depend on σ. To this aim we...

    Full text to download in external service

  • Optimization of Bread Production Using Neuro-Fuzzy Modelling

    Automation of food production is an actively researched domain. One of the areas, where automation is still not progressing significantly is bread making. The process still relies on expert knowledge regarding how to react to procedure changes depending on environmental conditions, quality of the ingredients, etc. In this paper, we propose an ANFIS-based model for changing the mixer speed during the kneading process. Although the...

    Full text to download in external service

  • Photos and rendered images of LEGO bricks

    The paper describes a collection of datasets containing both LEGO brick renders and real photos. The datasets contain around 155,000 photos and nearly 1,500,000 renders. The renders aim to simulate real-life photos of LEGO bricks allowing faster creation of extensive datasets. The datasets are publicly available via the Gdansk University of Technology “Most Wiedzy” institutional repository. The source files of all tools used during...

    Full text available to download

  • Potyczki algorytmiczne, czyli Alicja i Bogdan w nowych sytuacjach. 3. Alicja i Bogdan remontują mieszkanie.
    Publication

    Poniższe zagadki nawiązują z jednej strony do problemu kafelkowania płaszczyzny, który jest nierozstrzygalny, z drugiej do problemu rozkroju wstęgi, który jest NP-trudny. Jednakże przypadki szczególne, które tu rozważamy, nie są tak trudne i mogą być rozwiązane za pomocą algorytmów działających w czasie wielomianowym.

    Full text to download in external service

Year 2022
  • Active Learning Based on Crowdsourced Data

    The paper proposes a crowdsourcing-based approach for annotated data acquisition and means to support Active Learning training approach. In the proposed solution, aimed at data engineers, the knowledge of the crowd serves as an oracle that is able to judge whether the given sample is informative or not. The proposed solution reduces the amount of work needed to annotate large sets of data. Furthermore, it allows a perpetual increase...

    Full text available to download

  • How to Sort Them? A Network for LEGO Bricks Classification

    LEGO bricks are highly popular due to the ability to build almost any type of creation. This is possible thanks to availability of multiple shapes and colors of the bricks. For the smooth build process the bricks need to properly sorted and arranged. In our work we aim at creating an automated LEGO bricks sorter. With over 3700 different LEGO parts bricks classification has to be done with deep neural networks. The question arises...

    Full text available to download

  • Infinite chromatic games

    In the paper we introduce a new variant of the graph coloring game and a new graph parameter being the result of the new game. We study their properties and get some lower and upper bounds, exact values for complete multipartite graphs and optimal, often polynomial-time strategies for both players provided that the game is played on a graph with an odd number of vertices. At the end we show that both games, the new and the classic...

    Full text available to download

  • Segmentacja obrazów medycznych przy ograniczonej liczbie adnotacji

    W dziedzinie badań klinicznych i opieki zdrowotnej tradycyjne podejście w uczeniu głębokim polegające na wykorzystaniu dużych zbiorów danych jest trudne w realizacji. Przyczyną takiego stanu rzeczy są koszty znakowania obrazów medycznych, zwłaszcza w przypadku segmentacji obrazów medycznych. Jest to żmudna operacja, która zazwyczaj wymaga intensywnego znakowania pikseli wykonanego przez ekspertów – lekarzy. W tym rozdziale zaprezentowano...

    Full text to download in external service

  • Video of LEGO Bricks on Conveyor Belt Dataset Series
    Publication

    The dataset series titled Video of LEGO bricks on conveyor belt is composed of 14 datasets containing video recordings of a moving white conveyor belt. The recordings were created using a smartphone camera in Full HD resolution. The dataset allows for the preparation of data for neural network training, and building of a LEGO sorting machine that can help builders to organise their collections.

    Full text available to download

  • Weighted 2-sections and hypergraph reconstruction
    Publication

    In the paper we introduce the notion of weighted 2-sections of hypergraphs with integer weights and study the following hypergraph reconstruction problems: (1) Given a weighted graph , is there a hypergraph H such that is its weighted 2-section? (2) Given a weighted 2-section , find a hypergraph H such that is its weighted 2-section. We show that (1) is NP-hard even if G is a complete graph or integer weights w does not exceed...

    Full text to download in external service

Year 2021
  • ANFIS-Based NPC Population Control in Video Games
    Publication

    Modern computer games aim at providing rich, vivid worlds. The aim is to encourage the player to explore and interact with the in-game world. To describe the complex relations between in-game NPCs and their surrounding fuzzy logic is used. The paper presents ANFIS based population control in the video game. We present an approach allowing stabilizing the number of NPCs in-game by providing a certain amount of food to the environment....

    Full text available to download

  • Hierarchical 2-step neural-based LEGO bricks detection and labeling
    Publication

    LEGO bricks are extremely popular and allow the creation of almost any type of construction due to multiple shapes available. LEGO building requires however proper brick arrangement, usually done by shape. With over 3700 different LEGO parts this can be troublesome. In this paper, we propose a solution for object detection and annotation on images. The solution is designed as a part of an automated LEGO bricks arrangement. The...

    Full text available to download

  • Licencjonowanie oprogramowania

    Wolne i otwarte oprogramowanie przeżywa ostatnimi laty rozkwit. Co raz więcej przedsiębiorstw komercyjnych opiera rozwój swoich firm na otwartym oprogramowaniu. Zarówno mali, jak i duzi gracze mają świadomość komplikacji współczesnych systemów i niemożności samodzielnego ich rozwoju. Z pomocą przychodzi otwarte podejście do wytwarzania oprogramowania. Wymaga to jednak pewnego zrozumienia uwarunkowań prawnych, a w szczególności...

    Full text available to download

  • Optimization of Data Assignment for Parallel Processing in a Hybrid Heterogeneous Environment Using Integer Linear Programming

    In the paper we investigate a practical approach to application of integer linear programming for optimization of data assignment to compute units in a multi-level heterogeneous environment with various compute devices, including CPUs, GPUs and Intel Xeon Phis. The model considers an application that processes a large number of data chunks in parallel on various compute units and takes into account computations, communication including...

    Full text available to download

  • T-colorings, divisibility and circular chromatic number

    Let T be a T-set, i.e., a finite set of nonnegative integers satisfying 0 ∈ T, and G be a graph. In the paper we study relations between the T-edge spans espT (G) and espd⊙T (G), where d is a positive integer and d ⊙ T = {0 ≤ t ≤ d (max T + 1): d |t ⇒ t/d ∈ T} . We show that espd⊙T (G) = d espT (G) − r, where r, 0 ≤ r ≤ d − 1, is an integer that depends on T and G. Next we focus on the case T = {0} and show that espd⊙{0} (G) =...

    Full text available to download

Year 2020