Autor: Arabas, J. - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Evolutionary Computation for Global Optimization - Current Trends
Autorzy:: Arabas, J.
Powiązania:: https://bibliotekanauki.pl/articles/308443.pdf
Data publikacji:: 2011
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: evolutionary computation
global optimization
Opis:: This article comments on the development of Evolutionary Computation (EC) in the field of global optimization. A brief overview of EC fundamentals is provided together with the discussion of issues of parameter settings and adaptation, advances in the development of theory, new ideas emerging in the EC field and growing availability of massively parallel machines.
Źródło:: Journal of Telecommunications and Information Technology; 2011, 4; 5-10
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Benchmarking Procedures for Continuous Optimization Algorithms
Autorzy:: Opara, K.
Arabas, J.
Powiązania:: https://bibliotekanauki.pl/articles/308400.pdf
Data publikacji:: 2011
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: black-box optimization
comparing optimization algorithms
evaluation criteria
parallel computing
Opis:: Reliable comparison of optimization algorithms requires the use of specialized benchmarking procedures. This paper highlights motivations which influence their structure, discusses evaluation criteria of algorithms, typical ways of presenting and interpreting results as well as related statistical procedures. Discussions are based on examples from CEC and BBOB benchmarks. Moreover, attention is drawn to these features of comparison procedures, which make them susceptible to manipulation. In particular, novel application of the weak axiom of revealed preferences to the field of benchmarking shows why it may be misleading to assess algorithms on basis of their ranks for each of test problems. Additionally, an idea is presented of developing massively parallel implementation of benchmarks. Not only would this provide faster computation but also open the door to improving reliability of benchmarking procedures and promoting research into parallel implementations of optimization algorithms.
Źródło:: Journal of Telecommunications and Information Technology; 2011, 4; 73-80
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: Incrementally Solving Nonlinear Regression Tasks Using IBHM Algorithm
Autorzy:: Zawistowski, P.
Arabas, J.
Powiązania:: https://bibliotekanauki.pl/articles/308427.pdf
Data publikacji:: 2011
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: black-box modeling
neural networks
nonlinear approximation
nonlinear regression
support vector regression
weighted correlation
Opis:: This paper considers the black-box approximation problem where the goal is to create a regression model using only empirical data without incorporating knowledge about the character of nonlinearity of the approximated function. This paper reports on ongoing work on a nonlinear regression methodology called IBHM which builds a model being a combination of weighted nonlinear components. The construction process is iterative and is based on correlation analysis. Due to its iterative nature, the methodology does not require a priori assumptions about the final model structure which greatly simplifies its usage. Correlation based learning becomes ineffective when the dynamics of the approximated function is too high. In this paper we introduce weighted correlation coefficients into the learning process. These coefficients work as a kind of a local filter and help overcome the problem. Proof of concept experiments are discussed to show how the method solves approximation tasks. A brief discussion about complexity is also conducted.
Źródło:: Journal of Telecommunications and Information Technology; 2011, 4; 65-72
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 4.

Tytuł:: KIS: An automated attribute induction method for classification of DNA sequences
Autorzy:: Biedrzycki, R.
Arabas, J.
Powiązania:: https://bibliotekanauki.pl/articles/330979.pdf
Data publikacji:: 2012
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: klasyfikacja
optymalizacja
anotacja
wzorzec
classification
optimization
annotation
patterns
Opis:: This paper presents an application of methods from the machine learning domain to solving the task of DNA sequence recognition. We present an algorithm that learns to recognize groups of DNA sequences sharing common features such as sequence functionality. We demonstrate application of the algorithm to find splice sites, i.e., to properly detect donor and acceptor sequences. We compare the results with those of reference methods that have been designed and tuned to detect splice sites. We also show how to use the algorithm to find a human readable model of the IRE (Iron-Responsive Element) and to find IRE sequences. The method, although universal, yields results which are of quality comparable to those obtained by reference methods. In contrast to reference methods, this approach uses models that operate on sequence patterns, which facilitates interpretation of the results by humans.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2012, 22, 3; 711-721
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 5.

