Rok 2019

• Method for Clustering of Brain Activity Data Derived from EEG Signals

  Publikacja

  • A. Kurowski
  • K. E. Mrozik (dawniej: K. Mrozik)
  • B. Kostek
  • A. Czyżewski

  - FUNDAMENTA INFORMATICAE - Rok 2019

  A method for assessing separability of EEG signals associated with three classes of brain activity is proposed. The EEG signals are acquired from 23 subjects, gathered from a headset consisting of 14 electrodes. Data are processed by applying Discrete Wavelet Transform (DWT) for the signal analysis and an autoencoder neural network for the brain activity separation. Processing involves 74 wavelets from 3 DWT families: Coiflets,...

  Pełny tekst do pobrania w portalu

Rok 2017

• Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph

  Publikacja

  • M. Lemańska
  • J. A. RODRíGUEZ-VELáZQUEZ
  • R. Trujillo-Rasua

  - FUNDAMENTA INFORMATICAE - Rok 2017

  A vertex cover of a graph G = (V, E) is a set X ⊂ V such that each edge of G is incident to at least one vertex of X. The ve cardinality of a vertex cover of G. A dominating set D ⊆ V is a weakly connected dominating set of G if the subgraph G[D]w = (N[D], Ew) weakly induced by D, is connected, where Ew is the set of all edges having at least one vertex in D. The weakly connected domination number γw(G) of G is the minimum cardinality...

  Pełny tekst do pobrania w serwisie zewnętrznym

Rok 2016

• Important Facts and Observations about Pairwise Comparisons (the special issue edition)

  Publikacja

  • W. W. Koczkodaj
  • L. Mikhailov
  • G. Redlarski
  • M. Soltys
  • J. Szybowski
  • G. Tamazian
  • E. Wajch
  • K. K. F. Yuen

  - FUNDAMENTA INFORMATICAE - Rok 2016

  This study has been inspired by numerous requests for clarification from researchers who often confuse Saaty’s Analytic Hierarchy Process (AHP) with the pairwise comparisons (PC) method, taking AHP as the only representation of PC. This study should be regarded as an interpretation and clarification of past investigations of PC. In addition, this article is a reflection on general PC research at a higher level of abstraction: the...

  Pełny tekst do pobrania w serwisie zewnętrznym

Rok 2014

• An algorithm for listing all minimal double dominating sets of a tree

  Publikacja

  • M. Krzywkowski

  - FUNDAMENTA INFORMATICAE - Rok 2014

  We provide an algorithm for listing all minimal double dominating sets of a tree of order $n$ in time $\mathcal{O}(1.3248^n)$. This implies that every tree has at most $1.3248^n$ minimal double dominating sets. We also show that this bound is tight.

  Pełny tekst do pobrania w serwisie zewnętrznym

Rok 2013

• Adaptive Method of Adjusting Flowgraph for Route Reconstruction in Video Surveillance Systems

  Publikacja

  • A. Czyżewski
  • K. Lisowski

  - FUNDAMENTA INFORMATICAE - Rok 2013

  Pawlak’s flowgraph has been applied as a suitable data structure for description and anal- ysis of human behaviour in the area supervised with multicamera video surveillance system. Infor- mation contained in the flowgraph can be easily used to predict consecutive movements of a partic- ular object. Moreover, utilization of the flowgraph can support reconstructing object route from the past video images. However, such a flowgraph with...

  Pełny tekst do pobrania w serwisie zewnętrznym

• Music Recommendation Based on Multidimensional Description and Similarity Measures . Rekomendacja muzyki na podstawie wielowymiarowego wektora cech i miar podobieństwa

  Publikacja

  • B. Kostek
  • A. Kaczmarek

  - FUNDAMENTA INFORMATICAE - Rok 2013

  This study aims to create an algorithm for assessing the degree to which songs belong to genres defined a priori. Such an algorithm is not aimed at providing unambiguous classification-labelling of songs, but at producing a multidimensional description encompassing all of the defined genres. The algorithm utilized data derived from the most relevant examples belonging to a particular genre of music. For this condition to be met,...

Rok 2012

• Dynamic coloring of graphs

  Publikacja

  • P. Borowiecki
  • E. Sidorowicz

  - FUNDAMENTA INFORMATICAE - Rok 2012

  Dynamics is an inherent feature of many real life systems so it is natural to define and investigate the properties of models that reflect their dynamic nature. Dynamic graph colorings can be naturally applied in system modeling, e.g. for scheduling threads of parallel programs, time sharing in wireless networks, session scheduling in high-speed LAN's, channel assignment in WDM optical networks as well as traffic scheduling. In...

Rok 2006

• Efficient parallel query processing by graph ranking

  Publikacja

  • D. Dereniowski
  • M. Kubale

  - FUNDAMENTA INFORMATICAE - Rok 2006

  W artykule analizujemy przybliżony algorytm dla problemu szukania drzewa spinającego o minimalnym uporządkowanym indeksie chromatycznym, co znajduje zastosowanie w równoległym przetwarzaniu zapytań w relacyjnych bazach danych. Podajemy nowe oszacowanie uporządkowanego indeksu chromatycznego drzewa, które prowadzi do uzyskania lepszej funkcji dobroci wspomnianego algorytmu.