Wyniki wyszukiwania dla: COMPLETENESS - MOST Wiedzy

Wyszukiwarka

Wyniki wyszukiwania dla: COMPLETENESS

Wyniki wyszukiwania dla: COMPLETENESS

  • Completeness and Consistency of the System Requirement Specification

    Although the System Requirement Specification, as a first formal and detailed document, is the base for the software project in classic software methodologies, there is a noticeable problem of assuring the completeness of this document. The lack of its completeness causes uncertainty of the project foundations. This was one of motivations for agile methodologies – if the SRS cannot be easily validated, if it can change in late project...

    Pełny tekst do pobrania w portalu

  • NP-completeness of convex and weakly convex domiating set decision problems.

    Publikacja

    Liczby dominowania wypukłego i słabo wypukłego są nowymi rodzajami liczb dominowania. W tym artykule pokazujemy, że problemy decyzyjne dominowania wypukłegi i słabo wypukłego są NP-zupełne w przypadku grafów dwudzielnych oraz split grafów. Posługując się zmodyfikowanym algorytmem Washalla możemy w czasie wielomianowym określić, czy dany podzbiór wierzchołków grafu jest spójny bądź słabo spójny.

    Pełny tekst do pobrania w portalu

  • Passing from requirements specification to class model using application domain ontology

    The quality of a classic software engineering process depends on the completeness of project documents and on the inter-phase consistency. In this paper, a method for passing from the requirement specification to the class model is proposed. First, a developer browses the text of the requirements, extracts the word sequences, and places them as terms into the glossary. Next, the internal ontology logic for the glossary needs to...

  • Tight bounds on global edge and complete alliances in trees

    In 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Tomasz Krolikowski dr hab. inż.

    Osoby

    In 1996, I have graduated from the Faculty of Marine Science of Szczecin University and obtained a master's degree - ocean engineering engineer " - Control and Ocean Engineering Measurements". In 1994 I was hired as an assistant trainee at the Institute of Computer Science Technical University of Szczecin, and after graduating in 1996, I was employed as academic and teaching at the Institute of Computer Science in the Department...

  • Global edge alliances in graphs

    In the paper we introduce and study a new problem of finding a minimum global edge alliance in a graph which is related to the global defensive alliance (Haynes et al., 2013; Hedetniemi, 2004) and the global defensive set (Lewoń et al., 2016). We proved the NP-completeness of the global edge alliance problem for subcubic graphs and we constructed polynomial time algorithms for trees. We found the exact values of the size of the...

    Pełny tekst do pobrania w portalu

  • Searching by heterogeneous agents

    In 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Duodenum - Male, 61 - Tissue image [11300630022664851]

    Dane Badawcze

    This is the histopathological image of SMALL INTESTINE tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.

  • Duodenum - Male, 61 - Tissue image [11300630022666091]

    Dane Badawcze

    This is the histopathological image of SMALL INTESTINE tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.

  • Duodenum - Male, 61 - Tissue image [11300630022661431]

    Dane Badawcze

    This is the histopathological image of SMALL INTESTINE tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.

  • Duodenum - Male, 61 - Tissue image [11300630022664801]

    Dane Badawcze

    This is the histopathological image of SMALL INTESTINE tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.

  • Duodenum - Male, 61 - Tissue image [11300630022668601]

    Dane Badawcze

    This is the histopathological image of SMALL INTESTINE tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.

  • Duodenum - Male, 61 - Tissue image [11300630022664221]

    Dane Badawcze

    This is the histopathological image of SMALL INTESTINE tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.

  • Searching by Heterogeneous Agents

    Publikacja

    - Rok 2019

    In 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Severe cervical dysplasia, not elsewhere classified - Female, 63 - Tissue image [6210730043061761]

    Dane Badawcze

    This is the histopathological image of CERVIX UTERI tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.

  • Severe cervical dysplasia, not elsewhere classified - Female, 63 - Tissue image [621073004306801]

    Dane Badawcze

    This is the histopathological image of CERVIX UTERI tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.

  • Severe cervical dysplasia, not elsewhere classified - Female, 63 - Tissue image [6210730043066581]

    Dane Badawcze

    This is the histopathological image of CERVIX UTERI tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.

  • Severe cervical dysplasia, not elsewhere classified - Female, 63 - Tissue image [6210730043062611]

    Dane Badawcze

    This is the histopathological image of CERVIX UTERI tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.

  • Severe cervical dysplasia, not elsewhere classified - Female, 63 - Tissue image [6210730043068591]

    Dane Badawcze

    This is the histopathological image of CERVIX UTERI tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.

  • Severe cervical dysplasia, not elsewhere classified - Female, 63 - Tissue image [6210730043062441]

    Dane Badawcze

    This is the histopathological image of CERVIX UTERI tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.

  • Severe cervical dysplasia, not elsewhere classified - Female, 63 - Tissue image [621073004306711]

    Dane Badawcze

    This is the histopathological image of CERVIX UTERI tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.

  • Severe cervical dysplasia, not elsewhere classified - Female, 63 - Tissue image [6210730043066821]

    Dane Badawcze

    This is the histopathological image of CERVIX UTERI tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.

  • On Computational Aspects of Greedy Partitioning of Graphs

    Publikacja

    - Rok 2017

    In this paper we consider a problem of graph P-coloring consisting in partitioning the vertex set of a graph such that each of the resulting sets induces a graph in a given additive, hereditary class of graphs P. We focus on partitions generated by the greedy algorithm. In particular, we show that given a graph G and an integer k deciding if the greedy algorithm outputs a P-coloring with a least k colors is NP-complete for an infinite...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Computational aspects of greedy partitioning of graphs

    In this paper we consider a variant of graph partitioning consisting in partitioning the vertex set of a graph into the minimum number of sets such that each of them induces a graph in hereditary class of graphs P (the problem is also known as P-coloring). We focus on the computational complexity of several problems related to greedy partitioning. In particular, we show that given a graph G and an integer k deciding if the greedy...

    Pełny tekst do pobrania w portalu

  • Optimization issues in distributed computing systems design

    Publikacja

    - Rok 2014

    In recent years, we observe a growing interest focused on distributed computing systems. Both industry and academia require increasing computational power to process and analyze large amount of data, including significant areas like analysis of medical data, earthquake, or weather forecast. Since distributed computing systems – similar to computer networks – are vulnerable to failures, survivability mechanisms are indispensable...

  • Fake News: Possibility of Identification in Post-Truth Media Ecology System

    Publikacja

    - Rok 2019

    Information comes as basic good which affects social well-being. A modern society and a modern state – its administration, education, culture, national economy and armed forces – cannot function efficiently without a rationally developed field of information. The quality of the functioning of that system depends on a specific feature of information, that is namely: its reliability which makes it possible for us to evaluate accuracy,...

    Pełny tekst do pobrania w portalu

  • Set of Experience and Decisional DNA: Experience-Based Knowledge Structures

    Publikacja

    - Rok 2020

    This chapter presents a description of Set of Experience Knowledge Structure (SOEKS) and Decisional DNA (DDNA), argumentation for a knowledge representation, composition, configuration and metrics. SOEKS is a combination of filtered and amalgamated information obtained from formal decision events. It facilitates effective explicit representation of decisional experience taken from different technologies. SOEKS comprises variables,...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Information retrieval with semantic memory model

    Publikacja

    Psycholinguistic theories of semantic memory form the basis of understanding of natural language concepts. These theories are used here as an inspiration for implementing a computational model of semantic memory in the form of semantic network. Combining this network with a vector-based object-relation-feature value representation of concepts that includes also weights for confidence and support, allows for recognition of concepts...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Unveiling the Pool of Metallophores in Native Environments and Correlation with Their Potential Producers

    Publikacja
    • F. Calderón Celis
    • I. González-Álvarez
    • M. Fabjanowicz
    • S. Godin
    • L. Ouerdane
    • B. Lauga
    • R. Łobiński

    - ENVIRONMENTAL SCIENCE & TECHNOLOGY - Rok 2023

    For many organisms, metallophores are essential biogenic ligands that ensure metal scavenging and acquisition from their environment. Their identification is challenging in highly organic matter rich environments like peatlands due to low solubilization and metal scarcity and high matrix complexity. In contrast to common approaches based on sample modification by spiking of metal isotope tags, we have developed a two-dimensional...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • THE 3D MODEL OF WATER SUPPLY NETWORK WITH APPLICATION OF THE ELEVATION DATA

    Publikacja

    - Rok 2017

    3D visualization is a key element of research and analysis and as the source used by experts in various fields e.g.: experts from water and sewage systems. The aim of this study was to visualize in three-dimensional space model of water supply network with relief. The path of technological development of GESUT data (Geodezyjna Ewidencja Sieci Uzbrojenia Terenu – geodetic records of public utilities) for water supply and measurement...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Modele i algorytmy dla grafowych struktur defensywnych

    Publikacja

    - Rok 2023

    W niniejszej pracy przeprowadzono analizę złożoności istnienia struktur defensywnych oraz równowag strategicznych w grafach. W przypadku struktur defensywnych badano modele koalicji defensywnych, zbiorów defensywnych i koalicji krawędziowych – każdy z nich w wersji globalnej, tj. z wymogiem dominacji całego grafu. W przypadku modeli równowagi strategicznej badano równowagę strategiczną koalicji defensywnych, równowagę strategiczną...

    Pełny tekst do pobrania w portalu

  • Context-Aware Indexing and Retrieval for Cognitive Systems Using SOEKS and DDNA

    Publikacja

    - Advances in Intelligent Systems and Computing - Rok 2019

    Visual content searching, browsing and retrieval tools have been a focus area of interest as they are required by systems from many different domains. Context-based, Content-Based, and Semantic-based are different approaches utilized for indexing/retrieving, but have their drawbacks when applied to systems that aim to mimic the human capabilities. Such systems, also known as Cognitive Systems, are still limited in terms of processing...

    Pełny tekst do pobrania w portalu

  • Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees

    An 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Global defensive sets in graphs

    In the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if | N [ X ] ∩ S | ≥ | N [ X ] \ S | holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...

    Pełny tekst do pobrania w portalu

  • Hourly GNSS-derived integrated moisture in the global tropics for the years 2001-2018

    Dane Badawcze

    Global tropics are essential in formulating weather patterns and climate across various latitudes through atmospheric teleconnections. Since water vapour is an essential parameter in atmospheric convection and, thus, latent heat release, its tropical variability on different time scales is crucial in understanding weather and climate changes. The provided...