Search
Department of Algorithms and Systems Modelling
Publications
Filters
total: 538
Catalog Publications
Year 2022
-
Grafo-mania, czyli rzecz o grafach i algorytmach. Problem 8 hetmanów
PublicationW eseju spojrzano na problem 8 hetmanów na szachownicy z punktu widzenia teorii grafów
-
Grafo-mania, czyli rzecz o grafach i algorytmach. Szybkie mnożenie macierzy
PublicationMiniesej zawiera komentarz na temat zastosowania sztucznej inteligencji do problemu mnożenia macierzy.
-
Hybrid no-signaling-quantum correlations
PublicationFundamental 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...
-
Infinite chromatic games
PublicationIn 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...
-
Non-Perfect Propagation of Information to a Noisy Environment with Self-Evolution
PublicationWe 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...
-
On zero-error codes produced by greedy algorithms
PublicationWe 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.
-
Paired domination versus domination and packing number in graphs
PublicationGiven 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...
-
Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks
PublicationDominating 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...
-
Potyczki algorytmiczne, czyli Alicja i Bogdan w nowych sytuacjach. Alicja i Bogdan w naleśnikarni
PublicationNiniejszym esejem inaugurujemy , po kilkuletniej przerwie, nową serię zagadek algorytmicznych.Pierwszy odcinek nosi nazwę Alicja i Bogdan w naleśnikarni.
-
Quantum security and theory of decoherence
PublicationWe 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...
-
Scheduling on Uniform and Unrelated Machines with Bipartite Incompatibility Graphs
PublicationThe 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...
-
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines: Complexity and Algorithms
PublicationIn 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:...
-
Significance of Dermoscopy in Association with Clinical Features in Differentiation of Basal Cell Carcinoma and Benign Trichoblastic Tumours
PublicationBackground: 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....
-
Weighted 2-sections and hypergraph reconstruction
PublicationIn 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...
Year 2021
-
Block graphs with large paired domination multisubdivision number
PublicationThe paired domination multisubdivision number of a nonempty graph G, denoted by msdpr(G), is the smallest positive integer k such that there exists an edge which must be subdivided k times to increase the paired domination number of G. It is known that msdpr(G) ≤ 4 for all graphs G. We characterize block graphs with msdpr(G) = 4.
-
Bortezomib induces methylation changes in neuroblastoma cells that appear to play a significant role in resistance development to this compound
PublicationThe anticancer activity of bortezomib (BTZ) has been increasingly studied in a number of indications and promising results for the use of this treatment have been shown in neuroblastoma. As BTZ treatment is usually administered in cycles, the development of resistance and side effects in patients undergoing therapy with BTZ remains a major challenge for the clinical usage of this compound. Common resistance development also means...
-
Bounds on isolated scattering number
PublicationThe isolated scattering number is a parameter that measures the vulnerability of networks. This measure is bounded by formulas de- pending on the independence number. We present new bounds on the isolated scattering number that can be calculated in polynomial time.
-
Bounds on isolated scattering number
PublicationThe isolated scattering number is a parameter that measures the vulnerability of networks. This measure is bounded by formulas de- pending on the independence number. We present new bounds on the isolated scattering number that can be calculated in polynomial time.
-
Closer Look at the Uncertainty Estimation in Semantic Segmentation under Distributional Shift
PublicationWhile recent computer vision algorithms achieve impressive performance on many benchmarks, they lack robustness - presented with an image from a different distribution, (e.g. weather or lighting conditions not considered during training), they may produce an erroneous prediction. Therefore, it is desired that such a model will be able to reliably predict its confidence measure. In this work, uncertainty estimation for the task...
-
Diagnostic Accuracy of Liquid Biopsy in Endometrial Cancer
PublicationBackground: Liquid biopsy is a minimally invasive collection of a patient body fluid sample. In oncology, they offer several advantages compared to traditional tissue biopsies. However, the potential of this method in endometrial cancer (EC) remains poorly explored. We studied the utility of tumor educated platelets (TEPs) and circulating tumor DNA (ctDNA) for preoperative EC diagnosis, including histology determination. Methods:...
-
Gossiping by energy-constrained mobile agents in tree networks
PublicationEvery node of an edge-weighted tree network contains a data packet. At some nodes are placed mobile agents, each one possessing an amount of energy (not necessarily the same for all agents). While walking along the network, the agents spend the energy proportionally to the distance traveled and collect copies of the data packets present at the visited network nodes. An agent visiting a node deposits there copies of all currently...
-
Grafo-mania, czyli rzecz o grafach i algorytmach. Prawie 300 lat teorii powstałej blisko Gdańska
PublicationW niniejszym numerze inaugurujemy nową kolumnę popularnonaukową w dziale Edukacja. Będzie ona zawierała szkice poświęcone grafom i algorytmom dyskretnym
-
Grafo-mania, czyli rzecz o grafach i algorytmach. Spłaszczanie grafów
PublicationW eseju poruszono problem rysowania grafów na płaszczyźnie.
-
Grafo-mania, czyli rzecz o grafach i algorytmach. Twierdzenie o czterech barwach
PublicationPrzedstawiono istotę i historię twierdzenia o 4 barwach.
-
Grafy w Imperium Rzymskim
PublicationTeoria grafów znalazła zastosowanie w sieciach telekomunikacyjnych, transporcie, bioinformatyce, zarządzaniu i w wielu innych dziedzinach. Ale co ma ona wspólnego z Imperium Rzymskim?
-
Graphs hard-to-process for greedy algorithm MIN
PublicationWe compare results of selected algorithms that approximate the independence number in terms of the quality of constructed solutions. Furthermore, we establish smallest hard- to-process graphs for the greedy algorithm MIN.
-
Greencoin - educational information system for eco-inclusion and empowering urban adaptability.
PublicationSARS-CoV19 pandemic exposed a broad spectrum of challenges for modern cities, societies and the environment at large. The post-Covid transformation requires new social and ecological solutions, adjusted to modern challenges, but also equipped with technological advances that allow for digital inclusion and sustainable urban development to benefit the local economy and society. Many information systems are designed to enable...
-
Greencoin information system empowering urban adaptability and eco living choices.
PublicationThere are many gamification projects focused on mitigating climate changes which has been tested or implemented worldwide. However, the gap which remains is the limited number of solutions dedicated for central European countries where the urban polices in terms of climate vulnerability are bounded. On the other hand, cities, when implementing climate-oriented policies, are focused on urban resilience, while the opportunities...
-
Greencoin: prototype of a mobile application facilitating and evidencing pro-environmental behavior of citizens
PublicationAmong many global challenges, climate change is one of the biggest challenges of our times. While it is one of the most devastating problems humanity has ever faced, one question naturally arises: can individuals make a difference? We believe that everyone can contribute and make a difference to the community and lives of others. However, there is still a lack of effective strategies to promote and facilitate pro-environmental...
-
imPlatelet classifier: image‐converted RNA biomarker profiles enable blood‐based cancer diagnostics
PublicationLiquid biopsies offer a minimally invasive sample collection, outperforming traditional biopsies employed for cancer evaluation. The widely used material is blood, which is the source of tumor-educated platelets. Here, we developed the imPlatelet classifier, which converts RNA-sequenced platelet data into images in which each pixel corresponds to the expression level of a certain gene. Biological knowledge from the Kyoto Encyclopedia...
-
Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees
PublicationAn 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...
-
Komputer w labiryncie
PublicationProgramiści piszą programy, które potrafią robić wiele różnych rzeczy: odtwarzać filmy, prognozować pogodę, pomagać w nauce języków obcych czy matematyki. Ale czy wiesz, że można zaprogramować komputer tak, aby tworzył labirynty? W dodatku takie, które zawierają tajne informacje!
-
Modelling of dark fermentation of glucose and sour cabbage
PublicationIn the article, modified Anaerobic Digestion Models 1 (ADM-1) was tested for modelling dark fermentation for hydrogen production. The model refitting was done with the Euler method. The new model was based on sets of differential equations. The model was checked for hydrogen production from sour cabbage in batch and semi-batch in 5 g VSS (volatile solid suspension)/L and at the semi-batch process from glucose at 5 and 10 g VSS/L....
-
On the Characteristic Graph of a Discrete Symmetric Channel
PublicationWe present some characterizations of characteristic graphs of row and/or column symmetric channels. We also give a polynomial-time algorithm that decides whether there exists a discrete symmetric channel whose characteristic graph is equal to a given input graph. In addition, we show several applications of our results.
-
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)....
-
Quantum randomness protected against detection loophole attacks
PublicationDevice and semi-device-independent private quantum randomness generators are crucial for applications requiring private randomness. However, they are vulnerable to detection inefficiency attacks and this limits severely their usage for practical purposes. Here, we present a method for protecting semi-device-independent private quantum randomness generators in prepare-and-measure scenarios against detection inefficiency attacks....
-
Scheduling of compatible jobs on parallel machines
PublicationThe dissertation discusses the problems of scheduling compatible jobs on parallel machines. Some jobs are incompatible, which is modeled as a binary relation on the set of jobs; the relation is often modeled by an incompatibility graph. We consider two models of machines. The first model, more emphasized in the thesis, is a classical model of scheduling, where each machine does one job at time. The second one is a model of p-batching...
-
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines
PublicationIn this paper we consider a problem of job scheduling on parallel machines with a presence of incompatibilities between jobs. 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. Our research stems from the works of Bodlaender, Jansen, and Woeginger (1994) and Bodlaender and Jansen (1993). In particular, we pursue the...
-
Searching by heterogeneous agents
PublicationIn this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search problem by considering edge-labeled graphs: once a search strategy initially assigns labels to the searchers, each searcher can be only present on an edge of its own label. We prove that this problem is not monotone even for trees and we give instances...
-
Sztuczna inteligencja w onkologii - nowe narzędzia do diagnostyki i medycyny spersonalizowanej
Publicationstatnie dekady doprowadziły do rozwoju zaawansowanych technologii badawczych, cechujących się wysoką przepustowością. Zmienia to oblicze medycyny, doprowadzając do generowania ogromnej ilości danych. Z każdym kolejnym rokiem przybywa pacjentów onkologicznych, a zebrane informacje o pacjentach przekraczają możliwości lekarzy i naukowców w zakresie samodzielnej analizy tzw. big data. Właśnie dlatego świat nauki coraz częściej zwraca...
-
T-colorings, divisibility and circular chromatic number
PublicationLet 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) =...
-
Total chromatic sum for trees
PublicationThe 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.
-
Total Completion Time Minimization for Scheduling with Incompatibility Cliques
PublicationThis paper considers parallel machine scheduling with incompatibilities between jobs. The jobs form a graph equivalent to a collection of disjoint cliques. No two jobs in a clique are allowed to be assigned to the same machine. Scheduling with incompatibilities between jobs represents a well-established line of research in scheduling theory and the case of disjoint cliques has received increasing attention in recent...
-
Towards Cancer Patients Classification Using Liquid Biopsy
PublicationLiquid biopsy is a useful, minimally invasive diagnostic and monitoring tool for cancer disease. Yet, developing accurate methods, given the potentially large number of input features, and usually small datasets size remains very challenging. Recently, a novel feature parameterization based on the RNA-sequenced platelet data which uses the biological knowledge from the Kyoto Encyclopedia of Genes and Genomes, combined with a classifier...
-
Transcriptomic landscape of blood platelets in healthy donors
PublicationBlood platelet RNA-sequencing is increasingly used among the scientific community. Aberrant platelet transcriptome is common in cancer or cardiovascular disease, but reference data on platelet RNA content in healthy individuals are scarce and merit complex investigation. We sought to explore the dynamics of platelet transcriptome. Datasets from 204 healthy donors were used for the analysis of splice variants, particularly with...
-
Transcriptomic landscape of blood platelets in healthy donors
PublicationBACKGROUND Blood platelet RNA-sequencing is increasingly used among the scientific community. Aberrant platelet transcriptome is common in cancer or cardiovascular disease, but reference data on platelet RNA content in healthy individuals are scarce and merit complex investigation. METHODS We sought to explore the dynamics of platelet transcriptome. Datasets from 204 healthy donors were used for the analysis of splice variants,...
-
User experience and user interface (UX/UI) design of Greencoin mobile application.
PublicationThe aim of the Greencoin mobile application is to encourage its users to change their behavior and to act pro-ecologically. The pilot version of the application will operate within the city of Gdańsk. To keep the app’s user base as large as possible, the graphical user interface should be attractive to the broadest possible audience, and the application itself should be easy and fun to use. This work is a continuation of studies...
Year 2020
-
A note on polynomial algorithm for cost coloring of bipartite graphs with Δ ≤ 4
PublicationIn the note we consider vertex coloring of a graph in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of coloring is the sum of costs incurred at each vertex. We show that the minimum cost coloring problem for n-vertex bipartite graph of degree ∆≤4 can be solved in O(n^2) time. This extends Jansen’s result [K.Jansen,The optimum cost chromatic partition problem, in:...
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm
PublicationWe present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm.
PublicationWe present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.