Centrum Usług Informatycznych - Jednostki Administracyjne - MOST Wiedzy

Wyszukiwarka

Centrum Usług Informatycznych

Filtry

wszystkich: 118

  • Kategoria
  • Rok
  • Opcje

wyczyść Filtry wybranego katalogu niedostępne

Katalog Publikacji

Rok 2019
Rok 2018
Rok 2017
  • Dobre praktyki i narzędzia open source w zwinnym wytwarzaniu oprogramowania
    Publikacja

    Zwinne wytwarzanie oprogramowania stało się bardzo popularne. Na podstawie projektu MOST Wiedzy przedstawiono procesy i narzędzia wspierające wytwarzanie oprogramowania na Politechnice Gdańskiej. Metodologia DDD (domain-driven design) wspierana przez repozytorium GIT oraz tzw. proces “cherry picking” powoduje, że proces wytwarzania oprogramowania jest elastyczny i efektywny. Dodatkowo wprowadzenie elementów CI (continuous integration),...

    Pełny tekst do pobrania w portalu

  • Game with a Purpose for Verification of Mappings Between Wikipedia and WordNet
    Publikacja

    - Rok 2017

    The paper presents a Game with a Purpose for verification of automatically generated mappings focusing on mappings between WordNet synsets and Wikipedia articles. General description of idea standing behind the games with the purpose is given. Description of TGame system, a 2D platform mobile game with verification process included in the game-play, is provided. Additional mechanisms for anti-cheating, increasing player’s motivation...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Techniczne aspekty niezawodnej chmury obliczeniowej

    Powszechnie wykorzystuje się przetwarzanie w chmurze ze względu na redukcję kosztów zakupu sprzętu oraz łatwość zarządzania środowiskiem. W artykule zaproponowano architekturę prywatnej chmury obliczeniowej opracowanej i uruchomionej na Politechnice Gdańskiej, w ramach której wdrożono nowy portal MOST Wiedzy. Technologia wykorzystana do budowy zarówno chmury, jak i portalu wykorzystuje jedynie rozwiązania open source. Omówiono...

    Pełny tekst do pobrania w portalu

  • Towards facts extraction from text in Polish language
    Publikacja

    Natural Language Processing (NLP) finds many usages in different fields of endeavor. Many tools exists allowing analysis of English language. For Polish language the situation is different as the language itself is more complicated. In this paper we show differences between NLP of Polish and English language. Existing solutions are presented and TEAMS software for facts extraction is described. The paper shows also evaluation of...

    Pełny tekst do pobrania w portalu

Rok 2016
  • Adaption of Open Science Paradigm at Gdańsk University of Technology
    Publikacja

    - Rok 2016

    The paper describes the basic principles standing behind Open Access and will try to dispel the doubts behind them. Further the solution adapted by the Gdańsk University of Technology is presented. Later on the systems that the University uses and means of their integration into a complex Open Science platform are described. Finally the procedures needed to publish a document in the repository alongside the University's policy...

    Pełny tekst do pobrania w portalu

  • An O ( n log n ) algorithm for finding edge span of cacti

    Let G=(V,E) be a nonempty graph and xi be a function. In the paper we study the computational complexity of the problem of finding vertex colorings c of G such that: (1) |c(u)-c(v)|>=xi(uv) for each edge uv of E; (2) the edge span of c, i.e. max{|c(u)-c(v)|: uv belongs to E}, is minimal. We show that the problem is NP-hard for subcubic outerplanar graphs of a very simple structure (similar to cycles) and polynomially solvable for...

    Pełny tekst do pobrania w portalu

  • Game with a Purpose for Mappings Verification

    Mappings verification is a laborious task. The paper presents a Game with a Purpose based system for verification of automatically generated mappings. General description of idea standing behind the games with the purpose is given. Description of TGame system, a 2D platform mobile game with verification process included in the gameplay, is provided. Additional mechanisms for anti-cheating, increasing player’s motivation and gathering...

    Pełny tekst do pobrania w portalu

  • On the hardness of computing span of subcubic graphs

    In the paper we study the problem of finding ξ-colorings with minimal span, i.e. the difference between the largest and the smallest color used.

    Pełny tekst do pobrania w serwisie zewnętrznym

Rok 2015
  • Adaption of Open Science Paradigm at Gdańsk University of Technology
    Publikacja

    Open Access plays growing role in sharing results of today's research. The movement is very strong and many Universities, including Gdańsk University of Technology, are adapting this approach. This paper presents general information about Open Access movement and the approach adapted by the Gdańsk University of Technology. The components of Open Science platform as well as the procedures are described.

    Pełny tekst do pobrania w portalu

  • DBpedia As a Formal Knowledge Base – An Evaluation

    DBpedia is widely used by researchers as a mean of accessing Wikipedia in a standardized way. In this paper it is characterized from the point of view of questions answering system. Simple implementation of such system is also presented. The paper also characterizes alternatives to DBpedia in form of OpenCyc and YAGO knowledge bases. A comparison between DBpedia and those knowledge bases is presented.

    Pełny tekst do pobrania w portalu

  • Interval incidence graph coloring

    In this paper we introduce a concept of interval incidence coloring of graphs and survey its general properties including lower and upper bounds on the number of colors. Our main focus is to determine the exact value of the interval incidence coloring number χii for selected classes of graphs, i.e. paths, cycles, stars, wheels, fans, necklaces, complete graphs and complete k-partite graphs. We also study the complexity of the...

    Pełny tekst do pobrania w portalu

  • The Backbone Coloring Problem for Bipartite Backbones

    Let G be a simple graph, H be its spanning subgraph and λ≥2 be an integer. By a λ -backbone coloring of G with backbone H we mean any function c that assigns positive integers to vertices of G in such a way that |c(u)−c(v)|≥1 for each edge uv∈E(G) and |c(u)−c(v)|≥λ for each edge uv∈E(H) . The λ -backbone chromatic number BBCλ(G,H) is the smallest integer k such that there exists a λ -backbone coloring c of G with backbone H satisfying...

    Pełny tekst do pobrania w serwisie zewnętrznym