Search
ISSN:
eISSN:
Disciplines
(Field of Science):
- information and communication technology (Engineering and Technology)
- biomedical engineering (Engineering and Technology)
- computer and information sciences (Natural sciences)
- mathematics (Natural sciences)
(Field of Science)
Ministry points: Help
| Year | Points | List |
|---|---|---|
| Year 2024 | 70 | Ministry scored journals list 2024 |
| Year | Points | List |
|---|---|---|
| 2024 | 70 | Ministry scored journals list 2024 |
| 2023 | 70 | Ministry Scored Journals List |
| 2022 | 70 | Ministry Scored Journals List 2019-2022 |
| 2021 | 70 | Ministry Scored Journals List 2019-2022 |
| 2020 | 70 | Ministry Scored Journals List 2019-2022 |
| 2019 | 70 | Ministry Scored Journals List 2019-2022 |
| 2018 | 20 | A |
| 2017 | 20 | A |
| 2016 | 20 | A |
| 2015 | 20 | A |
| 2014 | 15 | A |
| 2013 | 15 | A |
| 2012 | 20 | A |
| 2011 | 20 | A |
| 2010 | 27 | A |
Model:
Points CiteScore:
| Year | Points |
|---|---|
| Year 2023 | 2 |
| Year | Points |
|---|---|
| 2023 | 2 |
| 2022 | 3.2 |
| 2021 | 3.1 |
| 2020 | 3.1 |
| 2019 | 2.7 |
| 2018 | 2.3 |
| 2017 | 1.8 |
| 2016 | 1.8 |
| 2015 | 1.8 |
| 2014 | 1.8 |
| 2013 | 1.7 |
| 2012 | 1.7 |
| 2011 | 1.5 |
Impact Factor:
Sherpa Romeo:
Papers published in journal
Filters
total: 8
Catalog Journals
Year 2019
-
Method for Clustering of Brain Activity Data Derived from EEG Signals
PublicationA 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,...
Year 2017
-
Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph
PublicationA 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...
Year 2016
-
Important Facts and Observations about Pairwise Comparisons (the special issue edition)
PublicationThis 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...
Year 2014
-
An algorithm for listing all minimal double dominating sets of a tree
PublicationWe 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.
Year 2013
-
Adaptive Method of Adjusting Flowgraph for Route Reconstruction in Video Surveillance Systems
PublicationPawlak’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...
-
Music Recommendation Based on Multidimensional Description and Similarity Measures . Rekomendacja muzyki na podstawie wielowymiarowego wektora cech i miar podobieństwa
PublicationThis 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,...
Year 2012
-
Dynamic coloring of graphs
PublicationDynamics 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...
Year 2006
-
Efficient parallel query processing by graph ranking
PublicationW 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.
seen 720 times