Wyszukiwarka
Katedra Algorytmów i Modelowania Systemów
Publikacje
Filtry
wszystkich: 517
Katalog Publikacji
Rok 2021
-
Sztuczna inteligencja w onkologii - nowe narzędzia do diagnostyki i medycyny spersonalizowanej
Publikacjastatnie 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...
-
Searching by heterogeneous agents
PublikacjaIn 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...
-
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines
PublikacjaIn 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...
-
Scheduling of compatible jobs on parallel machines
PublikacjaThe 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...
-
Quantum randomness protected against detection loophole attacks
PublikacjaDevice 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....
-
Progress on Roman and Weakly Connected Roman Graphs
PublikacjaA 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)....
-
On the Characteristic Graph of a Discrete Symmetric Channel
PublikacjaWe 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.
-
Modelling of dark fermentation of glucose and sour cabbage
PublikacjaIn 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....
-
Komputer w labiryncie
PublikacjaProgramiś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!
-
Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees
PublikacjaAn 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...
-
imPlatelet classifier: image‐converted RNA biomarker profiles enable blood‐based cancer diagnostics
PublikacjaLiquid 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...
-
Greencoin: prototype of a mobile application facilitating and evidencing pro-environmental behavior of citizens
PublikacjaAmong 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...
-
Greencoin information system empowering urban adaptability and eco living choices.
PublikacjaThere 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 - educational information system for eco-inclusion and empowering urban adaptability.
PublikacjaSARS-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...
-
Graphs hard-to-process for greedy algorithm MIN
PublikacjaWe 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.
-
Grafy w Imperium Rzymskim
PublikacjaTeoria 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?
-
Grafo-mania, czyli rzecz o grafach i algorytmach. Twierdzenie o czterech barwach
PublikacjaPrzedstawiono istotę i historię twierdzenia o 4 barwach.
-
Grafo-mania, czyli rzecz o grafach i algorytmach. Spłaszczanie grafów
PublikacjaW eseju poruszono problem rysowania grafów na płaszczyźnie.
-
Grafo-mania, czyli rzecz o grafach i algorytmach. Prawie 300 lat teorii powstałej blisko Gdańska
PublikacjaW niniejszym numerze inaugurujemy nową kolumnę popularnonaukową w dziale Edukacja. Będzie ona zawierała szkice poświęcone grafom i algorytmom dyskretnym
-
Gossiping by energy-constrained mobile agents in tree networks
PublikacjaEvery 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...
-
Diagnostic Accuracy of Liquid Biopsy in Endometrial Cancer
PublikacjaBackground: 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:...
-
Closer Look at the Uncertainty Estimation in Semantic Segmentation under Distributional Shift
PublikacjaWhile 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...
-
Bounds on isolated scattering number
PublikacjaThe 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
PublikacjaThe 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.
-
Bortezomib induces methylation changes in neuroblastoma cells that appear to play a significant role in resistance development to this compound
PublikacjaThe 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...
-
Block graphs with large paired domination multisubdivision number
PublikacjaThe 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.
Rok 2020
-
Zagadkowe obrazki binarne
PublikacjaCzy wiesz, że za pomocą liczb można kodować obrazki? Dziś odkodujemy i narysujemy takie obrazki, a przy okazji poćwiczymy zamianę liczb z systemu dziesiętnego na dwójkowy, czyli binarny.
-
Visual TreeCmp : Comprehensive Comparison of Phylogenetic Trees on the Web
Publikacja1. We present Visual TreeCmp—a package of applications for comparing phylogenetic tree sets. 2. Visual TreeCmp includes a graphical web interface allowing the visualization of compared trees and command line application extended by comparison methods recently proposed in the literature. 3. The phylogenetic tree similarity analysis in Visual TreeCmp can be performed using eighteen metrics, of which 11 are dedicated to rooted trees...
-
Tight bounds on global edge and complete alliances in trees
PublikacjaIn 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...
-
Shared processor scheduling of multiprocessor jobs
PublikacjaWe study a problem of shared processor scheduling of multiprocessor weighted jobs. Each job can be executed on its private processor and simultaneously on possibly many processors shared by all jobs. This simultaneous execution reduces their completion times due to the processing time overlap. Each of the m shared processors may charge a different fee but otherwise the processors are identical. The goal is to maximize the total...
-
Paired domination subdivision and multisubdivision numbers of graphs
PublikacjaThe paired domination subdivision number sdpr(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the paired domination number of G. We prove that the decision problem of the paired domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the paired domination muttisubdivision number of a nonempty graph...
-
Multi-agent graph searching and exploration algorithms
PublikacjaA team of mobile entities, which we refer to as agents or searchers interchangeably, starting from homebases needs to complete a given task in a graph.The goal is to build a strategy, which allows agents to accomplish their task. We analyze strategies for their effectiveness (e.g., the number of used agents, the total number of performed moves by the agents or the completion time).Currently, the fields of on-line (i.e., agents...
-
Graph classes generated by Mycielskians
PublikacjaIn this paper we use the classical notion of weak Mycielskian M'(G) of a graph G and the following sequence: M'_{0}(G) =G, M'_{1}(G)=M'(G), and M'_{n}(G)=M'(M'_{n−1}(G)), to show that if G is a complete graph oforder p, then the above sequence is a generator of the class of p-colorable graphs. Similarly, using Mycielskian M(G) we show that analogously defined sequence is a generator of the class consisting of graphs for which the...
-
Experimental test of nonclassicality with arbitrarily low detection efficiency
PublikacjaWe theoretically introduce and experimentally demonstrate the realization of a nonclassicality test that allows for arbitrarily low detection efficiency without invoking an extra assumption of independence of the devices. Our test and its implementation is set in a prepare-and-measure scenario with an upper limit on the classical communication capacity of the channel through which the systems are communicated. The essence for our...
-
Experimental certification of an informationally complete quantum measurement in a device-independent protocol
PublikacjaMinimal informationally complete positive operator-valued measures (MIC-POVMs) are special kinds of measurement in quantum theory in which the statistics of their d2-outcomes are enough to reconstruct any d-dimensional quantum state. For this reason, MIC-POVMs are referred to as standard measurements for quantum information.Here, we report an experiment with entangled photon pairs that certifies, for what we believe is the first...
-
Deep learning for recommending subscription-limited documents
PublikacjaDocuments recommendation for a commercial, subscription-based online platform is important due to the difficulty in navigation through a large volume and diversity of content available to clients. However, this is also a challenging task due to the number of new documents added every day and decreasing relevance of older contents. To solve this problem, we propose deep neural network architecture that combines autoencoder with...
-
Czy komputer może zrobić błąd rachunkowy?
PublikacjaW szkole błędy rachunkowe nie są mile widziane, w dodatku zazwyczaj nie wolno na lekcjach matematyki używać kalkulatorów. Jaka szkoda! Przecież kalkulator nigdy się nie myli! Ale czy na pewno?
-
Chromatic cost coloring of weighted bipartite graphs
PublikacjaGiven a graph G and a sequence of color costs C, the Cost Coloring optimization problem consists in finding a coloring of G with the smallest total cost with respect to C. We present an analysis of this problem with respect to weighted bipartite graphs. We specify for which finite sequences of color costs the problem is NP-hard and we present an exact polynomial algorithm for the other finite sequences. These results are then extended...
-
Blurred quantum Darwinism across quantum reference frames
PublikacjaQuantum Darwinism describes objectivity of quantum systems via their correlations with their environment--information that hypothetical observers can recover by measuring the environments. However, observations are done with respect to a frame of reference. Here, we take the formalism of [Giacomini, Castro-Ruiz, & Brukner. Nat Commun 10, 494 (2019)], and consider the repercussions on objectivity when changing quantum reference...
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm
PublikacjaWe 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.
PublikacjaWe 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.
-
A note on polynomial algorithm for cost coloring of bipartite graphs with Δ ≤ 4
PublikacjaIn 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:...
Rok 2019
-
Weakly connected Roman domination in graphs
PublikacjaA Roman dominating function on a graph G=(V,E) is defined to be a function f :V → {0,1,2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v)=2. A dominating set D⊆V is a weakly connected dominating set of G if the graph (V,E∩(D×V)) is connected. We define a weakly connected Roman dominating function on a graph G to be a Roman dominating function such that the set...
-
Searching by Heterogeneous Agents
PublikacjaIn 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. In such setting a searcher, once a search strategy initially decides on the label of the searcher, can be present on an edge only if the label of the searcher and the label of the edge are the same. We prove...
-
Potyczki algorytmiczne, czyli Alicja i Bogdan w różnych sytuacjach. Alicja i Bogdan wyprawiają wesele
PublikacjaWprowadzono w zagadnienie przeglądania z dwoma wartownikami
-
Potyczki algorytmiczne, czyli Alicja i Bogdan w różnych sytuacjach. Alicja i Bogdan wśród ludożerców
PublikacjaWprowadzono do zagadnień złożoności czasowej i pamięciowej
-
Potyczki algorytmiczne, czyli Alicja i Bogdan w różnych sytuacjach. Alicja i Bogdan w samochodzie
PublikacjaPrzedstawiono dwie zagadki algorytmiczne ilustujące przeszukiwanie wyczerpujące
-
Potyczki algorytmiczne, czyli Alicja i Bogdan w różnych sytuacjach. Alicja i Bogdan w kuchni
PublikacjaW pierwszym odcinku serii zagadek algorytmicznych przedstawiamy problem podziału pizzy oraz grę naleśnikową
-
Potyczki algorytmiczne, czyli Alicja i Bogdan w różnych sytuacjach. Alicja i Bogdan w krainie czarów
PublikacjaWprowadzono w zagadnienia NP-zupełności na przykładzie problemu Suma Podzbioru
-
Potyczki algorytmiczne, czyli Alicja i Bogdan w różnych sytuacjach. Alicja i Bogdan w kapeluszach
PublikacjaAlicja I Bogdan wybrali się z zaprzyjaźnioną parą na imprezę sylwestrową. W trakcie wspólnej zabawy ogłoszono dwa konkursy z nagrodami, do których przystąpiła nasza czwórka. Konkursy polegały na odgadnięciu koloru kapeluszy.