Tytuł:: Praktyczne aspekty modelowania i optymalizacji procesów przemysłowych
Practical aspects of modelling and optimizing industrial processes
Autorzy:: Arabas, J.
Domański, P.
Świrski, K.
Powiązania:: https://bibliotekanauki.pl/articles/151253.pdf
Data publikacji:: 1998
Wydawca:: Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Opis:: Omówiono niektóre możliwości wykorzystania zaawansowanych metod sterowania w systemach DCS. Sformułowano problemy aproksymacji odwzorowań i analizy skupień wykorzystywane w modelowaniu procesów przemysłowych. Przedstawiono narzędzia modelowania, klasyfikowane jako sztuczne sieci neuronowe i systemy z logika rozmytą. Omówiono wybrane metody wykorzystania modeli do sterowania i monitorowania procesu. Podano przykłady wykorzystania technik neuronowych i rozmytych w modelowaniu, monitorowaniu i sterowaniu, wzięte z dotychczasowych doświadczeń autorów.
Some possibilities of using the advanced control methods in the DCS systems are discussed. problems of approximating the mapping and analysis of clusters used in modelling industrial processes are formulated. Modelling tools classified as artificial neural networks and systems with fuzzy ligic are presented. Some selected methods of using the neutral and fuzzy techniques in modelling, monitoring and control, taken from the autorás engineering practice, are given.
Źródło:: Pomiary Automatyka Kontrola; 1998, R. 44, nr 6, 6; 195-202
0032-4140
Pojawia się w:: Pomiary Automatyka Kontrola
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 6.

Tytuł:: Performance Evaluation of Signaling in the IP QoS System
Autorzy:: Tarasiuk, H.
Śliwiński, J.
Arabas, P.
Jaskóła, P.
Góralski, W.
Powiązania:: https://bibliotekanauki.pl/articles/307864.pdf
Data publikacji:: 2011
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: IP QoS System
quality of service
signaling system
Opis:: The IP QoS System is based on next generation networks (NGN) and differentiated services (DiffServ) architectures. Its main part is a signaling system, which allows to send a request from a user to the system for establishing new connection with predefined quality of service assurance. In this paper we present trial results of the proposed signalling system. The experiments were performed to measure setup delay utilizing artificial call generator/analyzer. To obtain results we assumed different distributions of interarrival and call holding times based on the literature. The results show that the setup delay strongly depends on access time to network devices, however also on the assumed call holding time models.
Źródło:: Journal of Telecommunications and Information Technology; 2011, 3; 12-20
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 7.

Tytuł:: Maintaining the feasibility of hard real-time systems with a reduced number of priority levels
Autorzy:: Qureshi, M. B.
Alrashed, S.
Min-Allah, N.
Kołodziej, J.
Arabas, P.
Powiązania:: https://bibliotekanauki.pl/articles/330305.pdf
Data publikacji:: 2015
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: real time system
feasibility analysis
fixed priority scheduling
rate monotonic algorithm
online scheduling
system czasu rzeczywistego
analiza wykonalności
algorytm szeregowania
Opis:: When there is a mismatch between the cardinality of a periodic task set and the priority levels supported by the underlying hardware systems, multiple tasks are grouped into one class so as to maintain a specific level of confidence in their accuracy. However, such a transformation is achieved at the expense of the loss of schedulability of the original task set. We further investigate the aforementioned problem and report the following contributions: (i) a novel technique for mapping unlimited priority tasks into a reduced number of classes that do not violate the schedulability of the original task set and (ii) an efficient feasibility test that eliminates insufficient points during the feasibility analysis. The theoretical correctness of both contributions is checked through formal verifications. Moreover, the experimental results reveal the superiority of our work over the existing feasibility tests by reducing the number of scheduling points that are needed otherwise.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2015, 25, 4; 709-722
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

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

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język