Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "Niewiadomski, J." wg kryterium: Autor


Wyświetlanie 1-4 z 4
Tytuł:
Note onset detection in musical signals via neural-network-based multi-ODF fusion
Autorzy:
Stasiak, B.
Mońko, J.
Niewiadomski, A.
Powiązania:
https://bibliotekanauki.pl/articles/330895.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
note onset detection
onset detection function
multilayer perceptron
multi ODF fusion
NN-based fusion
początek detekcji
perceptron wielowarstwowy
sygnał muzyczny
Opis:
The problem of note onset detection in musical signals is considered. The proposed solution is based on known approaches in which an onset detection function is defined on the basis of spectral characteristics of audio data. In our approach, several onset detection functions are used simultaneously to form an input vector for a multi-layer non-linear perceptron, which learns to detect onsets in the training data. This is in contrast to standard methods based on thresholding the onset detection functions with a moving average or a moving median. Our approach is also different from most of the current machine-learning-based solutions in that we explicitly use the onset detection functions as an intermediate representation, which may therefore be easily replaced with a different one, e.g., to match the characteristics of a particular audio data source. The results obtained for a database containing annotated onsets for 17 different instruments and ensembles are compared with state-of-the-art solutions.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2016, 26, 1; 203-213
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Combining SMT and Simulated Annealing into a Hybrid Planning Method
Autorzy:
Skaruz, J.
Niewiadomski, A.
Penczek, W.
Powiązania:
https://bibliotekanauki.pl/articles/92934.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:
concrete planning
genetic algorithm
satisfiability modulo theories
simulated annealing
web service composition
planics
Opis:
We present a new approach to the concrete planning (CP) - a stage of theWeb service composition in the PlanICS framework. A new hybrid algorithm (HSA) based on a combination of Simulated Annealing (SA) with Satisfiability Modulo Theories (SMT) has been designed and implemented. The main idea of our hybrid solution is to use an SMT-based procedure in order to generate an initial individual and then improve it during subsequent iterations of SA. The experimental results show that HSA is superior to the other methods we have applied to the CP problem, including Genetic Algorithm, an SMT-based approach, and our previously developed hybrids.
Źródło:
Studia Informatica : systems and information technology; 2015, 1-2(19); 43-48
1731-2264
Pojawia się w:
Studia Informatica : systems and information technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Solving the abstract planning problem using genetic algorithms
Autorzy:
Skaruz, J.
Niewiadomski, A.
Penczek, W.
Powiązania:
https://bibliotekanauki.pl/articles/93024.pdf
Data publikacji:
2013
Wydawca:
Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:
abstract planning
genetic algorithms
web service composition
Opis:
The paper presents a new approach based on genetic algorithms to the abstract planning problem, which is the first stage of the web service composition problem. An abstract plan is defined as an equivalence class of sequences of service types that satisfy a user query. Intuitively, two sequences are equivalent if they are composed of the same service types, but not necessarily occurring in the same order. The objective of our genetic algorithm (GA) is to return representatives of abstract plans without generating all the equivalent sequences. The paper presents experimental results compared with the results obtained from SMT-solver, which show that GA finds solutions for very large sets of service types in a reasonable time.
Źródło:
Studia Informatica : systems and information technology; 2013, 1-2(17); 29-48
1731-2264
Pojawia się w:
Studia Informatica : systems and information technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Interval-valued linguistic summaries of databases
Autorzy:
Niewiadomski, A.
Ochelska, J.
Szczepaniak, P. S.
Powiązania:
https://bibliotekanauki.pl/articles/969963.pdf
Data publikacji:
2006
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
interval-valued fuzzy set
interval-valued linguistic variable
interval-valued linguistic quantifier
linguistic summary of database
interval-valued linguistic summary of database
Opis:
The so-called linguistic summaries of databases are the semi-natural language sentences that enable distilling the most relevant information from large numbers of tuples, and present it in the human consistent forms. Recently, the methods of constructing and evaluating linguistic summaries have been based on Zadeh's fuzzy sets, which represent uncertain data. The main aim of the paper is to enhance and generalize the Yager's approach to linguistic summarization of data. This enhancement is based on interval-valued fuzzy sets. The newly presented methods enable handling fuzzy concepts, whose membership degrees are not given by real values explicitly, but are approximated by intervals in [0,1]. From now on, the Yager's approach can be viewed as a special case of the method presented in this paper. Finally, illustrative examples are presented.
Źródło:
Control and Cybernetics; 2006, 35, 2; 415-443
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-4 z 4

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies