Department of Algorithms and Systems Modelling - Administrative Units - Bridge of Knowledge

Search

Department of Algorithms and Systems Modelling

Filters

total: 524

  • Category
  • Year
  • Options

clear Chosen catalog filters disabled

Catalog Publications

Year 2024
Year 2023
Year 2022
  • Application of Doubly Connected Dominating Sets to Safe Rectangular Smart Grids
    Publication

    - ENERGIES - Year 2022

    Smart grids, together with the Internet of Things, are considered to be the future of the electric energy world. This is possible through a two-way communication between nodes of the grids and computer processing. It is necessary that the communication is easy and safe, and the distance between a point of demand and supply is short, to reduce the electricity loss. All these requirements should be met at the lowest possible cost....

    Full text available to download

  • Efficacy of intralesional bleomycin in treatment resistant viral warts
    Publication
    • M. Sławińska
    • J. Żółkiewicz
    • K. Pastuszak
    • K. Zawadzka
    • M. Sikorska
    • R. Nowicki
    • M. Sobjanek

    - Przegląd Dermatologiczny - Year 2022

    Introduction Optimal management of treatment-refractory viral warts caused by human papillomavirus is unknown. One of the treatment methods is intralesional bleomycin solution. Objective To determine risk factors for resistant viral warts (not responding to conventional treatments for ≥ 6 months), to determine the effectiveness and safety of intralesional bleomycin in a group of patients with viral warts resistant to conventional...

    Full text available to download

  • 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

  • Grafo-ania, czyli rzecz o grafach i algorytmach. Drzewa Steinera
    Publication

    - Pismo PG - Year 2022

    Problem: na płaszczyźnie leżą 3 punkty. Znajdź czwarty, taki że jego sumaryczna odległość od 3 pozostałych jest minimalna, Pokazujemy jak rozwiązać ten problem i jego uogólnienie.

    Full text to download in external service

  • Grafo-mania, czyli rzecz o grafach i algorytmach. Liczby Ramseya
    Publication

    - Pismo PG - Year 2022

    Zdefiniowano liczby Ramseya i wskazano na trudności obliczeniowe ich wyznaczania już przy niewielkich wartościach takich liczb.

    Full text to download in external service

  • Grafo-mania, czyli rzecz o grafach i algorytmach. Problem 8 hetmanów
    Publication

    - Pismo PG - Year 2022

    W eseju spojrzano na problem 8 hetmanów na szachownicy z punktu widzenia teorii grafów

    Full text to download in external service

  • Grafo-mania, czyli rzecz o grafach i algorytmach. Szybkie mnożenie macierzy
    Publication

    - Pismo PG - Year 2022

    Miniesej zawiera komentarz na temat zastosowania sztucznej inteligencji do problemu mnożenia macierzy.

    Full text to download in external service

  • Hybrid no-signaling-quantum correlations
    Publication

    Fundamental investigations in non-locality have shown that while the no-signaling principle alone is not sufficient to single out the set of quantum non-local correlations, local quantum mechanics and no-signaling together exactly reproduce the set of quantum correlations in the two-party Bell scenario. Here, we introduce and study an intermediate hybrid no-signaling quantum set of non-local correlations that we term HNSQ in the...

    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

  • Non-Perfect Propagation of Information to a Noisy Environment with Self-Evolution
    Publication

    We study the non-perfect propagation of information for evolving a low-dimensional environment that includes self-evolution as well as noisy initial states and analyse the interrelations between the degree of objectivization and environment parameters. In particular, we consider an analytical model of three interacting qubits and derive its objectivity parameters. The numerical analysis shows that the quality of the spectrum broadcast...

    Full text available to download

  • On zero-error codes produced by greedy algorithms

    We present two greedy algorithms that determine zero-error codes and lower bounds on the zero-error capacity. These algorithms have many advantages, e.g., they do not store a whole product graph in a computer memory and they use the so-called distributions in all dimensions to get better approximations of the zero-error capacity. We also show an additional application of our algorithms.

    Full text available to download

  • Paired domination versus domination and packing number in graphs
    Publication

    Given a graph G = (V(G), E(G)), the size of a minimum dominating set, minimum paired dominating set, and a minimum total dominating set of a graph G are denoted by γ (G), γpr(G), and γt(G), respectively. For a positive integer k, a k-packing in G is a set S ⊆ V(G) such that for every pair of distinct vertices u and v in S, the distance between u and v is at least k + 1. The k-packing number is the order of a largest kpacking and...

    Full text available to download

  • Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks
    Publication

    - Electronics - Year 2022

    Dominating sets find application in a variety of networks. A subset of nodes D is a (1,2)-dominating set in a graph G=(V,E) if every node not in D is adjacent to a node in D and is also at most a distance of 2 to another node from D. In networks, (1,2)-dominating sets have a higher fault tolerance and provide a higher reliability of services in case of failure. However, finding such the smallest set is NP-hard. In this paper, we...

    Full text available to download

  • Potyczki algorytmiczne, czyli Alicja i Bogdan w nowych sytuacjach. Alicja i Bogdan w naleśnikarni
    Publication

    - Pismo PG - Year 2022

    Niniejszym esejem inaugurujemy , po kilkuletniej przerwie, nową serię zagadek algorytmicznych.Pierwszy odcinek nosi nazwę Alicja i Bogdan w naleśnikarni.

    Full text to download in external service

  • Quantum security and theory of decoherence

    We sketch a relation between two crucial, yet independent, fields in quantum information research, viz. quantum decoherence and quantum cryptography. We investigate here how the standard cryptographic assumption of shielded laboratory, stating that data generated by a secure quantum device remain private unless explicitly published, is disturbed by the einselection mechanism of quantum Darwinism explaining the measurement process...

    Full text available to download

  • Scheduling on Uniform and Unrelated Machines with Bipartite Incompatibility Graphs
    Publication

    - Year 2022

    The problem of scheduling jobs on parallel machines under an incompatibility relation is considered in this paper. In this model, a binary relation between jobs is given and no two jobs that are in the relation can be scheduled on the same machine. We consider job scheduling under the incompatibility relation modeled by a bipartite graph, under the makespan optimality criterion, on uniform and unrelated machines. Unrelated machines...

    Full text to download in external service

  • Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines: Complexity and Algorithms
    Publication

    - ARTIFICIAL INTELLIGENCE - Year 2022

    In this paper, the problem of scheduling on parallel machines with a presence of incompatibilities between jobs is considered. The incompatibility relation can be modeled as a complete multipartite graph in which each edge denotes a pair of jobs that cannot be scheduled on the same machine. The paper provides several results concerning schedules, optimal or approximate with respect to the two most popular criteria of optimality:...

    Full text to download in external service

  • Significance of Dermoscopy in Association with Clinical Features in Differentiation of Basal Cell Carcinoma and Benign Trichoblastic Tumours
    Publication
    • M. Sławińska
    • A. Płaszczyńska
    • J. Lakomy
    • K. Pastuszak
    • W. Biernat
    • M. Sikorska
    • R. J. Nowicki
    • M. Sobjanek

    - Cancers - Year 2022

    Background: Although basal cell carcinoma (BCC) can, in the majority of cases, be diagnosed based on clinical and dermoscopic assessment, a potential overlap with benign adnexal skin tumours seems to exist, including trichoblastic tumours (TT). Methods: Retrospective analysis of clinical and dermoscopic features of benign TT and BCC cases was performed to develop a diagnostic algorithm with a potential utility in clinical practice....

    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